Hoogle Search
Within LTS Haskell 24.18 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
eqnMatchResult :: EquationInfo -> MatchResult CoreExprghc GHC.HsToCore.Monad No documentation available.
eqn_pat :: EquationInfo -> LPat GhcTcghc GHC.HsToCore.Monad The first pattern of the equation NB: The location info is used to determine whether the pattern is generated or not. This helps us avoid warnings on patterns that GHC elaborated. NB: We have already applied decideBangHood to this pattern. See Note [decideBangHood] in GHC.HsToCore.Utils
eqn_rest :: EquationInfo -> EquationInfoghc GHC.HsToCore.Monad The rest of the equation after its first pattern
eqPmAltCon :: PmAltCon -> PmAltCon -> PmEqualityghc 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
- 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
eqn_pat :: EquationInfo -> LPat GhcTcghc GHC.HsToCore.Utils The first pattern of the equation NB: The location info is used to determine whether the pattern is generated or not. This helps us avoid warnings on patterns that GHC elaborated. NB: We have already applied decideBangHood to this pattern. See Note [decideBangHood] in GHC.HsToCore.Utils
eqn_rest :: EquationInfo -> EquationInfoghc GHC.HsToCore.Utils The rest of the equation after its first pattern
eqDiff :: (Outputable a, Eq a) => Diff aghc GHC.Iface.Ext.Debug No documentation available.
eqCoercion :: Coercion -> Coercion -> Boolghc GHC.Plugins Syntactic equality of coercions
eqCoercionX :: RnEnv2 -> Coercion -> Coercion -> Boolghc GHC.Plugins Compare two Coercions, with respect to an RnEnv2
eqCanEqLHS :: CanEqLHS -> CanEqLHS -> Boolghc GHC.Tc.Types.Constraint Are two CanEqLHSs equal?