logo

Video encyclopedia

Church–Rosser theorem

2:16

What is CHURCH-ROSSER THEOREM? What does CHURCH-ROSSER THEOREM mean? CHURCH-ROSSER THEOREM meaning

1:45

Church–Rosser theorem

42:59

Volker Diekert: Recognizable languages are Church-Rosser congruential

3:12

What is CODD'S THEOREM? What does CODD'S THEOREM mean? CODD'S THEOREM meaning & explanation

0:17

Extending Rosser's Theorem

In mathematics and theoretical computer science, the Church–Rosser theorem states that, when applying reduction rules to terms in the lambda calculus, the ordering in which the reductions are chosen does not make a difference to the eventual result. More precisely, if there are two distinct reductions or sequences of reductions that can be applied to the same term, then there exists a term that is reachable from both results, by applying sequences of additional reductions. The theorem was proved in 1936 by Alonzo Church and J. Barkley Rosser, after whom it is named.