A Syntax for Strictly Associative and Unital ∞-Categories

We present the first definition of strictly associative and unital ∞-category.Our proposal takes the form of a type theory whose terms describe the operations of such structures, and whose definitional equality relation enforces desired strictness conditions.The key technical device is a new computation rule in the definitional equality of the theory, which we call insertion, defined in terms of a universal property.On terms for which it is defined, this operation "inserts" one of the arguments of a substituted coherence into the coherence itself, appropriately modifying the pasting diagram and result type, and simplifying the syntax in the process.We generate an equational theory from this reduction relation and we study its properties in detail, showing that it yields a decision procedure for equality.Expressed as a type theory, our model is well-adapted for generating and verifying efficient proofs of higher categorical statements.We illustrate this via an OCaml implementation, and give a number of examples, including a short encoding of the syllepsis, a 5-dimensional homotopy that plays an important role in the homotopy groups of spheres.