Quantitative Game Semantics for Linear Logic

Ugo Dal Lago (1) , Olivier Laurent (2)

1 DISI - Department of Computer Science and Engineering [Bologna]
2 PPS - Preuves, Programmes et Systèmes

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.

Mots clés: Linear logic; Implicit computational complexity; Game semantics

Domaines: Logique en informatique [cs.LO]; Complexité [cs.CC]; Logique [math.LO]; Informatique et théorie des jeux [cs.GT]

Ugo Dal Lago, Olivier Laurent. Quantitative Game Semantics for Linear Logic. Computer Science Logic, Sep 2008, Bertinoro, Italy. pp.230--245, ⟨10.1007/978-3-540-87531-4_18⟩. ⟨hal-00270933⟩