The graph-rewriting-trs package

[ Tags: 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.

Properties

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 && <4.6), base-unicode-symbols (==0.2.*), containers (==0.4.*), directory (>=1.0 && <1.2), filepath (>=1.1 && <1.4), GLUT (>=2.2 && <2.5), 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.9), uu-parsinglib (>=2.7 && <2.9) [details]
License BSD3
Copyright (c) 2011, Jan Rochel
Author Jan Rochel
Maintainer jan@rochel.info
Category Graphs, Application
Home page http://rochel.info/#graph-rewriting
Uploaded Wed Jun 5 11:31:47 UTC 2013 by JanRochel
Distributions NixOS:0.1.9
Executables trs
Downloads 1780 total (19 in the last 30 days)
Rating 0.0 (0 ratings) [clear rating]
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2016-12-21 [all 6 reports]
Hackage Matrix CI

Downloads

Maintainer's Corner

For package maintainers and hackage trustees