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

  • Authors:
  • Norman Ramsey;João Dias;Simon Peyton Jones

  • Affiliations:
  • Tufts University, Medford, MA, USA;Tufts University, Medford, MA, USA;Microsoft Research, Cambridge, United Kingdom

  • Venue:
  • Proceedings of the third ACM Haskell symposium on Haskell
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Dataflow analysis and transformation of control-flow graphs is pervasive 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 interface 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 isolation), and it cleanly separates their tricky elements so that they can be understood independently.