Difference between revisions of "Lambda calculus"

From HaskellWiki
Jump to navigation Jump to search
m (Lambda Calculus moved to Lambda calculus)
m
 
(3 intermediate revisions by 3 users not shown)
Line 1: Line 1:
  +
[[Category:Glossary]]
⚫
The ''lambda calculus'' is a formal mathematical system for expressing the notion of computation. Most functional programming languages are based upon the lambda calculus.
  
  +
{{Foundations infobox}}
   
  ⚫
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.

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