Corpus ID: 221507831

# Internal $\infty$-Categorical Models of Dependent Type Theory: Towards 2LTT Eating HoTT

@inproceedings{Kraus2020InternalM,
title={Internal \$\infty\$-Categorical Models of Dependent Type Theory: Towards 2LTT Eating HoTT},
author={Nicolai Kraus},
year={2020}
}
Using dependent type theory to formalise the syntax of dependent type theory is a very active topic of study and goes under the name of “type theory eating itself” or “type theory in type theory.” Most approaches are at least loosely based on Dybjer’s categories with families (CwF’s) and come with a type Con of contexts, a type family Ty indexed over it modelling types, and so on. This works well in versions of type theory where the principle of unique identity proofs (UIP) holds. In homotopy… Expand

#### References

SHOWING 1-10 OF 90 REFERENCES
Type theory in a type theory with quotient inductive types
The syntax of a basic type theory with dependent function space, a base type and a family over the base type is defined as a quotient inductive inductive type (a special case of higher inductive types from homotopy type theory). Expand
Two-Level Type Theory and Applications
• Computer Science, Mathematics
• ArXiv
• 2017
2LTT is a framework which is suitable for formulating additional axioms that one might want to add to HoTT, and a collection of tools are set up with the goal of making 2LTT a convenient language for future developments. Expand
Models of type theory with strict equality
This thesis introduces the idea of two-level type theory, an extension of Martin-Lof type theory that adds a notion of strict equality as an internal primitive, and develops a semantic framework that gives a systematic account of type formers for two- level systems, and proves a conservativity result relating back to a conventional type theory like HoTT. Expand
2-Dimensional Directed Type Theory
• Computer Science, Mathematics
• MFPS
• 2011
A 2-dimensional directed type theory, or 2DTT, is described, validated by an interpretation into the strict 2-category Cat of categories, functors, and natural transformations, which associates each type with a directed notion of transformation between its elements. Expand
Natural models of homotopy type theory
• S. Awodey
• Mathematics, Computer Science
• Mathematical Structures in Computer Science
• 2016
It is shown that a category admits a natural model of type theory if it has a class of maps that behave like the abstract fibrations in axiomatic homotopy theory: They should be stable under pullback, closed under composition and relative products, and there should be weakly orthogonal factorizations into the class. Expand
Extending type theory with syntactic models
This thesis is about the metatheory of intuitionnistic type theory, which is the construction of syntactic models, which are models reusing type theory to interpret type theory. Expand
Categorical structures for type theory in univalent foundations
• Computer Science, Mathematics
• Log. Methods Comput. Sci.
• 2018
This paper analyze and compare three of the many algebraic structures that have been used for modeling dependent type theories: categories with families, split type-categories, and representable maps of presheaves, and construct maps between the various types of structures, and show that assuming the Univalence axiom, some of the comparisons are equivalences. Expand
A type theory for synthetic ∞-categories
• Mathematics
• 2018
We propose foundations for a synthetic theory of $(\infty,1)$-categories within homotopy type theory. We axiomatize a directed interval type, then define higher simplices from it and use them toExpand
From type theory to setoids and back
A model of Martin-Lof extensional type theory with universes is formalized in Agda, an interactive proof system based on Martin-Lof intensional type theory. This may be understood, we claim, as aExpand
A Syntax for Higher Inductive-Inductive Types
• Computer Science
• FSCD
• 2018
This paper proposes a general definition of HIITs using a domain-specific type theory and shows that for indexed W-types and various examples ofHIITs the computed elimination principles are the expected ones. Expand