reduction rule
McGraw-Hill Science & Technology Dictionary:
Top
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.
Post a question - any question - to the WikiAnswers community:
Copyrights:
McGraw-Hill Science & Technology Dictionary
McGraw-Hill Dictionary of Scientific and Technical Terms. Copyright © 2003, 1994, 1989, 1984, 1978, 1976, 1974 by McGraw-Hill Companies, Inc. All rights reserved.
Read more
Mentioned in
reduction sequence
(mathematics)
aesthetics
(philosophy)
The Standard Deviants: Organic Chemistry, Part 3
(1997 Education Film)
Orthogonality
(term rewriting)
» More