graph-rewriting-ww

Evaluator of the lambda-calculus in an interactive graph rewriting system with explicit sharing http://rochel.info/#graph-rewriting

Latest on Hackage:0.3.5

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.

BSD3 licensed by Jan Rochel
Maintained by jan@rochel.info

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.

comments powered byDisqus