A direct proof of the confluence of combinatory strong reduction
From MaRDI portal
Publication:732008
DOI10.1016/J.TCS.2009.04.017zbMATH Open1187.68125OpenAlexW1963536278MaRDI QIDQ732008FDOQ732008
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
Cites Work
- Title not available (Why is that?)
- Combinatory logic. Vol. II
- Title not available (Why is that?)
- Axioms for strong reduction in combinatory logic
- The decidability of hindley's axioms for strong reduction
- A solution to Curry and Hindley's problem on combinatory strong reduction
- Title not available (Why is that?)
Cited In (9)
- Strong reduction of combinatory calculus with streams
- Analytic Equational Proof Systems for Combinatory Logic and λ-Calculus:A Survey
- A solution to Curry and Hindley's problem on combinatory strong reduction
- Title not available (Why is that?)
- Barendregt's problem \#26 and combinatory strong reduction
- On confluence for weakly normalizing systems
- A compiled implementation of strong reduction
- The Church Rosser theorem for strong reduction in combinatory logic
- How to normalize the Jay
Recommendations
This page was built for publication: A direct proof of the confluence of combinatory strong reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732008)
