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-lib-parser	GHC.Prelude.Basic

   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 :: forall (a :: Nat) (b :: Nat) . a :=: b

   natural-arithmetic	Arithmetic.Unsafe

   No documentation available.

3. data EQ

   tfp	Type.Data.Ord

   No documentation available.

4. module Test.QuickCheck.Instances.Eq

   No documentation available.

5. EQ :: Ordering

   foundation	Foundation

   No documentation available.

6. class Eq a

   foundation	Foundation

   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)

7. EQ :: Ordering

   prelude-compat	Prelude2010

   No documentation available.

8. class Eq a

   prelude-compat	Prelude2010

   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)

9. module Rebase.Data.Eq

   No documentation available.

10. class Eq a

    rebase	Rebase.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 7 of many | Previous | Next