Skip to content
scrambled
Programming Language Theory Concept

Alpha conversion/renaming

Books JourneyProgramming Language Theory Statuslearning Tags
  • lambda calculus
  • semantics

Example:

(λx. λy. x) y→[x→y]λy. x

Without alpha-conversion, performing a naive substitution would result in:

[x→y]λy. x=λy.  y

So, a function that was always returning a constant x becomes an identity function.

With alpha-conversion, we can correctly perform a substitution:

[x→y]λy. x=[x→y]λz. x=λz. y