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.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
Copyright © 2003-2025 Farlex, Inc
Disclaimer
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.