Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

1. PsSpan :: RealSrcSpan -> BufSpan -> PsSpan

   ghc-lib-parser	GHC.Types.SrcLoc

   No documentation available.

2. PlaceCostCentre :: TickishPlacement

   ghc-lib-parser	GHC.Types.Tickish

   In addition to floating through lambdas, cost-centre style tickishs can also be moved from constructors, non-function variables and literals. For example: let x = scc... C (scc... y) (scc... 3) in ... Neither the constructor application, the variable or the literal are likely to have any cost worth mentioning. And even if y names a thunk, the call would not care about the evaluation context. Therefore removing all annotations in the above example is safe.

3. PlaceNonLam :: TickishPlacement

   ghc-lib-parser	GHC.Types.Tickish

   As PlaceRuntime, but we float the tick through all lambdas. This makes sense where there is little difference between annotating the lambda and annotating the lambda's code.

4. PlaceRuntime :: TickishPlacement

   ghc-lib-parser	GHC.Types.Tickish

   Place ticks exactly on run-time expressions. We can still move the tick through pure compile-time constructs such as other ticks, casts or type lambdas. This is the most restrictive placement rule for ticks, as all tickishs have in common that they want to track runtime processes. The only legal placement rule for counting ticks. NB: We generally try to move these as close to the relevant runtime expression as possible. This means they get pushed through tyoe arguments. E.g. we create `(tick f) Bool` instead of `tick (f Bool)`.

5. ProfNote :: CostCentre -> Bool -> Bool -> GenTickish (pass :: TickishPass)

   ghc-lib-parser	GHC.Types.Tickish

   An {-# SCC #-} profiling annotation, either automatically added by the desugarer as a result of -auto-all, or added by the user.

6. module GHC.Types.TyThing.Ppr

   No documentation available.

7. data PiTyBinder

   ghc-lib-parser	GHC.Types.Var

   A PiTyBinder represents an argument to a function. PiTyBinders can be dependent (Named) or nondependent (Anon). They may also be visible or not. See Note [PiTyBinders]

8. type PiTyVarBinder = PiTyBinder

   ghc-lib-parser	GHC.Types.Var

   PiTyVarBinder is like PiTyBinder, but there can only be TyVar in the Named field.

9. data PackageDbLock

   ghc-lib-parser	GHC.Unit.Database

   Represents a lock of a package db.

10. type PackageCompleteMatches = CompleteMatches

    ghc-lib-parser	GHC.Unit.External

    No documentation available.

Page 562 of many | Previous | Next