The graph-rewriting-ww package

[Tags:bsd3, program]

Evaluate a given λ-term (letrecs may be used) interactively. It uses duplicators to explicitly render fully-lazy sharing according to Wadsworth's approach. The reduction rules are split into two groups, safe rules and unsafe rules, which implement the procedure for unsharing the MFE under one duplicator.

Properties

Versions 0.1, 0.2, 0.3, 0.3.1, 0.3.2, 0.3.3, 0.3.4, 0.3.5
Dependencies base (>=4 && <4.9), base-unicode-symbols (==0.2.*), GLUT (>=2.2 && <2.8), graph-rewriting (>=0.7.8 && <0.8), graph-rewriting-gl (>=0.7.6 && <0.8), graph-rewriting-layout (>=0.5.4 && <0.6), IndentParser (==0.2.*), OpenGL (==3.*), parsec (==3.1.*) [details]
License BSD3
Copyright (c) 2010, Jan Rochel
Author Jan Rochel
Maintainer jan@rochel.info
Stability Unknown
Category Application, Compilers/Interpreters
Home page http://rochel.info/#graph-rewriting
Uploaded Fri Feb 5 22:57:12 UTC 2016 by JanRochel
Distributions NixOS:0.3.5
Downloads 1514 total (70 in the last 30 days)
Votes
0 []
Status Docs not available [build log]
Last success reported on 2016-02-12 [all 3 reports]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees