Curry–Howard_correspondence?useskin=vector
en.wikipedia.org · 6,771 words · saved by 1 readers
Couldn't find lead section for Curry–Howard_correspondence?useskin=vector
In programming language theory and proof theory, the Curry–Howard correspondence is a direct relationship between computer programs and mathematical proofs. It is also known as the Curry–Howard isomorphism or equivalence, or the proofs-as-programs and propositions- or formulae-as-types interpretation. It is a generalization of a syntactic analogy between systems of formal logic and computational calculi that was first discovered by the American mathematician Haskell Curry and the logician William Alvin Howard.[1] It is the link between logic and computation that is usually attributed to…
saved by
related reading
- Curry–Howard correspondence - Wikipediaen.wikipedia.org
- propositions-as-types.pdfhomepages.inf.ed.ac.uk
- Type theory - Wikipediaen.wikipedia.org
- Intuitionistic logic - Wikipediaen.wikipedia.org
- Lambda calculus - Wikipediaen.wikipedia.org
- Eat. Sleep. Math.eatsleepmath.tumblr.com
- Gödel's incompleteness theorems - Wikipediaen.wikipedia.org
- Language, Proof and Logichomepages.uc.edu
- canon00-goedel.pdfhirzels.com
- Bartosz Milewski's Programming Cafe | Category Theory, Haskell, Concurrency, C++bartoszmilewski.com
- Mathematics for Computer Sciencepeople.csail.mit.edu
- First-order logic - Wikipediaen.wikipedia.org