Haskell prime test

Question

I\'m new to Haskell, and I\'m trying a bit:

isPrime :: Integer->Bool
isPrime x = ([] == [y | y<-[2..floor (sqrt x)], mod x y == 0])

I

Answer 1

1. I think WinHugs needs to import a module for Integer and etc... Try Int
2. The interpreter will not compute anything until you call e.g. isPrime 32 then it will lazily compute the expression.

PS your isPrime implementation is not the best implementation!