----- Original Message -----
> From: Richard O'Keefe <o...@cs.otago.ac.nz>
> Sent: Thursday, May 17, 2012 8:30 PM
> Subject: Re: [Haskell-cafe] Can Haskell outperform C++?
-snip-
> The claim was and remains solely that
> THE TIME DIFFERENCE BETWEEN *ALGORITHMS*
> can be bigger than
> THE TIME DIFFERENCE BETWEEN *LANGUAGES*
> and is in this particular case.
That seems like a modest and uncontentious claim.
> There is also a second claim, which I thought was uncontentious:
> the relative difficulty of tasks varies with language.
That doesn't seem unlikely; but I think you'd have to spell out just what you
mean by language, and it also doesn't seem unlikely that for the same task the
relative difficulty might flip when other details change (the people doing the
task, the language implementation, the libraries available for the language
implementation...)
It all seems so very particular ;-)
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
