Work

Concurrent games and full completeness

Year: 2003
Type: conference-paper
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.
Language: English
Subfield: Software
Open Access status: green
OpenAlex ID: W2107067818
FWCI: 5.843
Cites: 17
Cited by: 203
Related to: 10