Abstract
In this paper a short proof is presented for confluence of a quite general class of reduction systems, containing λ-calculus and term rewrite systems: the orthogonal combinatory reduction systems. Combinatory reduction systems (CRSs for short) were introduced by Klop generalizing an idea of Aczel. In CRSs, the usual first-order term rewriting format is extended with binding structures for variables. This permits to express besides first order term rewriting also λ-calculus, extensions of λ-calculus and proof normalizations. Confluence will be proved for orthogonal CRSs, that is, for those CRSs having left-linear rules and no critical pairs. The proof proceeds along the lines of the proof of Tait and Martin-Löf for confluence of λ-calculus, but uses a different notion of ”parallel reduction” as employed by Aczel. It gives rise to an extended notion of development, called ”superdevelopment”. A superdevelopment is a reduction sequence in which besides redexes that descend from the initial term also some redexes that are created during reduction may be contracted. For the case of λ-calculus, all superdevelopments are proved to be finite. A link with the confluence proof is provided by proving that superdevelopments characterize exactly the Aczel's notion of ”parallel reduction” used in order to obtain confluence.
supported by NWO/SION project 612-316-606 Extensions of orthogonal rewrite systems — syntactic properties.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Aczel. A general Church-Rosser theorem. Technical report, University of Manchester, 1978.
H.P. Barendregt. The Lambda Calculus, its Syntax and Semantics. North Holland, second edition, 1984.
R. Hindley. The equivalence of complete reductions. Transactions of the American Mathematical Society, 229:227–248, 1977.
S. Kahrs. λ-rewriting. PhD thesis, Universität Bremen, 1991.
Z. Khasidashvili. Church-Rosser theorem in orthogonal combinatory reduction systems. Technical Report 1824, INRIA Rocquencourt, 1992.
J.W. Klop. Combinatory Reduction Systems. Mathematical Centre Tracts Nr. 127. CWI, Amsterdam, 1980. PhD Thesis.
J.-J. Lévy. Réductions correctes et optimales dans le lambda-calcul. PhD thesis, Université de Paris VII, 1978.
T. Nipkow. Orthogonal higher-order rewrite systems are confluent. In M. Bezem and J.F. Groote, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications, pages 306–317, Utrecht, 1993. Springer LNCS 664.
M.J. O'Donnell. Computing in Systems described by Equations. Lecture Notes in Computer Science 58. Springer-Verlag, 1977.
B.K. Rosen. Tree-manipulating systems and Church-Rosser theorems. JACM, 20(1):160–187, 1973.
M. Takahashi. λ-calculi with conditional rules. In M. Bezem and J.F. Groote, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications, pages 306–317, Utrecht, 1993. Springer LNCS 664.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Raamsdonk, F. (1993). Confluence and superdevelopments. In: Kirchner, C. (eds) Rewriting Techniques and Applications. RTA 1993. Lecture Notes in Computer Science, vol 690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21551-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-662-21551-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56868-1
Online ISBN: 978-3-662-21551-7
eBook Packages: Springer Book Archive