Strong reduction and normal form in combinatory logic

DOI10.2307/2271659MaRDI QIDQ5532527zbMATH OpenOpenAlexFDO

Authors 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

Cites work

• Types in combinatory logic

Cited in

(8)

• A solution to Curry and Hindley's problem on combinatory strong reduction
• Normal forms in combinatory logic
• Higher-order unification via combinators
• The Church Rosser theorem for strong reduction in combinatory logic
• scientific article; zbMATH DE number 1615232 (Why is no real title available?)
• Analytic Equational Proof Systems for Combinatory Logic and λ-Calculus:A Survey
• scientific article; zbMATH DE number 4195935 (Why is no real title available?)
• A combinatory logic approach to higher-order E-unification

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

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