Hoogle Search

Within LTS Haskell 24.31 (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. (:>>=) :: 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.

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

    protolude Protolude

    Products: encode multiple arguments to constructors

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

    protolude Protolude

    No documentation available.

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

    protolude Protolude

    Sums: encode choice between constructors

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

    protolude Protolude

    Composition of functors

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

    protolude Protolude

    No documentation available.

Page 21 of many | Previous | Next