@hackage / graph-rewriting-ww

Interactive evaluator of the lambda-calculus with explicit sharing

Latest0.3.8

About

Metadata

  • Last updated , by JanRochel
  • License BSD-3-Clause
  • Categories Compilers and Interpreters

  • Maintained by: jan@rochel.info

  • Lottery factor: 0

Links

Installation

Readme

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.