Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
In the effort to bring rewriting-based methods into contact with practical applications both in programing and in formal… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
Categorical Multi-Combinators form a rewriting system developed with the aim of providing efficient implementations of lazy… Expand
Is this relevant?
1996
1996
The proofs of the Church-Rosser theorems for β, η and β ∪ η reduction in untyped λ-calculus are formalized in Isabelle/HOL, an… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
1. Introduction 2. Analysis techniques for petri nets 3. S-systems and T-systems 4. Liveness in free choice 5. The coverability… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
1992
1992
We give a detailed, informal proof of the Church-Rosser property for the untyped lambda-calculus and show its representation in… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Abstract We present a nondeterministic calculus of closures for the evaluation of λ-calculus, which is based, not on symbolic… Expand
Is this relevant?
Highly Cited
1988
Highly Cited
1988
The Church-Rosser theorem is a celebrated metamathematical result on the lambda calculus. We describe a formalization and proof… Expand
  • figure 1
  • figure 2
Is this relevant?
1985
1985
Introduction. This paper contains a new proof of the Church-Rosser theorem for the typed λ-calculus, which also applies to… Expand
Is this relevant?
1974
1974
The central notion in a replacement system is one of a transformation on a set of objects. Starting with a given object, in one… Expand
  • figure 1
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
1973
Highly Cited
1973
Subtree replacement systems form a broad class of tree-manipulating systems. Systems with the “Church-Rosser property” are… Expand
  • figure 2
  • figure 3
  • figure 1
Is this relevant?