Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. package eq

   Leibnizian equality Leibnizian equality.

2. eq :: PartialOrd a => a -> a -> Maybe Bool

   logfloat	Data.Number.PartialOrd

   like (==)

3. eq :: EQF f a => f a -> a -> a -> Bool

   xmonad-contrib	XMonad.Layout.ZoomRow

   No documentation available.

4. newtype Equivalence a

   base	Data.Functor.Contravariant

   This data type represents an equivalence relation. Equivalence relations are expected to satisfy three laws:

   • Reflexivity getEquivalence f a a = True
   • Symmetry getEquivalence f a b = getEquivalence f b a
   • Transitivity If getEquivalence f a b and getEquivalence f b c are both True then so is getEquivalence f a c.
   The types alone do not enforce these laws, so you'll have to check them yourself.

5. Equivalence :: (a -> a -> Bool) -> Equivalence a

   base	Data.Functor.Contravariant

   No documentation available.

6. module Data.Type.Equality

   Definition of propositional equality (:~:). Pattern-matching on a variable of type (a :~: b) produces a proof that a ~ b.

7. EqualityT :: Type

   template-haskell	Language.Haskell.TH

   ~
   

8. EqualityT :: Type

   template-haskell	Language.Haskell.TH.Syntax

   ~
   

9. type Equality (s :: k1) (t :: k2) (a :: k1) (b :: k2) = forall k3 (p :: k1 -> k3 -> Type) (f :: k2 -> k3) . () => p a f b -> p s f t

   lens	Control.Lens.Combinators

   A witness that (a ~ s, b ~ t). Note: Composition with an Equality is index-preserving.

10. type Equality' (s :: k2) (a :: k2) = Equality s s a a

    lens	Control.Lens.Combinators

    A Simple Equality.

Page 17 of many | Previous | Next