Difference between revisions of "Lambda calculus"

From HaskellWiki
Jump to: navigation, search
m (Reverted edits by Tomjaguarpaw (talk) to last revision by BrettGiles)
m
 
Line 2: Line 2:
 
{{Foundations infobox}}
 
{{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 [https://iep.utm.edu/lambda-calculi 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 information on the matter: [http://en.wikipedia.org/wiki/Lambda_calculus Lambda calculus].

Latest revision as of 20:50, 16 August 2022

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 information on the matter: Lambda calculus.