Sieve of Eratosthenes in Haskell (much faster second try)

Eratosthenes2.hs

-- Sieve of Eratosthenes

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