take prime numbers

prime.hs

primenumbers :: Integer -> [Integer]
primenumbers n = reverse (prime_impl 2 n [])
  where
    prime_impl :: Integer -> Integer -> [Integer] -> [Integer]
    prime_impl x m rs
      | x > m = rs
      | any (\n -> x `mod` n == 0) rs = 
          prime_impl (x+1) m rs
      | otherwise = prime_impl (x + 1) m (x:rs)