The Cartesian Closed Bicategory of Thin Spans of Groupoids
Pierre Clairambault, Simon Forest

TL;DR
This paper introduces a new bicategorical model called thin spans of groupoids, which captures proof-relevant semantics of programming languages with a focus on resource replication and symmetries, differing from saturated models.
Contribution
The paper constructs a bicategory of thin spans of groupoids with a pseudocomonad, demonstrating that its Kleisli bicategory is cartesian closed, offering a novel approach to bicategorical semantics.
Findings
The bicategory of thin spans of groupoids is well-defined and structured.
The pseudocomonad $!$ on the bicategory leads to a cartesian closed Kleisli bicategory.
The model guarantees invariance under symmetries through a subtle biorthogonality invariant.
Abstract
Recently, there has been growing interest in bicategorical models of programming languages, which are "proof-relevant" in the sense that they keep distinct account of execution traces leading to the same observable outcomes, while assigning a formal meaning to reduction paths as isomorphisms. In this paper we introduce a new model, a bicategory called thin spans of groupoids. Conceptually it is close to Fiore et al.'s generalized species of structures and to Melli\`es' homotopy template games, but fundamentally differs as to how replication of resources and the resulting symmetries are treated. Where those models are saturated -- the interpretation is inflated by the fact that semantic individuals may carry arbitrary symmetries -- our model is thin, drawing inspiration from thin concurrent games: the interpretation of terms carries no symmetries, but semantic individuals satisfy a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Computability, Logic, AI Algorithms · Logic, Reasoning, and Knowledge
