Control.Applicative.Singletons

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

Documentation

class PApplicative f

Associated Types

type Pure (arg :: a) :: f a

type (arg :: f ((~>) a b)) <*> (arg :: f a) :: f b infixl 4

type a <*> a = Apply (Apply TFHelper_6989586621679329161Sym0 a) a

type LiftA2 (arg :: (~>) a ((~>) b c)) (arg :: f a) (arg :: f b) :: f c

type LiftA2 a a a = Apply (Apply (Apply LiftA2_6989586621679329177Sym0 a) a) a

type (arg :: f a) *> (arg :: f b) :: f b infixl 4

type a *> a = Apply (Apply TFHelper_6989586621679329193Sym0 a) a

type (arg :: f a) <* (arg :: f b) :: f a infixl 4

type a <* a = Apply (Apply TFHelper_6989586621679329204Sym0 a) a

Instances

PApplicative Identity

Defined in Data.Functor.Identity.Singletons

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

PApplicative First

Defined in Data.Monoid.Singletons

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

PApplicative Last

Defined in Data.Monoid.Singletons

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

PApplicative Down

Defined in Control.Applicative.Singletons

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

PApplicative First

Defined in Data.Semigroup.Singletons

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

PApplicative Last

Defined in Data.Semigroup.Singletons

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

PApplicative Max

Defined in Data.Semigroup.Singletons

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

PApplicative Min

Defined in Data.Semigroup.Singletons

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

PApplicative Dual

Defined in Data.Semigroup.Singletons.Internal

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

PApplicative Product

Defined in Data.Semigroup.Singletons.Internal

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

PApplicative Sum

Defined in Data.Semigroup.Singletons.Internal

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

PApplicative NonEmpty

Defined in Control.Monad.Singletons.Internal

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

PApplicative Maybe

Defined in Control.Monad.Singletons.Internal

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

PApplicative []

Defined in Control.Monad.Singletons.Internal

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

PApplicative (Either e)

Defined in Control.Monad.Singletons.Internal

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

PApplicative (Proxy :: Type -> Type)

Defined in Data.Proxy.Singletons

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

PApplicative ((,) a)

Defined in Control.Applicative.Singletons

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

PApplicative (Const m :: Type -> Type)

Defined in Data.Functor.Const.Singletons

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

PApplicative (Product f g)

Defined in Data.Functor.Product.Singletons

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

PApplicative (Compose f g)

Defined in Data.Functor.Compose.Singletons

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

class SFunctor f => SApplicative f where

Minimal complete definition

sPure

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t :: f a)

(%<*>) :: forall a b (t :: f ((~>) a b)) (t :: f a). Sing t -> Sing t -> Sing (Apply (Apply (<*>@#@$) t) t :: f b) infixl 4

default (%<*>) :: forall a b (t :: f ((~>) a b)) (t :: f a). (Apply (Apply (<*>@#@$) t) t :: f b) ~ Apply (Apply TFHelper_6989586621679329161Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply (<*>@#@$) t) t :: f b)

sLiftA2 :: forall a b c (t :: (~>) a ((~>) b c)) (t :: f a) (t :: f b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t :: f c)

default sLiftA2 :: forall a b c (t :: (~>) a ((~>) b c)) (t :: f a) (t :: f b). (Apply (Apply (Apply LiftA2Sym0 t) t) t :: f c) ~ Apply (Apply (Apply LiftA2_6989586621679329177Sym0 t) t) t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t :: f c)

(%*>) :: forall a b (t :: f a) (t :: f b). Sing t -> Sing t -> Sing (Apply (Apply (*>@#@$) t) t :: f b) infixl 4

default (%*>) :: forall a b (t :: f a) (t :: f b). (Apply (Apply (*>@#@$) t) t :: f b) ~ Apply (Apply TFHelper_6989586621679329193Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply (*>@#@$) t) t :: f b)

(%<*) :: forall a b (t :: f a) (t :: f b). Sing t -> Sing t -> Sing (Apply (Apply (<*@#@$) t) t :: f a) infixl 4

default (%<*) :: forall a b (t :: f a) (t :: f b). (Apply (Apply (<*@#@$) t) t :: f a) ~ Apply (Apply TFHelper_6989586621679329204Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply (<*@#@$) t) t :: f a)

Instances

SApplicative Identity

Defined in Data.Functor.Identity.Singletons

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: Identity (a ~> b)) (t2 :: Identity a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Identity a) (t3 :: Identity b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: Identity a) (t2 :: Identity b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: Identity a) (t2 :: Identity b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

SApplicative First

Defined in Data.Monoid.Singletons

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: First (a ~> b)) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: First a) (t3 :: First b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: First a) (t2 :: First b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: First a) (t2 :: First b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

SApplicative Last

Defined in Data.Monoid.Singletons

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: Last (a ~> b)) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Last a) (t3 :: Last b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: Last a) (t2 :: Last b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: Last a) (t2 :: Last b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

SApplicative Down

Defined in Control.Applicative.Singletons

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: Down (a ~> b)) (t2 :: Down a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Down a) (t3 :: Down b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: Down a) (t2 :: Down b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: Down a) (t2 :: Down b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

SApplicative First

Defined in Data.Semigroup.Singletons

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: First (a ~> b)) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: First a) (t3 :: First b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: First a) (t2 :: First b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: First a) (t2 :: First b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

SApplicative Last

Defined in Data.Semigroup.Singletons

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: Last (a ~> b)) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Last a) (t3 :: Last b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: Last a) (t2 :: Last b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: Last a) (t2 :: Last b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

SApplicative Max

Defined in Data.Semigroup.Singletons

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: Max (a ~> b)) (t2 :: Max a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Max a) (t3 :: Max b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: Max a) (t2 :: Max b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: Max a) (t2 :: Max b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

SApplicative Min

Defined in Data.Semigroup.Singletons

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: Min (a ~> b)) (t2 :: Min a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Min a) (t3 :: Min b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: Min a) (t2 :: Min b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: Min a) (t2 :: Min b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

SApplicative Dual

Defined in Data.Semigroup.Singletons.Internal

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: Dual (a ~> b)) (t2 :: Dual a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Dual a) (t3 :: Dual b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: Dual a) (t2 :: Dual b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: Dual a) (t2 :: Dual b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

SApplicative Product

Defined in Data.Semigroup.Singletons.Internal

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: Product (a ~> b)) (t2 :: Product a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Product a) (t3 :: Product b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: Product a) (t2 :: Product b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: Product a) (t2 :: Product b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

SApplicative Sum

Defined in Data.Semigroup.Singletons.Internal

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: Sum (a ~> b)) (t2 :: Sum a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Sum a) (t3 :: Sum b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: Sum a) (t2 :: Sum b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: Sum a) (t2 :: Sum b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

SApplicative NonEmpty

Defined in Control.Monad.Singletons.Internal

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: NonEmpty (a ~> b)) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: NonEmpty a) (t3 :: NonEmpty b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: NonEmpty a) (t2 :: NonEmpty b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: NonEmpty a) (t2 :: NonEmpty b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

SApplicative Maybe

Defined in Control.Monad.Singletons.Internal

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: Maybe (a ~> b)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Maybe a) (t3 :: Maybe b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: Maybe a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: Maybe a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

SApplicative []

Defined in Control.Monad.Singletons.Internal

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: [a ~> b]) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: [a]) (t3 :: [b]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: [a]) (t2 :: [b]). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: [a]) (t2 :: [b]). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

SApplicative (Either e)

Defined in Control.Monad.Singletons.Internal

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: Either e (a ~> b)) (t2 :: Either e a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Either e a) (t3 :: Either e b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: Either e a) (t2 :: Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: Either e a) (t2 :: Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

SApplicative (Proxy :: Type -> Type)

Defined in Data.Proxy.Singletons

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: Proxy (a ~> b)) (t2 :: Proxy a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Proxy a) (t3 :: Proxy b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: Proxy a) (t2 :: Proxy b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: Proxy a) (t2 :: Proxy b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

SMonoid a => SApplicative ((,) a)

Defined in Control.Applicative.Singletons

Methods

sPure :: forall a0 (t :: a0). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a0 b (t1 :: (a, a0 ~> b)) (t2 :: (a, a0)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a0 b c (t1 :: a0 ~> (b ~> c)) (t2 :: (a, a0)) (t3 :: (a, b)). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a0 b (t1 :: (a, a0)) (t2 :: (a, b)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a0 b (t1 :: (a, a0)) (t2 :: (a, b)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

SMonoid m => SApplicative (Const m :: Type -> Type)

Defined in Data.Functor.Const.Singletons

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: Const m (a ~> b)) (t2 :: Const m a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Const m a) (t3 :: Const m b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: Const m a) (t2 :: Const m b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: Const m a) (t2 :: Const m b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

(SApplicative f, SApplicative g) => SApplicative (Product f g)

Defined in Data.Functor.Product.Singletons

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: Product f g (a ~> b)) (t2 :: Product f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Product f g a) (t3 :: Product f g b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: Product f g a) (t2 :: Product f g b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: Product f g a) (t2 :: Product f g b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

(SApplicative f, SApplicative g) => SApplicative (Compose f g)

Defined in Data.Functor.Compose.Singletons

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: Compose f g (a ~> b)) (t2 :: Compose f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Compose f g a) (t3 :: Compose f g b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: Compose f g a) (t2 :: Compose f g b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: Compose f g a) (t2 :: Compose f g b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

class PAlternative f

Associated Types

type Empty :: f a

type (arg :: f a) <|> (arg :: f a) :: f a infixl 3

Instances

PAlternative Maybe

Defined in Control.Monad.Singletons.Internal

Associated Types

type Empty :: f a

type arg <|> arg1 :: f a

PAlternative []

Defined in Control.Monad.Singletons.Internal

Associated Types

type Empty :: f a

type arg <|> arg1 :: f a

PAlternative (Proxy :: k -> Type)

Defined in Data.Proxy.Singletons

Associated Types

type Empty :: f a

type arg <|> arg1 :: f a

PAlternative (Product f g :: k -> Type)

Defined in Data.Functor.Product.Singletons

Associated Types

type Empty :: f a

type arg <|> arg1 :: f a

PAlternative (Compose f g :: k2 -> Type)

Defined in Data.Functor.Compose.Singletons

Associated Types

type Empty :: f a

type arg <|> arg1 :: f a

class SApplicative f => SAlternative f where

Methods

sEmpty :: forall a. Sing (EmptySym0 :: f a)

(%<|>) :: forall a (t :: f a) (t :: f a). Sing t -> Sing t -> Sing (Apply (Apply (<|>@#@$) t) t :: f a) infixl 3

Instances

SAlternative Maybe

Defined in Control.Monad.Singletons.Internal

Methods

sEmpty :: Sing EmptySym0

(%<|>) :: forall a (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<|>@#@$) t1) t2)

SAlternative []

Defined in Control.Monad.Singletons.Internal

Methods

sEmpty :: Sing EmptySym0

(%<|>) :: forall a (t1 :: [a]) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<|>@#@$) t1) t2)

SAlternative (Proxy :: Type -> Type)

Defined in Data.Proxy.Singletons

Methods

sEmpty :: Sing EmptySym0

(%<|>) :: forall a (t1 :: Proxy a) (t2 :: Proxy a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<|>@#@$) t1) t2)

(SAlternative f, SAlternative g) => SAlternative (Product f g)

Defined in Data.Functor.Product.Singletons

Methods

sEmpty :: Sing EmptySym0

(%<|>) :: forall a (t1 :: Product f g a) (t2 :: Product f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<|>@#@$) t1) t2)

(SAlternative f, SApplicative g) => SAlternative (Compose f g)

Defined in Data.Functor.Compose.Singletons

Methods

sEmpty :: Sing EmptySym0

(%<|>) :: forall a (t1 :: Compose f g a) (t2 :: Compose f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<|>@#@$) t1) t2)

type family Sing :: k -> Type

Instances

type Sing

Defined in Data.Semigroup.Singletons.Internal

type Sing = SAll

type Sing

Defined in Data.Semigroup.Singletons.Internal

type Sing = SAny

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = SVoid

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = SOrdering

type Sing

Defined in Data.Singletons.Base.TypeError

type Sing = SErrorMessage

type Sing

Defined in GHC.TypeLits.Singletons.Internal

type Sing = SNat

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = STuple0

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = SBool

type Sing

Defined in GHC.TypeLits.Singletons.Internal

type Sing = SChar

type Sing

Defined in GHC.TypeLits.Singletons.Internal

type Sing = SSymbol

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = SIdentity :: Identity a -> Type

type Sing

Defined in Data.Monoid.Singletons

type Sing = SFirst :: First a -> Type

type Sing

Defined in Data.Monoid.Singletons

type Sing = SLast :: Last a -> Type

type Sing

Defined in Data.Ord.Singletons

type Sing = SDown :: Down a -> Type

type Sing

Defined in Data.Semigroup.Singletons.Internal

type Sing = SFirst :: First a -> Type

type Sing

Defined in Data.Semigroup.Singletons.Internal

type Sing = SLast :: Last a -> Type

type Sing

Defined in Data.Semigroup.Singletons.Internal

type Sing = SMax :: Max a -> Type

type Sing

Defined in Data.Semigroup.Singletons.Internal

type Sing = SMin :: Min a -> Type

type Sing

Defined in Data.Semigroup.Singletons.Internal

type Sing = SWrappedMonoid :: WrappedMonoid m -> Type

type Sing

Defined in Data.Semigroup.Singletons.Internal

type Sing = SDual :: Dual a -> Type

type Sing

Defined in Data.Semigroup.Singletons.Internal

type Sing = SProduct :: Product a -> Type

type Sing

Defined in Data.Semigroup.Singletons.Internal

type Sing = SSum :: Sum a -> Type

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = SNonEmpty :: NonEmpty a -> Type

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = SMaybe :: Maybe a -> Type

type Sing

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.

Defined in Data.Singletons.Base.TypeRepTYPE

type Sing = TypeRep :: TYPE rep -> Type

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = SList :: [a] -> Type

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = SEither :: Either a b -> Type

type Sing

Defined in Data.Proxy.Singletons

type Sing = SProxy :: Proxy t -> Type

type Sing

Defined in Data.Semigroup.Singletons

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

type Sing

Defined in Data.Singletons

type Sing = SWrappedSing :: WrappedSing a -> Type

type Sing

Defined in Data.Singletons

type Sing = SLambda :: (k1 ~> k2) -> Type

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = STuple2 :: (a, b) -> Type

type Sing

Defined in Data.Functor.Const.Singletons

type Sing = SConst :: Const a b -> Type

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = STuple3 :: (a, b, c) -> Type

type Sing

Defined in Data.Functor.Product.Singletons

type Sing = SProduct :: Product f g a -> Type

type Sing

Defined in Data.Functor.Sum.Singletons

type Sing = SSum :: Sum f g a -> Type

type Sing

Defined in Data.Singletons.Base.Instances

type Sing = STuple4 :: (a, b, c, d) -> Type

type Sing

Defined in Data.Functor.Compose.Singletons

type Sing = SCompose :: Compose f g a -> Type

type Sing

Defined in Data.Singletons.Base.Instances

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

type Sing

Defined in Data.Singletons.Base.Instances

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

type Sing

Defined in Data.Singletons.Base.Instances

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

data SConst :: Const a b -> Type where

Constructors

SConst :: forall {k} a (b :: k) (x :: a). Sing x -> SConst ('Const @a @b x)

Instances

SDecide a => TestCoercion (SConst :: Const a b -> Type)

Defined in Data.Functor.Const.Singletons

Methods

testCoercion :: forall (a0 :: k) (b0 :: k). SConst a0 -> SConst b0 -> Maybe (Coercion a0 b0)

SDecide a => TestEquality (SConst :: Const a b -> Type)

Defined in Data.Functor.Const.Singletons

Methods

testEquality :: forall (a0 :: k) (b0 :: k). SConst a0 -> SConst b0 -> Maybe (a0 :~: b0)

data Const a (b :: k)

The Const functor.

Instances

Generic1 (Const a :: k -> Type)

Defined in Data.Functor.Const

Associated Types

type Rep1 (Const a) :: k -> Type

Methods

from1 :: forall (a0 :: k0). Const a a0 -> Rep1 (Const a) a0

to1 :: forall (a0 :: k0). Rep1 (Const a) a0 -> Const a a0

SingI1 ('Const :: k1 -> Const k1 b)

Defined in Data.Functor.Const.Singletons

Methods

liftSing :: forall (x :: k10). Sing x -> Sing ('Const x)

Eq2 (Const :: Type -> Type -> Type)

Since: base-4.9.0.0

Defined in Data.Functor.Classes

Methods

liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> Const a c -> Const b d -> Bool

Ord2 (Const :: Type -> Type -> Type)

Since: base-4.9.0.0

Defined in Data.Functor.Classes

Methods

liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Const a c -> Const b d -> Ordering

Read2 (Const :: Type -> Type -> Type)

Since: base-4.9.0.0

Defined in Data.Functor.Classes

Methods

liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (Const a b)

liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Const a b]

liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Const a b)

liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Const a b]

Show2 (Const :: Type -> Type -> Type)

Since: base-4.9.0.0

Defined in Data.Functor.Classes

Methods

liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> Const a b -> ShowS

liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Const a b] -> ShowS

NFData2 (Const :: Type -> Type -> Type)

Since: deepseq-1.4.3.0

Defined in Control.DeepSeq

Methods

liftRnf2 :: (a -> ()) -> (b -> ()) -> Const a b -> ()

Foldable (Const m :: Type -> Type)

Since: base-4.7.0.0

Defined in Data.Functor.Const

Methods

fold :: Monoid m0 => Const m m0 -> m0

foldMap :: Monoid m0 => (a -> m0) -> Const m a -> m0

foldMap' :: Monoid m0 => (a -> m0) -> Const m a -> m0

foldr :: (a -> b -> b) -> b -> Const m a -> b

foldr' :: (a -> b -> b) -> b -> Const m a -> b

foldl :: (b -> a -> b) -> b -> Const m a -> b

foldl' :: (b -> a -> b) -> b -> Const m a -> b

foldr1 :: (a -> a -> a) -> Const m a -> a

foldl1 :: (a -> a -> a) -> Const m a -> a

toList :: Const m a -> [a]

null :: Const m a -> Bool

length :: Const m a -> Int

elem :: Eq a => a -> Const m a -> Bool

maximum :: Ord a => Const m a -> a

minimum :: Ord a => Const m a -> a

sum :: Num a => Const m a -> a

product :: Num a => Const m a -> a

Eq a => Eq1 (Const a :: Type -> Type)

Since: base-4.9.0.0

Defined in Data.Functor.Classes

Methods

liftEq :: (a0 -> b -> Bool) -> Const a a0 -> Const a b -> Bool

Ord a => Ord1 (Const a :: Type -> Type)

Since: base-4.9.0.0

Defined in Data.Functor.Classes

Methods

liftCompare :: (a0 -> b -> Ordering) -> Const a a0 -> Const a b -> Ordering

Read a => Read1 (Const a :: Type -> Type)

Since: base-4.9.0.0

Defined in Data.Functor.Classes

Methods

liftReadsPrec :: (Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS (Const a a0)

liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [Const a a0]

liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (Const a a0)

liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [Const a a0]

Show a => Show1 (Const a :: Type -> Type)

Since: base-4.9.0.0

Defined in Data.Functor.Classes

Methods

liftShowsPrec :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> Int -> Const a a0 -> ShowS

liftShowList :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> [Const a a0] -> ShowS

Traversable (Const m :: Type -> Type)

Since: base-4.7.0.0

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Const m a -> f (Const m b)

sequenceA :: Applicative f => Const m (f a) -> f (Const m a)

mapM :: Monad m0 => (a -> m0 b) -> Const m a -> m0 (Const m b)

sequence :: Monad m0 => Const m (m0 a) -> m0 (Const m a)

Monoid m => Applicative (Const m :: Type -> Type)

Since: base-2.0.1

Defined in Data.Functor.Const

Methods

pure :: a -> Const m a

(<*>) :: Const m (a -> b) -> Const m a -> Const m b

liftA2 :: (a -> b -> c) -> Const m a -> Const m b -> Const m c

(*>) :: Const m a -> Const m b -> Const m b

(<*) :: Const m a -> Const m b -> Const m a

Functor (Const m :: Type -> Type)

Since: base-2.1

Defined in Data.Functor.Const

Methods

fmap :: (a -> b) -> Const m a -> Const m b

(<$) :: a -> Const m b -> Const m a

NFData a => NFData1 (Const a :: Type -> Type)

Since: deepseq-1.4.3.0

Defined in Control.DeepSeq

Methods

liftRnf :: (a0 -> ()) -> Const a a0 -> ()

PApplicative (Const m :: Type -> Type)

Defined in Data.Functor.Const.Singletons

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

PFunctor (Const m :: Type -> Type)

Defined in Data.Functor.Const.Singletons

Associated Types

type Fmap arg arg1 :: f b

type arg <$ arg1 :: f a

SMonoid m => SApplicative (Const m :: Type -> Type)

Defined in Data.Functor.Const.Singletons

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: Const m (a ~> b)) (t2 :: Const m a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Const m a) (t3 :: Const m b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: Const m a) (t2 :: Const m b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: Const m a) (t2 :: Const m b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

SFunctor (Const m :: Type -> Type)

Defined in Data.Functor.Const.Singletons

Methods

sFmap :: forall a b (t1 :: a ~> b) (t2 :: Const m a). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2)

(%<$) :: forall a b (t1 :: a) (t2 :: Const m b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<$@#@$) t1) t2)

PFoldable (Const m :: Type -> Type)

Defined in Data.Functor.Const.Singletons

Associated Types

type Fold arg :: m

type FoldMap arg arg1 :: m

type Foldr arg arg1 arg2 :: b

type Foldr' arg arg1 arg2 :: b

type Foldl arg arg1 arg2 :: b

type Foldl' arg arg1 arg2 :: b

type Foldr1 arg arg1 :: a

type Foldl1 arg arg1 :: a

type ToList arg :: [a]

type Null arg :: Bool

type Length arg :: Natural

type Elem arg arg1 :: Bool

type Maximum arg :: a

type Minimum arg :: a

type Sum arg :: a

type Product arg :: a

SFoldable (Const m :: Type -> Type)

Defined in Data.Functor.Const.Singletons

Methods

sFold :: forall m0 (t1 :: Const m m0). SMonoid m0 => Sing t1 -> Sing (Apply FoldSym0 t1)

sFoldMap :: forall a m0 (t1 :: a ~> m0) (t2 :: Const m a). SMonoid m0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2)

sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Const m a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3)

sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Const m a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3)

sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Const m a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3)

sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Const m a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3)

sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Const m a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2)

sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Const m a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2)

sToList :: forall a (t1 :: Const m a). Sing t1 -> Sing (Apply ToListSym0 t1)

sNull :: forall a (t1 :: Const m a). Sing t1 -> Sing (Apply NullSym0 t1)

sLength :: forall a (t1 :: Const m a). Sing t1 -> Sing (Apply LengthSym0 t1)

sElem :: forall a (t1 :: a) (t2 :: Const m a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2)

sMaximum :: forall a (t1 :: Const m a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1)

sMinimum :: forall a (t1 :: Const m a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1)

sSum :: forall a (t1 :: Const m a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1)

sProduct :: forall a (t1 :: Const m a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1)

PTraversable (Const m :: Type -> Type)

Defined in Data.Traversable.Singletons

Associated Types

type Traverse arg arg1 :: f (t b)

type SequenceA arg :: f (t a)

type MapM arg arg1 :: m (t b)

type Sequence arg :: m (t a)

STraversable (Const m :: Type -> Type)

Defined in Data.Traversable.Singletons

Methods

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

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

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

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

SingI (GetConstSym0 :: TyFun (Const a b) a -> Type)

Defined in Data.Functor.Const.Singletons

Methods

sing :: Sing GetConstSym0

SingI (ConstSym0 :: TyFun a (Const a b) -> Type)

Defined in Data.Functor.Const.Singletons

Methods

sing :: Sing ConstSym0

SuppressUnusedWarnings (GetConstSym0 :: TyFun (Const a b) a -> Type)

Defined in Data.Functor.Const.Singletons

Methods

suppressUnusedWarnings :: ()

IsString a => IsString (Const a b)

Since: base-4.9.0.0

Defined in Data.String

Methods

fromString :: String -> Const a b

Storable a => Storable (Const a b)

Since: base-4.9.0.0

Defined in Data.Functor.Const

Methods

sizeOf :: Const a b -> Int

alignment :: Const a b -> Int

peekElemOff :: Ptr (Const a b) -> Int -> IO (Const a b)

pokeElemOff :: Ptr (Const a b) -> Int -> Const a b -> IO ()

peekByteOff :: Ptr b0 -> Int -> IO (Const a b)

pokeByteOff :: Ptr b0 -> Int -> Const a b -> IO ()

peek :: Ptr (Const a b) -> IO (Const a b)

poke :: Ptr (Const a b) -> Const a b -> IO ()

Monoid a => Monoid (Const a b)

Since: base-4.9.0.0

Defined in Data.Functor.Const

Methods

mempty :: Const a b

mappend :: Const a b -> Const a b -> Const a b

mconcat :: [Const a b] -> Const a b

Semigroup a => Semigroup (Const a b)

Since: base-4.9.0.0

Defined in Data.Functor.Const

Methods

(<>) :: Const a b -> Const a b -> Const a b

sconcat :: NonEmpty (Const a b) -> Const a b

stimes :: Integral b0 => b0 -> Const a b -> Const a b

Bits a => Bits (Const a b)

Since: base-4.9.0.0

Defined in Data.Functor.Const

Methods

(.&.) :: Const a b -> Const a b -> Const a b

(.|.) :: Const a b -> Const a b -> Const a b

xor :: Const a b -> Const a b -> Const a b

complement :: Const a b -> Const a b

shift :: Const a b -> Int -> Const a b

rotate :: Const a b -> Int -> Const a b

zeroBits :: Const a b

bit :: Int -> Const a b

setBit :: Const a b -> Int -> Const a b

clearBit :: Const a b -> Int -> Const a b

complementBit :: Const a b -> Int -> Const a b

testBit :: Const a b -> Int -> Bool

bitSizeMaybe :: Const a b -> Maybe Int

bitSize :: Const a b -> Int

isSigned :: Const a b -> Bool

shiftL :: Const a b -> Int -> Const a b

unsafeShiftL :: Const a b -> Int -> Const a b

shiftR :: Const a b -> Int -> Const a b

unsafeShiftR :: Const a b -> Int -> Const a b

rotateL :: Const a b -> Int -> Const a b

rotateR :: Const a b -> Int -> Const a b

popCount :: Const a b -> Int

FiniteBits a => FiniteBits (Const a b)

Since: base-4.9.0.0

Defined in Data.Functor.Const

Methods

finiteBitSize :: Const a b -> Int

countLeadingZeros :: Const a b -> Int

countTrailingZeros :: Const a b -> Int

Bounded a => Bounded (Const a b)

Since: base-4.9.0.0

Defined in Data.Functor.Const

Methods

minBound :: Const a b

maxBound :: Const a b

Enum a => Enum (Const a b)

Since: base-4.9.0.0

Defined in Data.Functor.Const

Methods

succ :: Const a b -> Const a b

pred :: Const a b -> Const a b

toEnum :: Int -> Const a b

fromEnum :: Const a b -> Int

enumFrom :: Const a b -> [Const a b]

enumFromThen :: Const a b -> Const a b -> [Const a b]

enumFromTo :: Const a b -> Const a b -> [Const a b]

enumFromThenTo :: Const a b -> Const a b -> Const a b -> [Const a b]

Floating a => Floating (Const a b)

Since: base-4.9.0.0

Defined in Data.Functor.Const

Methods

pi :: Const a b

exp :: Const a b -> Const a b

log :: Const a b -> Const a b

sqrt :: Const a b -> Const a b

(**) :: Const a b -> Const a b -> Const a b

logBase :: Const a b -> Const a b -> Const a b

sin :: Const a b -> Const a b

cos :: Const a b -> Const a b

tan :: Const a b -> Const a b

asin :: Const a b -> Const a b

acos :: Const a b -> Const a b

atan :: Const a b -> Const a b

sinh :: Const a b -> Const a b

cosh :: Const a b -> Const a b

tanh :: Const a b -> Const a b

asinh :: Const a b -> Const a b

acosh :: Const a b -> Const a b

atanh :: Const a b -> Const a b

log1p :: Const a b -> Const a b

expm1 :: Const a b -> Const a b

log1pexp :: Const a b -> Const a b

log1mexp :: Const a b -> Const a b

RealFloat a => RealFloat (Const a b)

Since: base-4.9.0.0

Defined in Data.Functor.Const

Methods

floatRadix :: Const a b -> Integer

floatDigits :: Const a b -> Int

floatRange :: Const a b -> (Int, Int)

decodeFloat :: Const a b -> (Integer, Int)

encodeFloat :: Integer -> Int -> Const a b

exponent :: Const a b -> Int

significand :: Const a b -> Const a b

scaleFloat :: Int -> Const a b -> Const a b

isNaN :: Const a b -> Bool

isInfinite :: Const a b -> Bool

isDenormalized :: Const a b -> Bool

isNegativeZero :: Const a b -> Bool

isIEEE :: Const a b -> Bool

atan2 :: Const a b -> Const a b -> Const a b

Generic (Const a b)

Defined in Data.Functor.Const

Associated Types

type Rep (Const a b) :: Type -> Type

Methods

from :: Const a b -> Rep (Const a b) x

to :: Rep (Const a b) x -> Const a b

Ix a => Ix (Const a b)

Since: base-4.9.0.0

Defined in Data.Functor.Const

Methods

range :: (Const a b, Const a b) -> [Const a b]

index :: (Const a b, Const a b) -> Const a b -> Int

unsafeIndex :: (Const a b, Const a b) -> Const a b -> Int

inRange :: (Const a b, Const a b) -> Const a b -> Bool

rangeSize :: (Const a b, Const a b) -> Int

unsafeRangeSize :: (Const a b, Const a b) -> Int

Num a => Num (Const a b)

Since: base-4.9.0.0

Defined in Data.Functor.Const

Methods

(+) :: Const a b -> Const a b -> Const a b

(-) :: Const a b -> Const a b -> Const a b

(*) :: Const a b -> Const a b -> Const a b

negate :: Const a b -> Const a b

abs :: Const a b -> Const a b

signum :: Const a b -> Const a b

fromInteger :: Integer -> Const a b

Read a => Read (Const a b)

This instance would be equivalent to the derived instances of the Const newtype if the getConst field were removed

Since: base-4.8.0.0

Defined in Data.Functor.Const

Methods

readsPrec :: Int -> ReadS (Const a b)

readList :: ReadS [Const a b]

readPrec :: ReadPrec (Const a b)

readListPrec :: ReadPrec [Const a b]

Fractional a => Fractional (Const a b)

Since: base-4.9.0.0

Defined in Data.Functor.Const

Methods

(/) :: Const a b -> Const a b -> Const a b

recip :: Const a b -> Const a b

fromRational :: Rational -> Const a b

Integral a => Integral (Const a b)

Since: base-4.9.0.0

Defined in Data.Functor.Const

Methods

quot :: Const a b -> Const a b -> Const a b

rem :: Const a b -> Const a b -> Const a b

div :: Const a b -> Const a b -> Const a b

mod :: Const a b -> Const a b -> Const a b

quotRem :: Const a b -> Const a b -> (Const a b, Const a b)

divMod :: Const a b -> Const a b -> (Const a b, Const a b)

toInteger :: Const a b -> Integer

Real a => Real (Const a b)

Since: base-4.9.0.0

Defined in Data.Functor.Const

Methods

toRational :: Const a b -> Rational

RealFrac a => RealFrac (Const a b)

Since: base-4.9.0.0

Defined in Data.Functor.Const

Methods

properFraction :: Integral b0 => Const a b -> (b0, Const a b)

truncate :: Integral b0 => Const a b -> b0

round :: Integral b0 => Const a b -> b0

ceiling :: Integral b0 => Const a b -> b0

floor :: Integral b0 => Const a b -> b0

Show a => Show (Const a b)

This instance would be equivalent to the derived instances of the Const newtype if the getConst field were removed

Since: base-4.8.0.0

Defined in Data.Functor.Const

Methods

showsPrec :: Int -> Const a b -> ShowS

show :: Const a b -> String

showList :: [Const a b] -> ShowS

NFData a => NFData (Const a b)

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: Const a b -> ()

Eq a => Eq (Const a b)

Since: base-4.9.0.0

Defined in Data.Functor.Const

Methods

(==) :: Const a b -> Const a b -> Bool

(/=) :: Const a b -> Const a b -> Bool

Ord a => Ord (Const a b)

Since: base-4.9.0.0

Defined in Data.Functor.Const

Methods

compare :: Const a b -> Const a b -> Ordering

(<) :: Const a b -> Const a b -> Bool

(<=) :: Const a b -> Const a b -> Bool

(>) :: Const a b -> Const a b -> Bool

(>=) :: Const a b -> Const a b -> Bool

max :: Const a b -> Const a b -> Const a b

min :: Const a b -> Const a b -> Const a b

SingKind a => SingKind (Const a b)

Defined in Data.Functor.Const.Singletons

Associated Types

type Demote (Const a b) = (r :: Type)

Methods

fromSing :: forall (a0 :: Const a b). Sing a0 -> Demote (Const a b)

toSing :: Demote (Const a b) -> SomeSing (Const a b)

SDecide a => SDecide (Const a b)

Defined in Data.Functor.Const.Singletons

Methods

(%~) :: forall (a0 :: Const a b) (b0 :: Const a b). Sing a0 -> Sing b0 -> Decision (a0 :~: b0)

PEq (Const a b)

Defined in Data.Functor.Const.Singletons

Associated Types

type arg == arg1 :: Bool

type arg /= arg1 :: Bool

SEq a => SEq (Const a b)

Defined in Data.Functor.Const.Singletons

Methods

(%==) :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (==@#@$) t1) t2)

(%/=) :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (/=@#@$) t1) t2)

PMonoid (Const a b)

Defined in Data.Functor.Const.Singletons

Associated Types

type Mempty :: a

type Mappend arg arg1 :: a

type Mconcat arg :: a

SMonoid a => SMonoid (Const a b)

Defined in Data.Functor.Const.Singletons

Methods

sMempty :: Sing MemptySym0

sMappend :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2)

sMconcat :: forall (t :: [Const a b]). Sing t -> Sing (Apply MconcatSym0 t)

POrd (Const a b)

Defined in Data.Functor.Const.Singletons

Associated Types

type Compare arg arg1 :: Ordering

type arg < arg1 :: Bool

type arg <= arg1 :: Bool

type arg > arg1 :: Bool

type arg >= arg1 :: Bool

type Max arg arg1 :: a

type Min arg arg1 :: a

SOrd a => SOrd (Const a b)

Defined in Data.Functor.Const.Singletons

Methods

sCompare :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2)

(%<) :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2)

(%<=) :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2)

(%>) :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2)

(%>=) :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2)

sMax :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2)

sMin :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2)

PSemigroup (Const a b)

Defined in Data.Functor.Const.Singletons

Associated Types

type arg <> arg1 :: a

type Sconcat arg :: a

SSemigroup a => SSemigroup (Const a b)

Defined in Data.Functor.Const.Singletons

Methods

(%<>) :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2)

sSconcat :: forall (t :: NonEmpty (Const a b)). Sing t -> Sing (Apply SconcatSym0 t)

PBounded (Const a b)

Defined in Data.Functor.Const.Singletons

Associated Types

type MinBound :: a

type MaxBound :: a

PEnum (Const a b)

Defined in Data.Functor.Const.Singletons

Associated Types

type Succ arg :: a

type Pred arg :: a

type ToEnum arg :: a

type FromEnum arg :: Natural

type EnumFromTo arg arg1 :: [a]

type EnumFromThenTo arg arg1 arg2 :: [a]

SBounded a => SBounded (Const a b)

Defined in Data.Functor.Const.Singletons

Methods

sMinBound :: Sing MinBoundSym0

sMaxBound :: Sing MaxBoundSym0

SEnum a => SEnum (Const a b)

Defined in Data.Functor.Const.Singletons

Methods

sSucc :: forall (t :: Const a b). Sing t -> Sing (Apply SuccSym0 t)

sPred :: forall (t :: Const a b). Sing t -> Sing (Apply PredSym0 t)

sToEnum :: forall (t :: Natural). Sing t -> Sing (Apply ToEnumSym0 t)

sFromEnum :: forall (t :: Const a b). Sing t -> Sing (Apply FromEnumSym0 t)

sEnumFromTo :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2)

sEnumFromThenTo :: forall (t1 :: Const a b) (t2 :: Const a b) (t3 :: Const a b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3)

PIsString (Const a b)

Defined in Data.String.Singletons

Associated Types

type FromString arg :: a

SIsString a => SIsString (Const a b)

Defined in Data.String.Singletons

Methods

sFromString :: forall (t :: Symbol). Sing t -> Sing (Apply FromStringSym0 t)

PNum (Const a b)

Defined in Data.Functor.Const.Singletons

Associated Types

type arg + arg1 :: a

type arg - arg1 :: a

type arg * arg1 :: a

type Negate arg :: a

type Abs arg :: a

type Signum arg :: a

type FromInteger arg :: a

SNum a => SNum (Const a b)

Defined in Data.Functor.Const.Singletons

Methods

(%+) :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (+@#@$) t1) t2)

(%-) :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (-@#@$) t1) t2)

(%*) :: forall (t1 :: Const a b) (t2 :: Const a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*@#@$) t1) t2)

sNegate :: forall (t :: Const a b). Sing t -> Sing (Apply NegateSym0 t)

sAbs :: forall (t :: Const a b). Sing t -> Sing (Apply AbsSym0 t)

sSignum :: forall (t :: Const a b). Sing t -> Sing (Apply SignumSym0 t)

sFromInteger :: forall (t :: Natural). Sing t -> Sing (Apply FromIntegerSym0 t)

PShow (Const a b)

Defined in Data.Functor.Const.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol

type Show_ arg :: Symbol

type ShowList arg arg1 :: Symbol

SShow a => SShow (Const a b)

Defined in Data.Functor.Const.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: Const a b) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3)

sShow_ :: forall (t :: Const a b). Sing t -> Sing (Apply Show_Sym0 t)

sShowList :: forall (t1 :: [Const a b]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2)

SDecide a => TestCoercion (SConst :: Const a b -> Type)

Defined in Data.Functor.Const.Singletons

Methods

testCoercion :: forall (a0 :: k) (b0 :: k). SConst a0 -> SConst b0 -> Maybe (Coercion a0 b0)

SDecide a => TestEquality (SConst :: Const a b -> Type)

Defined in Data.Functor.Const.Singletons

Methods

testEquality :: forall (a0 :: k) (b0 :: k). SConst a0 -> SConst b0 -> Maybe (a0 :~: b0)

SingI a2 => SingI ('Const a2 :: Const a1 b)

Defined in Data.Functor.Const.Singletons

Methods

sing :: Sing ('Const a2)

type MapM (arg1 :: a ~> m1 b) (arg2 :: Const m2 a)

Defined in Data.Traversable.Singletons

type MapM (arg1 :: a ~> m1 b) (arg2 :: Const m2 a)

type Traverse (a2 :: a1 ~> f b) (a3 :: Const m a1)

Defined in Data.Traversable.Singletons

type Traverse (a2 :: a1 ~> f b) (a3 :: Const m a1)

type LiftA2 (a2 :: a1 ~> (b ~> c)) (a3 :: Const m a1) (a4 :: Const m b)

Defined in Data.Functor.Const.Singletons

type LiftA2 (a2 :: a1 ~> (b ~> c)) (a3 :: Const m a1) (a4 :: Const m b)

type Fmap (a2 :: a1 ~> b) (a3 :: Const m a1)

Defined in Data.Functor.Const.Singletons

type Fmap (a2 :: a1 ~> b) (a3 :: Const m a1)

type FoldMap (a2 :: a1 ~> k2) (a3 :: Const m a1)

Defined in Data.Functor.Const.Singletons

type FoldMap (a2 :: a1 ~> k2) (a3 :: Const m a1)

type Foldl (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: Const m a)

Defined in Data.Functor.Const.Singletons

type Foldl (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: Const m a)

type Foldl' (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: Const m a)

Defined in Data.Functor.Const.Singletons

type Foldl' (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: Const m a)

type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Const m a1)

Defined in Data.Functor.Const.Singletons

type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Const m a1)

type Foldr' (arg :: a ~> (b ~> b)) (arg1 :: b) (arg2 :: Const m a)

Defined in Data.Functor.Const.Singletons

type Foldr' (arg :: a ~> (b ~> b)) (arg1 :: b) (arg2 :: Const m a)

type Rep1 (Const a :: k -> Type)

Since: base-4.9.0.0

Defined in Data.Functor.Const

type Rep1 (Const a :: k -> Type) = D1 ('MetaData "Const" "Data.Functor.Const" "base" 'True) (C1 ('MetaCons "Const" 'PrefixI 'True) (S1 ('MetaSel ('Just "getConst") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))

type Pure (a :: k1)

Defined in Data.Functor.Const.Singletons

type Pure (a :: k1)

type Elem (arg :: a) (arg1 :: Const m a)

Defined in Data.Functor.Const.Singletons

type Elem (arg :: a) (arg1 :: Const m a)

type Foldl1 (arg :: a ~> (a ~> a)) (arg1 :: Const m a)

Defined in Data.Functor.Const.Singletons

type Foldl1 (arg :: a ~> (a ~> a)) (arg1 :: Const m a)

type Foldr1 (arg :: a ~> (a ~> a)) (arg1 :: Const m a)

Defined in Data.Functor.Const.Singletons

type Foldr1 (arg :: a ~> (a ~> a)) (arg1 :: Const m a)

type (a1 :: k1) <$ (a2 :: Const m b)

Defined in Data.Functor.Const.Singletons

type (a1 :: k1) <$ (a2 :: Const m b)

type Apply (ConstSym0 :: TyFun a (Const a b) -> Type) (x :: a)

Defined in Data.Functor.Const.Singletons

type Apply (ConstSym0 :: TyFun a (Const a b) -> Type) (x :: a) = 'Const x :: Const a b

type Fold (arg :: Const m1 m2)

Defined in Data.Functor.Const.Singletons

type Fold (arg :: Const m1 m2)

type Length (arg :: Const m a)

Defined in Data.Functor.Const.Singletons

type Length (arg :: Const m a)

type Maximum (arg :: Const m a)

Defined in Data.Functor.Const.Singletons

type Maximum (arg :: Const m a)

type Minimum (arg :: Const m a)

Defined in Data.Functor.Const.Singletons

type Minimum (arg :: Const m a)

type Null (arg :: Const m a)

Defined in Data.Functor.Const.Singletons

type Null (arg :: Const m a)

type Product (arg :: Const m a)

Defined in Data.Functor.Const.Singletons

type Product (arg :: Const m a)

type Sum (arg :: Const m a)

Defined in Data.Functor.Const.Singletons

type Sum (arg :: Const m a)

type ToList (arg :: Const m a)

Defined in Data.Functor.Const.Singletons

type ToList (arg :: Const m a)

type Sequence (arg :: Const m1 (m2 a))

Defined in Data.Traversable.Singletons

type Sequence (arg :: Const m1 (m2 a))

type SequenceA (arg :: Const m (f a))

Defined in Data.Traversable.Singletons

type SequenceA (arg :: Const m (f a))

type (arg :: Const m a) *> (arg1 :: Const m b)

Defined in Data.Functor.Const.Singletons

type (arg :: Const m a) *> (arg1 :: Const m b)

type (arg :: Const m a) <* (arg1 :: Const m b)

Defined in Data.Functor.Const.Singletons

type (arg :: Const m a) <* (arg1 :: Const m b)

type (a2 :: Const m (a1 ~> b)) <*> (a3 :: Const m a1)

Defined in Data.Functor.Const.Singletons

type (a2 :: Const m (a1 ~> b)) <*> (a3 :: Const m a1)

type Rep (Const a b)

Since: base-4.9.0.0

Defined in Data.Functor.Const

type Rep (Const a b) = D1 ('MetaData "Const" "Data.Functor.Const" "base" 'True) (C1 ('MetaCons "Const" 'PrefixI 'True) (S1 ('MetaSel ('Just "getConst") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))

type Demote (Const a b)

Defined in Data.Functor.Const.Singletons

type Demote (Const a b) = Const (Demote a) b

type Sing

Defined in Data.Functor.Const.Singletons

type Sing = SConst :: Const a b -> Type

type Mempty

Defined in Data.Functor.Const.Singletons

type Mempty

type MaxBound

Defined in Data.Functor.Const.Singletons

type MaxBound

type MinBound

Defined in Data.Functor.Const.Singletons

type MinBound

type Mconcat (arg :: [Const a b])

Defined in Data.Functor.Const.Singletons

type Mconcat (arg :: [Const a b])

type Sconcat (arg :: NonEmpty (Const a b))

Defined in Data.Functor.Const.Singletons

type Sconcat (arg :: NonEmpty (Const a b))

type FromEnum (a2 :: Const a1 b)

Defined in Data.Functor.Const.Singletons

type FromEnum (a2 :: Const a1 b)

type Pred (a2 :: Const a1 b)

Defined in Data.Functor.Const.Singletons

type Pred (a2 :: Const a1 b)

type Succ (a2 :: Const a1 b)

Defined in Data.Functor.Const.Singletons

type Succ (a2 :: Const a1 b)

type ToEnum a2

Defined in Data.Functor.Const.Singletons

type ToEnum a2

type FromString a2

Defined in Data.String.Singletons

type FromString a2

type Abs (a2 :: Const a1 b)

Defined in Data.Functor.Const.Singletons

type Abs (a2 :: Const a1 b)

type FromInteger a2

Defined in Data.Functor.Const.Singletons

type FromInteger a2

type Negate (a2 :: Const a1 b)

Defined in Data.Functor.Const.Singletons

type Negate (a2 :: Const a1 b)

type Signum (a2 :: Const a1 b)

Defined in Data.Functor.Const.Singletons

type Signum (a2 :: Const a1 b)

type Show_ (arg :: Const a b)

Defined in Data.Functor.Const.Singletons

type Show_ (arg :: Const a b)

type (arg :: Const a b) /= (arg1 :: Const a b)

Defined in Data.Functor.Const.Singletons

type (arg :: Const a b) /= (arg1 :: Const a b)

type (a2 :: Const a1 b) == (a3 :: Const a1 b)

Defined in Data.Functor.Const.Singletons

type (a2 :: Const a1 b) == (a3 :: Const a1 b)

type Mappend (arg :: Const a b) (arg1 :: Const a b)

Defined in Data.Functor.Const.Singletons

type Mappend (arg :: Const a b) (arg1 :: Const a b)

type (arg :: Const a b) < (arg1 :: Const a b)

Defined in Data.Functor.Const.Singletons

type (arg :: Const a b) < (arg1 :: Const a b)

type (arg :: Const a b) <= (arg1 :: Const a b)

Defined in Data.Functor.Const.Singletons

type (arg :: Const a b) <= (arg1 :: Const a b)

type (arg :: Const a b) > (arg1 :: Const a b)

Defined in Data.Functor.Const.Singletons

type (arg :: Const a b) > (arg1 :: Const a b)

type (arg :: Const a b) >= (arg1 :: Const a b)

Defined in Data.Functor.Const.Singletons

type (arg :: Const a b) >= (arg1 :: Const a b)

type Compare (a2 :: Const a1 b) (a3 :: Const a1 b)

Defined in Data.Functor.Const.Singletons

type Compare (a2 :: Const a1 b) (a3 :: Const a1 b)

type Max (arg :: Const a b) (arg1 :: Const a b)

Defined in Data.Functor.Const.Singletons

type Max (arg :: Const a b) (arg1 :: Const a b)

type Min (arg :: Const a b) (arg1 :: Const a b)

Defined in Data.Functor.Const.Singletons

type Min (arg :: Const a b) (arg1 :: Const a b)

type (a2 :: Const a1 b) <> (a3 :: Const a1 b)

Defined in Data.Functor.Const.Singletons

type (a2 :: Const a1 b) <> (a3 :: Const a1 b)

type EnumFromTo (a2 :: Const a1 b) (a3 :: Const a1 b)

Defined in Data.Functor.Const.Singletons

type EnumFromTo (a2 :: Const a1 b) (a3 :: Const a1 b)

type (a2 :: Const a1 b) * (a3 :: Const a1 b)

Defined in Data.Functor.Const.Singletons

type (a2 :: Const a1 b) * (a3 :: Const a1 b)

type (a2 :: Const a1 b) + (a3 :: Const a1 b)

Defined in Data.Functor.Const.Singletons

type (a2 :: Const a1 b) + (a3 :: Const a1 b)

type (a2 :: Const a1 b) - (a3 :: Const a1 b)

Defined in Data.Functor.Const.Singletons

type (a2 :: Const a1 b) - (a3 :: Const a1 b)

type ShowList (arg :: [Const a b]) arg1

Defined in Data.Functor.Const.Singletons

type ShowList (arg :: [Const a b]) arg1

type EnumFromThenTo (a2 :: Const a1 b) (a3 :: Const a1 b) (a4 :: Const a1 b)

Defined in Data.Functor.Const.Singletons

type EnumFromThenTo (a2 :: Const a1 b) (a3 :: Const a1 b) (a4 :: Const a1 b)

type ShowsPrec a2 (a3 :: Const a1 b) a4

Defined in Data.Functor.Const.Singletons

type ShowsPrec a2 (a3 :: Const a1 b) a4

type Apply (GetConstSym0 :: TyFun (Const a b) a -> Type) (a6989586621680742993 :: Const a b)

Defined in Data.Functor.Const.Singletons

type Apply (GetConstSym0 :: TyFun (Const a b) a -> Type) (a6989586621680742993 :: Const a b) = GetConst a6989586621680742993

type family GetConst (a :: Const a b) :: a where ...

Equations

GetConst ('Const x) = x

sGetConst :: forall a b (t :: Const a b). Sing t -> Sing (Apply GetConstSym0 t :: a)

type family (a :: (~>) a b) <$> (a :: f a) :: f b where ... infixl 4

Equations

a_6989586621679519971 <$> a_6989586621679519973 = Apply (Apply FmapSym0 a_6989586621679519971) a_6989586621679519973

(%<$>) :: forall a b f (t :: (~>) a b) (t :: f a). SFunctor f => Sing t -> Sing t -> Sing (Apply (Apply (<$>@#@$) t) t :: f b) infixl 4

type family (arg :: a) <$ (arg :: f b) :: f a infixl 4

Instances

type (a1 :: k1) <$ (a2 :: Identity b)

Defined in Data.Functor.Identity.Singletons

type (a1 :: k1) <$ (a2 :: Identity b)

type (a1 :: k1) <$ (a2 :: First b)

Defined in Data.Monoid.Singletons

type (a1 :: k1) <$ (a2 :: First b)

type (a1 :: k1) <$ (a2 :: Last b)

Defined in Data.Monoid.Singletons

type (a1 :: k1) <$ (a2 :: Last b)

type (a1 :: k1) <$ (a2 :: Down b)

Defined in Data.Functor.Singletons

type (a1 :: k1) <$ (a2 :: Down b)

type (a1 :: k1) <$ (a2 :: First b)

Defined in Data.Semigroup.Singletons

type (a1 :: k1) <$ (a2 :: First b)

type (a1 :: k1) <$ (a2 :: Last b)

Defined in Data.Semigroup.Singletons

type (a1 :: k1) <$ (a2 :: Last b)

type (a1 :: k1) <$ (a2 :: Max b)

Defined in Data.Semigroup.Singletons

type (a1 :: k1) <$ (a2 :: Max b)

type (a1 :: k1) <$ (a2 :: Min b)

Defined in Data.Semigroup.Singletons

type (a1 :: k1) <$ (a2 :: Min b)

type (a1 :: k1) <$ (a2 :: Dual b)

Defined in Data.Semigroup.Singletons.Internal

type (a1 :: k1) <$ (a2 :: Dual b)

type (a1 :: k1) <$ (a2 :: Product b)

Defined in Data.Semigroup.Singletons.Internal

type (a1 :: k1) <$ (a2 :: Product b)

type (a1 :: k1) <$ (a2 :: Sum b)

Defined in Data.Semigroup.Singletons.Internal

type (a1 :: k1) <$ (a2 :: Sum b)

type (a1 :: k1) <$ (a2 :: NonEmpty b)

Defined in Control.Monad.Singletons.Internal

type (a1 :: k1) <$ (a2 :: NonEmpty b)

type (a1 :: k1) <$ (a2 :: Maybe b)

Defined in Control.Monad.Singletons.Internal

type (a1 :: k1) <$ (a2 :: Maybe b)

type (a1 :: k1) <$ (a2 :: [b])

Defined in Control.Monad.Singletons.Internal

type (a1 :: k1) <$ (a2 :: [b])

type (arg :: a) <$ (arg1 :: Proxy b)

Defined in Data.Proxy.Singletons

type (arg :: a) <$ (arg1 :: Proxy b)

type (a2 :: k1) <$ (a3 :: Either a1 b)

Defined in Control.Monad.Singletons.Internal

type (a2 :: k1) <$ (a3 :: Either a1 b)

type (a2 :: k1) <$ (a3 :: Arg a1 b)

Defined in Data.Semigroup.Singletons

type (a2 :: k1) <$ (a3 :: Arg a1 b)

type (a2 :: k1) <$ (a3 :: (a1, b))

Defined in Data.Functor.Singletons

type (a2 :: k1) <$ (a3 :: (a1, b))

type (a1 :: k1) <$ (a2 :: Const m b)

Defined in Data.Functor.Const.Singletons

type (a1 :: k1) <$ (a2 :: Const m b)

type (a1 :: k1) <$ (a2 :: Product f g b)

Defined in Data.Functor.Product.Singletons

type (a1 :: k1) <$ (a2 :: Product f g b)

type (a1 :: k1) <$ (a2 :: Sum f g b)

Defined in Data.Functor.Sum.Singletons

type (a1 :: k1) <$ (a2 :: Sum f g b)

type (a1 :: k1) <$ (a2 :: Compose f g b)

Defined in Data.Functor.Compose.Singletons

type (a1 :: k1) <$ (a2 :: Compose f g b)

(%<$) :: forall a b (t :: a) (t :: f b). SFunctor f => Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t :: f a) infixl 4

type family (a :: f a) <**> (a :: f ((~>) a b)) :: f b where ... infixl 4

Equations

a_6989586621679329093 <**> a_6989586621679329095 = Apply (Apply (Apply LiftA2Sym0 (Apply (Apply Lambda_6989586621679329104Sym0 a_6989586621679329093) a_6989586621679329095)) a_6989586621679329093) a_6989586621679329095

(%<**>) :: forall f a b (t :: f a) (t :: f ((~>) a b)). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply (<**>@#@$) t) t :: f b) infixl 4

type family LiftA (a :: (~>) a b) (a :: f a) :: f b where ...

Equations

LiftA f a = Apply (Apply (<*>@#@$) (Apply PureSym0 f)) a

sLiftA :: forall a b f (t :: (~>) a b) (t :: f a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply LiftASym0 t) t :: f b)

type family LiftA3 (a :: (~>) a ((~>) b ((~>) c d))) (a :: f a) (a :: f b) (a :: f c) :: f d where ...

Equations

LiftA3 f a b c = Apply (Apply (<*>@#@$) (Apply (Apply (Apply LiftA2Sym0 f) a) b)) c

sLiftA3 :: forall a b c d f (t :: (~>) a ((~>) b ((~>) c d))) (t :: f a) (t :: f b) (t :: f c). SApplicative f => Sing t -> Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply (Apply LiftA3Sym0 t) t) t) t :: f d)

type family Optional (a :: f a) :: f (Maybe a) where ...

Equations

Optional v = Apply (Apply (<|>@#@$) (Apply (Apply (<$>@#@$) JustSym0) v)) (Apply PureSym0 NothingSym0)

sOptional :: forall f a (t :: f a). SAlternative f => Sing t -> Sing (Apply OptionalSym0 t :: f (Maybe a))

Defunctionalization symbols

data PureSym0 :: (~>) a (f a)

Instances

SApplicative f => SingI (PureSym0 :: TyFun a (f a) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing PureSym0

SuppressUnusedWarnings (PureSym0 :: TyFun a (f a) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply (PureSym0 :: TyFun a (f a) -> Type) (a6989586621679329136 :: a)

Defined in Control.Monad.Singletons.Internal

type Apply (PureSym0 :: TyFun a (f a) -> Type) (a6989586621679329136 :: a) = Pure a6989586621679329136 :: f a

type family PureSym1 (a6989586621679329136 :: a) :: f a where ...

Equations

PureSym1 a6989586621679329136 = Pure a6989586621679329136

data (<*>@#@$) :: (~>) (f ((~>) a b)) ((~>) (f a) (f b)) infixl 4

Instances

SApplicative f => SingI ((<*>@#@$) :: TyFun (f (a ~> b)) (f a ~> f b) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing (<*>@#@$)

SuppressUnusedWarnings ((<*>@#@$) :: TyFun (f (a ~> b)) (f a ~> f b) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply ((<*>@#@$) :: TyFun (f (a ~> b)) (f a ~> f b) -> Type) (a6989586621679329140 :: f (a ~> b))

Defined in Control.Monad.Singletons.Internal

type Apply ((<*>@#@$) :: TyFun (f (a ~> b)) (f a ~> f b) -> Type) (a6989586621679329140 :: f (a ~> b)) = (<*>@#@$$) a6989586621679329140

data (<*>@#@$$) (a6989586621679329140 :: f ((~>) a b)) :: (~>) (f a) (f b) infixl 4

Instances

SApplicative f => SingI1 ((<*>@#@$$) :: f (a ~> b) -> TyFun (f a) (f b) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing ((<*>@#@$$) x)

(SApplicative f, SingI d) => SingI ((<*>@#@$$) d :: TyFun (f a) (f b) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing ((<*>@#@$$) d)

SuppressUnusedWarnings ((<*>@#@$$) a6989586621679329140 :: TyFun (f a) (f b) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply ((<*>@#@$$) a6989586621679329140 :: TyFun (f a) (f b) -> Type) (a6989586621679329141 :: f a)

Defined in Control.Monad.Singletons.Internal

type Apply ((<*>@#@$$) a6989586621679329140 :: TyFun (f a) (f b) -> Type) (a6989586621679329141 :: f a) = a6989586621679329140 <*> a6989586621679329141

type family (a6989586621679329140 :: f ((~>) a b)) <*>@#@$$$ (a6989586621679329141 :: f a) :: f b where ... infixl 4

Equations

a6989586621679329140 <*>@#@$$$ a6989586621679329141 = (<*>) a6989586621679329140 a6989586621679329141

data (*>@#@$) :: (~>) (f a) ((~>) (f b) (f b)) infixl 4

Instances

SApplicative f => SingI ((*>@#@$) :: TyFun (f a) (f b ~> f b) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing (*>@#@$)

SuppressUnusedWarnings ((*>@#@$) :: TyFun (f a) (f b ~> f b) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply ((*>@#@$) :: TyFun (f a) (f b ~> f b) -> Type) (a6989586621679329152 :: f a)

Defined in Control.Monad.Singletons.Internal

type Apply ((*>@#@$) :: TyFun (f a) (f b ~> f b) -> Type) (a6989586621679329152 :: f a) = (*>@#@$$) a6989586621679329152 :: TyFun (f b) (f b) -> Type

data (*>@#@$$) (a6989586621679329152 :: f a) :: (~>) (f b) (f b) infixl 4

Instances

SApplicative f => SingI1 ((*>@#@$$) :: f a -> TyFun (f b) (f b) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing ((*>@#@$$) x)

(SApplicative f, SingI d) => SingI ((*>@#@$$) d :: TyFun (f b) (f b) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing ((*>@#@$$) d)

SuppressUnusedWarnings ((*>@#@$$) a6989586621679329152 :: TyFun (f b) (f b) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply ((*>@#@$$) a6989586621679329152 :: TyFun (f b) (f b) -> Type) (a6989586621679329153 :: f b)

Defined in Control.Monad.Singletons.Internal

type Apply ((*>@#@$$) a6989586621679329152 :: TyFun (f b) (f b) -> Type) (a6989586621679329153 :: f b) = a6989586621679329152 *> a6989586621679329153

type family (a6989586621679329152 :: f a) *>@#@$$$ (a6989586621679329153 :: f b) :: f b where ... infixl 4

Equations

a6989586621679329152 *>@#@$$$ a6989586621679329153 = (*>) a6989586621679329152 a6989586621679329153

data (<*@#@$) :: (~>) (f a) ((~>) (f b) (f a)) infixl 4

Instances

SApplicative f => SingI ((<*@#@$) :: TyFun (f a) (f b ~> f a) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing (<*@#@$)

SuppressUnusedWarnings ((<*@#@$) :: TyFun (f a) (f b ~> f a) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply ((<*@#@$) :: TyFun (f a) (f b ~> f a) -> Type) (a6989586621679329157 :: f a)

Defined in Control.Monad.Singletons.Internal

type Apply ((<*@#@$) :: TyFun (f a) (f b ~> f a) -> Type) (a6989586621679329157 :: f a) = (<*@#@$$) a6989586621679329157 :: TyFun (f b) (f a) -> Type

data (<*@#@$$) (a6989586621679329157 :: f a) :: (~>) (f b) (f a) infixl 4

Instances

SApplicative f => SingI1 ((<*@#@$$) :: f a -> TyFun (f b) (f a) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing ((<*@#@$$) x)

(SApplicative f, SingI d) => SingI ((<*@#@$$) d :: TyFun (f b) (f a) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing ((<*@#@$$) d)

SuppressUnusedWarnings ((<*@#@$$) a6989586621679329157 :: TyFun (f b) (f a) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply ((<*@#@$$) a6989586621679329157 :: TyFun (f b) (f a) -> Type) (a6989586621679329158 :: f b)

Defined in Control.Monad.Singletons.Internal

type Apply ((<*@#@$$) a6989586621679329157 :: TyFun (f b) (f a) -> Type) (a6989586621679329158 :: f b) = a6989586621679329157 <* a6989586621679329158

type family (a6989586621679329157 :: f a) <*@#@$$$ (a6989586621679329158 :: f b) :: f a where ... infixl 4

Equations

a6989586621679329157 <*@#@$$$ a6989586621679329158 = (<*) a6989586621679329157 a6989586621679329158

type family EmptySym0 :: f a where ...

Equations

EmptySym0 = Empty

data (<|>@#@$) :: (~>) (f a) ((~>) (f a) (f a)) infixl 3

Instances

SAlternative f => SingI ((<|>@#@$) :: TyFun (f a) (f a ~> f a) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing (<|>@#@$)

SuppressUnusedWarnings ((<|>@#@$) :: TyFun (f a) (f a ~> f a) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply ((<|>@#@$) :: TyFun (f a) (f a ~> f a) -> Type) (a6989586621679329261 :: f a)

Defined in Control.Monad.Singletons.Internal

type Apply ((<|>@#@$) :: TyFun (f a) (f a ~> f a) -> Type) (a6989586621679329261 :: f a) = (<|>@#@$$) a6989586621679329261

data (<|>@#@$$) (a6989586621679329261 :: f a) :: (~>) (f a) (f a) infixl 3

Instances

SAlternative f => SingI1 ((<|>@#@$$) :: f a -> TyFun (f a) (f a) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing ((<|>@#@$$) x)

(SAlternative f, SingI d) => SingI ((<|>@#@$$) d :: TyFun (f a) (f a) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing ((<|>@#@$$) d)

SuppressUnusedWarnings ((<|>@#@$$) a6989586621679329261 :: TyFun (f a) (f a) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply ((<|>@#@$$) a6989586621679329261 :: TyFun (f a) (f a) -> Type) (a6989586621679329262 :: f a)

Defined in Control.Monad.Singletons.Internal

type Apply ((<|>@#@$$) a6989586621679329261 :: TyFun (f a) (f a) -> Type) (a6989586621679329262 :: f a) = a6989586621679329261 <|> a6989586621679329262

type family (a6989586621679329261 :: f a) <|>@#@$$$ (a6989586621679329262 :: f a) :: f a where ... infixl 3

Equations

a6989586621679329261 <|>@#@$$$ a6989586621679329262 = (<|>) a6989586621679329261 a6989586621679329262

data ConstSym0 z

Instances

SingI (ConstSym0 :: TyFun a (Const a b) -> Type)

Defined in Data.Functor.Const.Singletons

Methods

sing :: Sing ConstSym0

type Apply (ConstSym0 :: TyFun a (Const a b) -> Type) (x :: a)

Defined in Data.Functor.Const.Singletons

type Apply (ConstSym0 :: TyFun a (Const a b) -> Type) (x :: a) = 'Const x :: Const a b

type family ConstSym1 x where ...

Equations

ConstSym1 x = 'Const x

data GetConstSym0 :: (~>) (Const a b) a

Instances

SingI (GetConstSym0 :: TyFun (Const a b) a -> Type)

Defined in Data.Functor.Const.Singletons

Methods

sing :: Sing GetConstSym0

SuppressUnusedWarnings (GetConstSym0 :: TyFun (Const a b) a -> Type)

Defined in Data.Functor.Const.Singletons

Methods

suppressUnusedWarnings :: ()

type Apply (GetConstSym0 :: TyFun (Const a b) a -> Type) (a6989586621680742993 :: Const a b)

Defined in Data.Functor.Const.Singletons

type Apply (GetConstSym0 :: TyFun (Const a b) a -> Type) (a6989586621680742993 :: Const a b) = GetConst a6989586621680742993

type family GetConstSym1 (a6989586621680742993 :: Const a b) :: a where ...

Equations

GetConstSym1 a6989586621680742993 = GetConst a6989586621680742993

data (<$>@#@$) :: (~>) ((~>) a b) ((~>) (f a) (f b)) infixl 4

Instances

SFunctor f => SingI ((<$>@#@$) :: TyFun (a ~> b) (f a ~> f b) -> Type)

Defined in Data.Functor.Singletons

Methods

sing :: Sing (<$>@#@$)

SuppressUnusedWarnings ((<$>@#@$) :: TyFun (a ~> b) (f a ~> f b) -> Type)

Defined in Data.Functor.Singletons

Methods

suppressUnusedWarnings :: ()

type Apply ((<$>@#@$) :: TyFun (a ~> b) (f a ~> f b) -> Type) (a6989586621679519978 :: a ~> b)

Defined in Data.Functor.Singletons

type Apply ((<$>@#@$) :: TyFun (a ~> b) (f a ~> f b) -> Type) (a6989586621679519978 :: a ~> b) = (<$>@#@$$) a6989586621679519978 :: TyFun (f a) (f b) -> Type

data (<$>@#@$$) (a6989586621679519978 :: (~>) a b) :: (~>) (f a) (f b) infixl 4

Instances

SFunctor f => SingI1 ((<$>@#@$$) :: (a ~> b) -> TyFun (f a) (f b) -> Type)

Defined in Data.Functor.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing ((<$>@#@$$) x)

(SFunctor f, SingI d) => SingI ((<$>@#@$$) d :: TyFun (f a) (f b) -> Type)

Defined in Data.Functor.Singletons

Methods

sing :: Sing ((<$>@#@$$) d)

SuppressUnusedWarnings ((<$>@#@$$) a6989586621679519978 :: TyFun (f a) (f b) -> Type)

Defined in Data.Functor.Singletons

Methods

suppressUnusedWarnings :: ()

type Apply ((<$>@#@$$) a6989586621679519978 :: TyFun (f a) (f b) -> Type) (a6989586621679519979 :: f a)

Defined in Data.Functor.Singletons

type Apply ((<$>@#@$$) a6989586621679519978 :: TyFun (f a) (f b) -> Type) (a6989586621679519979 :: f a) = a6989586621679519978 <$> a6989586621679519979

type family (a6989586621679519978 :: (~>) a b) <$>@#@$$$ (a6989586621679519979 :: f a) :: f b where ... infixl 4

Equations

a6989586621679519978 <$>@#@$$$ a6989586621679519979 = (<$>) a6989586621679519978 a6989586621679519979

data (<$@#@$) :: (~>) a ((~>) (f b) (f a)) infixl 4

Instances

SFunctor f => SingI ((<$@#@$) :: TyFun a (f b ~> f a) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing (<$@#@$)

SuppressUnusedWarnings ((<$@#@$) :: TyFun a (f b ~> f a) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply ((<$@#@$) :: TyFun a (f b ~> f a) -> Type) (a6989586621679329117 :: a)

Defined in Control.Monad.Singletons.Internal

type Apply ((<$@#@$) :: TyFun a (f b ~> f a) -> Type) (a6989586621679329117 :: a) = (<$@#@$$) a6989586621679329117 :: TyFun (f b) (f a) -> Type

data (<$@#@$$) (a6989586621679329117 :: a) :: (~>) (f b) (f a) infixl 4

Instances

SFunctor f => SingI1 ((<$@#@$$) :: a -> TyFun (f b) (f a) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing ((<$@#@$$) x)

(SFunctor f, SingI d) => SingI ((<$@#@$$) d :: TyFun (f b) (f a) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing ((<$@#@$$) d)

SuppressUnusedWarnings ((<$@#@$$) a6989586621679329117 :: TyFun (f b) (f a) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply ((<$@#@$$) a6989586621679329117 :: TyFun (f b) (f a) -> Type) (a6989586621679329118 :: f b)

Defined in Control.Monad.Singletons.Internal

type Apply ((<$@#@$$) a6989586621679329117 :: TyFun (f b) (f a) -> Type) (a6989586621679329118 :: f b) = a6989586621679329117 <$ a6989586621679329118

type family (a6989586621679329117 :: a) <$@#@$$$ (a6989586621679329118 :: f b) :: f a where ... infixl 4

Equations

a6989586621679329117 <$@#@$$$ a6989586621679329118 = (<$) a6989586621679329117 a6989586621679329118

data (<**>@#@$) :: (~>) (f a) ((~>) (f ((~>) a b)) (f b)) infixl 4

Instances

SApplicative f => SingI ((<**>@#@$) :: TyFun (f a) (f (a ~> b) ~> f b) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing (<**>@#@$)

SuppressUnusedWarnings ((<**>@#@$) :: TyFun (f a) (f (a ~> b) ~> f b) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply ((<**>@#@$) :: TyFun (f a) (f (a ~> b) ~> f b) -> Type) (a6989586621679329100 :: f a)

Defined in Control.Monad.Singletons.Internal

type Apply ((<**>@#@$) :: TyFun (f a) (f (a ~> b) ~> f b) -> Type) (a6989586621679329100 :: f a) = (<**>@#@$$) a6989586621679329100 :: TyFun (f (a ~> b)) (f b) -> Type

data (<**>@#@$$) (a6989586621679329100 :: f a) :: (~>) (f ((~>) a b)) (f b) infixl 4

Instances

SApplicative f => SingI1 ((<**>@#@$$) :: f a -> TyFun (f (a ~> b)) (f b) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing ((<**>@#@$$) x)

(SApplicative f, SingI d) => SingI ((<**>@#@$$) d :: TyFun (f (a ~> b)) (f b) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing ((<**>@#@$$) d)

SuppressUnusedWarnings ((<**>@#@$$) a6989586621679329100 :: TyFun (f (a ~> b)) (f b) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply ((<**>@#@$$) a6989586621679329100 :: TyFun (f (a ~> b)) (f b) -> Type) (a6989586621679329101 :: f (a ~> b))

Defined in Control.Monad.Singletons.Internal

type Apply ((<**>@#@$$) a6989586621679329100 :: TyFun (f (a ~> b)) (f b) -> Type) (a6989586621679329101 :: f (a ~> b)) = a6989586621679329100 <**> a6989586621679329101

type family (a6989586621679329100 :: f a) <**>@#@$$$ (a6989586621679329101 :: f ((~>) a b)) :: f b where ... infixl 4

Equations

a6989586621679329100 <**>@#@$$$ a6989586621679329101 = (<**>) a6989586621679329100 a6989586621679329101

data LiftASym0 :: (~>) ((~>) a b) ((~>) (f a) (f b))

Instances

SApplicative f => SingI (LiftASym0 :: TyFun (a ~> b) (f a ~> f b) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing LiftASym0

SuppressUnusedWarnings (LiftASym0 :: TyFun (a ~> b) (f a ~> f b) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply (LiftASym0 :: TyFun (a ~> b) (f a ~> f b) -> Type) (a6989586621679329089 :: a ~> b)

Defined in Control.Monad.Singletons.Internal

type Apply (LiftASym0 :: TyFun (a ~> b) (f a ~> f b) -> Type) (a6989586621679329089 :: a ~> b) = LiftASym1 a6989586621679329089 :: TyFun (f a) (f b) -> Type

data LiftASym1 (a6989586621679329089 :: (~>) a b) :: (~>) (f a) (f b)

Instances

SApplicative f => SingI1 (LiftASym1 :: (a ~> b) -> TyFun (f a) (f b) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (LiftASym1 x)

(SApplicative f, SingI d) => SingI (LiftASym1 d :: TyFun (f a) (f b) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing (LiftASym1 d)

SuppressUnusedWarnings (LiftASym1 a6989586621679329089 :: TyFun (f a) (f b) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply (LiftASym1 a6989586621679329089 :: TyFun (f a) (f b) -> Type) (a6989586621679329090 :: f a)

Defined in Control.Monad.Singletons.Internal

type Apply (LiftASym1 a6989586621679329089 :: TyFun (f a) (f b) -> Type) (a6989586621679329090 :: f a) = LiftA a6989586621679329089 a6989586621679329090

type family LiftASym2 (a6989586621679329089 :: (~>) a b) (a6989586621679329090 :: f a) :: f b where ...

Equations

LiftASym2 a6989586621679329089 a6989586621679329090 = LiftA a6989586621679329089 a6989586621679329090

data LiftA2Sym0 :: (~>) ((~>) a ((~>) b c)) ((~>) (f a) ((~>) (f b) (f c)))

Instances

SApplicative f => SingI (LiftA2Sym0 :: TyFun (a ~> (b ~> c)) (f a ~> (f b ~> f c)) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing LiftA2Sym0

SuppressUnusedWarnings (LiftA2Sym0 :: TyFun (a ~> (b ~> c)) (f a ~> (f b ~> f c)) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply (LiftA2Sym0 :: TyFun (a ~> (b ~> c)) (f a ~> (f b ~> f c)) -> Type) (a6989586621679329146 :: a ~> (b ~> c))

Defined in Control.Monad.Singletons.Internal

type Apply (LiftA2Sym0 :: TyFun (a ~> (b ~> c)) (f a ~> (f b ~> f c)) -> Type) (a6989586621679329146 :: a ~> (b ~> c)) = LiftA2Sym1 a6989586621679329146 :: TyFun (f a) (f b ~> f c) -> Type

data LiftA2Sym1 (a6989586621679329146 :: (~>) a ((~>) b c)) :: (~>) (f a) ((~>) (f b) (f c))

Instances

SApplicative f => SingI1 (LiftA2Sym1 :: (a ~> (b ~> c)) -> TyFun (f a) (f b ~> f c) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (LiftA2Sym1 x)

(SApplicative f, SingI d) => SingI (LiftA2Sym1 d :: TyFun (f a) (f b ~> f c) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing (LiftA2Sym1 d)

SuppressUnusedWarnings (LiftA2Sym1 a6989586621679329146 :: TyFun (f a) (f b ~> f c) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply (LiftA2Sym1 a6989586621679329146 :: TyFun (f a) (f b ~> f c) -> Type) (a6989586621679329147 :: f a)

Defined in Control.Monad.Singletons.Internal

type Apply (LiftA2Sym1 a6989586621679329146 :: TyFun (f a) (f b ~> f c) -> Type) (a6989586621679329147 :: f a) = LiftA2Sym2 a6989586621679329146 a6989586621679329147

data LiftA2Sym2 (a6989586621679329146 :: (~>) a ((~>) b c)) (a6989586621679329147 :: f a) :: (~>) (f b) (f c)

Instances

(SApplicative f, SingI d) => SingI1 (LiftA2Sym2 d :: f a -> TyFun (f b) (f c) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (LiftA2Sym2 d x)

SApplicative f => SingI2 (LiftA2Sym2 :: (a ~> (b ~> c)) -> f a -> TyFun (f b) (f c) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (LiftA2Sym2 x y)

(SApplicative f, SingI d1, SingI d2) => SingI (LiftA2Sym2 d1 d2 :: TyFun (f b) (f c) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing (LiftA2Sym2 d1 d2)

SuppressUnusedWarnings (LiftA2Sym2 a6989586621679329146 a6989586621679329147 :: TyFun (f b) (f c) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply (LiftA2Sym2 a6989586621679329146 a6989586621679329147 :: TyFun (f b) (f c) -> Type) (a6989586621679329148 :: f b)

Defined in Control.Monad.Singletons.Internal

type Apply (LiftA2Sym2 a6989586621679329146 a6989586621679329147 :: TyFun (f b) (f c) -> Type) (a6989586621679329148 :: f b) = LiftA2 a6989586621679329146 a6989586621679329147 a6989586621679329148

type family LiftA2Sym3 (a6989586621679329146 :: (~>) a ((~>) b c)) (a6989586621679329147 :: f a) (a6989586621679329148 :: f b) :: f c where ...

Equations

LiftA2Sym3 a6989586621679329146 a6989586621679329147 a6989586621679329148 = LiftA2 a6989586621679329146 a6989586621679329147 a6989586621679329148

data LiftA3Sym0 :: (~>) ((~>) a ((~>) b ((~>) c d))) ((~>) (f a) ((~>) (f b) ((~>) (f c) (f d))))

Instances

SApplicative f => SingI (LiftA3Sym0 :: TyFun (a ~> (b ~> (c ~> d))) (f a ~> (f b ~> (f c ~> f d))) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing LiftA3Sym0

SuppressUnusedWarnings (LiftA3Sym0 :: TyFun (a ~> (b ~> (c ~> d))) (f a ~> (f b ~> (f c ~> f d))) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply (LiftA3Sym0 :: TyFun (a ~> (b ~> (c ~> d))) (f a ~> (f b ~> (f c ~> f d))) -> Type) (a6989586621679329078 :: a ~> (b ~> (c ~> d)))

Defined in Control.Monad.Singletons.Internal

type Apply (LiftA3Sym0 :: TyFun (a ~> (b ~> (c ~> d))) (f a ~> (f b ~> (f c ~> f d))) -> Type) (a6989586621679329078 :: a ~> (b ~> (c ~> d))) = LiftA3Sym1 a6989586621679329078 :: TyFun (f a) (f b ~> (f c ~> f d)) -> Type

data LiftA3Sym1 (a6989586621679329078 :: (~>) a ((~>) b ((~>) c d))) :: (~>) (f a) ((~>) (f b) ((~>) (f c) (f d)))

Instances

SApplicative f => SingI1 (LiftA3Sym1 :: (a ~> (b ~> (c ~> d))) -> TyFun (f a) (f b ~> (f c ~> f d)) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (LiftA3Sym1 x)

(SApplicative f, SingI d2) => SingI (LiftA3Sym1 d2 :: TyFun (f a) (f b ~> (f c ~> f d1)) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing (LiftA3Sym1 d2)

SuppressUnusedWarnings (LiftA3Sym1 a6989586621679329078 :: TyFun (f a) (f b ~> (f c ~> f d)) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply (LiftA3Sym1 a6989586621679329078 :: TyFun (f a) (f b ~> (f c ~> f d)) -> Type) (a6989586621679329079 :: f a)

Defined in Control.Monad.Singletons.Internal

type Apply (LiftA3Sym1 a6989586621679329078 :: TyFun (f a) (f b ~> (f c ~> f d)) -> Type) (a6989586621679329079 :: f a) = LiftA3Sym2 a6989586621679329078 a6989586621679329079

data LiftA3Sym2 (a6989586621679329078 :: (~>) a ((~>) b ((~>) c d))) (a6989586621679329079 :: f a) :: (~>) (f b) ((~>) (f c) (f d))

Instances

(SApplicative f, SingI d2) => SingI1 (LiftA3Sym2 d2 :: f a -> TyFun (f b) (f c ~> f d1) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (LiftA3Sym2 d2 x)

SApplicative f => SingI2 (LiftA3Sym2 :: (a ~> (b ~> (c ~> d))) -> f a -> TyFun (f b) (f c ~> f d) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (LiftA3Sym2 x y)

(SApplicative f, SingI d2, SingI d3) => SingI (LiftA3Sym2 d2 d3 :: TyFun (f b) (f c ~> f d1) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing (LiftA3Sym2 d2 d3)

SuppressUnusedWarnings (LiftA3Sym2 a6989586621679329078 a6989586621679329079 :: TyFun (f b) (f c ~> f d) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply (LiftA3Sym2 a6989586621679329078 a6989586621679329079 :: TyFun (f b) (f c ~> f d) -> Type) (a6989586621679329080 :: f b)

Defined in Control.Monad.Singletons.Internal

type Apply (LiftA3Sym2 a6989586621679329078 a6989586621679329079 :: TyFun (f b) (f c ~> f d) -> Type) (a6989586621679329080 :: f b) = LiftA3Sym3 a6989586621679329078 a6989586621679329079 a6989586621679329080

data LiftA3Sym3 (a6989586621679329078 :: (~>) a ((~>) b ((~>) c d))) (a6989586621679329079 :: f a) (a6989586621679329080 :: f b) :: (~>) (f c) (f d)

Instances

(SApplicative f, SingI d2) => SingI2 (LiftA3Sym3 d2 :: f a -> f b -> TyFun (f c) (f d1) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (LiftA3Sym3 d2 x y)

(SApplicative f, SingI d2, SingI d3) => SingI1 (LiftA3Sym3 d2 d3 :: f b -> TyFun (f c) (f d1) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (LiftA3Sym3 d2 d3 x)

(SApplicative f, SingI d2, SingI d3, SingI d4) => SingI (LiftA3Sym3 d2 d3 d4 :: TyFun (f c) (f d1) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing (LiftA3Sym3 d2 d3 d4)

SuppressUnusedWarnings (LiftA3Sym3 a6989586621679329078 a6989586621679329079 a6989586621679329080 :: TyFun (f c) (f d) -> Type)

Defined in Control.Monad.Singletons.Internal

Methods

suppressUnusedWarnings :: ()

type Apply (LiftA3Sym3 a6989586621679329078 a6989586621679329079 a6989586621679329080 :: TyFun (f c) (f d) -> Type) (a6989586621679329081 :: f c)

Defined in Control.Monad.Singletons.Internal

type Apply (LiftA3Sym3 a6989586621679329078 a6989586621679329079 a6989586621679329080 :: TyFun (f c) (f d) -> Type) (a6989586621679329081 :: f c) = LiftA3 a6989586621679329078 a6989586621679329079 a6989586621679329080 a6989586621679329081

data OptionalSym0 :: (~>) (f a) (f (Maybe a))

Instances

SAlternative f => SingI (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type)

Defined in Control.Applicative.Singletons

Methods

sing :: Sing OptionalSym0

SuppressUnusedWarnings (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type)

Defined in Control.Applicative.Singletons

Methods

suppressUnusedWarnings :: ()

type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621681322870 :: f a)

Defined in Control.Applicative.Singletons

type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621681322870 :: f a) = Optional a6989586621681322870

type family OptionalSym1 (a6989586621681322870 :: f a) :: f (Maybe a) where ...

Equations

OptionalSym1 a6989586621681322870 = Optional a6989586621681322870

Orphan instances

PApplicative Down

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

SApplicative Down

Methods

sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a b (t1 :: Down (a ~> b)) (t2 :: Down a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Down a) (t3 :: Down b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a b (t1 :: Down a) (t2 :: Down b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a b (t1 :: Down a) (t2 :: Down b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)

PApplicative ((,) a)

Associated Types

type Pure arg :: f a

type arg <*> arg1 :: f b

type LiftA2 arg arg1 arg2 :: f c

type arg *> arg1 :: f b

type arg <* arg1 :: f a

SMonoid a => SApplicative ((,) a)

Methods

sPure :: forall a0 (t :: a0). Sing t -> Sing (Apply PureSym0 t)

(%<*>) :: forall a0 b (t1 :: (a, a0 ~> b)) (t2 :: (a, a0)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2)

sLiftA2 :: forall a0 b c (t1 :: a0 ~> (b ~> c)) (t2 :: (a, a0)) (t3 :: (a, b)). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3)

(%*>) :: forall a0 b (t1 :: (a, a0)) (t2 :: (a, b)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2)

(%<*) :: forall a0 b (t1 :: (a, a0)) (t2 :: (a, b)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2)