CCS for OO and LP

  • J. W. de Bakker
  • E. P. de Vink
ADC Advances In Distributed Computing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 494)


We illustrate the design of comparative continuation semantics for object-oriented and logic programming languages by three case studies dealing with process creation, backtracking and rendez-vous. Operational and denotational semantics involving syntactic and semantic continuations are proposed, and their equivalence is shown. For the rendez-vous concept, we present a somewhat streamlined version of our earlier work on the semantics of the parallel object-oriented language POOL. Throughout, the metric framework is exploited, and (unique fixed points of) contracting functions are used pervasively.


Transition System Logic Programming Process Creation Operational Semantic Denotational Semantic 
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.


  1. [A89]
    P.H.M. America, Issues in the design of a parallel object-oriented language, Formal Aspects of Computing 1 (1989), pp. 366–411.Google Scholar
  2. [AB88]
    P.H.M. America, J.W. de Bakker, Designing equivalent semantic models for process creation, Theoretical Computer Science 60 (1988) 109–176.Google Scholar
  3. [ABKR86]
    P.H.M. America, J.W. de Bakker, J.N. Kok, J.J.M.M. Rutten, Operational semantics of a parallel object-oriented language, 13th ACM Symposium on Principles of Programming Languages, St. Petersburg, Florida, January 13–15, 1986, pp. 194–208.Google Scholar
  4. [ABKR89]
    P.H.M. America, J.W. de Bakker, J.N. Kok, J.J.M.M. Rutten, Denotational semantics of a parallel object-oriented language, Information and Computation, Vol. 83, pp. 152–205, 1989.Google Scholar
  5. [AR89a]
    P.H.M. America, J.J.M.M. Rutten, A parallel object-oriented language: design and semantic foundations, in J.W. de Bakker (ed.), Languages for Parallel Architectures: Design, Semantics, Implementation Models, Wiley Series in Parallel Computing (1989) pp. 1–49.Google Scholar
  6. [AR89b]
    P.H.M. America, J.J.M.M. Rutten, Solving reflexive domain equations in a category of complete metric spaces, Journal of Computer and System Sciences 39, (1989) 343–375.Google Scholar
  7. [AR90]
    P.H.M. America, J.J.M.M. Rutten, A layered semantics for a parallel object-oriented language, CS-R9052, CWI, Amsterdam, 1990.Google Scholar
  8. [ANS83]
    ANSI. The Programming Language ADA Reference Manual, ANSI/MIL-STD 1815A-1983, Vol. 155, Springer, 1983.Google Scholar
  9. [B88]
    J.W. de Bakker, Comparative semantics for flow of control in logic programming without logic, Report CS-R8840, CWI, Amsterdam (1988), revised version to appear in Information and Computation.Google Scholar
  10. [B89]
    J.W. de Bakker, Designing concurrency semantics, in: Proc. 11th World Computer Congress (G.X. Ritter, ed.), North Holland, 1989, pp. 591–598.Google Scholar
  11. [BBKM84]
    J.W. de Bakker, J.A. Bergstra, J.W. Klop, J.-J.Ch. Meyer, Linear time and branching time semantics for recursion with merge, Theoretical Computer Science 34 (1984) 135–156.Google Scholar
  12. [BK90]
    J.W. de Bakker, J.N. Kok, Comparative metric semantics for Concurrent Prolog, Theoretical Computer Science 75 (1990), 15–44.Google Scholar
  13. [BKMOZ86]
    J.W. de Bakker, J.N. Kok, J.-J.Ch. Meyer, E.-R. Olderog, J.I. Zucker, Contrasting themes in the semantics of imperative concurrency, in Current Trends in Concurrency: Overviews and Tutorials (J.W. de Bakker, W.P. de Roever, G. Rozenberg, eds.), LNCS 224, Springer (1986) 51–121.Google Scholar
  14. [BM88]
    J.W. de Bakker, J.-J.Ch. Meyer, Metric semantics for concurrency, BIT 28, pp. 504–529, 1988.Google Scholar
  15. [BMOZ88]
    J.W. de Bakker, J.-J.Ch. Meyer, E.-R. Olderog, J.I. Zucker, Transition systems, metric spaces and ready sets in the semantics of uniform concurrency, Journal of Computer and Systems Sciences 36 (1988), 158–224.Google Scholar
  16. [BZ82]
    J.W. de Bakker, J.I. Zucker, Processes and the denotational semantics of concurrency, Information and Control 54 (1982) 70–120.Google Scholar
  17. [BeK87]
    J.A. Bergstra, J.W. Klop, A convergence theorem in process algebra, Report CS-8733, CWI, Amsterdam, 1987.Google Scholar
  18. [BoKPR90]
    F.S. de Boer, J.N. Kok, C. Palamidessi, J.J.M.M. Rutten, From failure to success: Comparing a denotational and a declarative semantics for Horn Clause Logic, in Proc. of the international BCS-FACS Workshop on Semantics for Concurrency (M.Z. Kwiatkowska, M.W. Shields, R.M. Thomas, eds.), Workshops in computing, Springer (1990), 38–60.Google Scholar
  19. [BoKPR91]
    F.S. de Boer, J.N. Kok, C. Palamidessi, J.J.M.M. Rutten, The failure of failures: towards a paradigm for asynchronous communication, Report, CS-R91.., CWI, to appear.Google Scholar
  20. [Br91]
    F. van Breugel, Comparative semantics for a real-time programming language with integration, these Proceedings.Google Scholar
  21. [DeBr86]
    A. de Bruin, Exercises in continuation semantics: jumps, backtracking, dynamic networks, PhD Thesis, Vrije Universiteit Amsterdam, 1986.Google Scholar
  22. [BrVi89]
    A. de Bruin, E.P. de Vink, Continuation semantics for PROLOG with cut, Proc. TAPSOFT 89, Vol I (J. Diaz, F. Orejas, eds.), LNCS 351, Springer, pp. 178–192, 1989.Google Scholar
  23. [Ha48]
    H. Hahn, Reelle Funktionen, Chelsea 1948.Google Scholar
  24. [JaMo90]
    J.-M. Jacquet & L. Monteiro, Comparative Semantics for a Parallel Contextual Programming Language, in Proc. North-American Logic Programming Conference (S. Debray, M. Hermenegildo, eds.) pp. 195–214, MIT Press, 1990Google Scholar
  25. [K88]
    J.N. Kok, A compositional semantics for Concurrent Prolog, in Proc. 5th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, February 1988) (R. Cori, M. Wirsing, eds.), LNCS 294, pp. 373–388.Google Scholar
  26. [KR90]
    J.N. Kok, J.J.M.M. Rutten, Contractions in comparing concurrency semantics, Theoretical Computer Science 76, pp. 180–222 (1990).Google Scholar
  27. [Ku56]
    K. Kuratowski, Sur une méthode de métrisation complète des certains espaces d'ensembles compacts, Fundamenta Mathematicae 42 (1956), pp. 114–138.Google Scholar
  28. [Mic51]
    E. Michael, Topologies on spaces of subsets, Transactions of the AMS 71, 1951, pp. 152–182.Google Scholar
  29. [Mi80]
    R. Milner, A Calculus for Communicating Systems, LNCS 92, Springer, 1980.Google Scholar
  30. [Ni77]
    M. Nivat, Mots infinis engendrés par une grammaire algabrique, RAIRO Informatique Théorique 11 (1977) pp. 311–327.Google Scholar
  31. [Ni78]
    M. Nivat, Sur les ensembles de mots infinis engendrés par une grammaire algébrique, RAIRO Informatique Théorique 12 (1978), pp. 259–278.Google Scholar
  32. [R90a]
    J.J.M.M. Rutten, Semantic correctness for a parallel object-oriented language, SIAM Journal on Computing 19, 1990, pp. 341–383.Google Scholar
  33. [R90b]
    J.J.M.M. Rutten, Deriving metric models for bisimulation from transition system specifications, in Proc. IFIP TC2 Working Conference on Programming Concepts and Methods, North-Holland, 1990, pp. 148–170.Google Scholar
  34. [Vi90]
    E.P. de Vink, Comparative semantics for Prolog with cut, Science of Computer Programming 13 (1990), pp. 237–264.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • J. W. de Bakker
    • 1
    • 2
  • E. P. de Vink
    • 3
  1. 1.Centrum voor Wiskunde en InformaticaAmsterdam
  2. 2.Vrije Universiteit AmsterdamThe Netherlands
  3. 3.Department of Mathematics and Computer ScienceVrije Universiteit AmsterdamAmsterdam

Personalised recommendations