Curry–Howard_correspondence?useskin=vector

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

• Rishi Kothari

related reading

• Curry–Howard correspondence - Wikipediaen.wikipedia.org
• Rice's theoremen.wikipedia.org
• propositions-as-types.pdfhomepages.inf.ed.ac.uk
• Lambda calculus - Wikipediaen.wikipedia.org
• Type theory - Wikipediaen.wikipedia.org
• Intuitionistic logic - Wikipediaen.wikipedia.org
• Gödel's incompleteness theorems - Wikipediaen.wikipedia.org
• Curry's paradox - Wikipediaen.wikipedia.org
• The Church-Turing Thesis (Stanford Encyclopedia of Philosophy)plato.stanford.edu
• First-order logic - Wikipediaen.wikipedia.org
• Arithmetical hierarchy - Wikipediaen.wikipedia.org
• Schröder–Bernstein theorem - Wikipediaen.wikipedia.org