graph-rewriting-trs: Interactive evaluation of first-order applicative term rewrite systems

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

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.

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 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, 0.1.10
Dependencies base (>=4.9 && <5), base-unicode-symbols (>=0.2 && <0.3), containers (>=0.4 && <0.8), directory (>=1.0 && <3), filepath (>=1.1 && <2), GLUT (>=2.2 && <3), graph-rewriting (>=0.7.8 && <0.9), graph-rewriting-gl (>=0.7.6 && <0.8), graph-rewriting-layout (>=0.5.4 && <0.6), OpenGL (>=3.0 && <4), uu-parsinglib (>=2.7 && <3) [details]
License BSD-3-Clause
Copyright (c) 2011, Jan Rochel
Author Jan Rochel
Maintainer jan@rochel.info
Category Compilers/Interpreters, Application
Home page http://rochel.info/#graph-rewriting
Uploaded by JanRochel at 2024-03-18T17:33:50Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Executables trs
Downloads 7760 total (42 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2024-03-18 [all 2 reports]