LNL polycategories and doctrines of linear logic

• Published in: Logical methods in computer science Vol. 19, Issue 2
• Main Author: Shulman, Michael
• Format: Journal Article
• Language: English
• Published: Logical Methods in Computer Science e.V 05.04.2023
• Subjects: computer science - logic in computer science; mathematics - category theory
• ISSN: 1860-5974; 1860-5974
• DOI: 10.46298/lmcs-19(2:1)2023

We define and study LNL polycategories, which abstract the judgmental structure of classical linear logic with exponentials. Many existing structures can be represented as LNL polycategories, including LNL adjunctions, linear exponential comonads, LNL multicategories, IL-indexed categories, linearly distributive categories with storage, commutative and strong monads, CBPV-structures, models of polarized calculi, Freyd-categories, and skew multicategories, as well as ordinary cartesian, symmetric, and planar multicategories and monoidal categories, symmetric polycategories, and linearly distributive and *-autonomous categories. To study such classes of structures uniformly, we define a notion of LNL doctrine, such that each of these classes of structures can be identified with the algebras for some such doctrine. We show that free algebras for LNL doctrines can be presented by a sequent calculus, and that every morphism of doctrines induces an adjunction between their 2-categories of algebras.