A direct proof of the confluence of combinatory strong reduction

DOI10.1016/j.tcs.2009.04.017zbMath1187.68125OpenAlexW1963536278MaRDI QIDQ732008

René David

Publication date: 9 October 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.04.017

zbMATH Keywords

confluencecombinatory logic

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A solution to Curry and Hindley's problem on combinatory strong reduction
• Combinatory logic. Vol. II
• Axioms for strong reduction in combinatory logic
• The decidability of hindley's axioms for strong reduction

This page was built for publication: A direct proof of the confluence of combinatory strong reduction