LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Sequentiality vs. concurrency in games and logic
Sequentiality vs. concurrency in games and logic
Control categories and duality: on the categorical semantics of the lambda-mu calculus
Mathematical Structures in Computer Science
Geometry and concurrency: a user's guide
Mathematical Structures in Computer Science
Premonoidal categories and notions of computation
Mathematical Structures in Computer Science
An Explicit Formula for the Free Exponential Modality of Linear Logic
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Understanding Game Semantics Through Coherence Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Constructing differential categories and deconstructing categories of games
Information and Computation
| Hi-index | 0.00 |
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.