A direct proof of the confluence of combinatory strong reduction
From MaRDI portal
(Redirected from Publication:732008)
Recommendations
Cites work
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- scientific article; zbMATH DE number 806614 (Why is no real title available?)
- scientific article; zbMATH DE number 3280068 (Why is no real title available?)
- A solution to Curry and Hindley's problem on combinatory strong reduction
- Axioms for strong reduction in combinatory logic
- Combinatory logic. Vol. II
- The decidability of hindley's axioms for strong reduction
Cited in
(14)- Strong reduction of combinatory calculus with streams
- Analytic Equational Proof Systems for Combinatory Logic and λ-Calculus:A Survey
- Strong normalization and confluence for reflexive combinatory logic
- A direct proof of the finite developments theorem
- A solution to Curry and Hindley's problem on combinatory strong reduction
- Decomposition of reduction
- scientific article; zbMATH DE number 2044492 (Why is no real title available?)
- 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
- Compositional Z: confluence proofs for permutative conversion
- How to normalize the Jay
- Effective reduction and conversion strategies for combinators
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)
