Using Haskell’s type system in Blackbox analysis

For some of the Blackbox analysis work that I’ve been doing, I have used Haskell as a programming language. It seemed like the best tool for the job, given its strong support for concurrency and parallelism (needed to speed up the analysis) and for parsing and manipulating syntax trees (which is needed for most of the analyses). I wrote a short article for “The Monad Reader” magazine about some of the ways in which Haskell’s strong type system helped with writing the analysis. Direct link: or see the reblogged post for the full contents and other articles in the issue.

The Monad.Reader

I am pleased to announce that Issue 23 of the Monad Reader is now available.

Issue 23 consists of the following five articles:

This time around, I have individual article files for each (and the supercompilation article has an extra appendix not included in the full issue PDF).

Feel free to browse the source files. You can check out the entire repository using Git:

git clone

If you’d like to write something for Issue 24, please get in touch!

View original post

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s