Monoidal weak omega-categories as models of a type theory

by   Thibaut Benjamin, et al.

Weak ω-categories are notoriously difficult to define because of the very intricate nature of their axioms. Various approaches have been explored, based on different shapes given to the cells. Interestingly, homotopy type theory encompasses a definition of weak ω-groupoid in a globular setting, since every type carries such a structure. Starting from this remark, Brunerie could extract this definition of globular weak ω-groupoids, formulated as a type theory. By refining its rules, Finster and Mimram have then defined a type theory called CaTT, whose models are weak ω-categories. Here, we generalize this approach to monoidal weak ω-categories. Based on the principle that they should be equivalent to weak ω-categories with only one 0-cell, we are able to derive a type theory MCaTT whose models are monoidal categories. This requires changing the rules of the theory in order to encode the information carried by the unique 0-cell. The correctness of the resulting type theory is shown by defining a pair of translations between our type theory MCaTT and the type theory CaTT. Our main contribution is to show that these translations relate the models of our type theory to the models of the type theory CaTT consisting of ω-categories with only one 0-cell, by analyzing in details how the notion of models interact with the structural rules of both type theories.



There are no comments yet.


page 1

page 2

page 3

page 4


Globular weak ω-categories as models of a type theory

We study the dependent type theory CaTT, introduced by Finster and Mimra...

A Relative Theory of Interleavings

The interleaving distance, although originally developed for persistent ...

A Type Theory for Strictly Associative Infinity Categories

Many definitions of weak and strict ∞-categories have been proposed. In ...

Multinomial and Hypergeometric Distributions in Markov Categories

Markov categories, having tensors with copying and discarding, provide a...

Call-by-need, neededness and all that

We show that call-by-need is observationally equivalent to weak-head nee...

Type-theoretic weak factorization systems

This article presents three characterizations of the weak factorization ...

Formalization of dependent type theory: The example of CaTT

We present the type theory CaTT, originally introduced by Finster and Mi...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.