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.


Properties

Versions0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.1.5
Dependenciesbase (>=4 && <4.7), base-unicode-symbols (==0.2.*), containers (>=0.4 && <0.6), directory (>=1.0 && <1.3), filepath (>=1.1 && <1.4), GLUT (>=2.2 && <2.6), graph-rewriting (>=0.7.1 && <0.8), graph-rewriting-gl (>=0.6.9 && <0.8), graph-rewriting-layout (>=0.5.1 && <0.6), OpenGL (>=2.4 && <2.10), uu-parsinglib (>=2.7 && <2.9)
LicenseBSD3
Copyright(c) 2011, Jan Rochel
AuthorJan Rochel
Maintainerjan@rochel.info
CategoryCompilers/Interpreters, Application
Home pagehttp://rochel.info/#graph-rewriting
Executablestrs
Upload dateTue Jun 24 12:41:22 UTC 2014
Uploaded byJanRochel
Downloads345 total (43 in last 30 days)

Downloads

Maintainers' corner

For package maintainers and hackage trustees