Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

  1. newtype Product a

    numhask NumHask.Algebra.Multiplicative

    A wrapper for an Multiplicative which distinguishes the multiplicative structure

  2. Product :: a -> Product a

    numhask NumHask.Algebra.Multiplicative

    No documentation available.

  3. module NumHask.Data.Positive

    A positive number type, defined as existing on [zero, +infinity)

  4. newtype Positive a

    numhask NumHask.Data.Positive

    A positive number is a number that is contained in [zero,+infinity). 

    >>> 1 :: Positive Int
UnsafePositive {unPositive = 1}

    >>> -1 :: Positive Int
...
• No instance for ‘Subtractive (Positive Int)’
arising from a use of syntactic negation
...
    zero is positive 
    >>> positive 0 == zero
True
    The main constructors: 
    >>> positive (-1)
UnsafePositive {unPositive = 0}

    >>> maybePositive (-1)
Nothing

    >>> UnsafePositive (-1)
UnsafePositive {unPositive = -1}

  5. module NumHask.Prelude

    A prelude composed by overlaying numhask on Prelude, together with a few minor tweaks needed for RebindableSyntax.

  6. module Data.Parameterized

    No documentation available.

  7. class PolyEq u v

    parameterized-utils Data.Parameterized.Classes

    A polymorphic equality operator that generalizes TestEquality.

  8. module Data.Parameterized.Ctx.Proofs

    This reflects type level proofs involving contexts.

  9. data PairRepr (f :: k1 -> Type) (g :: k2 -> Type) (p :: (k1, k2))

    parameterized-utils Data.Parameterized.DataKind

    No documentation available.

  10. data Pair (a :: k -> Type) (b :: k -> Type)

    parameterized-utils Data.Parameterized.Map

    Like a 2-tuple, but with an existentially quantified parameter that both of the elements share.

Page 463 of many | Previous | Next