Hoogle Search

Within LTS Haskell 20.9 (ghc-9.2.5)

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

  1. EQ :: Ordering

    base Prelude

    No documentation available.

  2. class Eq a

    base 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)
    Minimal complete definition: either == or /=.

  3. module Data.Eq

    Equality

  4. class Eq a

    base 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)
    Minimal complete definition: either == or /=.

  5. EQ :: Ordering

    base Data.Ord

    No documentation available.

  6. EQ :: Expr -> Expr -> Expr

    tasty Test.Tasty.Patterns.Types

    No documentation available.

  7. class Eq a

    ghc-prim GHC.Classes

    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)
    Minimal complete definition: either == or /=.

  8. EQ :: Ordering

    ghc-prim GHC.Types

    No documentation available.

  9. EQ :: Ordering

    hedgehog Hedgehog.Internal.Prelude

    No documentation available.

  10. class Eq a

    hedgehog Hedgehog.Internal.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)
    Minimal complete definition: either == or /=.

Page 1 of many | Next