VTLUUG:2016-03-24: Difference between revisions
imported>Echarlie |
imported>Echarlie |
||
| 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 | ||
=== Alpha equivalence === | |||
* Variable name doesn't matter | |||
=== Beta reduction === | |||
Meat of Lambda calculus. | |||
Ex: | |||
<pre> | |||
(ƛx.x)2 | |||
(ƛ[x:=2x]) | |||
2 | |||
(ƛz.zz)(ƛy.yy) | |||
(ƛ[z:=(ƛ | |||
</pre> | |||
=== Currying === | |||
[[Category:VTLUUG:Meetings]] | [[Category:VTLUUG:Meetings]] | ||
[[Category:2016]] | [[Category:2016]] | ||