Lambda calculus

From HaskellWiki
Revision as of 15:18, 6 February 2021 by Gwern (talk | contribs) (Reverted edits by Tomjaguarpaw (talk) to last revision by BrettGiles)
Jump to navigation Jump to search
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=63887"