PolyA: True Type Polymorphism for Mobile Ambients

Previous type systems for mobility calculi (the original Mobile Ambients, its variants and descendants, e.g., Boxed Ambients and Safe Ambients, and other related systems)offer little support for generic mobile agents. Previous systems either do not handle communication at all or globally assign fixed communication types to ambient names that do not change as an ambient moves around or interacts with other ambients. This makes it hard to type examples such as a messenger ambient that uses communication primitives to collect a message of non-predetermined type and deliver it to a non-predetermined destination.

[1]  Joe B. Wells,et al.  Type Inference for PolyA , 2004 .

[2]  Michele Bugliesi,et al.  Communication Interference in Mobile Boxed Ambients , 2002, FSTTCS.

[3]  Davide Sangiorgi,et al.  Controlling interference in ambients , 2000, POPL '00.

[4]  Joe B. Wells,et al.  The Essence of Principal Typings , 2002, ICALP.

[5]  Torben Amtoft,et al.  What Are Polymorphically-Typed Ambients? , 2001, ESOP.

[6]  Sergio Maffeis,et al.  Sequence Types for the pi-calculus , 2005, ITRS.

[7]  Pascal Zimmer.  Subtyping and Typing Algorithms for Mobile Ambients , 2000, FoSSaCS.

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

[9]  Vladimiro Sassone,et al.  A Dependently Typed Ambient Calculus , 2004, ESOP.

[10]  Luca Cardelli,et al.  Mobility Types for Mobile Ambients , 1999, ICALP.

[11]  Michele Bugliesi,et al.  Boxed Ambients , 2001, TACS.

[12]  C PierceBenjamin,et al.  Behavioral equivalence in the polymorphic pi-calculus , 2000 .

[13]  Mariangiola Dezani-Ciancaglini,et al.  Mobility Types for Mobile Processes in Mobile Ambients , 2003, Electron. Notes Theor. Comput. Sci..

[14]  Sergio Maeis.  Sequence Types for the -calculus , 2004 .

[15]  Richard S. Varga,et al.  Proof of Theorem 6 , 1983 .

[16]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[17]  David Teller,et al.  Using ambients to control resources , 2004, International Journal of Information Security.

[18]  Neal Glew,et al.  A Theory of Second-Order Trees , 2002, ESOP.

[19]  Flemming Nielson,et al.  Shape analysis for mobile ambients , 2000, POPL '00.

[20]  Luca Cardelli,et al.  Types for mobile ambients , 1999, POPL '99.

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

[22]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[23]  Luca Cardelli,et al.  On understanding types, data abstraction, and polymorphism , 1985, CSUR.

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

[25]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[26]  Torben Amtoft,et al.  Orderly communication in the Ambient Calculus , 2002, Comput. Lang. Syst. Struct..

[27]  Flemming Nielson,et al.  A Kleene Analysis of Mobile Ambients , 2000, ESOP.

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

[29]  Sergio Maffeis,et al.  An Abstract Interpretation Framework for Analysing Mobile Ambients , 2001, SAS.

[30]  Georg Sander,et al.  Graph Layout through the VCG Tool , 1994, GD.