singletons-base-3.1: A promoted and singled version of the base library
Copyright(C) 2021 Ryan Scott
LicenseBSD-style (see LICENSE)
MaintainerRichard Eisenberg (rae@cs.brynmawr.edu)
Stabilityexperimental
Portabilitynon-portable
Safe HaskellSafe-Inferred
LanguageHaskell2010

Data.Functor.Sum.Singletons

Description

Exports the promoted and singled versions of the Sum data type.

Synopsis

The Product singleton

type family Sing :: k -> Type #

Instances

Instances details
type Sing Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal

type Sing = SAll
type Sing Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal

type Sing = SAny
type Sing Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Sing = SVoid
type Sing Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Sing = SOrdering
type Sing Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

type Sing = SErrorMessage
type Sing Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type Sing = SNat
type Sing Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Sing = STuple0
type Sing Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Sing = SBool
type Sing Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type Sing = SChar
type Sing Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type Sing = SSymbol
type Sing Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Sing = SIdentity :: Identity a -> Type
type Sing Source # 
Instance details

Defined in Data.Monoid.Singletons

type Sing = SFirst :: First a -> Type
type Sing Source # 
Instance details

Defined in Data.Monoid.Singletons

type Sing = SLast :: Last a -> Type
type Sing Source # 
Instance details

Defined in Data.Ord.Singletons

type Sing = SDown :: Down a -> Type
type Sing Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal

type Sing = SFirst :: First a -> Type
type Sing Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal

type Sing = SLast :: Last a -> Type
type Sing Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal

type Sing = SMax :: Max a -> Type
type Sing Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal

type Sing = SMin :: Min a -> Type
type Sing Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal

type Sing = SWrappedMonoid :: WrappedMonoid m -> Type
type Sing Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal

type Sing = SDual :: Dual a -> Type
type Sing Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal

type Sing = SProduct :: Product a -> Type
type Sing Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal

type Sing = SSum :: Sum a -> Type
type Sing Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Sing = SNonEmpty :: NonEmpty a -> Type
type Sing Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Sing = SMaybe :: Maybe a -> Type
type Sing Source #

A choice of singleton for the kind TYPE rep (for some RuntimeRep rep), an instantiation of which is the famous kind Type.

Conceivably, one could generalize this instance to `Sing @k` for any kind k, and remove all other Sing instances. We don't adopt this design, however, since it is far more convenient in practice to work with explicit singleton values than TypeReps (for instance, TypeReps are more difficult to pattern match on, and require extra runtime checks).

We cannot produce explicit singleton values for everything in TYPE rep, however, since it is an open kind, so we reach for TypeRep in this one particular case.

Instance details

Defined in Data.Singletons.Base.TypeRepTYPE

type Sing = TypeRep :: TYPE rep -> Type
type Sing Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Sing = SList :: [a] -> Type
type Sing Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Sing = SEither :: Either a b -> Type
type Sing Source # 
Instance details

Defined in Data.Proxy.Singletons

type Sing = SProxy :: Proxy t -> Type
type Sing Source # 
Instance details

Defined in Data.Semigroup.Singletons

type Sing = SArg :: Arg a b -> Type
type Sing 
Instance details

Defined in Data.Singletons

type Sing = SWrappedSing :: WrappedSing a -> Type
type Sing 
Instance details

Defined in Data.Singletons

type Sing = SLambda :: (k1 ~> k2) -> Type
type Sing Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Sing = STuple2 :: (a, b) -> Type
type Sing Source # 
Instance details

Defined in Data.Functor.Const.Singletons

type Sing = SConst :: Const a b -> Type
type Sing Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Sing = STuple3 :: (a, b, c) -> Type
type Sing Source # 
Instance details

Defined in Data.Functor.Product.Singletons

type Sing = SProduct :: Product f g a -> Type
type Sing Source # 
Instance details

Defined in Data.Functor.Sum.Singletons

type Sing = SSum :: Sum f g a -> Type
type Sing Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Sing = STuple4 :: (a, b, c, d) -> Type
type Sing Source # 
Instance details

Defined in Data.Functor.Compose.Singletons

type Sing = SCompose :: Compose f g a -> Type
type Sing Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Sing = STuple5 :: (a, b, c, d, e) -> Type
type Sing Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Sing = STuple6 :: (a, b, c, d, e, f) -> Type
type Sing Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Sing = STuple7 :: (a, b, c, d, e, f, g) -> Type

data SSum :: Sum f g a -> Type where Source #

Constructors

SInL :: forall f g a (x :: f a). Sing x -> SSum ('InL @f @g @a x) 
SInR :: forall f g a (y :: g a). Sing y -> SSum ('InR @f @g @a y) 

Defunctionalization symbols

data InLSym0 z Source #

Instances

Instances details
SingI (InLSym0 :: TyFun (f a) (Sum f g a) -> Type) Source # 
Instance details

Defined in Data.Functor.Sum.Singletons

Methods

sing :: Sing InLSym0

type Apply (InLSym0 :: TyFun (f a) (Sum f g a) -> Type) (x :: f a) Source # 
Instance details

Defined in Data.Functor.Sum.Singletons

type Apply (InLSym0 :: TyFun (f a) (Sum f g a) -> Type) (x :: f a) = 'InL x :: Sum f g a

type family InLSym1 x where ... Source #

Equations

InLSym1 x = 'InL x 

data InRSym0 z Source #

Instances

Instances details
SingI (InRSym0 :: TyFun (g a) (Sum f g a) -> Type) Source # 
Instance details

Defined in Data.Functor.Sum.Singletons

Methods

sing :: Sing InRSym0

type Apply (InRSym0 :: TyFun (g a) (Sum f g a) -> Type) (y :: g a) Source # 
Instance details

Defined in Data.Functor.Sum.Singletons

type Apply (InRSym0 :: TyFun (g a) (Sum f g a) -> Type) (y :: g a) = 'InR y :: Sum f g a

type family InRSym1 x where ... Source #

Equations

InRSym1 y = 'InR y 

Orphan instances

SingI1 ('InL :: f a -> Sum f g a) Source # 
Instance details

Methods

liftSing :: forall (x :: k1). Sing x -> Sing ('InL x)

SingI1 ('InR :: g a -> Sum f g a) Source # 
Instance details

Methods

liftSing :: forall (x :: k1). Sing x -> Sing ('InR x)

PFunctor (Sum f g) Source # 
Instance details

Associated Types

type Fmap arg arg :: f b Source #

type arg <$ arg :: f a Source #

(SFunctor f, SFunctor g) => SFunctor (Sum f g) Source # 
Instance details

Methods

sFmap :: forall a b (t :: a ~> b) (t :: Sum f g a). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source #

(%<$) :: forall a b (t :: a) (t :: Sum f g b). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #

PFoldable (Sum f g) Source # 
Instance details

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg :: m Source #

type Foldr arg arg arg :: b Source #

type Foldr' arg arg arg :: b Source #

type Foldl arg arg arg :: b Source #

type Foldl' arg arg arg :: b Source #

type Foldr1 arg arg :: a Source #

type Foldl1 arg arg :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

(SFoldable f, SFoldable g) => SFoldable (Sum f g) Source # 
Instance details

Methods

sFold :: forall m (t :: Sum f g m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source #

sFoldMap :: forall a m (t :: a ~> m) (t :: Sum f g a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source #

sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Sum f g a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source #

sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Sum f g a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source #

sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Sum f g a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source #

sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Sum f g a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source #

sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: Sum f g a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source #

sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: Sum f g a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source #

sToList :: forall a (t :: Sum f g a). Sing t -> Sing (Apply ToListSym0 t) Source #

sNull :: forall a (t :: Sum f g a). Sing t -> Sing (Apply NullSym0 t) Source #

sLength :: forall a (t :: Sum f g a). Sing t -> Sing (Apply LengthSym0 t) Source #

sElem :: forall a (t :: a) (t :: Sum f g a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source #

sMaximum :: forall a (t :: Sum f g a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source #

sMinimum :: forall a (t :: Sum f g a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source #

sSum :: forall a (t :: Sum f g a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source #

sProduct :: forall a (t :: Sum f g a). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source #

PTraversable (Sum f g) Source # 
Instance details

Associated Types

type Traverse arg arg :: f (t b) Source #

type SequenceA arg :: f (t a) Source #

type MapM arg arg :: m (t b) Source #

type Sequence arg :: m (t a) Source #

(STraversable f, STraversable g) => STraversable (Sum f g) Source # 
Instance details

Methods

sTraverse :: forall a (f0 :: Type -> Type) b (t :: a ~> f0 b) (t :: Sum f g a). SApplicative f0 => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source #

sSequenceA :: forall (f0 :: Type -> Type) a (t :: Sum f g (f0 a)). SApplicative f0 => Sing t -> Sing (Apply SequenceASym0 t) Source #

sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: Sum f g a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source #

sSequence :: forall (m :: Type -> Type) a (t :: Sum f g (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #

SingI x => SingI ('InL x :: Sum f g a) Source # 
Instance details

Methods

sing :: Sing ('InL x)

SingI y => SingI ('InR y :: Sum f g a) Source # 
Instance details

Methods

sing :: Sing ('InR y)