The maxsharing package

[Tags: bsd3, program]

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.orgabs1401.1460


Versions1.0, 1.0.2
Dependenciesbase (<4.8), 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.3), parsec (<2.2), process (<1.2), uuagc (>=, uuagc-cabal (<1.1)
Copyright(c) 2013, Jan Rochel
AuthorJan Rochel
CategoryGraphs, Compiler
Home page
UploadedThu Oct 30 15:03:32 UTC 2014 by JanRochel
Downloads155 total (20 in last 30 days)
StatusDocs pending
Build status unknown [no reports yet]


Maintainers' corner

For package maintainers and hackage trustees