Hoogle Search

Within LTS Haskell 24.55 (ghc-9.10.3)

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

  1. scopedSort :: [TyCoVar] -> [TyCoVar]

    ghc GHC.Plugins

    Do a topological sort on a list of tyvars, so that binders occur before occurrences E.g. given [ a::k, k::*, b::k ] it'll return a well-scoped list [ k::*, a::k, b::k ] This is a deterministic sorting operation (that is, doesn't depend on Uniques). It is also meant to be stable: that is, variables should not be reordered unnecessarily. This is specified in Note [ScopedSort] See also Note [Ordering of implicit variables] in GHC.Rename.HsType

  2. depSortWithAnnotStgPgm :: Module -> [StgTopBinding] -> [(CgStgTopBinding, ImpFVs)]

    ghc GHC.Stg.FVs

    Dependency sort a STG program, and annotate it with free variables The returned bindings: * Are in dependency order * Each StgRhsClosure is correctly annotated (in its extension field) with the free variables needed in the closure * Each StgCase is correctly annotated (in its extension field) with the variables that must be saved across the case

  3. HFSNoSorting :: HoleFitSortingAlg

    ghc GHC.Tc.Errors.Hole

    No documentation available.

  4. data HoleFitSortingAlg

    ghc GHC.Tc.Errors.Hole

    No documentation available.

  5. getHoleFitSortingAlg :: TcM HoleFitSortingAlg

    ghc GHC.Tc.Errors.Hole

    No documentation available.

  6. ClassDeclSort :: DeclSort

    ghc GHC.Tc.Errors.Types

    No documentation available.

  7. DataDeclSort :: NewOrData -> DataSort

    ghc GHC.Tc.Errors.Types

    No documentation available.

  8. DataFamilySort :: DataSort

    ghc GHC.Tc.Errors.Types

    No documentation available.

  9. DataInstanceSort :: NewOrData -> DataSort

    ghc GHC.Tc.Errors.Types

    No documentation available.

  10. data DataSort

    ghc GHC.Tc.Errors.Types

    A description of whether something is a

    At present, this data type is only consumed by checkDataKindSig.

Page 108 of many | Previous | Next