Number.Peano
 Portability portable Stability provisional Maintainer numericprelude@henning-thielemann.de
Description
Lazy Peano numbers represent natural numbers inclusive infinity. Since they are lazily evaluated, they are optimally for use as number type of Data.List.genericLength et.al.
Synopsis
data T
 = Zero | Succ T
infinity :: T
err :: String -> String -> a
add :: T -> T -> T
sub :: T -> T -> T
subNeg :: T -> T -> (Bool, T)
isAscending :: [T] -> Bool
mul :: T -> T -> T
fromPosEnum :: (C a, Enum a) => a -> T
toPosEnum :: (C a, Enum a) => T -> a
argMinFull :: (T, a) -> (T, a) -> (T, a)
argMin :: (T, a) -> (T, a) -> a
argMinimum :: [(T, a)] -> a
argMaxFull :: (T, a) -> (T, a) -> (T, a)
argMax :: (T, a) -> (T, a) -> a
argMaximum :: [(T, a)] -> a
legacyInstance :: a
Documentation
 data T Source
Constructors
 Zero Succ T Instances
 Bounded T Enum T Eq T Integral T Num T Ord T Read T Real T Show T Ix T C T C T C T C T C T C T C T C T C T C T C T C T
 infinity :: T Source
 err :: String -> String -> a Source
 add :: T -> T -> T Source
 sub :: T -> T -> T Source
 subNeg :: T -> T -> (Bool, T) Source
 isAscending :: [T] -> Bool Source
 mul :: T -> T -> T Source
 fromPosEnum :: (C a, Enum a) => a -> T Source
 toPosEnum :: (C a, Enum a) => T -> a Source
 argMinFull :: (T, a) -> (T, a) -> (T, a) Source
cf. To how to find the shortest list in a list of lists efficiently, this means, also in the presence of infinite lists. http://www.haskell.org/pipermail/haskell-cafe/2006-October/018753.html
 argMin :: (T, a) -> (T, a) -> a Source
On equality the first operand is returned.
 argMinimum :: [(T, a)] -> a Source
 argMaxFull :: (T, a) -> (T, a) -> (T, a) Source
 argMax :: (T, a) -> (T, a) -> a Source
On equality the first operand is returned.
 argMaximum :: [(T, a)] -> a Source
 legacyInstance :: a Source
Produced by Haddock version 2.6.0