Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Concurrent Games and Full Completeness Samson Abramsky
 

Summary: Concurrent Games and Full Completeness
Samson Abramsky
LFCS, Division of Informatics
Univ. of Edinburgh

Paul­Andr’e Melli‘es \Lambda
Equipe de Logique Math’ematique
CNRS, Univ. Paris 7

Abstract
A new concurrent form of game semantics is introduced.
This overcomes the problems which had arisen with previ­
ous, sequential forms of game semantics in modelling Lin­
ear Logic. It also admits an elegant and robust formal­
ization. A Full Completeness Theorem for Multiplicative­
Additive Linear Logic is proved for this semantics.
1 Introduction
This paper contains two main contributions:
ffl the introduction of a new form of game semantics,
which we call concurrent games.

  

Source: Abramsky, Samson - Computing Laboratory, University of Oxford
Melliès, Paul-André - Laboratoire Preuves, Programmes et Systèmes, Université Paris 7 - Denis Diderot

 

Collections: Computer Technologies and Information Sciences