graph-rewriting-trs: Evaluate first-order applicative term rewrite systems interactively using graph reduction

[ application, bsd3, compilers-interpreters, program ] [ Propose Tags ]
Versions 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.*), base‑unicode‑symbols (>=0.2), containers (>=0.4), directory (>=1.0), filepath (>=1.1), GLUT (>=2.2), graph‑rewriting (>=0.7.8), graph‑rewriting‑gl (>=0.7.6), graph‑rewriting‑layout (>=0.5.4), OpenGL (>=3.0), uu‑parsinglib (>=2.7) [details]
License BSD-3-Clause
Copyright (c) 2011, Jan Rochel
Author Jan Rochel
Category Compilers/Interpreters, Application
Home page
Uploaded by JanRochel at Wed May 17 16:51:52 UTC 2017
Distributions NixOS:0.1.9
Executables trs
Downloads 3070 total (28 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
Last success reported on 2017-05-17 [all 3 reports]
Hackage Matrix CI

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.


Maintainer's Corner

For package maintainers and hackage trustees