Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. class Eq a

   ghc-internal	GHC.Internal.Data.Eq

   The Eq class defines equality (==) and inequality (/=). All the basic datatypes exported by the Prelude are instances of Eq, and Eq may be derived for any datatype whose constituents are also instances of Eq. The Haskell Report defines no laws for Eq. However, instances are encouraged to follow these properties:

   • Reflexivity x == x = True
   • Symmetry x == y = y == x
   • Transitivity if x == y && y == z = True, then x == z = True
   • Extensionality if x == y = True and f is a function whose return type is an instance of Eq, then f x == f y = True
   • Negation x /= y = not (x == y)

2. EQ :: Ordering

   ghc-internal	GHC.Internal.Data.Ord

   No documentation available.

3. EQ :: Ordering

   ghc-internal	GHC.Internal.Exts

   No documentation available.

4. Eq :: OrdPlus

   hledger-lib	Hledger.Query

   No documentation available.

5. class Eq (v :: Type -> Type)

   numeric-prelude	Algebra.Vector

   We need a Haskell 98 type class which provides equality test for Vector type constructors.

6. EQ :: Ordering

   numeric-prelude	NumericPrelude

   No documentation available.

7. class Eq a

   numeric-prelude	NumericPrelude

   The Eq class defines equality (==) and inequality (/=). All the basic datatypes exported by the Prelude are instances of Eq, and Eq may be derived for any datatype whose constituents are also instances of Eq. The Haskell Report defines no laws for Eq. However, instances are encouraged to follow these properties:

   • Reflexivity x == x = True
   • Symmetry x == y = y == x
   • Transitivity if x == y && y == z = True, then x == z = True
   • Extensionality if x == y = True and f is a function whose return type is an instance of Eq, then f x == f y = True
   • Negation x /= y = not (x == y)

8. EQ :: Ordering

   numeric-prelude	NumericPrelude.Base

   No documentation available.

9. class Eq a

   numeric-prelude	NumericPrelude.Base

   The Eq class defines equality (==) and inequality (/=). All the basic datatypes exported by the Prelude are instances of Eq, and Eq may be derived for any datatype whose constituents are also instances of Eq. The Haskell Report defines no laws for Eq. However, instances are encouraged to follow these properties:

   • Reflexivity x == x = True
   • Symmetry x == y = y == x
   • Transitivity if x == y && y == z = True, then x == z = True
   • Extensionality if x == y = True and f is a function whose return type is an instance of Eq, then f x == f y = True
   • Negation x /= y = not (x == y)

10. class Eq a

    numhask	NumHask.Prelude

    The Eq class defines equality (==) and inequality (/=). All the basic datatypes exported by the Prelude are instances of Eq, and Eq may be derived for any datatype whose constituents are also instances of Eq. The Haskell Report defines no laws for Eq. However, instances are encouraged to follow these properties:

    • Reflexivity x == x = True
    • Symmetry x == y = y == x
    • Transitivity if x == y && y == z = True, then x == z = True
    • Extensionality if x == y = True and f is a function whose return type is an instance of Eq, then f x == f y = True
    • Negation x /= y = not (x == y)

Page 5 of many | Previous | Next