%0 Journal Article
%T Parallelizing Stream with Future
%A Rapha£żl Jolly
%J Computer Science
%D 2013
%I arXiv
%X 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.
%U http://arxiv.org/abs/1305.4367v1