[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 rwbarton):

 Some version of strictness analysis could catch typos like `let y = y + 1
 in ...` (oops, meant `let y = x + 1 in ...`), right? (Assuming `y` is
 inferred to have a concrete type like `Int` where `(+)` is known to be
 strict.) Those can be annoying to track down at runtime.

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