Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

  1. type a :\/: b = Either a b

    equational-reasoning Proof.Equational

    No documentation available.

  2. data (a :: k) :~: (b :: k)

    equational-reasoning Proof.Equational

    Propositional equality. If a :~: b is inhabited by some terminating value, then the type a is the same as the type b. To use this equality in practice, pattern-match on the a :~: b to get out the Refl constructor; in the body of the pattern-match, the compiler knows that a ~ b.

  3. data a :& b

    esqueleto Database.Esqueleto.Experimental

    A left-precedence pair. Pronounced "and". Used to represent expressions that have been joined together. The precedence behavior can be demonstrated by:

    a :& b :& c == ((a :& b) :& c)
    
    See the examples at the beginning of this module to see how this operator is used in JOIN operations.

  4. (:&) :: a -> b -> (:&) a b

    esqueleto Database.Esqueleto.Experimental

    No documentation available.

  5. data a :& b

    esqueleto Database.Esqueleto.Experimental.From.Join

    A left-precedence pair. Pronounced "and". Used to represent expressions that have been joined together. The precedence behavior can be demonstrated by:

    a :& b :& c == ((a :& b) :& c)
    
    See the examples at the beginning of this module to see how this operator is used in JOIN operations.

  6. (:&) :: a -> b -> (:&) a b

    esqueleto Database.Esqueleto.Experimental.From.Join

    No documentation available.

  7. data a :& b

    esqueleto Database.Esqueleto.Internal.Internal

    A left-precedence pair. Pronounced "and". Used to represent expressions that have been joined together. The precedence behavior can be demonstrated by:

    a :& b :& c == ((a :& b) :& c)
    
    See the examples at the beginning of this module to see how this operator is used in JOIN operations.

  8. (:&) :: a -> b -> (:&) a b

    esqueleto Database.Esqueleto.Internal.Internal

    No documentation available.

  9. type (p :: k -> k1 -> Type) :-> (q :: k -> k1 -> Type) = forall (a :: k) (b :: k1) . () => p a b -> q a b

    essence-of-live-coding LiveCoding

    (:->) has a polymorphic kind since 5.6.

  10. pattern (:*) :: HasDebugCallStack => Card -> SubDemand -> Demand

    ghc-lib-parser GHC.Types.Demand

    c :* sd is a demand that says "evaluated c times, and any trace in which it is evaluated will evaluate at least as deep as sd". Matching on this pattern synonym is a complete match. If the matched demand was AbsDmd, it will match as C_00 :* seqSubDmd. If the matched demand was BotDmd, it will match as C_10 :* botSubDmd. The builder of this pattern synonym simply discards the SubDemand if the Card was absent and returns AbsDmd or BotDmd instead. It will assert that the discarded sub-demand was seqSubDmd and botSubDmd, respectively. Call sites should consider whether they really want to look at the SubDemand of an absent demand and match on AbsDmd and/or BotDmd otherwise. Really, any other SubDemand would be allowed and might work better, depending on context.

Page 24 of many | Previous | Next