Theoretical Computer Science
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Domains and lambda-calculi
On full abstraction for PCF: I, II, and III
Information and Computation
Games on Graphs and Sequentially Realizable Functionals
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Designs, Disputes and Strategies
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Focussing Proof-Net Construction as a Middleware Paradigm
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Concurrent Games and Full Completeness
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Locus Solum: From the rules of logic to the logic of rules
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)
Asynchronous games 2: the true concurrency of innocence
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
A Graph Abstract Machine Describing Event Structure Composition
Electronic Notes in Theoretical Computer Science (ENTCS)
Partial Orders, Event Structures and Linear Strategies
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Concrete Data Structures as Games
Electronic Notes in Theoretical Computer Science (ENTCS)
Typed event structures and the linear π-calculus
Theoretical Computer Science
Sequentiality and the π-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Ludics is a model for the finitary linear pi-calculus
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Intuitionistic Dual-intuitionistic Nets
Journal of Logic and Computation
Jump from parallel to sequential proofs: multiplicatives
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Asynchronous games: innocence without alternation
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
This paper proposes an approach for extending to graphs the close relation between proofs and innocent strategies. We work in the setting of L-nets, introduced by Faggian and Maurel as a game model of concurrent interaction. We show how L-nets satisfying an additional condition, which we call L"S-nets, can be sequentialized into traditional tree-like strategies. Conversely, sequential strategies can be relaxed into more asynchronous ones. We develop an algebra of constructors and destructors that serve to build and decompose graph strategies, and to describe a class of minimally sequential graph strategies, which can be seen as an abstract kind of multiplicative-additive proof nets.