A Short Proof of Curry's Normal Form Theorem

DOI10.2307/2037329zbMath0195.02101OpenAlexW4253714024MaRDI QIDQ5590804

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

Related Items (5)

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

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