16 May
2008
16 May
'08
7:06 p.m.
Andrew Coppin wrote:
On the other hand, this is the anti-theisis of Haskell. We start with a high-level, declarative program, which performs horribly, and end up with a manually hand-optimised blob that's much harder to read but goes way faster.
Buh? This is hard to read?
mean n m = go 0 0 n
where go s l x | x > m = (s::Double) / fromIntegral (l::Int)
| otherwise = go (s+x) (l+1) (x+1)
One can in fact imagine a world in which the compiler does this
transformation for you, though it takes a bit of squinting.
http://reddit.com/r/programming/info/6jjhg/comments/c040ybt