Towards Certifiable Implementation of Graph Transformation via Relation Categories
From MaRDI portal
Publication:2915137
DOI10.1007/978-3-642-33314-9_6zbMath1364.68309MaRDI QIDQ2915137
Publication date: 21 September 2012
Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33314-9_6
68R10: Graph theory (including graph drawing) in computer science
68N18: Functional programming and lambda calculus
68Q42: Grammars and rewriting systems
18B10: Categories of spans/cospans, relations, or partial maps
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Relational and algebraic methods in computer science. 12th international conference, RAMICS 2011, Rotterdam, The Netherlands, May 30 -- June 3, 2011. Proceedings
- Collagories: relation-algebraic reasoning for gluing constructions
- Pushout-complements and basic concepts of grammars in toposes
- Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types
- A completeness theorem for Kleene algebras and the algebra of regular events
- Fundamentals of algebraic graph transformation
- Deciding Kleene Algebras in Coq
- A Functional, Successor List Based Version of Warshall’s Algorithm with Applications
- Dependently-Typed Formalisation of Relation-Algebraic Abstractions
- Algebra of programming in Agda: Dependent types for relational program derivation