Prime Generator Written In Haskell

main.hs

module Main where
import Data.List

main :: IO ()
main = putStrLn $ unlines $ map show $ primesTo 100

primesTo :: Int -> [Int]
primesTo upTo = primesTo' [2..upTo] []

primesTo' :: [Int] -> [Int] -> [Int]
primesTo' [] primes = primes
primesTo' (x:xs) primes = if foldl (||) False $ map (dividableBy x) primes
                            then primesTo' xs primes
                            else primesTo' xs (x `insert` primes)

dividableBy :: Int -> Int -> Bool
dividableBy lop rop = (lop `mod` rop) == 0