| 释义 |
reduction rule reduction rule[ri′dək·shən ‚rül] (computer science) The principal computation rule in the lambda calculus; it states that an operator-operand combination of the form (λ xMA) may be transformed into the expression S x A M, obtained by substituting the lambda expression A for all instances of x in M, provided there are no conflicts of variable names. Also known as beta rule. |