The graph-rewriting-trs package

[Tags: bsd3, program]

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.


Versions0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.1.5, 0.1.6
Change logNone available
Dependenciesbase (>=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.*) [details]
Copyright(c) 2011, Jan Rochel
AuthorJan Rochel
CategoryGraphs, Application
Home page
UploadedWed Feb 16 10:59:19 UTC 2011 by JanRochel
Downloads1126 total (35 in last 30 days)
0 []
StatusDocs not available [build log]
All reported builds failed as of 2015-11-19 [all 4 reports]


Maintainers' corner

For package maintainers and hackage trustees