Curry–Howard correspondence

Definition

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.

Related concepts

Abstract machine Academic Press Algebraic data type Analogy Andrey Kolmogorov Apply Arend Heyting Automath Axiom-scheme Axiom of choice Axiom scheme BHK interpretation Brouwer–Heyting–Kolmogorov interpretation Calculus of constructions Call-by-name Call-by-value Call-with-current-continuation Cartesian closed categories Categorical logic Category theory Classical logic Closed monoidal category Cobordism Combinatory logic Computer program Computer programming Continuation Continuation-passing style Corecursion Curry's paradox Curry (programming language)Currying Dag Prawitz Data type Deduction theorem Dependent type Dialectica interpretation Double-negation translation Eindhoven University of Technology Elsevier Elsevier Science Empty type Evaluation strategy Existential quantification Formal system Formula (mathematical logic)Free variables and bound variables Function application Function type Functional programming Genetic programming Gentzen Georg Kreisel Grothendieck topology Haskell Haskell Curry Higher-order logic Hilbert-style deduction system Homotopy Homotopy type theory Hypotheses INRIA Identity type Implication elimination Implication introduction Inference rules Institute for Advanced Study Internal language International Conference on Logic Programming and Automated Reasoning Intuitionism Intuitionistic Intuitionistic logic Intuitionistic type theory J. Roger Hindley Jean Gallier Joachim Lambek Jonathan P. Seldin Kolmogorov Kurt Gödel L. E. J. Brouwer Lambda-mu calculus Lambda calculus Linear logic Linear type system Logic programming Logical conjunction Logical disjunction Logical implication Logician Martin-Löf Mathematical induction Mathematical proof Mathematician Mathematics Modal logic Model of computation Modus ponens Monad (functional programming)Namesake Natural deduction Nicolaas Govert de Bruijn Normalization property (lambda-calculus)Open-source software Oxford University Press P.T. Johnstone Peirce's law Philip Wadler Principal type Product type Program correctness Programming language Programming language theory Proof-carrying code Proof assistant Proof calculus Proof theory Realizability Recursion (computer science)Relevant logic Return type Rocq Ruy de Queiroz Sequent Sequent calculus Set theory Simply typed lambda calculus Springer-Verlag Springer Science+Business Media Stephen Cole Kleene Stephen Kleene String theory Sum type System F Tautology (logic)Terminal object Thierry Coquand Total functional programming Turing completeness Type inhabitation problem Type systems Type theory Typed lambda calculus Typing context Typing rule Unit type Univalence axiom Universal quantification William Alvin Howard

26 concepts already in your glossary