Hoogle Search

Within LTS Haskell 24.22 (ghc-9.10.3)

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

Exact lookup

1. data ((a :: Predicate k) &&& (b :: Predicate k)) (c :: TyFun k Type)

   decidable	Data.Type.Predicate.Logic

   p &&& q is a predicate that both p and q are true.

2. (&&) :: Bool -> Bool -> Bool

   dimensional	Numeric.Units.Dimensional.Prelude

   Boolean "and", lazy in the second argument

3. (&&) :: Bool -> Bool -> Bool

   distribution-opensuse	OpenSuse.Prelude

   Boolean "and", lazy in the second argument

4. (&&^) :: Monad m => m Bool -> m Bool -> m Bool

   distribution-opensuse	OpenSuse.Prelude

   The lazy && operator lifted to a monad. If the first argument evaluates to False the second argument will not be evaluated.

   Just False &&^ undefined  == Just False
   Just True  &&^ Just True  == Just True
   Just True  &&^ Just False == Just False
   

5. (&&&) :: Arrow a => a b c -> a b c' -> a b (c, c')

   dunai	Data.MonadicStreamFunction.Core

   Fanout: send the input to both argument arrows and combine their output. The default definition may be overridden with a more efficient version if desired.

6. (&|&) :: forall (m :: Type -> Type) a b c . Monad m => MSF m a b -> MSF m a c -> MSF m a (b, c)

   dunai	Data.MonadicStreamFunction.Parallel

   Parallel version of &&&.

7. (&&) :: Boolean b => b -> b -> b

   ersatz	Ersatz.Bit

   Logical conjunction.

8. (&&) :: Bool -> Bool -> Bool

   faktory	Faktory.Prelude

   Boolean "and", lazy in the second argument

9. type (p :: k) && (q :: k1) = And p q

   gdp	Logic.Propositional

   An infix alias for And.

10. (&.) :: GTraversal c a b -> Walk c b d -> GTraversal c a d

    greskell	Data.Greskell

    Apply the Walk to the GTraversal. In Gremlin, this means calling a chain of methods on the Traversal object.

Page 21 of many | Previous | Next