The graph-rewriting-trs package

[Tags: bsd3, program]

Given a set of term rewriting rules (see examples) and a term with this tool you can interactively evaluate the corresponding term graph by applying the rules, which are translated into their graph rewriting equivalents.


Properties

Versions0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.1.5, 0.1.6
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.*)
LicenseBSD3
Copyright(c) 2011, Jan Rochel
AuthorJan Rochel
Maintainerjan@rochel.info
Stabilityalpha
CategoryGraphs, Application
Home pagehttp://rochel.info/#graph-rewriting
Executablestrs
UploadedMon Feb 7 19:10:18 UTC 2011 by JanRochel
Downloads583 total (47 in last 30 days)
StatusDocs pending
Build status unknown [no reports yet]

Downloads

Maintainers' corner

For package maintainers and hackage trustees