Asynchronous games 3 : An innocent model of linear logic

Paul-André Melliès (1)

1 PPS - Preuves, Programmes et Systèmes

Since its early days, deterministic sequential game semantics has been limited to linear or polarized fragments of linear logic. Every attempt to extend the semantics to full propositional linear logic has bumped against the so-called Blass problem, which indicates (misleadingly) that a category of sequential games cannot be self-dual and cartesian at the same time. We circumvent this problem by considering (1) that sequential games are inherently positional ; (2) that they admit internal positions as well as external positions. We construct in this way a sequential game model of propositional linear logic, which incorporates two variants of the innocent arena game model: the well-bracketed and the non well-bracketed ones.

Mots clés: linear logic; innocence; game semantics; continuation monad; monoidal categories

Domaines: Logique en informatique [cs.LO]

Paul-André Melliès. Asynchronous games 3 : An innocent model of linear logic. CTCS 2004 -- Category Theory and Computer Science, 2004, Copenhague, Denmark. pp.171-192, ⟨10.1016/j.entcs.2004.06.057⟩. ⟨hal-00154294⟩