[Haskell-cafe] Monads and constraint satisfaction problems (CSP)

[Jeremy Shaw]

At Thu, 31 May 2007 11:36:55 -0700,
Jeremy Shaw wrote:

> This paper describes a non-monadic, compositional method for solving CSPs:
> 
> http://www.cse.ogi.edu/PacSoft/publications/2001/modular_lazy_search_jfp.pdf

btw, there are multiple versions of this paper. This version includes
a section on dynamic variable ordering, as well as some improvements
to the other sections.

j.