I am not particularly knowledgeable in either lambda calculus or category theory, but I am starting to learn Haskell so I would like to ask: are there connections between category theory and lambda calculus? Could anyone describe those connections in layman's terms?
Asked
Active
Viewed 4,304 times
15
-
2One example might be the Curry-Howard-Lambek correspondence, see e.g. here and here. – dtldarek Dec 02 '13 at 07:49
-
2One should be careful here which "lambda calculus" one has in mind. Simply typed lambda calculus is the natural internal language of cartesian closed categories. Unityped (aka untyped) is not. – Aleš Bizjak Dec 02 '13 at 08:10
-
1This talk would be a very good answer to the question. – Jencel May 02 '16 at 10:09
1 Answers
13
Every model of a typed lambda calculus is a cartesian closed category.
Every cartesian closed category can be expressed as a typed lambda calculus (with the objects as types and arrows as terms).
Thus, typed lambda calculus and cartesian closed category are essentially the same concept.
Uday Reddy
- 1,031