Games for Logic and Programming Languages VI

ETAPS 2011, Saarbrücken, Germany, 26–27 March

Registration now open.

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.


Saturday, 26 March

09.00       Welcome
09.30       Invited Talk // I. Mackie, Compiling the Geometry of Interaction
10.30       coffee

11.00        N. Hoshino and S. Katsumata, A categorical Geometry of Interaction for additives
11.45        D.R. Ghica, Towards a system-level semantics

12.30       lunch

02.00       Invited talk // S.P. Chin Learning game semantics through dynamic games
03.00       M. Menaa, Synchronous game semantics via round abstraction
03.45       coffee

04.30       J. Laird, The computational Pi calculus
05.15       P.B. LevyTopological characterization of finite and countable nondeterminism using infinite traces
06.00       end of first day
Sunday, 27 March

09.00       Invited talk // J. Väänänen, Independence Logic
10.00       T. TsouanasA game semantics approach to disjunctive logic programs
10.45       coffee

11.15       D. Galmiche and D. MeryCharacterization of bi-intuitionistic validity through resource games
12.00       U. Dal Lago and O. Laurent, On proof-nets, game semantics and the complexity of normalization

12.45       lunch

02.00       Invited talk // M. Sadrzadeh, Modeling Information Flow in Natural Language: composing and playing!
03.00       P. Bourreau and S. Salvati, A game-theoretic study of uniqueness relation between types and lambda terms
03.45       coffee

04.30       Discussion
05.45       end of workshop


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).

Submission instructions

Please email an abstract of your proposed talk to Dan Ghica ( You may also submit an accompanying paper for the talk. The important dates are:

  • Submission: January 20 
  • Notification: February 1 
  • Workshop: March 26-27

Invited Speakers

Program Committee

Steering Committee

  • Samson Abramsky (Chair), Oxford
  • Pierre-Louis Curien, PPS
  • Claudia Faggian, PPS
  • Dan Ghica, Birmingham
  • Ichiro Hasuo, Tokyo
  • Jim Laird, Bath
  • Olivier Laurent, ENS Lyon
  • Guy McCusker, Bath
  • Luke Ong, Oxford
  • Gabriel Sandu, Paris
  • Andrea Schalk, Manchester
  • Jouko Vaananen, Helsinki