Analytic proof systems for λ-calculus: the elimination of transitivity, and why it matters [Book Review]

Archive for Mathematical Logic 46 (5-6):385-424 (2007)
  Copy   BIBTEX

Abstract

We introduce new proof systems G[β] and G ext[β], which are equivalent to the standard equational calculi of λβ- and λβη- conversion, and which may be qualified as ‘analytic’ because it is possible to establish, by purely proof-theoretical methods, that in both of them the transitivity rule admits effective elimination. This key feature, besides its intrinsic conceptual significance, turns out to provide a common logical background to new and comparatively simple demonstrations—rooted in nice proof-theoretical properties of transitivity-free derivations—of a number of well-known and central results concerning β- and βη-reduction. The latter include the Church–Rosser theorem for both reductions, the Standardization theorem for β- reduction, as well as the Normalization (Leftmost reduction) theorem and the Postponement of η-reduction theorem for βη-reduction

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 96,349

External links

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

Through your library

Analytics

Added to PP
2013-11-23

Downloads
47 (#371,088)

6 months
15 (#313,824)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Pierluigi Minari
Università degli Studi di Firenze

Citations of this work

Add more citations

References found in this work

Introduction to Combinators and (Lambda) Calculus.J. Roger Hindley - 1986 - New York: Cambridge University Press. Edited by J. P. Seldin.
Introduction to Combinators and λ-Calculus.J. Roger Hindley & Jonathan P. Seldin - 1988 - Journal of Symbolic Logic 53 (3):985-986.
The Standardization Theorem for λ‐Calculus.Gerd Mitschke - 1979 - Mathematical Logic Quarterly 25 (1-2):29-31.
Analytic combinatory calculi and the elimination of transitivity.Pierluigi Minari - 2004 - Archive for Mathematical Logic 43 (2):159-191.
The Standardization Theorem for λ‐Calculus.Gerd Mitschke - 1979 - Mathematical Logic Quarterly 25 (1‐2):29-31.

View all 6 references / Add more references