An abstract Church-Rosser theorem. II: Applications

DOI10.2307/2272337zbMath0291.02015OpenAlexW2062393768MaRDI QIDQ4041549

Roger Hindley

Publication date: 1974

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272337

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items

Reductions of Residuals are Finite, Standard and Normal Reductions, History and basic features of the critical-pair/completion procedure, Speeding up subtree replacement systems, Shallow confluence of conditional term rewriting systems, Descendants and origins in term rewriting., A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser, The Equivalence of Complete Reductions

Cites Work

• A mathematical logic without variables. I
• Functionals defined by recursion
• Combinatory logic. Vol. II
• On theories with a combinatorial definition of 'equivalence'
• Intensional interpretations of functionals of finite type I
• Tree-Manipulating Systems and Church-Rosser Theorems