Pushout-complements and basic concepts of grammars in toposes
Theoretical Computer Science
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Algebra of programming in agda: Dependent types for relational program derivation
Journal of Functional Programming
A functional, successor list based version of warshall's algorithm with applications
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Dependently-typed formalisation of relation-algebraic abstractions
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
| Hi-index | 0.00 |
The algebraic approach to graph transformation is a general framework for the definition of transformation mechanisms for complex structures that achieves its generality by using category-theoretic abstractions. We present a framework for modular implementations of categoric graph transformation mechanisms that uses abstractions of relation categories as internal interfaces. Doing this in a dependently-typed programming language enables us to manage implementations of functionality together with their correctness proofs in the same language, thus progressing towards fully verified graph transformation system implementations.