graph-rewriting-ww: Evaluator of the lambda-calculus in an interactive graph rewriting system with explicit sharing

[ application, bsd3, compilers-interpreters, program ] [ Propose Tags ]

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.

Versions [RSS] [faq] 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
Dependencies base (>=4.8 && <4.10), base-unicode-symbols (==0.2.*), GLUT (>=2.2 && <2.8), graph-rewriting (>=0.7.8), graph-rewriting-gl (>=0.7.6), graph-rewriting-layout (>=0.5.4), IndentParser (==0.2.*), OpenGL (==3.0.*), parsec (==3.1.*) [details]
License BSD-3-Clause
Copyright (c) 2010, Jan Rochel
Author Jan Rochel
Category Application, Compilers/Interpreters
Home page
Uploaded by JanRochel at 2017-05-23T14:59:50Z
Distributions NixOS:0.3.7
Executables ww
Downloads 7305 total (27 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs not available [build log]
Last success reported on 2017-05-23 [all 3 reports]


Maintainer's Corner

For package maintainers and hackage trustees