On Thu, May 31, 2007 at 10:42:57AM -0700, Greg Meredith wrote: > All, > > All this talk about Mathematica and a reference to monadic treatments of > backtracking reminded me that a year ago i was involved in work on a > Mathematica-like widget. At the time i noticed that a good deal of the > structure underlying LP, SAT and other solvers was terribly reminiscent of > comprehension-style monadic structure. i think i asked Erik Meijer if he > knew of any work done on this and posted to LtU, but nobody seemed to have > understood what i was mumbling about. So, let me try here: does anybody know > of references for a monadic treatment of constraint satisfaction?
It's not particularly monadic, but you might check out "Modular Lazy Search for Constraint Satisfaction Problems" http://cse.ogi.edu/PacSoft/publications/.../modular_lazy_search.pdf _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
