Copyright | (C) 2021 Ryan Scott |
---|---|
License | BSD-style (see LICENSE) |
Maintainer | Richard Eisenberg (rae@cs.brynmawr.edu) |
Stability | experimental |
Portability | non-portable |
Safe Haskell | None |
Language | GHC2021 |
Exports the promoted and singled versions of the Sum
data type.
The Product
singleton
type family Sing :: k -> Type #
Instances
data SSum (a1 :: Sum f g a) where Source #
SInL :: forall {k} (f :: k -> Type) (g :: k -> Type) (a :: k) (x :: f a). Sing x -> SSum ('InL x :: Sum f g a) | |
SInR :: forall {k} (f :: k -> Type) (g :: k -> Type) (a :: k) (y :: g a). Sing y -> SSum ('InR y :: Sum f g a) |
Defunctionalization symbols
Orphan instances
SingI1 ('InL :: f a -> Sum f g a) Source # | |
SingI1 ('InR :: g a -> Sum f g a) Source # | |
PFunctor (Sum f g) Source # | |
(SFunctor f, SFunctor g) => SFunctor (Sum f g) Source # | |
sFmap :: forall a b (t1 :: a ~> b) (t2 :: Sum f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (FmapSym0 :: TyFun (a ~> b) (Sum f g a ~> Sum f g b) -> Type) t1) t2) Source # (%<$) :: forall a b (t1 :: a) (t2 :: Sum f g b). Sing t1 -> Sing t2 -> Sing (Apply (Apply ((<$@#@$) :: TyFun a (Sum f g b ~> Sum f g a) -> Type) t1) t2) Source # | |
PFoldable (Sum f g) Source # | |
(SFoldable f, SFoldable g) => SFoldable (Sum f g) Source # | |
sFold :: forall m (t1 :: Sum f g m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (Sum f g m) m -> Type) t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Sum f g a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (Sum f g a ~> m) -> Type) t1) t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Sum f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (Sum f g a ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Sum f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Sum f g a ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Sum f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (Sum f g a ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Sum f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Sum f g a ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Sum f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (Sum f g a ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Sum f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (Sum f g a ~> a) -> Type) t1) t2) Source # sToList :: forall a (t1 :: Sum f g a). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (Sum f g a) [a] -> Type) t1) Source # sNull :: forall a (t1 :: Sum f g a). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (Sum f g a) Bool -> Type) t1) Source # sLength :: forall a (t1 :: Sum f g a). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (Sum f g a) Natural -> Type) t1) Source # sElem :: forall a (t1 :: a) (t2 :: Sum f g a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (Sum f g a ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a (t1 :: Sum f g a). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (Sum f g a) a -> Type) t1) Source # sMinimum :: forall a (t1 :: Sum f g a). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (Sum f g a) a -> Type) t1) Source # sSum :: forall a (t1 :: Sum f g a). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (Sum f g a) a -> Type) t1) Source # sProduct :: forall a (t1 :: Sum f g a). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (Sum f g a) a -> Type) t1) Source # | |
PTraversable (Sum f g) Source # | |
(STraversable f, STraversable g) => STraversable (Sum f g) Source # | |
sTraverse :: forall a (f0 :: Type -> Type) b (t1 :: a ~> f0 b) (t2 :: Sum f g a). SApplicative f0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (Sum f g a ~> f (Sum f g b)) -> Type) t1) t2) Source # sSequenceA :: forall (f0 :: Type -> Type) a (t1 :: Sum f g (f0 a)). SApplicative f0 => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (Sum f g (f a)) (f (Sum f g a)) -> Type) t1) Source # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Sum f g a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (Sum f g a ~> m (Sum f g b)) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a (t1 :: Sum f g (m a)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (Sum f g (m a)) (m (Sum f g a)) -> Type) t1) Source # | |
(SDecide (f a), SDecide (g a)) => SDecide (Sum f g a) Source # | |
PEq (Sum f g a) Source # | |
(SEq (f a), SEq (g a)) => SEq (Sum f g a) Source # | |
(%==) :: forall (t1 :: Sum f g a) (t2 :: Sum f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply ((==@#@$) :: TyFun (Sum f g a) (Sum f g a ~> Bool) -> Type) t1) t2) Source # (%/=) :: forall (t1 :: Sum f g a) (t2 :: Sum f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply ((/=@#@$) :: TyFun (Sum f g a) (Sum f g a ~> Bool) -> Type) t1) t2) Source # | |
POrd (Sum f g a) Source # | |
(SOrd (f a), SOrd (g a)) => SOrd (Sum f g a) Source # | |
sCompare :: forall (t1 :: Sum f g a) (t2 :: Sum f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (CompareSym0 :: TyFun (Sum f g a) (Sum f g a ~> Ordering) -> Type) t1) t2) Source # (%<) :: forall (t1 :: Sum f g a) (t2 :: Sum f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply ((<@#@$) :: TyFun (Sum f g a) (Sum f g a ~> Bool) -> Type) t1) t2) Source # (%<=) :: forall (t1 :: Sum f g a) (t2 :: Sum f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply ((<=@#@$) :: TyFun (Sum f g a) (Sum f g a ~> Bool) -> Type) t1) t2) Source # (%>) :: forall (t1 :: Sum f g a) (t2 :: Sum f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply ((>@#@$) :: TyFun (Sum f g a) (Sum f g a ~> Bool) -> Type) t1) t2) Source # (%>=) :: forall (t1 :: Sum f g a) (t2 :: Sum f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply ((>=@#@$) :: TyFun (Sum f g a) (Sum f g a ~> Bool) -> Type) t1) t2) Source # sMax :: forall (t1 :: Sum f g a) (t2 :: Sum f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (MaxSym0 :: TyFun (Sum f g a) (Sum f g a ~> Sum f g a) -> Type) t1) t2) Source # sMin :: forall (t1 :: Sum f g a) (t2 :: Sum f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (MinSym0 :: TyFun (Sum f g a) (Sum f g a ~> Sum f g a) -> Type) t1) t2) Source # | |
SingI x => SingI ('InL x :: Sum f g a) Source # | |
SingI y => SingI ('InR y :: Sum f g a) Source # | |