Lazy List of Prime Numbers

list haskell primes lazy-evaluation
Mantas Vidutis picture Mantas Vidutis · Aug 29, 2010 · Viewed 26.2k times · Source

How would one implement a list of prime numbers in Haskell so that they could be retrieved lazily?

I am new to Haskell, and would like to learn about practical uses of the lazy evaluation functionality.

Answer

Niki picture Niki · Aug 29, 2010

Here's a short Haskell function that enumerates primes from Literate Programs: 

primes :: [Integer]
primes = sieve [2..]
  where
    sieve (p:xs) = p : sieve [x|x <- xs, x `mod` p > 0]

Apparently, this is not the Sieve of Eratosthenes (thanks, Landei). I think it's still an instructive example that shows you can write very elegant, short code in Haskell and that shows how the choice of the wrong data structure can badly hurt efficiency.

Related questions

Is there any haskell function to concatenate list with separator?

Is there a function to concatenate elements of a list with a separator? For example: > foobar " " ["is","there","such","a","function","?"] ["is there such a function ?"] Thanks for any reply!

Read More
Merging two lists in Haskell

Can't figure out how to merge two lists in the following way in Haskell: INPUT: [1,2,3,4,5] [11,12,13,14] OUTPUT: [1,11,2,12,3,13,4,14,5]

Read More
Replace individual list elements in Haskell?

I have a list of elements and I wish to update them: from this: ["Off","Off","Off","Off"] to this: ["Off","Off","On","Off"] As I am somewhat new to Haskell, I have been using (x:xs)!!y to extract …

Read More