Computational category theory
Algebraic approach to single-pushout graph transformation
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Handbook of graph grammars and computing by graph transformation
Building tightly integrated software development environments: the IPSEN approach
Building tightly integrated software development environments: the IPSEN approach
Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools
The PROGRES approach: language and environment
Handbook of graph grammars and computing by graph transformation
The AGG approach: language and environment
Handbook of graph grammars and computing by graph transformation
Concepts and realization of a diagram editor generator based on hypergraph transformation
Science of Computer Programming - Special issue on applications of graph transformations (GRATRA 2000)
Graph rewriting with unification and composition
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Algorithms and Data Structures: The Basic Toolbox
Algorithms and Data Structures: The Basic Toolbox
A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Graph-grammars: An algebraic approach
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
Changing labels in the double-pushout approach can be treated categorically
Formal Methods in Software and Systems Modeling
ICGT'06 Proceedings of the Third international conference on Graph Transformations
| Hi-index | 0.00 |
The categorical approach is well-suited for concise definitions of graph transformation concepts. At the same time, it allows for elegant proofs of their properties. We show that these categorical concepts also allow for a similarly simple and modular implementation of graphs and graph transformations by following Rydeheard and Burstall's idea of Computational Category Theory. We first present an implementation of some categorical definitions and constructions, e.g., colimits, in Java, and we demonstrate how this language supports the genericity of the categorical approach. We then show that applying the constructions to the category of sets as well as the category of graphs already provides an implementation of graph transformations that can be used as the foundation of an extensible graph transformation language.