Church-Rosser theorem

(mathematics, computing theory) A theorem stating that, when applying reduction rules to terms in the lambda calculus, the ordering in which the reductions are chosen makes no difference to the eventual result.