@hackage maxsharing1.0
Maximal sharing of terms in the lambda calculus with letrec
Categories
License
BSD-3-Clause
Maintainer
jan@rochel.info
Links
- Homepage
- Documentation
- No source repository
- Security
Versions
Installation
CustomDependencies (0)
- HaLeX >=1.2.1
- IndentParser <0.3
- base <4.7
- base-unicode-symbols <0.3
- boxes <0.2
- containers <0.6 Show all…
Dependents (1)
@hackage/acme-everything
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