Hoogle Search

Within LTS Haskell 24.13 (ghc-9.10.3)

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

  1. ApplicativeArgMany :: XApplicativeArgMany idL -> [ExprLStmt idL] -> HsExpr idL -> LPat idL -> HsDoFlavour -> ApplicativeArg idL

    ghc-lib-parser GHC.Hs.Expr

    No documentation available.

  2. ApplicativeArgOne :: XApplicativeArgOne idL -> LPat idL -> LHsExpr idL -> Bool -> ApplicativeArg idL

    ghc-lib-parser GHC.Hs.Expr

    No documentation available.

  3. data ApplicativeStmt idL idR

    ghc-lib-parser GHC.Hs.Expr

    ApplicativeStmt represents an applicative expression built with <$> and <*>. It is generated by the renamer, and is desugared into the appropriate applicative expression by the desugarer, but it is intended to be invisible in error messages. For full details, see Note [ApplicativeDo] in GHC.Rename.Expr

  4. ApplicativeStmt :: XApplicativeStmt idL idR -> [(SyntaxExpr idR, ApplicativeArg idL)] -> Maybe (SyntaxExpr idR) -> ApplicativeStmt idL idR

    ghc-lib-parser GHC.Hs.Expr

    No documentation available.

  5. ApplicativeDo :: Extension

    ghc-lib-parser GHC.Internal.LanguageExtensions

    No documentation available.

  6. ApplicativeDo :: Extension

    ghc-lib-parser GHC.LanguageExtensions.Type

    No documentation available.

  7. ApplicativeDo :: Extension

    hint Language.Haskell.Interpreter

    No documentation available.

  8. ApplicativeDo :: Extension

    hint Language.Haskell.Interpreter.Extension

    No documentation available.

  9. module Synthesizer.ApplicativeUtility

    No documentation available.

  10. class FunctorB b => ApplicativeB (b :: k -> Type -> Type)

    barbies Data.Functor.Barbie

    A FunctorB with application, providing operations to:

    • embed an "empty" value (bpure)
    • align and combine values (bprod)
    It should satisfy the following laws:
    bmap ((Pair a b) -> Pair (f a) (g b)) (u `bprod' v) = bmap f u `bprod' bmap g v
    
    • Left and right identity
    bmap ((Pair _ b) -> b) (bpure e `bprod' v) = v
    bmap ((Pair a _) -> a) (u `bprod' bpure e) = u
    
    • Associativity
    bmap ((Pair a (Pair b c)) -> Pair (Pair a b) c) (u `bprod' (v `bprod' w)) = (u `bprod' v) `bprod' w
    
    It is to FunctorB in the same way as Applicative relates to Functor. For a presentation of Applicative as a monoidal functor, see Section 7 of Applicative Programming with Effects. There is a default implementation of bprod and bpure based on Generic. Intuitively, it works on types where the value of bpure is uniquely defined. This corresponds rougly to record types (in the presence of sums, there would be several candidates for bpure), where every field is either a Monoid or covered by the argument f.

Page 9 of many | Previous | Next