| 释义 |
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 SxAM, 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. |