Hoogle Search
Within LTS Haskell 24.42 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
data
PIdentity (a :: k -> Type) (b :: Identity k)functor-products Data.Type.Functor.Product A PIdentity is a trivial functor product; it is simply the functor, itself, alone. PIdentity f (Identity a) is simply f a. This may be useful in conjunction with other combinators.
data
PMaybe (a :: k -> Type) (b :: Maybe k)functor-products Data.Type.Functor.Product A PMaybe f 'Nothing contains nothing, and a PMaybe f ('Just a) contains an f a. In practice this can be useful to write polymorphic functions/abstractions that contain an argument that can be "turned off" for different instances.
data
PTup (a :: k -> Type) (b :: (j, k))functor-products Data.Type.Functor.Product A PTup tuples up some singleton with some value; a PTup f '(w, a) contains a Sing w and an f a. This can be useful for carrying along some witness aside a functor value.
data
ProdSym0 (f :: Type -> Type) (a :: TyFun k -> Type f k ~> Type)functor-products Data.Type.Functor.Product No documentation available.
data
ProdSym1 (f :: Type -> Type) (a :: k -> Type) (b :: TyFun f k Type)functor-products Data.Type.Functor.Product No documentation available.
type
ProdSym2 (f :: Type -> Type) (g :: k -> Type) (as :: f k) = Prod f g asfunctor-products Data.Type.Functor.Product No documentation available.
class
PureProd (f :: Type -> Type) (as :: f k)functor-products Data.Type.Functor.Product Create Prod f if you can give a g a for every slot.
class
PureProdC (f :: Type -> Type) (c :: k -> Constraint) (as :: f k)functor-products Data.Type.Functor.Product Create Prod f if you can give a g a for every slot, given some constraint.
data family
Param :: Nat -> j -> kgeneric-lens-core Data.GenericLens.Internal No documentation available.
type
Prism s t a b = forall (p :: Type -> Type -> Type -> Type) i . Choice p => p i a b -> p i s tgeneric-lens-core Data.GenericLens.Internal No documentation available.