Types are Internal $\infty$-Groupoids
Logic in Computer Science
2021-05-04 v1 Category Theory
Abstract
By extending type theory with a universe of definitionally associative and unital polynomial monads, we show how to arrive at a definition of opetopic type which is able to encode a number of fully coherent algebraic structures. In particular, our approach leads to a definition of -groupoid internal to type theory and we prove that the type of such -groupoids is equivalent to the universe of types. That is, every type admits the structure of an -groupoid internally, and this structure is unique.
Keywords
Cite
@article{arxiv.2105.00024,
title = {Types are Internal $\infty$-Groupoids},
author = {Antoine Allioux and Eric Finster and Matthieu Sozeau},
journal= {arXiv preprint arXiv:2105.00024},
year = {2021}
}
Comments
Extended version of the LICS 2021 article