From graph transformation to Rule-Based programming with diagrams

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1779, Issue , 2000, Pages 165-180

  Hoffmann, Berthold ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER PROGRAMMING; METADATA;

COMPUTATIONAL MODEL; DATA ABSTRACTION; FUNCTIONAL ABSTRACTIONS; GRAPH TRANSFORMATION; RULE-BASED LANGUAGE; TRANSFORMATION MODEL; UNDERLYING GRAPHS;

GRAPH THEORY;

EID: 84974657991     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45104-8_12     Document Type: Conference Paper

References (30)

1. Marc Andries, Gregor Engels, Annegret Habel, Berthold Hoffmann, Hans-Jörg Kreowski, Sabine Kuske, Detlef Plump, Andy Schürr, and Gabriele Taentzer. Graph transformation for specification and programming. Science of Computer Programming, 34:1-54, 1999.
2. Ken Arnold and James Gosling. The Java Programming Language. Java Series. Addison-Wesley, Reading, Massachusetts, 1998. 2nd edition.
3. Andrea Corradini, Hartmut Ehrig, Reiko Heckel, Michael Löwe, Ugo Montanari, and Francesca Rossi. Algebraic approaches to graph transformation part I: Basic concepts and double pushout approach. In Rozenberg [25], chapter 3, pages 163-245.
4. Andrea Corradini, Hartmut Ehrig, Ugo Montanari, and Julia Padberg. The category of typed graph grammars and its adjunction with categories of derivations. In J. Cuny, H. Ehrig, G. Engels, and G. Rozenberg, editors, gragra, volume 1073 of Lecture Notes in Computer Science, pages 56-74. Springer, 1996.
5. Andrea Corradini and Ugo Montanari, editors. Proc. Joint CompuGraph/ Semagraph Workshop on Graph Rewriting and Computation, number 2 in Electronic Notes in Theoretical Computer Science, http://www.elsevier.nl/locate/entcs, 1995. Elsevier.
6. Frank Drewes. An optimal term rewrite implementation of queues. Report 5/93, Univ. Bremen, 1993.
7. Frank Drewes, Annegret Habel, and Hans-Jörg Kreowski. Hyperedge replacement graph grammars. In Rozenberg [25], chapter 2, pages 95-162.
8. Frank Drewes, Berthold Hoffmann, and Detlef Plump. Hierarchical graph transformation. In Jerzy Tiuryn, editor, Foundations of Software Science and Computation Structures (FOSSACS 2000), Lecture Notes in Computer Science. Springer, March 2000.
9. Hartmut Ehrig. Introduction to the algebraic theory of graph grammars. In Volker Claus, Hartmut Ehrig, and Grzegorz Rozenberg, editors, Proc. Graph Grammars and Their Application to Computer Science and Biology, number 73 in Lecture Notes in Computer Science, pages 1-69. Springer, 1979.
10. Hartmut Ehrig, Gregor Engels, Hans-Jörg Kreowski, and Grzegorz Rozenberg, editors. Theory and Application of Graph Transformation (TAGT’98), Selected Papers, number 1764 in Lecture Notes in Computer Science. Springer, 2000.
11. Gregor Engels, Hartmut Ehrig, Reiko Heckel, and Gabriele Taentzer. A viewbased approach to system modelling based on open graph transformation systems. In Engels et al. [12], chapter 16, pages 639-668.
12. Gregor Engels, Hartmut Ehrig, Hans-Jörg Kreowski, and Grzegorz Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. II: Specification and Programming. World Scientific, Singapore, 1999.
13. Gregor Engels and Andy Schürr. Encapsulated hierachical graphs, graph types, and meta types. In Corradini and Montanari [5].
14. Claudia Ermel, Michael Rudolf, and Gabriele Taentzer. The Agg approach: Language and environment. In Engels et al. [12], chapter 14, pages 551-603.
15. Thorsten Fischer, Jörg Niere, Lars Turunski, and Albert Zündorf. Story diagrams: A new graph grammar language based on the Unified Modelling Language and Java. In Ehrig et al. [10], pages 296-309.
16. Annegret Habel. Hyperedge Replacement: Grammars and Languages. Number 643 in Lecture Notes in Computer Science. Springer, 1992.
17. Annegret Habel and Detlef Plump. Unification, rewriting, and narrowing of term graphs. Electronic Notes in Theoretical Computer Science, 2, 1995.
18. Reiko Heckel, Berthold Hoffmann, Peter Knirsch, and Sabine Kuske. Simple modules for Grace. In Ehrig et al. [10], pages 383-395.
19. Jan Willem Klop. Term rewriting systems. In S. Abramsky, Dov M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 1-116. Oxford University Press, 1992.
20. Michael Löwe and Martin Beyer. AGG — an implementation of algebraic graph rewriting. In Claude Kirchner, editor, Proc. Rewriting Techniques and Applications, number 690 in Lecture Notes in Computer Science, pages 451-456. Springer, 1993.
21. Bertrand Meyer. Object-Oriented Software Construction. Prentice-Hall, New York, 1997. 2nd edition.
22. Mark Minas. Specifying diagram languages by means of hypergraph grammars. In Proc. Thinking with Diagrams (TwD’98), Aberystwyth, UK, pages 151-157, 1998
23. John Peterson and Kevin Hammond (eds.). Report on the Programming Language Haskell, Version 1.4, 1997. Available via http//www.haskell.org.
24. Terrence W. Pratt. Pair grammars, graph languages and string-to-graph translations. Journal of Computer and System Sciences, 5:560-595, 1971.
25. Grzegorz Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. I: Foundations. World Scientific, Singapore, 1997
26. James Rumbaugh, Ivar Jacobson, and Grady Booch. The Unified Modelling Language Reference Manual. Object Technology Series. Addison Wesley, 1999.
27. Hans-Jürgen Schneider. On categorical graph grammars integrating structural transformations and operations on labels. Theoretical Computer Science, 109:257-274, 1993.
28. Andy Schürr, Andreas Winter, and Albert Zündorf. The progres approach: Language and environment. In Rozenberg [25], chapter 13, pages 487-550.
29. Gabriele Taentzer. Parallel and Distributed Graph Transformation: Formal Description and Application to Communication-Based Systems. Dissertation, TU Berlin, 1996. Shaker Verlag.
30. Gabriele Taentzer and Andy Schürr. DIEGO, another step towards a module concept for graph transformation systems. In Corradini and Montanari [5].