[Haskell-cafe] Can Haskell outperform C++?

Gregg Lebovitz glebovitz at gmail.com
Wed May 16 21:02:25 CEST 2012


I was looking at the debian coding contest benchmarks referenced by 
others in this discussion. All of the benchmarks algorithms, appear to 
be short computationally intensive programs with a fairly low level of 

In almost all examples, the requirement says: you must implement the X 
functions as implemented in Java, or C#, or C++. The k-nucleotide even 
specifies a requirement to use an update a hash-table.

I wonder if someone here could come up with a set of benchmarks that 
would out perform C++.

Interesting that you would focus on this one comment in my post and not 
comment on one on countering the benchmarks with a new criteria for 
comparing languages.


On 5/16/2012 12:59 PM, Isaac Gouy wrote:
> Wed May 16 16:40:26 CEST 2012, Gregg Lebovitz wrote:
> 2) ... I think the problem with current comparisons,
> is that they are designed to favor imperative languages.
> Please be specific:
> - Which current comparisons?
> - How do you know what they are designed to favor?
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe

More information about the Haskell-Cafe mailing list