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.
|Name||Lecture Notes in Computer Science|
|Conference||Rewriting Techniques and Applications: 20th International Conference, RTA 2009|
|Period||29/06/09 → 1/07/09|
|Other||29 Jun - 1 Jul 2009|
- Infinitary Rewriting
- Böhm trees
- Higher-order rewriting