University of Cambridge > Talks.cam > Semantics Lunch (Computer Laboratory) > Hoopl: modular library for dataflow analysis/transformation

Hoopl: modular library for dataflow analysis/transformation

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Sam Staton.

Dataflow analysis and transformation of control-flow graphs is pervasive in optimizing compilers, but it is typically tightly interwoven with the details of a particular compiler. In this talk I’ll describe Hoopl a reusable Haskell library that makes it unusually easy to define new analyses and transformations for any compiler. Hoopl’s interface is modular and polymorphic, and it offers unusually strong static guarantees. The implementation is also far from routine: it 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.

Breaking with the Semantics Lunch tradition, the talk has lots of code and no Greek.

This talk is part of the Semantics Lunch (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity