Journal of Symbolic Logic · 2001 · 44 citations · 4 references
ComputingComputer ScienceAlgebraProgramming LanguagesTheory Of ComputationComputational ComplexityType SystemsLambda CalculusLower BoundsReductionsTyped Lambda Calculus
Abstract We determine the exact bounds for the length of an arbitrary reduction sequence of a term in the typed λ -calculus with β -, ξ - and η -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.
4
Harold T. Hodes, Henk Barendregt · The Philosophical Review · 1988 · 567 citations
Notes on Simply Typed Lambda Calculus
Ralph Loader · 1998 · 22 citations
Computing, Computer Science, Logic +13