The graph-rewriting-ww package

[ Tags: 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.

Properties

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.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 BSD3
Copyright (c) 2010, Jan Rochel
Author Jan Rochel
Maintainer jan@rochel.info
Category Application, Compilers/Interpreters
Home page http://rochel.info/#graph-rewriting
Uploaded Tue May 23 14:59:50 UTC 2017 by JanRochel
Distributions NixOS:0.3.7
Executables ww
Downloads 1775 total (14 in the last 30 days)
Rating 0.0 (0 ratings) [clear rating]
  • λ
  • λ
  • λ
Status Docs not available [build log]
Last success reported on 2017-05-23 [all 3 reports]
Hackage Matrix CI

Downloads

Maintainer's Corner

For package maintainers and hackage trustees