|(2 intermediate revisions by 2 users not shown)|
Latest revision as of 19:54, 13 July 2007
|Haskell theoretical foundations|
A lambda abstraction is another name for an anonymous function. It gets its name from the usual notation for writing it: for example, . (Another common, equivalent notation is: .)In Haskell source code, the Greek letter lambda is replaced by a backslash character ('
\ x -> x * x
There is actually a whole mathematical theory devoted to expressing computation entirely using lambda abstractions: the lambda calculus. Most functional programming languages (including Haskell) are based upon some extension of this idea.
When a lambda abstraction is applied to a value—for instance, —the result of the expression is determined by replacing every free occurrence of the parameter variable (in this case x) with the parameter value (in this case 7). This is a beta reduction.