> it is more often than not the case that the reason for this is not that Y is > faster than X, but that one has learned a lot about the problem when > implementing in X. So in general you see an improvement even when X == Y,
To be honest I suspect that in ADP case it is exactly that, particularly as software is in fact a component of their language in which they think doing bioinformatics. Then C on multcore looks like hit against a brick wall. Nevertheless my point is still valid: when on compiler side the heap is stretched and on program side you need Ockham's Razor in action Haskell chokes. I hoped at least to stimulate interest in repeating GP experiment with latest GHC version. This could make a hot publication and save nice people from reappearance of this thread:-) (the experiment: http://www.dcs.ed.ac.uk/home/stg/sfpw/book/Garmendia-Doval/cameraready.ps) Cheers, -Andrzej _______________________________________________ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
