 |
PREUVES, PROGRAMMES et SYSTÈMES |  |
|
PREUVES, PROGRAMMES et SYSTÈMES | |
| HAL: hal-00391714, version 2 |
| DOI: 10.1007/978-3-642-02930-1 |
| Detailed view |  Export this paper |
 |
| 36th International Colloquium on Automata, Languages and Programming, Rhodes : Grèce (2009) |
|
|
| Available versions: | v1 (2009-06-04) | v2 (2009-06-09) |
|
|
|
|
| An explicit formula for the free exponential modality of linear logic |
|
|
| paul-andré melliès 1Nicolas Tabareau 1 |
|
|
| For the CHOCO collaboration(s) |
|
|
| (2009-07-06) |
|
|
|
| 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 rst 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 niteness space model. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Preuves, Programmes et Systèmes (PPS) |
|
|
|
CNRS : UMR7126 – Université Paris VII - Paris Diderot |
|
|
|
|
|
|
|
|
|
| Subject | : | Mathematics/Category Theory Computer Science/Logic in Computer Science |
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00391714, version 2 | |
| http://hal.archives-ouvertes.fr/hal-00391714 | |
| oai:hal.archives-ouvertes.fr:hal-00391714 | |
| From: Nicolas Tabareau | |
| Submitted on: Tuesday, 9 June 2009 13:53:55 | |
| Updated on: Wednesday, 14 October 2009 10:33:30 | |
