Skip to search formSkip to main contentSkip to account menu

Church–Rosser theorem

Known as: Church-Rosser, Church-Rosser theorem 
In mathematics and theoretical computer science, the Church–Rosser theorem states that, when applying reduction rules to terms in the lambda calculus… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Abstract rewriting systemBeta normal formConfluence (abstract rewriting)Deductive lambda calculus

Broader (1)

Lambda calculus

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
A Simplified Proof of the Church–Rosser Theorem
Takahashi translation * is a translation which means reducing all of the redexes in a λ-term simultaneously. In [4] and [5… 
2004
2004
Partial Categorical Multi-Combinators and Church-Rosser Theorems
  • R. Lins
  • Journal of universal computer science (Online)
  • 2004
  • Corpus ID: 1086541
Categorical Multi-Combinators form a rewriting system developed with the aim of providing efficient implementations of lazy… 
Highly Cited
1995
Highly Cited
1995
Transfinite Reductions in Orthogonal Term Rewriting Systems
Strongly convergent reduction is the fundamental notion of reduction in infinitary orthogonal term rewriting systems (OTRSs). For… 
Highly Cited
1995
Highly Cited
1995
Free choice Petri nets
1. Introduction 2. Analysis techniques for petri nets 3. S-systems and T-systems 4. Liveness in free choice 5. The coverability… 
Highly Cited
1991
Highly Cited
1991
An Abstract Framework for Environment Machines
Highly Cited
1985
Highly Cited
1985
Operational Semantics for Order-Sorted Algebra
Highly Cited
1984
Highly Cited
1984
On the Church-Rosser property for the direct sum of term rewriting systems
The direct sum of two term rewriting systems is the union of systems having disjoint sets of function symbols. It is shown that… 
1981
1981
The Church-Rosser theorem for the typed λ-calculus with surjective pairing
Introduction The Church-Rosser theorem will be proved for a system obtained from the typed λ-calculus by adding pairing and… 
Review
1975
Review
1975
Church-Rosser theorems for replacement systems
Replacement systems with the Church-Rosser property promise to be of great interest for the theory of parallel programming… 
1969
1969
An Abstract form of the church-rosser theorem. I
One of the basic results in the theory of λ-conversion is the Church-Rosser Theorem, which says that, using certain rules for… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)