Fifteenth Annual IEEE Symposium on

Logic in Computer Science (LICS 2000)

Paper: Game Semantics and Subtyping (at LICS 2000)

Authors: Juliusz Chroboczek

Abstract

While Game Semantics has been remarkably successful at modeling, often in a fully abstract manner, a wide range of features of programming languages, there has to date been no attempt at applying it to subtyping. We show how the simple device of explicitly introducing error values in the syntax of the calculus leads to a notion of subtyping for game semantics. We construct an interpretation of a simple lambda-calculus with subtyping and show how the range of the interpretation of types is a complete lattice thus yielding an interpretation of bounded quantification.

BibTeX

  @InProceedings{Chroboczek-GameSemanticsandSub,
    author = 	 {Juliusz Chroboczek},
    title = 	 {Game Semantics and Subtyping},
    booktitle =  {Proceedings of the Fifteenth Annual IEEE Symp. on Logic in Computer Science, {LICS} 2000},
    year =	 2000,
    editor =	 {Martin Abadi},
    month =	 {June}, 
    pages =      {192--203},
    location =   {Santa Barbara, CA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }