Bifibrations of polycategories and classical linear logic


This is a paper presented at MFPS 2020. It has also been accepted for a keynote presentation at ACT 2020. This page contains an extended version of the paper, the final version of the MFPS proceedings and the extended abstract submitted to ACT. The extended version of the paper is still work in progress. The main goal of this article is to expose and relate different ways of interpreting the multiplicative fragment of classical linear logic in polycategories. Polycategories are known to give rise to models of classical linear logic in so-called representable *-polycategories, which ask for the existence of various polymaps satisfying the different universal properties needed to define tensor, par, and negation. We begin by explaining how these different universal properties can all be seen as instances of a single notion of universality of a polymap parametrised by an input or output object, which also generalises the classical notion of universal multimaps in a multicategory. We then proceed to introduce a definition of in-cartesian and out-cartesian polymap relative to a refinement system (= strict functor) of polycategoriesm in such a way that universal polymaps can be understood as a special case. In particular, we obtain that a polycategory is a representable *-polycategory if and only if it is bifibred over the terminal polycategory. Finally, we present a Grothendieck correspondence between bifibrations of polycategories and pseudofunctors into MAdj, the 2-polycategory of multivariable adjunctions. When restricted to bifibrations over the terminal polycategory we get back the correspondence between *-autonomous categories and Frobenius pseudomonoids in MAdj that was recently observed by Shulman.

Bifibrations of polycategories and classical linear logic
PhD student in Theoretical Computer Science

My research interests lie in the interaction between Computer Science, Mathematics and Physics. My favorite tools are Logic and Category Theory.