In mathematics and theoretical computer science, the Church–Rosser theorem states that, when applying reduction rules to terms in the lambda calculus… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Ken-etsu Fujita
- WPTE@FSCD
- 2016

The Church-Rosser theorem in the type-free λ-calculus is well investigated both for β-equality and β-reduction. We provide a new… (More)

Is this relevant?

2014

2014

- Yuichi Komori, Naosuke Matsuda, Fumika Yamakawa
- Studia Logica
- 2014

Takahashi translation ∗ is a translation which means reducing all of the redexes in a λ-term simultaneously. In [4] and [5… (More)

Is this relevant?

1995

1995

- Ole Rasmussen
- 1995

This paper describes a proof of the Church-Rosser theorem for the pure-calculus formalised in the Isabelle theorem prover. The… (More)

Is this relevant?

1995

1995

- Gerhard Buntrock, Friedrich Otto
- STACS
- 1995

The growing context-sensitive languages are characterized by a nondeterministic machine model, the so-called shrinking two… (More)

Is this relevant?

1992

1992

- Frank Pfenning
- 1992

We give a detailed, informal proof of the Church-Rosser property for the untyped λ-calculus and show its representation in LF… (More)

Is this relevant?

1989

1989

- Hirofumi Yokouchi
- Theor. Comput. Sci.
- 1989

This paper develops the Church-Rosser theorem for the rewriting system CCLB on type-free categorical combinators introduced by… (More)

Is this relevant?

1988

1988

- Natarajan Shankar
- J. ACM
- 1988

The Church-Rosser theorem is a celebrated metamathematical result on the lambda calculus. We describe a formalization and proof… (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- Robert McNaughton, Paliath Narendran, Friedrich Otto
- J. ACM
- 1988

Since about 1971, much research has been done on Thue systems that have properties that ensure viable and efficient computation… (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- Yoshihito Toyama
- J. ACM
- 1987

The direct sum of two term rewriting systems is the union of systems having disjoint sets of function symbols. It is shown that… (More)

Is this relevant?

Highly Cited

1970

Highly Cited

1970

- Barry K. Rosen
- STOC
- 1970

Subtree replacement systems form a broad class of tree-manipulating systems. Systems with the “Church-Rosser property”… (More)

Is this relevant?