Slash Boxes
NOTE: use Perl; is on undef hiatus. You can read content, but you can't post it. More info will be forthcoming forthcomingly.

All the Perl that's Practical to Extract and Report

The Fine Print: The following comments are owned by whoever posted them. We are not responsible for them in any way.
More | Login | Reply
Loading... please wait.
  • I have also enjoyed playing around with Haskell, but it ends up striking me as the apogee of languages optimized to solve the classic conference-paper problems: factorial, fibonacci, and quicksort. As a result, these algorithms look beautiful in Haskell, but things quickly get hairy when you venture off the path. For example, let's say you want to be able to pass your program a flag to print out the pivots your quicksort uses, to see if it's hitting the O(n^2) case or whatever. You suddenly find yourself either having to change it to return a list of pivots, or getting caught in the tar-baby that is the IO monad. And you can get a similarly elegant quicksort without Haskell's painful purity by just having list comprehensions in your language (e.g. Python).
    • I agree with you; it does seem to be optimised to be a teaching language. I don't find anything particularly wrong with that, so long as the aims are clearly stated. It's certainly worked in my case. :-)

      Off the top of my head, I can only think of one application in Haskell: darcs []. Mind you, I can only think of one in ocaml: MLDonkey []. I'm sure there are more, but I don't think that there are that many...

      I wish I knew what my point here was, but I've just woken up. Darn.