graph-rewriting-ww: Interactive reduction of lambda-calculus with explicit sharing

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

Evaluate a λ-letrec term in an interactive graph reduction system. It uses duplicators to explicitely render sharing (and unsharing) according to Wadsworth's approach.

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 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
Dependencies base (>=4 && <4.5), base-unicode-symbols (>=0.2 && <0.3), GLUT (>=2.2 && <2.3), graph-rewriting (>=0.7 && <0.8), graph-rewriting-gl (>=0.6.9 && <0.8), graph-rewriting-layout (>=0.5.1 && <0.6), IndentParser (>=0.2 && <0.3), OpenGL (>=2.4 && <2.5), parsec (>=2.1 && <2.2) [details]
License BSD-3-Clause
Copyright (c) 2010, Jan Rochel
Author Jan Rochel
Maintainer jan@rochel.info
Category Application, Compilers/Interpreters
Home page http://rochel.info/#graph-rewriting
Uploaded by JanRochel at 2012-06-20T10:19:34Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Executables ww
Downloads 7865 total (30 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2016-12-24 [all 6 reports]