Preview
Unable to display preview. Download preview PDF.
References
G. Boudol: A note on asynchronous π-calculus, preprint, 1992.
J. J. Lévy: Optimal Reductions in the λ-calculus, in “To H.B. Curry, Essays on Combinatory Logic, Lambda Calculus and Formalism”, Academic Press, 1980.
R. Milner, J. Parrow, D. Walker: A Calculus of Mobile Processes, part I and II, Technical Report ECS-LFCS-89-85 and 86, Edinburgh University (1989).
R. Milner: Functions as Processes, Info and Co, 1991.
C.H.L. Ong: Fully Abstract Models of the Lazy Lambda Calculus, Proc. 29th Symposium on Foundation of Computer Science, pp. 368–376, 1988.
V.A. Saraswat, M. Rinard: Concurrent Constraint Programming, in Proc. 17'th ACM Annual Symp. on Princ. of Progr. Lang., 1990.
V.A. Saraswat, M. Rinard, P. Panangaden: Semantic Foundations of Concurrent Constraint Programming, in Proc. 18'th ACM Annual Symp. on Princ. of Progr. Lang., 1991.
B. Thomsen: A Calculus of Higher Order Communicating Systems, in Proc. 16th ACM Annual Symp. on Princ. of Progr. Lang. (1989), pp.143–154.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laneve, C., Montanari, U. (1992). Mobility in the CC-paradigm. In: Havel, I.M., Koubek, V. (eds) Mathematical Foundations of Computer Science 1992. MFCS 1992. Lecture Notes in Computer Science, vol 629. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55808-X_32
Download citation
DOI: https://doi.org/10.1007/3-540-55808-X_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55808-8
Online ISBN: 978-3-540-47291-9
eBook Packages: Springer Book Archive