Hoogle Search

Within LTS Haskell 24.18 (ghc-9.10.3)

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

Exact lookup

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

   barbies	Barbies.Internal

   Sums: encode choice between constructors

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

   barbies	Barbies.Internal

   Composition of functors

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

   base-prelude	BasePrelude

   No documentation available.

4. (:+) :: a -> a -> Complex a

   base-prelude	BasePrelude.DataTypes

   forms a complex number from its real and imaginary rectangular components.

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

   base-prelude	BasePrelude.DataTypes

   No documentation available.

6. type (e :: Effect) :> (es :: [Effect]) = MemberBy LabelResolver Discriminator LabelResolver e e es

   data-effects-core	Data.Effect.OpenUnion

   No documentation available.

7. (:/) :: FilePath -> DirTree a -> AnchoredDirTree a

   directory-tree	System.Directory.Tree

   No documentation available.

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

   extra-data-yj	Data.List.Infinite

   No documentation available.

9. (:~) :: a -> Infinite a -> Infinite a

   extra-data-yj	Data.List.Infinite

   No documentation available.

10. data ((f :: Type -> Type -> Type -> Type) :+: (g :: Type -> Type -> Type -> Type)) (m :: Type -> Type) k

    fused-effects	Control.Algebra

    Higher-order sums are used to combine multiple effects into a signature, typically by chaining on the right.

Page 34 of many | Previous | Next