Hoogle Search

Within LTS Haskell 24.7 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. class Num a

   classy-prelude-yesod	ClassyPrelude.Yesod

   Basic numeric class. The Haskell Report defines no laws for Num. However, (+) and (*) are customarily expected to define a ring and have the following properties:

   • Associativity of (+) (x + y) + z = x + (y + z)
   • Commutativity of (+) x + y = y + x
   • fromInteger 0 is the additive identity x + fromInteger 0 = x
   • negate gives the additive inverse x + negate x = fromInteger 0
   • Associativity of (*) (x * y) * z = x * (y * z)
   • fromInteger 1 is the multiplicative identity x * fromInteger 1 = x and fromInteger 1 * x = x
   • Distributivity of (*) with respect to (+) a * (b + c) = (a * b) + (a * c) and (b + c) * a = (b * a) + (c * a)
   • Coherence with toInteger if the type also implements Integral, then fromInteger is a left inverse for toInteger, i.e. fromInteger (toInteger i) == i
   Note that it isn't customarily expected that a type instance of both Num and Ord implement an ordered ring. Indeed, in base only Integer and Rational do.

2. class Num a

   constrained-categories	Control.Category.Constrained.Prelude

   Basic numeric class. The Haskell Report defines no laws for Num. However, (+) and (*) are customarily expected to define a ring and have the following properties:

   • Associativity of (+) (x + y) + z = x + (y + z)
   • Commutativity of (+) x + y = y + x
   • fromInteger 0 is the additive identity x + fromInteger 0 = x
   • negate gives the additive inverse x + negate x = fromInteger 0
   • Associativity of (*) (x * y) * z = x * (y * z)
   • fromInteger 1 is the multiplicative identity x * fromInteger 1 = x and fromInteger 1 * x = x
   • Distributivity of (*) with respect to (+) a * (b + c) = (a * b) + (a * c) and (b + c) * a = (b * a) + (c * a)
   • Coherence with toInteger if the type also implements Integral, then fromInteger is a left inverse for toInteger, i.e. fromInteger (toInteger i) == i
   Note that it isn't customarily expected that a type instance of both Num and Ord implement an ordered ring. Indeed, in base only Integer and Rational do.

3. class Num a

   constrained-categories	Control.Category.Hask

   Basic numeric class. The Haskell Report defines no laws for Num. However, (+) and (*) are customarily expected to define a ring and have the following properties:

   • Associativity of (+) (x + y) + z = x + (y + z)
   • Commutativity of (+) x + y = y + x
   • fromInteger 0 is the additive identity x + fromInteger 0 = x
   • negate gives the additive inverse x + negate x = fromInteger 0
   • Associativity of (*) (x * y) * z = x * (y * z)
   • fromInteger 1 is the multiplicative identity x * fromInteger 1 = x and fromInteger 1 * x = x
   • Distributivity of (*) with respect to (+) a * (b + c) = (a * b) + (a * c) and (b + c) * a = (b * a) + (c * a)
   • Coherence with toInteger if the type also implements Integral, then fromInteger is a left inverse for toInteger, i.e. fromInteger (toInteger i) == i
   Note that it isn't customarily expected that a type instance of both Num and Ord implement an ordered ring. Indeed, in base only Integer and Rational do.

4. class Num a

   copilot-language	Copilot.Language.Prelude

   Basic numeric class. The Haskell Report defines no laws for Num. However, (+) and (*) are customarily expected to define a ring and have the following properties:

   • Associativity of (+) (x + y) + z = x + (y + z)
   • Commutativity of (+) x + y = y + x
   • fromInteger 0 is the additive identity x + fromInteger 0 = x
   • negate gives the additive inverse x + negate x = fromInteger 0
   • Associativity of (*) (x * y) * z = x * (y * z)
   • fromInteger 1 is the multiplicative identity x * fromInteger 1 = x and fromInteger 1 * x = x
   • Distributivity of (*) with respect to (+) a * (b + c) = (a * b) + (a * c) and (b + c) * a = (b * a) + (c * a)
   • Coherence with toInteger if the type also implements Integral, then fromInteger is a left inverse for toInteger, i.e. fromInteger (toInteger i) == i
   Note that it isn't customarily expected that a type instance of both Num and Ord implement an ordered ring. Indeed, in base only Integer and Rational do.

5. class Num a

   verset	Verset

   Basic numeric class. The Haskell Report defines no laws for Num. However, (+) and (*) are customarily expected to define a ring and have the following properties:

   • Associativity of (+) (x + y) + z = x + (y + z)
   • Commutativity of (+) x + y = y + x
   • fromInteger 0 is the additive identity x + fromInteger 0 = x
   • negate gives the additive inverse x + negate x = fromInteger 0
   • Associativity of (*) (x * y) * z = x * (y * z)
   • fromInteger 1 is the multiplicative identity x * fromInteger 1 = x and fromInteger 1 * x = x
   • Distributivity of (*) with respect to (+) a * (b + c) = (a * b) + (a * c) and (b + c) * a = (b * a) + (c * a)
   • Coherence with toInteger if the type also implements Integral, then fromInteger is a left inverse for toInteger, i.e. fromInteger (toInteger i) == i
   Note that it isn't customarily expected that a type instance of both Num and Ord implement an ordered ring. Indeed, in base only Integer and Rational do.

6. class Num a

   xmonad-contrib	XMonad.Config.Prime

   Basic numeric class. The Haskell Report defines no laws for Num. However, (+) and (*) are customarily expected to define a ring and have the following properties:

   • Associativity of (+) (x + y) + z = x + (y + z)
   • Commutativity of (+) x + y = y + x
   • fromInteger 0 is the additive identity x + fromInteger 0 = x
   • negate gives the additive inverse x + negate x = fromInteger 0
   • Associativity of (*) (x * y) * z = x * (y * z)
   • fromInteger 1 is the multiplicative identity x * fromInteger 1 = x and fromInteger 1 * x = x
   • Distributivity of (*) with respect to (+) a * (b + c) = (a * b) + (a * c) and (b + c) * a = (b * a) + (c * a)
   • Coherence with toInteger if the type also implements Integral, then fromInteger is a left inverse for toInteger, i.e. fromInteger (toInteger i) == i
   Note that it isn't customarily expected that a type instance of both Num and Ord implement an ordered ring. Indeed, in base only Integer and Rational do.

7. num :: Quantity -> Amount

   hledger-lib	Hledger.Data.Amount

   No documentation available.

8. num :: EventType -> EventTypeNum

   ghc-events	GHC.RTS.Events

   No documentation available.

9. num :: Integral i => Color -> i

   haha	Graphics.Ascii.Haha.Terminal

   No documentation available.

10. num :: Fraction -> Integer

    numeric-quest	Fraction

    No documentation available.

Page 6 of many | Previous | Next