Hoogle Search

Within LTS Haskell 24.37 (ghc-9.10.3)

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

Exact lookup

1. newtype MaybeF (f :: k -> Type) (a :: k)

   functor-combinators	Control.Applicative.ListF

   A maybe f a. Can be useful for describing a "an f a that may or may not be there". This is the free structure for a "fail"-like typeclass that would only have zero :: f a.

2. MaybeF :: Maybe (f a) -> MaybeF (f :: k -> Type) (a :: k)

   functor-combinators	Control.Applicative.ListF

   No documentation available.

3. newtype MaybeF (f :: k -> Type) (a :: k)

   functor-combinators	Data.Functor.Combinator

   A maybe f a. Can be useful for describing a "an f a that may or may not be there". This is the free structure for a "fail"-like typeclass that would only have zero :: f a.

4. MaybeF :: Maybe (f a) -> MaybeF (f :: k -> Type) (a :: k)

   functor-combinators	Data.Functor.Combinator

   No documentation available.

5. data Maybe1 (f :: k -> Type) (a :: k)

   reflex-dom-core	Reflex.Dom.Builder.Immediate

   No documentation available.

6. MaybeAccess :: Op

   sbv	Data.SBV.Internals

   No documentation available.

7. MaybeConstructor :: Kind -> Bool -> Op

   sbv	Data.SBV.Internals

   No documentation available.

8. MaybeIs :: Kind -> Bool -> Op

   sbv	Data.SBV.Internals

   No documentation available.

9. data Maybe' a

   streamly-core	Streamly.Internal.Data.Maybe.Strict

   A strict Maybe

10. type MaybePropertyMap a b = Map a Maybe Seq b

    tree-fun	Math.TreeFun.Types

    No documentation available.

Page 93 of many | Previous | Next