Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Handbook of logic in computer science (vol. 4)
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
Concurrent Games and Full Completeness
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Sequentiality vs. concurrency in games and logic
Mathematical Structures in Computer Science
Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic
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
Definability and Full Abstraction
Electronic Notes in Theoretical Computer Science (ENTCS)
Asynchronous games: innocence without alternation
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Hi-index | 0.00 |
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as games on which proofs induce strategies. We are specifically interested here in relating two such semantics of linear logic, of very different flavor, which both take in account concurrent features of the proofs: asynchronous games and concurrent games. Interestingly, we show that associating a concurrent strategy to an asynchronous strategy can be seen as a semantical counterpart of the focusing property of linear logic.