Syntactical approaches to opetopes

Pierre-Louis Curien (1, 2) , Cédric Ho Thanh (2, 1) , Samuel Mimram (3, 1)

1 PI.R2 - Design, study and implementation of languages for proofs and programs
2 IRIF (UMR_8243) - Institut de Recherche en Informatique Fondamentale
3 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]

Opetopes are algebraic descriptions of shapes corresponding to compositions in higher dimensions. As such, they offer an approach to higher-dimensional algebraic structures, and in particular, to the definition of weak $\omega$-categories, which was the original motivation for their introduction by Baez and Dolan. They are classically defined inductively (as free operads in Leinster's approach, or as zoom complexes in the formalism of Kock et al.), using abstract constructions making them difficult to manipulate with a computer. In this paper, we present two purely syntactic descriptions of opetopes as sequent calculi, the first using variables to implement the compositional nature of opetopes, the second using a calculus of higher addresses. We prove that well-typed sequents in both systems are in bijection with opetopes as defined in the more traditional approaches. Additionally, we propose three variants to describe opetopic sets. We expect that the resulting structures can serve as natural foundations for mechanized tools based on opetopes.

Mots clés: Opetopic set; Opetope; Sequent calculus; Polynomial functor

Domaines: Catégories et ensembles [math.CT]; Logique en informatique [cs.LO]

Pierre-Louis Curien, Cédric Ho Thanh, Samuel Mimram. Syntactical approaches to opetopes. 2019. ⟨hal-02064784⟩