The maxsharing package

[Tags: bsd3, program]

Parses a lambda-letrec term; transforms it into a first-order term graph representation; minimises the graph by bisimulation collapse; reads back a lambda-letrec term which has the same unfolding as the original term but is more (maximally) compact. If executable dot from graphviz is available, the graphs are displayed (tested for Linux). The approach is described in an ICFP-paper (http:dx.doi.org10.11452628136.2628148) and an extended version thereof (http:arxiv.orgabs1401.1460).


Versions1.0, 1.0.2, 1.0.3
Change logNone available
Dependenciesbase (<4.8), base-unicode-symbols (<0.3), boxes (<0.2), containers (<0.6), containers-unicode-symbols (<0.4), HaLeX (>=1.2.1 && <1.3), IndentParser (<0.3), mtl (<2.3), parsec (<2.2), process (<1.5), uuagc (>= && <0.10), uuagc-cabal (<1.1) [details]
Copyright(c) 2013, Jan Rochel
AuthorJan Rochel
CategoryGraphs, Compiler
Home page
UploadedWed Dec 2 14:35:30 UTC 2015 by JanRochel
Downloads416 total (7 in last 30 days)
0 []
StatusDocs not available [build log]
All reported builds failed as of 2015-12-02 [all 1 reports]


Maintainers' corner

For package maintainers and hackage trustees