[Haskell-cafe] ANNOUNCE: nobench: Haskell implementaion
benchmarks. GHC v Hugs v Yhc v NHC v ...
Bulat Ziganshin
bulat.ziganshin at gmail.com
Tue Feb 20 05:13:31 EST 2007
Hello Dougal,
Monday, February 19, 2007, 3:02:30 PM, you wrote:
> I suppose the ideal way to do it would be benchmarks for the (1) idiomatic
> and (2) the highly tuned implementations. Then the compiler writers can
> push 1 towards 2, while the pesky shootout implementers can move the
> goalposts of 2. ;-)
> In reality this may just foster a small set of horribly specialised
> optimisers in the compilers, with little benefit for real-world usage. :-(
i disagree. when i write some general-purpose library, i use these
optimization tricks to make library as fast as possible. and wide
audience of library users will benefit from such low-level
optimizations
great example of such low-level optimized library is ByteString which
provides C-close speed with very high-level interface
--
Best regards,
Bulat mailto:Bulat.Ziganshin at gmail.com
More information about the Haskell-Cafe
mailing list