Games for Logic and Programming Languages VII

LICS 2012, Dubrovnik, Croatia
Friday, June 29, 2012
Room B04


09:00    Pierre Clairambault (Cambridge)
            Invited Talk: Causality in game semantics 

10:00    Andrzej Murawski (Leicester) and Nikos Tzevelekos (Queen Mary, London)
            Game semantics for fragments of ML

10:30    break

11:00    Olle Fredriksson and Dan Ghica (Birmingham)
            Seamless distributed computing

11:30    Thomas Seiller (Savoie)
            Graphs of interaction

12:00    Etienne Duchesne (Paris)
            The geometry of additives

12:30    Lunch

14:00    Juha Kontinen (Helsinki)
            Axiomatising first-order consequence in IF logic

15:00    Fausto Barbero (Torino) and Gabriel Sandu (Helsinki)
            Signalling in IF logic

15:30    Christos Nomikos (Ioannina ) and Panos Rondogiannis (Athens)
            Intensional logic programming

16:00    Luke Ong (Oxford) and Takeshi Tsukada (Tohoku)
            Two-level game semantics

16:30    Break

17:00    Uday Reddy (Birmingham)
            Automata-theoretic models of programming languages

17:30    Paul Levy (Birmingham)
            Games on position categories

For registration use the LICS web site

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.

Invited speakers

  • Pierre Clairambault, Cambridge
    Causality in game semantics 
  • Juha Kontinen, Helsinki 
    Axiomatising first-order consequences in dependence logic
Contributed talks
  • Christos Nomikos, Ioannina and  Panos Rondogiannis, Athens
    A game semantics for intensional logic programming
  • C.-H. Luke Ong, Oxford, and Takeshi Tsukada, Tohoku
    Two-Level Game Semantics, Intersection Types, and Recursion Schemes
  • Fausto Barbero, Torino, and Gabriel Sandu, Helsinki
    Signalling in Independence-Friendly Logic
  • Thomas Seiller, Savoie 
    Graphs of Interaction: Additives 
  • Andrzej S. Murawski, Leicester, and Nikos Tzevelekos, Queen Mary
    Game semantics for fragments of ML 
  • Paul Levy, Birmingham
    Games on position categories
  • Etienne Duchesne, Paris
    The geometry of additives: interaction and orthogonality
  • Uday Reddy, Birmingham
    Towards automata-theoretic models of programming languages
  • Olle Fredriksson and Dan R. Ghica, Birmingham
    Seamless distributed computing


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.