Logic in Computer Science (LICS 1991)

Paper: Games semantics for linear logic (at LICS 1991)

Authors: Y. Lafont T. Streicher

Abstract

An attempt is made to relate various notions of duality used in mathematics with the denotational semantics of linear logic. The author proposes a naive semantics for linear logic that, in a certain sense, generalizes various notions such as finite-dimensional vector spaces, topological spaces, and J.-Y. Girard's (1987) coherence spaces. A game consists of a set of vectors (or strategies), a set of forms (or co-strategies) and an evaluation bracket. This is enough to interpret the connectives of full propositional linear logic, including exponentials

BibTeX

  @InProceedings{LafontStreicher-Gamessemanticsforli,
    author = 	 {Y. Lafont and T. Streicher},
    title = 	 {Games semantics for linear logic},
    booktitle =  {Proceedings of the Sixth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1991},
    year =	 1991,
    editor =	 {Giles Kahn},
    month =	 {July}, 
    pages =      {43--50},
    location =   {Amsterdam, The Netherlands}, 
    publisher =	 {IEEE Computer Society Press}
  }