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. module Data.Function.Eq

   No documentation available.

2. class Eq a

   ihaskell	IHaskellPrelude

   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)

3. EQ :: Ordering

   incipit-base	Incipit.Base

   No documentation available.

4. class Eq a

   subcategories	Control.Subcategory.RebindableSyntax

   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)

5. module TypeFun.Data.Eq

   No documentation available.

6. module Data.Universe.Instances.Eq

   No documentation available.

7. class Eq a

   universe-reverse-instances	Data.Universe.Instances.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)

8. Eq :: forall (inTp :: BaseType) . Binop inTp 'BaseBoolType

   what4	What4.Protocol.VerilogWriter.AST

   No documentation available.

9. Eq :: Operator

   cabal-gild	CabalGild.Unstable.Type.VersionRange

   No documentation available.

10. EQ :: Ordering

    clash-prelude	Clash.HaskellPrelude

    No documentation available.

Page 9 of many | Previous | Next