Bob Atkey claimed that redo's dependency-calculation algorithm was inadequate for building OCaml. I was sure that it was so too adequate, and wrote these scripts to prove it.
The details of how this works are explained in a blog post, which you should probably read first.
To run the example from the post, do the following:
- Clone the redo repository.
- Add it to your PATH.
- Run the script
demo.shin this directory. The output shows which files are being built at each stage, with recursive builds shown by indentation.
This code is released under the Community Research and Academic Programming License: see the file CRAPL-LICENSE.txt for details.