An Explicit Formula for the Free Exponential Modality of Linear Logic

Authors:
Paul-André Melliès;Nicolas Tabareau;Christine Tasson
Affiliations:
Laboratoire Preuves Programmes Systèmes, CNRS & Universitééé Paris 7, Denis Diderot;Laboratoire Preuves Programmes Systèmes, CNRS & Universitééé Paris 7, Denis Diderot;Laboratoire Preuves Programmes Systèmes, CNRS & Universitééé Paris 7, Denis Diderot
Venue:
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Year:
2009

Citing 3
Cited 6

Linear logic

Theoretical Computer Science
Finiteness spaces

Mathematical Structures in Computer Science
Asynchronous Games 3 An Innocent Model of Linear Logic

Electronic Notes in Theoretical Computer Science (ENTCS)

Constructing differential categories and deconstructing categories of games

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Categories of coalgebraic games

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Constructing differential categories and deconstructing categories of games

Information and Computation
Applying quantitative semantics to higher-order quantum computing

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Weighted Relational Models of Typed Lambda-Calculi

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The exponential modality of linear logic associates a commutative comonoid !A to every formula A in order to duplicate it. Here, we explain how to compute the free commutative comonoid !A as a sequential limit of equalizers in any symmetric monoidal category where this sequential limit exists and commutes with the tensor product. We then apply this general recipe to two familiar models of linear logic, based on coherence spaces and on Conway games. This algebraic approach enables to unify for the first time apparently different constructions of the exponential modality in spaces and games. It also sheds light on the subtle duplication policy of linear logic. On the other hand, we explain at the end of the article why the formula does not work in the case of the finiteness space model.