Personal tools

Beta reduction

From HaskellWiki

(Difference between revisions)
Jump to: navigation, search
(Improvements in wording?)
 
(2 cents on wording / links.)
Line 1: Line 1:
A ''beta reduction'' (also written ''β reduction'') is basically 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.
   
 
For example, suppose we have
 
For example, suppose we have
Line 12: Line 12:
   
 
[[Category:Glossary]]
 
[[Category:Glossary]]
  +
  +
Also see [[Lambda calculus]] and the [http://en.wikipedia.org/wiki/Lambda_calculus wikipedia lambda calculus article].

Revision as of 00:42, 30 January 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

(\x y -> 2*x*x + y) 7
If we now replace every occurance of
x
with 7, we arrive at
\y -> 2*7*7 + y

We have thus performed a beta reduction.

Also see Lambda calculus and the wikipedia lambda calculus article.