Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. 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

  2. (:>>=) :: forall (instr :: Type -> Type) b (m :: Type -> Type) a . instr b -> (b -> ProgramT instr m a) -> ProgramViewT instr m a

    operational Control.Monad.Operational

    No documentation available.

  3. data ((f :: k -> Type) :*: (g :: k -> Type)) (p :: k)

    protolude Protolude

    Products: encode multiple arguments to constructors

  4. (:*:) :: f p -> g p -> (:*:) (f :: k -> Type) (g :: k -> Type) (p :: k)

    protolude Protolude

    No documentation available.

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

    protolude Protolude

    Sums: encode choice between constructors

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

    protolude Protolude

    Composition of functors

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

    protolude Protolude

    No documentation available.

  8. 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.

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

    HaXml Text.XML.HaXml.Combinators

    No documentation available.

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

    bson Data.Bson

    No documentation available.

Page 21 of many | Previous | Next