Theoretical Computer Science
Domains and lambda-calculi
On full abstraction for PCF: I, II, and III
Information and Computation
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
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
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)
Event Domains, Stable Functions and Proof-Nets
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
Ludics is a model for the finitary linear pi-calculus
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
An exact correspondence between a typed pi-calculus and polarised proof-nets
Theoretical Computer Science
A logical calculus for modelling interferences
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Commutative locative quantifiers for multiplicative linear logic
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Jump from parallel to sequential proofs: multiplicatives
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Events, causality and symmetry
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Ludics and natural language: first approaches
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
Compositional event structure semantics for the internal π-calculus
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
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We consider the setting of L-nets, recently introduced by Faggian and Maurel as a game model of concurrent interaction and based on Girard's Ludics. We show how L-nets satisfying an additional condition, which we call logical L-nets, can be sequentialized into traditional tree-like strategies, and vice-versa.