graph-rewriting-0.7.3: Monadic graph rewriting of hypergraphs with ports and multiedges

The graph-rewriting package

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.

Properties

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
Dependenciesbase (≥4.0 & <4.6), base-unicode-symbols (0.2.*), containers (≥0.3 & <0.5), mtl (≥1.1 & <2.1)
LicenseBSD3
Copyright(c) 2010, Jan Rochel
AuthorJan Rochel
Maintainerjan@rochel.info
Stabilitybeta
CategoryGraphs, Data
Home pagehttp://rochel.info/#graph-rewriting
Upload dateWed Jul 18 11:21:46 UTC 2012
Uploaded byJanRochel
Built onghc-7.4

Modules

Downloads