View Code? Open in Web Editor
NEW
Composable replication schemes of applicative functors in Haskell
Home Page: http://hackage.haskell.org/package/ReplicateEffects
License: BSD 3-Clause "New" or "Revised" License
Haskell 98.21%
Makefile 1.79%
replicateeffects's People
Contributors
replicateeffects's Issues
For example, sizes (exactly 1000 . one)
takes a while before it answers [1000]
, while sizes (exactly 1000)
is equivalent but faster.
Can this be fixed?
For example, in many . z
for all schemes z
that allow frequency zero, such as opt
.
Specifically, sizes (many . Cons (Just undefined) undefined)
hangs.
Is it reasonable for this example to hang? If not, what output do we expect?