Site Navigation
Categories:
category theory
Mathematical constructivism
Type theory
Logic in computer science
Summary Of: Intuitionistic type theory
Intuitionistic type theory was introduced by... Intuitionistic type theory is based on a certain analogy or isomorphism between...
Encyclodia Page On: Intuitionistic type theory
These Are Links To Other Documents
logical system
|
set theory
|
mathematical constructivism
|
Per Martin-Löf
|
Swedish
|
mathematician
|
philosopher
|
impredicative
|
predicative
|
extensional
|
intensional
|
propositions
|
types
|
Curry–Howard
|
propositional logic
|
simply typed lambda calculus
|
predicate logic
|
dependent types
|
intuitionistic logic
|
Brouwer
|
Heyting
|
Kolmogorov
|
BHK interpretation
|
set theory
|
connective
|
products
|
function space
|
real numbers
|
natural number
|
Curry-Howard isomorphism
|
implication
|
universal quantification
|
commutative
|
disjoint unions
|
Cartesian product
|
natural number
|
tuple
|
real numbers
|
Cartesian product
|
natural number
|
real number
|
Curry-Howard isomorphism
|
conjunction
|
existential quantification
|
unit type
|
Booleans
|
Curry-Howard isomorphism
|
negation
|
natural numbers
|
propositions as types principle
|
primitive recursion
|
induction
|
well-founded
|
Curry-Howard isomorphism
|
predicative
|
calculus of constructions
|
Girard
|
System F
|
Intuitionists
|
typed lambda calculus
|
category theory
|
locally cartesian closed category
|
extensional
|
intensional
|
undecidable
|
type checking
|
decidable
|
NuPRL
|
Coq
|
Agda
|
dependent types
|
programming languages
|
Dependent ML
|
Cayenne
|
Epigram
|
Calculus of constructions
|
Curry–Howard isomorphism
|
Intuitionistic logic
|
Martin-Löf, Per
|
Type theory
|
Typed lambda calculus
|
ISBN 0-201-41667-0
|
Categories
|
Mathematical constructivism
|
Type theory
|
Logic in computer science
|
This article is licensed under the
GNU Free Documentation License
. It uses material from the
Wikipedia article "Intuitionistic type theory"
.
