The graph-rewriting package

[Tags: bsd3, library]

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.


Versions0.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
Change logNone available
Dependenciesbase (>=4.3 && <4.6), base-unicode-symbols (==0.2.*), containers (>=0.3 && <0.5), mtl (>=1.1 && <2.1) [details]
Copyright(c) 2010, Jan Rochel
AuthorJan Rochel
CategoryGraphs, Data
Home page
UploadedSat Jul 14 16:25:17 UTC 2012 by JanRochel
Downloads2122 total (97 in last 30 days)
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]




Maintainers' corner

For package maintainers and hackage trustees