i'm implementing a benchmark which includes a detailed specification for a
random number generator. for any of the kernels outlined in the benchmark,
i might have to generate a set of random numbers R, which has a length n,
using the following formulas:
R[k] = ((2^-46)(X[k])) mod 2^46, where
X[k
I apologize - I forgot to include this in my previous posting.
I also couldn't seem to find an implementation of the foldP function, which
is included in several of Roman's papers on DPH and ndp in general. Is this
not implemented yet?
Thanks,
Ja
hings we'd like to look into as a first step.
Much thanks,
James Swaine
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I am somewhat of a beginner with DPH and wanted to ask a few (maybe
elementary) questions.
There appear to be two main libraries - regular and unlifted. I was a
little unclear on the difference between the two and was hoping to get some
clarification. If you use the 'regular' api, it seems that
