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.

  1. (.<&>) :: (TryMerge f, Mergeable a, Mergeable b, Functor f) => f a -> (a -> b) -> f b

    grisette Grisette.Unified.Lib.Data.Functor

    <&> with MergingStrategy knowledge propagation.

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

    hakyll Hakyll.Core.Identifier.Pattern

    && for patterns: the given identifier must match both subterms

  3. (.&.) :: BitWise a => a -> a -> a

    hw-bits HaskellWorks.Data.Bits.BitWise

    Bit-wise AND

  4. (:&&:) :: forall k1 ks . k1 -> LoT ks -> LoT (k1 -> ks)

    kind-apply Data.PolyKinded

    Cons a type with a list of types.

  5. (:&:) :: forall d . Atom d Constraint -> Atom d Constraint -> Atom d Constraint

    kind-apply Data.PolyKinded.Atom

    Represents the conjunction of two constraints.

  6. (:&&:) :: forall k1 ks . k1 -> LoT ks -> LoT (k1 -> ks)

    kind-generics Generics.Kind

    Cons a type with a list of types.

  7. (:&:) :: forall d . Atom d Constraint -> Atom d Constraint -> Atom d Constraint

    kind-generics Generics.Kind

    Represents the conjunction of two constraints.

  8. (*&*) :: Property -> Property -> Property

    lazysmallcheck Test.LazySmallCheck

    No documentation available.

  9. (:&&:) :: Formula v -> Formula v -> Formula v

    minisat-solver SAT.MiniSat

    Conjunction.

  10. (|&) :: Semigroupal (->) Either (,) (,) p => p a b -> p c d -> p (Either a c) (b, d)

    monoidal-functors Data.Bifunctor.Monoidal.Specialized

    Infix operator for splice.

Page 41 of many | Previous | Next