Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

Exact lookup

1. concatMapMonoid :: Monoid m => (time -> m) -> (body -> m) -> T time body -> m

   event-list	Data.EventList.Absolute.TimeBody

   No documentation available.

2. concatMapMonoid :: Monoid m => (time -> m) -> (body -> m) -> T time body -> m

   event-list	Data.EventList.Absolute.TimeTime

   No documentation available.

3. concatMapMonoid :: Monoid m => (time -> m) -> (body -> m) -> T time body -> m

   event-list	Data.EventList.Relative.BodyBody

   No documentation available.

4. concatMapMonoid :: Monoid m => (time -> m) -> (body -> m) -> T time body -> m

   event-list	Data.EventList.Relative.BodyTime

   No documentation available.

5. concatMapMonoid :: Monoid m => (time -> m) -> (body -> m) -> T time body -> m

   event-list	Data.EventList.Relative.TimeBody

   No documentation available.

6. concatMapMonoid :: Monoid m => (time -> m) -> (body -> m) -> T time body -> m

   event-list	Data.EventList.Relative.TimeTime

   No documentation available.

7. sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: t a) . (STraversable t, SMonad m) => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) t1) t2)

   singletons-base	Control.Monad.Singletons

   No documentation available.

8. sMapM_ :: forall a (m :: Type -> Type) b (t1 :: Type -> Type) (t2 :: a ~> m b) (t3 :: t1 a) . (SFoldable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (MapM_Sym0 :: TyFun (a ~> m b) (t1 a ~> m ()) -> Type) t2) t3)

   singletons-base	Control.Monad.Singletons

   No documentation available.

9. sMapM_ :: forall a (m :: Type -> Type) b (t1 :: Type -> Type) (t2 :: a ~> m b) (t3 :: t1 a) . (SFoldable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (MapM_Sym0 :: TyFun (a ~> m b) (t1 a ~> m ()) -> Type) t2) t3)

   singletons-base	Data.Foldable.Singletons

   No documentation available.

10. sMapMaybe :: forall a b (t1 :: a ~> Maybe b) (t2 :: [a]) . Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) t1) t2)

    singletons-base	Data.Maybe.Singletons

    No documentation available.

Page 76 of many | Previous | Next