graph-rewriting-trs: Evaluate a first-order term rewrite system interactively using graph reduction

[ application, bsd3, compilers-interpreters, program ] [ Propose Tags ]

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.

Versions [faq] 0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.1.5, 0.1.6, 0.1.7, 0.1.8, 0.1.9
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.*) [details]
License BSD-3-Clause
Copyright (c) 2011, Jan Rochel
Author Jan Rochel
Maintainer jan@rochel.info
Category Graphs, Application
Home page http://rochel.info/#graph-rewriting
Uploaded by JanRochel at Mon Feb 7 19:10:18 UTC 2011
Distributions NixOS:0.1.9
Executables trs
Downloads 4214 total (88 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs not available [build log]
All reported builds failed as of 2016-12-28 [all 6 reports]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees