References

[1]

A. W. Appel. Compiling with continuations. Cambridge University Press, 1992.

[2]

L. Augustsson. Compiling pattern matching. In Proc. of the ACM Functional Programming and Computer Architecture Conference, 1985.

[3]

G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217–248, 1992.

[4]

C. Fournet and G. Gonthier. The reflexive chemical abstract machine and the join-calculus. In 23rd ACM Symposium on Principles of Programming Languages (POPL’96), 1996.

[5]

C. Fournet, G. Gonthier, J.-J. Lévy, L. Maranget, and D. Rémy. A calculus of mobile agents. In 7th International Conference on Concurrency Theory (CONCUR’96), 1996. LNCS 1119.

[6]

C. Fournet, C. Laneve, L. Maranget, and D. Rémy. Implicit Typing à la ML for the join-calculus. In Proc. of the 1997 8th International Conference on Concurrency Theory. Springer-Verlag, 1997.

[7]

C. Fournet and L. Maranget. The join system. Software and documentation available on the Web, http://pauillac.inria.fr/join/, 1997.

[8]

F. Le Fessant. The jocaml system prototype. Software and documentation available on the Web, http://pauillac.inria.fr/jocaml/, 1998.

[9]

X. Leroy, J. Vouillon, and D. Doligez. The Objective Caml system. Software and documentation available on the Web, http://pauillac.inria.fr/ocaml/, 1996.

[10]

L. Maranget. Compiling lazy pattern matching. In Proc. of the 1992 conference on Lisp and Functional Programming. ACM Press, 1992.

[11]

R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes: part 1. Research Report ECS-LFCS-89-85, University of Edinburgh, 1989.

[12]

L. Padovani. The bologna join system. Software and documentation (in italian) available on the Web, ftp://ftp.cs.unibo.it/pub/asperti/jcb01.tar.gz, 1997.

[13]

M. Shapiro, P. Dickman, and D. Plainfossé. SSP chains: Robust, distributed references supporting acyclic garbage collection. Rapport de Recherche 1799, INRIA, Nov. 1992. Also available as Broadcast Technical Report #1.