Event Domains, Stable Functions and Proof-Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Typed Event Structures and the π-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Typed event structures and the linear π-calculus
Theoretical Computer Science
An exact correspondence between a typed pi-calculus and polarised proof-nets
Theoretical Computer Science
Interpreting a finitary pi-calculus in differential interaction nets
Information and Computation
A nice labelling for tree-like event structures of degree 3
Information and Computation
Theoretical Computer Science
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
L-Nets, strategies and proof-nets
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
An approach to innocent strategies as graphs
Information and Computation
Ludics and natural language: first approaches
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
A nice labelling for tree-like event structures of degree 3
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Interpreting a finitary pi-calculus in differential interaction nets
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Abstract Machines for Game Semantics, Revisited
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We introduce L-nets as a game model of concurrent interaction. L-nets, which correspond to strategies (in Games Semantics) ordesigns (in Ludics), are graphs, and the interactions (plays) resultinto partial orders, hence allowing for parallelism.