As several of the comments have said, this is the Haskell RTS detecting an infinite loop at run-time. It cannot always detect such loops, but in simple cases it can.
For example,
x = x + 1
will compile just fine, but provoke an exception at run-time. (Incidentally, this is an exception - in particular, you can catch it if you want. But you probably don't "want".)
So why does GHC even let this compile? Well, because if I replace + with, say, :, then the expression now terminates just fine. (It represents a 1-element circular list.) The compiler can't tell at compile-time what is and is not sensible recursion. The RTS can't always tell at run-time; but when it can tell something's wrong, it'll let you know by throwing an exception at you.
Exception: <<loop>>. I assume the compiled outputprogname: <<loop>>is and STDERR message. Does this mean I have an infinite loop?fibs = 0 : scanl (+) 1 fibs, for instance. That's why it's allowed.