Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

Exact lookup

1. module Data.Functor.Plus

   No documentation available.

2. class Alt f => Plus (f :: Type -> Type)

   semigroupoids	Data.Functor.Plus

   Laws:

   zero <!> m = m
   m <!> zero = m
   

   If extended to an Alternative then zero should equal empty.

3. newtype Product a

   base-compat	Data.Monoid.Compat

   Monoid under multiplication.

   Product x <> Product y == Product (x * y)
   

   Examples

   >>> Product 3 <> Product 4 <> mempty
   Product {getProduct = 12}
   

   >>> mconcat [ Product n | n <- [2 .. 10]]
   Product {getProduct = 3628800}
   

4. Product :: a -> Product a

   base-compat	Data.Monoid.Compat

   No documentation available.

5. newtype Product a

   base-compat	Data.Semigroup.Compat

   Monoid under multiplication.

   Product x <> Product y == Product (x * y)
   

   Examples

   >>> Product 3 <> Product 4 <> mempty
   Product {getProduct = 12}
   

   >>> mconcat [ Product n | n <- [2 .. 10]]
   Product {getProduct = 3628800}
   

6. Product :: a -> Product a

   base-compat	Data.Semigroup.Compat

   No documentation available.

7. Punc :: String -> Lexeme

   base-compat	Text.Read.Compat

   Punctuation or reserved symbol, e.g. (, ::

8. module Data.Bifunctor.Product

   The product of two bifunctors.

9. Pair :: f a b -> g a b -> Product (f :: k -> k1 -> Type) (g :: k -> k1 -> Type) (a :: k) (b :: k1)

   bifunctors	Data.Bifunctor.Product

   No documentation available.

10. data Product (f :: k -> k1 -> Type) (g :: k -> k1 -> Type) (a :: k) (b :: k1)

    bifunctors	Data.Bifunctor.Product

    Form the product of two bifunctors

Page 74 of many | Previous | Next