[GHC] #9207: Detect obvious cases of infinite recursion.

[GHC]

#9207: Detect obvious cases of infinite recursion.
------------------------------------+--------------------------------------
        Reporter:  mrugiero         |            Owner:
            Type:  feature request  |           Status:  closed
        Priority:  normal           |        Milestone:
       Component:  Compiler         |          Version:  7.8.2
      Resolution:  invalid          |         Keywords:  infinite recursion
Operating System:                   |     Architecture:  Unknown/Multiple
  Unknown/Multiple                  |       Difficulty:  Unknown
 Type of failure:  None/Unknown     |       Blocked By:
       Test Case:                   |  Related Tickets:
        Blocking:                   |
------------------------------------+--------------------------------------

Comment (by altaic):

 I don't think, in principal, this is a bad idea, but it is part of a very
 challenging problem: static complexity (time and space) analysis. There
 are quite a few papers on the topic, which I can post here if there's
 interest. In general it is undecidable, but there are many situations
 where it is not. I plan on opening a ticket for just that when I form a
 sensible plan of attack (though it might be awhile, since I'm currently
 focusing on more pragmatic issues).

--
Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/9207#comment:6>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler