@hackage graph-rewriting0.5

Monadic graph rewriting of hypergraphs with ports and multiedges

Categories
- Mathematics
License
BSD-3-Clause
Maintainer
jan@rochel.info
Links
- Documentation
- No source repository
Versions
- 0.8.0 Mon, 4 Dec 2023
- 0.7.10 Mon, 18 Mar 2024
- 0.7.9 Mon, 18 Mar 2024
- 0.7.8 Wed, 17 May 2017
- 0.7.7 Wed, 17 May 2017
- 0.7.6 Thu, 23 Oct 2014

Installation
In your cabal file:
Dependencies (4)
- base >=4 && <4.4
- containers >=0.3 && <0.5
- mtl >=1.1 && <1.2
- base-unicode-symbols >=0.2 && <0.3
Dependents (9)
@hackage/graph-rewriting-strategies, @hackage/graph-rewriting-lambdascope, @hackage/graph-rewriting-gl, @hackage/graph-rewriting-ww, @hackage/acme-everything, @hackage/graph-rewriting-cl, Show all…

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.

@hackage graph-rewriting0.5

Categories

License

Maintainer

Links

Versions

Installation

Dependencies (4)

Dependents (9)