Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

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

Exact lookup

1. type family WrapMonoidSym1 (a6989586621679696739 :: m) :: WrappedMonoid m

   singletons-base	Data.Semigroup.Singletons

   No documentation available.

2. sUnwrapMonoid :: forall m (t :: WrappedMonoid m) . Sing t -> Sing (Apply (UnwrapMonoidSym0 :: TyFun (WrappedMonoid m) m -> Type) t)

   singletons-base	Data.Semigroup.Singletons

   No documentation available.

3. class PMonoid a

   singletons-base	Data.Singletons.Base.TH

   No documentation available.

4. class SSemigroup a => SMonoid a

   singletons-base	Data.Singletons.Base.TH

   No documentation available.

5. class PMonoid a

   singletons-base	Prelude.Singletons

   No documentation available.

6. class SSemigroup a => SMonoid a

   singletons-base	Prelude.Singletons

   No documentation available.

7. composOpMonoid :: (Uniplate a, Monoid m) => (a -> m) -> a -> m

   uniplate	Data.Generics.Compos

   composOpMonoid = composOpFold mempty mappend
   

8. WrapMonoid :: m -> WrappedMonoid m

   base-compat-batteries	Data.Semigroup.Compat

   No documentation available.

9. newtype WrappedMonoid m

   base-compat-batteries	Data.Semigroup.Compat

   Provide a Semigroup for an arbitrary Monoid. NOTE: This is not needed anymore since Semigroup became a superclass of Monoid in base-4.11 and this newtype be deprecated at some point in the future.

10. stimesIdempotentMonoid :: (Integral b, Monoid a) => b -> a -> a

    base-compat-batteries	Data.Semigroup.Compat

    This is a valid definition of stimes for an idempotent Monoid. When x <> x = x, this definition should be preferred, because it works in <math> rather than <math>

Page 26 of many | Previous | Next