Hoogle Search

Within LTS Haskell 24.51 (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	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.

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

   functor-combinators	Data.Functor.Combinator

   No documentation available.

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

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

   No documentation available.

4. MaybeAccess :: Op

   sbv	Data.SBV.Internals

   No documentation available.

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

   sbv	Data.SBV.Internals

   No documentation available.

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

   sbv	Data.SBV.Internals

   No documentation available.

7. data Maybe' a

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

   A strict Maybe

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

   tree-fun	Math.TreeFun.Types

   No documentation available.

9. type family MaybeCase (a :: Maybe k) (nothing :: r) (just :: k -> r) :: r

   type-fun	TypeFun.Data.Maybe

   No documentation available.

10. data MaybePlaceholder e

    Agda	Agda.Syntax.Common

    Placeholders are used to represent the underscores in a section.

Page 23 of many | Previous | Next