Primes in haskell

gistfile1.hs

module Main where
    primes = 1:(nextPrime 2 [])
    divisibleByAny x numbers = any (\n -> (rem x n) == 0) numbers
    nextPrime start primesSoFar = let
                                    nextP = head (dropWhile (\x -> divisibleByAny x primesSoFar) [start..])
                                  in 
                                    nextP:(nextPrime (nextP + 1) (nextP:primesSoFar))