Rewrite, rewrite, rewrite, rewrite, rewrite, …
Selected papers of the 16th international colloquium on Automata, languages, and programming
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
Transfinite reductions in orthogonal term rewriting systems
Information and Computation
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Higher-Order Narrowing with Definitional Trees
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
On Normalisation of Infinitary Combinatory Reduction Systems
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Applications of infinitary lambda calculus
Information and Computation
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Infinitary Combinatory Reduction Systems
Information and Computation
Counterexamples in infinitary rewriting with non-fully-extended rules
Information Processing Letters
On confluence of infinitary combinatory reduction systems
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Infinitary rewriting: from syntax to semantics
Processes, Terms and Cycles
Skew and ω-skew confluence and abstract Böhm semantics
Processes, Terms and Cycles
Highlights in infinitary rewriting and lambda calculus
Theoretical Computer Science
| Hi-index | 0.00 |
We define infinitary combinatory reduction systems (iCRSs). This provides the first extension of infinitary rewriting to higher-order rewriting. We lift two well-known results from infinitary term rewriting systems and infinitary λ-calculus to iCRSs: every reduction sequence in a fully-extended left-linear iCRS is compressible to a reduction sequence of length at most ω, and every complete development of the same set of redexes in an orthogonal iCRS ends in the same term.