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

[ bsd3, graphs, library ] [ Propose Tags ]

This library provides a monadic EDSL to define your own graph rewrite system in Haskell. Once you have specified the signature of your graph 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 designed as a backend for high-performance computation.

Downloads

Maintainer's Corner

Package maintainers

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 && <4.4), base-unicode-symbols (>=0.2 && <0.3), containers (>=0.3 && <0.5), mtl (>=1.1 && <1.2) [details]
License BSD-3-Clause
Copyright (c) 2010, Jan Rochel
Author Jan Rochel
Maintainer jan@rochel.info
Category Graphs, Data
Uploaded by JanRochel at 2011-02-05T17:32:02Z
Distributions
Reverse Dependencies 6 direct, 0 indirect [details]
Downloads 14354 total (34 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]