@hackage graph-rewriting-ww0.3.5
Evaluator of the lambda-calculus in an interactive graph rewriting system with explicit sharing
Installation
Dependencies (0)
- GLUT >=2.2 && <2.8
- IndentParser >=0.2 && <0.3
- OpenGL >=3 && <4
- base >=4 && <4.9
- base-unicode-symbols >=0.2 && <0.3
- graph-rewriting >=0.7.8 && <0.8 Show all…
Dependents (1)
@hackage/acme-everything
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.