Paper: A Fully Abstract Game Semantics of Local Exceptions (at LICS 2001)

Authors: James Laird

Abstract

A fully abstract game semantics for an extension of Idealized Algol with locally declared exceptions is presented. It is based on "Hyland-Ong games", but as well as relaxing the constraints which impose functional behaviour (as in games models of other computational effects such as continuations and references), new structure is added to plays in the form of additional pointers which track the flow of control. The semantics is proved to be fully abstract by a factorization of strategies into a 'new-exception generator' and a strategy with local control flow. It is shown, using examples, that there is no model of exceptions which is a conservative extension of the semantics of Idealized Algol without the new pointers.

BibTeX

  @InProceedings{Laird-AFullyAbstractGameS,
    author = 	 {James Laird},
    title = 	 {A Fully Abstract Game Semantics of Local Exceptions},
    booktitle =  {Proceedings of the Sixteenth Annual IEEE Symposium on Logic in Computer Science (LICS 2001)},
    year =	 {2001},
    month =	 {June}, 
    pages =      {105--114},
    location =   {Boston, MA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }