graph-rewriting-strategies: Evaluation strategies for port-graph rewriting systems

[ bsd3, graphics, graphs, library ] [ Propose Tags ]

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.

Versions [RSS] [faq] 0.2, 0.2.1, 0.2.2, 0.2.3, 0.2.4, 0.2.5, 0.2.6
Dependencies base (>=4.8 && <4.10), base-unicode-symbols (==0.2.*), containers (>=0.4 && <0.6), graph-rewriting (>=0.7.8) [details]
License BSD-3-Clause
Copyright 2012, Robert Kreuzer, Jan Rochel
Author Robert Kreuzer, Jan Rochel
Category Graphs, Graphics
Home page
Uploaded by JanRochel at 2017-05-23T14:55:02Z
Distributions NixOS:0.2.6
Downloads 4913 total (15 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2017-05-23 [all 1 reports]




Maintainer's Corner

For package maintainers and hackage trustees