Editing Linear congruential generator (section)

===Haskell code===
The following is an implementation of an LCG in [[Haskell]] utilizing a [[Lazy evaluation#Working_with_infinite_data_structures|lazy evaluation]] strategy to generate an infinite stream of output values in a list:

<syntaxhighlight lang="haskell">
-- Allowing a generic choice for a, c, m and x_0
linearCongruentialGenerator :: Integer -> Integer -> Integer -> Integer -> [Integer]
linearCongruentialGenerator a c modulus seed = lcgacmx0
  where lcgacmx0 = seed : map (\x -> (a*x + c) `mod` modulus) lcgacmx0

-- Specific parameters can be easily specified (eg. Knuth's MMIX parameters):
mmixLCG :: Integer -> [Integer]
mmixLCG = linearCongruentialGenerator 6364136223846793005 1442695040888963407 (2^(64 ::Integer))
</syntaxhighlight>