• About
  • Snapshots
  • LTS
  • Nightly
  • FAQ
  • Blog

Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

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

    hakyll Hakyll.Core.Identifier.Pattern

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

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

    hw-bits HaskellWorks.Data.Bits.BitWise

    Bit-wise AND

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

    kind-apply Data.PolyKinded

    Cons a type with a list of types.

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

    kind-apply Data.PolyKinded.Atom

    Represents the conjunction of two constraints.

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

    kind-generics Generics.Kind

    Cons a type with a list of types.

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

    kind-generics Generics.Kind

    Represents the conjunction of two constraints.

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

    lazysmallcheck Test.LazySmallCheck

    No documentation available.

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

    minisat-solver SAT.MiniSat

    Conjunction.

  9. (|&) :: 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.

  10. (|&|) :: Semigroupal (->) These (,) f => f a -> f b -> f (These a b)

    monoidal-functors Data.Functor.Monoidal

    No documentation available.

Page 41 of many | Previous | Next

Stackage is a service provided by the Haskell Foundation │ Originally developed by FP Complete