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.

Exact lookup

1. pattern (:=<<) :: forall s sq f t a x . () => Fun s sq f t x a -> t x -> Freer s sq f t a

   freer-par-monad	Control.Monad.Freer.Par

   No documentation available.

2. pattern (:>>=) :: forall t s sq f a x . () => t x -> Fun s sq f t x a -> Freer s sq f t a

   freer-par-monad	Control.Monad.Freer.Par

   No documentation available.

3. (:<|) :: forall (cat :: Type -> Type -> Type) a x (sq :: (Type -> Type -> Type) -> Type -> Type -> Type) b . cat a x -> sq cat x b -> ViewL sq cat a b

   freer-par-monad	Control.Monad.Freer.Par.Sequence

   No documentation available.

4. (:>>=) :: f x -> (x -> g a) -> Comp (f :: Type -> Type) (g :: k -> Type) (a :: k)

   functor-combinators	Control.Monad.Freer.Church

   No documentation available.

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

   functor-combinators	Data.Functor.Combinator

   Products: encode multiple arguments to constructors

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

   functor-combinators	Data.Functor.Combinator

   No documentation available.

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

   functor-combinators	Data.Functor.Combinator

   Sums: encode choice between constructors

8. (:<$>:) :: (b -> a) -> f b -> Post a (f :: Type -> Type) b

   functor-combinators	Data.HFunctor.Route

   No documentation available.

9. (:>$<:) :: (a -> b) -> f b -> Pre a (f :: Type -> Type) b

   functor-combinators	Data.HFunctor.Route

   No documentation available.

10. (:>) :: forall a (as1 :: [Type]) . a -> HList as1 -> HList (a ': as1)

    generic-lens-core	Data.Generics.Product.Internal.HList

    No documentation available.

Page 42 of many | Previous | Next