Of course you can tweak things to be fast in hakell, but to be able to actually program haskell in such a way to, beat other languages in performance, is not a trivial skill.
There are numerous stackoverflow and r/haskell posts "Why is my haskell code 10x times slower than language X?" Or observe this set of web framework benchmarks: http://www.techempower.com/benchmarks/
It actually is trivial in a lot of cases. It's often as simple as swapping out lists for vectors and inserting a few strictness annotations into your types.
The good news is that it stops at the function boundaries. Your quicksort may be implemented in the ST monad, looking like some bastard child of C, but the function type ends up being
qsort :: Ord a => Vector a -> Vector a
And that's one of the likeable properties of Haskell: it doesn't deny that real-world programs sometimes require mutability, but allow you to isolate it through the type system. So, even though qsort may use mutable memory for sorting, it is a pure and referentially transparent function.Yes, my point was just that there are programmers using Haskell in a non-optimal way. Beginners seem to be surprised when their Haskell code isn't automatically in the upper level.
I'm not really a great fan of benchmarks, or this particular benchmark, but at least the source of every test is available:
https://github.com/TechEmpower/FrameworkBenchmarks/blob/mast...
https://github.com/TechEmpower/FrameworkBenchmarks/blob/mast...
https://github.com/TechEmpower/FrameworkBenchmarks/blob/mast...
Also true of the benchmarks game. (Also the command line used to compile and run the program, etc)
http://www.willamette.edu/~fruehr/haskell/evolution.html
Is this "idiomatic": http://benchmarksgame.alioth.debian.org/u64q/program.php?tes...
"One can, with sufficient effort, essentially write C code in Haskell using various unsafe primitives. We would argue that this is not true to the spirit and goals of Haskell, and we have attempted in this paper to remain within the space of “reasonably idiomatic” Haskell. However, we have made abundant use of strictness annotations, explicit strictness, and unboxed vectors. We have, more controversially perhaps, used unsafe array subscripting in places. Are our choices reasonable?"
"Measuring the Haskell Gap" http://www.leafpetersen.com/leaf/publications/ifl2013/haskel...
http://benchmarksgame.alioth.debian.org/u64q/program.php?tes...
FWIW, I don't Don Stewart[0] would consider that idiomatic either. He just knows a bit more than the rest of us about how to squeeze more performance out of GHC-compiled code and was willing to use non-idiomatic code to do so.
Also FWIW, personally I don't think language shootouts are very informative most of the time, but... IMO they should at least use idiomatic code -- otherwise they tell you even less than they already do about what real-life performance is like.
[0] Just an example, I know he didn't contribute the particular benchmark you linked to. He did contribute a few of the other programs AFAIK. I think the following sentences also apply to (essentially) all the Haskell shootout contributors.
This otoh: http://benchmarksgame.alioth.debian.org/u64q/program.php?tes...
>Foreign.Ptr (and companions) are hardly ever used in normal Haskell code unless you're optimizing for that last bit of performance<
Do you think "optimizing for that last bit of performance" doesn't happen in the wild?
>IMO they should at least use idiomatic code<
Provide some!
http://benchmarksgame.alioth.debian.org/play.php#contribute
GHC 7.8.2 installed, cabal 1.2 stuff available as-needed.
Of course it does, but the cost increases non-linearly and you have to find the right trade-off for the situation at hand. Do you want maintainability or absolute performance?
> Provide some!
Of course one could, but that would that accomplish? Everyone who thinks these benchmarks have value just looks at the fastest-performing version of $YOUR_LANG_BENCHMARK. Hint: Mostly it won't be idiomatic regardless of the value of $YOUR_LANG.
Do you think the source code for those optimized for the last bit of performance programs tells us something about that?
>Of course one could, but what would that accomplish?<
Could one? Perhaps there'd be complaints that your "idiomatic programs" were just naïve.
A passive website like the benchmarks game can never be enough, by itself, to educate and inform all (or even most) readers -- reading selectively is far too commonplace and errare humanum est.
The benchmarks game is a resource. There are enough examples that when someone draws a misinformed conclusion, we can usually show them a counter-example and ask them to think.
But only if someone contributes those (whatever they consider idiomatic to be) idiomatic programs as counter-examples.
No kidding:
http://benchmarksgame.alioth.debian.org/u64/program.php?test=regexdna&lang=ghc&id=2
It's mostly a matter of knowing C, then knowing how to torture GHC into doing what the C would do.Please contribute your Haskell regex-dna program that does not do anything like that and get's "good" performance.
Here's the task description: http://benchmarksgame.alioth.debian.org/u64/performance.php?...
Here's "How to contribute programs": http://benchmarksgame.alioth.debian.org/play.php#contribute
GHC 7.8.2 installed, cabal 1.2 stuff available as-needed.
No. I stopped bothering with that cluster fuck like a decade ago. It is a complete waste of time.
http://benchmarksgame.alioth.debian.org/dont-jump-to-conclus...
As to where Haskell fits: you're correct, there are many other great languages out there. But I think Haskell is really unique in offering what it does. Clojure, Go, and Erlang are all great in their own regard, but none of them provides the degree of safety that Haskell does. For example, none of them enforce purity, and all three of them freely allow the use of `null` values (which is really quite surprising considering how many problems nulls cause). Clojure and Erlang avoid mutable state like Haskell does (though not to the same degree of rigor) but don't provide the elegant solutions for simulating mutable state that Haskell does with its monads, which almost allow you to "have your cake and eat it too" with state. None of them encourage the degree of abstraction that you'll find in Haskell. Also, at least according to the Computer Benchmark game, Haskell beats all three of them in terms of speed, as well. Haskell's "place" is in generating highly robust code with good performance, and also works as a beautiful language for expressing certain mathematical concepts.
This doesn't make Haskell a perfect language, but it absolutely has a lot to offer that other languages don't. And it's so much different than other languages, that at the very least it can change your perspective on a lot of things.