The Churchâ€“Rosser theorem states that the reduction rule?s of the lambda calculus are confluent.

- Masako Takahashi,
*Parallel Reductions in $\lambda$-Calculus*, Journal of Symbolic Computation**7**2 (1989) 113-123 [doi:10.1006/inco.1995.1057]

See also:

- Wikipedia,
*Church-Rosser theorem*

Last revised on August 6, 2022 at 20:42:03. See the history of this page for a list of all contributions to it.