S.: Hoopl: a modular, reusable library for dataflow analysis and transformation

Dataflow analysis and transformation of control-flow graphs is per-vasive in optimizing compilers, but it is typically entangled with the details of a particular compiler. We describe Hoopl, a reusable library that makes it unusually easy to define new analyses and transformations for any compiler written in Haskell. Hoopl’s in-terface is modular and polymorphic, and it offers unusually strong static guarantees. The implementation encapsulates state-of-the-art algorithms (interleaved analysis and rewriting, dynamic error isola-tion), and it cleanly separates their tricky elements so that they can be understood independently. Readers:Code examples are indexed a