Hoogle Search
Within LTS Haskell 24.41 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
topReduceTyFamApp_maybe :: FamInstEnvs -> TyCon -> [Type] -> Maybe HetReductionghc GHC.Core.FamInstEnv Try to simplify a type-family application, by *one* step If topReduceTyFamApp_maybe env r F tys = Just (HetReduction (Reduction co rhs) res_co) then co :: F tys ~R# rhs res_co :: typeKind(F tys) ~ typeKind(rhs) Type families and data families; always Representational role
-
ghc GHC.Core.Map.Expr CoreMap a is a map from CoreExpr to a. If you are a client, this is the type you want.
class Functor m =>
TrieMap (m :: Type -> Type)ghc GHC.Core.Map.Expr No documentation available.
-
ghc GHC.Core.Map.Expr No documentation available.
extendCoreMap :: CoreMap a -> CoreExpr -> a -> CoreMap aghc GHC.Core.Map.Expr No documentation available.
foldCoreMap :: (a -> b -> b) -> b -> CoreMap a -> bghc GHC.Core.Map.Expr No documentation available.
lookupCoreMap :: CoreMap a -> CoreExpr -> Maybe aghc GHC.Core.Map.Expr No documentation available.
-
ghc GHC.Core.Map.Type A BndrMap is a TypeMapG which allows us to distinguish between binding forms whose binders have different types. For example, if we are doing a TrieMap lookup on (x :: Int) -> (), we should not pick up an entry in the TrieMap for (x :: Bool) -> (): we can disambiguate this by matching on the type (or kind, if this a binder in a type) of the binder. We also need to do the same for multiplicity! Which, since multiplicities are encoded simply as a Type, amounts to have a Trie for a pair of types. Tries of pairs are composition.
type
CoercionMapG = GenMap CoercionMapXghc GHC.Core.Map.Type No documentation available.
-
ghc GHC.Core.Map.Type A LooseTypeMap doesn't do a kind-check. Thus, when lookup up (t |> g), you'll find entries inserted under (t), even if (g) is non-reflexive.