Stealing from Biologists to Compile Haskell Faster
Summary
An exploration of GHC's ApplicativeDo optimization and the complexities of scheduling independent computations. It explains why the default greedy approach can be improved with an optimal scheduling algorithm, how the problem parallels RNA folding, and why practical compiler fixes favor a targeted, local improvement over full sub-cubic algorithms.