Skip to main content
Conference Proceedings

On confluence of infinitary combinatory reduction systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3835 LNAI 199-214
DOI: 10.1007/11591191_15
8Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Ketema, J., & Simonsen, J. G. (2005). On confluence of infinitary combinatory reduction systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3835 LNAI, pp. 199–214). https://doi.org/10.1007/11591191_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free