Simon Marlow

pval is a bit dodgy too, because it encourages you to share lazy computations between threads. I've never used pval in presentations, I always use (spawn . return). No objection...

On 13/10/2011 09:55, Ryan Newton wrote: > Actually, I thought of one small reason not to. It may be a helpful optimization in some cases to implement pvals as (Full...

On 24/10/2011 14:38, Ryan Newton wrote: > Ah, you mean because X is gotten before y? Then assuming child > stealing the first thief would have stolen X only to...

On 24/10/2011 15:50, Ryan Newton wrote: > Oops! Yes, indeed. I'm sorry, my original description was overly > abbreviated. The idea would be to make them regular sparks. (Of >...

Could you explain why this "degrades performance"? In your example it doesn't matter which order we execute things in, so long as we keep all the cores busy.

It's been a while since I looked at `monad-par` in detail so apologies if I'm being a bit slow here. Could you explain why we get more parallelism with your...

One disadvantage of this approach is that IVar supports Eq (and could conceivably support Ord), whereas you can't do much with values of type (m a).

The Strategies version of partree also gives erratic results, FWIW, but I've never seen this degree of variability.

By all means submit a PR. Nobody is actively working on monad-par at the moment as far as I know. The usual way to add support for `bracket` and co...

What safety issue are you referring to here? The problem with returning IVars from a Par computation? I had a suggestion from Nick Smallbone recently that appears to solve this...