[Haskell-cafe] What's the deal with Clean?
rl at cse.unsw.edu.au
Wed Nov 4 17:22:10 EST 2009
On 05/11/2009, at 04:01, Bulat Ziganshin wrote:
> oh, can we stop saying about shootout? if you want to see speed of
> pure haskell code, look at papers about fast arrays/strings - their
> authors have measured that lazy lists are hundreds times slower than
> idiomatic C code. is use of lazy lists counted as mistake too and
> paper authors had too small haskell experience?
In the papers I coauthored, I don't think we measured any such thing.
What we measured was that in algorithms that are best implemented with
(unboxed) arrays, using boxed lists is going to cost you. That's not a
very surprising conclusion and it's by no means specific to Haskell.
The problem was/is the lack of nice purely declarative array libraries
but that changing, albeit slowly. It's a question of using the right
data structure for the algorithm, not a C vs. Haskell thing.
More information about the Haskell-Cafe