Your comment is basically correct. This paper deals with the representation issue somewhat. But I think those results are applicable to computation in general, and the choice of Haskell is irrelevant to the discussion. You're welcome to prove me wrong by exhibiting a representation of exact reals that allows decidable equality, in any programming language.
[edit: sorry, the formatting of links and italics in this is all screwy. I've tried editing both the rich-text and the HTML and either way it looks ok while i'm editing it but the formatted terms either come out with no surrounding spaces or two surrounding spaces]
In the latest Rationality Quotes thread, CronoDAS quoted Paul Graham: