Abstract
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.
Research supported by “MyThs: Models and Types for Security in Mobile Distributed Systems”, EU FET-GC IST-2001-32617.
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
R. Amadio. On modeling mobility. Journal of Theoretical Computer Science, 240(1):147–176, 2000.
R. Amadio, G. Boudol, and C. Lhoussaine. The receptive distributive π-calculus. Technical Report 4080, INRIA, Sophia Antipolis, 2000.
G. Berry and G. Boudol. The Chemical Abstract Machine. In POPL’90, pages 81–94, San Francisco, California, January 17–19, 1990. ACM Press, New York.
L. Cardelli and A.D. Gordon. Mobile ambients. In M. Nivat, editor, FoSSaCS, volume 1378, pages 140–155. Springer-Verlag, Berlin, Germany, 1998.
C. Fournet, G. Gonthier, JJ. Lévy, L. Maranget, and D. Rémy. A calculus of mobile agents. In CONCUR’96, pages 406–421, Pisa, Italy, 1996. Springer-Verlag.
M. Hennessy and J. Riely. Resource access control in systems of mobile agents. In Information and Computation 174(2): 143–179 (2002).
L. Jategaonkar and J.C. Mitchell. Type inference with extended pattern matching and subtypes. Fundamenta Informaticae, 19(1/2):127–165, 1993.
C. Lhoussaine. Rćeptivité, mobilité et π-calcul. PhD thesis, Université de Provence, 2002.
F. Pottier. Simplifying subtyping constraints: A theory. INFCTRL: Information and Computation, 170, 2001.
Didier Rémy. Syntactic theories and the algebra of record terms. Research Report 1869, INRIA, Rocquencourt, 1993.
Didier Rémy. Type inference for records in a natural extension of ML. In Theoretical Aspects Of Object-Oriented Programming. Types, Semantics and Language Design. MIT Press, 1993.
James Riely and Matthew Hennessy. Trust and Partial Typing in Open Systems of Mobile Agents. In POPL’99, pages 93–104, 1999.
M. Wand. Complete type inference for simple objects. In Symposium on Logic in Computer Science, Ithaca, NY, pages 37–44, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lhoussaine, C. (2003). Type Inference for a Distributed π-Calculus. In: Degano, P. (eds) Programming Languages and Systems. ESOP 2003. Lecture Notes in Computer Science, vol 2618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36575-3_18
Download citation
DOI: https://doi.org/10.1007/3-540-36575-3_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00886-6
Online ISBN: 978-3-540-36575-4
eBook Packages: Springer Book Archive