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.

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.2, 0.2.1, 0.2.2, 0.2.3, 0.2.4, 0.2.5, 0.2.6, 0.2.9
Dependencies base (>=4.9 && <5), base-unicode-symbols (>=0.2 && <0.3), containers (>=0.4 && <0.7), graph-rewriting (>=0.7.8 && <0.9.0) [details]
License BSD-3-Clause
Copyright 2012, Robert Kreuzer, Jan Rochel
Author Robert Kreuzer, Jan Rochel
Maintainer jan@rochel.info
Category Graphs
Home page https://github.com/jrochel/graph-rewriting
Bug tracker https://github.com/jrochel/graph-rewriting/issues
Uploaded by JanRochel at 2024-03-18T12:17:46Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 5362 total (27 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2024-03-18 [all 1 reports]