Sieve of Eratosthenes in Haskell (slow slow slow first try)

Eratosthenes.hs

-- Sieve of Eratosthenes
import Data.List
      
primes n = sieve [2..n] 2

sieve [] _ = []
sieve xs n =
    n : (sieve left (head left))
    where marked = [x | x <- xs, x `rem` n == 0]
          left   = xs \\ marked