graph-rewriting-strategies 0.2.1 → 0.2.2
raw patch · 1 files changed
+4/−4 lines, 1 filesdep ~basedep ~containers
Dependency ranges changed: base, containers
Files
graph-rewriting-strategies.cabal view
@@ -1,5 +1,5 @@ Name: graph-rewriting-strategies-Version: 0.2.1+Version: 0.2.2 Copyright: 2012, Robert Kreuzer, Jan Rochel License: BSD3 License-File: LICENSE@@ -9,16 +9,16 @@ Stability: alpha Build-Type: Simple Synopsis: Evaluation strategies for port-graph rewriting systems-Description: Defines a mechanism to add evaluation strategies to graph rewriting systems. Currently only leftmost-outermost reduction is implemented.+Description: Defines a mechanism to add evaluation strategies to graph rewriting systems defined in terms of the graph-rewriting library. Currently only leftmost-outermost reduction is implemented. Category: Graphs, Graphics Cabal-Version: >= 1.6 Library Build-Depends:- base >= 4 && < 4.6,+ base >= 4 && < 4.7, base-unicode-symbols >= 0.2 && < 0.3, graph-rewriting >= 0.7 && < 0.8,- containers >= 0.4 && < 0.5+ containers >= 0.4 && < 0.6 Exposed-Modules: GraphRewriting.Strategies.Control GraphRewriting.Strategies.LeftmostOutermost