maxsharing: Maximal sharing of terms in the lambda calculus with letrec
Parses a lambda-letrec term; transforms it into a first-order term graph representation; minimises the graph; reads back a lambda-letrec term which has the same unfolding as the original term, but exhibits maximal sharing. If executable "dot" from graphviz is available, the graphs are displayed (tested for Linux). The approach is described in a technical report: http:/arxiv.orgabs/1401.1460
Downloads
- maxsharing-1.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 1.0, 1.0.2, 1.0.3, 1.1 |
---|---|
Dependencies | base (<4.7), base-unicode-symbols (<0.3), boxes (<0.2), containers (<0.6), containers-unicode-symbols (<0.4), HaLeX (>=1.2.1), IndentParser (<0.3), mtl (<2.2), parsec (<3.2), process (<1.2), uuagc (>=0.9.50.2), uuagc-cabal (<1.1) [details] |
License | BSD-3-Clause |
Copyright | (c) 2013, Jan Rochel |
Author | Jan Rochel |
Maintainer | jan@rochel.info |
Category | Graphs, Compiler |
Home page | http://rochel.info/maxsharing/ |
Uploaded | by JanRochel at 2014-02-03T16:30:11Z |
Distributions | |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Executables | maxsharing |
Downloads | 2812 total (15 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs not available [build log] Successful builds reported [all 7 reports] |