Hoogle Search

Within LTS Haskell 24.25 (ghc-9.10.3)

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

  1. unwrapApplicative :: WrappedApplicative (f :: Type -> Type) a -> f a

    rebase Rebase.Prelude

    No documentation available.

  2. liftApplicative :: Applicative f => (f a -> f b) -> f (T a) -> f (T b)

    synthesizer-core Synthesizer.Frame.Stereo

    No documentation available.

  3. scaleAndAccumulateApplicative :: (C a v, Applicative f) => (a, f v) -> (f v, f v -> f v)

    synthesizer-core Synthesizer.Interpolation.Class

    No documentation available.

  4. scaleAndAccumulateModuleApplicative :: (C a v, Applicative f) => (a, f v) -> (f v, f v -> f v)

    synthesizer-core Synthesizer.Interpolation.Class

    No documentation available.

  5. scaleAndAccumulateRingApplicative :: (C a, Applicative f) => (a, f a) -> (f a, f a -> f a)

    synthesizer-core Synthesizer.Interpolation.Class

    No documentation available.

  6. type CanDeriveApplicativeB (b :: k -> Type -> Type) (f :: k -> Type) (g :: k -> Type) = (GenericP 0 b f, GenericP 0 b g, GenericP 0 b Product f g, GApplicative 0 f g RepP 0 b f RepP 0 b g RepP 0 b Product f g)

    barbies Barbies.Internal

    CanDeriveApplicativeB B f g is in practice a predicate about B only. Intuitively, it says that the following holds, for any arbitrary f:

    • There is an instance of Generic (B f).
    • B has only one constructor (that is, it is not a sum-type).
    • Every field of B f is either a monoid, or of the form f a, for some type a.

  7. type CanDeriveApplicativeT (t :: k -> Type -> k1 -> Type) (f :: k -> Type) (g :: k -> Type) (x :: k1) = (GenericP 1 t f x, GenericP 1 t g x, GenericP 1 t Product f g x, GApplicative 1 f g RepP 1 t f x RepP 1 t g x RepP 1 t Product f g x)

    barbies Barbies.Internal

    CanDeriveApplicativeT T f g x is in practice a predicate about T only. Intuitively, it says that the following holds, for any arbitrary f:

    • There is an instance of Generic (T f).
    • T has only one constructor (that is, it is not a sum-type).
    • Every field of T f x is either a monoid, or of the form f a, for some type a.

  8. class GApplicative (n :: k) (f :: k2 -> Type) (g :: k2 -> Type) (repbf :: k1 -> Type) (repbg :: k1 -> Type) (repbfg :: k1 -> Type)

    barbies Barbies.Internal

    No documentation available.

  9. WrapApplicativeOnly :: f a -> WrappedApplicativeOnly (f :: k -> Type) (a :: k)

    functor-combinators Data.Functor.Invariant.Inplicative

    No documentation available.

  10. newtype WrappedApplicativeOnly (f :: k -> Type) (a :: k)

    functor-combinators Data.Functor.Invariant.Inplicative

    Wrap an Applicative that is not necessarily an Apply.

Page 17 of many | Previous | Next