A generic graph transformation, visualisation, and editing framework in Haskell

Electronic Communications of the EASST

Volumn 18, Issue , 2009, Pages

  West, Scott ^a   Kahl, Wolfram ^b  

^a ETH ZURICH   (Switzerland)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

Algebraic graph transformation; Generic graph editor; Programmed graph transformation; Pure functional programming

Indexed keywords

EID: 84988845735     PISSN: None     EISSN: 18632122     Source Type: Journal    
DOI: 10.14279/tuj.eceasst.18.273.258     Document Type: Conference Paper

References (25)

1. A. Boronat, R. Heckel. Sierpinski Triangles in MOMENT2-GT. 2007. http://www.cs.le.ac.uk/people/aboronat/tools/moment2-gt/, last visited 30 April 2009
2. A. Corradini, U. Montanari, F. Rossi, H. Ehrig, R. Heckel, M. Löwe. Algebraic Approaches to Graph Transformation, Part I: Basic Concepts and Double Pushout Approach. In Rozenberg (ed.), Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 1: Foundations. Chapter 3, pp. 163-245. World Scientific, Singapore, 1997
3. K. Ehrig, C. Ermel, S. Hänsgen, G. Taentzer. Towards Graph Transformation based Generation of Visual Editors using Eclipse. In Visual Languages and Formal Methods, Elec. Notes Theor. Comp. Sci. vol. 127. Pp. 127-143. Elsevier, 2004
4. H. Ehrig, M. Pfender, H. J. Schneider. Graph Grammars: An Algebraic Approach. In Proc. IEEE Conf. on Automata and Switching Theory, SWAT '73. Pp. 167-180. 1973
5. M. Erwig. Functional Programming with Graphs. In ICFP '97. Pp. 52-65. ACM, 1997. See also http://web.engr.oregonstate.edu/~erwig/fgl/
6. R. E. Johnson. Documenting Frameworks Using Patterns. In OOPSLA '92. Pp. 63-76. ACM, 1992
7. M. P. Jones. Functional Programming with Overloading and Higher-Order Polymorphism. In Jeuring and Meijer (eds.), Advanced Functional Programming. LNCS 925, pp. 97-136. Springer, 1995
8. W. Kahl. A Relation-Algebraic Approach to Graph Structure Transformation. 2001. Habil. Thesis, Fakultät f ür Informatik, Univ. der Bundeswehr München, Techn. Report 2002-03, http://sqrl.mcmaster.ca/~kahl/Publications/RelRew/
9. Y. Kawahara. Pushout-Complements and Basic Concepts of Grammars in Toposes. Theoretical Computer Science 77:267-289, 1990
10. D. J. King, J. Launchbury. Structuring Depth-First Search Algorithms in Haskell. Pp. 344-354 in [POP95]
11. O. Kiselyov, R. Lämmel. Haskell's overlooked object system. Draft, submitted for journal publication. Online since 30 Sept. 2004; full version released 10 Sept. 2005, http://homepages.cwi.nl/~ralf/OOHaskell/, 2005. (last accessed 19 Dec. 2008)
12. M. Kroll, C. H. Mallon. A finite taste of infinity: A GrGen.NET solution of the Sierpinski triangle case for the AGTIVE 2007 Tool Contest. 2007. http://gtcases.cs.utwente.nl/wiki/uploads/sierpinskigrgennet.pdf, last visited 30 April 2009
13. S. Liang, P. Hudak, M. Jones. Monad Transformers and Modular Interpreters. Pp. 333-343 in [POP95]
14. D. Leijen, E. Meijer. Parsec: Direct Style Monadic Parser Combinators for the Real World. Technical report UU-CS-2001-27, Department of Computer Science, Universiteit Utrecht, 2001. See also: http://www.cs.uu.nl/~daan/parsec.html
15. M. Löwe. Algebraic Approach to Graph Transformation Based on Single Pushout Derivations. Technical report 90/05, TU Berlin, 1990
16. J. de Lara Jaramillo, H. Vangheluwe, M. A. Moreno. Using Meta-Modelling and Graph Grammars to CreateModelling Environments. Electr. Notes Theor. Comput. Sci. 72(3), 2003
17. M. Minas. Specifying graph-like diagrams with DiaGen. In Proc. International Workshop on Graph-Based Tools (GraBaTs'02). ENTCS 72(2), pp. 16-25. 2002
18. M. Minas, O. Köth. Generating Diagram Editors with DiaGen. In Nagl et al. (eds.), Applications of Graph Transformations with Industrial Relevance, Proc. AGTIVE'99, Kerkrade, The Netherlands, Spt. 1999. LNCS 1779, pp. 443-440. Springer, 2000
19. S. Mazanek, M. Minas. Functional-Logic Graph Parser Combinators. In Voronkov (ed.), Rewriting Techniques and Applications, RTA 2008. LNCS 5117, pp. 261-275. Springer, 2008. http://www.springerlink.com/content/w568v7647066/
20. S. Peyton Jones et al. The Revised Haskell 98 Report. Cambridge Univ. Press, 2003. Also on http://haskell.org/
21. F. Parisi-Presicce. Single vs. double pushout derivation of graphs. In Mayr (ed.), Graph Theoretic Concepts in Computer Science, WG '92. LNCS 657, pp. 248-262. Springer, 1993
22. POPL '95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. acm press, 1995
23. A. Schürr, A. J. Winter, A. Zündorf. The PROGRES Approach: Language and Environment. In Ehrig et al. (eds.), Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 2: Applications, Languages and Tools. Chapter 13, pp. 487-550. World Scientific, Singapore, 1999
24. G. Taentzer, E. Biermann. Generating Sierpinski Triangles by the Tiger EMF Transformation Framework. 2007. http://tfs.cs.tu-berlin.de/publikationen/Papers07/TB07.pdf, last visited 30 April 2009
25. G. Taentzer, E. Biermann, D. Bisztray, B. Bohnet, I. Boneva, A. Boronat, L. Geiger, R. Geiß, Á. Horvath, O. Kniemeyer, T. Mens, B. Ness, D. Plump, T. Vajk. Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools. In Schürr et al. (eds.), Applications of Graph Transformations with Industrial Relevance, AGTIVE 2007. LNCS 5088, pp. 514-539. 2008. doi:10.1007/978-3-540-89020-1 http://www.springerlink.com/content/f65r3041v3015222/