My first Project Euler solution using Haskell. This one (number 55) finds how many Lychrel numbers are smaller than 10000.

euler55.hs

solve = isLychrel 0
        where   isLychrel i x   | d == reverse d    = False
                                | i > 50            = True
                                | otherwise         = isLychrel (i + 1) c
                        where   b = reverse $ show x
                                c = (x + (read b :: Integer))
                                d = show c

main = print $ length $ filter (== True) $ map solve [1..9999]