
Number.Peano  Portability  portable  Stability  provisional  Maintainer  numericprelude@henningthielemann.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 

  infinity :: T   err :: String > String > a   add :: T > T > T   sub :: T > T > T   subNeg :: T > T > (Bool, T)   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   isAscendingFiniteList :: [T] > Bool   isAscendingFiniteNumbers :: [T] > Bool   toListMaybe :: a > T > [Maybe a]   glue :: T > T > (T, T, Bool)   isAscending :: [T] > Bool   data Valuable a = Valuable {}   increaseCosts :: T > Valuable a > Valuable a   (&&~) :: Valuable Bool > Valuable Bool > Valuable Bool   andW :: [Valuable Bool] > Valuable Bool   leW :: T > T > Valuable Bool   isAscendingW :: [T] > Valuable Bool   legacyInstance :: a 


Documentation 


Constructors   Instances  


















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/haskellcafe/2006October/018753.html



On equality the first operand is returned.




argMaxFull :: (T, a) > (T, a) > (T, a)  Source 



On equality the first operand is returned.





x0 <= x1 && x1 <= x2 ...
for possibly infinite numbers in finite lists.







In glue x y == (z,r,b)
z represents min x y,
r represents max x y  min x y,
and x<=y == b.
Cf. Numeric.NonNegative.Chunky





Constructors   Instances  





Compute '(&&)' with minimal costs.










Produced by Haddock version 2.4.2 