Lics

IEEE Symposium on Logic in Computer Science

LICS Home - LICS Awards - LICS Newsletters - LICS Archive - LICS Organization - Logic-Related Conferences - Links

Nineteenth Annual IEEE Symposium on

Logic in Computer Science (LICS 2004)

Paper: Nominal Games and Full Abstraction for the Nu-Calculus (at LICS 2004)

Authors: Samson Abramsky Dan R. Ghica Andrzej S. Murawski C.-H. Luke Ong Ian D. B. Stark

Abstract

We introduce nominal games for modelling programming languages with dynamically generated local names, as exemplified by Pitts and Stark's nu-calculus. Inspired by Pitts and Gabbay's recent work on nominal sets, we construct arenas and strategies in the world (or topos) of Fraenkel-Mostowski sets (or simply FM-sets). We fix an infinite set N of names to be the "atoms" of the FM-theory, and interpret the type v of names as the flat arena whose move-set is N. This approach leads to a clean and precise treatment of fresh names and standard game constructions (such as plays, views, innocent strategies, etc.) that are considered invariant under renaming. The main result is the construction of the first fully-abstract model for the nu-calculus.

BibTeX

  @InProceedings{AbramskyGhicaMuraws-NominalGamesandFull,
    author = 	 {Samson Abramsky and Dan R. Ghica and Andrzej S. Murawski and C.-H. Luke Ong and Ian D. B. Stark},
    title = 	 {Nominal Games and Full Abstraction for the Nu-Calculus},
    booktitle =  {Proceedings of the Nineteenth Annual IEEE Symposium on Logic in Computer Science (LICS 2004)},
    year =	 {2004},
    month =	 {July}, 
    pages =      {150--159},
    location =   {Turku, Finland}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2018-06-2121:59
Andrzej Murawski