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. data Pred

   ghc	GHC.Core.Predicate

   A predicate in the solver. The solver tries to prove Wanted predicates from Given ones.

2. module GHC.Core.TyCo.Ppr

   Pretty-printing types and coercions.

3. newtype PprPrec

   ghc	GHC.Core.TyCo.Ppr

   A general-purpose pretty-printing precedence type.

4. PprPrec :: Int -> PprPrec

   ghc	GHC.Core.TyCo.Ppr

   No documentation available.

5. PhantomProv :: KindCoercion -> UnivCoProvenance

   ghc	GHC.Core.TyCo.Rep

   See Note [Phantom coercions]. Only in Phantom roled coercions

6. PluginProv :: String -> UnivCoProvenance

   ghc	GHC.Core.TyCo.Rep

   From a plugin, which asserts that this coercion is sound. The string is for the use of the plugin.

7. type PredType = Type

   ghc	GHC.Core.TyCo.Rep

   A type of the form p of constraint kind represents a value whose type is the Haskell predicate p, where a predicate is what occurs before the => in a Haskell type. We use PredType as documentation to mark those types that we guarantee to have this kind. It can be expanded into its representation, but:

   • The type checker must treat it as opaque
   • The rest of the compiler treats it as transparent
   Consider these examples:

   f :: (Eq a) => a -> Int
   g :: (?x :: Int -> Int) => a -> Int
   h :: (r\l) => {r} => {l::Int | r}
   

   Here the Eq a and ?x :: Int -> Int and rl are all called "predicates"

8. ProofIrrelProv :: KindCoercion -> UnivCoProvenance

   ghc	GHC.Core.TyCo.Rep

   From the fact that any two coercions are considered equivalent. See Note [ProofIrrelProv]. Can be used in Nominal or Representational coercions

9. Phantom :: Role

   ghc	GHC.Core.TyCon

   No documentation available.

10. data PrimElemRep

    ghc	GHC.Core.TyCon

    No documentation available.

Page 116 of many | Previous | Next