|
gptkbp:instanceOf
|
gptkb:formal_semantics
gptkb:logic
|
|
gptkbp:basisFor
|
gptkb:Agda
gptkb:Coq
gptkb:Lean
gptkb:NuPRL
gptkb:Idris
|
|
gptkbp:field
|
gptkb:logic
computer science
|
|
gptkbp:hasAxiom
|
gptkb:Sigma-type
constructive logic
Pi-type
W-type
dependent types
empty type
extensionality axiom (optional)
function type
identity type
inductive types
natural numbers type
product type
propositions as types
sum type
uniqueness of identity proofs (optional)
unit type
univalence axiom (in homotopy type theory)
universe type
|
|
gptkbp:hasFeature
|
constructive logic
dependent types
identity types
inductive types
universe types
|
|
gptkbp:influenced
|
gptkb:homotopy_type_theory
dependently typed programming languages
modern proof assistants
|
|
gptkbp:influencedBy
|
gptkb:constructivism
intuitionistic logic
|
|
gptkbp:interpretedBy
|
gptkb:logic
gptkb:category_theory
proofs as programs
propositions as types
terms as elements
types as sets
|
|
gptkbp:introducedIn
|
1970s
|
|
gptkbp:namedAfter
|
gptkb:Per_Martin-Löf
|
|
gptkbp:relatedTo
|
gptkb:lambda_calculus
gptkb:Curry–Howard_correspondence
gptkb:homotopy_type_theory
gptkb:constructive_set_theory
gptkb:intuitionistic_type_theory
|
|
gptkbp:usedIn
|
gptkb:programming_language
gptkb:homotopy_type_theory
proof assistants
|
|
gptkbp:bfsParent
|
gptkb:Agda
gptkb:Per_Martin-Löf
gptkb:dependent_type_theory
gptkb:homotopy_type_theory
gptkb:Calculus_of_Constructions
gptkb:Calculus_of_Inductive_Constructions
gptkb:intuitionistic_type_theory
|
|
gptkbp:bfsLayer
|
7
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Martin-Löf type theory
|