From process logic to program logic
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Strong normalisation in the π-calculus
Information and Computation
Noninterference through flow analysis
Journal of Functional Programming
Structure of proofs and the complexity of cut elimination
Theoretical Computer Science
Asynchronous games 2: the true concurrency of innocence
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Theoretical Computer Science - Applied semantics: Selected topics
Asynchronous Games 3 An Innocent Model of Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
A game semantics of linearly used continuations
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Nondeterministic light logics and NP-time
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Polarized proof nets with cycles and fixpoints semantics
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Game semantics for higher-order concurrency
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
We generalize the intuitionistic Hyland-Ong games to a notion of polarized games allowing games with plays starting by proponent moves. The usual constructions on games are adjusted to fit this setting yielding a game model for polarized linear logic with a definability result. As a consequence this gives a complete game model for various classical systems: LC, \lamdba\mu-calculus, . . . for both call-by-name and call-by-value evaluations.