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. 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 && <4.6), base-unicode-symbols (==0.2.*), containers (==0.4.*), graph-rewriting (==0.7.*) [details]
License BSD-3-Clause
Copyright 2012, Robert Kreuzer, Jan Rochel
Author Robert Kreuzer, Jan Rochel
Maintainer jan@rochel.info
Category Graphs, Graphics
Home page http://rochel.info/#graph-rewriting
Uploaded by JanRochel at 2012-10-29T15:21:56Z
Distributions NixOS:0.2.6
Downloads 4938 total (16 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs not available [build log]
All reported builds failed as of 2016-12-23 [all 6 reports]

Modules

  • GraphRewriting
    • Strategies
      • GraphRewriting.Strategies.Control
      • GraphRewriting.Strategies.LeftmostOutermost

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Candidates