On Fri, Nov 6, 2009 at 8:45 AM, Ketil Malde ke...@malde.org wrote:
enough about. I'd be happy to hear any suggestions.
This is more a question than a suggestion, but would the iteratees package
fit your needs ?
David.
___
Haskell-Cafe mailing
I’m pleased to announce the availability of version 0.2 of my criterion
library http://hackage.haskell.org/package/criterion for Haskell
performance evaluation. For details, please see below:
-
Martijn van Steenbergen wrote:
Bonus points for the following:
* An infinite number of singleton axes produces [origin] (and
finishes computing), e.g. forall (infinite) xs. diagN (map (:[]) xs)
== map (:[]) xs
This can't be done - you can not produce any output before you have
checked that
Henning Thielemann wrote:
On Wed, 4 Nov 2009, Sjoerd Visscher wrote:
On Nov 4, 2009, at 3:21 PM, Twan van Laarhoven wrote:
I looked on hackage but I was surprised that I couldn't find
this simple
monad. The package level-monad does look very similar, only it
uses a
On Fri, Nov 6, 2009 at 3:06 AM, Martijn van Steenbergen
mart...@van.steenbergen.nl wrote:
(...) Likewise, a breadth-first search of a data structure can fall short
if it has an infinitely branching node. Omega addresses this problem by
using a diagonal traversal that gracefully dissolves such
