It's always the same reason why people dislike new languages. People don't realize, that they can't look open-minded at a new language, if they already know a language. Because they will always compare the new to the already known language.
Most people are only open-minded if they learn their first language, after that, everything else is just ugly compared to the first one.
You just can't decide if something is ugly, until you have learned it, understood the meaning of the syntax, how all the single parts of a language fit together.
Haskell is nothing like Perl. It's one of the most beautiful and well-thought-out language I saw until now. Absolutely nothing compared to the auto magic of Perl.
>max = head . sort
Due to the laziness, the above will find the max entry in O(n) time, just like your hand written loop would. How can you not find that beautiful?
Now I do agree that they often seem to use too many symbols that look like other symbols but the few times I've investigated it actually ended up making sense (e.g. Arrows).
I assume you're pointing out that I have my sort backwards but I was being intentionally as ambiguous with this part because it's not relevant to the point I was making.
Yes, it's triggers my Rainman instincts to point out that 1. It should be max = last . sort 2. Or min = head . sort 3. You are making assumptions on the sorting algorithm to make it possible to short-cut the evaluation.
K-MART! K-MART! :)
Edit: How nice of you to downvote...
I think you should be more careful with following conventions. Everyone knows sort sorts ascending.
However I think that you didn't pick the best example.
I tried out:
>head $ sort [1 .. 10000000]
6 secs, using ~2g of heap! (actually is should be a reverse sort)
and the "hand coded loop":
>let mx (x:xs) m = if x > m then mx xs x else mx xs m; mx [] m = m >mx [1 .. 10000000] 0
3 secs, heap usage stays negligible low and constant.
Something is clearly not behaving as you depicted.
(of course my 'loop' code is not the exact equivalent of the last.sort composition, since it requires a 'minimum' parameter to be passed in advance, which not all types have. On the other hand it works also for the empty list)
I also have the feeling that, unless special compiler optimization (a very 'specific' one, I fear), the simple application of the 'head' function to a sorted list would stop when the first result element is produced, which is not after O(n). Granted, you don't have to wait for a full sort, since the sorting algorithm could guarantee that the rest of the list contain 'lesser/bigger' elements only and thus stop. But keeping track of all this should be space consuming, in respect to a simple linear scan.
Anyway the space problem of the "lazy" solution is a bigger issue than the number of comparisons.
I'm not a haskell master, but if I got it right, one of the mayor problems of lazy programming is that in some situations it can degenerate to a huge amounts of "unevaluated thunks", which are frozen computations yet to be performed, but which require some state to be held in memory (like function arguments, I guess).
(http://www.haskell.org/haskellwiki/Thunk)
or in this case, the space usage is caused simply because the list has to be materialized in memory instead of be simply traversed and generated on the fly. (but 2g seems slightly too much).
Anyway, the point here is that the two methods are not equivalent.
I think that understanding the impact of laziness on space is an issue that certainly increases the learning curve, as it requires time to master this and other optimization techniques if you want to get predictable performances from haskell.
(BTW, I actually use haskell for work, perhaps in a slightly conterintuitive way. I use haskell for quick prototyping ideas and solutions. Sometimes I get inspired by the solution I end up with haskell and translate it in clojure or java (work requirement), or at other times I have to rewrite it completely, but the possibility to quickly prototype in haskell really helps me a lot. I would love a stable ghc JVM backend.... it would change my life)
http://apfelmus.nfshost.com/articles/quicksearch.html
As far as I can understand from the blog and and the cited mailing lists, it works but it requires a carefully coded sorting method, otherwise O(n log n) as expected.
Sort specifically was (I felt) a small part of my point but I should have known that on a "hacker" site one must be exact. :)
I found a fascinating examples of the expressiveness and beauty of haskell due to lazy evaluation, which I think is better suited for FP evangelism:
fibs = 0 : 1 : zipWith (+) fibs (tail fibs)
Here we are defining the fibonacci sequence in a declarative way, recursing with a recursive "call".
The way the 'fibs' function is coded directly reflects the definition of the fibonacci sequence itself:
The 'fibs' list is defined as a list containing the first 2 elements and then, as a tail, the result of the application of the + function on the previous pair of elements.
"You can borrow things from the future as long as you don't try to change them"
Its even better when you understand it more. The syntax brilliantly expresses the fact that you're essentially working with a computerized lambda calculus.