| Comparing Böhm-Like Trees (2009) | |||||||||||||
Abstract | |||||||||||||
| Extending the infinitary rewriting definition of Böhm-like trees to infinitary Combinatory Reduction Systems (iCRSs), we show that each Bö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. | |||||||||||||
Details der Publikation | |||||||||||||
| |||||||||||||