Hello, If you have not seen this paper, you may enjoy it:
Modular Lazy Search for Constraint Satisfaction Problems (2001) Thomas Nordin, Andrew Tolmach http://citeseer.ist.psu.edu/608419.html j. At Mon, 22 Oct 2007 10:19:52 -0400, David F. Place wrote: > > Dear [Reader]: > > Recently, I needed to solve a constraint satisfaction problem. So I > coded a solution using backtracking and tabu lists. I was pleased to > see how easy it is in Haskell. As an exercise, I created a module > and a class interface for the search algorithm. That was also a > pleasure. Since, I've become interested in this area I thought I > might try to create a library that presents a nice interface for > various popular metaheuristics. > > I have poked around in Hackage, but not found anything similar. Is > such a thing already available? I am thinking of something that > would be immediately useful in Haskell programs without needing to > learn another language like CLP. > > BTW, the problem I am working on is an automated approach to lifting > pieces of Renaissance polyphony from 3-limit to 5-limit Just Intonation. > > Cheers, David > > ___________________ > (---o-------o-o-o---o-o-o----( > David F. Place > mailto:[EMAIL PROTECTED] > > > _______________________________________________ > Haskell-Cafe mailing list > [email protected] > http://www.haskell.org/mailman/listinfo/haskell-cafe _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
