Abstract
The join-calculus is a model for distributed programming languages with migratory features. It is an asynchronous process calculus based on static scope and an explicit notion of locality and failures. It allows standard polymorphic ML-like typing and thus an integration in a realistic programming language. It has a distributed implementation on top of the Caml language. We review here some of the results recently obtained in the join-calculus.
This work is partly supported by the ESPRIT CONFER-2 WC-21836
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Amadio. An asynchronous model of locality, failure, and process mobility. To appear in COORDINATION 97, Berlin, 1997. Rapport Interne LIM February 1997, and INRIA Research Report 3109., 1997.
R. M. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous π-calculus. In Montanari and Sassone [20]. LNCS 1119.
R. M. Amadio and M. Dam. Toward a modal theory of types for the π-calculus. In Proc. Formal Techniques in Real Time and Fault Tolerant Systems 96, Uppsala, 1996. LNCS 1135.
J.-P. Banâtre, M. Banâtre, and F. Ployette. Distributed system structuring using multi-functions. Rapport de Recherche 694, INRIA Rennes, June 1987.
G. Berry and G. Boudol. The chemical abstract machine. In Proceedings POPL '90, pages 81–94, San Francisco, Jan. 17–19 1990.
A. Black, N. Hutchinson, E. Jul, and H. Levy. Object structure in the emerald system. In Object Oriented Programing: Systems, Languages, and Applications (OOPSLA), pages 78–86, 1986.
G. Boudol. Asynchrony and the π-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, 1992.
L. Cardelli. A language with distributed scope. Computing Systems, 8(1):27–59, Jan. 1995.
L. Cardelli. Global computation. ACM Sigplan Notices, 32:1:66–68, 1997.
L. Cardelli and A. Gordon. A calculus of mobile ambients. Private communication, 1997.
C. Fournet and G. Gonthier. The reflexive chemical abstract machine and the join-calculus. In Proceedings of the 23rd ACM Symposium on Principles of Programming Languages, pages 372–385, St. Petersburg Beach, Florida, Jan. 21–24 1996. ACM.
C. Fournet, G. Gonthier, J.-J. Lévy, L. Maranget, and D. Rémy. A calculus of mobile agents. In Montanari and Sassone (20]. LNCS 1119.
C. Fournet, C. Laneve, L. Maranget, and D. Rimy. Implicit typing la ML for the join-calculus. In Proceedings of the 8th International Conference on Concurrency Theory, Warsaw, Poland, 1–4 July 1997. Springer. to appear in LNCS.
C. Fournet and L. Maranget. The join-calculus language. Available electronically (http://pauillac.inria.fr/join), 1997.
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.
C. Laneve. May and must testing in the join-calculus. Technical Report UBLCS 96-04, University of Bologna, March 1996.
L. Leth and B. Thomsen. Some facile chemistry. Technical Report ECRC-92-14, European Computer-Industry Research Centre, Munich, May 1992.
R. Milner. The polyadic π-calculus: a tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification. Springer Verlag, 1993.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, parts I and II. Information and Computation, pages 1–40 & 41–77, Sept. 1992.
U. Montanari and V. Sassone, editors. Proceedings of the 7th International Conference on Concurrency Theory, Pisa, Italy, 26–29 Aug. 1996. Springer. LNCS 1119.
R. D. Nicola, G. Ferrari, and R. Pugliese. Locality based linda: programming with explicit localities. To appear in LNCS FASE-TAPSOFT'97, 1997.
B. C. Pierce, D. Rémy, and D. N. Turner. A typed higher-order programming language based on the pi-calculus. In Workshop on Type Theory and its Application to Computer Systems, Kyoto University, July 1993.
B. C. Pierce and D, N. Turner. Pict: A programming language based on the pi-calculus. Technical Report CSCI 476, Computer Science Department, Indiana University, 1997. To appear in Milner Festschrift, MIT Press, 1997.
B. C. Pierce and D. N. Turner. Pict user manual. Available electronically, 1997.
J. Riely and M. Hennessy. Distributed processes and location failures. Report 2/97, University of Sussex, Brighton, April 1997.
D. N. Turner. The π-calculus: Types, polymorphism and implementation. PhD thesis, LFCS, University of Edinburgh, 1995.
J. White. Telescript technology: the foundation for the electronic marketplace. Technical report, General Magic, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lévy, JJ. (1997). Some results in the join-calculus. In: Abadi, M., Ito, T. (eds) Theoretical Aspects of Computer Software. TACS 1997. Lecture Notes in Computer Science, vol 1281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014554
Download citation
DOI: https://doi.org/10.1007/BFb0014554
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63388-4
Online ISBN: 978-3-540-69530-1
eBook Packages: Springer Book Archive