Newly-single and loving it: improving higher-order must-alias analysis with heap fragments

Theories of higher-order must-alias analysis, often under the guise environment provide deep behavioral insight. But these theories---in particular those that are most insightful otherwise---can reason about recursion only in limited cases. This weakness is not inherent to theories but frameworks which they're defined: machine models thread heap through evaluation. Since allocate each abstract resource heap, constituent analysis conflate co-live resources identified abstract, such as recursively-created bindings. We present fragments a general technique allow and robust way. instantiate counting heap-fragment framework compare its performance precursor entire-heap framework. also sketch an approach realizing binding invariants, more powerful