Skip to main content
Conference Proceedings

Confluence without termination via parallel critical pairs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1996) 1059 211-225
DOI: 10.1007/3-540-61064-2_39
24Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a new criterion for confluence of (possibly) nonterminating left-linear term rewriting systems. The criterion is based on certain strong joinability properties of parallel critical pairs. We show how this criterion relates to other well-known results, consider some speciM cases and discuss some possible extensions.

Cite

CITATION STYLE

APA

Gramlich, B. (1996). Confluence without termination via parallel critical pairs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1059, pp. 211–225). Springer Verlag. https://doi.org/10.1007/3-540-61064-2_39

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