On full abstraction for PCF: I, II, and III
Information and Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Strong normalisation in the π-calculus
Information and Computation
Noninterference through flow analysis
Journal of Functional Programming
Sequentiality and the π-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
L-Nets, strategies and proof-nets
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
On the Meaning of Logical Completeness
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
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 linear π-calculus
Theoretical Computer Science
From Focalization of Logic to the Logic of Focalization
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
On the meaning of focalization
Ludics, dialogue and interaction
An approach to innocent strategies as graphs
Information and Computation
Functions as session-typed processes
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Compositional event structure semantics for the internal π-calculus
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Strong Normalization in the π-calculus with Intersection and Union Types
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
| Hi-index | 0.00 |
We analyze in game-semantical terms the finitary fragment of the linear π-calculus. This calculus was introduced by Yoshida, Honda, and Berger [NYB01], and then refined by Honda and Laurent [LH06]. The features of this calculus - asynchrony and locality in particular - have a precise correspondence in Game Semantics. Building on work by Varacca and Yoshida [VY06], we interpret p-processes in linear strategies, that is the strategies introduced by Girard within the setting of Ludics [Gir01]. We prove that the model is fully complete and fully abstract w.r.t. the calculus.