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. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Minas, M., & Schneider, H. J. (2010). Graph transformation by computational category theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5765 LNCS, pp. 33–58). https://doi.org/10.1007/978-3-642-17322-6_3
Mendeley helps you to discover research relevant for your work.