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. ArrowReboundIfSkol :: SkolemInfoAnon

   ghc-lib-parser	GHC.Tc.Types.Origin

   No documentation available.

2. ArrowCaseAlt :: HsArrowMatchContext

   ghc-lib-parser	Language.Haskell.Syntax.Expr

   A case alternative inside arrow notation

3. ArrowExpr :: HsStmtContext fn

   ghc-lib-parser	Language.Haskell.Syntax.Expr

   do-notation in an arrow-command context

4. ArrowLamAlt :: HsLamVariant -> HsArrowMatchContext

   ghc-lib-parser	Language.Haskell.Syntax.Expr

   A , case or cases alternative inside arrow notation

5. ArrowMatchCtxt :: HsArrowMatchContext -> HsMatchContext fn

   ghc-lib-parser	Language.Haskell.Syntax.Expr

   A pattern match inside arrow notation

6. Arrows :: Extension

   hint	Language.Haskell.Interpreter

   No documentation available.

7. Arrows :: Extension

   hint	Language.Haskell.Interpreter.Extension

   No documentation available.

8. ArrowCmdOrigin :: CtOrigin

   ghc-typelits-presburger	GHC.TypeLits.Presburger.Compat

   No documentation available.

9. class Arrow a => ArrowApply (a :: Type -> Type -> Type)

   rebase	Rebase.Prelude

   Some arrows allow application of arrow inputs to other inputs. Instances should satisfy the following laws:

   • first (arr (\x -> arr (\y ->
     (x,y)))) >>> app = id

   • first (arr (g >>>)) >>>
     app = second g >>> app

   • first (arr (>>> h)) >>>
     app = app >>> h

   Such arrows are equivalent to monads (see ArrowMonad).

10. class Arrow a => ArrowChoice (a :: Type -> Type -> Type)

    rebase	Rebase.Prelude

    Choice, for arrows that support it. This class underlies the if and case constructs in arrow notation. Instances should satisfy the following laws:

    • left (arr f) = arr (left
      f)

    • left (f >>> g) = left f >>>
      left g

    • f >>> arr Left = arr
      Left >>> left f

    • left f >>> arr (id +++ g) =
      arr (id +++ g) >>> left f

    • left (left f) >>> arr assocsum
      = arr assocsum >>> left f

    where

    assocsum (Left (Left x)) = Left x
    assocsum (Left (Right y)) = Right (Left y)
    assocsum (Right z) = Right (Right z)
    

    The other combinators have sensible default definitions, which may be overridden for efficiency.

Page 17 of many | Previous | Next