Lambda calculus

From HaskellWiki
Revision as of 18:39, 5 February 2007 by BrettGiles (talk | contribs) (foundations info box, category)
Jump to navigation Jump to search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.
Haskell theoretical foundations

General:
Mathematics - Category theory
Research - Curry/Howard/Lambek

Lambda calculus:
Alpha conversion - Beta reduction
Eta conversion - Lambda abstraction

Other:
Recursion - Combinatory logic
Chaitin's construction - Turing machine
Relational algebra

The lambda calculus is a formal mathematical system for expressing the notion of computation. Most functional programming languages are based upon the lambda calculus.

Wikipedia has more to say on the matter: Lambda calculus at Wikipedia.

Retrieved from "https://wiki.haskell.org/index.php?title=Lambda_calculus&oldid=11057"