The Standardization Theorem for λ‐Calculus

DOI10.1002/malq.19790250104zbMath0442.03013OpenAlexW2036609822MaRDI QIDQ3884083

G. Mitschke

Publication date: 1979

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19790250104

zbMATH Keywords

lambda calculusstandard reduction

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (6)

Upper bounds for standardizations and an application ⋮ Standard and Normal Reductions ⋮ Analytic proof systems for \(\lambda\)-calculus: the elimination of transitivity, and why it matters ⋮ The IO- and OI-hierarchies ⋮ Expressive power of typed and type-free programming languages ⋮ Perpetual reductions in \(\lambda\)-calculus

This page was built for publication: The Standardization Theorem for λ‐Calculus