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
Dependenciesbase (>=4 && <4.7), base-unicode-symbols (==0.2.*), GLUT (>=2.2 && <2.6), graph-rewriting (==0.7.*), graph-rewriting-gl (>=0.6.9 && <0.8), graph-rewriting-layout (>=0.5.1 && <0.6), IndentParser (==0.2.*), OpenGL (>=2.4 && <2.10), parsec (==2.1.*)
LicenseBSD3
Copyright(c) 2010, Jan Rochel
AuthorJan Rochel
Maintainerjan@rochel.info
CategoryApplication, Compilers/Interpreters
Home pagehttp://rochel.info/#graph-rewriting
Executablesww
Upload dateTue Jun 24 12:15:34 UTC 2014
Uploaded byJanRochel
Downloads378 total (25 in last 30 days)

Downloads

Maintainers' corner

For package maintainers and hackage trustees