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

Versions0.1, 0.2, 0.3, 0.3.1, 0.3.2, 0.3.3, 0.3.4, 0.3.5
Change logNone available
Dependenciesbase (>=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]
LicenseBSD3
Copyright(c) 2010, Jan Rochel
AuthorJan Rochel
Maintainerjan@rochel.info
CategoryApplication, Compilers/Interpreters
Home pagehttp://rochel.info/#graph-rewriting
Executablesww
UploadedFri Feb 5 22:57:12 UTC 2016 by JanRochel
Downloads1209 total (37 in last 30 days)
Votes
0 []
StatusDocs pending
Build status unknown [no reports yet]

Downloads

Maintainers' corner

For package maintainers and hackage trustees