A solution to Curry and Hindley's problem on combinatory strong reduction

DOI10.1007/s00153-008-0109-zzbMath1172.03009OpenAlexW2031719710MaRDI QIDQ1014284

Pierluigi Minari

Publication date: 27 April 2009

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-008-0109-z

zbMATH Keywords

extensionalityconfluencecombinatory logicstrong combinatory reduction

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07) Combinatory logic and lambda calculus (03B40)

Related Items (3)

Analytic Equational Proof Systems for Combinatory Logic and λ-Calculus:A Survey ⋮ A direct proof of the confluence of combinatory strong reduction ⋮ Strong reduction of combinatory calculus with streams

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatory logic. With two sections by William Craig.
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Analytic proof systems for \(\lambda\)-calculus: the elimination of transitivity, and why it matters
• Analytic combinatory calculi and the elimination of transitivity
• The Church Rosser theorem for strong reduction in combinatory logic
• Modified strong reduction in combinatory logic
• A standardization theorem for strong reduction
• Combinatory logic. Vol. II
• Combinators, \(\lambda\)-terms and proof theory
• Strong reduction and normal form in combinatory logic
• Axioms for strong reduction in combinatory logic
• The decidability of hindley's axioms for strong reduction
• A Short Proof of Curry's Normal Form Theorem

This page was built for publication: A solution to Curry and Hindley's problem on combinatory strong reduction