build: Build systems a la carte

[ algorithms, data-structures, library, mit ] [ Propose Tags ]

A library for experimenting with build systems and incremental computation frameworks, based on the ideas presented in the ICFP 2018 paper "Build systems a la carte".

[Skip to Readme]
Versions 0.0.1,
Dependencies algebraic-graphs (>=0.1.1), base (>=4.7 && <5), containers (>=, extra (>=1.5.3), filepath (>=, mtl (>=2.2.1), random (>=1.1), transformers (>= [details]
License MIT
Copyright Andrey Mokhov, Neil Mitchell, Simon Peyton Jones, 2018
Author Andrey Mokhov, Neil Mitchell, Simon Peyton Jones
Maintainer Andrey Mokhov <>, github: @snowleopard
Category Algorithms, Data Structures
Home page
Source repo head: git clone
Uploaded by snowleopard at Fri Jun 1 15:02:19 UTC 2018
Distributions NixOS:
Downloads 47 total (47 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2018-06-01 [all 1 reports]
Hackage Matrix CI




Maintainer's Corner

For package maintainers and hackage trustees

Readme for build-

[back to package description]

Build Systems à la Carte

Hackage version Linux &amp; OS X status Windows status

This project provides an executable framework for developing and comparing build systems, viewing them as related points in landscape rather than as isolated phenomena. The code derives from the ICFP 2018 paper "Build Systems à la Carte".

Getting Started

You may be interested to:

  • Run stack test to execute all the provided build systems on a very simple example.
  • Run stack haddock to generate HTML documentation of all the interfaces.
  • Read the code, particularly System.hs which is the concrete implementation of all build systems. Following the imports (or the Haddock documentation) will lead you to all the consistuent parts.

Further Activities

There aren't really any. The code served as a proving ground for ideas, and it's existence both allows confirmation that our conclusions are valid, and opportunity to cheaply conduct further experiments. However, the code is a useful adjoint to the paper, it is not essential to it (other than we wouldn't have been able to discover what we did without an executable specification).

Background Information

The task abstraction is explored more completely in this blog post, and the motivation behind the project in an earlier blog post.