Regex crossword and constraint programming

So there's this neat little Regex learning site at Regex Crossword - it's fun. I worked straight through it and enjoyed the whole thing.  (HNN quote that made me laugh: "I tried to solve these with regular expressions. Now I have two crosswords.").

This led to the realization that constraint programming is actually a fun type of puzzle - and that automating it is something that was once considered AI, but is now no-true-Scotsmanned out of the domain. One example of a solution to this kind of problem using Haskell's Regex.Genex package is here. Cool stuff!

Learning algorithms in Haskell

Hmm, this makes sense for Haskell, I think - really, anything mathematical makes sense for Haskell.  Note to self: really.  Learn you some Haskell.

Also: this.  I think the time has come.

I probably ought to look at Haskell

Haskell seems like it's maybe not 100% ready for prime time as a production language through the whole stack [previously], but the Haskell community is looking at some really, really neat stuff.  (Quite aside from factorization diagrams.)

Case in point, and discovered while writing about factorization diagrams: embedded domain-specific languages.  (Like their Workflow module.)