# The maxsharing package

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.org*10.1145*2628136.2628148) and an
extended version thereof (http:arxiv.org*abs*1401.1460).

## Properties

Versions | 1.0, 1.0.2, 1.0.3 |
---|---|

Change log | None available |

Dependencies | base (<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.9.50.2 && <0.10), uuagc-cabal (<1.1) [details] |

License | BSD3 |

Copyright | (c) 2013, Jan Rochel |

Author | Jan Rochel |

Maintainer | jan@rochel.info |

Stability | beta |

Category | Graphs, Compiler |

Home page | http://rochel.info/maxsharing/ |

Executables | maxsharing |

Uploaded | Wed Dec 2 14:35:30 UTC 2015 by JanRochel |

Downloads | 390 total (13 in last 30 days) |

Votes | |

Status | Docs not available [build log] All reported builds failed as of 2015-12-02 [all 1 reports] |

## Downloads

- maxsharing-1.0.3.tar.gz [browse] (Cabal source package)
- Package description (included in the package)

#### Maintainers' corner

For package maintainers and hackage trustees