graph-rewriting: Monadic graph rewriting of hypergraphs with ports and multiedges
This library provides a monadic EDSL to define your own port graph rewrite system in Haskell. Once you have specified the signature of your nodes and a set of rewrite rules, you can apply these rules on a graph to effect a graph transformation. The aim of this library is to make it as convenient as possible to define such a system and experiment with it and is not intended as a backend for high-performance computation.
|Versions [RSS] [faq]||0.4.8, 0.4.9, 0.5, 0.5.1, 0.5.2, 0.5.3, 0.6.0, 0.7.0, 0.7.1, 0.7.2, 0.7.3, 0.7.4, 0.7.5, 0.7.6, 0.7.7, 0.7.8, 0.7.9, 0.7.10|
|Dependencies||base (==4.8.*), base-unicode-symbols (==0.2.*), containers (>=0.3 && <0.6), mtl (>=1.1 && <2.3) [details]|
|Copyright||(c) 2010, Jan Rochel|
|Revised||Revision 1 made by HerbertValerioRiedel at 2017-05-17T17:00:33Z|
|Uploaded||by JanRochel at 2016-01-27T20:23:41Z|
|Downloads||13234 total (113 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs not available [build log]
All reported builds failed as of 2016-11-28 [all 3 reports]
- graph-rewriting-0.7.8.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.