Hoogle Search

Within LTS Haskell 24.67 (ghc-9.10.3)

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

  1. type a ::: l = (Maybe a, l)

    monoid-extras Data.Monoid.MList

    No documentation available.

  2. class l :>: a

    monoid-extras Data.Monoid.MList

    The relation l :>: a holds when a is the type of an element in l. For example, (Char ::: Int ::: Bool ::: Nil) :>: Int.

  3. (:|) :: m -> m -> Split m

    monoid-extras Data.Monoid.Split

    No documentation available.

  4. data m :+. n

    monoid-extras Data.Semigroup.Coproduct

    m :+. n is the coproduct of semigroups m and n. Values of type m :+. n consist of alternating non-empty lists of m and n values. Composition is list concatenation, with appropriate combining of adjacent elements

  5. (:%) :: a -> a -> T a

    numeric-prelude Number.Ratio

    No documentation available.

  6. (:%) :: a -> a -> Ratio a

    numhask NumHask

    No documentation available.

  7. (:%) :: a -> a -> Ratio a

    numhask NumHask.Data.Rational

    No documentation available.

  8. data (a :: k) :~: (b :: k)

    parameterized-utils Data.Parameterized.BoolRepr

    Propositional equality. If a :~: b is inhabited by some terminating value, then the type a is the same as the type b. To use this equality in practice, pattern-match on the a :~: b to get out the Refl constructor; in the body of the pattern-match, the compiler knows that a ~ b.

  9. data (a :: k) :~: (b :: k)

    parameterized-utils Data.Parameterized.Classes

    Propositional equality. If a :~: b is inhabited by some terminating value, then the type a is the same as the type b. To use this equality in practice, pattern-match on the a :~: b to get out the Refl constructor; in the body of the pattern-match, the compiler knows that a ~ b.

  10. (::>) :: Ctx k -> k -> Ctx k

    parameterized-utils Data.Parameterized.Context

    No documentation available.

Page 22 of many | Previous | Next