Project Euler Problem 4

palindrome.hs

import Data.List

products :: [Int]
products = reverse (Data.List.sort [x*y | x<-[100..999], y<-[100..999]])

isPalindrome :: Int -> Bool
isPalindrome x = (read (reverse (show x)) :: Int) == x

getLargestPalindrome :: [Int] -> Int
getLargestPalindrome xs = 
  if isPalindrome (head xs)
  then (head xs)
  else getLargestPalindrome(tail xs)

main :: IO()
main = putStrLn (show (getLargestPalindrome products))