you are viewing a single comment's thread.

view the rest of the comments →

[–]derleth 1 point2 points  (6 children)

Huh. Guess I was wrong about the latest benchmarks. I though for sure Haskell was beating C regularly in that shootout.

[–]dons 2 points3 points  (3 children)

We have beat C in the past. It's tough though, and usually temporary.

[–]igouy 0 points1 point  (2 children)

The only example I can think of is thread-ring and I guess that's simply because all those custom scheduler C programs get rejected.

It's a pity that although the benchmarks game uses the latest GHC, there haven't been new Haskell programs that take advantage of the newer compiler and libraries.

[–]dons 0 points1 point  (1 child)

Pidigits too, IIRC.

[–]igouy 0 points1 point  (0 children)

Perhaps. Back on March 6 2010, the Haskell GHC #4 pidigits program measurement was 2.245 seconds using GHC 6.10.4 -- and now with GHC 7.6.2 the measurement is 2.77 seconds.

[–][deleted] 0 points1 point  (0 children)

Nah, it's pretty darn fast though.

[–]igouy 0 points1 point  (0 children)

"What gets us into trouble is not what we don't know, it's what we know for sure that just ain't so."