Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

  1. eqForAllVis :: ForAllTyFlag -> ForAllTyFlag -> Bool

    ghc-lib-parser GHC.Core.TyCo.Compare

    Do these denote the same level of visibility? Required arguments are visible, others are not. So this function equates Specified and Inferred. Used for printing.

  2. eqType :: HasCallStack => Type -> Type -> Bool

    ghc-lib-parser GHC.Core.TyCo.Compare

    Type equality comparing both visible and invisible arguments, expanding synonyms and respecting multiplicities.

  3. eqTypeIgnoringMultiplicity :: Type -> Type -> Bool

    ghc-lib-parser GHC.Core.TyCo.Compare

    No documentation available.

  4. eqTypeX :: HasCallStack => RnEnv2 -> Type -> Type -> Bool

    ghc-lib-parser GHC.Core.TyCo.Compare

    Compare types with respect to a (presumably) non-empty RnEnv2.

  5. eqTypes :: [Type] -> [Type] -> Bool

    ghc-lib-parser GHC.Core.TyCo.Compare

    Type equality on lists of types, looking through type synonyms

  6. eqVarBndrs :: HasCallStack => RnEnv2 -> [Var] -> [Var] -> Maybe RnEnv2

    ghc-lib-parser GHC.Core.TyCo.Compare

    No documentation available.

  7. equivClasses :: (a -> a -> Ordering) -> [a] -> [NonEmpty a]

    ghc-lib-parser GHC.Data.List.SetOps

    No documentation available.

  8. eqPhase :: Phase -> Phase -> Bool

    ghc-lib-parser GHC.Driver.Phases

    No documentation available.

  9. eqEmptyLocalBinds :: HsLocalBindsLR a b -> Bool

    ghc-lib-parser GHC.Hs.Binds

    No documentation available.

  10. eqPmAltCon :: PmAltCon -> PmAltCon -> PmEquality

    ghc-lib-parser GHC.HsToCore.Pmc.Solver.Types

    We can't in general decide whether two PmAltCons match the same set of values. In addition to the reasons in eqPmLit and eqConLike, a PmAltConLike might or might not represent the same value as a PmAltLit. See Note [Undecidable Equality for PmAltCons].

    • Just True ==> Surely equal
    • Just False ==> Surely different (non-overlapping, even!)
    • Nothing ==> Equality relation undecidable
    Examples (omitting some constructor wrapping):
    • eqPmAltCon (LitInt 42) (LitInt 1) == Just False: Lit equality is decidable
    • eqPmAltCon (DataCon A) (DataCon B) == Just False: DataCon equality is decidable
    • eqPmAltCon (LitOverInt 42) (LitOverInt 1) == Nothing: OverLit equality is undecidable
    • eqPmAltCon (PatSyn PA) (PatSyn PB) == Nothing: PatSyn equality is undecidable
    • eqPmAltCon (DataCon I#) (LitInt 1) == Nothing: DataCon to Lit comparisons are undecidable without reasoning about the wrapped Int#
    • eqPmAltCon (LitOverInt 1) (LitOverInt 1) == Just True: We assume reflexivity for overloaded literals
    • eqPmAltCon (PatSyn PA) (PatSyn PA) == Just True: We assume reflexivity for Pattern Synonyms

Page 101 of many | Previous | Next