Type Inference for a Distributed pi-Calculus

We study the type inference problem for a distributed π-calculus with explicit notions of locality and migration. Location types involve names that may be bound in terms. This requires some accurate new treatments. We define a notion of principal typing. We provide a formal description of sound and complete type inference algorithm.

[1]  Mitchell Wand,et al.  Complete Type Inference for Simple Objects , 1987, LICS.

[2]  Roberto M. Amadio.  On modelling mobility , 2000, Theor. Comput. Sci..

[3]  Didier Rémy.  Syntactic theories and the algebra of record terms , 1992 .

[4]  James Riely,et al.  Trust and partial typing in open systems of mobile agents , 1999, POPL '99.

[5]  Roberto M. Amadio,et al.  The Receptive Distributed π-Calculus , 1999 .

[6]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[7]  Luca Cardelli,et al.  Mobile Ambients , 1998, Foundations of Software Science and Computation Structure.

[8]  James Riely,et al.  Resource Access Control in Systems of Mobile Agents , 2002, Inf. Comput..

[9]  François Pottier,et al.  Simplifying Subtyping Constraints: A Theory , 2001, Inf. Comput..

[10]  Jean-Jacques Lévy,et al.  A Calculus of Mobile Agents , 1996, CONCUR.

[11]  John C. Mitchell,et al.  Type Inference with Extended Pattern Matching and Subtypes , 1993, Fundamenta Informaticae.