Game semantics has emerged as a new and successful paradigm in the field of semantics of logics and programming languages. Game semantics made its breakthrough in computer science in the early 90s, providing an innovative set of methods and techniques for the analysis of logical systems. Subsequently, game-semantic techniques led to the development of the first syntax-independent fully-abstract models for a variety of programming languages, ranging from the purely functional to languages effects such as control, references or concurrency. There are also emerging connections between game semantics and other semantic theories, notably theories of concurrency such as the π-calculus, and traditional tree-based semantics of lambda calculi. In addition to semantic analysis, an algorithmic approach to game semantics has recently been developed, with a view to applications in computer assisted verification, program analysis and hardware synthesis.

Organization

This is intended to be an informal workshop. Participants are encouraged to present work in progress, overviews of more extensive  work, and programmatic/position papers, as well as completed projects in the following areas:

• Game theory and interaction models in semantics
• Games-based design and verification
• Logics for games and games for logics
• Algorithmic aspects of games
• Geometry of Interaction
• Ludics
• epistemic game theory
• logics of dependence and independence
• computational linguistics.
  

A special journal issue associated with the workshop is being considered; this will be discussed at the workshop. Two previous workshops led to special issues in the journal Annals of Pure and Applied Logic (161(5) 2010 and 151(2-3) 2008). The previous workshop has a APAL special issue in the works.