Advertisement

Ludics is a Model for the Finitary Linear Pi-Calculus

  • Claudia Faggian
  • Mauro Piccolo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4583)

Abstract

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 π-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.

Keywords

Normal Form Linear Logic Parallel Composition Reduction Rule Typing Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Curien, P.-L., Faggian, C.: L-nets, strategies and proof-nets. In: Ong, L. (ed.) CSL 2005. LNCS, vol. 3634, Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. Faggian, C.: Linear logic games: Sequential and parallel. draft (2005)Google Scholar
  3. Faggian, C., Piccolo, M.: A graph abstract machine describing event structure composition (short paper). In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, Springer, Heidelberg (2006)Google Scholar
  4. Faggian, C., Piccolo, M.: Event structures and linear strategies (submitted)Google Scholar
  5. Girard, J.-Y.: Locus solum. Mathematical Structures in Computer Science 11, 301–506 (2001)zbMATHCrossRefGoogle Scholar
  6. Hyland, M., Ong, L.: On full abstraction for PCF. Information and Computation (2000)Google Scholar
  7. Vasconcelos, V., Honda, K., Yoshida, N.: Secure information flow as typed process behaviour. In: Smolka, G. (ed.) ESOP 2000 and ETAPS 2000. LNCS, vol. 1782, Springer, Heidelberg (Extended abstract) (2000)Google Scholar
  8. Laurent, O., Honda, K.: An exact correspondence between a typed pi-calculus and polarised proof-nets. draft (2006)Google Scholar
  9. Honda, K., Yoshida, N., Berger, M.: Sequentiality and the pi-calculus. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, Springer, Heidelberg (Extended abstract) (2001)Google Scholar
  10. Honda, K., Yoshida, N., Berger, M.: Strong normalisation in the pi-calculus. Journal of Information and Computation, full version ( 2003)Google Scholar
  11. Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)Google Scholar
  12. Varacca, D., Yoshida, N.: Typed event structures and the pi-calculus. In: MFPS (2006)Google Scholar
  13. Yoshida, N., Honda, K.: Noninterference through flow analysis. Journal of Functional Programming, revised (2005)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Claudia Faggian
    • 1
  • Mauro Piccolo
    • 2
  1. 1.PPS, CNRS-Paris 7 
  2. 2.Universitá di Torino - PPS 

Personalised recommendations