Theoretical Computer Science
Games on Graphs and Sequentially Realizable Functionals
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Concurrent Games and Full Completeness
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Ludics Nets, a game Model of Concurrent Interaction
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
A game semantics of the asynchronous π-calculus
CONCUR 2005 - Concurrency Theory
Concrete Data Structures as Games
Electronic Notes in Theoretical Computer Science (ENTCS)
Partial Orders, Event Structures and Linear Strategies
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Typed event structures and the linear π-calculus
Theoretical Computer Science
An approach to innocent strategies as graphs
Information and Computation
Compositional event structure semantics for the internal π-calculus
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
Event structures, Game Semantics strategies and Linear Logic proof-nets arise in different domains (concurrency, semantics, proof-theory) but can all be described by means of directed acyclic graphs (dag's). They are all equipped with a specific notion of composition, interaction or normalization. We report on-going work, aiming to investigate the common dynamics which seems to underly these different structures. In this paper we focus on confusion free event structures on one side, and linear strategies [Jean-Yves Girard. Locus solum. Mathematical Structures in Computer Science, 11:301-506, 2001, C. Faggian and F. Maurel. Ludics nets, a game model of concurrent interaction. In Proc. of LICS'05 (Logic in Computer Science). IEEE Computer Society Press, 2005] on the other side. We introduce an abstract machine which is based on (and generalizes) strategies interaction; it processes labelled dag's, and provides a common presentation of the composition at work in these different settings.