Ludics is a Model for the Finitary Linear Pi-Calculus

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.

[1]  Raheel Ahmad,et al.  The π-Calculus: A theory of mobile processes , 2008, Scalable Comput. Pract. Exp..

[2]  Claudia Faggian,et al.  Partial Orders, Event Structures and Linear Strategies , 2009, TLCA.

[3]  Brian Campbell,et al.  Amortised Memory Analysis Using the Depth of Data Structures , 2009, ESOP.

[4]  Nobuko Yoshida,et al.  Strong normalisation in the pi -calculus , 2004, Inf. Comput..

[5]  Sam Lindley,et al.  Extensional Rewriting with Sums , 2007, TLCA.

[6]  Christel Baier,et al.  CONCUR 2006 - Concurrency Theory, 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006, Proceedings , 2006, CONCUR.

[7]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[8]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[9]  Nobuko Yoshida,et al.  Noninterference through flow analysis , 2005, J. Funct. Program..

[10]  Pierre-Louis Curien,et al.  L-Nets, Strategies and Proof-Nets , 2005, CSL.

[11]  Claudia Faggian,et al.  A Graph Abstract Machine Describing Event Structure Composition , 2007, Electron. Notes Theor. Comput. Sci..

[12]  Nobuko Yoshida,et al.  Sequentiality and the pi-Calculus , 2001, TLCA.

[13]  Radha Jagadeesan,et al.  Full Abstraction for PCF , 1994, Inf. Comput..

[14]  Jean-Yves Girard,et al.  Locus Solum: From the rules of logic to the logic of rules , 2001, Mathematical Structures in Computer Science.

[15]  Nobuko Yoshida,et al.  Secure Information Flow as Typed Process Behaviour , 2000, ESOP.