Paper: Full abstraction for functional languages with control (at LICS 1997)

Authors: James Laird

Abstract

This paper considers the consequences of relaxing the bracketing condition on `dialogue games', showing that this leads to a category of games which can be `factorized' into a well-bracketed substructure, and a set of classically typed morphisms. These are shown to be sound denotations for control operators, allowing the factorization to be used to extend the definability result for PCF to one for PCF with control operators at atomic types. Thus we define a fully abstract and effectively presentable model of a functional language with non-local control as part of a modular approach to modelling non-functional features using games.

BibTeX

  @InProceedings{Laird-Fullabstractionforf,
    author = 	 {James Laird},
    title = 	 {Full abstraction for functional languages with control},
    booktitle =  {Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS 1997)},
    year =	 {1997},
    month =	 {June}, 
    pages =      {58--67},
    location =   {Warsaw, Poland}, 
    publisher =	 {IEEE Computer Society Press}
  }