Hoogle Search

Within LTS Haskell 24.18 (ghc-9.10.3)

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

  1. class x :<=: y

    tfp Type.Data.Ord

    No documentation available.

  2. class x :==: y

    tfp Type.Data.Ord

    No documentation available.

  3. class x :>: y

    tfp Type.Data.Ord

    No documentation available.

  4. class x :>=: y

    tfp Type.Data.Ord

    No documentation available.

  5. type (ts :: Set Type) :+: (ts' :: Set Type) = Merge ts ts'

    type-set Data.Type.Set

    No documentation available.

  6. type t :- (ts :: Set Type) = Insert t ts

    type-set Data.Type.Set

    No documentation available.

  7. type (f :: Type -> Type) :$: (ts :: Set Type) = 'SetApp f Map f ts

    type-set Data.Type.SetApp

    No documentation available.

  8. data ((f :: k -> Type) :*: (g :: k -> Type)) (p :: k)

    beam-core Database.Beam.Schema.Tables

    Products: encode multiple arguments to constructors

  9. (:*:) :: f p -> g p -> (:*:) (f :: k -> Type) (g :: k -> Type) (p :: k)

    beam-core Database.Beam.Schema.Tables

    No documentation available.

  10. class (e :: Effect) :> (es :: [Effect])

    effectful-core Effectful

    A constraint that requires that a particular effect e is a member of the type-level list es. This is used to parameterize an Eff computation over an arbitrary list of effects, so long as e is somewhere in the list. For example, a computation that only needs access to a mutable value of type Integer would have the following type: 

    State Integer :> es => Eff es ()

Page 29 of many | Previous | Next