Theoretical Computer Science
Theoretical Computer Science - Special issue: Fourth workshop on mathematical foundations of programming semantics, Boulder, CO, May 1988
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
New foundations for the geometry of interaction
Information and Computation
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Stable Models of Typed lambda-Calculi
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Retracting Some Paths in Process Algebra
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Full Completeness of the Multiplicative Linear Logic of Chu Spaces
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Concurrent Games and Full Completeness
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Sequentiality vs. concurrency in games and logic
Mathematical Structures in Computer Science
Ludics Nets, a game Model of Concurrent Interaction
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Proof nets for unit-free multiplicative-additive linear logic
ACM Transactions on Computational Logic (TOCL)
L-Nets, strategies and proof-nets
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Concurrent logic games on partial orders
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Events, causality and symmetry
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
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
| Hi-index | 0.00 |
We pursue the program of exposing the intrinsic mathematical structure of the ''space of proofs'' of a logical system [S. Abramsky and R. Jagadeesan. Games and Full Completeness for Multiplicative Linear Logic, Journal of Symbolic Logic, (1994), vol. 59, no. 2, 543-574]. We study the case of Multiplicative-Additive Linear Logic (MALL). We use tools from Domain theory to develop a semantic notion of proof net for MALL, and prove a Sequentialization Theorem. This work forms part of a continuation of previous joint work with Radha Jagadeesan [S. Abramsky and R. Jagadeesan. Games and Full Completeness for Multiplicative Linear Logic, Journal of Symbolic Logic, (1994), vol. 59, no. 2, 543-574] and Paul-Andre Mellies [S. Abramsky and P.-A. Mellies. Concurrent Games and Full Completeness. Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 431-44, 1999].