Difference between revisions of "Beta reduction"
Jump to navigation
Jump to search
(I think my example actually included an eta-reduction as well as a beta conversion. Edited example.) |
BrettGiles (talk | contribs) (Add infobox) |
||
| Line 1: | Line 1: | ||
A ''beta reduction'' (also written ''β reduction'') is where you actually apply a lambda function to an expression to generate a result. |
A ''beta reduction'' (also written ''β reduction'') is where you actually apply a lambda function to an expression to generate a result. |
||
| + | {{Foundations infobox}} |
||
For example, suppose we have |
For example, suppose we have |
||
<haskell> |
<haskell> |
||
Revision as of 19:49, 1 February 2007
A beta reduction (also written β reduction) is where you actually apply a lambda function to an expression to generate a result.
For example, suppose we have
2*x*x + y
If we now replace every occurance of x with 7, we arrive at
2*7*7 + y
We have thus performed a beta reduction.
Also see Lambda calculus and the wikipedia lambda calculus article.