Personal tools

Lambda calculus

From HaskellWiki

(Difference between revisions)
Jump to: navigation, search
m
m (foundations info box, category)
 
(One intermediate revision by one user not shown)
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.
 
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].
+
Wikipedia has more to say on the matter: [http://en.wikipedia.org/wiki/Lambda_calculus Lambda calculus at Wikipedia].

Latest revision as of 18:39, 5 February 2007

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.