Evaluate first-order applicative term rewrite systems interactively using graph reduction http://rochel.info/#graph-rewriting
|Latest on Hackage:||0.1.9|
This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.
Given a set of term rewriting rules and an initial term with this tool you can interactively evaluate the corresponding term graph. The employed rule set has to be defined in one or more files. In the examples-directory a few rewriting systems are already supplied. To see how it works invoke the with the SKI-combinator rules and an initial term as arguments:
trs examples/ski.trs "SK(S(KIS)K)I". On how to interact with the application see the
GraphRewriting.GL.UI module of the graph-rewriting-gl package.