Difference between revisions of "Lambda calculus"

From HaskellWiki
Jump to: navigation, search
(Deleting page that hasn't been edited for over 10 years)
m (Reverted edits by Tomjaguarpaw (talk) to last revision by BrettGiles)
 
Line 1: Line 1:
  +
[[Category:Glossary]]
  +
{{Foundations infobox}}
  +
  +
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: [http://en.wikipedia.org/wiki/Lambda_calculus Lambda calculus at Wikipedia].

Latest revision as of 15:18, 6 February 2021

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.