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


Properties

Version1.0
Dependenciesbase (<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)
LicenseBSD3
Copyright(c) 2013, Jan Rochel
AuthorJan Rochel
Maintainerjan@rochel.info
Stabilitybeta
CategoryGraphs, Compiler
Home pagehttp://rochel.info/maxsharing/
Executablesmaxsharing
Upload dateMon Feb 3 16:30:11 UTC 2014
Uploaded byJanRochel
Downloads83 total (14 in last 30 days)

Downloads

Maintainers' corner

For package maintainers and hackage trustees