[GHC] #15646: ghci takes super long time to find the type of large fractional number

[GHC]

#15646: ghci takes super long time to find the type of large fractional number
-------------------------------------+-------------------------------------
        Reporter:  Johannkokos       |                Owner:
                                     |  JulianLeviston
            Type:  bug               |               Status:  new
        Priority:  normal            |            Milestone:  8.6.1
       Component:  GHCi              |              Version:  8.4.3
      Resolution:                    |             Keywords:  newcomer
Operating System:  Unknown/Multiple  |         Architecture:
 Type of failure:  Compile-time      |  Unknown/Multiple
  performance bug                    |            Test Case:
      Blocked By:                    |             Blocking:
 Related Tickets:                    |  Differential Rev(s):
       Wiki Page:                    |
-------------------------------------+-------------------------------------

Comment (by JulianLeviston):

 Simon, your supposition is just what I had in mind when I asked "Should I
 also store the base within the `FractionalLit` type?".

 A sum type for the exponent is a great idea, I hadn't even thought of it,
 but it makes more much sense for efficiency, intention conveyance and
 clarity. Thank you!

 Yeah, I'll lay out the design and draft note. It would have been helpful
 to me in the past to have known the way hex rationals work, so this would
 fulfil that role, too.

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