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.
Modules
[Index] [Quick Jump]
Downloads
- graph-rewriting-0.8.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 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, 0.8.0 |
|---|---|
| Dependencies | base (>=4.9 && <5), base-unicode-symbols (>=0.2 && <0.3), containers (>=0.3 && <0.7), mtl (>=1.1 && <2.3) [details] |
| License | BSD-3-Clause |
| Copyright | (c) 2010, Jan Rochel |
| Author | Jan Rochel |
| Maintainer | jan@rochel.info |
| Category | Graphs |
| Home page | http://rochel.info/#graph-rewriting |
| Uploaded | by JanRochel at 2023-12-04T17:26:56Z |
| Distributions | |
| Reverse Dependencies | 6 direct, 0 indirect [details] |
| Downloads | 14676 total (54 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2023-12-04 [all 1 reports] |