Journal of Symbolic Logic

Exact Bounds for Lengths of Reductions in Typed $\lambda$-Calculus

Arnold Beckmann

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Abstract

We determine the exact bounds for the length of an arbitrary reduction sequence of a term in the typed $\lambda$-calculus with $\beta-, \xi$- and $\eta$-conversion. There will be two essentially different classifications, one depending on the height and the degree of the term and the other depending on the length and the degree of the term.

Article information

Source
J. Symbolic Logic, Volume 66, Issue 3 (2001), 1277-1285.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183746559

Mathematical Reviews number (MathSciNet)
MR1856741

Zentralblatt MATH identifier
1159.03305

JSTOR
links.jstor.org

Citation

Beckmann, Arnold. Exact Bounds for Lengths of Reductions in Typed $\lambda$-Calculus. J. Symbolic Logic 66 (2001), no. 3, 1277--1285. https://projecteuclid.org/euclid.jsl/1183746559


Export citation