The Church-Rosser property in symmetric combinatory logic
From MaRDI portal
Publication:5718674
DOI10.2178/jsl/1120224727zbMath1090.03003OpenAlexW2153418127MaRDI QIDQ5718674
Publication date: 16 January 2006
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1120224727
Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Combinatory logic and lambda calculus (03B40)
Cites Work
- Unnamed Item
- Unnamed Item
- Investigation into combinatory systems with dual combinators
- Semantics for dual and symmetric combinatory calculi
- Proof by cases in formal logic
- A symmetric lambda calculus for classical program extraction
- Combinatory logic. Vol. II
- Combinators and structurally free logic
- An Abstract form of the church-rosser theorem. I
- Tree-Manipulating Systems and Church-Rosser Theorems
This page was built for publication: The Church-Rosser property in symmetric combinatory logic