graph-rewriting 0.7.3 → 0.7.4

raw patch · 1 files changed

+3/−3 lines, 1 filesdep ~basePVP ok

version bump matches the API change (PVP)

Dependency ranges changed: base

API changes (from Hackage documentation)

Files

• graph-rewriting.cabal +3/−3

@@ -1,5 +1,5 @@ Name:           graph-rewriting-Version:        0.7.3+Version:        0.7.4 Copyright:      (c) 2010, Jan Rochel License:        BSD3 License-File:   LICENSE@@ -11,12 +11,12 @@ Synopsis:       Monadic graph rewriting of hypergraphs with ports and multiedges Description:   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.-Category:       Graphs, Data+Category:       Graphs Cabal-Version:  >= 1.6  Library   Build-Depends:-    base >= 4.0 && < 4.6,+    base >= 4.0 && < 4.7,     base-unicode-symbols >= 0.2 && < 0.3,     mtl >= 1.1 && < 2.1,     containers >= 0.3 && < 0.5