Advertisement

Mobility in the CC-paradigm

  • Cosimo Laneve
  • Ugo Montanari
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 629)

Keywords

Closure Operator Operational Semantic Process Algebra Constraint Language Lambda Calculus 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    G. Boudol: A note on asynchronous π-calculus, preprint, 1992.Google Scholar
  2. [2]
    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.Google Scholar
  3. [3]
    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).Google Scholar
  4. [4]
    R. Milner: Functions as Processes, Info and Co, 1991.Google Scholar
  5. [5]
    C.H.L. Ong: Fully Abstract Models of the Lazy Lambda Calculus, Proc. 29th Symposium on Foundation of Computer Science, pp. 368–376, 1988.Google Scholar
  6. [6]
    V.A. Saraswat, M. Rinard: Concurrent Constraint Programming, in Proc. 17'th ACM Annual Symp. on Princ. of Progr. Lang., 1990.Google Scholar
  7. [7]
    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.Google Scholar
  8. [8]
    B. Thomsen: A Calculus of Higher Order Communicating Systems, in Proc. 16th ACM Annual Symp. on Princ. of Progr. Lang. (1989), pp.143–154.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Cosimo Laneve
    • 1
  • Ugo Montanari
    • 1
  1. 1.Dipartimento di InformaticaUniversità di Pisa Corso Italia 40PisaItaly

Personalised recommendations