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
Programming in equational logic: beyond strong sequentiality
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
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
A unified computation model for functional and logic programming
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Solving Combinatorial Problems with a Constraint Functional Logic Language
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
Normalisation in Weakly Orthogonal Rewriting
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
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
Logic Programs as term Rewriting Systems
ALP '94 Proceedings of the 4th International Conference on Algebraic and Logic Programming
Infinitary combinatory reduction systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
On Normalisation of Infinitary Combinatory Reduction Systems
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Infinitary rewriting: from syntax to semantics
Processes, Terms and Cycles
| Hi-index | 0.00 |
We prove that fully-extended, orthogonal infinitary combinatory reduction systems with finite right-hand sides are confluent modulo identification of hypercollapsing subterms. This provides the first general confluence result for infinitary higher-order rewriting.