Hi,<br><br>Does there exists any random number generator in Haskell that is suitable for doing heavy simulations and that can be splitted? <br>At least there exists some c implementations of such generators, see <br><a href="http://www.iro.umontreal.ca/~lecuyer/myftp/papers/streams00.pdf">http://www.iro.umontreal.ca/~lecuyer/myftp/papers/streams00.pdf</a><br>
<br>Also some new theory for Mersenne Twister and its relatives exists, see <br><a href="http://www.iro.umontreal.ca/~lecuyer/myftp/papers/jumpf2.pdf">http://www.iro.umontreal.ca/~lecuyer/myftp/papers/jumpf2.pdf</a><br><a href="http://www.iro.umontreal.ca/~lecuyer/myftp/papers/jumpmt.pdf">http://www.iro.umontreal.ca/~lecuyer/myftp/papers/jumpmt.pdf</a><br>
<br>I&#39;m trying to implement Metropolis algorithm with lazy mutations and a state space that is infinite dimensional in theory (although, of course, not in practice).<br>Without good splitting I&#39;m forced to write as ugly code as with non-lazy language.<br>
<br>Thanks in advance,<br>Lauri<br>