Proofs and types
Games and full abstraction for FPC
Information and Computation - Special issue: LICS 1996—Part 1
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Games and Full Completeness for Multiplicative Linear Logic (Extended Abstract)
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Believe it or not, AJM's games model is a model of classical linear logic
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic 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
Sequential algorithms and strongly stable functions
Theoretical Computer Science - Game theory meets theoretical computer science
Asynchronous games 2: the true concurrency of innocence
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Categorical Combinatorics for Innocent Strategies
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Asynchronous Games 3 An Innocent Model of Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Game Semantics has successfully provided fully abstract models for a variety of programming languages not possible using other denotational approaches. Although it is a flexible and accurate way to give semantics to a language, its underlying mathematics is awkward. For example, the proofs that strategies compose associatively and maintain properties imposed on them such as innocence are intricate and require a lot of attention. This work aims at beginning to provide a more elegant and uniform mathematical ground for Game Semantics. Our quest is to find mathematical entities that will retain the properties that make games an accurate way to give semantics to programs, yet that are simple and familiar to work with. Our main result is a full, faithful strong monoidal embedding of a category of games into a category of coherence spaces, where composition is simple composition of relations.