Paper: A Fully Abstract Game Semantics for General References (at LICS 1998)

Authors: Samson Abramsky Kohei Honda Guy McCusker

Abstract

A games model of a programming language with higher-order store in the style of ML-references is introduced. The category used for the model is obtained by relaxing certain behavioural conditions on a category of games previously used to provide fully abstract models of pure functional languages. The model is shown to be fully abstract by means of factorization arguments which reduce the question of definability for the language with higher-order store to that for its purely functional fragment

BibTeX

  @InProceedings{AbramskyHondaMcCusk-AFullyAbstractGameS,
    author = 	 {Samson Abramsky and Kohei Honda and Guy McCusker},
    title = 	 {A Fully Abstract Game Semantics for General References},
    booktitle =  {Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science (LICS 1998)},
    year =	 {1998},
    month =	 {June}, 
    pages =      {334--344},
    location =   {Indianapolis, IN, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }