@inproceedings{cefb885eb96b4263aeabd7aa6f36a5c1,
title = "Comparing B{\"o}hm-Like Trees",
abstract = "Extending the infinitary rewriting definition of B{\"o}hm-like trees to infinitary Combinatory Reduction Systems (iCRSs), we show that each B{\"o}hm-like tree defined by means of infinitary rewriting can also be defined by means of a direct approximant function. In addition, we show that counterexamples exists to the reverse implication.",
keywords = "METIS-263922, Infinitary Rewriting, B{\"o}hm trees, EWI-15709, Higher-order rewriting, CR-F.3, CR-F.4, IR-67804",
author = "J. Ketema",
note = "10.1007/978-3-642-02348-4_17 ; Rewriting Techniques and Applications: 20th International Conference, RTA 2009 ; Conference date: 29-06-2009 Through 01-07-2009",
year = "2009",
month = jun,
doi = "10.1007/978-3-642-02348-4_17",
language = "Undefined",
isbn = "978-3-642-02347-7",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "239--254",
editor = "R. Treinen",
booktitle = "Rewriting Techniques and Applications: 20th International Conference, RTA 2009",
address = "Germany",
}