VTLUUG:2016-03-24: Difference between revisions
imported>Echarlie |
imported>Pew No edit summary |
||
| (4 intermediate revisions by one other user not shown) | |||
| Line 41: | Line 41: | ||
Lambda Calculus forms the fundamentals of functional programming. If it can be described as a function, | 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 | it can be described in the lambda calculus and consequently written in Haskell | ||
[https://linx.vtluug.org/selif/97s2gvcx.pdf Slides] | |||
=== Alpha equivalence === | === Alpha equivalence === | ||
| Line 56: | Line 58: | ||
(ƛx.x)2 | (ƛx.x)2 | ||
(ƛ[x:=2]) x is bound to 2 | (ƛ[x:=2]) x is bound to 2 | ||
2 | 2 | ||
</pre> | </pre> | ||