Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1017/S0960129516000426 | Mathematical Structures in Computer Science |
Keywords | Field | DocType |
free commutative comonoid,linear logic,formula a,conway game,exponential modality,commutative comonoid,algebraic approach,free exponential modality,explicit formula,coherence space,linear logic associate,sequential limit,tensor product | Closed monoidal category,Tensor product,Discrete mathematics,Combinatorics,Monoidal category,Algebraic number,Exponential function,Commutative property,Symmetric monoidal category,Linear logic,Mathematics | Conference |
Volume | Issue | ISSN |
28 | 7 | 0960-1295 |
Citations | PageRank | References |
16 | 1.03 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paul-andré Melliès | 1 | 392 | 30.70 |
| Nicolas Tabareau | 2 | 241 | 23.63 |
| Christine Tasson | 3 | 176 | 13.61 |