Paper Info
Title
Concurrent Games and Full Completeness
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.
Year
DOI
Venue
1999
10.1109/LICS.1999.782638
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Keywords
Field
DocType
new concurrent form,modelling linear logic,game semantics,full completeness theorem,concurrent games,sequential form,robust formalization,multiplicative-additive linear logic,completeness theorem,concurrent computing,formal logic,logic programming,linear logic,computer languages,geometry,polarization,informatics,computational modeling,computer science,programming language
Discrete mathematics,Programming language,Axiomatic semantics,Gödel's completeness theorem,Computer science,Denotational semantics,Multimodal logic,Theoretical computer science,Linear logic,Game semantics,Well-founded semantics,Higher-order logic
Conference
ISSN
ISBN
Citations 
1043-6871
0-7695-0158-3
69
PageRank 
References 
Authors
4.02
9
2
Name
Order
Citations
PageRank
Samson Abramsky13169348.51
Paul-andré Melliès239230.70