Logic in Computer Science (LICS 1999)

Paper: Concurrent Games and Full Completeness (at LICS 1999)

Authors: Samson Abramsky Paul-André Melliès

Abstract

A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It also admits an elegant and robust formalization. A Full Completeness Theorem for Multiplicative-Additive Linear Logic is proved for this semantics.

BibTeX

  @InProceedings{AbramskyMellis-ConcurrentGamesandF,
    author = 	 {Samson Abramsky and Paul-André Melliès},
    title = 	 {Concurrent Games and Full Completeness},
    booktitle =  {Proceedings of the Fourteenth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1999},
    year =	 1999,
    editor =	 {Giuseppe Longo},
    month =	 {July}, 
    pages =      {431--442},
    location =   {Trento, Italy}, 
    publisher =	 {IEEE Computer Society Press}
  }