Jump to content

Lambda abstraction

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 64.12.96.199 (talk) at 10:09, 19 February 2003. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A lambda abstraction is a lambda expression. It is expressed in the language of lambda calculus. A lambda abstraction is to a functional programming language such as Scheme what pseudo-code is to an imperative programming language.

More specifically, a lambda abstraction is a lambda expression with no free variables: all its variables are bound by some lambda. E.g. f (f (f x)) is a concrete expression, whereas &lambdaf. &lambdax. f (f (f x)) is an abstract lambda expression.