A Short Proof of Curry's Normal Form Theorem

DOI10.2307/2037329zbMATH Open0195.02101OpenAlexW4253714024MaRDI QIDQ5590804FDOQ5590804

Authors: Bruce Lercher, Roger Hindley 

Publication date: 1970

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2037329

zbMATH Keywords

recursion theory, constructive mathematics

Cited In (5)

• Normal forms in combinatory logic
• Analytic Equational Proof Systems for Combinatory Logic and λ-Calculus:A Survey
• Higher-order unification via combinators
• A solution to Curry and Hindley's problem on combinatory strong reduction
• A combinatory logic approach to higher-order E-unification

This page was built for publication: A Short Proof of Curry's Normal Form Theorem

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