Editing Church–Rosser theorem (section)

==Variants==
The Church–Rosser theorem also holds for many variants of the lambda calculus, such as the [[simply typed lambda calculus]], many calculi with advanced [[type system]]s, and [[Gordon Plotkin]]'s beta-value calculus. Plotkin also used a Church–Rosser theorem to prove that the evaluation of [[functional program]]s (for both [[lazy evaluation]] and [[eager evaluation]]) is a function from programs to values (a [[subset]] of the lambda terms).

In older research papers, a rewriting system is said to be Church–Rosser, or to have the Church–Rosser property, when it is [[confluence (abstract rewriting)|confluent]].