singletons-2.7: A framework for generating singleton types
Copyright(C) 2018 Ryan Scott
LicenseBSD-style (see LICENSE)
MaintainerRyan Scott
Stabilityexperimental
Portabilitynon-portable
Safe HaskellNone
LanguageHaskell2010

Data.Singletons.Prelude.Traversable

Description

Defines the promoted and singled versions of the Traversable type class.

Synopsis

Documentation

class PTraversable t Source #

Associated Types

type Traverse (arg :: (~>) a (f b)) (arg :: t a) :: f (t b) Source #

type Traverse a a = Apply (Apply Traverse_6989586621680816757Sym0 a) a

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

type SequenceA a = Apply SequenceA_6989586621680816769Sym0 a

type MapM (arg :: (~>) a (m b)) (arg :: t a) :: m (t b) Source #

type MapM a a = Apply (Apply MapM_6989586621680816779Sym0 a) a

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

type Sequence a = Apply Sequence_6989586621680816793Sym0 a

Instances

Instances details
PTraversable [] Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 #

PTraversable Maybe Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 #

PTraversable Min Source # 
Instance details

Defined in Data.Singletons.Prelude.Semigroup

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 #

PTraversable Max Source # 
Instance details

Defined in Data.Singletons.Prelude.Semigroup

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 #

PTraversable First Source # 
Instance details

Defined in Data.Singletons.Prelude.Semigroup

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 #

PTraversable Last Source # 
Instance details

Defined in Data.Singletons.Prelude.Semigroup

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 #

PTraversable Option Source # 
Instance details

Defined in Data.Singletons.Prelude.Semigroup

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 #

PTraversable Identity Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 #

PTraversable First Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 #

PTraversable Last Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 #

PTraversable Dual Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 #

PTraversable Sum Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 #

PTraversable Product Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 #

PTraversable NonEmpty Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 #

PTraversable (Either a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 #

PTraversable ((,) a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 #

PTraversable (Arg a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Semigroup

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 #

PTraversable (Proxy :: Type -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 #

PTraversable (Const m :: Type -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 #

class (SFunctor t, SFoldable t) => STraversable t where Source #

Minimal complete definition

Nothing

Methods

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

default sTraverse :: forall a f b (t :: (~>) a (f b)) (t :: t a). ((Apply (Apply TraverseSym0 t) t :: f (t b)) ~ Apply (Apply Traverse_6989586621680816757Sym0 t) t, SApplicative f) => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t :: f (t b)) Source #

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

default sSequenceA :: forall f a (t :: t (f a)). ((Apply SequenceASym0 t :: f (t a)) ~ Apply SequenceA_6989586621680816769Sym0 t, SApplicative f) => Sing t -> Sing (Apply SequenceASym0 t :: f (t a)) Source #

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

default sMapM :: forall a m b (t :: (~>) a (m b)) (t :: t a). ((Apply (Apply MapMSym0 t) t :: m (t b)) ~ Apply (Apply MapM_6989586621680816779Sym0 t) t, SMonad m) => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t :: m (t b)) Source #

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

default sSequence :: forall m a (t :: t (m a)). ((Apply SequenceSym0 t :: m (t a)) ~ Apply Sequence_6989586621680816793Sym0 t, SMonad m) => Sing t -> Sing (Apply SequenceSym0 t :: m (t a)) Source #

Instances

Instances details
STraversable [] Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

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

sSequenceA :: forall (f :: Type -> Type) a (t :: [f a]). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source #

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

sSequence :: forall (m :: Type -> Type) a (t :: [m a]). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #

STraversable Maybe Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

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

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

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

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

STraversable Min Source # 
Instance details

Defined in Data.Singletons.Prelude.Semigroup

Methods

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

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

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

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

STraversable Max Source # 
Instance details

Defined in Data.Singletons.Prelude.Semigroup

Methods

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

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

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

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

STraversable First Source # 
Instance details

Defined in Data.Singletons.Prelude.Semigroup

Methods

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

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

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

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

STraversable Last Source # 
Instance details

Defined in Data.Singletons.Prelude.Semigroup

Methods

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

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

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

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

STraversable Option Source # 
Instance details

Defined in Data.Singletons.Prelude.Semigroup

Methods

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

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

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

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

STraversable Identity Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

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

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

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

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

STraversable First Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

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

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

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

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

STraversable Last Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

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

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

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

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

STraversable Dual Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

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

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

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

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

STraversable Sum Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

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

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

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

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

STraversable Product Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

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

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

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

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

STraversable NonEmpty Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

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

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

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

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

STraversable (Either a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

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

sSequenceA :: forall (f :: Type -> Type) a0 (t :: Either a (f a0)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source #

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

sSequence :: forall (m :: Type -> Type) a0 (t :: Either a (m a0)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #

STraversable ((,) a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

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

sSequenceA :: forall (f :: Type -> Type) a0 (t :: (a, f a0)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source #

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

sSequence :: forall (m :: Type -> Type) a0 (t :: (a, m a0)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #

STraversable (Arg a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Semigroup

Methods

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

sSequenceA :: forall (f :: Type -> Type) a0 (t :: Arg a (f a0)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source #

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

sSequence :: forall (m :: Type -> Type) a0 (t :: Arg a (m a0)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #

STraversable (Proxy :: Type -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

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

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

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

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

STraversable (Const m :: Type -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

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

sSequenceA :: forall (f :: Type -> Type) a (t :: Const m (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source #

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

sSequence :: forall (m0 :: Type -> Type) a (t :: Const m (m0 a)). SMonad m0 => Sing t -> Sing (Apply SequenceSym0 t) Source #

type family For a a where ... Source #

Equations

For a_6989586621680823023 a_6989586621680823025 = Apply (Apply (Apply FlipSym0 TraverseSym0) a_6989586621680823023) a_6989586621680823025 

sFor :: forall t a f b (t :: t a) (t :: (~>) a (f b)). (STraversable t, SApplicative f) => Sing t -> Sing t -> Sing (Apply (Apply ForSym0 t) t :: f (t b)) Source #

type family ForM a a where ... Source #

Equations

ForM a_6989586621680823012 a_6989586621680823014 = Apply (Apply (Apply FlipSym0 MapMSym0) a_6989586621680823012) a_6989586621680823014 

sForM :: forall t a m b (t :: t a) (t :: (~>) a (m b)). (STraversable t, SMonad m) => Sing t -> Sing t -> Sing (Apply (Apply ForMSym0 t) t :: m (t b)) Source #

type family MapAccumL a a a where ... Source #

Equations

MapAccumL f s t = Apply (Apply RunStateLSym0 (Apply (Apply TraverseSym0 (Apply (Apply (.@#@$) StateLSym0) (Apply FlipSym0 f))) t)) s 

sMapAccumL :: forall t a b c (t :: (~>) a ((~>) b (a, c))) (t :: a) (t :: t b). STraversable t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply MapAccumLSym0 t) t) t :: (a, t c)) Source #

type family MapAccumR a a a where ... Source #

Equations

MapAccumR f s t = Apply (Apply RunStateRSym0 (Apply (Apply TraverseSym0 (Apply (Apply (.@#@$) StateRSym0) (Apply FlipSym0 f))) t)) s 

sMapAccumR :: forall a b c t (t :: (~>) a ((~>) b (a, c))) (t :: a) (t :: t b). STraversable t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply MapAccumRSym0 t) t) t :: (a, t c)) Source #

type family FmapDefault a a where ... Source #

Equations

FmapDefault f x = Case_6989586621680822988 f x (Let6989586621680822986Scrutinee_6989586621680822577Sym2 f x) 

sFmapDefault :: forall t a b (t :: (~>) a b) (t :: t a). STraversable t => Sing t -> Sing t -> Sing (Apply (Apply FmapDefaultSym0 t) t :: t b) Source #

type family FoldMapDefault a a where ... Source #

Equations

FoldMapDefault f x = Case_6989586621680822975 f x (Let6989586621680822973Scrutinee_6989586621680822580Sym2 f x) 

sFoldMapDefault :: forall t m a (t :: (~>) a m) (t :: t a). (STraversable t, SMonoid m) => Sing t -> Sing t -> Sing (Apply (Apply FoldMapDefaultSym0 t) t :: m) Source #

Defunctionalization symbols

data TraverseSym0 a6989586621680816742 Source #

Instances

Instances details
(STraversable t, SApplicative f) => SingI (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

SuppressUnusedWarnings (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) (a6989586621680816742 :: a ~> f b) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) (a6989586621680816742 :: a ~> f b) = TraverseSym1 a6989586621680816742 :: TyFun (t a) (f (t b)) -> Type

data TraverseSym1 a6989586621680816742 a6989586621680816743 Source #

Instances

Instances details
(STraversable t, SApplicative f, SingI d) => SingI (TraverseSym1 d :: TyFun (t a) (f (t b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

sing :: Sing (TraverseSym1 d) Source #

SuppressUnusedWarnings (TraverseSym1 a6989586621680816742 :: TyFun (t a) (f (t b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (TraverseSym1 a6989586621680816742 :: TyFun (t a) (f (t b)) -> Type) (a6989586621680816743 :: t a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (TraverseSym1 a6989586621680816742 :: TyFun (t a) (f (t b)) -> Type) (a6989586621680816743 :: t a) = TraverseSym2 a6989586621680816742 a6989586621680816743

type TraverseSym2 (a6989586621680816742 :: (~>) a (f b)) (a6989586621680816743 :: t a) = Traverse a6989586621680816742 a6989586621680816743 :: f (t b) Source #

data SequenceASym0 a6989586621680816746 Source #

Instances

Instances details
(STraversable t, SApplicative f) => SingI (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

SuppressUnusedWarnings (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) (a6989586621680816746 :: t (f a)) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) (a6989586621680816746 :: t (f a)) = SequenceASym1 a6989586621680816746

type SequenceASym1 (a6989586621680816746 :: t (f a)) = SequenceA a6989586621680816746 :: f (t a) Source #

data MapMSym0 a6989586621680816750 Source #

Instances

Instances details
(STraversable t, SMonad m) => SingI (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

SuppressUnusedWarnings (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) (a6989586621680816750 :: a ~> m b) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) (a6989586621680816750 :: a ~> m b) = MapMSym1 a6989586621680816750 :: TyFun (t a) (m (t b)) -> Type

data MapMSym1 a6989586621680816750 a6989586621680816751 Source #

Instances

Instances details
(STraversable t, SMonad m, SingI d) => SingI (MapMSym1 d :: TyFun (t a) (m (t b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

sing :: Sing (MapMSym1 d) Source #

SuppressUnusedWarnings (MapMSym1 a6989586621680816750 :: TyFun (t a) (m (t b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapMSym1 a6989586621680816750 :: TyFun (t a) (m (t b)) -> Type) (a6989586621680816751 :: t a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapMSym1 a6989586621680816750 :: TyFun (t a) (m (t b)) -> Type) (a6989586621680816751 :: t a) = MapMSym2 a6989586621680816750 a6989586621680816751

type MapMSym2 (a6989586621680816750 :: (~>) a (m b)) (a6989586621680816751 :: t a) = MapM a6989586621680816750 a6989586621680816751 :: m (t b) Source #

data SequenceSym0 a6989586621680816754 Source #

Instances

Instances details
(STraversable t, SMonad m) => SingI (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

SuppressUnusedWarnings (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) (a6989586621680816754 :: t (m a)) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) (a6989586621680816754 :: t (m a)) = SequenceSym1 a6989586621680816754

type SequenceSym1 (a6989586621680816754 :: t (m a)) = Sequence a6989586621680816754 :: m (t a) Source #

data ForSym0 a6989586621680823030 Source #

Instances

Instances details
(STraversable t, SApplicative f) => SingI (ForSym0 :: TyFun (t a) ((a ~> f b) ~> f (t b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

SuppressUnusedWarnings (ForSym0 :: TyFun (t a) ((a ~> f b) ~> f (t b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForSym0 :: TyFun (t a) ((a ~> f b) ~> f (t b)) -> Type) (a6989586621680823030 :: t a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForSym0 :: TyFun (t a) ((a ~> f b) ~> f (t b)) -> Type) (a6989586621680823030 :: t a) = ForSym1 a6989586621680823030 :: TyFun (a ~> f b) (f (t b)) -> Type

data ForSym1 a6989586621680823030 a6989586621680823031 Source #

Instances

Instances details
(STraversable t, SApplicative f, SingI d) => SingI (ForSym1 d :: TyFun (a ~> f b) (f (t b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

sing :: Sing (ForSym1 d) Source #

SuppressUnusedWarnings (ForSym1 a6989586621680823030 :: TyFun (a ~> f b) (f (t b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForSym1 a6989586621680823030 :: TyFun (a ~> f b) (f (t b)) -> Type) (a6989586621680823031 :: a ~> f b) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForSym1 a6989586621680823030 :: TyFun (a ~> f b) (f (t b)) -> Type) (a6989586621680823031 :: a ~> f b) = ForSym2 a6989586621680823030 a6989586621680823031

type ForSym2 (a6989586621680823030 :: t a) (a6989586621680823031 :: (~>) a (f b)) = For a6989586621680823030 a6989586621680823031 :: f (t b) Source #

data ForMSym0 a6989586621680823019 Source #

Instances

Instances details
(STraversable t, SMonad m) => SingI (ForMSym0 :: TyFun (t a) ((a ~> m b) ~> m (t b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

SuppressUnusedWarnings (ForMSym0 :: TyFun (t a) ((a ~> m b) ~> m (t b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForMSym0 :: TyFun (t a) ((a ~> m b) ~> m (t b)) -> Type) (a6989586621680823019 :: t a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForMSym0 :: TyFun (t a) ((a ~> m b) ~> m (t b)) -> Type) (a6989586621680823019 :: t a) = ForMSym1 a6989586621680823019 :: TyFun (a ~> m b) (m (t b)) -> Type

data ForMSym1 a6989586621680823019 a6989586621680823020 Source #

Instances

Instances details
(STraversable t, SMonad m, SingI d) => SingI (ForMSym1 d :: TyFun (a ~> m b) (m (t b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

sing :: Sing (ForMSym1 d) Source #

SuppressUnusedWarnings (ForMSym1 a6989586621680823019 :: TyFun (a ~> m b) (m (t b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForMSym1 a6989586621680823019 :: TyFun (a ~> m b) (m (t b)) -> Type) (a6989586621680823020 :: a ~> m b) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForMSym1 a6989586621680823019 :: TyFun (a ~> m b) (m (t b)) -> Type) (a6989586621680823020 :: a ~> m b) = ForMSym2 a6989586621680823019 a6989586621680823020

type ForMSym2 (a6989586621680823019 :: t a) (a6989586621680823020 :: (~>) a (m b)) = ForM a6989586621680823019 a6989586621680823020 :: m (t b) Source #

data MapAccumLSym0 a6989586621680823006 Source #

Instances

Instances details
STraversable t => SingI (MapAccumLSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

SuppressUnusedWarnings (MapAccumLSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) (a6989586621680823006 :: a ~> (b ~> (a, c))) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) (a6989586621680823006 :: a ~> (b ~> (a, c))) = MapAccumLSym1 a6989586621680823006 :: TyFun a (t b ~> (a, t c)) -> Type

data MapAccumLSym1 a6989586621680823006 a6989586621680823007 Source #

Instances

Instances details
(STraversable t, SingI d) => SingI (MapAccumLSym1 d :: TyFun a (t b ~> (a, t c)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

SuppressUnusedWarnings (MapAccumLSym1 a6989586621680823006 :: TyFun a (t b ~> (a, t c)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym1 a6989586621680823006 :: TyFun a (t b ~> (a, t c)) -> Type) (a6989586621680823007 :: a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym1 a6989586621680823006 :: TyFun a (t b ~> (a, t c)) -> Type) (a6989586621680823007 :: a) = MapAccumLSym2 a6989586621680823006 a6989586621680823007 :: TyFun (t b) (a, t c) -> Type

data MapAccumLSym2 a6989586621680823006 a6989586621680823007 a6989586621680823008 Source #

Instances

Instances details
(STraversable t, SingI d1, SingI d2) => SingI (MapAccumLSym2 d1 d2 :: TyFun (t b) (a, t c) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

sing :: Sing (MapAccumLSym2 d1 d2) Source #

SuppressUnusedWarnings (MapAccumLSym2 a6989586621680823006 a6989586621680823007 :: TyFun (t b) (a, t c) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym2 a6989586621680823006 a6989586621680823007 :: TyFun (t b) (a, t c) -> Type) (a6989586621680823008 :: t b) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym2 a6989586621680823006 a6989586621680823007 :: TyFun (t b) (a, t c) -> Type) (a6989586621680823008 :: t b) = MapAccumLSym3 a6989586621680823006 a6989586621680823007 a6989586621680823008

type MapAccumLSym3 (a6989586621680823006 :: (~>) a ((~>) b (a, c))) (a6989586621680823007 :: a) (a6989586621680823008 :: t b) = MapAccumL a6989586621680823006 a6989586621680823007 a6989586621680823008 :: (a, t c) Source #

data MapAccumRSym0 a6989586621680822996 Source #

Instances

Instances details
STraversable t => SingI (MapAccumRSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

SuppressUnusedWarnings (MapAccumRSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) (a6989586621680822996 :: a ~> (b ~> (a, c))) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) (a6989586621680822996 :: a ~> (b ~> (a, c))) = MapAccumRSym1 a6989586621680822996 :: TyFun a (t b ~> (a, t c)) -> Type

data MapAccumRSym1 a6989586621680822996 a6989586621680822997 Source #

Instances

Instances details
(STraversable t, SingI d) => SingI (MapAccumRSym1 d :: TyFun a (t b ~> (a, t c)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

SuppressUnusedWarnings (MapAccumRSym1 a6989586621680822996 :: TyFun a (t b ~> (a, t c)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym1 a6989586621680822996 :: TyFun a (t b ~> (a, t c)) -> Type) (a6989586621680822997 :: a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym1 a6989586621680822996 :: TyFun a (t b ~> (a, t c)) -> Type) (a6989586621680822997 :: a) = MapAccumRSym2 a6989586621680822996 a6989586621680822997 :: TyFun (t b) (a, t c) -> Type

data MapAccumRSym2 a6989586621680822996 a6989586621680822997 a6989586621680822998 Source #

Instances

Instances details
(STraversable t, SingI d1, SingI d2) => SingI (MapAccumRSym2 d1 d2 :: TyFun (t b) (a, t c) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

sing :: Sing (MapAccumRSym2 d1 d2) Source #

SuppressUnusedWarnings (MapAccumRSym2 a6989586621680822996 a6989586621680822997 :: TyFun (t b) (a, t c) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym2 a6989586621680822996 a6989586621680822997 :: TyFun (t b) (a, t c) -> Type) (a6989586621680822998 :: t b) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym2 a6989586621680822996 a6989586621680822997 :: TyFun (t b) (a, t c) -> Type) (a6989586621680822998 :: t b) = MapAccumRSym3 a6989586621680822996 a6989586621680822997 a6989586621680822998

type MapAccumRSym3 (a6989586621680822996 :: (~>) a ((~>) b (a, c))) (a6989586621680822997 :: a) (a6989586621680822998 :: t b) = MapAccumR a6989586621680822996 a6989586621680822997 a6989586621680822998 :: (a, t c) Source #

data FmapDefaultSym0 a6989586621680822982 Source #

Instances

Instances details
STraversable t => SingI (FmapDefaultSym0 :: TyFun (a ~> b) (t a ~> t b) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

SuppressUnusedWarnings (FmapDefaultSym0 :: TyFun (a ~> b) (t a ~> t b) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FmapDefaultSym0 :: TyFun (a ~> b) (t a ~> t b) -> Type) (a6989586621680822982 :: a ~> b) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FmapDefaultSym0 :: TyFun (a ~> b) (t a ~> t b) -> Type) (a6989586621680822982 :: a ~> b) = FmapDefaultSym1 a6989586621680822982 :: TyFun (t a) (t b) -> Type

data FmapDefaultSym1 a6989586621680822982 a6989586621680822983 Source #

Instances

Instances details
(STraversable t, SingI d) => SingI (FmapDefaultSym1 d :: TyFun (t a) (t b) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

SuppressUnusedWarnings (FmapDefaultSym1 a6989586621680822982 :: TyFun (t a) (t b) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FmapDefaultSym1 a6989586621680822982 :: TyFun (t a) (t b) -> Type) (a6989586621680822983 :: t a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FmapDefaultSym1 a6989586621680822982 :: TyFun (t a) (t b) -> Type) (a6989586621680822983 :: t a) = FmapDefaultSym2 a6989586621680822982 a6989586621680822983

type FmapDefaultSym2 (a6989586621680822982 :: (~>) a b) (a6989586621680822983 :: t a) = FmapDefault a6989586621680822982 a6989586621680822983 :: t b Source #

data FoldMapDefaultSym0 a6989586621680822963 Source #

Instances

Instances details
(STraversable t, SMonoid m) => SingI (FoldMapDefaultSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

SuppressUnusedWarnings (FoldMapDefaultSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FoldMapDefaultSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) (a6989586621680822963 :: a ~> m) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FoldMapDefaultSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) (a6989586621680822963 :: a ~> m) = FoldMapDefaultSym1 a6989586621680822963 :: TyFun (t a) m -> Type

data FoldMapDefaultSym1 a6989586621680822963 a6989586621680822964 Source #

Instances

Instances details
(STraversable t, SMonoid m, SingI d) => SingI (FoldMapDefaultSym1 d :: TyFun (t a) m -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

SuppressUnusedWarnings (FoldMapDefaultSym1 a6989586621680822963 :: TyFun (t a) m -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FoldMapDefaultSym1 a6989586621680822963 :: TyFun (t a) m -> Type) (a6989586621680822964 :: t a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FoldMapDefaultSym1 a6989586621680822963 :: TyFun (t a) m -> Type) (a6989586621680822964 :: t a) = FoldMapDefaultSym2 a6989586621680822963 a6989586621680822964

type FoldMapDefaultSym2 (a6989586621680822963 :: (~>) a m) (a6989586621680822964 :: t a) = FoldMapDefault a6989586621680822963 a6989586621680822964 :: m Source #