Quick definitions from Wiktionary (Church-rosser theorem)
▸ noun: (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.
▸ Words similar to Church-Rosser Theorem
▸ Usage examples for Church-Rosser Theorem
▸ Idioms related to Church-Rosser Theorem (New!)
▸ Words that often appear near Church-Rosser Theorem
▸ Rhymes of Church-Rosser Theorem
▸ Invented words related to Church-Rosser Theorem
▸ noun: (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.
▸ Words similar to Church-Rosser Theorem
▸ Usage examples for Church-Rosser Theorem
▸ Idioms related to Church-Rosser Theorem (New!)
▸ Words that often appear near Church-Rosser Theorem
▸ Rhymes of Church-Rosser Theorem
▸ Invented words related to Church-Rosser Theorem