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.
2017
2017
On Upper Bounds on the Church-Rosser Theorem
The Church-Rosser theorem in the type-free lambda-calculus is well investigated both for beta-equality and beta-reduction. We… 
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… 
2008
2008
On combinations of propositional dynamic logic and doxastic modal logics
We prove completeness and decidability results for a family of combinations of propositional dynamic logic and unimodal doxastic… 
2003
2003
The Church-Rosser property in dual combinatory logic
Abstract Dual combinators emerge from the aim of assigning formulas containing ← as types to combinators. This paper investigates… 
1995
1995
Termination of term rewriting : well-foundedness, totality and transformations
Dit proefschrift gaat over eigenschappen van terminatie van herschrijfsystemen. We zullen eerst aan de hand van een voorbeeld… 
Review
1994
Review
1994
A programming logic based on type theory
• A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences… 
1991
1991
The Church-rosser theorem in orthogonal combinatory reduction systems
We introduce a notion of Combinatory Reduction Systems (CRSs) by extending the notion of Term Rewriting Systems (TRSs) with… 
Highly Cited
1990
Highly Cited
1990
A Semi-Functional Implementation of a Higher-Order Logic Programming Language
In this chapter we develop an interpreter of a higher-order constraint logic programming language in Standard ML (SML). The logic… 
1989
1989
Context-Free NCE Graph Grammars
The aim of this paper is to show some close relationships between context-free graph grammars and concepts from string language… 
1981
1981
Unique normal forms in term rewriting systems with repeated variables
A term rewriting system is a finite set of axiom schemata of the form A@@@@B where A and B are terms that contain variables. An… 
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)