Hoogle Search
Within LTS Haskell 24.52 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
feqn_tycon :: FamEqn pass rhs -> LIdP passghc-lib-parser GHC.Hs.Decls No documentation available.
ra_equal :: HsRuleAnn -> EpToken "="ghc-lib-parser GHC.Hs.Decls No documentation available.
tfid_eqn :: TyFamInstDecl pass -> TyFamInstEqn passghc-lib-parser GHC.Hs.Decls No documentation available.
-
ghc-lib-parser GHC.Hs.Expr No documentation available.
AnnArithSeq :: EpToken "[" -> Maybe (EpToken ",") -> EpToken ".." -> EpToken "]" -> AnnArithSeqghc-lib-parser GHC.Hs.Expr No documentation available.
HsBndrRequired :: !XBndrRequired pass -> HsBndrVis passghc-lib-parser GHC.Hs.Type No documentation available.
type
HsOuterFamEqnTyVarBndrs = HsOuterTyVarBndrs ()ghc-lib-parser GHC.Hs.Type Used for type-family instance equations, e.g.,
type instance forall a. F [a] = Tree a
The notion of specificity is irrelevant in type family equations, so we use () for the HsOuterTyVarBndrs flag.-
ghc-lib-parser GHC.Hs.Type Prints the explicit forall in a type family equation if one is written. If there is no explicit forall, nothing is printed.
pprEqn :: HsMatchContextRn -> SDoc -> String -> SDocghc-lib-parser GHC.HsToCore.Errors.Ppr No documentation available.
-
ghc-lib-parser GHC.HsToCore.Pmc.Solver.Types Undecidable semantic equality result. See Note [Undecidable Equality for PmAltCons]