π-Calculus, internal mobility, and agent-passing calculi

Theoretical Computer Science

Volumn 167, Issue 1-2, 1996, Pages 235-274

  Sangiorgi, Davide ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATION THEORY; COMPUTATIONAL METHODS; MATHEMATICAL TECHNIQUES;

AGENT-PASSING CALCULI; INTERNAL MOBILITY;

COMPUTER SCIENCE;

EID: 0030260547     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(96)00075-8     Document Type: Article

References (27)

1. S. Abramsky, The lazy lambda calculus, in: D. Turner, ed., Research Topics in Functional Programming (Addison-Wesley, Reading, MA, 1989) 65-116.
2. R. Amadio, On the reduction of CHOCS bisimulation to π-calculus bisimulation, in: E. Best, ed., Proc. CONCUR '93, Lecture Notes in Computer Science, Vol. 715 (Springer, Berlin 1993).
3. E. Astesiano, A. Giovini and G. Reggio, Observational structures and their logic, Theoret. Comput. Sci. 96 (1992) 249-283.
4. H. Barendregt, The Lambda Calculus: Its Syntax and Semantics, Studies in Logic, Vol. 103 (North-Holland, Amsterdam, Revised ed., 1984).
5. J.A. Bergstra and J.W. Klop, Algebra for communicating processes with abstraction, Theoret. Comput. Sci. 37(1) (1985) 77-121.
6. M. Boreale and D. Sangiorgi, A fully abstract semantics for causality in the π-calculus, Technical Report ECS-LFCS-94-297, LFCS, Dept. of Comp. Sci., Edinburgh Univ., 1994. An extract has appeared in: Proc. STACS'95, Lecture Notes in Computer Science, Vol. 900 (Springer, Berlin, 1995).
7. M. Boreale and D. Sangiorgi, A fully abstract semantics for causality in the π-calculus, Technical Report ECS-LFCS-94-297, LFCS, Dept. of Comp. Sci., Edinburgh Univ., 1994. An extract has appeared in: Proc. STACS'95, Lecture Notes in Computer Science, Vol. 900 (Springer, Berlin, 1995).
8. B. Courcelle, Fundamental properties of infinite trees, Theoret. Comput. Sci. 25 (1983) 95-169.
9. P. Degano, S. Kasangian and S. Vigna, Applications of the calculus of trees to process description languages, in: Proc. CTCS '91 Conf., Lecture Notes in Computer Science, Vol. 530 (Springer, Berlin, 1991) 281-301.
10. G. Ferrari, U. Montanari and P. Quaglia, A π-calculus with explicit substitutions: the late semantics, in: I. Privara, B. Rovan and P. Ružička, eds., Proc. MFCS'94, Lecture Notes in Computer Science, Vol. 841 (Springer, Berlin, 1994).
11. M. Hennessy, A fully abstract denotational model for higher-order processes, in: 8th LICS Conf. (IEEE Computer Soc. Press, Silver Spring, MD, 1993).
12. C.B. Jones, A π-calculus semantics for an object-based design notation, in: E. Best, ed., Proc. CONCUR '93, Lecture Notes in Computer Science, Vol. 715 (Springer, Berlin, 1993) 158-172.
13. R. Milner, Communication and Concurrency (Prentice-Hall, Englewood Cliffs, NJ, 1989).
14. R. Milner, The polyadic π-calculus: a tutorial, Technical Report ECS-LFCS-91-180, LFCS, Dept. of Comp. Sci., Edinburgh Univ., October 1991. Also in: F.L. Bauer, W. Brauer and H. Schwichtenberg, eds., Logic and Algebra of Specification, (Springer, Berlin, 1993).
15. R. Milner, The polyadic π-calculus: a tutorial, Technical Report ECS-LFCS-91-180, LFCS, Dept. of Comp. Sci., Edinburgh Univ., October 1991. Also in: F.L. Bauer, W. Brauer and H. Schwichtenberg, eds., Logic and Algebra of Specification, (Springer, Berlin, 1993).
16. R. Milner, Functions as processes. J. Math. Struct. Comput. Sci. 2(2) (1992) 119-141.
17. R. Milner, Action calculi, or syntactic action structures, in: Proc MFCS'93, Lecture Notes in Computer Science, Vol. 711 (Springer, Berlin, 1993) 105-121.
18. R. Milner, Dynamic classification of action calculi, Handwritten notes, September 1994.
19. R. Milner, J. Parrow and D. Walker, A calculus of mobile processes (Parts I and II), Inform. and Comput. 100 (1992) 1-77.
20. B. Pierce and D. Sangiorgi, Typing and subtyping for mobile processes, in: 8th LICS Conf. (IEEE Computer Soc. Press, Silver Spring, MD, 1993) 376-385.
21. D. Sangiorgi, Expressing mobility in process algebras: first-order and higher-order paradigms, Ph.D. Thesis CST-99-93, Dept. of Computer Science, Univ. of Edinburgh, 1992.
22. D. Sangiorgi, Lazy functions and mobile processes, Technical Report RR-2515, INRIA-Sophia Antipolis, 1995; available via anonymous ftp from cma.cma.fr as pub/papers/davide/RR-2515.ps.Z.
23. D. Sangiorgi, Locality and non-interleaving semantics in calculi for mobile processes, Theoret. Comput. Sci. 155 (1996) 39-83.
24. B. Thomsen, Calculi for higher order communicating systems, Ph.D. Thesis, Dept. of Computing, Imperial College, 1990.
25. N.D. Turner, Forthcoming Ph.D. Thesis, Dept. of Computer Science, Univ. of Edinburgh, 1996.
26. V.T. Vasconcelos and K. Honda, Principal typing schemes in a polyadic π-calculus, in: E. Best, ed., Proc. CONCUR '93, Lecture Notes in Computer Science, Vol. 715 (Springer, Berlin, 1993).
27. D. Walker, Objects in the π-calculus, Inform. and Comput. 116(2) (1995) 253-271.