Curry–Howard correspondence

Known as: C–H correspondence, C–H equivalence, CH isomorphism 
In programming language theory and proof theory, the Curry–Howard correspondence (also known as the Curry–Howard isomorphism or equivalence, or the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
In this paper we introduce a term calculus B which adds to the affine λ-calculus with pairing a new construct allowing for a… (More)
  • figure 1
  • figure 3
  • figure 5
Is this relevant?
2016
2016
We present a variant of the calculus of deductive systems developed in [5, 6], and give a generalization of the Curry-Howard… (More)
Is this relevant?
2016
2016
Dummett’s logic LC is intuitionistic logic extended with Dummett’s axiom: for every two statements the first implies the second… (More)
  • figure 1
Is this relevant?
2016
2016
We present a new Curry-Howard correspondence for classical first-order natural deduction. We add to the lambda calculus an… (More)
Is this relevant?
2008
2008
  • Finn Lawler
  • 2008
We present the Curry–Howard correspondence for constructive logic via natural deduction, typed λ-calculus and cartesian closed… (More)
  • figure 1.4
  • figure 2.1
  • figure 2.3
Is this relevant?
Review
2008
Review
2008
4. Derivation and Computation: taking the Curry-Howard correspondence seriously by Harold Simmons. Review by Robert J. Irwin. My… (More)
Is this relevant?
2005
2005
The Curry-Howard isomorphism states that types are propositions and that programs are proofs. This allows programmers to state… (More)
Is this relevant?
2003
2003
We propose a method for realising the proofs of Intuitionistic Zermelo-Fraenkel set theory (IZF) by strongly normalising λ-terms… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1999
1999
This paper establishes a Curry-Howard isomorphism for compilation and program execution by showing the following facts. (1) The… (More)
  • figure 1
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We introduce the type theory ¿µv, a call-by-value variant of Parigot's ¿µ-calculus, as a Curry-Howard representation theory of… (More)
Is this relevant?