For a concrete example of this at work, see Johan's ekg package:
http://hackage.haskell.org/package/ekg
G
On Mon, Aug 27, 2012 at 8:12 PM, Joachim Breitner
m...@joachim-breitner.dewrote:
Hi,
Am Montag, den 27.08.2012, 18:20 +0200 schrieb Alberto G. Corona :
For a caching library, I need to
On Fri, Aug 24, 2012 at 5:03 PM, Niklas Hambüchen m...@nh2.me wrote:
Hello Michael,
yes, that does certainly help, and it should definitely be linked to.
The remaining question is:
Is it possible to have something like transPipe that runs only once for
the beginning of the pipe?
It seems
On Fri, 24 Aug 2012 22:47:37 +0200, Henk-Jan van Tuyl hjgt...@chello.nl
wrote:
I am trying to fetch wxHaskell with the command
darcs get --lazy http://code.haskell.org/wxhaskell/
but there are much too little files downloaded; what could be the
problem?
Albert Einstein said:
On Mon, Aug 27, 2012 at 10:52 AM, Bryan O'Sullivan b...@serpentine.comwrote:
The reason you're seeing build breakage is that the .cabal files of the
broken packages were edited in-place without communicating with any of the
package authors.
Not to flog a dead horse, but:
Just yesterday we
Dear GHC users,
I am experimenting with ways to /prevent/ sharing in Haskell, e.g. to
avoid space leaks or to speed up evaluation. A first attempt was to
duplicate closures on the heap to preserve the original one, see
http://arxiv.org/abs/1207.2017 for a detailed description and
information on
Hey Joachim,
isn't this an example where the exact same issue could be solved via some
suitable use of a monad for ordering those two computations on l?
cheers
-Carter
On Tue, Aug 28, 2012 at 12:44 PM, Joachim Breitner breit...@kit.edu wrote:
Dear GHC users,
I am experimenting with ways to
You got me there. Excellent point
On Tuesday, August 28, 2012, Yves Parès wrote:
Monad? Simple strictness anotation is enough in that case:
upd_noupd n =
let l = myenum' 0 n
h = head l
in h `seq` last l + h
Le mardi 28 août 2012 22:39:09
