On Jan 24, 2008 9:45 AM, Peter Hercek <phercek@gmail.com> wrote:
 A lot
 of efficient algorithms we have are state based. And again probably
 more.
Yes, and we can write those using the ST monad in Haskell. I think it's important to point this out, since some imperative programmers will just go "but what about if I *need* mutable state?" and probably tune out if they don't hear right away that Haskell can give it to them in a safe encapsulated form.
 
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862