Sciweavers

Share
LICS
1999
IEEE

Concurrent Games and Full Completeness

9 years 8 months ago
Concurrent Games and Full Completeness
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 MultiplicativeAdditive Linear Logic is proved for this semantics.
Samson Abramsky, Paul-André Melliès
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1999
Where LICS
Authors Samson Abramsky, Paul-André Melliès
Comments (0)
books