Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

  1. (->>>>>>:) :: (a -> b -> c -> d -> e -> f -> g) -> g -> a -> b -> c -> d -> e -> f -> g

    express Data.Express.Express

    Forces the result type of a 6-argument function.

  2. (->>>>>>>:) :: (a -> b -> c -> d -> e -> f -> g -> h) -> h -> a -> b -> c -> d -> e -> f -> g -> h

    express Data.Express.Express

    Forces the result type of a 7-argument function.

  3. (->>>>>>>>:) :: (a -> b -> c -> d -> e -> f -> g -> h -> i) -> i -> a -> b -> c -> d -> e -> f -> g -> h -> i

    express Data.Express.Express

    Forces the result type of a 8-argument function.

  4. (->>>>>>>>>:) :: (a -> b -> c -> d -> e -> f -> g -> h -> i -> j) -> j -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j

    express Data.Express.Express

    Forces the result type of a 9-argument function.

  5. (->>>>>>>>>>:) :: (a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k) -> k -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k

    express Data.Express.Express

    Forces the result type of a 10-argument function.

  6. (->>>>>>>>>>>:) :: (a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l) -> l -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l

    express Data.Express.Express

    Forces the result type of a 11-argument function.

  7. (->>>>>>>>>>>>:) :: (a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m) -> m -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m

    express Data.Express.Express

    Forces the result type of a 12-argument function.

  8. (^>>>) :: forall (m :: Type -> Type) a b cl c . Monad m => (a -> b) -> SN m cl b c -> SN m cl a c

    rhine FRP.Rhine.SN.Combinators

    Precompose a signal network with a pure function.

  9. (^>>>) :: forall (m1 :: Type -> Type) (m2 :: Type -> Type) a b c . MonadBase m1 m2 => MSF m1 a b -> MSF m2 b c -> MSF m2 a c

    dunai Data.MonadicStreamFunction.Core

    Lift the first MSF into the monad of the second.

  10. (<<<~~>>>) :: (a -> b -> c -> d -> e -> f) -> d -> e -> c -> a -> b -> f

    composition-extra Data.Function.Twist

    No documentation available.

Page 5 of many | Previous | Next