An Applicative Control-Flow Graph Based on Huet's Zipper Export

@article{citeulike:2285081, abstract = {We are using ML to build a compiler that does low-level optimization. To support optimizations in classic imperative style, we built a control-flow graph using mutable pointers and other mutable state in the nodes. This decision proved unfortunate:the mutable flow graph was big and complex, and it led to many bugs. We have replaced it by a smaller, simpler, applicative flow graph based on Huet's (1997)zipper. The new flow graph is a success; this paper presents its design and shows how it leads to a gratifyingly simple implementation of the dataflow framework developed by Lerner, Grove, and Chambers (2002).}, author = {Ramsey, Norman and Dias, Joao}, booktitle = {Proceedings of the ACM-SIGPLAN Workshop on ML (ML 2005)}, citeulike-article-id = {2285081}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.entcs.2005.11.042}, citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/S1571066106001289}, citeulike-linkout-2 = {http://www.sciencedirect.com/science/article/B75H1-4JFR8JY-6/2/d7bcb95263bbe08c29267a12911c2c86}, citeulike-linkout-3 = {http://www.eecs.harvard.edu/~nr/pubs/zipcfg-abstract.html}, day = {24}, doi = {10.1016/j.entcs.2005.11.042}, issn = {15710661}, journal = {Electronic Notes in Theoretical Computer Science}, keywords = {abstract-interpretation, caml, compiler, control-flow, zipper}, month = {March}, number = {2}, pages = {105--126}, posted-at = {2009-09-04 21:04:30}, priority = {0}, title = {An Applicative Control-Flow Graph Based on Huet's Zipper}, url = {http://dx.doi.org/10.1016/j.entcs.2005.11.042}, volume = {148}, year = {2006} }

TY - JOUR ID - citeulike:2285081 L3 - citeulike-article-id:2285081 N2 - We are using ML to build a compiler that does low-level optimization. To support optimizations in classic imperative style, we built a control-flow graph using mutable pointers and other mutable state in the nodes. This decision proved unfortunate:the mutable flow graph was big and complex, and it led to many bugs. We have replaced it by a smaller, simpler, applicative flow graph based on Huet’s (1997)zipper. The new flow graph is a success; this paper presents its design and shows how it leads to a gratifyingly simple implementation of the dataflow framework developed by Lerner, Grove, and Chambers (2002). IS - 2 JF - Electronic Notes in Theoretical Computer Science SN - 15710661 EP - 126 TI - An Applicative Control-Flow Graph Based on Huet's Zipper VL - 148 T2 - Proceedings of the ACM-SIGPLAN Workshop on ML (ML 2005) SP - 105 KW - abstract-interpretation KW - caml KW - compiler KW - control-flow KW - zipper AU - Ramsey, Norman AU - Dias, Joao PY - 2006/03/24/ UR - http://dx.doi.org/10.1016/j.entcs.2005.11.042 ER -