The Groupoid-syntax of Type Theory is a Set
By: Thorsten Altenkirch, Ambrus Kaposi, Szumi Xie
Potential Business Impact:
Makes math rules work with more kinds of math.
Categories with families (CwFs) have been used to define the semantics of type theory in type theory. In the setting of Homotopy Type Theory (HoTT), one of the limitations of the traditional notion of CwFs is the requirement to set-truncate types, which excludes models based on univalent categories, such as the standard set model. To address this limitation, we introduce the concept of a Groupoid Category with Families (GCwF). This framework truncates types at the groupoid level and incorporates coherence equations, providing a natural extension of the CwF framework when starting from a 1-category. We demonstrate that the initial GCwF for a type theory with a base family of sets and Pi-types (groupoid-syntax) is set-truncated. Consequently, this allows us to utilize the conventional intrinsic syntax of type theory while enabling interpretations in semantically richer and more natural models. All constructions in this paper were formalised in Cubical Agda.
Similar Papers
Type Theory with Single Substitutions
Logic in Computer Science
Simplifies how computers understand math rules.
A Judgmental Construction of Directed Type Theory
Logic in Computer Science
Makes computer code safer and more organized.
2-Coherent Internal Models of Homotopical Type Theory
Logic in Computer Science
Makes math logic work inside itself.