Compositional Z: Confluence Proofs for Permutative Conversion

Studia Logica 104 (6):1205-1224 (2016)
  Copy   BIBTEX

Abstract

This paper gives new confluence proofs for several lambda calculi with permutation-like reduction, including lambda calculi corresponding to intuitionistic and classical natural deduction with disjunction and permutative conversions, and a lambda calculus with explicit substitutions. For lambda calculi with permutative conversion, naïve parallel reduction technique does not work, and traditional notion of residuals is required as Ando pointed out. This paper shows that the difficulties can be avoided by extending the technique proposed by Dehornoy and van Oostrom, called the Z theorem: existence of a mapping on terms with the Z property concludes the confluence. Since it is still hard to directly define a mapping with the Z property for the lambda calculi with permutative conversions, this paper extends the Z theorem to compositional functions, called compositional Z, and shows that we can adopt it to the calculi.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,503

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Skew confluence and the lambda calculus with letrec.Zena M. Ariola & Stefan Blom - 2002 - Annals of Pure and Applied Logic 117 (1-3):95-168.
Topological Representation of the Lambda-Calculus.Steve Awodey - 2000 - Mathematical Structures in Computer Science 10 (1):81-96.
$lambdamu$-Calculus and Bohm's Theorem.Rene David & Walter Py - 2001 - Journal of Symbolic Logic 66 (1):407-413.
The Calculi of Lambda-conversion.Alonzo Church - 1985 - Princeton, NJ, USA: Princeton University Press.
Light affine lambda calculus and polynomial time strong normalization.Kazushige Terui - 2007 - Archive for Mathematical Logic 46 (3-4):253-280.
Introduction to Combinators and (Lambda) Calculus.J. Roger Hindley - 1986 - New York: Cambridge University Press. Edited by J. P. Seldin.
Recursion theory and the lambda-calculus.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):67-83.
A Gitik iteration with nearly Easton factoring.William J. Mitchell - 2003 - Journal of Symbolic Logic 68 (2):481-502.
Hypothetical Logic of Proofs.Eduardo Bonelli & Gabriela Steren - 2014 - Logica Universalis 8 (1):103-140.

Analytics

Added to PP
2016-05-21

Downloads
21 (#731,064)

6 months
5 (#626,991)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Natural deduction: a proof-theoretical study.Dag Prawitz - 1965 - Mineola, N.Y.: Dover Publications.
Natural Deduction: A Proof-Theoretical Study.Richmond Thomason - 1965 - Journal of Symbolic Logic 32 (2):255-256.
Some Properties of Conversion.Alonzo Church & J. B. Rosser - 1936 - Journal of Symbolic Logic 1 (2):74-75.

View all 6 references / Add more references