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

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

#### 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.

Full-text: Remote access
If you are a member of the ASL, log in to Euclid for access.
Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.