Skip to main content
SpringerLink
Log in
Book cover

Graph Transformations in Computer Science pp 71–85Cite as

Graph-grammar semantics of a higher-order programming language for distributed systems

  • Conference paper
  • First Online:

  • 168 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 776))

Abstract

We will consider a new tiny, yet powerful, programming language for distributed systems, called DHOP, which has its operational semantics given as algebraic graph rewrite rules in a certain category of labeled graphs. Our approach allows to separate actions which affect several processes from local changes such as variable bindings. We also sketch how to derive an implementation from this specification.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. America: Designing an Object-Oriented Programming Language with Behavioural Subtyping. In: Foundations of Object-Oriented Languages, LNCS 489 (1991), 60–90.

    Google Scholar 

  2. G. Andrews, R. Olsson: The SR Programming Language: Concurrency in Practice. Benjamin/Cummings 1993.

    Google Scholar 

  3. ANSI: The Programming Language Ada. Reference Manual. LNCS 155 (1983).

    Google Scholar 

  4. M. Bauderon, B. Courcelle: Graph Expressions and Graph Rewritings. Math. Systems Theory 20 (1987), 83–127.

    Article  Google Scholar 

  5. J.A. Bergstra, J.W. Klop: Algebra of communicating processes with abstraction. TCS 37 (1985), 77–121.

    Google Scholar 

  6. P. Böhm, H.-R. Fonio, A. Habel: Amalgamation of graph transformations: A synchronization mechanism. JCSS 34 (1987), 377–408.

    Google Scholar 

  7. A. de Bruin, W. Böhm: The Denotational Semantics of Dynamic Networks of Processes. ACM ToPLaS 7/4 (1985), 656–679.

    Google Scholar 

  8. P. Degano, U. Montanari: A model for distributed systems based on graph rewriting. JACM 34/2 (1987), 411–449.

    Google Scholar 

  9. H. Ehrig: Tutorial introduction to the algebraic approach of graph grammars. In: GraGra 86, LNCS 291 (1987), 3–14.

    Google Scholar 

  10. L. Hess, B.H. Mayoh: Graphics and their grammars. In: GraGra 86, LNCS 291 (1987), 232–249.

    Google Scholar 

  11. C. A. R. Hoare: Communicating Sequential Processes. Prentice Hall 1985.

    Google Scholar 

  12. INMOS Limited: occam 2 Reference Manual. Prentice Hall 1988.

    Google Scholar 

  13. D. Janssens: Equivalence of computations in actor grammars. TCS 109 (1993), 145–180.

    Google Scholar 

  14. R. Milner: Communication and Concurrency. Prentice Hall 1989.

    Google Scholar 

  15. R. Milner, J. Parrow, D. Walker: A Calculus of Mobile Processes I & II. Information and Control 100 (1992), 1–77.

    Google Scholar 

  16. U. Montanari, F. Rossi: Graph rewriting for a partial ordering semantics of concurrent constraint programming. TCS 109 (1993), 225–256.

    Google Scholar 

  17. M. Nielsen, G. Plotkin, G. Winskel: Petri nets, event structures and domains. TCS 13 (1981), 85–108.

    Google Scholar 

  18. F. Nielson: The Typed λ-Calculus with First Class Processes. In: PARLE 89, LNCS 366 (1989), 357–373.

    Google Scholar 

  19. S. Prasad, A. Giacalone, P. Mishra: Operational and Algebraic Semantics for Facile: A Symmetric Integration of Concurrent and Functional Programming. In: ICALP 90, LNCS 443 (1990), 765–780.

    Google Scholar 

  20. D.E. Rydeheard, R.M. Burstall: Computational Category Theory. Prentice Hall 1988.

    Google Scholar 

  21. G. Schied: Über Graphgrammatiken, eine Spezifikationsmethode für Programmiersprachen und verteilte Regelsysteme. Dissertation, Arbeitsberichte des IMMD 25, 2, Universität Erlangen-Nürnberg 1992.

    Google Scholar 

  22. H.J. Schneider: Describing Distributed Systems by Categorical Graph Grammars. In: WG 89, LNCS 411 (1989), 121–135.

    Google Scholar 

  23. H.J. Schneider: On categorical graph grammars integrating structural transformations and operations on labels. TCS 109 (1993), 257–274.

    Google Scholar 

  24. B. Thomsen: Plain CHOCS—A second generation calculus for higher order processes. Acta Informatica 30 (1993), 1–59.

    Google Scholar 

  25. D. Walker: π-Calculus Semantics for Object-Oriented Programming Languages. In: TACS 91, LNCS 526 (1991), 532–547.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Johannes Gutenberg-Universität Mainz, Staudinger Weg 9, Postfach 3980, 55099, Mainz, Germany

    Klaus Barthelmann

  2. Abteilung für Programmiersprachen, Institut für Informatik, Breitwiesenstr. 20-22, 70565, Stuttgart, Germany

    Georg Schied

Authors
  1. Klaus Barthelmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Georg Schied
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hans Jürgen Schneider Hartmut Ehrig

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barthelmann, K., Schied, G. (1994). Graph-grammar semantics of a higher-order programming language for distributed systems. In: Schneider, H.J., Ehrig, H. (eds) Graph Transformations in Computer Science. Lecture Notes in Computer Science, vol 776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57787-4_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-57787-4_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57787-4

  • Online ISBN: 978-3-540-48333-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation