numbers-3000.2.0.2: Various number types
Safe HaskellSafe
LanguageHaskell98

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.

Synopsis

Documentation

data Natural Source #

Instances

Instances details
Enum Natural Source # 
Instance details

Defined in Data.Number.Natural

Eq Natural Source # 
Instance details

Defined in Data.Number.Natural

Methods

(==) :: Natural -> Natural -> Bool

(/=) :: Natural -> Natural -> Bool

Integral Natural Source # 
Instance details

Defined in Data.Number.Natural

Num Natural Source # 
Instance details

Defined in Data.Number.Natural

Ord Natural Source # 
Instance details

Defined in Data.Number.Natural

Methods

compare :: Natural -> Natural -> Ordering

(<) :: Natural -> Natural -> Bool

(<=) :: Natural -> Natural -> Bool

(>) :: Natural -> Natural -> Bool

(>=) :: Natural -> Natural -> Bool

max :: Natural -> Natural -> Natural

min :: Natural -> Natural -> Natural

Real Natural Source # 
Instance details

Defined in Data.Number.Natural

Methods

toRational :: Natural -> Rational

Show Natural Source # 
Instance details

Defined in Data.Number.Natural

Methods

showsPrec :: Int -> Natural -> ShowS

show :: Natural -> String

showList :: [Natural] -> ShowS

infinity :: Natural Source #

The infinite natural number.