Hi Edwardd,
Am Freitag, den 24.10.2014, 23:47 + schrieb g...@git.haskell.org:
---
commit aa4799534225e3fc6bbde0d5e5eeab8868cc3111
Author: Edward Z. Yang ezy...@cs.stanford.edu
Date: Thu Aug 7 18:32:12 2014 +0100
2014-10-25 2:03 GMT+02:00 Austin Seipp aus...@well-typed.com:
As well as that, Gabor's bots
(at http://haskell.inf.elte.hu/builders) also build on Windows.
Unfortunately, my builders are still suffering from the sudden
breakage induced by a Cabal library update on September 24 [1]. That
is,
Hi,
some months ago I tried to make foldl a good consumer in the common
case. The starting point is always to write
foldl k a xs = foldr (\v f a - f (v `k` a)) id xs a
and then somehow make GHC produce good code with this. I came up with
two solutions: A more sophisticated compiler
Thanks for the interesting analysis Joachim. I wouldn't trust nofib's
runtime numbers (but the allocation ones should be good). The tests don't
run long enough and the way we don't handle typical noise issues (e.g.
clock resolution, benchmark length, etc) well enough. I'd love to see some
numbers
On 10/25/2014 12:52 AM, Austin Seipp wrote:
Hi *,
A few days ago a discussion on IRC occurred about the LLVM backend,
its current status, and what we could do to make it a rock solid part
of GHC for all our users.
Needless to say, the situation right now isn't so hot: we have no
