nLab
term model

Contents

Context

Type theory

natural deduction metalanguage, practical foundations

  1. type formation rule
  2. term introduction rule
  3. term elimination rule
  4. computation rule

type theory (dependent, intensional, observational type theory, homotopy type theory)

syntax object language

computational trinitarianism = propositions as types +programs as proofs +relation type theory/category theory

logiccategory theorytype theory
trueterminal object/(-2)-truncated objecth-level 0-type/unit type
falseinitial objectempty type
proposition(-1)-truncated objecth-proposition, mere proposition
proofgeneralized elementprogram
cut rulecomposition of classifying morphisms / pullback of display mapssubstitution
cut elimination for implicationcounit for hom-tensor adjunctionbeta reduction
introduction rule for implicationunit for hom-tensor adjunctioneta conversion
logical conjunctionproductproduct type
disjunctioncoproduct ((-1)-truncation of)sum type (bracket type of)
implicationinternal homfunction type
negationinternal hom into initial objectfunction type into empty type
universal quantificationdependent productdependent product type
existential quantificationdependent sum ((-1)-truncation of)dependent sum type (bracket type of)
equivalencepath space objectidentity type
equivalence classquotientquotient type
inductioncolimitinductive type, W-type, M-type
higher inductionhigher colimithigher inductive type
completely presented setdiscrete object/0-truncated objecth-level 2-type/preset/h-set
setinternal 0-groupoidBishop set/setoid
universeobject classifiertype of types
modalityclosure operator, (idemponent) monadmodal type theory, monad (in computer science)
linear logic(symmetric, closed) monoidal categorylinear type theory/quantum computation
proof netstring diagramquantum circuit
(absence of) contraction rule(absence of) diagonalno-cloning theorem
synthetic mathematicsdomain specific embedded programming language

homotopy levels

semantics

Category theory

Contents

Idea

Given a (dependent) type theory, then its term model is a model which consists of exactly those types and terms which may be constructed (via the relevant natural deduction operations) in the type theory.

The term model is supposed to be is the initial object in the category of all models of the given type theory.

e.g. Hofmann, example 1

Under the relation between type theory and category theory the term model is a category, essentially the syntactic category of the type theory.

References

  • Martin Hofmann, On the interpretation of type theory in locally cartesian closed categories (pdf)

  • Alexandre Buisse, Peter Dybjer, Towards Formalizing Categorical Models of Type Theory in Type Theory, 2007 (pdf)

  • Peter Aczel, What is a type theory and what should a type theory be?, 2012 (pdf, pdf)

Last revised on February 1, 2015 at 23:20:36. See the history of this page for a list of all contributions to it.