1.Previous
3.Next

notions of "equivalence" and "reduction" that make it possible to reduce lambda terms to equivalent lambda terms.
* ?-conversion captures the intuition that the particular choice of a bound variable, in an abstraction, does not (usually) matter. If , then the terms and are considered alpha-equivalent, written . The equivalence relation is the smallest congruence relation on lambda terms generated by this rule. For instance, and are alpha-equivalent lambda terms.
* The ?-reduction rule states that a ?-redex, an application of the

1.Previous
3.Next