Axiomatizing Fully Complete Models for ML Polymorphic Types
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Finite Models and Full Completeness
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
A Fully Complete PER Model for ML Polymorphic Types
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Proofnets and Context Semantics for the Additives
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Exhausting strategies, joker games and full completeness for IMLL with unit
Theoretical Computer Science - Category theory and computer science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Sequentiality vs. concurrency in games and logic
Mathematical Structures in Computer Science
Geometry of Interaction and linear combinatory algebras
Mathematical Structures in Computer Science
Double categories: a modular model of multiplicative linear logic
Mathematical Structures in Computer Science
Comparing hierarchies of types in models of linear logic
Information and Computation
Classical isomorphisms of types
Mathematical Structures in Computer Science
Proof nets for unit-free multiplicative-additive linear logic
ACM Transactions on Computational Logic (TOCL)
Syntax vs. semantics: a polarized approach
Theoretical Computer Science - Game theory meets theoretical computer science
Sequential algorithms and strongly stable functions
Theoretical Computer Science - Game theory meets theoretical computer science
Asynchronous games 2: the true concurrency of innocence
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Event Domains, Stable Functions and Proof-Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
A Graph Abstract Machine Describing Event Structure Composition
Electronic Notes in Theoretical Computer Science (ENTCS)
A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Focusing Strategies in the Sequent Calculus of Synthetic Connectives
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Science of Computer Programming
Partial Orders, Event Structures and Linear Strategies
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Contraction-free Proofs and Finitary Games for Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
A Game Semantics for Proof Search: Preliminary Results
Electronic Notes in Theoretical Computer Science (ENTCS)
Partially additive categories and fully complete models of linear logic
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Interpreting a finitary pi-calculus in differential interaction nets
Information and Computation
Focusing in asynchronous games
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
On the compositionality of round abstraction
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Constructive semantics for instantaneous reactions
Theoretical Computer Science
Model-checking games for fixpoint logics with partial order models
Information and Computation
Concurrent logic games on partial orders
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Spatial and temporal aspects in visual interaction
Journal of Visual Languages and Computing
An approach to innocent strategies as graphs
Information and Computation
Bicategories of concurrent games
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
What do epistemic logic and cognitive science have to do with each other?
Cognitive Systems Research
Winning, losing and drawing in concurrent games with perfect or imperfect information
Logic and Program Semantics
The Winning Ways of Concurrent Games
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Interpreting a finitary pi-calculus in differential interaction nets
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Asynchronous games: innocence without alternation
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Full completeness: interactive and geometric characterizations of the space of proofs
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
From proofs to focused proofs: a modular proof of focalization in linear logic
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
On Concurrent Games with Payoff
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
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.