Parallelizing Stream with Future [article]

Raphaël Jolly
2013 arXiv   pre-print
Stream is re-interpreted in terms of a Lazy monad. Future is substituted for Lazy in the obtained construct, resulting in possible parallelization of any algorithm expressible as a Stream computation. The principle is tested against two example algorithms. Performance is evaluated, and a way to improve it briefly discussed.
arXiv:1305.4367v1 fatcat:yapqbkumfjcxnll4hnyxgwzjjq