Creative Commons Attribution 4.0 license (CC BY 4.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TYPES.2021.2
URN: urn:nbn:de:0030-drops-167719
URL: https://drops.dagstuhl.de/opus/volltexte/2022/16771/
Benjamin, Thibaut
Formalisation of Dependent Type Theory: The Example of CaTT
| pdf-format: |
|
Abstract
We present the type theory CaTT, originally introduced by Finster and Mimram to describe globular weak ω-categories, formalise this theory in the language of homotopy type theory and discuss connections with the open problem internalising higher structures. 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 our formalisation to list and formally prove all of these meta-properties, thus filling a gap in the foundational aspect. We discuss the aspects of the formalisation inherent to CaTT. We present the formalisation in a way that not only handles the type theory CaTT but also related type theories that share the same structure, and in particular we show that this formalisation provides a proper ground to the study of the theory MCaTT which describes the globular monoidal weak ω-categories. The article is accompanied by a development in the proof assistant Agda to check the formalisation that we present.
BibTeX - Entry
@InProceedings{benjamin:LIPIcs.TYPES.2021.2,
author = {Benjamin, Thibaut},
title = {{Formalisation of Dependent Type Theory: The Example of CaTT}},
booktitle = {27th International Conference on Types for Proofs and Programs (TYPES 2021)},
pages = {2:1--2:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-254-9},
ISSN = {1868-8969},
year = {2022},
volume = {239},
editor = {Basold, Henning and Cockx, Jesper and Ghilezan, Silvia},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16771},
URN = {urn:nbn:de:0030-drops-167719},
doi = {10.4230/LIPIcs.TYPES.2021.2},
annote = {Keywords: Dependent type theory, homotopy type theory, higher categories, formalisation, Agda, proof assistant}
}
| Keywords: | Dependent type theory, homotopy type theory, higher categories, formalisation, Agda, proof assistant | |
| Seminar: | 27th International Conference on Types for Proofs and Programs (TYPES 2021) | |
| Issue date: | 2022 | |
| Date of publication: | 04.08.2022 | |
| Supplementary Material: | Software (Agda Source Code): https://github.com/thibautbenjamin/catt-formalization archived at: https://archive.softwareheritage.org/swh:1:dir:db3f3e900b7541e07a7f19b1d895daa7fedbadd5 |
