graph-rewriting-trs

Version 0.1.7 revision 0 uploaded 2016-02-05T22:56:25.000Z by JanRochel.

Package meta

Synopsis

Evaluate first-order applicative term rewrite systems interactively using graph reduction

Description

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.

Author

Jan Rochel

Bug reports

n/a

Category

Compilers/Interpreters, Application

Copyright

(c) 2011, Jan Rochel

Homepage

http://rochel.info/#graph-rewriting

Maintainer

jan@rochel.info

Package URL

n/a

Stability

n/a

Components

• exe:trs