Skip to main content

Algebraic graph derivations for graphical calculi

  • Conference paper
  • First Online:
Book cover Graph-Theoretic Concepts in Computer Science (WG 1996)

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

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Carolyn Brown and Graham Hutton. Categories, allegories and circuit design. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 372–381, Paris, France, 4–7 July 1994. IEEE Computer Society Press.

    Google Scholar 

  2. Arne Bayer and Wolfram Kahl. The Higher-Object Programming System “HOPS”. In Bettina Buth and Rudolf Berghammer, editors, Systems for Computer-Aided Specification, Development and Verification, Bericht Nr. 9416, pages 154–171. Universität Kiel, 1994. URL: http://inf2-www.informatik.unibw-muenchen.de/HOPS/papers/Bayer-Kahl-94.ps.gz.

    Google Scholar 

  3. Chris Brink and Gunther Schmidt, editors. Relational Methods in Computer Science. Springer-Verlag, Wien, 1996. to appear.

    Google Scholar 

  4. Sharon Curtis and Gavin Lowe. A graphical calculus. In Bernhard Möller, editor, Mathematics of Program Construction, Third International Conference, MPC '95, Kloster Irsee, Germany, July 1995, volume 947 of LNCS, pages 214–231. Springer Verlag, 1995.

    Google Scholar 

  5. Hartmut Ehrig. Introduction to the algebraic theory of graph grammars. In Volker Claus, Hartmut Ehrig, and Grzegorz Rozenberg, editors, Graph-Grammars and Their Application to Computer Science and Biology, International Workshop, volume 73 of Lecture Notes in Computer Science, pages 1–69, Bad Honnef, November 1978. Springer-Verlag.

    Google Scholar 

  6. Hartmut Ehrig, Martin Korff, and Michael Löwe. Tutorial introduction to the algebraic approach of graph grammars based on double and single pushouts. In Ehrig et al. [EKR90]. pages 24–37.

    Google Scholar 

  7. Hartmut Ehrig, Hans-Jörg Kreowski, and Grzegorz Rozenberg, editors. Graph-Grammars and Their Application to Computer Science, 4th International Workshop, volume 532 of Lecture Notes in Computer Science, Bremen, Germany, March 1990. Springer-Verlag.

    Google Scholar 

  8. Peter J. Freyd and Andre Scedrov. Categories, Allegories, volume 39 of North-Holland Mathematical Library. North-Holland, Amsterdam, 1990.

    Google Scholar 

  9. Wolfram Kahl. Can functional programming be liberated from the applicative style? In BjØrn Pehrson and Imre Simon, editors Technology and Foundations, Information Processing '94, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August–2 September 1994, Volume I, volume A-51 of IFIP Transactions, pages 330–335. IFIP, North-Holland, 1994.

    Google Scholar 

  10. Wolfram Kahl. Aspects of typed term graphs. In Tiziana Margaria, editor, Kolloquium Programmiersprachen und Grundlagen der Programmierung, Adalbert Stifter Haus, Alt Reichenau, 11.–13. Oktober 1995, Bericht MIP-9519, pages 104–109. Universität Passau, Fakultät für Mathematik und Informatik, December 1995.

    Google Scholar 

  11. Wolfram Kahl. Kategorien von Termgraphen mit gebundenen Variablen. Technischer Bericht 9503, Fakultät für Informatik, Universität der Bundeswehr München, September 1995.

    Google Scholar 

  12. Wolfram Kahl. Algebraische Termgraphersetzung mit gebundenen Variablen. Reihe Informatik. Herbert Utz Verlag Wissenschaft, München, 1996. 3-931327-60-4; also doctoral dissertation at Fakultät für Informatik, Universität der Bundeswehr München.

    Google Scholar 

  13. Richard Kennaway. Graph rewriting in some categories of partial morphisms. In Ehrig et al. [EKR90]. pages 490–504.

    Google Scholar 

  14. Michael Löwe. Algebraic approach to graph transformation based on single pushout derivations. Technical Report 90/05, TU Berlin, 1990.

    Google Scholar 

  15. J. M. Spivey. The Z Notation: A Reference Manual. Prentice Hall International Series in Computer Science. Prentice Hall, 1989.

    Google Scholar 

  16. Gunther Schmidt and Thomas Ströhlein. Relations and Graphs, Discrete Mathematics for Computer Scientists. EATCS-Monographs on Theoretical Computer Science. Springer Verlag, 1993.

    Google Scholar 

  17. Paulo A. S. Veloso and Armando M. Haeberer. A finitary relational algebra for classical first-order logic. Bulletin of the Section on Logic of the Polish Academy of Sciences, 20(2):52–62, 1991.

    Google Scholar 

  18. Hans Zierer, Gunther Schmidt, and Rudolf Berghammer. An interactive graphical manipulation system for higher objects based on relational algebra. In Gottfried Tinhofer and Gunther Schmidt, editors, Proc. 12th International Workshop on Graph-Theoretic Concepts in Computer Science, LNCS 246, pages 68–81, Bernried, Starnberger See, June 1986. Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Fabrizio d'Amore Paolo Giulio Franciosa Alberto Marchetti-Spaccamela

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kahl, W. (1997). Algebraic graph derivations for graphical calculi. In: d'Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds) Graph-Theoretic Concepts in Computer Science. WG 1996. Lecture Notes in Computer Science, vol 1197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62559-3_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-62559-3_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62559-9

  • Online ISBN: 978-3-540-68072-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics