• Corpus ID: 244715184

Formalization of dependent type theory: The example of CaTT

  title={Formalization of dependent type theory: The example of CaTT},
  author={Thibaut Benjamin},
We present the type theory CaTT, originally introduced by Finster and Mimram to describe globular weak ω-categories, and we formalise this theory in the language of homotopy type theory. Most of the studies about this type theory assume that it is well-formed and satisfy the usual syntactic properties that dependent type theories enjoy, without being completely clear and thorough about what these properties are exactly. We use the formalisation that we provide to list and formally prove all of… 


Globular weak ω-categories as models of a type theory
We study the dependent type theory CaTT , introduced by Finster and Mimram, which presents the theory of weak ω -categories, following the idea that type theories can be considered as presentations
Type theory in type theory using quotient inductive types
The formalisation of type theory avoids referring to preterms or a typability relation but defines directly well typed objects by an inductive definition and uses the elimination principle to define the set-theoretic and logical predicate interpretation.
A type-theoretical definition of weak ω-categories
  • E. Finster, S. Mimram
  • Mathematics
    2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2017
This work provides a canonical type-theoretical characterization of pasting schemes as contexts which can be derived from inference rules, and presents an implementation of a corresponding proof system.
A Syntactical Approach to Weak omega-Groupoids
This work studies the formalisation of weak omega-groupoids in Type Theory, motivated by Voevodsky's proposal of univalent type theory which is incompatible with proof-irrelevance and the results by Lumsdaine and Garner/van de Berg showing that the standard eliminator for equality gives rise to a weak Omega-groupoid.
We show that for any type in Martin-Löf Intensional Type Theory, the terms of that type and its higher identity types form a weak ω-category in the sense of Leinster. Precisely, we construct a
And Still Another Definition of ∞-categories
The aim of this paper is to present a simplified version of the notion of ∞-groupoid developed by Grothendieck in “Pursuing Stacks” and to introduce a definition of ∞-categories inspired by
Internal Type Theory
We introduce categories with families as a new notion of model for a basic framework of dependent types. This notion is close to ordinary syntax and yet has a clean categorical description. We also
Types are weak ω‐groupoids
We define a notion of weak ω‐category internal to a model of Martin‐Löf's type theory, and prove that each type bears a canonical weak ω‐category structure obtained from the tower of iterated
Type Theory Should Eat Itself
Homotopy Type Theory : Univalent Foundations of Mathematics
These lecture notes are based on and partly contain material from the HoTT book and are licensed under Creative Commons Attribution-ShareAlike 3.0.