Changes
no edit summary
Lambda Calculus forms the fundamentals of functional programming. If it can be described as a function,
it can be described in the lambda calculus and consequently written in Haskell
[https://linx.vtluug.org/selif/97s2gvcx.pdf Slides]
=== Alpha equivalence ===
(ƛx.x)2
(ƛ[x:=2]) x is bound to 2
2
</pre>
