Church-Rosser theorem

英語（米国） (en-US) 英語（イギリス） (en-GB)

固有名詞

(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.

日本語の意味

ラムダ計算において、縮退（リダクション）規則の適用順序が最終結果に影響を及ぼさず、どの順序で適用しても同じ結果に至ることを保証する数学・計算理論上の定理

英語の意味

(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.

このボタンはなに？

Computer scientists often invoke the Church-Rosser theorem to argue that the order of beta-reductions does not affect the final normal form of a lambda expression.

コンピュータ科学者はしばしばチャーチ＝ロッサーの定理を引用して、ベータ簡約の順序がラムダ式の最終的な正規形に影響を与えないことを説明する。

詳細

意味（1）

(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.

the Church-Rosser theorem （ canonical ）