Dave Feustel writes:

A serious omission in Haskell tutorials is a collection of examples of how to write Haskell solutions for problems that would use arrays in any imperative language. I see that arrays can be defined in Haskell, but I don't see their use as computationally efficient in Haskell.

"By replacing the string type with our ByteString representation, Haskell is able to approach the speed of C, while still retaining the elegance of the idiomatic implementation. With stream fusion enabled, it actually beats the original C program. Only by sacrificing clarity and explicitly manipulating mutable blocks is the C program able to outperform Haskell." - http://www.cse.unsw.edu.au/~dons/papers/CSL06.html "The ability to fuse all common list functions allows the programmer to write in an elegant declarative style, and still produce excellent low level code. We can finally write the code we *want* to be able to write without sacrificing performance!" - http://www.cse.unsw.edu.au/~dons/papers/CLS07.html Don't give up. ;-) -vvv