[GHC] #4385: Type-level natural numbers

[GHC]

#4385: Type-level natural numbers
----------------------------------------+-----------------------------------
    Reporter:  diatchki                 |        Owner:  diatchki    
        Type:  feature request          |       Status:  new         
    Priority:  normal                   |    Milestone:  7.2.1       
   Component:  Compiler (Type checker)  |      Version:              
    Keywords:                           |     Testcase:              
   Blockedby:                           |   Difficulty:              
          Os:  Unknown/Multiple         |     Blocking:              
Architecture:  Unknown/Multiple         |      Failure:  None/Unknown
----------------------------------------+-----------------------------------
Changes (by adamgundry):

 * cc: adam.gundry@… (added)


Comment:

 I have been doing some theoretical work on type inference for systems like
 this, and am interested to see how this extension progresses. It is
 definitely worth considering signed integers: if nothing else, solving
 equations tends to become easier. Of course, natural numbers can be
 recovered once you have inequalities, though it might make sense to have
 special support for such a common use case.

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