Abstract
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.
Partially supported by ESPRIT BRA Integration
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
P.H.M. America, Issues in the design of a parallel object-oriented language, Formal Aspects of Computing 1 (1989), pp. 366–411.
P.H.M. America, J.W. de Bakker, Designing equivalent semantic models for process creation, Theoretical Computer Science 60 (1988) 109–176.
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.
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.
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.
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.
P.H.M. America, J.J.M.M. Rutten, A layered semantics for a parallel object-oriented language, CS-R9052, CWI, Amsterdam, 1990.
ANSI. The Programming Language ADA Reference Manual, ANSI/MIL-STD 1815A-1983, Vol. 155, Springer, 1983.
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.
J.W. de Bakker, Designing concurrency semantics, in: Proc. 11th World Computer Congress (G.X. Ritter, ed.), North Holland, 1989, pp. 591–598.
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.
J.W. de Bakker, J.N. Kok, Comparative metric semantics for Concurrent Prolog, Theoretical Computer Science 75 (1990), 15–44.
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.
J.W. de Bakker, J.-J.Ch. Meyer, Metric semantics for concurrency, BIT 28, pp. 504–529, 1988.
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.
J.W. de Bakker, J.I. Zucker, Processes and the denotational semantics of concurrency, Information and Control 54 (1982) 70–120.
J.A. Bergstra, J.W. Klop, A convergence theorem in process algebra, Report CS-8733, CWI, Amsterdam, 1987.
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.
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.
F. van Breugel, Comparative semantics for a real-time programming language with integration, these Proceedings.
A. de Bruin, Exercises in continuation semantics: jumps, backtracking, dynamic networks, PhD Thesis, Vrije Universiteit Amsterdam, 1986.
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.
H. Hahn, Reelle Funktionen, Chelsea 1948.
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, 1990
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.
J.N. Kok, J.J.M.M. Rutten, Contractions in comparing concurrency semantics, Theoretical Computer Science 76, pp. 180–222 (1990).
K. Kuratowski, Sur une méthode de métrisation complète des certains espaces d'ensembles compacts, Fundamenta Mathematicae 42 (1956), pp. 114–138.
E. Michael, Topologies on spaces of subsets, Transactions of the AMS 71, 1951, pp. 152–182.
R. Milner, A Calculus for Communicating Systems, LNCS 92, Springer, 1980.
M. Nivat, Mots infinis engendrés par une grammaire algabrique, RAIRO Informatique Théorique 11 (1977) pp. 311–327.
M. Nivat, Sur les ensembles de mots infinis engendrés par une grammaire algébrique, RAIRO Informatique Théorique 12 (1978), pp. 259–278.
J.J.M.M. Rutten, Semantic correctness for a parallel object-oriented language, SIAM Journal on Computing 19, 1990, pp. 341–383.
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.
E.P. de Vink, Comparative semantics for Prolog with cut, Science of Computer Programming 13 (1990), pp. 237–264.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Bakker, J.W., de Vink, E.P. (1991). CCS for OO and LP. In: Abramsky, S., Maibaum, T.S.E. (eds) TAPSOFT '91. TAPSOFT 1991. Lecture Notes in Computer Science, vol 494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3540539816_55
Download citation
DOI: https://doi.org/10.1007/3540539816_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53981-0
Online ISBN: 978-3-540-46499-0
eBook Packages: Springer Book Archive