Hi Reinier, On Wed, Nov 12, 2008 at 14:22, Reinier Lamers <[EMAIL PROTECTED]> wrote: > Also, in my experience Haskell is not so good at data structures where > you can't do structural recursion easily, like graphs. In such cases > you want a language with easy pointers and destructive updates. You > can do those things in pure Haskell by using > the ST monad, but the code will be more verbose than in Java or C++, > and it will occasionally drive you insane with type messages like the > above (You thought you could use '$' freely instead of application? > Wrong!).
Can you give examples of what you mean and why algebraic data types are not sufficient? In my research most things are "structurally recursive" and it was because Haskell is so good at such things that I started using it. cheers, Arnar _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
