Strong reduction and normal form in combinatory logic

DOI10.2307/2271659zbMath0153.00602OpenAlexW2066870718MaRDI QIDQ5532527

Bruce Lercher

Publication date: 1967

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

mathematical logic

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

Cites Work

• Types in combinatory logic

This page was built for publication: Strong reduction and normal form in combinatory logic