Skip to main content
Conference Proceedings

Weak orthogonality implies confluence: The higher-order case

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 813 LNCS 379-392
DOI: 10.1007/3-540-58140-5_35
40Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we prove confluence for weakly orthogonal Higher-Order Rewriting Systems. This generalises all the known ‘confluence by orthogonality’ results.

Cite

CITATION STYLE

APA

van Oostrom, V., & van Raamsdonk, F. (1994). Weak orthogonality implies confluence: The higher-order case. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 813 LNCS, pp. 379–392). Springer Verlag. https://doi.org/10.1007/3-540-58140-5_35

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