@hackage graph-rewriting-strategies0.2.9

Evaluation strategies for port-graph rewriting systems

Categories
- Graphics
- Mathematics
License
BSD-3-Clause
Maintainer
jan@rochel.info
Links
- Homepage
- Documentation
- No source repository
Versions
- 0.2.9 Mon, 18 Mar 2024
- 0.2.6 Tue, 23 May 2017
- 0.2.5 Wed, 17 May 2017
- 0.2.4 Fri, 5 Feb 2016
- 0.2.3 Thu, 23 Oct 2014
- 0.2.2 Tue, 9 Sep 2014

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.

Installation
In your cabal file:
Dependencies (4)
- base >=4.9 && <5
- containers >=0.4 && <0.7
- base-unicode-symbols >=0.2 && <0.3
- graph-rewriting >=0.7.8 && <0.9.0
Dependents (1)
@hackage/graph-rewriting-lambdascope

@hackage graph-rewriting-strategies0.2.9

Categories

License

Maintainer

Links

Versions

Installation

Dependencies (4)

Dependents (1)