Someone wrote:
> Honestly, would you use a language which does not allow to program a
> depth-first graph traversal in O(n).
Ah. I didn't realize it was that bad. My understanding of
Haskell is quite rudimentary.
And yet, now that I think about it, I have never implemented a
depth-first gr
one saying "We
need to add all these features in order to make Haskell useful
for serious programming!". That may well be true, depending on
what the features actually are, but it strikes me as ironic
since I came here in search of "fewer features, for serious
programming". :-)
Regards,
Zooko, Journeyman Hacker
