Sequence Types for the pi-calculus

We introduce channel sequence types to study finitary polymorphism in the context of mobile processes modelled in the @p-calculus. We associate to each channel a set of exchange types, and we require that output processes send values of one of those types, and input processes accept values of any type in the set. Our type assignment system enjoys subject reduction and guarantees the absence of communication errors. We give several examples of polymorphism, and we encode the @l-calculus with the strict intersection type discipline.

[1]  B. Pierce.  Programming with intersection types and bounded polymorphism , 1992 .

[2]  Vasco Thudichum Vasconcelos.  Predicative Polymorphism in Pi-Calculus , 1994, PARLE.

[3]  David Walker,et al.  A Polymorphic Type System for the Polyadic pi-calculus , 1995, CONCUR.

[4]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[5]  John C. Reynolds,et al.  Preliminary design of the programming language Forsythe , 1988 .

[6]  Mariangiola Dezani-Ciancaglini,et al.  A filter model for mobile processes , 1999, Math. Struct. Comput. Sci..

[7]  Mariangiola Dezani-Ciancaglini,et al.  A Fully Abstract Model for Higher-Order Mobile Ambients , 2002, VMCAI.

[8]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[9]  Mariangiola Dezani-Ciancaglini,et al.  An extension of the basic functionality theory for the λ-calculus , 1980, Notre Dame J. Formal Log..

[10]  Steffen van Bakel,et al.  Complete Restrictions of the Intersection Type Discipline , 1992, Theor. Comput. Sci..

[11]  Steffen van Bakel,et al.  Rank 2 Intersection Type Assignment in Term Rewriting Systems , 1996, Fundam. Informaticae.

[12]  Sergio Maffeis,et al.  On the Expressive Power of Polyadic Synchronisation in pi-calculus , 2002, EXPRESS.

[13]  Vasco Thudichum Vasconcelos,et al.  Principal Typing Schemes in a Polyadic pi-Calculus , 1993, CONCUR.

[14]  Steffen van Bakel,et al.  Intersection Type Assignment Systems , 1995, Theor. Comput. Sci..

[15]  Mariangiola Dezani-Ciancaglini,et al.  Functional Characters of Solvable Terms , 1981, Math. Log. Q..

[16]  Torben Amtoft,et al.  PolyA: True Type Polymorphism for Mobile Ambients , 2004, IFIP TCS.

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

[18]  Steffen van Bakel,et al.  Principal Type Schemes for the Strict Type Assignment System , 1993, J. Log. Comput..

[19]  David N. Turner,et al.  The polymorphic Pi-calculus : theory and implementation , 1996 .

[20]  Davide Sangiorgi,et al.  Behavioral equivalence in the polymorphic pi-calculus , 2000, JACM.

[21]  Mariangiola Dezani-Ciancaglini,et al.  A filter lambda model and the completeness of type assignment , 1983, Journal of Symbolic Logic.