| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell98 |
Data.Number.Natural
Description
Lazy natural numbers.
Addition and multiplication recurses over the first argument, i.e.,
1 + n is the way to write the constant time successor function.
Note that (+) and (*) are not commutative for lazy natural numbers when considering bottom.
Documentation
Instances
| Enum Natural Source # | |
Defined in Data.Number.Natural Methods succ :: Natural -> Natural Source # pred :: Natural -> Natural Source # toEnum :: Int -> Natural Source # fromEnum :: Natural -> Int Source # enumFrom :: Natural -> [Natural] Source # enumFromThen :: Natural -> Natural -> [Natural] Source # enumFromTo :: Natural -> Natural -> [Natural] Source # enumFromThenTo :: Natural -> Natural -> Natural -> [Natural] Source # | |
| Num Natural Source # | |
Defined in Data.Number.Natural | |
| Integral Natural Source # | |
Defined in Data.Number.Natural Methods quot :: Natural -> Natural -> Natural Source # rem :: Natural -> Natural -> Natural Source # div :: Natural -> Natural -> Natural Source # mod :: Natural -> Natural -> Natural Source # quotRem :: Natural -> Natural -> (Natural, Natural) Source # | |
| Real Natural Source # | |
Defined in Data.Number.Natural Methods toRational :: Natural -> Rational Source # | |
| Show Natural Source # | |
| Eq Natural Source # | |
| Ord Natural Source # | |
Defined in Data.Number.Natural | |