@hackage graph-rewriting-trs0.1.10
Interactive evaluation of first-order applicative term rewrite systems
Categories
License
BSD-3-Clause
Maintainer
jan@rochel.info
Links
- Homepage
- Documentation
- No source repository
- Security
Versions
Installation
Dependencies (0)
- GLUT >=2.2 && <3
- OpenGL >=3.0 && <4
- base >=4.9 && <5
- base-unicode-symbols >=0.2 && <0.3
- containers >=0.4 && <0.8
- directory >=1.0 && <3 Show all…
Dependents (1)
@hackage/acme-everything
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.