Is it possible to create a parallel strategy with parallel evaluation strategies ( Control.Parallel.Strategies) in Haskell when the bend function is associative (e.g. addition)?
My idea was to break the list into pieces, but how should the size of the (optimal) piece be calculated? Is there a general way?
source
share