Having trouble with parallel Haskell

[Don Stewart]

trebla:
> I do not have a platform to try it on; the following is pure speculation.
> 
> In main, the builder of input is highly lazy, since randoms is. To be 
> sure, the spine of the list is presently forced by printing its length, 
> but the numbers inside the list... It is very bleak because randoms 
> ensures that input!!(n+1) is patently dependent on input!!n, ad 
> infinitum; this should defy all attempts at parallelism...
> 
> Forcing the numbers themselves before sorting will give a much more 
> conclusive result, success or failure.

I wonder if a fast, strict randoms generator (like mersenne-pure64)
would help then.

-- Don