Unifying type systems for mobile processes

We present a unifying framework for type systems for process calculi. The core of the system provides an accurate correspondence between essentially functional processes and linear logic proofs; fragments of this system correspond to previously known connections between proofs and processes. We show how the addition of extra logical axioms can widen the class of typeable processes in exchange for the loss of some computational properties like lock-freeness or termination, allowing us to see various well studied systems (like i/o types, linearity, control) as instances of a general pattern. This suggests unified methods for extending existing type systems with new features while staying in a well structured environment and constitutes a step towards the study of denotational semantics of processes using proof-theoretical methods.

[1]  Olivier Laurent,et al.  An exact correspondence between a typed pi-calculus and polarised proof-nets , 2010, Theor. Comput. Sci..

[2]  Kohei Honda,et al.  Sequentiality and the π-Calculus , 2001 .

[3]  Nobuko Yoshida,et al.  Genericity and the π-calculus , 2005, Acta Informatica.

[4]  Davide Sangiorgi,et al.  Name-Passing Calculi: From Fusions to Preorders and Types , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[5]  Vincent Danos,et al.  The structure of multiplicatives , 1989, Arch. Math. Log..

[6]  Cosimo Laneve,et al.  Solos in Concert , 1999, ICALP.

[7]  Daniele Varacca,et al.  Typed Event Structures and the p-Calculus , 2006 .

[8]  Emmanuel Beffara.  A proof-theoretic view on scheduling in concurrency , 2014 .

[9]  Davide Sangiorgi.  pi-Calculus, Internal Mobility, and Agent-Passing Calculi , 1996, Theor. Comput. Sci..

[10]  D. Sangiorgi.  - calculus , internal mobility , and agent-passing calculi , 1995 .

[11]  Emmanuel Beffara,et al.  Logique, Réalisabilité et Concurrence , 2005 .

[12]  Naoki Kobayashi.  A type system for lock-free processes , 2002 .

[13]  Yuxi Fu.  A Proof Theoretical Approach to Communication , 1997, ICALP.

[14]  Emmanuel Beffara,et al.  A Concurrent Model for Linear Logic , 2006, MFPS.

[15]  Ernst W. Mayr,et al.  Exploring new frontiers of theoretical informatics : IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004), 22-27 August 2004, Toulouse, France , 2004 .

[16]  Thomas Ehrhard,et al.  Acyclic Solos and Differential Interaction Nets , 2010, Log. Methods Comput. Sci..

[17]  Benjamin C. Pierce,et al.  Linearity and the pi-calculus , 1999, TOPL.

[18]  Frank Pfenning,et al.  Session Types as Intuitionistic Linear Propositions , 2010, CONCUR.

[19]  Björn Victor,et al.  The fusion calculus: expressiveness and symmetry in mobile processes , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[20]  Bernardo Toninho,et al.  Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication , 2012, CSL.

[21]  Gianluigi Bellin,et al.  On the pi-Calculus and Linear Logic , 1992, Theor. Comput. Sci..

[22]  Nobuko Yoshida,et al.  Strong normalisation in the /spl pi/-calculus , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[23]  Davide Sangiorgi,et al.  Typing and subtyping for mobile processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[24]  Kohei Honda,et al.  Types for Dyadic Interaction , 1993, CONCUR.

[25]  Davide Sangiorgi,et al.  Ensuring termination by typability , 2006, Inf. Comput..

[26]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[27]  Naoki Kobayashi,et al.  A Type System for Lock-Free Processes , 2002, Inf. Comput..

[28]  Jean-Yves Girard,et al.  Light Linear Logic , 1998, Inf. Comput..