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

[Gregg Lebovitz]

Richard,

Thank you. This is an example of what I had in mind when I talked about 
changing the playing field. Do you have a slide deck for this lecture 
that you would be willing to share with me? I am very interested in 
learning more.

Gregg

On 5/16/2012 9:13 PM, Richard O'Keefe wrote:
> In a lecture today I presented (for quite other reasons) a simple combinatorial enumeration problem where the difference between two algorithms was far larger than any plausible difference between programming languages.  If a programming language makes it easier to explore high level alternative algorithms, you may very easily end up with faster programs in a "slower" language.  (Sorry about the very long line: broken return key.)