Abstract
The ambient calculus was designed to model mobile processes and study their properties. A first type system was proposed by Cardelli-Gordon-Ghelli to prevent run-time faults. We extend it by introducing subtyping and present a type-checking algorithm which returns a minimal type relatively to this system. By the way, we also add two new constructs to the language. Finally, we remove the type annotations from the syntax and give a type-inference algorithm for the original type system.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
L. Cardelli. Abstractions for Mobile Computation. Secure Internet Programming: Security Issues for Distributed and Mobile Objects, 1999.
L. Cardelli. Wide Area Computation. In ICALP’99, April 1999.
L. Cardelli and A. D. Gordon. A Calculus of mobile Ambients. 1997. Slides.
L. Cardelli and A. D. Gordon. Mobile Ambients. In Proceedings FoSSaCS’98, volume LNCS 1378, pages 140–155. Springer, 1998.
L. Cardelli and A. D. Gordon. Types for Mobile Ambients. In Proceedings of the 26th ACM Symposium on Principles of Programming Languages, pages 79–92. ACM, January 1999.
L. Cardelli, G. Ghelli, and A. D. Gordon. Mobility Types for Mobile Ambients. In Proceedings of ICALP’99, volume LNCS, April 1999.
C. Fournet and A. Schmitt. An Implementation of Ambients in JoCaml. In Proceedings MOS’99, April 1999.
F. Levi and D. Sangiorgi. Controlling Interference in Ambients. Draft of a paper to appear in the Proceedings of POPL’00, 2000.
R. Milner. The Polyadic π-Calculus: a Tutorial. Technical Report ECS-LFCS-91-180, University of Edinburgh, October 1991.
J. Palsberg. Efficient Inference of Object Types. Information and Computation, 1995.
N. Yoshida and M. Hennessy. Subtyping and Locality in Distributed Higher Order Processes. Technical Report 01/99, University of Sussex, May 1999.
P. Zimmer. Subtyping and Typing Algorithms for Mobile Ambients. Internship Report — Ecole Normale Supérieure de Lyon, 1999. Available at http://www.ens-lyon.fr/~pzimmer/.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zimmer, P. (2000). Subtyping and Typing Algorithms for Mobile Ambients. In: Tiuryn, J. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2000. Lecture Notes in Computer Science, vol 1784. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46432-8_25
Download citation
DOI: https://doi.org/10.1007/3-540-46432-8_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67257-9
Online ISBN: 978-3-540-46432-7
eBook Packages: Springer Book Archive