The graph-rewriting-trs package
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.
- No changelog available
Properties
| Versions | 0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4 |
|---|---|
| Dependencies | base (>=4 && <4.4), base-unicode-symbols (==0.2.*), containers (==0.4.*), directory (==1.0.*), filepath (==1.1.*), GLUT (==2.2.*), graph-rewriting (>=0.5.2 && <0.6), graph-rewriting-gl (==0.6.*), graph-rewriting-layout (>=0.4.1 && <0.5), OpenGL (==2.4.*), uu-parsinglib (==2.5.*) |
| License | BSD3 |
| Copyright | (c) 2011, Jan Rochel |
| Author | Jan Rochel |
| Maintainer | jan@rochel.info |
| Stability | beta |
| Category | Graphs, Application |
| Home page | http://rochel.info/#graph-rewriting |
| Executables | trs |
| Upload date | Wed Feb 16 10:59:19 UTC 2011 |
| Uploaded by | JanRochel |
| Downloads | 53 total |
Downloads
- graph-rewriting-trs-0.1.2.tar.gz [browse] (Cabal source package)
- Package description (included in the package)
Maintainers' corner
For package maintainers and hackage trustees