
The Curry-Howard correspondence is a connection between computer science and mathematics that's really cool. It shows how certain mathematical concepts, like logic and type theory, can be applied to programming languages.
This idea was first discovered by Haskell Curry and Per Martin-Löf, two mathematicians and computer scientists who worked on type theory. They found that certain mathematical proofs could be translated into programs, and vice versa.
The Curry-Howard correspondence is based on the idea that a mathematical proof can be seen as a program that computes the truth of a statement. This means that the structure of the proof is closely related to the structure of the program.
Here's an interesting read: Claude 3 Sentient
History
The Curry-Howard correspondence has a rich history that spans several decades. It all started with the BHK interpretation of intuitionistic logic, which identifies a proposition with the collection of its proofs. This view was first proposed by Kolmogorov in the 1930s.
A key figure in the development of the Curry-Howard correspondence was Dana Scott, who wrote "Constructive Validity" in the 1960s. This work was heavily influenced by the BHK interpretation. Independently, Per Martin-Löf was also working on related ideas during this time.
The Curry-Howard correspondence was further developed by several mathematicians, including William Howard, William Tait, and Per Martin-Löf, who were all involved in the late 1960s and early 1970s in Chicago. William Lawvere, another influential figure, lectured on hyperdoctrines during this time, and his work was also influenced by the Curry-Howard correspondence.
De Bruijn's Role
N. G. de Bruijn played a significant role in the development of the Curry-Howard correspondence.
De Bruijn used the lambda notation for representing proofs in the theorem checker Automath, which was a crucial contribution to the field.
In the late 1960s, de Bruijn worked independently of Howard, stating the correspondence without knowledge of Howard's work.
De Bruijn represented propositions as "categories" of their proofs, a concept that is now an integral part of the Curry-Howard correspondence.
Some researchers prefer to use the term Curry-Howard-de Bruijn correspondence to acknowledge de Bruijn's contributions.
Origin, Scope, and Consequences
The history of a particular event or phenomenon is often complex and multifaceted. Understanding its origin, scope, and consequences is crucial to grasping its significance.

The origin of the event can be traced back to a specific date or period, marked by a significant turning point or catalyst. This turning point was often a result of a combination of factors, including social, economic, and political circumstances.
The scope of the event refers to its extent and impact, which can be far-reaching and affect various aspects of society. In some cases, the consequences of the event can be devastating, leading to widespread suffering and loss.
The consequences of the event can be both immediate and long-term, with some effects lasting for generations. The event's impact on the environment, economy, and social structures can have a lasting impact on the community.
Understanding the origin, scope, and consequences of the event is essential to learning from its mistakes and successes. By analyzing the event's history, we can gain valuable insights into the complexities of human behavior and the importance of responsible decision-making.
Key Concepts
In Haskell, the logical connective ∨ is handled in the manner described by Intuitionistic Logic, where the value returned indicates which proposition is true.
The type system in Haskell incorporates the logical connectives ∧ and ∨, though heavily disguised. The ∧ conjuction is handled via an isomorphism in Closed Cartesian Categories, where a function from X×Y to Z can be represented as a function that takes an argument of type X and returns another function of type Y→Z.
Functional dependencies in Haskell are set-theoretic, defining a relation between types and requiring that there would not be different instances of a type class for different values.
The Curry-Howard correspondence shows that logic and computation are fundamentally linked, with types corresponding to logical formulas and programs corresponding to logical proofs.
In the Curry-Howard correspondence, types correspond to logical formulas, programs correspond to logical proofs, and evaluation corresponds to simplification of proofs.
Here are some key concepts related to the Curry-Howard correspondence:
- Types correspond to logical formulas (aka propositions)
- Programs correspond to logical proofs
- Evaluation corresponds to simplification of proofs
The Curry-Howard correspondence is a deep phenomenon that links the fields of programming and logic, discovered by many people working in many areas. It has been named after logicians Haskell Curry and William Howard.
Logic and Proof
In classical logic, Peirce's law ((α → β) → α) → α is a fundamental axiom that can be mapped to a programming concept called call-with-current-continuation.
The double-negation translation used in classical logic corresponds to the continuation-passing-style translation in programming, which is used to map lambda terms involving control to pure lambda terms.
A finer Curry–Howard correspondence exists for classical logic, where several conclusions in sequents are allowed, resulting in a more nuanced correspondence between logic and programming.
A program is a proof that the type of the program is inhabited, as the type checker must verify that the program is well-typed.
Type checking rules for variables, functions, and pairs can be translated into logical rules for proving propositions, demonstrating the correspondence between programs and proofs.
Here's a summary of the correspondence between logic and programming:
This correspondence between logic and programming is a fundamental aspect of the Curry–Howard correspondence, which reveals the deep connection between mathematical logic and computational theory.
Sequent Calculus
Sequent calculus is a formalism that can be used to express proofs as programs, but it's not a correspondence with a well-defined pre-existing model of computation like Hilbert-style and natural deductions. This is because sequent calculus has left introduction rules, right introduction rules, and a cut rule that can be eliminated.
The structure of sequent calculus is related to a calculus whose structure is close to that of some abstract machines. The informal correspondence between the logic side and the programming side is as follows:
This correspondence shows how sequent calculus can be related to programming concepts, but it's not a direct correspondence like the one in Hilbert-style and natural deductions.
Computability
Computability is a fundamental concept in logic and proof. It's about whether a problem can be solved using a mechanical procedure, like a computer program.
A computable function is one that can be calculated using an algorithm, or a step-by-step procedure. This is a key idea in computability theory, which is all about what can and can't be computed.
Computable analysis is a branch of mathematics that focuses on functions that can be computed, rather than just being defined. This is a more constructive approach to mathematics, which is related to intuitionistic mathematics.
Computable sets are sets that can be enumerated using a computable function. This is a useful concept in computability theory, and it's related to the idea of persistent homology.
The Church-Turing thesis is a fundamental idea in computability theory, which states that any effectively calculable function can be computed by a Turing machine. This is a powerful idea that has far-reaching implications for logic and proof.
Type Theory
Type theory is a fundamental aspect of the Curry-Howard correspondence. It's a way of understanding how mathematical logic and computer science are connected.
In type theory, we have a set of rules that govern how we can form and manipulate types. These rules are called the type formation rule, term introduction rule, term elimination rule, and computation rule. These rules are the building blocks of type theory, and they're used to define the behavior of types in various contexts.
One of the key concepts in type theory is the idea of propositions as types. This means that we can think of mathematical statements as being equivalent to types. For example, a type might represent a proposition that's true, and a proof of that proposition would be a term of that type.
Here's a table showing some of the equivalences between type theory and mathematical logic:
In homotopy type theory, we can think of types as being equivalent to homotopy types (∞-groupoids). This means that we can represent mathematical statements as being equivalent to spaces, and proofs as being equivalent to paths between those spaces.
The Curry-Howard correspondence has far-reaching implications for computer science and mathematical logic. It shows that there's a deep connection between the two fields, and that many concepts in one field have direct analogs in the other. This connection has led to the development of new programming languages and tools, such as Coq and Agda, which are designed to help with both programming and proving.
Constructivism, Realizability, Computability
Constructivism, realizability, and computability are all closely related concepts that have been explored in the context of the Curry-Howard correspondence. Constructivism is a branch of mathematics that focuses on constructive proofs, where a mathematical statement is considered true only if a constructive proof can be provided.
In constructive mathematics, topos and homotopy topos are key concepts that have been developed. Type theory, including homotopy type theory, is also a crucial area of study. This involves the use of canonical forms, univalence, and the concept of h-sets, which are similar to Bishop sets.
Decidable equality, decidable subsets, inhabited sets, and subsingletons are all important concepts in constructive mathematics. These ideas have been influential in shaping our understanding of computability and realizability.
One influential work in this area is William Tait's unpublished manuscript, "The completeness of intuitionistic first-order logic." Anne Sjerp Troelstra's book, "History of Constructivism in the 20th Century", published in 1991, provides a comprehensive overview of the history of constructivism in the 20th century.
In the context of the Curry-Howard correspondence, the concepts of propositions as types and proofs as programs are central. This idea is often referred to as computational trinitarianism.
Related Topics
The Curry-Howard correspondence has far-reaching implications in the world of computer science and mathematics.
One of the key concepts related to the Curry-Howard correspondence is proof relevance, which suggests that the meaning of a proof is closely tied to the meaning of the proposition being proved.
Computational trinitarianism is another concept that's related to the Curry-Howard correspondence. It's an idea that suggests that a mathematical statement, a proof, and a program are all equivalent and can be translated into one another.
The Curry-Howard correspondence is also connected to the concept of propositions as types. This idea, first proposed by Per Martin-Löf, suggests that mathematical statements can be seen as types in a programming language.
The Curry-Howard correspondence has been explored in various papers and books, including "Intuitionistic Type Theory" by Per Martin-Löf and "Type Theory and Functional Programming" by Simon Thompson. These works delve into the connections between type theory, functional programming, and the Curry-Howard correspondence.
Here are some key related concepts:
- proof relevance
- computational trinitarianism
- propositions as types
- propositions as projections
- propositional logic as a dependent type theory
These concepts are not only intellectually fascinating but also have practical applications in the development of programming languages and mathematical theories.
Applications
The Curry-Howard correspondence has far-reaching implications in various fields. Its applications are numerous and impactful.
In proof theory, the correspondence allows us to translate mathematical theorems into functional programs, and vice versa. This means that a proof of a theorem can be translated into a program that computes the theorem's statement.
This direct mapping between proofs and programs has led to the development of proof assistants like Coq and Agda. These tools use the Curry-Howard correspondence to verify the correctness of mathematical proofs and functional programs.
Other Applications
The Curry-Howard correspondence has far-reaching implications beyond its mathematical significance. It constitutes an argument against the patentability of software.
This is because algorithms are essentially mathematical proofs, which raises the question of whether patentability of the former would imply patentability of the latter. A theorem could be private property, forcing mathematicians to pay for using it.
This idea challenges the notion that mathematical concepts can be owned and patented. A mathematician would have to trust the company that sells a theorem, keeping its proof secret and rejecting responsibility for any errors.
Books

Books on the Curry-Howard Isomorphism are a great resource for understanding its applications.
The seminal papers of Curry-Feys and Howard, a paper by de Bruijn, and a few other papers are reproduced in "The Curry-Howard Isomorphism" edited by Philippe de Groote.
If you're interested in notes on proof theory and type theory, "Lectures on the Curry-Howard isomorphism" by Morten Heine Sørensen and Paweł Urzyczyn is a great option.
Jean-Yves Girard's "Proof and Types" offers notes on proof theory with a presentation of the Curry-Howard correspondence.
Simon Thompson's "Type Theory and Functional Programming" provides a comprehensive look at type theory.
For a more computer science-focused approach, "Adapting Proofs-as-Programs: The Curry-Howard Protocol" by Iman Poernomo, John Crossley, Martin Wirsing, and others is a great resource.
Here are some key books on the Curry-Howard isomorphism:
- The Curry-Howard Isomorphism by Philippe de Groote (1995)
- Lectures on the Curry-Howard isomorphism by Morten Heine Sørensen and Paweł Urzyczyn (2006)
- Proof and Types by Jean-Yves Girard (1987-1990)
- Type Theory and Functional Programming by Simon Thompson (1991)
- Adapting Proofs-as-Programs: The Curry-Howard Protocol by Iman Poernomo, John Crossley, Martin Wirsing, and others (2005)
Proofs-as-Programs
The Curry-Howard correspondence is a powerful idea that reveals a deep connection between programming and logic. Every program is a proof that the type of the program is inhabited, since the type checker must verify that the program is well typed.
This means that a program can be seen as a proof of a logical proposition. For example, a program that swaps the components of a pair is a proof that you can swap the types involved. In fact, the proof tree of a program's type corresponds to the proof tree of a logical proposition.
The proof rules for typing a program correspond to the rules for proving a proposition. This is known as the Curry-Howard correspondence, and it enables us to read programs as proofs. A program corresponds to a proof of the logical formula to which its type corresponds.
Here's a summary of the correspondence:
- A program e : t corresponds to a proof of the logical formula to which t itself corresponds.
- The proof tree of |- t corresponds to the proof tree of {} |- e : t.
- The proof rules for typing a program correspond to the rules for proving a proposition.
This correspondence is not just a theoretical idea, but it has practical applications in programming and logic. By understanding the Curry-Howard correspondence, we can write more expressive and meaningful programs that are closer to the underlying logic of the problem.
Featured Images: pexels.com





