renaming rule

renaming rule

[rē′nām·iŋ ‚rül]
(mathematics)
A transformation rule in the lambda calculus that allows conflicts of variables to be eliminated; it states that a bound variable x in a lambda expression M may be uniformly replaced by some other bound variable y, provided y does not occur in M. Also known as alpha rule.
Mentioned in ?