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.

Versions 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 && <4.5), base-unicode-symbols (==0.2.*), GLUT (==2.2.*), graph-rewriting (==0.7.*), graph-rewriting-gl (>=0.6.9 && <0.8), graph-rewriting-layout (>=0.5.1 && <0.6), IndentParser (==0.2.*), OpenGL (==2.4.*), parsec (==2.1.*) [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 Wed Jun 20 10:19:34 UTC 2012
Distributions NixOS:0.3.7
Executables ww
Downloads 3077 total (19 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2016-12-24 [all 6 reports]
Hackage Matrix CI

Downloads

Maintainer's Corner

For package maintainers and hackage trustees