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

GHC ghc-devs at haskell.org
Sun Jun 15 19:33:32 UTC 2014


#9207: Detect obvious cases of infinite recursion.
------------------------------------+--------------------------------------
        Reporter:  mrugiero         |            Owner:
            Type:  feature request  |           Status:  new
        Priority:  normal           |        Milestone:
       Component:  Compiler         |          Version:  7.8.2
      Resolution:                   |         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 mrugiero):

 Can you put an example of use of that function? Because I don't really see
 right now (and as I said, I'm just learning the language) creating an
 infinite list is good or useful. It just sounds like a blown up stack to
 me, whenever the list actually gets created. I guess this moment will be,
 thankfully, whenever a tail recursion starts using the generated values,
 am I right?

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


More information about the ghc-tickets mailing list