(Difference between revisions)
(I think my example actually included an eta-reduction as well as a beta conversion. Edited example.)
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.
|Haskell theoretical foundations|
For example, suppose we have
If we now replace every occurance of
2*x*x + y
with 7, we arrive at
2*7*7 + y
We have thus performed a beta reduction.