 |
|
|
|
| HAL: hal-00270933, version 1 |
| DOI: 10.1007/978-3-540-87531-4_18 |
| Detailed view |  Export this paper |
|
|
| Computer Science Logic, Bertinoro : Italie (2008) |
|
|
|
|
| Quantitative Game Semantics for Linear Logic |
|
|
| Ugo Dal Lago 1Olivier Laurent 2 |
|
|
| (2008-09) |
|
|
|
| We present a game-based semantic framework into which the time complexity of any MELL proof can be read out of its interpretation. This gives a compositional view of the geometry of interaction framework introduced by the first author. In our model the time measure is given by means of slots, as introduced by Ghica in a recent paper. The cost associated to a strategy is polynomially related to the normalization time of the interpreted proof, in the style of a complexity-theoretical full abstraction result. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Department of Computer Science |
|
|
|
University of Bologna |
|
|
| 2: | Preuves, Programmes et Systèmes (PPS) |
|
|
|
CNRS : UMR7126 – Université Paris VII - Paris Diderot |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Logic in Computer Science Computer Science/Computational Complexity Mathematics/Logic Computer Science/Computer Science and Game Theory |
|
|
| Linear logic – Implicit computational complexity – Game semantics |
|
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| hal-00270933, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00270933 | |
| oai:hal.archives-ouvertes.fr:hal-00270933 | |
| From: Olivier Laurent | |
| Submitted on: Monday, 7 April 2008 21:18:18 | |
| Updated on: Thursday, 1 January 2009 15:45:52 | |
