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. (:*:) :: f p -> g p -> (:*:) (f :: k -> Type) (g :: k -> Type) (p :: k)

    protolude Protolude

    No documentation available.

  2. data ((f :: k -> Type) :+: (g :: k -> Type)) (p :: k)

    protolude Protolude

    Sums: encode choice between constructors

  3. newtype ((f :: k2 -> Type) :.: (g :: k1 -> k2)) (p :: k1)

    protolude Protolude

    Composition of functors

  4. (:|) :: a -> [a] -> NonEmpty a

    protolude Protolude

    No documentation available.

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

    protolude Protolude

    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.

  6. (:>) :: a -> a -> ThenElse a

    HaXml Text.XML.HaXml.Combinators

    No documentation available.

  7. (:=) :: Label -> Value -> Field

    bson Data.Bson

    No documentation available.

  8. (:*:) :: a -> b -> PairS a b

    jsaddle Data.JSString.Internal.Fusion.Types

    No documentation available.

  9. data m :+: n

    monoid-extras Data.Monoid.Coproduct

    m :+: n is the coproduct of monoids m and n. Values of type m :+: n consist of alternating lists of m and n values. The empty list is the identity, and composition is list concatenation, with appropriate combining of adjacent elements and removing identities when possible.

  10. (:||:) :: m -> m -> Cut m

    monoid-extras Data.Monoid.Cut

    No documentation available.

Page 21 of many | Previous | Next