A Type Theory for Strictly Associative Infinity Categories

09/03/2021
by   Eric Finster, et al.
0

Many definitions of weak and strict ∞-categories have been proposed. In this paper we present a definition for ∞-categories with strict associators, but which is otherwise fully weak. Our approach is based on the existing type theory Catt, whose models are known to correspond to weak ∞-categories. We add a definitional equality relation to this theory which identifies terms with the same associativity structure, yielding a new type theory Catt_sa, for strictly associative ∞-categories. We also provide a reduction relation which generates definitional equality, and show it is confluent and terminating, giving an algorithm for deciding equality of terms, and making typechecking decidable. Our key contribution, on which our reduction is based, is an operation on terms which we call insertion. This has a direct geometrical interpretation, allowing a subterm to be inserted into the head of the term, flatting its syntactic structure. We describe this operation combinatorially in terms of pasting diagrams, and also show can be characterized as a pushout of contexts. This allows reasoning about insertion using just its universal property.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

07/16/2020

A Type Theory for Strictly Unital ∞-Categories

We present a type theory for strictly unital ∞-categories, in which a te...
11/28/2021

Monoidal weak omega-categories as models of a type theory

Weak ω-categories are notoriously difficult to define because of the ver...
06/08/2021

Globular weak ω-categories as models of a type theory

We study the dependent type theory CaTT, introduced by Finster and Mimra...
11/29/2021

Formalization of dependent type theory: The example of CaTT

We present the type theory CaTT, originally introduced by Finster and Mi...
05/22/2018

Paracompositionality, MWEs and Argument Substitution

Multi-word expressions, verb-particle constructions, idiomatically combi...
01/31/2018

Call-by-need, neededness and all that

We show that call-by-need is observationally equivalent to weak-head nee...
12/05/2017

Computational Higher Type Theory III: Univalent Universes and Exact Equality

This is the third in a series of papers extending Martin-Löf's meaning e...
This week in AI

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