graph-rewriting-ww: Interactive evaluator of the lambda-calculus with explicit sharing
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
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.
Properties
| Versions | 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, 0.3.8 |
|---|---|
| Change log | None available |
| 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:49Z |
Downloads
- graph-rewriting-ww-0.3.8.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees