Schneider HJ, Minas M (2010)
Publication Language: English
Publication Type: Book chapter / Article in edited volumes
Publication year: 2010
Publisher: Springer-verlag
Edited Volumes: Graph Transformations and Model-Driven Engineering - Essays Dedicated to Manfred Nagl on the Occasion of his 65th Birthday
Series: Lecture Notes Computer Science
City/Town: Berlin/Heidelberg
Book Volume: 5765
Pages Range: 33-58
ISBN: 978-3-642-17321-9
URI: https://www2.cs.fau.de/staff/schneider/gtbook/fmn-final.pdf
DOI: 10.1007/978-3-642-17322-6_3
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.
APA:
Schneider, H.J., & Minas, M. (2010). Graph transformation by computational category theory. In Graph Transformations and Model-Driven Engineering - Essays Dedicated to Manfred Nagl on the Occasion of his 65th Birthday. (pp. 33-58). Berlin/Heidelberg: Springer-verlag.
MLA:
Schneider, Hans Jürgen, and Mark Minas. "Graph transformation by computational category theory." Graph Transformations and Model-Driven Engineering - Essays Dedicated to Manfred Nagl on the Occasion of his 65th Birthday. Berlin/Heidelberg: Springer-verlag, 2010. 33-58.
BibTeX: Download