graph-rewriting-ww: Interactive evaluator of the lambda-calculus with explicit sharing
Evaluate a given λ-term (letrecs may be used) interactively in a port-graph rewriting system. 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.
Downloads
- graph-rewriting-ww-0.3.8.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
| Versions [RSS] | 0.1, 0.2, 0.3, 0.3.1, 0.3.2, 0.3.3, 0.3.4, 0.3.5, 0.3.6, 0.3.7, 0.3.8 |
|---|---|
| Dependencies | base (>=4.9 && <5), base-unicode-symbols (>=0.2 && <0.3), 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), indentparser (>=0.1 && <0.2), mtl (>=1.1 && <2.3), OpenGL (>=3.0 && <4), parsec (>=3.1 && <3.2) [details] |
| License | BSD-3-Clause |
| Copyright | (c) 2010, Jan Rochel |
| Author | Jan Rochel |
| Maintainer | jan@rochel.info |
| Category | Application, Compilers/Interpreters |
| Home page | https://github.com/jrochel/graph-rewriting |
| Bug tracker | https://github.com/jrochel/graph-rewriting/issues |
| Uploaded | by JanRochel at 2024-03-18T17:55:53Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Executables | ww |
| Downloads | 8029 total (4 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs not available [build log] Last success reported on 2024-03-18 [all 1 reports] |