Church–Rosser theorem
theorem that, when applying reduction rules to terms in some variants of the lambda calculus, the ordering in which the reductions are chosen does not make a difference to the eventual result
Press Enter · cited answer in seconds
0 sources
Church–Rosser theorem
Summary
Church–Rosser theorem is a theorem[1]. It draws 72 Wikipedia views per month (theorem category, ranking #224 of 1,306).[2]
Key Facts
- Church–Rosser theorem's instance of is recorded as theorem[3].
- Alonzo Church is named after Church–Rosser theorem[4].
- J. Barkley Rosser is named after Church–Rosser theorem[5].
- Church–Rosser theorem's part of is recorded as list of theorems[6].
- Church–Rosser theorem's Freebase ID is recorded as /m/0139k0[7].
- Church–Rosser theorem's MathWorld ID is recorded as Church-RosserTheorem[8].
- Church–Rosser theorem's maintained by WikiProject is recorded as WikiProject Mathematics[9].
- Church–Rosser theorem's Microsoft Academic ID is recorded as 34222182[10].
Why It Matters
Church–Rosser theorem draws 72 Wikipedia views per month (theorem category, ranking #224 of 1,306).[2] It has Wikipedia articles in 8 language editions, a strong signal of global cultural recognition.[11]