[Haskell-cafe] PrimMonad for Control.Monad.ST.Lazy?
marcin.jan.mrotek at gmail.com
Fri Apr 10 08:51:03 UTC 2015
> Streams of random data is actually somewhat popular structure, and has
> been asked about before. What was also found out that such lazy
> streams are fraught with problems. Some are described on this page:
> The page also shows two solutions, which are robust and easy to reason
And from that page:
>The monadic stream ListM is not a Haskell list. We have to write our own ListM-processing functions like headL, replicateL, appendL, etc. (There is probably a Hackage package for it.)
Could it be Pipes?
More information about the Haskell-Cafe