Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2111.14736 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910695938850816 |
|---|---|
| author | Benjamin, Thibaut |
| author_facet | Benjamin, Thibaut |
| contents | 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 these meta-properties, thus filling a gap in the foundational aspect. We discuss the key aspects of the formalisation inherent to the theory CaTT, in particular that the absence of definitional equality greatly simplify the study, but also that specific side conditions are challenging to properly model. We present the formalisation in a way that not only handles the type theory CaTT but also all the 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 actually check the formalisation that we present. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2111_14736 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Formalization of dependent type theory: The example of CaTT Benjamin, Thibaut Logic in Computer Science Category Theory 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 these meta-properties, thus filling a gap in the foundational aspect. We discuss the key aspects of the formalisation inherent to the theory CaTT, in particular that the absence of definitional equality greatly simplify the study, but also that specific side conditions are challenging to properly model. We present the formalisation in a way that not only handles the type theory CaTT but also all the 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 actually check the formalisation that we present. |
| title | Formalization of dependent type theory: The example of CaTT |
| topic | Logic in Computer Science Category Theory |
| url | https://arxiv.org/abs/2111.14736 |