The Standardization Theorem for λ‐Calculus

DOI10.1002/MALQ.19790250104zbMATH Open0442.03013OpenAlexW2036609822MaRDI QIDQ3884083FDOQ3884083

Authors: 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)

Cited In (7)

• Upper bounds for standardizations and an application
• Perpetual reductions in \(\lambda\)-calculus
• 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
• Factorization and normalization, essentially

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3884083)