Pages that link to "Curry–Howard correspondence"
Jump to navigation
Jump to search
The following pages link to Curry–Howard correspondence:
Displaying 50 items.
- Associative property (links)
- Automated theorem proving (links)
- Currying (links)
- Logical disjunction (links)
- Logical conjunction (links)
- Modus ponens (links)
- Mathematical logic (links)
- Type theory (links)
- Haskell Curry (links)
- Vacuous truth (links)
- Dialectic (links)
- History of logic (links)
- Intuitionistic logic (links)
- Proof theory (links)
- CH (links)
- Pattern matching (links)
- Correctness (computer science) (links)
- Constructive proof (links)
- Curry-Howard Isomorphism (redirect page) (links)
- Typing rule (links)
- Tagged union (links)
- Deduction theorem (links)
- Rocq (links)
- Constructive logic (links)
- List of functional programming topics (links)
- Structural rule (links)
- List of eponyms (A–K) (links)
- Setoid (links)
- Cut-elimination theorem (links)
- Bunched logic (links)
- Curry-Howard isomorphism (redirect page) (links)
- Structural proof theory (links)
- Call-with-current-continuation (links)
- Normal form (natural deduction) (links)
- Logic in computer science (links)
- First-class function (links)
- Formulae-as-types correspondence (redirect page) (links)
- Proof assistant (links)
- Curry Howard isomorphism (redirect page) (links)
- Per Martin-Löf (links)
- Brouwer–Heyting–Kolmogorov interpretation (links)
- Propositions as types principle (redirect page) (links)
- Epigram (programming language) (links)
- Dependent type (links)
- William Alvin Howard (links)
- Programming language theory (links)
- Bottom type (links)
- Agda (programming language) (links)
- Curry–Howard isomorphism (redirect page) (links)
- Functional programming (links)
- Lambda calculus (links)
- Intuitionism (links)
- Type theory (links)
- Natural deduction (links)
- Combinatory logic (links)
- Heyting algebra (links)
- Intuitionistic type theory (links)
- List of mathematical logic topics (links)
- Typed lambda calculus (links)
- Calculus of constructions (links)
- Continuation-passing style (links)
- System F (links)
- Proof-theoretic semantics (links)
- SKI combinator calculus (links)
- Simply typed lambda calculus (links)
- Lambda-mu calculus (links)
- Type inhabitation (links)
- Constructive set theory (links)