Re:Haskell Beats C Using Generalized Stream Fusion [pdf]
by ky3 on Sunday April 07, 2013 @09:53PM
(#5509584)
There are 2 pieces of C benchmarked. The other one computes `a[i]-b[i]` into a temporary array and then makes a single call to BLAS. The speed is roughly half that of Haskell, which dispenses with the space cost of the temporary array.
[ Parent
| on HN ]