Hi,
Jan> Haskell code optimised by strictnes annotions in functions or
Jan> in datastructures are ? times slower than C.
Jan> Please correct me where I am wrong and fill in the required
Jan> number for the ? sign above
I cannot give you a number, but I like to report about some
experience we made in our programming project. We used lists to
store a symbol table for a compiler. Later, we felt the need to
switch to AVL trees and so we did. As the programs got bigger
we discovered that our program used more than 200MB heap and
became very slow. After we made the insert operation in the
AVL tree hyperstrict and a few similar changes, our
program behaved very well and is surely faster than
if written in C using naive data structures and algorithms.
We used combinators like
strict2 f x y = strict (strict f x) y
to achieve a simple code.
Cheers
--
Christoph Herrmann
E-mail: [EMAIL PROTECTED]
WWW: http://brahms.fmi.uni-passau.de/cl/staff/herrmann.html
