A calculus of mobile agents

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1119, Issue , 1996, Pages 406-421

  Fournet, Cédric ^a   Gonthier, Georges ^a   Lévy, Jean Jacques ^a   Maranget, Luc ^a   Rémy, Didier ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; CHEMICAL DETECTION; DYNAMIC LOADS; SEMANTICS;

DISTRIBUTED CALCULI; DYNAMIC LOADINGS; FAILURE DETECTION; JOIN CALCULUS; PRECISE DEFINITION; REMOTE EXECUTION; REMOTE RESOURCES;

MOBILE AGENTS;

EID: 84955565479     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61604-7_67     Document Type: Conference Paper

References (14)

1. R. Amadio and S. Prasad. Localities and failures. In 14th Foundations of Software Technology and Theoretical Computer Science Conference. Springer-Verlag, 1994. LNCS 880.
2. G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217-248, 1992.
3. K. A. Bharat and L. Cardelli. Migratory applications. Technical Report 138, DEC-SRC, February 1996.
4. G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. A theory of processes with localities. Formed Aspects of Computing, 6:165-200, 1994.
5. L. Cardelli. A language with distributed scope. Computing Systems, 8(l):27-59, Jan. 1995.
6. C. Fournet and G. Gonthier. The reflexive chemical abstract machine and the join-calculus. In 23rd A CM Symposium on Principles of Programming Languages, Jan. 1996.
7. A. Giacalone, P. Mishra, and S. Prasad. FACILE: A symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18(2):121-160, 1989.
8. K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Computer Science, 151:437-486, 1995.
9. E. Jul. Object Mobility in a Distributed Object-Oriented System. PhD thesis, University of Washington, Computer Science Department, Dec. 1988.
10. L. Leth and B. Thomsen. Some facile chemistry. Technical Report ECRC-92-14, European Computer-Industry Research Centre, Munich, May 1992.
11. R. Milner. The polyadic π-calculus: a tutorial. In Logic and Algebra of Specification. Springer Verlag, 1993.
12. B. C. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, 1995. To appear. A summary was presented at LICS ’93.
13. B. C. Pierce and D. N. Turner. Concurrent objects in a process calculus. In Theory and Practice of Parallel Programming, Sendai, Japan, Apr. 1995. LNCS 907.
14. D. Sangiorgi. Localities and non-interleaving semantics in calculi for mobile processes. Technical Report ECS-LFCS-94-282, University of Edinburgh, 94. to appear in TCS.