Overview
Let -term contain an occurrence of , and let . The act of replacing this occurrence of with is called a change of bound variable or an -conversion in .
If can be changed to -term by a finite series of changes of bound variables, we shall say is congruent to , or -converts to , or .
Let , , and be distinct variables. Then
Substitution is well-defined with respect to -conversion. That is, if and , then
Simultaneous Substitution
Substitution can be generalized in the natural way to define simultaneous substitution for . As in equivalence-transformation, simultaneous substitution is different from sequential substitution.
Bibliography
- Hindley, J Roger, and Jonathan P Seldin. “Lambda-Calculus and Combinators, an Introduction,” n.d. https://www.cin.ufpe.br/~djo/files/Lambda-Calculus%20and%20Combinators.pdf.