natural deduction metalanguage, practical foundations
type theory (dependent, intensional, observational type theory, homotopy type theory)
computational trinitarianism = propositions as types +programs as proofs +relation type theory/category theory
One may interpret mathematical logic as being a formal language for talking about the collection of monomorphisms into a given object of a given category: the poset of subobjects of that object.
More generally, one may interpret type theory and notably dependent type theory as being a formal language for talking about slice categories, consisting of all morphisms into a given object.
Conversely, starting with a given theory of logic or a given type theory, we say that it has a categorical semantics if there is a category such that the given theory is that of its slice categories, if it is the internal logic of that category.
For the general idea, for the moment see at type theory the section An introduction for category theorists and see at relation between type theory and category theory.
We discuss how to interpret judgements of dependent type theory in a given category $\mathcal{C}$ with finite limits. For more see categorical model of dependent types.
Write $cod : \mathcal{C}^I \to \mathcal{C}$ for its codomain fibration, and write
for the corresponding classifying functor, the self-indexing
that sends an object of $\mathcal{C}$ to the slice category over it, and sends a morphism $f : \Gamma \to \Gamma'$ to the pullback/base change functor
We give now rules for choices “$[x y z]$” that associate with every string “$x y z$” of symbols in type theory objects and morphisms in $\mathcal{C}$. A collection of such choices following these rules is an interpretation / a choice of categorical semantics of the type theory in the category $\mathcal{C}$.
The empty context $()$ in type theory is interpreted as the terminal object of $\mathcal{C}$
If $\Gamma$ is a context which has already been given an interpretation $[\Gamma] \in Obj(\mathcal{C})$, then a judgement of the form
is interpreted as an object in the slice over $\Gamma$
hence as a choice of morphism
in $\mathcal{C}$.
If a judgement of the form $\Gamma \vdash A : Type$ has already found an interpretation, as above, then an extended context of the form $(\Gamma, x : A)$ is interpreted as the domain object $[(\Gamma, x : A)]$ of the above choice of morphism.
Assume for a context $\Gamma$ and a judgement $\Gamma \vdash A : Type$ we have already chosen an interpretation $[\Gamma, x : A] \stackrel{[\Gamma \vdash A : Type]}{\to} [\Gamma]$ as above.
A judgement of the form $\Gamma \vdash a : A$ (a term of type $A$) is to be interpreted as a section of this morphism, equivalently as a morphism in $\mathcal{C}_{/\Gamma}$
from the terminal object to $[\Gamma \vdash A : Type]$, which in $\mathcal{C}$ is a commuting triangle
For a term $\Gamma \vdash a : A$ the context $\Gamma$ is the collection of free variables in $a$.
(…)
Assume that interpretations for judgements
and
have been given as above. Then the substitution judgement
is to be interpreted as follows. The interpretation of the first two terms corresponds to a diagram in $\mathcal{C}$ of the form
The interpretation of the substitution statement is then the pullback
hence the morphism in $\mathcal{C}$ that universally completes the above diagram as
See categorical semantics of homotopy type theory.
A standard textbook reference for categorical semantics of logic is section D1.2 of
The categorical semantics of dependent type theory in locally cartesian closed categories is essentially due to
For more references on this see at relation between category theory and type theory.
Lecture notes on this include for instance.
Martin Hofmann, Syntax and semantics of dependent types, Semantics and Logics of Computation (P. Dybjer and A. M. Pitts, eds.), Publications of the Newton Institute, Cambridge University Press, Cambridge, (1997) pp. 79-130. (web, )
Roy Crole, Categories for types
See also section B.3 of
A comprehensive definition of semantics of homotopy type theory in type-theoretic model categories is in section 2 of
Last revised on March 13, 2019 at 07:17:17. See the history of this page for a list of all contributions to it.