Title :
Concurrent games and full completeness
Author :
Abramsky, Samson ; Melliès, Paul-André
Author_Institution :
Lab. for Found. of Comput. Sci., Edinburgh Univ., UK
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
Keywords :
concurrency theory; formal logic; completeness theorem; concurrent; game semantics; linear logic; Computational modeling; Computer languages; Computer science; Concurrent computing; Ear; Electronic switching systems; Geometry; Informatics; Logic programming; Polarization;
Conference_Titel :
Logic in Computer Science, 1999. Proceedings. 14th Symposium on
Conference_Location :
Trento
Print_ISBN :
0-7695-0158-3
DOI :
10.1109/LICS.1999.782638
