Combinatory reduction systems: introduction and survey
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
An algebraic interpretation of the lambda beta - calculus and a labeled lambda - calculus
Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
On Normalisation of Infinitary Combinatory Reduction Systems
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
On confluence of infinitary combinatory reduction systems
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Infinitary combinatory reduction systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Infinitary rewriting: from syntax to semantics
Processes, Terms and Cycles
Counterexamples in infinitary rewriting with non-fully-extended rules
Information Processing Letters
Highlights in infinitary rewriting and lambda calculus
Theoretical Computer Science
| Hi-index | 0.00 |
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.