DCFL – A parallelized constraint solving library for Haskell

What does communication-free mean? No usage of network? There's a global state that is updated by the workers?

Kind of a bizarre side question, would constraint solving be the right tool to use to "solve" things like the kittens/catnip game (a civclicker variant)? Like, at any given moment, given a goal and available resources, tell you the "best" way to allocate your resources.

FYI this page looks really bad on firefox with a narrow window. It gets jumbled around and the dark blue background on the left takes over the whole page.

Given that type inference can be expressed in the form of constraints, could this be used to speed up type inference on huge programs?