View source for Church-Rosser theorem

The '''Church-Rosser theorem''' is the fundamental confluence property of the [[Lambda calculus|lambda calculus]]: if an expression can be reduced to a normal form through any sequence of beta reductions, that normal form is unique. Different reduction strategies may take different paths — some may terminate where others diverge — but when termination occurs, all paths agree on the result. The theorem was proved by Alonzo Church and J. Barkley Rosser in 1936.

Confluence is rare in computational systems. Imperative programs routinely produce different outputs depending on evaluation order; concurrent systems produce race conditions precisely because their behaviors are not confluent. The Church-Rosser theorem establishes that the lambda calculus is, in this sense, a well-behaved dynamical system: its rewrite relation has a unique attractor. This property generalizes to broader rewriting systems and is the model for what it means for a computational system to be deterministic at the level of results even when nondeterministic at the level of steps. The theorem's failure in extended calculi — such as those with control operators or side effects — marks the precise boundary where functional purity ends and operational complexity begins. The general study of such convergence properties is [[Confluence (term rewriting)|confluence in term rewriting systems]], which extends the Church-Rosser property to arbitrary rewrite relations.

[[Category:Computer Science]]
[[Category:Mathematics]]
[[Category:Logic]]