singletons-base-3.2: A promoted and singled version of the base library
Copyright(C) 2013 Richard Eisenberg
LicenseBSD-style (see LICENSE)
MaintainerRyan Scott
Stabilityexperimental
Portabilitynon-portable
Safe HaskellSafe-Inferred
LanguageGHC2021

Prelude.Singletons

Description

Mimics the Haskell Prelude, but with singleton types. Includes the basic singleton definitions. Note: This is currently very incomplete!

Because many of these definitions are produced by Template Haskell, it is not possible to create proper Haddock documentation. Also, please excuse the apparent repeated variable names. This is due to an interaction between Template Haskell and Haddock.

Synopsis

Basic singleton definitions

Promoted and singled types, classes, and related functions

Basic data types

data SBool :: Bool -> Type where Source #

Constructors

SFalse :: SBool ('False :: Bool) 
STrue :: SBool ('True :: Bool) 

Instances

Instances details
TestCoercion SBool Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

testCoercion :: forall (a :: k) (b :: k). SBool a -> SBool b -> Maybe (Coercion a b)

TestEquality SBool Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

testEquality :: forall (a :: k) (b :: k). SBool a -> SBool b -> Maybe (a :~: b)

Show (SBool z) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

showsPrec :: Int -> SBool z -> ShowS

show :: SBool z -> String

showList :: [SBool z] -> ShowS

type family If (cond :: Bool) (tru :: k) (fls :: k) :: k where ... #

Equations

If 'True (tru :: k) (fls :: k) = tru 
If 'False (tru :: k) (fls :: k) = fls 

sIf :: Sing a -> Sing b -> Sing c -> Sing (If a b c) Source #

Conditional over singletons

type family (a :: Bool) && (b :: Bool) :: Bool where ... #

Equations

'False && a = 'False 
'True && a = a 
a && 'False = 'False 
a && 'True = a 
a && a = a 

(%&&) :: Sing a -> Sing b -> Sing (a && b) infixr 3 Source #

Conjunction of singletons

type family (a :: Bool) || (b :: Bool) :: Bool where ... #

Equations

'False || a = a 
'True || a = 'True 
a || 'False = a 
a || 'True = 'True 
a || a = a 

(%||) :: Sing a -> Sing b -> Sing (a || b) infixr 2 Source #

Disjunction of singletons

type family Not (a :: Bool) = (res :: Bool) | res -> a where ... #

Equations

Not 'False = 'True 
Not 'True = 'False 

sNot :: Sing a -> Sing (Not a) Source #

Negation of a singleton

type family Otherwise :: Bool where ... Source #

Equations

Otherwise = TrueSym0 

sOtherwise :: Sing (OtherwiseSym0 :: Bool) :: Type Source #

data SMaybe :: forall (a :: Type). Maybe a -> Type where Source #

Constructors

SNothing :: forall (a :: Type). SMaybe ('Nothing :: Maybe (a :: Type)) 
SJust :: forall (a :: Type) (n :: a). (Sing n) -> SMaybe ('Just n :: Maybe (a :: Type)) 

Instances

Instances details
SDecide a => TestCoercion (SMaybe :: Maybe a -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

testCoercion :: forall (a0 :: k) (b :: k). SMaybe a0 -> SMaybe b -> Maybe (Coercion a0 b)

SDecide a => TestEquality (SMaybe :: Maybe a -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

testEquality :: forall (a0 :: k) (b :: k). SMaybe a0 -> SMaybe b -> Maybe (a0 :~: b)

ShowSing a => Show (SMaybe z) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

showsPrec :: Int -> SMaybe z -> ShowS

show :: SMaybe z -> String

showList :: [SMaybe z] -> ShowS

maybe_ is a reimplementation of the maybe function with a different name to avoid clashing with the Maybe data type when promoted.

maybe_ :: b -> (a -> b) -> Maybe a -> b Source #

type family Maybe_ (a :: b) (a :: (~>) a b) (a :: Maybe a) :: b where ... Source #

Equations

Maybe_ n _ 'Nothing = n 
Maybe_ _ f ('Just x) = Apply f x 

sMaybe_ :: forall (t :: b) (t :: (~>) a b) (t :: Maybe a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Maybe_Sym0 t) t) t :: b) :: Type Source #

data SEither :: forall (a :: Type) (b :: Type). Either a b -> Type where Source #

Constructors

SLeft :: forall (a :: Type) (b :: Type) (n :: a). (Sing n) -> SEither ('Left n :: Either (a :: Type) (b :: Type)) 
SRight :: forall (a :: Type) (b :: Type) (n :: b). (Sing n) -> SEither ('Right n :: Either (a :: Type) (b :: Type)) 

Instances

Instances details
(SDecide a, SDecide b) => TestCoercion (SEither :: Either a b -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

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

(SDecide a, SDecide b) => TestEquality (SEither :: Either a b -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

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

(ShowSing a, ShowSing b) => Show (SEither z) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

showsPrec :: Int -> SEither z -> ShowS

show :: SEither z -> String

showList :: [SEither z] -> ShowS

either_ is a reimplementation of the either function with a different name to avoid clashing with the Either data type when promoted.

either_ :: (a -> c) -> (b -> c) -> Either a b -> c Source #

type family Either_ (a :: (~>) a c) (a :: (~>) b c) (a :: Either a b) :: c where ... Source #

Equations

Either_ f _ ('Left x) = Apply f x 
Either_ _ g ('Right y) = Apply g y 

sEither_ :: forall (t :: (~>) a c) (t :: (~>) b c) (t :: Either a b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Either_Sym0 t) t) t :: c) :: Type Source #

data SOrdering :: Ordering -> Type where Source #

Constructors

SLT :: SOrdering ('LT :: Ordering) 
SEQ :: SOrdering ('EQ :: Ordering) 
SGT :: SOrdering ('GT :: Ordering) 

Instances

Instances details
TestCoercion SOrdering Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

testCoercion :: forall (a :: k) (b :: k). SOrdering a -> SOrdering b -> Maybe (Coercion a b)

TestEquality SOrdering Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

testEquality :: forall (a :: k) (b :: k). SOrdering a -> SOrdering b -> Maybe (a :~: b)

Show (SOrdering z) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

showsPrec :: Int -> SOrdering z -> ShowS

show :: SOrdering z -> String

showList :: [SOrdering z] -> ShowS

data SChar (s :: Char) #

Instances

Instances details
TestCoercion SChar 
Instance details

Defined in GHC.TypeLits

Methods

testCoercion :: forall (a :: k) (b :: k). SChar a -> SChar b -> Maybe (Coercion a b)

TestEquality SChar 
Instance details

Defined in GHC.TypeLits

Methods

testEquality :: forall (a :: k) (b :: k). SChar a -> SChar b -> Maybe (a :~: b)

Show (SChar c) 
Instance details

Defined in GHC.TypeLits

Methods

showsPrec :: Int -> SChar c -> ShowS

show :: SChar c -> String

showList :: [SChar c] -> ShowS

data Symbol #

Instances

Instances details
IsString Symbol 
Instance details

Defined in GHC.TypeLits.Singletons

Methods

fromString :: String -> Symbol

Monoid Symbol 
Instance details

Defined in GHC.TypeLits.Singletons

Semigroup Symbol 
Instance details

Defined in GHC.TypeLits.Singletons

Methods

(<>) :: Symbol -> Symbol -> Symbol

sconcat :: NonEmpty Symbol -> Symbol

stimes :: Integral b => b -> Symbol -> Symbol

SingKind Symbol 
Instance details

Defined in GHC.Generics

Associated Types

type DemoteRep Symbol

Methods

fromSing :: forall (a :: Symbol). Sing a -> DemoteRep Symbol

Show Symbol 
Instance details

Defined in GHC.TypeLits.Singletons

Methods

showsPrec :: Int -> Symbol -> ShowS

show :: Symbol -> String

showList :: [Symbol] -> ShowS

Eq Symbol

This bogus instance is helpful for people who want to define functions over Symbols that will only be used at the type level or as singletons.

Instance details

Defined in GHC.TypeLits.Singletons

Methods

(==) :: Symbol -> Symbol -> Bool

(/=) :: Symbol -> Symbol -> Bool

Ord Symbol 
Instance details

Defined in GHC.TypeLits.Singletons

Methods

compare :: Symbol -> Symbol -> Ordering

(<) :: Symbol -> Symbol -> Bool

(<=) :: Symbol -> Symbol -> Bool

(>) :: Symbol -> Symbol -> Bool

(>=) :: Symbol -> Symbol -> Bool

max :: Symbol -> Symbol -> Symbol

min :: Symbol -> Symbol -> Symbol

SingKind PErrorMessage Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

Associated Types

type Demote PErrorMessage = (r :: Type) #

SingKind Symbol Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Associated Types

type Demote Symbol = (r :: Type) #

Methods

fromSing :: forall (a :: Symbol). Sing a -> Demote Symbol #

toSing :: Demote Symbol -> SomeSing Symbol #

SDecide Symbol Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Methods

(%~) :: forall (a :: Symbol) (b :: Symbol). Sing a -> Sing b -> Decision (a :~: b) #

PEq Symbol Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

SEq Symbol Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Methods

(%==) :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply (==@#@$) t1) t2) Source #

(%/=) :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply (/=@#@$) t1) t2) Source #

PMonoid Symbol Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

SMonoid Symbol Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [Symbol]). Sing t -> Sing (Apply MconcatSym0 t) Source #

POrd Symbol Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

SOrd Symbol Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Methods

sCompare :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

(%<) :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) Source #

(%<=) :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) Source #

(%>) :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) Source #

(%>=) :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) Source #

sMax :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

PSemigroup Symbol Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

SSemigroup Symbol Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Methods

(%<>) :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) Source #

sSconcat :: forall (t :: NonEmpty Symbol). Sing t -> Sing (Apply SconcatSym0 t) Source #

PIsString Symbol Source # 
Instance details

Defined in Data.String.Singletons

Associated Types

type FromString arg :: a Source #

SIsString Symbol Source # 
Instance details

Defined in Data.String.Singletons

Methods

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

PShow Symbol Source # 
Instance details

Defined in Text.Show.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

SShow Symbol Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: Symbol) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: Symbol). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [Symbol]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

TestCoercion SSymbol 
Instance details

Defined in GHC.TypeLits

Methods

testCoercion :: forall (a :: k) (b :: k). SSymbol a -> SSymbol b -> Maybe (Coercion a b)

TestEquality SSymbol 
Instance details

Defined in GHC.TypeLits

Methods

testEquality :: forall (a :: k) (b :: k). SSymbol a -> SSymbol b -> Maybe (a :~: b)

KnownSymbol a => SingI (a :: Symbol) 
Instance details

Defined in GHC.Generics

Methods

sing :: Sing a

KnownSymbol n => SingI (n :: Symbol) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Methods

sing :: Sing n #

SingI2 ('(:$$:) :: ErrorMessage' Symbol -> ErrorMessage' Symbol -> ErrorMessage' Symbol) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (x ':$$: y) #

SingI2 ('(:<>:) :: ErrorMessage' Symbol -> ErrorMessage' Symbol -> ErrorMessage' Symbol) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (x ':<>: y) #

SingI1 ('Text :: Symbol -> ErrorMessage' Symbol) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

Methods

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

SingI e1 => SingI1 ('(:$$:) e1 :: ErrorMessage' Symbol -> ErrorMessage' Symbol) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (e1 ':$$: x) #

SingI e1 => SingI1 ('(:<>:) e1 :: ErrorMessage' Symbol -> ErrorMessage' Symbol) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (e1 ':<>: x) #

SingI1 ('ShowType :: t -> ErrorMessage' Symbol) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

Methods

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

SShow a => SingI2 (ShowsPrecSym2 :: Natural -> a -> TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

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

SingI t => SingI ('Text t :: ErrorMessage' Symbol) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

Methods

sing :: Sing ('Text t) #

SingI1 ShowParenSym1 Source # 
Instance details

Defined in Text.Show.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ShowParenSym1 x) #

SingI1 ShowCharSym1 Source # 
Instance details

Defined in Text.Show.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ShowCharSym1 x) #

SingI1 ConsSymbolSym1 Source # 
Instance details

Defined in GHC.TypeLits.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ConsSymbolSym1 x) #

SingI1 ShowStringSym1 Source # 
Instance details

Defined in Text.Show.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ShowStringSym1 x) #

SingI1 ((:$$:@#@$$) :: ErrorMessage' Symbol -> TyFun (ErrorMessage' Symbol) (ErrorMessage' Symbol) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

Methods

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

SingI1 ((:<>:@#@$$) :: ErrorMessage' Symbol -> TyFun (ErrorMessage' Symbol) (ErrorMessage' Symbol) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

Methods

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

SShow a => SingI1 (ShowsPrecSym1 :: Natural -> TyFun a (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ShowsPrecSym1 x) #

SShow a => SingI1 (ShowsSym1 :: a -> TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ShowsSym1 x) #

(SShow a, SingI d) => SingI1 (ShowsPrecSym2 d :: a -> TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

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

SingI2 ShowParenSym2 Source # 
Instance details

Defined in Text.Show.Singletons

Methods

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

(SingI e1, SingI e2) => SingI (e1 ':$$: e2 :: ErrorMessage' Symbol) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

Methods

sing :: Sing (e1 ':$$: e2) #

(SingI e1, SingI e2) => SingI (e1 ':<>: e2 :: ErrorMessage' Symbol) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

Methods

sing :: Sing (e1 ':<>: e2) #

SingI ty => SingI ('ShowType ty :: ErrorMessage' Symbol) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

Methods

sing :: Sing ('ShowType ty) #

SShow a => SingI1 (ShowListSym1 :: [a] -> TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ShowListSym1 x) #

SingI d => SingI1 (ShowListWithSym2 d :: [a] -> TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

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

SingI ShowParenSym0 Source # 
Instance details

Defined in Text.Show.Singletons

SingI ShowCharSym0 Source # 
Instance details

Defined in Text.Show.Singletons

SingI UnlinesSym0 Source # 
Instance details

Defined in Data.List.Singletons.Internal

SingI UnwordsSym0 Source # 
Instance details

Defined in Data.List.Singletons.Internal

SingI ShowStringSym0 Source # 
Instance details

Defined in Text.Show.Singletons

SingI ShowCommaSpaceSym0 Source # 
Instance details

Defined in Text.Show.Singletons

SingI ShowSpaceSym0 Source # 
Instance details

Defined in Text.Show.Singletons

SingI ConsSymbolSym0 Source # 
Instance details

Defined in GHC.TypeLits.Singletons

SingI UnconsSymbolSym0 Source # 
Instance details

Defined in GHC.TypeLits.Singletons

SuppressUnusedWarnings ShowParenSym0 Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings ConsSymbolSym0 Source # 
Instance details

Defined in GHC.TypeLits.Singletons

SuppressUnusedWarnings ShowCharSym0 Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings UnlinesSym0 Source # 
Instance details

Defined in Data.List.Singletons.Internal

SuppressUnusedWarnings UnwordsSym0 Source # 
Instance details

Defined in Data.List.Singletons.Internal

SuppressUnusedWarnings ShowStringSym0 Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings UnconsSymbolSym0 Source # 
Instance details

Defined in GHC.TypeLits.Singletons

SuppressUnusedWarnings KnownSymbolSym0 Source # 
Instance details

Defined in GHC.TypeLits.Singletons

SuppressUnusedWarnings ShowCommaSpaceSym0 Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings ShowSpaceSym0 Source # 
Instance details

Defined in Text.Show.Singletons

SingI d => SingI (ShowParenSym1 d :: TyFun (Symbol ~> Symbol) (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing (ShowParenSym1 d) #

SingI (ShowListWithSym0 :: TyFun (a ~> (Symbol ~> Symbol)) ([a] ~> (Symbol ~> Symbol)) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

SingI ((:$$:@#@$) :: TyFun (ErrorMessage' Symbol) (ErrorMessage' Symbol ~> ErrorMessage' Symbol) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

Methods

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

SingI ((:<>:@#@$) :: TyFun (ErrorMessage' Symbol) (ErrorMessage' Symbol ~> ErrorMessage' Symbol) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

Methods

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

SShow a => SingI (ShowsPrecSym0 :: TyFun Natural (a ~> (Symbol ~> Symbol)) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

SShow a => SingI (ShowListSym0 :: TyFun [a] (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

SingI (TextSym0 :: TyFun Symbol (ErrorMessage' Symbol) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

Methods

sing :: Sing TextSym0 #

SingI d => SingI (ShowCharSym1 d :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing (ShowCharSym1 d) #

SingI d => SingI (ShowStringSym1 d :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing (ShowStringSym1 d) #

SIsString a => SingI (FromStringSym0 :: TyFun Symbol a -> Type) Source # 
Instance details

Defined in Data.String.Singletons

SingI (ErrorSym0 :: TyFun Symbol a -> Type) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Methods

sing :: Sing ErrorSym0 #

SingI (ErrorWithoutStackTraceSym0 :: TyFun Symbol a -> Type) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

SShow a => SingI (ShowsSym0 :: TyFun a (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing ShowsSym0 #

SShow a => SingI (Show_Sym0 :: TyFun a Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing Show_Sym0 #

SingI (TypeErrorSym0 :: TyFun PErrorMessage a -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

SingI x => SingI (ConsSymbolSym1 x :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in GHC.TypeLits.Singletons

Methods

sing :: Sing (ConsSymbolSym1 x) #

SuppressUnusedWarnings (ShowParenSym1 a6989586621679965681 :: TyFun (Symbol ~> Symbol) (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings (ShowListWithSym0 :: TyFun (a ~> (Symbol ~> Symbol)) ([a] ~> (Symbol ~> Symbol)) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings (TypeErrorSym0 :: TyFun PErrorMessage a -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

SuppressUnusedWarnings (ShowsPrecSym0 :: TyFun Natural (a ~> (Symbol ~> Symbol)) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings (ShowListSym0 :: TyFun [a] (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings (ConsSymbolSym1 a6989586621679460905 :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in GHC.TypeLits.Singletons

SuppressUnusedWarnings (ShowCharSym1 a6989586621679965708 :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings (ShowStringSym1 a6989586621679965697 :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings (FromStringSym0 :: TyFun Symbol a -> Type) Source # 
Instance details

Defined in Data.String.Singletons

SuppressUnusedWarnings (ErrorSym0 :: TyFun Symbol a -> Type) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

SuppressUnusedWarnings (ErrorWithoutStackTraceSym0 :: TyFun Symbol a -> Type) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

SuppressUnusedWarnings (ShowsSym0 :: TyFun a (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings (Show_Sym0 :: TyFun a Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

SingI2 (ShowListWithSym2 :: (a ~> (Symbol ~> Symbol)) -> [a] -> TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

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

SingI x => SingI ((:$$:@#@$$) x :: TyFun (ErrorMessage' Symbol) (ErrorMessage' Symbol) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

Methods

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

SingI x => SingI ((:<>:@#@$$) x :: TyFun (ErrorMessage' Symbol) (ErrorMessage' Symbol) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

Methods

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

SingI d => SingI (ShowListWithSym1 d :: TyFun [a] (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing (ShowListWithSym1 d) #

(SShow a, SingI d) => SingI (ShowListSym1 d :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing (ShowListSym1 d) #

(SingI d1, SingI d2) => SingI (ShowParenSym2 d1 d2 :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing (ShowParenSym2 d1 d2) #

(SShow a, SingI d) => SingI (ShowsSym1 d :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing (ShowsSym1 d) #

(SShow a, SingI d) => SingI (ShowsPrecSym1 d :: TyFun a (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing (ShowsPrecSym1 d) #

SingI (ShowTypeSym0 :: TyFun t (ErrorMessage' Symbol) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

SuppressUnusedWarnings (ShowListWithSym1 a6989586621679965716 :: TyFun [a] (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings (ShowListSym1 a6989586621679965751 :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings (ShowParenSym2 a6989586621679965681 a6989586621679965682 :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings (ShowsSym1 a6989586621679965734 :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings (ShowsPrecSym1 a6989586621679965742 :: TyFun a (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

SingI d => SingI1 (ShowParenSym2 d :: (Symbol ~> Symbol) -> TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

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

SingI1 (ShowListWithSym1 :: (a ~> (Symbol ~> Symbol)) -> TyFun [a] (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ShowListWithSym1 x) #

(SingI d1, SingI d2) => SingI (ShowListWithSym2 d1 d2 :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing (ShowListWithSym2 d1 d2) #

(SShow a, SingI d1, SingI d2) => SingI (ShowsPrecSym2 d1 d2 :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing (ShowsPrecSym2 d1 d2) #

SuppressUnusedWarnings (ShowListWithSym2 a6989586621679965716 a6989586621679965717 :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings (ShowsPrecSym2 a6989586621679965742 a6989586621679965743 :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

type DemoteRep Symbol 
Instance details

Defined in GHC.Generics

type DemoteRep Symbol = String
data Sing (s :: Symbol) 
Instance details

Defined in GHC.Generics

data Sing (s :: Symbol) where
type Demote PErrorMessage Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

type Demote Symbol Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type Demote Symbol = Text
type Sing Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

type Sing Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type Sing = SSymbol
type Mempty Source # 
Instance details

Defined in Data.Monoid.Singletons

type Mempty
type Mconcat (arg :: [Symbol]) Source # 
Instance details

Defined in Data.Monoid.Singletons

type Mconcat (arg :: [Symbol])
type Sconcat (arg :: NonEmpty Symbol) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type Sconcat (arg :: NonEmpty Symbol)
type FromString a Source # 
Instance details

Defined in Data.String.Singletons

type FromString a = a
type Show_ (arg :: Symbol) Source # 
Instance details

Defined in Text.Show.Singletons

type Show_ (arg :: Symbol)
type Compare (a :: Symbol) (b :: Symbol) 
Instance details

Defined in Data.Type.Ord

type Compare (a :: Symbol) (b :: Symbol) = CmpSymbol a b
type (arg :: Symbol) /= (arg1 :: Symbol) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type (arg :: Symbol) /= (arg1 :: Symbol)
type (x :: Symbol) == (y :: Symbol) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type (x :: Symbol) == (y :: Symbol) = DefaultEq x y
type Mappend (arg1 :: Symbol) (arg2 :: Symbol) Source # 
Instance details

Defined in Data.Monoid.Singletons

type Mappend (arg1 :: Symbol) (arg2 :: Symbol)
type (arg :: Symbol) < (arg1 :: Symbol) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type (arg :: Symbol) < (arg1 :: Symbol)
type (arg :: Symbol) <= (arg1 :: Symbol) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type (arg :: Symbol) <= (arg1 :: Symbol)
type (arg :: Symbol) > (arg1 :: Symbol) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type (arg :: Symbol) > (arg1 :: Symbol)
type (arg :: Symbol) >= (arg1 :: Symbol) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type (arg :: Symbol) >= (arg1 :: Symbol)
type Compare (a :: Symbol) (b :: Symbol) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type Compare (a :: Symbol) (b :: Symbol) = CmpSymbol a b
type Max (arg :: Symbol) (arg1 :: Symbol) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type Max (arg :: Symbol) (arg1 :: Symbol)
type Min (arg :: Symbol) (arg1 :: Symbol) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type Min (arg :: Symbol) (arg1 :: Symbol)
type (a :: Symbol) <> (b :: Symbol) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type (a :: Symbol) <> (b :: Symbol) = AppendSymbol a b
type ShowList (arg1 :: [Symbol]) arg2 Source # 
Instance details

Defined in Text.Show.Singletons

type ShowList (arg1 :: [Symbol]) arg2
type Apply KnownSymbolSym0 (a6989586621679457771 :: Symbol) Source # 
Instance details

Defined in GHC.TypeLits.Singletons

type Apply KnownSymbolSym0 (a6989586621679457771 :: Symbol) = KnownSymbol a6989586621679457771
type Apply ShowCommaSpaceSym0 (a6989586621679965663 :: Symbol) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply ShowCommaSpaceSym0 (a6989586621679965663 :: Symbol) = ShowCommaSpace a6989586621679965663
type Apply ShowSpaceSym0 (a6989586621679965669 :: Symbol) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply ShowSpaceSym0 (a6989586621679965669 :: Symbol) = ShowSpace a6989586621679965669
type ShowsPrec _1 (s :: Symbol) x Source # 
Instance details

Defined in Text.Show.Singletons

type ShowsPrec _1 (s :: Symbol) x
type Apply (TypeErrorSym0 :: TyFun PErrorMessage k2 -> Type) (a6989586621679962195 :: PErrorMessage) Source # 
Instance details

Defined in Data.Singletons.Base.TypeError

type Apply (TypeErrorSym0 :: TyFun PErrorMessage k2 -> Type) (a6989586621679962195 :: PErrorMessage) = TypeError a6989586621679962195 :: k2
type Apply (ConsSymbolSym1 a6989586621679460905 :: TyFun Symbol Symbol -> Type) (a6989586621679460906 :: Symbol) Source # 
Instance details

Defined in GHC.TypeLits.Singletons

type Apply (ConsSymbolSym1 a6989586621679460905 :: TyFun Symbol Symbol -> Type) (a6989586621679460906 :: Symbol) = ConsSymbol a6989586621679460905 a6989586621679460906
type Apply (ShowCharSym1 a6989586621679965708 :: TyFun Symbol Symbol -> Type) (a6989586621679965709 :: Symbol) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowCharSym1 a6989586621679965708 :: TyFun Symbol Symbol -> Type) (a6989586621679965709 :: Symbol) = ShowChar a6989586621679965708 a6989586621679965709
type Apply (ShowStringSym1 a6989586621679965697 :: TyFun Symbol Symbol -> Type) (a6989586621679965698 :: Symbol) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowStringSym1 a6989586621679965697 :: TyFun Symbol Symbol -> Type) (a6989586621679965698 :: Symbol) = ShowString a6989586621679965697 a6989586621679965698
type Apply (FromStringSym0 :: TyFun Symbol k2 -> Type) (a6989586621680669107 :: Symbol) Source # 
Instance details

Defined in Data.String.Singletons

type Apply (FromStringSym0 :: TyFun Symbol k2 -> Type) (a6989586621680669107 :: Symbol) = FromString a6989586621680669107 :: k2
type Apply (ErrorSym0 :: TyFun Symbol k2 -> Type) (a6989586621679450964 :: Symbol) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type Apply (ErrorSym0 :: TyFun Symbol k2 -> Type) (a6989586621679450964 :: Symbol) = Error a6989586621679450964 :: k2
type Apply (ErrorWithoutStackTraceSym0 :: TyFun Symbol k2 -> Type) (a6989586621679451222 :: Symbol) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type Apply (ErrorWithoutStackTraceSym0 :: TyFun Symbol k2 -> Type) (a6989586621679451222 :: Symbol) = ErrorWithoutStackTrace a6989586621679451222 :: k2
type Apply (Show_Sym0 :: TyFun a Symbol -> Type) (a6989586621679965747 :: a) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (Show_Sym0 :: TyFun a Symbol -> Type) (a6989586621679965747 :: a) = Show_ a6989586621679965747
type Apply (ShowListSym1 a6989586621679965751 :: TyFun Symbol Symbol -> Type) (a6989586621679965752 :: Symbol) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowListSym1 a6989586621679965751 :: TyFun Symbol Symbol -> Type) (a6989586621679965752 :: Symbol) = ShowList a6989586621679965751 a6989586621679965752
type Apply (ShowParenSym2 a6989586621679965681 a6989586621679965682 :: TyFun Symbol Symbol -> Type) (a6989586621679965683 :: Symbol) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowParenSym2 a6989586621679965681 a6989586621679965682 :: TyFun Symbol Symbol -> Type) (a6989586621679965683 :: Symbol) = ShowParen a6989586621679965681 a6989586621679965682 a6989586621679965683
type Apply (ShowsSym1 a6989586621679965734 :: TyFun Symbol Symbol -> Type) (a6989586621679965735 :: Symbol) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowsSym1 a6989586621679965734 :: TyFun Symbol Symbol -> Type) (a6989586621679965735 :: Symbol) = Shows a6989586621679965734 a6989586621679965735
type Apply (ShowListWithSym2 a6989586621679965716 a6989586621679965717 :: TyFun Symbol Symbol -> Type) (a6989586621679965718 :: Symbol) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowListWithSym2 a6989586621679965716 a6989586621679965717 :: TyFun Symbol Symbol -> Type) (a6989586621679965718 :: Symbol) = ShowListWith a6989586621679965716 a6989586621679965717 a6989586621679965718
type Apply (ShowsPrecSym2 a6989586621679965742 a6989586621679965743 :: TyFun Symbol Symbol -> Type) (a6989586621679965744 :: Symbol) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowsPrecSym2 a6989586621679965742 a6989586621679965743 :: TyFun Symbol Symbol -> Type) (a6989586621679965744 :: Symbol) = ShowsPrec a6989586621679965742 a6989586621679965743 a6989586621679965744
type Apply UnconsSymbolSym0 (a6989586621679461421 :: Symbol) Source # 
Instance details

Defined in GHC.TypeLits.Singletons

type Apply UnconsSymbolSym0 (a6989586621679461421 :: Symbol) = UnconsSymbol a6989586621679461421
type Apply ShowParenSym0 (a6989586621679965681 :: Bool) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply ShowParenSym0 (a6989586621679965681 :: Bool) = ShowParenSym1 a6989586621679965681
type Apply ConsSymbolSym0 (a6989586621679460905 :: Char) Source # 
Instance details

Defined in GHC.TypeLits.Singletons

type Apply ConsSymbolSym0 (a6989586621679460905 :: Char) = ConsSymbolSym1 a6989586621679460905
type Apply ShowCharSym0 (a6989586621679965708 :: Char) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply ShowCharSym0 (a6989586621679965708 :: Char) = ShowCharSym1 a6989586621679965708
type Apply ShowStringSym0 (a6989586621679965697 :: Symbol) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply ShowStringSym0 (a6989586621679965697 :: Symbol) = ShowStringSym1 a6989586621679965697
type Apply (ShowsPrecSym0 :: TyFun Natural (a ~> (Symbol ~> Symbol)) -> Type) (a6989586621679965742 :: Natural) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowsPrecSym0 :: TyFun Natural (a ~> (Symbol ~> Symbol)) -> Type) (a6989586621679965742 :: Natural) = ShowsPrecSym1 a6989586621679965742 :: TyFun a (Symbol ~> Symbol) -> Type
type Apply (ShowsSym0 :: TyFun a (Symbol ~> Symbol) -> Type) (a6989586621679965734 :: a) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowsSym0 :: TyFun a (Symbol ~> Symbol) -> Type) (a6989586621679965734 :: a) = ShowsSym1 a6989586621679965734
type Apply (ShowsPrecSym1 a6989586621679965742 :: TyFun a (Symbol ~> Symbol) -> Type) (a6989586621679965743 :: a) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowsPrecSym1 a6989586621679965742 :: TyFun a (Symbol ~> Symbol) -> Type) (a6989586621679965743 :: a) = ShowsPrecSym2 a6989586621679965742 a6989586621679965743
type Apply UnlinesSym0 (a6989586621679653675 :: [Symbol]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply UnlinesSym0 (a6989586621679653675 :: [Symbol]) = Unlines a6989586621679653675
type Apply UnwordsSym0 (a6989586621679653665 :: [Symbol]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply UnwordsSym0 (a6989586621679653665 :: [Symbol]) = Unwords a6989586621679653665
type Apply (ShowListSym0 :: TyFun [a] (Symbol ~> Symbol) -> Type) (a6989586621679965751 :: [a]) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowListSym0 :: TyFun [a] (Symbol ~> Symbol) -> Type) (a6989586621679965751 :: [a]) = ShowListSym1 a6989586621679965751
type Apply (ShowListWithSym1 a6989586621679965716 :: TyFun [a] (Symbol ~> Symbol) -> Type) (a6989586621679965717 :: [a]) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowListWithSym1 a6989586621679965716 :: TyFun [a] (Symbol ~> Symbol) -> Type) (a6989586621679965717 :: [a]) = ShowListWithSym2 a6989586621679965716 a6989586621679965717
type Apply (ShowParenSym1 a6989586621679965681 :: TyFun (Symbol ~> Symbol) (Symbol ~> Symbol) -> Type) (a6989586621679965682 :: Symbol ~> Symbol) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowParenSym1 a6989586621679965681 :: TyFun (Symbol ~> Symbol) (Symbol ~> Symbol) -> Type) (a6989586621679965682 :: Symbol ~> Symbol) = ShowParenSym2 a6989586621679965681 a6989586621679965682
type Apply (ShowListWithSym0 :: TyFun (a ~> (Symbol ~> Symbol)) ([a] ~> (Symbol ~> Symbol)) -> Type) (a6989586621679965716 :: a ~> (Symbol ~> Symbol)) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowListWithSym0 :: TyFun (a ~> (Symbol ~> Symbol)) ([a] ~> (Symbol ~> Symbol)) -> Type) (a6989586621679965716 :: a ~> (Symbol ~> Symbol)) = ShowListWithSym1 a6989586621679965716

data SList :: forall (a :: Type). [a] -> Type where Source #

Constructors

SNil :: forall (a :: Type). SList ('[] :: [a :: Type]) 
SCons :: forall (a :: Type) (n :: a) (n :: [a]). (Sing n) -> (Sing n) -> SList ('(:) n n :: [a :: Type]) infixr 5 

Instances

Instances details
(SDecide a, SDecide [a]) => TestCoercion (SList :: [a] -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

testCoercion :: forall (a0 :: k) (b :: k). SList a0 -> SList b -> Maybe (Coercion a0 b)

(SDecide a, SDecide [a]) => TestEquality (SList :: [a] -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

testEquality :: forall (a0 :: k) (b :: k). SList a0 -> SList b -> Maybe (a0 :~: b)

(ShowSing a, ShowSing [a]) => Show (SList z) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

showsPrec :: Int -> SList z -> ShowS

show :: SList z -> String

showList :: [SList z] -> ShowS

Tuples

data STuple0 :: () -> Type where Source #

Constructors

STuple0 :: STuple0 ('() :: ()) 

Instances

Instances details
TestCoercion STuple0 Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

testCoercion :: forall (a :: k) (b :: k). STuple0 a -> STuple0 b -> Maybe (Coercion a b)

TestEquality STuple0 Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

testEquality :: forall (a :: k) (b :: k). STuple0 a -> STuple0 b -> Maybe (a :~: b)

Show (STuple0 z) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

showsPrec :: Int -> STuple0 z -> ShowS

show :: STuple0 z -> String

showList :: [STuple0 z] -> ShowS

data STuple2 :: forall (a :: Type) (b :: Type). (a, b) -> Type where Source #

Constructors

STuple2 :: forall (a :: Type) (b :: Type) (n :: a) (n :: b). (Sing n) -> (Sing n) -> STuple2 ('(n, n) :: (a :: Type, b :: Type)) 

Instances

Instances details
(SDecide a, SDecide b) => TestCoercion (STuple2 :: (a, b) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

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

(SDecide a, SDecide b) => TestEquality (STuple2 :: (a, b) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

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

(ShowSing a, ShowSing b) => Show (STuple2 z) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

showsPrec :: Int -> STuple2 z -> ShowS

show :: STuple2 z -> String

showList :: [STuple2 z] -> ShowS

data STuple3 :: forall (a :: Type) (b :: Type) (c :: Type). (a, b, c) -> Type where Source #

Constructors

STuple3 :: forall (a :: Type) (b :: Type) (c :: Type) (n :: a) (n :: b) (n :: c). (Sing n) -> (Sing n) -> (Sing n) -> STuple3 ('(n, n, n) :: (a :: Type, b :: Type, c :: Type)) 

Instances

Instances details
(SDecide a, SDecide b, SDecide c) => TestCoercion (STuple3 :: (a, b, c) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

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

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

Defined in Data.Singletons.Base.Instances

Methods

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

(ShowSing a, ShowSing b, ShowSing c) => Show (STuple3 z) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

showsPrec :: Int -> STuple3 z -> ShowS

show :: STuple3 z -> String

showList :: [STuple3 z] -> ShowS

data STuple4 :: forall (a :: Type) (b :: Type) (c :: Type) (d :: Type). (a, b, c, d) -> Type where Source #

Constructors

STuple4 :: forall (a :: Type) (b :: Type) (c :: Type) (d :: Type) (n :: a) (n :: b) (n :: c) (n :: d). (Sing n) -> (Sing n) -> (Sing n) -> (Sing n) -> STuple4 ('(n, n, n, n) :: (a :: Type, b :: Type, c :: Type, d :: Type)) 

Instances

Instances details
(SDecide a, SDecide b, SDecide c, SDecide d) => TestCoercion (STuple4 :: (a, b, c, d) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

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

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

Defined in Data.Singletons.Base.Instances

Methods

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

(ShowSing a, ShowSing b, ShowSing c, ShowSing d) => Show (STuple4 z) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

showsPrec :: Int -> STuple4 z -> ShowS

show :: STuple4 z -> String

showList :: [STuple4 z] -> ShowS

data STuple5 :: forall (a :: Type) (b :: Type) (c :: Type) (d :: Type) (e :: Type). (a, b, c, d, e) -> Type where Source #

Constructors

STuple5 :: forall (a :: Type) (b :: Type) (c :: Type) (d :: Type) (e :: Type) (n :: a) (n :: b) (n :: c) (n :: d) (n :: e). (Sing n) -> (Sing n) -> (Sing n) -> (Sing n) -> (Sing n) -> STuple5 ('(n, n, n, n, n) :: (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type)) 

Instances

Instances details
(SDecide a, SDecide b, SDecide c, SDecide d, SDecide e) => TestCoercion (STuple5 :: (a, b, c, d, e) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

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

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

Defined in Data.Singletons.Base.Instances

Methods

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

(ShowSing a, ShowSing b, ShowSing c, ShowSing d, ShowSing e) => Show (STuple5 z) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

showsPrec :: Int -> STuple5 z -> ShowS

show :: STuple5 z -> String

showList :: [STuple5 z] -> ShowS

data STuple6 :: forall (a :: Type) (b :: Type) (c :: Type) (d :: Type) (e :: Type) (f :: Type). (a, b, c, d, e, f) -> Type where Source #

Constructors

STuple6 :: forall (a :: Type) (b :: Type) (c :: Type) (d :: Type) (e :: Type) (f :: Type) (n :: a) (n :: b) (n :: c) (n :: d) (n :: e) (n :: f). (Sing n) -> (Sing n) -> (Sing n) -> (Sing n) -> (Sing n) -> (Sing n) -> STuple6 ('(n, n, n, n, n, n) :: (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type)) 

Instances

Instances details
(SDecide a, SDecide b, SDecide c, SDecide d, SDecide e, SDecide f) => TestCoercion (STuple6 :: (a, b, c, d, e, f) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

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

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

Defined in Data.Singletons.Base.Instances

Methods

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

(ShowSing a, ShowSing b, ShowSing c, ShowSing d, ShowSing e, ShowSing f) => Show (STuple6 z) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

showsPrec :: Int -> STuple6 z -> ShowS

show :: STuple6 z -> String

showList :: [STuple6 z] -> ShowS

data STuple7 :: forall (a :: Type) (b :: Type) (c :: Type) (d :: Type) (e :: Type) (f :: Type) (g :: Type). (a, b, c, d, e, f, g) -> Type where Source #

Constructors

STuple7 :: forall (a :: Type) (b :: Type) (c :: Type) (d :: Type) (e :: Type) (f :: Type) (g :: Type) (n :: a) (n :: b) (n :: c) (n :: d) (n :: e) (n :: f) (n :: g). (Sing n) -> (Sing n) -> (Sing n) -> (Sing n) -> (Sing n) -> (Sing n) -> (Sing n) -> STuple7 ('(n, n, n, n, n, n, n) :: (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type, g :: Type)) 

Instances

Instances details
(SDecide a, SDecide b, SDecide c, SDecide d, SDecide e, SDecide f, SDecide g) => TestCoercion (STuple7 :: (a, b, c, d, e, f, g) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

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

(SDecide a, SDecide b, SDecide c, SDecide d, SDecide e, SDecide f, SDecide g) => TestEquality (STuple7 :: (a, b, c, d, e, f, g) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

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

(ShowSing a, ShowSing b, ShowSing c, ShowSing d, ShowSing e, ShowSing f, ShowSing g) => Show (STuple7 z) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

showsPrec :: Int -> STuple7 z -> ShowS

show :: STuple7 z -> String

showList :: [STuple7 z] -> ShowS

type family Fst (a :: (a, b)) :: a where ... Source #

Equations

Fst '(x, _) = x 

sFst :: forall (t :: (a, b)). Sing t -> Sing (Apply FstSym0 t :: a) :: Type Source #

type family Snd (a :: (a, b)) :: b where ... Source #

Equations

Snd '(_, y) = y 

sSnd :: forall (t :: (a, b)). Sing t -> Sing (Apply SndSym0 t :: b) :: Type Source #

type family Curry (a :: (~>) (a, b) c) (a :: a) (a :: b) :: c where ... Source #

Equations

Curry f x y = Apply f (Apply (Apply Tuple2Sym0 x) y) 

sCurry :: forall (t :: (~>) (a, b) c) (t :: a) (t :: b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply CurrySym0 t) t) t :: c) :: Type Source #

type family Uncurry (a :: (~>) a ((~>) b c)) (a :: (a, b)) :: c where ... Source #

Equations

Uncurry f p = Apply (Apply f (Apply FstSym0 p)) (Apply SndSym0 p) 

sUncurry :: forall (t :: (~>) a ((~>) b c)) (t :: (a, b)). Sing t -> Sing t -> Sing (Apply (Apply UncurrySym0 t) t :: c) :: Type Source #

Basic type classes

class PEq a Source #

Associated Types

type (arg :: a) == (arg :: a) :: Bool infix 4 Source #

type a == a = Apply (Apply TFHelper_6989586621679109603Sym0 a) a

type (arg :: a) /= (arg :: a) :: Bool infix 4 Source #

type a /= a = Apply (Apply TFHelper_6989586621679109592Sym0 a) a

Instances

Instances details
PEq All Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq Any Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq Void Source # 
Instance details

Defined in Data.Eq.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq Ordering Source # 
Instance details

Defined in Data.Eq.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq Natural Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq () Source # 
Instance details

Defined in Data.Eq.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq Bool Source # 
Instance details

Defined in Data.Eq.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq Char Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq Symbol Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (Identity a) Source # 
Instance details

Defined in Data.Eq.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (First a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (Last a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (Down a) Source # 
Instance details

Defined in Data.Ord.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (First a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (Last a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (Max a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (Min a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (WrappedMonoid m) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (Dual a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (Product a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (Sum a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (NonEmpty a) Source # 
Instance details

Defined in Data.Eq.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (Maybe a) Source # 
Instance details

Defined in Data.Eq.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (TYPE rep) Source # 
Instance details

Defined in Data.Singletons.Base.TypeRepTYPE

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq [a] Source # 
Instance details

Defined in Data.Eq.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (Either a b) Source # 
Instance details

Defined in Data.Eq.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (Proxy s) Source # 
Instance details

Defined in Data.Proxy.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (Arg a b) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (a, b) Source # 
Instance details

Defined in Data.Eq.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (Const a b) Source # 
Instance details

Defined in Data.Functor.Const.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (a, b, c) Source # 
Instance details

Defined in Data.Eq.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (a, b, c, d) Source # 
Instance details

Defined in Data.Eq.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (a, b, c, d, e) Source # 
Instance details

Defined in Data.Eq.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (a, b, c, d, e, f) Source # 
Instance details

Defined in Data.Eq.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

PEq (a, b, c, d, e, f, g) Source # 
Instance details

Defined in Data.Eq.Singletons

Associated Types

type arg == arg1 :: Bool Source #

type arg /= arg1 :: Bool Source #

class SEq a where Source #

Minimal complete definition

Nothing

Methods

(%==) :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply (==@#@$) t) t :: Bool) :: Type infix 4 Source #

default (%==) :: forall (t :: a) (t :: a). (Apply (Apply (==@#@$) t) t :: Bool) ~ Apply (Apply TFHelper_6989586621679109603Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply (==@#@$) t) t :: Bool) :: Type Source #

(%/=) :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply (/=@#@$) t) t :: Bool) :: Type infix 4 Source #

default (%/=) :: forall (t :: a) (t :: a). (Apply (Apply (/=@#@$) t) t :: Bool) ~ Apply (Apply TFHelper_6989586621679109592Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply (/=@#@$) t) t :: Bool) :: Type Source #

Instances

Instances details
SEq Bool => SEq All Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

(%==) :: forall (t1 :: All) (t2 :: All). Sing t1 -> Sing t2 -> Sing (Apply (Apply (==@#@$) t1) t2) Source #

(%/=) :: forall (t1 :: All) (t2 :: All). Sing t1 -> Sing t2 -> Sing (Apply (Apply (/=@#@$) t1) t2) Source #

SEq Bool => SEq Any Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

(%==) :: forall (t1 :: Any) (t2 :: Any). Sing t1 -> Sing t2 -> Sing (Apply (Apply (==@#@$) t1) t2) Source #

(%/=) :: forall (t1 :: Any) (t2 :: Any). Sing t1 -> Sing t2 -> Sing (Apply (Apply (/=@#@$) t1) t2) Source #

SEq Void Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

(%==) :: forall (t1 :: Void) (t2 :: Void). Sing t1 -> Sing t2 -> Sing (Apply (Apply (==@#@$) t1) t2) Source #

(%/=) :: forall (t1 :: Void) (t2 :: Void). Sing t1 -> Sing t2 -> Sing (Apply (Apply (/=@#@$) t1) t2) Source #

SEq Ordering Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

(%==) :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply (==@#@$) t1) t2) Source #

(%/=) :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply (/=@#@$) t1) t2) Source #

SEq Natural Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Methods

(%==) :: forall (t1 :: Natural) (t2 :: Natural). Sing t1 -> Sing t2 -> Sing (Apply (Apply (==@#@$) t1) t2) Source #

(%/=) :: forall (t1 :: Natural) (t2 :: Natural). Sing t1 -> Sing t2 -> Sing (Apply (Apply (/=@#@$) t1) t2) Source #

SEq () Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

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

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

SEq Bool Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

(%==) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (==@#@$) t1) t2) Source #

(%/=) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (/=@#@$) t1) t2) Source #

SEq Char Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Methods

(%==) :: forall (t1 :: Char) (t2 :: Char). Sing t1 -> Sing t2 -> Sing (Apply (Apply (==@#@$) t1) t2) Source #

(%/=) :: forall (t1 :: Char) (t2 :: Char). Sing t1 -> Sing t2 -> Sing (Apply (Apply (/=@#@$) t1) t2) Source #

SEq Symbol Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Methods

(%==) :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply (==@#@$) t1) t2) Source #

(%/=) :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply (/=@#@$) t1) t2) Source #

SEq a => SEq (Identity a) Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

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

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

SEq (Maybe a) => SEq (First a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

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

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

SEq (Maybe a) => SEq (Last a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

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

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

SEq a => SEq (Down a) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

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

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

SEq a => SEq (First a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

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

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

SEq a => SEq (Last a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

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

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

SEq a => SEq (Max a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

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

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

SEq a => SEq (Min a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

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

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

SEq m => SEq (WrappedMonoid m) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

(%==) :: forall (t1 :: WrappedMonoid m) (t2 :: WrappedMonoid m). Sing t1 -> Sing t2 -> Sing (Apply (Apply (==@#@$) t1) t2) Source #

(%/=) :: forall (t1 :: WrappedMonoid m) (t2 :: WrappedMonoid m). Sing t1 -> Sing t2 -> Sing (Apply (Apply (/=@#@$) t1) t2) Source #

SEq a => SEq (Dual a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

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

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

SEq a => SEq (Product a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

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

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

SEq a => SEq (Sum a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

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

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

(SEq a, SEq [a]) => SEq (NonEmpty a) Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

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

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

SEq a => SEq (Maybe a) Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

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

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

SEq (TYPE rep) Source # 
Instance details

Defined in Data.Singletons.Base.TypeRepTYPE

Methods

(%==) :: forall (t1 :: TYPE rep) (t2 :: TYPE rep). Sing t1 -> Sing t2 -> Sing (Apply (Apply (==@#@$) t1) t2) Source #

(%/=) :: forall (t1 :: TYPE rep) (t2 :: TYPE rep). Sing t1 -> Sing t2 -> Sing (Apply (Apply (/=@#@$) t1) t2) Source #

(SEq a, SEq [a]) => SEq [a] Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

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

(%/=) :: forall (t1 :: [a]) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Apply (Apply (/=@#@$) t1) t2) Source #

(SEq a, SEq b) => SEq (Either a b) Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

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

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

SEq (Proxy s) Source # 
Instance details

Defined in Data.Proxy.Singletons

Methods

(%==) :: forall (t1 :: Proxy s) (t2 :: Proxy s). Sing t1 -> Sing t2 -> Sing (Apply (Apply (==@#@$) t1) t2) Source #

(%/=) :: forall (t1 :: Proxy s) (t2 :: Proxy s). Sing t1 -> Sing t2 -> Sing (Apply (Apply (/=@#@$) t1) t2) Source #

SEq a => SEq (Arg a b) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

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

(SEq a, SEq b) => SEq (a, b) Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

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

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

SEq a => SEq (Const a b) Source # 
Instance details

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) Source #

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

(SEq a, SEq b, SEq c) => SEq (a, b, c) Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

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

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

(SEq a, SEq b, SEq c, SEq d) => SEq (a, b, c, d) Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

(%==) :: forall (t1 :: (a, b, c, d)) (t2 :: (a, b, c, d)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (==@#@$) t1) t2) Source #

(%/=) :: forall (t1 :: (a, b, c, d)) (t2 :: (a, b, c, d)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (/=@#@$) t1) t2) Source #

(SEq a, SEq b, SEq c, SEq d, SEq e) => SEq (a, b, c, d, e) Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

(%==) :: forall (t1 :: (a, b, c, d, e)) (t2 :: (a, b, c, d, e)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (==@#@$) t1) t2) Source #

(%/=) :: forall (t1 :: (a, b, c, d, e)) (t2 :: (a, b, c, d, e)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (/=@#@$) t1) t2) Source #

(SEq a, SEq b, SEq c, SEq d, SEq e, SEq f) => SEq (a, b, c, d, e, f) Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

(%==) :: forall (t1 :: (a, b, c, d, e, f)) (t2 :: (a, b, c, d, e, f)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (==@#@$) t1) t2) Source #

(%/=) :: forall (t1 :: (a, b, c, d, e, f)) (t2 :: (a, b, c, d, e, f)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (/=@#@$) t1) t2) Source #

(SEq a, SEq b, SEq c, SEq d, SEq e, SEq f, SEq g) => SEq (a, b, c, d, e, f, g) Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

(%==) :: forall (t1 :: (a, b, c, d, e, f, g)) (t2 :: (a, b, c, d, e, f, g)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (==@#@$) t1) t2) Source #

(%/=) :: forall (t1 :: (a, b, c, d, e, f, g)) (t2 :: (a, b, c, d, e, f, g)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (/=@#@$) t1) t2) Source #

class POrd a Source #

Associated Types

type Compare (arg :: a) (arg :: a) :: Ordering Source #

type Compare a a = Apply (Apply Compare_6989586621679190403Sym0 a) a

type (arg :: a) < (arg :: a) :: Bool infix 4 Source #

type a < a = Apply (Apply TFHelper_6989586621679190424Sym0 a) a

type (arg :: a) <= (arg :: a) :: Bool infix 4 Source #

type a <= a = Apply (Apply TFHelper_6989586621679190440Sym0 a) a

type (arg :: a) > (arg :: a) :: Bool infix 4 Source #

type a > a = Apply (Apply TFHelper_6989586621679190456Sym0 a) a

type (arg :: a) >= (arg :: a) :: Bool infix 4 Source #

type a >= a = Apply (Apply TFHelper_6989586621679190472Sym0 a) a

type Max (arg :: a) (arg :: a) :: a Source #

type Max a a = Apply (Apply Max_6989586621679190488Sym0 a) a

type Min (arg :: a) (arg :: a) :: a Source #

type Min a a = Apply (Apply Min_6989586621679190504Sym0 a) a

Instances

Instances details
POrd All Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd Any Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd Void Source # 
Instance details

Defined in Data.Ord.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd Ordering Source # 
Instance details

Defined in Data.Ord.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd Natural Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd () Source # 
Instance details

Defined in Data.Ord.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd Bool Source # 
Instance details

Defined in Data.Ord.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd Char Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd Symbol Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (Identity a) Source # 
Instance details

Defined in Data.Ord.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (First a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (Last a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (Down a) Source # 
Instance details

Defined in Data.Ord.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (First a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (Last a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (Max a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (Min a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (WrappedMonoid m) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (Dual a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (Product a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (Sum a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (NonEmpty a) Source # 
Instance details

Defined in Data.Ord.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (Maybe a) Source # 
Instance details

Defined in Data.Ord.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd [a] Source # 
Instance details

Defined in Data.Ord.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (Either a b) Source # 
Instance details

Defined in Data.Ord.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (Proxy s) Source # 
Instance details

Defined in Data.Proxy.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (Arg a b) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (a, b) Source # 
Instance details

Defined in Data.Ord.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (Const a b) Source # 
Instance details

Defined in Data.Functor.Const.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (a, b, c) Source # 
Instance details

Defined in Data.Ord.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (a, b, c, d) Source # 
Instance details

Defined in Data.Ord.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (a, b, c, d, e) Source # 
Instance details

Defined in Data.Ord.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (a, b, c, d, e, f) Source # 
Instance details

Defined in Data.Ord.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

POrd (a, b, c, d, e, f, g) Source # 
Instance details

Defined in Data.Ord.Singletons

Associated Types

type Compare arg arg1 :: Ordering Source #

type arg < arg1 :: Bool Source #

type arg <= arg1 :: Bool Source #

type arg > arg1 :: Bool Source #

type arg >= arg1 :: Bool Source #

type Max arg arg1 :: a Source #

type Min arg arg1 :: a Source #

class SEq a => SOrd a where Source #

Minimal complete definition

Nothing

Methods

sCompare :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t :: Ordering) :: Type Source #

default sCompare :: forall (t :: a) (t :: a). (Apply (Apply CompareSym0 t) t :: Ordering) ~ Apply (Apply Compare_6989586621679190403Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t :: Ordering) :: Type Source #

(%<) :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t :: Bool) :: Type infix 4 Source #

default (%<) :: forall (t :: a) (t :: a). (Apply (Apply (<@#@$) t) t :: Bool) ~ Apply (Apply TFHelper_6989586621679190424Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t :: Bool) :: Type Source #

(%<=) :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t :: Bool) :: Type infix 4 Source #

default (%<=) :: forall (t :: a) (t :: a). (Apply (Apply (<=@#@$) t) t :: Bool) ~ Apply (Apply TFHelper_6989586621679190440Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t :: Bool) :: Type Source #

(%>) :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t :: Bool) :: Type infix 4 Source #

default (%>) :: forall (t :: a) (t :: a). (Apply (Apply (>@#@$) t) t :: Bool) ~ Apply (Apply TFHelper_6989586621679190456Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t :: Bool) :: Type Source #

(%>=) :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t :: Bool) :: Type infix 4 Source #

default (%>=) :: forall (t :: a) (t :: a). (Apply (Apply (>=@#@$) t) t :: Bool) ~ Apply (Apply TFHelper_6989586621679190472Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t :: Bool) :: Type Source #

sMax :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t :: a) :: Type Source #

default sMax :: forall (t :: a) (t :: a). (Apply (Apply MaxSym0 t) t :: a) ~ Apply (Apply Max_6989586621679190488Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t :: a) :: Type Source #

sMin :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t :: a) :: Type Source #

default sMin :: forall (t :: a) (t :: a). (Apply (Apply MinSym0 t) t :: a) ~ Apply (Apply Min_6989586621679190504Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t :: a) :: Type Source #

Instances

Instances details
SOrd Bool => SOrd All Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

sCompare :: forall (t1 :: All) (t2 :: All). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

(%<) :: forall (t1 :: All) (t2 :: All). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) Source #

(%<=) :: forall (t1 :: All) (t2 :: All). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) Source #

(%>) :: forall (t1 :: All) (t2 :: All). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) Source #

(%>=) :: forall (t1 :: All) (t2 :: All). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) Source #

sMax :: forall (t1 :: All) (t2 :: All). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: All) (t2 :: All). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd Bool => SOrd Any Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

sCompare :: forall (t1 :: Any) (t2 :: Any). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

(%<) :: forall (t1 :: Any) (t2 :: Any). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) Source #

(%<=) :: forall (t1 :: Any) (t2 :: Any). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) Source #

(%>) :: forall (t1 :: Any) (t2 :: Any). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) Source #

(%>=) :: forall (t1 :: Any) (t2 :: Any). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) Source #

sMax :: forall (t1 :: Any) (t2 :: Any). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Any) (t2 :: Any). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd Void Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sCompare :: forall (t1 :: Void) (t2 :: Void). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

(%<) :: forall (t1 :: Void) (t2 :: Void). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) Source #

(%<=) :: forall (t1 :: Void) (t2 :: Void). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) Source #

(%>) :: forall (t1 :: Void) (t2 :: Void). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) Source #

(%>=) :: forall (t1 :: Void) (t2 :: Void). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) Source #

sMax :: forall (t1 :: Void) (t2 :: Void). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Void) (t2 :: Void). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd Ordering Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sCompare :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

(%<) :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) Source #

(%<=) :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) Source #

(%>) :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) Source #

(%>=) :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) Source #

sMax :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd Natural Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Methods

sCompare :: forall (t1 :: Natural) (t2 :: Natural). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

(%<) :: forall (t1 :: Natural) (t2 :: Natural). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) Source #

(%<=) :: forall (t1 :: Natural) (t2 :: Natural). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) Source #

(%>) :: forall (t1 :: Natural) (t2 :: Natural). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) Source #

(%>=) :: forall (t1 :: Natural) (t2 :: Natural). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) Source #

sMax :: forall (t1 :: Natural) (t2 :: Natural). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Natural) (t2 :: Natural). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd () Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sCompare :: forall (t1 :: ()) (t2 :: ()). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

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

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

(%>) :: forall (t1 :: ()) (t2 :: ()). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) Source #

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

sMax :: forall (t1 :: ()) (t2 :: ()). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: ()) (t2 :: ()). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd Bool Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sCompare :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

(%<) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) Source #

(%<=) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) Source #

(%>) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) Source #

(%>=) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) Source #

sMax :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd Char Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Methods

sCompare :: forall (t1 :: Char) (t2 :: Char). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

(%<) :: forall (t1 :: Char) (t2 :: Char). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) Source #

(%<=) :: forall (t1 :: Char) (t2 :: Char). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) Source #

(%>) :: forall (t1 :: Char) (t2 :: Char). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) Source #

(%>=) :: forall (t1 :: Char) (t2 :: Char). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) Source #

sMax :: forall (t1 :: Char) (t2 :: Char). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Char) (t2 :: Char). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd Symbol Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Methods

sCompare :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

(%<) :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) Source #

(%<=) :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) Source #

(%>) :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) Source #

(%>=) :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) Source #

sMax :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd a => SOrd (Identity a) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sCompare :: forall (t1 :: Identity a) (t2 :: Identity a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

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

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

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

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

sMax :: forall (t1 :: Identity a) (t2 :: Identity a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Identity a) (t2 :: Identity a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd (Maybe a) => SOrd (First a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sCompare :: forall (t1 :: First a) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

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

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

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

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

sMax :: forall (t1 :: First a) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: First a) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd (Maybe a) => SOrd (Last a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sCompare :: forall (t1 :: Last a) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

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

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

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

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

sMax :: forall (t1 :: Last a) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Last a) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd a => SOrd (Down a) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sCompare :: forall (t1 :: Down a) (t2 :: Down a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

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

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

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

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

sMax :: forall (t1 :: Down a) (t2 :: Down a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Down a) (t2 :: Down a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd a => SOrd (First a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

sCompare :: forall (t1 :: First a) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

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

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

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

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

sMax :: forall (t1 :: First a) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: First a) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd a => SOrd (Last a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

sCompare :: forall (t1 :: Last a) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

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

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

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

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

sMax :: forall (t1 :: Last a) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Last a) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd a => SOrd (Max a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

sCompare :: forall (t1 :: Max a) (t2 :: Max a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

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

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

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

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

sMax :: forall (t1 :: Max a) (t2 :: Max a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Max a) (t2 :: Max a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd a => SOrd (Min a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

sCompare :: forall (t1 :: Min a) (t2 :: Min a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

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

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

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

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

sMax :: forall (t1 :: Min a) (t2 :: Min a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Min a) (t2 :: Min a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd m => SOrd (WrappedMonoid m) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

sCompare :: forall (t1 :: WrappedMonoid m) (t2 :: WrappedMonoid m). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

(%<) :: forall (t1 :: WrappedMonoid m) (t2 :: WrappedMonoid m). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) Source #

(%<=) :: forall (t1 :: WrappedMonoid m) (t2 :: WrappedMonoid m). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) Source #

(%>) :: forall (t1 :: WrappedMonoid m) (t2 :: WrappedMonoid m). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) Source #

(%>=) :: forall (t1 :: WrappedMonoid m) (t2 :: WrappedMonoid m). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) Source #

sMax :: forall (t1 :: WrappedMonoid m) (t2 :: WrappedMonoid m). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: WrappedMonoid m) (t2 :: WrappedMonoid m). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd a => SOrd (Dual a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

sCompare :: forall (t1 :: Dual a) (t2 :: Dual a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

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

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

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

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

sMax :: forall (t1 :: Dual a) (t2 :: Dual a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Dual a) (t2 :: Dual a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd a => SOrd (Product a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

sCompare :: forall (t1 :: Product a) (t2 :: Product a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

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

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

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

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

sMax :: forall (t1 :: Product a) (t2 :: Product a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Product a) (t2 :: Product a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd a => SOrd (Sum a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

sCompare :: forall (t1 :: Sum a) (t2 :: Sum a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

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

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

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

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

sMax :: forall (t1 :: Sum a) (t2 :: Sum a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Sum a) (t2 :: Sum a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

(SOrd a, SOrd [a]) => SOrd (NonEmpty a) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sCompare :: forall (t1 :: NonEmpty a) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

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

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

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

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

sMax :: forall (t1 :: NonEmpty a) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: NonEmpty a) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd a => SOrd (Maybe a) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sCompare :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

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

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

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

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

sMax :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

(SOrd a, SOrd [a]) => SOrd [a] Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sCompare :: forall (t1 :: [a]) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

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

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

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

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

sMax :: forall (t1 :: [a]) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: [a]) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

(SOrd a, SOrd b) => SOrd (Either a b) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sCompare :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

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

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

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

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

sMax :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd (Proxy s) Source # 
Instance details

Defined in Data.Proxy.Singletons

Methods

sCompare :: forall (t1 :: Proxy s) (t2 :: Proxy s). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

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

(%<=) :: forall (t1 :: Proxy s) (t2 :: Proxy s). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) Source #

(%>) :: forall (t1 :: Proxy s) (t2 :: Proxy s). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) Source #

(%>=) :: forall (t1 :: Proxy s) (t2 :: Proxy s). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) Source #

sMax :: forall (t1 :: Proxy s) (t2 :: Proxy s). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Proxy s) (t2 :: Proxy s). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd a => SOrd (Arg a b) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sCompare :: forall (t1 :: Arg a b) (t2 :: Arg a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

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

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

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

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

sMax :: forall (t1 :: Arg a b) (t2 :: Arg a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: Arg a b) (t2 :: Arg a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

(SOrd a, SOrd b) => SOrd (a, b) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sCompare :: forall (t1 :: (a, b)) (t2 :: (a, b)). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

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

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

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

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

sMax :: forall (t1 :: (a, b)) (t2 :: (a, b)). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: (a, b)) (t2 :: (a, b)). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

SOrd a => SOrd (Const a b) Source # 
Instance details

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) Source #

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

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

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

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

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

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

(SOrd a, SOrd b, SOrd c) => SOrd (a, b, c) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sCompare :: forall (t1 :: (a, b, c)) (t2 :: (a, b, c)). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

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

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

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

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

sMax :: forall (t1 :: (a, b, c)) (t2 :: (a, b, c)). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: (a, b, c)) (t2 :: (a, b, c)). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

(SOrd a, SOrd b, SOrd c, SOrd d) => SOrd (a, b, c, d) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sCompare :: forall (t1 :: (a, b, c, d)) (t2 :: (a, b, c, d)). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

(%<) :: forall (t1 :: (a, b, c, d)) (t2 :: (a, b, c, d)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) Source #

(%<=) :: forall (t1 :: (a, b, c, d)) (t2 :: (a, b, c, d)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) Source #

(%>) :: forall (t1 :: (a, b, c, d)) (t2 :: (a, b, c, d)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) Source #

(%>=) :: forall (t1 :: (a, b, c, d)) (t2 :: (a, b, c, d)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) Source #

sMax :: forall (t1 :: (a, b, c, d)) (t2 :: (a, b, c, d)). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: (a, b, c, d)) (t2 :: (a, b, c, d)). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

(SOrd a, SOrd b, SOrd c, SOrd d, SOrd e) => SOrd (a, b, c, d, e) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sCompare :: forall (t1 :: (a, b, c, d, e)) (t2 :: (a, b, c, d, e)). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

(%<) :: forall (t1 :: (a, b, c, d, e)) (t2 :: (a, b, c, d, e)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) Source #

(%<=) :: forall (t1 :: (a, b, c, d, e)) (t2 :: (a, b, c, d, e)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) Source #

(%>) :: forall (t1 :: (a, b, c, d, e)) (t2 :: (a, b, c, d, e)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) Source #

(%>=) :: forall (t1 :: (a, b, c, d, e)) (t2 :: (a, b, c, d, e)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) Source #

sMax :: forall (t1 :: (a, b, c, d, e)) (t2 :: (a, b, c, d, e)). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: (a, b, c, d, e)) (t2 :: (a, b, c, d, e)). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

(SOrd a, SOrd b, SOrd c, SOrd d, SOrd e, SOrd f) => SOrd (a, b, c, d, e, f) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sCompare :: forall (t1 :: (a, b, c, d, e, f)) (t2 :: (a, b, c, d, e, f)). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

(%<) :: forall (t1 :: (a, b, c, d, e, f)) (t2 :: (a, b, c, d, e, f)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) Source #

(%<=) :: forall (t1 :: (a, b, c, d, e, f)) (t2 :: (a, b, c, d, e, f)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) Source #

(%>) :: forall (t1 :: (a, b, c, d, e, f)) (t2 :: (a, b, c, d, e, f)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) Source #

(%>=) :: forall (t1 :: (a, b, c, d, e, f)) (t2 :: (a, b, c, d, e, f)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) Source #

sMax :: forall (t1 :: (a, b, c, d, e, f)) (t2 :: (a, b, c, d, e, f)). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: (a, b, c, d, e, f)) (t2 :: (a, b, c, d, e, f)). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

(SOrd a, SOrd b, SOrd c, SOrd d, SOrd e, SOrd f, SOrd g) => SOrd (a, b, c, d, e, f, g) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sCompare :: forall (t1 :: (a, b, c, d, e, f, g)) (t2 :: (a, b, c, d, e, f, g)). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source #

(%<) :: forall (t1 :: (a, b, c, d, e, f, g)) (t2 :: (a, b, c, d, e, f, g)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) Source #

(%<=) :: forall (t1 :: (a, b, c, d, e, f, g)) (t2 :: (a, b, c, d, e, f, g)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) Source #

(%>) :: forall (t1 :: (a, b, c, d, e, f, g)) (t2 :: (a, b, c, d, e, f, g)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) Source #

(%>=) :: forall (t1 :: (a, b, c, d, e, f, g)) (t2 :: (a, b, c, d, e, f, g)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) Source #

sMax :: forall (t1 :: (a, b, c, d, e, f, g)) (t2 :: (a, b, c, d, e, f, g)). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source #

sMin :: forall (t1 :: (a, b, c, d, e, f, g)) (t2 :: (a, b, c, d, e, f, g)). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source #

As a matter of convenience, the Prelude.Singletons does not export promoted/singletonized succ and pred, due to likely conflicts with unary numbers. Please import Data.Singletons.Base.Enum directly if you want these.

class PEnum a Source #

Associated Types

type ToEnum (arg :: Natural) :: a Source #

type FromEnum (arg :: a) :: Natural Source #

type EnumFromTo (arg :: a) (arg :: a) :: [a] Source #

type EnumFromTo a a = Apply (Apply EnumFromTo_6989586621679496158Sym0 a) a

type EnumFromThenTo (arg :: a) (arg :: a) (arg :: a) :: [a] Source #

type EnumFromThenTo a a a = Apply (Apply (Apply EnumFromThenTo_6989586621679496170Sym0 a) a) a

Instances

Instances details
PEnum Ordering Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Associated Types

type Succ arg :: a Source #

type Pred arg :: a Source #

type ToEnum arg :: a Source #

type FromEnum arg :: Natural Source #

type EnumFromTo arg arg1 :: [a] Source #

type EnumFromThenTo arg arg1 arg2 :: [a] Source #

PEnum Natural Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Associated Types

type Succ arg :: a Source #

type Pred arg :: a Source #

type ToEnum arg :: a Source #

type FromEnum arg :: Natural Source #

type EnumFromTo arg arg1 :: [a] Source #

type EnumFromThenTo arg arg1 arg2 :: [a] Source #

PEnum () Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Associated Types

type Succ arg :: a Source #

type Pred arg :: a Source #

type ToEnum arg :: a Source #

type FromEnum arg :: Natural Source #

type EnumFromTo arg arg1 :: [a] Source #

type EnumFromThenTo arg arg1 arg2 :: [a] Source #

PEnum Bool Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Associated Types

type Succ arg :: a Source #

type Pred arg :: a Source #

type ToEnum arg :: a Source #

type FromEnum arg :: Natural Source #

type EnumFromTo arg arg1 :: [a] Source #

type EnumFromThenTo arg arg1 arg2 :: [a] Source #

PEnum Char Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Associated Types

type Succ arg :: a Source #

type Pred arg :: a Source #

type ToEnum arg :: a Source #

type FromEnum arg :: Natural Source #

type EnumFromTo arg arg1 :: [a] Source #

type EnumFromThenTo arg arg1 arg2 :: [a] Source #

PEnum (Identity a) Source # 
Instance details

Defined in Data.Functor.Identity.Singletons

Associated Types

type Succ arg :: a Source #

type Pred arg :: a Source #

type ToEnum arg :: a Source #

type FromEnum arg :: Natural Source #

type EnumFromTo arg arg1 :: [a] Source #

type EnumFromThenTo arg arg1 arg2 :: [a] Source #

PEnum (First a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Succ arg :: a Source #

type Pred arg :: a Source #

type ToEnum arg :: a Source #

type FromEnum arg :: Natural Source #

type EnumFromTo arg arg1 :: [a] Source #

type EnumFromThenTo arg arg1 arg2 :: [a] Source #

PEnum (Last a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Succ arg :: a Source #

type Pred arg :: a Source #

type ToEnum arg :: a Source #

type FromEnum arg :: Natural Source #

type EnumFromTo arg arg1 :: [a] Source #

type EnumFromThenTo arg arg1 arg2 :: [a] Source #

PEnum (Max a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Succ arg :: a Source #

type Pred arg :: a Source #

type ToEnum arg :: a Source #

type FromEnum arg :: Natural Source #

type EnumFromTo arg arg1 :: [a] Source #

type EnumFromThenTo arg arg1 arg2 :: [a] Source #

PEnum (Min a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Succ arg :: a Source #

type Pred arg :: a Source #

type ToEnum arg :: a Source #

type FromEnum arg :: Natural Source #

type EnumFromTo arg arg1 :: [a] Source #

type EnumFromThenTo arg arg1 arg2 :: [a] Source #

PEnum (WrappedMonoid a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Succ arg :: a Source #

type Pred arg :: a Source #

type ToEnum arg :: a Source #

type FromEnum arg :: Natural Source #

type EnumFromTo arg arg1 :: [a] Source #

type EnumFromThenTo arg arg1 arg2 :: [a] Source #

PEnum (Proxy s) Source # 
Instance details

Defined in Data.Proxy.Singletons

Associated Types

type Succ arg :: a Source #

type Pred arg :: a Source #

type ToEnum arg :: a Source #

type FromEnum arg :: Natural Source #

type EnumFromTo arg arg1 :: [a] Source #

type EnumFromThenTo arg arg1 arg2 :: [a] Source #

PEnum (Const a b) Source # 
Instance details

Defined in Data.Functor.Const.Singletons

Associated Types

type Succ arg :: a Source #

type Pred arg :: a Source #

type ToEnum arg :: a Source #

type FromEnum arg :: Natural Source #

type EnumFromTo arg arg1 :: [a] Source #

type EnumFromThenTo arg arg1 arg2 :: [a] Source #

class SEnum a where Source #

Minimal complete definition

sToEnum, sFromEnum

Methods

sToEnum :: forall (t :: Natural). Sing t -> Sing (Apply ToEnumSym0 t :: a) :: Type Source #

sFromEnum :: forall (t :: a). Sing t -> Sing (Apply FromEnumSym0 t :: Natural) :: Type Source #

sEnumFromTo :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t :: [a]) :: Type Source #

default sEnumFromTo :: forall (t :: a) (t :: a). (Apply (Apply EnumFromToSym0 t) t :: [a]) ~ Apply (Apply EnumFromTo_6989586621679496158Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t :: [a]) :: Type Source #

sEnumFromThenTo :: forall (t :: a) (t :: a) (t :: a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t :: [a]) :: Type Source #

default sEnumFromThenTo :: forall (t :: a) (t :: a) (t :: a). (Apply (Apply (Apply EnumFromThenToSym0 t) t) t :: [a]) ~ Apply (Apply (Apply EnumFromThenTo_6989586621679496170Sym0 t) t) t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t :: [a]) :: Type Source #

Instances

Instances details
SEnum Ordering Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Methods

sSucc :: forall (t :: Ordering). Sing t -> Sing (Apply SuccSym0 t) Source #

sPred :: forall (t :: Ordering). Sing t -> Sing (Apply PredSym0 t) Source #

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

sFromEnum :: forall (t :: Ordering). Sing t -> Sing (Apply FromEnumSym0 t) Source #

sEnumFromTo :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) Source #

sEnumFromThenTo :: forall (t1 :: Ordering) (t2 :: Ordering) (t3 :: Ordering). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) Source #

SEnum Natural Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Methods

sSucc :: forall (t :: Natural). Sing t -> Sing (Apply SuccSym0 t) Source #

sPred :: forall (t :: Natural). Sing t -> Sing (Apply PredSym0 t) Source #

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

sFromEnum :: forall (t :: Natural). Sing t -> Sing (Apply FromEnumSym0 t) Source #

sEnumFromTo :: forall (t1 :: Natural) (t2 :: Natural). Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) Source #

sEnumFromThenTo :: forall (t1 :: Natural) (t2 :: Natural) (t3 :: Natural). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) Source #

SEnum () Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Methods

sSucc :: forall (t :: ()). Sing t -> Sing (Apply SuccSym0 t) Source #

sPred :: forall (t :: ()). Sing t -> Sing (Apply PredSym0 t) Source #

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

sFromEnum :: forall (t :: ()). Sing t -> Sing (Apply FromEnumSym0 t) Source #

sEnumFromTo :: forall (t1 :: ()) (t2 :: ()). Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) Source #

sEnumFromThenTo :: forall (t1 :: ()) (t2 :: ()) (t3 :: ()). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) Source #

SEnum Bool Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Methods

sSucc :: forall (t :: Bool). Sing t -> Sing (Apply SuccSym0 t) Source #

sPred :: forall (t :: Bool). Sing t -> Sing (Apply PredSym0 t) Source #

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

sFromEnum :: forall (t :: Bool). Sing t -> Sing (Apply FromEnumSym0 t) Source #

sEnumFromTo :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) Source #

sEnumFromThenTo :: forall (t1 :: Bool) (t2 :: Bool) (t3 :: Bool). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) Source #

SEnum Char Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Methods

sSucc :: forall (t :: Char). Sing t -> Sing (Apply SuccSym0 t) Source #

sPred :: forall (t :: Char). Sing t -> Sing (Apply PredSym0 t) Source #

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

sFromEnum :: forall (t :: Char). Sing t -> Sing (Apply FromEnumSym0 t) Source #

sEnumFromTo :: forall (t1 :: Char) (t2 :: Char). Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) Source #

sEnumFromThenTo :: forall (t1 :: Char) (t2 :: Char) (t3 :: Char). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) Source #

SEnum a => SEnum (Identity a) Source # 
Instance details

Defined in Data.Functor.Identity.Singletons

Methods

sSucc :: forall (t :: Identity a). Sing t -> Sing (Apply SuccSym0 t) Source #

sPred :: forall (t :: Identity a). Sing t -> Sing (Apply PredSym0 t) Source #

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

sFromEnum :: forall (t :: Identity a). Sing t -> Sing (Apply FromEnumSym0 t) Source #

sEnumFromTo :: forall (t1 :: Identity a) (t2 :: Identity a). Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) Source #

sEnumFromThenTo :: forall (t1 :: Identity a) (t2 :: Identity a) (t3 :: Identity a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) Source #

SEnum a => SEnum (First a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sSucc :: forall (t :: First a). Sing t -> Sing (Apply SuccSym0 t) Source #

sPred :: forall (t :: First a). Sing t -> Sing (Apply PredSym0 t) Source #

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

sFromEnum :: forall (t :: First a). Sing t -> Sing (Apply FromEnumSym0 t) Source #

sEnumFromTo :: forall (t1 :: First a) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) Source #

sEnumFromThenTo :: forall (t1 :: First a) (t2 :: First a) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) Source #

SEnum a => SEnum (Last a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sSucc :: forall (t :: Last a). Sing t -> Sing (Apply SuccSym0 t) Source #

sPred :: forall (t :: Last a). Sing t -> Sing (Apply PredSym0 t) Source #

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

sFromEnum :: forall (t :: Last a). Sing t -> Sing (Apply FromEnumSym0 t) Source #

sEnumFromTo :: forall (t1 :: Last a) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) Source #

sEnumFromThenTo :: forall (t1 :: Last a) (t2 :: Last a) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) Source #

SEnum a => SEnum (Max a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sSucc :: forall (t :: Max a). Sing t -> Sing (Apply SuccSym0 t) Source #

sPred :: forall (t :: Max a). Sing t -> Sing (Apply PredSym0 t) Source #

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

sFromEnum :: forall (t :: Max a). Sing t -> Sing (Apply FromEnumSym0 t) Source #

sEnumFromTo :: forall (t1 :: Max a) (t2 :: Max a). Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) Source #

sEnumFromThenTo :: forall (t1 :: Max a) (t2 :: Max a) (t3 :: Max a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) Source #

SEnum a => SEnum (Min a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sSucc :: forall (t :: Min a). Sing t -> Sing (Apply SuccSym0 t) Source #

sPred :: forall (t :: Min a). Sing t -> Sing (Apply PredSym0 t) Source #

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

sFromEnum :: forall (t :: Min a). Sing t -> Sing (Apply FromEnumSym0 t) Source #

sEnumFromTo :: forall (t1 :: Min a) (t2 :: Min a). Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) Source #

sEnumFromThenTo :: forall (t1 :: Min a) (t2 :: Min a) (t3 :: Min a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) Source #

SEnum a => SEnum (WrappedMonoid a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sSucc :: forall (t :: WrappedMonoid a). Sing t -> Sing (Apply SuccSym0 t) Source #

sPred :: forall (t :: WrappedMonoid a). Sing t -> Sing (Apply PredSym0 t) Source #

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

sFromEnum :: forall (t :: WrappedMonoid a). Sing t -> Sing (Apply FromEnumSym0 t) Source #

sEnumFromTo :: forall (t1 :: WrappedMonoid a) (t2 :: WrappedMonoid a). Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) Source #

sEnumFromThenTo :: forall (t1 :: WrappedMonoid a) (t2 :: WrappedMonoid a) (t3 :: WrappedMonoid a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) Source #

SEnum (Proxy s) Source # 
Instance details

Defined in Data.Proxy.Singletons

Methods

sSucc :: forall (t :: Proxy s). Sing t -> Sing (Apply SuccSym0 t) Source #

sPred :: forall (t :: Proxy s). Sing t -> Sing (Apply PredSym0 t) Source #

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

sFromEnum :: forall (t :: Proxy s). Sing t -> Sing (Apply FromEnumSym0 t) Source #

sEnumFromTo :: forall (t1 :: Proxy s) (t2 :: Proxy s). Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) Source #

sEnumFromThenTo :: forall (t1 :: Proxy s) (t2 :: Proxy s) (t3 :: Proxy s). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) Source #

SEnum a => SEnum (Const a b) Source # 
Instance details

Defined in Data.Functor.Const.Singletons

Methods

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

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

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

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

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

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) Source #

class PBounded a Source #

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

Instances

Instances details
PBounded All Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded Any Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded Ordering Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded () Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded Bool Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded Char Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded (Identity a) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded (First a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded (Last a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded (Max a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded (Min a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded (WrappedMonoid m) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded (Dual a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded (Product a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded (Sum a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded (Proxy s) Source # 
Instance details

Defined in Data.Proxy.Singletons

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded (a, b) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded (Const a b) Source # 
Instance details

Defined in Data.Functor.Const.Singletons

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded (a, b, c) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded (a, b, c, d) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded (a, b, c, d, e) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded (a, b, c, d, e, f) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

PBounded (a, b, c, d, e, f, g) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

class SBounded a where Source #

Methods

sMinBound :: Sing (MinBoundSym0 :: a) :: Type Source #

sMaxBound :: Sing (MaxBoundSym0 :: a) :: Type Source #

Instances

Instances details
SBounded Bool => SBounded All Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

SBounded Bool => SBounded Any Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

SBounded Ordering Source # 
Instance details

Defined in Data.Singletons.Base.Enum

SBounded () Source # 
Instance details

Defined in Data.Singletons.Base.Enum

SBounded Bool Source # 
Instance details

Defined in Data.Singletons.Base.Enum

SBounded Char Source # 
Instance details

Defined in Data.Singletons.Base.Enum

SBounded a => SBounded (Identity a) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

SBounded a => SBounded (First a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

SBounded a => SBounded (Last a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

SBounded a => SBounded (Max a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

SBounded a => SBounded (Min a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

SBounded m => SBounded (WrappedMonoid m) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

SBounded a => SBounded (Dual a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

SBounded a => SBounded (Product a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

SBounded a => SBounded (Sum a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

SBounded (Proxy s) Source # 
Instance details

Defined in Data.Proxy.Singletons

(SBounded a, SBounded b) => SBounded (a, b) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

SBounded a => SBounded (Const a b) Source # 
Instance details

Defined in Data.Functor.Const.Singletons

(SBounded a, SBounded b, SBounded c) => SBounded (a, b, c) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

(SBounded a, SBounded b, SBounded c, SBounded d) => SBounded (a, b, c, d) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

(SBounded a, SBounded b, SBounded c, SBounded d, SBounded e) => SBounded (a, b, c, d, e) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

(SBounded a, SBounded b, SBounded c, SBounded d, SBounded e, SBounded f) => SBounded (a, b, c, d, e, f) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

(SBounded a, SBounded b, SBounded c, SBounded d, SBounded e, SBounded f, SBounded g) => SBounded (a, b, c, d, e, f, g) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Numbers

Numeric type classes

class PNum a Source #

Associated Types

type (arg :: a) + (arg :: a) :: a infixl 6 Source #

type (arg :: a) - (arg :: a) :: a infixl 6 Source #

type a - a = Apply (Apply TFHelper_6989586621679477106Sym0 a) a

type (arg :: a) * (arg :: a) :: a infixl 7 Source #

type Negate (arg :: a) :: a Source #

type Negate a = Apply Negate_6989586621679477116Sym0 a

type Abs (arg :: a) :: a Source #

type Signum (arg :: a) :: a Source #

type FromInteger (arg :: Natural) :: a Source #

Instances

Instances details
PNum Natural Source # 
Instance details

Defined in GHC.Num.Singletons

Associated Types

type arg + arg1 :: a Source #

type arg - arg1 :: a Source #

type arg * arg1 :: a Source #

type Negate arg :: a Source #

type Abs arg :: a Source #

type Signum arg :: a Source #

type FromInteger arg :: a Source #

PNum (Identity a) Source # 
Instance details

Defined in Data.Functor.Identity.Singletons

Associated Types

type arg + arg1 :: a Source #

type arg - arg1 :: a Source #

type arg * arg1 :: a Source #

type Negate arg :: a Source #

type Abs arg :: a Source #

type Signum arg :: a Source #

type FromInteger arg :: a Source #

PNum (Down a) Source # 
Instance details

Defined in GHC.Num.Singletons

Associated Types

type arg + arg1 :: a Source #

type arg - arg1 :: a Source #

type arg * arg1 :: a Source #

type Negate arg :: a Source #

type Abs arg :: a Source #

type Signum arg :: a Source #

type FromInteger arg :: a Source #

PNum (Max a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type arg + arg1 :: a Source #

type arg - arg1 :: a Source #

type arg * arg1 :: a Source #

type Negate arg :: a Source #

type Abs arg :: a Source #

type Signum arg :: a Source #

type FromInteger arg :: a Source #

PNum (Min a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type arg + arg1 :: a Source #

type arg - arg1 :: a Source #

type arg * arg1 :: a Source #

type Negate arg :: a Source #

type Abs arg :: a Source #

type Signum arg :: a Source #

type FromInteger arg :: a Source #

PNum (Product a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type arg + arg1 :: a Source #

type arg - arg1 :: a Source #

type arg * arg1 :: a Source #

type Negate arg :: a Source #

type Abs arg :: a Source #

type Signum arg :: a Source #

type FromInteger arg :: a Source #

PNum (Sum a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type arg + arg1 :: a Source #

type arg - arg1 :: a Source #

type arg * arg1 :: a Source #

type Negate arg :: a Source #

type Abs arg :: a Source #

type Signum arg :: a Source #

type FromInteger arg :: a Source #

PNum (Const a b) Source # 
Instance details

Defined in Data.Functor.Const.Singletons

Associated Types

type arg + arg1 :: a Source #

type arg - arg1 :: a Source #

type arg * arg1 :: a Source #

type Negate arg :: a Source #

type Abs arg :: a Source #

type Signum arg :: a Source #

type FromInteger arg :: a Source #

class SNum a where Source #

Minimal complete definition

(%+), (%*), sAbs, sSignum, sFromInteger

Methods

(%+) :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply (+@#@$) t) t :: a) :: Type infixl 6 Source #

(%-) :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply (-@#@$) t) t :: a) :: Type infixl 6 Source #

default (%-) :: forall (t :: a) (t :: a). (Apply (Apply (-@#@$) t) t :: a) ~ Apply (Apply TFHelper_6989586621679477106Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply (-@#@$) t) t :: a) :: Type Source #

(%*) :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply (*@#@$) t) t :: a) :: Type infixl 7 Source #

sNegate :: forall (t :: a). Sing t -> Sing (Apply NegateSym0 t :: a) :: Type Source #

default sNegate :: forall (t :: a). (Apply NegateSym0 t :: a) ~ Apply Negate_6989586621679477116Sym0 t => Sing t -> Sing (Apply NegateSym0 t :: a) :: Type Source #

sAbs :: forall (t :: a). Sing t -> Sing (Apply AbsSym0 t :: a) :: Type Source #

sSignum :: forall (t :: a). Sing t -> Sing (Apply SignumSym0 t :: a) :: Type Source #

sFromInteger :: forall (t :: Natural). Sing t -> Sing (Apply FromIntegerSym0 t :: a) :: Type Source #

Instances

Instances details
SNum Natural Source # 
Instance details

Defined in GHC.Num.Singletons

Methods

(%+) :: forall (t1 :: Natural) (t2 :: Natural). Sing t1 -> Sing t2 -> Sing (Apply (Apply (+@#@$) t1) t2) Source #

(%-) :: forall (t1 :: Natural) (t2 :: Natural). Sing t1 -> Sing t2 -> Sing (Apply (Apply (-@#@$) t1) t2) Source #

(%*) :: forall (t1 :: Natural) (t2 :: Natural). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*@#@$) t1) t2) Source #

sNegate :: forall (t :: Natural). Sing t -> Sing (Apply NegateSym0 t) Source #

sAbs :: forall (t :: Natural). Sing t -> Sing (Apply AbsSym0 t) Source #

sSignum :: forall (t :: Natural). Sing t -> Sing (Apply SignumSym0 t) Source #

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

SNum a => SNum (Identity a) Source # 
Instance details

Defined in Data.Functor.Identity.Singletons

Methods

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

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

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

sNegate :: forall (t :: Identity a). Sing t -> Sing (Apply NegateSym0 t) Source #

sAbs :: forall (t :: Identity a). Sing t -> Sing (Apply AbsSym0 t) Source #

sSignum :: forall (t :: Identity a). Sing t -> Sing (Apply SignumSym0 t) Source #

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

SNum a => SNum (Down a) Source # 
Instance details

Defined in GHC.Num.Singletons

Methods

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

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

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

sNegate :: forall (t :: Down a). Sing t -> Sing (Apply NegateSym0 t) Source #

sAbs :: forall (t :: Down a). Sing t -> Sing (Apply AbsSym0 t) Source #

sSignum :: forall (t :: Down a). Sing t -> Sing (Apply SignumSym0 t) Source #

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

SNum a => SNum (Max a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

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

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

sNegate :: forall (t :: Max a). Sing t -> Sing (Apply NegateSym0 t) Source #

sAbs :: forall (t :: Max a). Sing t -> Sing (Apply AbsSym0 t) Source #

sSignum :: forall (t :: Max a). Sing t -> Sing (Apply SignumSym0 t) Source #

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

SNum a => SNum (Min a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

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

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

sNegate :: forall (t :: Min a). Sing t -> Sing (Apply NegateSym0 t) Source #

sAbs :: forall (t :: Min a). Sing t -> Sing (Apply AbsSym0 t) Source #

sSignum :: forall (t :: Min a). Sing t -> Sing (Apply SignumSym0 t) Source #

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

SNum a => SNum (Product a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

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

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

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

sNegate :: forall (t :: Product a). Sing t -> Sing (Apply NegateSym0 t) Source #

sAbs :: forall (t :: Product a). Sing t -> Sing (Apply AbsSym0 t) Source #

sSignum :: forall (t :: Product a). Sing t -> Sing (Apply SignumSym0 t) Source #

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

SNum a => SNum (Sum a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

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

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

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

sNegate :: forall (t :: Sum a). Sing t -> Sing (Apply NegateSym0 t) Source #

sAbs :: forall (t :: Sum a). Sing t -> Sing (Apply AbsSym0 t) Source #

sSignum :: forall (t :: Sum a). Sing t -> Sing (Apply SignumSym0 t) Source #

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

SNum a => SNum (Const a b) Source # 
Instance details

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) Source #

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

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

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

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

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

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

Numeric functions

type family Subtract (a :: a) (a :: a) :: a where ... Source #

Equations

Subtract x y = Apply (Apply (-@#@$) y) x 

sSubtract :: forall (t :: a) (t :: a). SNum a => Sing t -> Sing t -> Sing (Apply (Apply SubtractSym0 t) t :: a) :: Type Source #

Semigroups and Monoids

class PSemigroup a Source #

Associated Types

type (arg :: a) <> (arg :: a) :: a infixr 6 Source #

Instances

Instances details
PSemigroup All Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup Any Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup Void Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup Ordering Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup () Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup Symbol Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (Identity a) Source # 
Instance details

Defined in Data.Functor.Identity.Singletons

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (First a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (Last a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (Down a) Source # 
Instance details

Defined in Data.Ord.Singletons

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (First a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (Last a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (Max a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (Min a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (WrappedMonoid m) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (Dual a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (Product a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (Sum a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (NonEmpty a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (Maybe a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup [a] Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (Either a b) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (Proxy s) Source # 
Instance details

Defined in Data.Proxy.Singletons

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (a ~> b) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (a, b) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (Const a b) Source # 
Instance details

Defined in Data.Functor.Const.Singletons

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (a, b, c) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (a, b, c, d) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

PSemigroup (a, b, c, d, e) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Associated Types

type arg <> arg1 :: a Source #

type Sconcat arg :: a Source #

class SSemigroup a where Source #

Methods

(%<>) :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t :: a) :: Type infixr 6 Source #

Instances

Instances details
SSemigroup All Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

(%<>) :: forall (t1 :: All) (t2 :: All). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) Source #

sSconcat :: forall (t :: NonEmpty All). Sing t -> Sing (Apply SconcatSym0 t) Source #

SSemigroup Any Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

(%<>) :: forall (t1 :: Any) (t2 :: Any). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) Source #

sSconcat :: forall (t :: NonEmpty Any). Sing t -> Sing (Apply SconcatSym0 t) Source #

SSemigroup Void Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Methods

(%<>) :: forall (t1 :: Void) (t2 :: Void). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) Source #

sSconcat :: forall (t :: NonEmpty Void). Sing t -> Sing (Apply SconcatSym0 t) Source #

SSemigroup Ordering Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Methods

(%<>) :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) Source #

sSconcat :: forall (t :: NonEmpty Ordering). Sing t -> Sing (Apply SconcatSym0 t) Source #

SSemigroup () Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Methods

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

sSconcat :: forall (t :: NonEmpty ()). Sing t -> Sing (Apply SconcatSym0 t) Source #

SSemigroup Symbol Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Methods

(%<>) :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) Source #

sSconcat :: forall (t :: NonEmpty Symbol). Sing t -> Sing (Apply SconcatSym0 t) Source #

SSemigroup a => SSemigroup (Identity a) Source # 
Instance details

Defined in Data.Functor.Identity.Singletons

Methods

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

sSconcat :: forall (t :: NonEmpty (Identity a)). Sing t -> Sing (Apply SconcatSym0 t) Source #

SSemigroup (First a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

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

sSconcat :: forall (t :: NonEmpty (First a)). Sing t -> Sing (Apply SconcatSym0 t) Source #

SSemigroup (Last a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

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

sSconcat :: forall (t :: NonEmpty (Last a)). Sing t -> Sing (Apply SconcatSym0 t) Source #

SSemigroup a => SSemigroup (Down a) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

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

sSconcat :: forall (t :: NonEmpty (Down a)). Sing t -> Sing (Apply SconcatSym0 t) Source #

SSemigroup (First a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

sSconcat :: forall (t :: NonEmpty (First a)). Sing t -> Sing (Apply SconcatSym0 t) Source #

SSemigroup (Last a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

sSconcat :: forall (t :: NonEmpty (Last a)). Sing t -> Sing (Apply SconcatSym0 t) Source #

SOrd a => SSemigroup (Max a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

sSconcat :: forall (t :: NonEmpty (Max a)). Sing t -> Sing (Apply SconcatSym0 t) Source #

SOrd a => SSemigroup (Min a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

sSconcat :: forall (t :: NonEmpty (Min a)). Sing t -> Sing (Apply SconcatSym0 t) Source #

SMonoid m => SSemigroup (WrappedMonoid m) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

(%<>) :: forall (t1 :: WrappedMonoid m) (t2 :: WrappedMonoid m). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) Source #

sSconcat :: forall (t :: NonEmpty (WrappedMonoid m)). Sing t -> Sing (Apply SconcatSym0 t) Source #

SSemigroup a => SSemigroup (Dual a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

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

sSconcat :: forall (t :: NonEmpty (Dual a)). Sing t -> Sing (Apply SconcatSym0 t) Source #

SNum a => SSemigroup (Product a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

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

sSconcat :: forall (t :: NonEmpty (Product a)). Sing t -> Sing (Apply SconcatSym0 t) Source #

SNum a => SSemigroup (Sum a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

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

sSconcat :: forall (t :: NonEmpty (Sum a)). Sing t -> Sing (Apply SconcatSym0 t) Source #

SSemigroup (NonEmpty a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Methods

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

sSconcat :: forall (t :: NonEmpty (NonEmpty a)). Sing t -> Sing (Apply SconcatSym0 t) Source #

SSemigroup a => SSemigroup (Maybe a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Methods

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

sSconcat :: forall (t :: NonEmpty (Maybe a)). Sing t -> Sing (Apply SconcatSym0 t) Source #

SSemigroup [a] Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Methods

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

sSconcat :: forall (t :: NonEmpty [a]). Sing t -> Sing (Apply SconcatSym0 t) Source #

SSemigroup (Either a b) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Methods

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

sSconcat :: forall (t :: NonEmpty (Either a b)). Sing t -> Sing (Apply SconcatSym0 t) Source #

SSemigroup (Proxy s) Source # 
Instance details

Defined in Data.Proxy.Singletons

Methods

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

sSconcat :: forall (t :: NonEmpty (Proxy s)). Sing t -> Sing (Apply SconcatSym0 t) Source #

SSemigroup b => SSemigroup (a ~> b) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Methods

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

sSconcat :: forall (t :: NonEmpty (a ~> b)). Sing t -> Sing (Apply SconcatSym0 t) Source #

(SSemigroup a, SSemigroup b) => SSemigroup (a, b) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Methods

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

sSconcat :: forall (t :: NonEmpty (a, b)). Sing t -> Sing (Apply SconcatSym0 t) Source #

SSemigroup a => SSemigroup (Const a b) Source # 
Instance details

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) Source #

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

(SSemigroup a, SSemigroup b, SSemigroup c) => SSemigroup (a, b, c) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Methods

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

sSconcat :: forall (t :: NonEmpty (a, b, c)). Sing t -> Sing (Apply SconcatSym0 t) Source #

(SSemigroup a, SSemigroup b, SSemigroup c, SSemigroup d) => SSemigroup (a, b, c, d) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Methods

(%<>) :: forall (t1 :: (a, b, c, d)) (t2 :: (a, b, c, d)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) Source #

sSconcat :: forall (t :: NonEmpty (a, b, c, d)). Sing t -> Sing (Apply SconcatSym0 t) Source #

(SSemigroup a, SSemigroup b, SSemigroup c, SSemigroup d, SSemigroup e) => SSemigroup (a, b, c, d, e) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Methods

(%<>) :: forall (t1 :: (a, b, c, d, e)) (t2 :: (a, b, c, d, e)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) Source #

sSconcat :: forall (t :: NonEmpty (a, b, c, d, e)). Sing t -> Sing (Apply SconcatSym0 t) Source #

class PMonoid a Source #

Associated Types

type Mempty :: a Source #

type Mappend (arg :: a) (arg :: a) :: a Source #

type Mappend a a = Apply (Apply Mappend_6989586621680031464Sym0 a) a

type Mconcat (arg :: [a]) :: a Source #

type Mconcat a = Apply Mconcat_6989586621680031478Sym0 a

Instances

Instances details
PMonoid All Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid Any Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid Ordering Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid () Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid Symbol Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid (Identity a) Source # 
Instance details

Defined in Data.Functor.Identity.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid (First a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid (Last a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid (Down a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid (Max a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid (Min a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid (WrappedMonoid m) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid (Dual a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid (Product a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid (Sum a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid (Maybe a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid [a] Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid (Proxy s) Source # 
Instance details

Defined in Data.Proxy.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid (a ~> b) Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid (a, b) Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid (Const a b) Source # 
Instance details

Defined in Data.Functor.Const.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid (a, b, c) Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid (a, b, c, d) Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

PMonoid (a, b, c, d, e) Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Mempty :: a Source #

type Mappend arg arg1 :: a Source #

type Mconcat arg :: a Source #

class SSemigroup a => SMonoid a where Source #

Minimal complete definition

sMempty

Methods

sMempty :: Sing (MemptySym0 :: a) :: Type Source #

sMappend :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t :: a) :: Type Source #

default sMappend :: forall (t :: a) (t :: a). (Apply (Apply MappendSym0 t) t :: a) ~ Apply (Apply Mappend_6989586621680031464Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t :: a) :: Type Source #

sMconcat :: forall (t :: [a]). Sing t -> Sing (Apply MconcatSym0 t :: a) :: Type Source #

default sMconcat :: forall (t :: [a]). (Apply MconcatSym0 t :: a) ~ Apply Mconcat_6989586621680031478Sym0 t => Sing t -> Sing (Apply MconcatSym0 t :: a) :: Type Source #

Instances

Instances details
SMonoid All Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: All) (t2 :: All). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [All]). Sing t -> Sing (Apply MconcatSym0 t) Source #

SMonoid Any Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: Any) (t2 :: Any). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [Any]). Sing t -> Sing (Apply MconcatSym0 t) Source #

SMonoid Ordering Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [Ordering]). Sing t -> Sing (Apply MconcatSym0 t) Source #

SMonoid () Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: ()) (t2 :: ()). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [()]). Sing t -> Sing (Apply MconcatSym0 t) Source #

SMonoid Symbol Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [Symbol]). Sing t -> Sing (Apply MconcatSym0 t) Source #

SMonoid a => SMonoid (Identity a) Source # 
Instance details

Defined in Data.Functor.Identity.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: Identity a) (t2 :: Identity a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [Identity a]). Sing t -> Sing (Apply MconcatSym0 t) Source #

SMonoid (First a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: First a) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [First a]). Sing t -> Sing (Apply MconcatSym0 t) Source #

SMonoid (Last a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: Last a) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [Last a]). Sing t -> Sing (Apply MconcatSym0 t) Source #

SMonoid a => SMonoid (Down a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: Down a) (t2 :: Down a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [Down a]). Sing t -> Sing (Apply MconcatSym0 t) Source #

(SOrd a, SBounded a) => SMonoid (Max a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: Max a) (t2 :: Max a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [Max a]). Sing t -> Sing (Apply MconcatSym0 t) Source #

(SOrd a, SBounded a) => SMonoid (Min a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: Min a) (t2 :: Min a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [Min a]). Sing t -> Sing (Apply MconcatSym0 t) Source #

SMonoid m => SMonoid (WrappedMonoid m) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: WrappedMonoid m) (t2 :: WrappedMonoid m). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [WrappedMonoid m]). Sing t -> Sing (Apply MconcatSym0 t) Source #

SMonoid a => SMonoid (Dual a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: Dual a) (t2 :: Dual a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [Dual a]). Sing t -> Sing (Apply MconcatSym0 t) Source #

SNum a => SMonoid (Product a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: Product a) (t2 :: Product a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [Product a]). Sing t -> Sing (Apply MconcatSym0 t) Source #

SNum a => SMonoid (Sum a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: Sum a) (t2 :: Sum a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [Sum a]). Sing t -> Sing (Apply MconcatSym0 t) Source #

SSemigroup a => SMonoid (Maybe a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [Maybe a]). Sing t -> Sing (Apply MconcatSym0 t) Source #

SMonoid [a] Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: [a]) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [[a]]). Sing t -> Sing (Apply MconcatSym0 t) Source #

SMonoid (Proxy s) Source # 
Instance details

Defined in Data.Proxy.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: Proxy s) (t2 :: Proxy s). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [Proxy s]). Sing t -> Sing (Apply MconcatSym0 t) Source #

SMonoid b => SMonoid (a ~> b) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: a ~> b) (t2 :: a ~> b). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

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

(SMonoid a, SMonoid b) => SMonoid (a, b) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: (a, b)) (t2 :: (a, b)). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

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

SMonoid a => SMonoid (Const a b) Source # 
Instance details

Defined in Data.Functor.Const.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

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

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

(SMonoid a, SMonoid b, SMonoid c) => SMonoid (a, b, c) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: (a, b, c)) (t2 :: (a, b, c)). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [(a, b, c)]). Sing t -> Sing (Apply MconcatSym0 t) Source #

(SMonoid a, SMonoid b, SMonoid c, SMonoid d) => SMonoid (a, b, c, d) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: (a, b, c, d)) (t2 :: (a, b, c, d)). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [(a, b, c, d)]). Sing t -> Sing (Apply MconcatSym0 t) Source #

(SMonoid a, SMonoid b, SMonoid c, SMonoid d, SMonoid e) => SMonoid (a, b, c, d, e) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sMempty :: Sing MemptySym0 Source #

sMappend :: forall (t1 :: (a, b, c, d, e)) (t2 :: (a, b, c, d, e)). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) Source #

sMconcat :: forall (t :: [(a, b, c, d, e)]). Sing t -> Sing (Apply MconcatSym0 t) Source #

Monads and functors

class PFunctor f Source #

Associated Types

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

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

type a <$ a = Apply (Apply TFHelper_6989586621679276550Sym0 a) a

Instances

Instances details
PFunctor Identity Source # 
Instance details

Defined in Data.Functor.Identity.Singletons

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

PFunctor First Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

PFunctor Last Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

PFunctor Down Source # 
Instance details

Defined in Data.Functor.Singletons

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

PFunctor First Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

PFunctor Last Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

PFunctor Max Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

PFunctor Min Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

PFunctor Dual Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

PFunctor Product Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

PFunctor Sum Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

PFunctor NonEmpty Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

PFunctor Maybe Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

PFunctor List Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

PFunctor (Either a) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

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

Defined in Data.Proxy.Singletons

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

PFunctor (Arg a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

PFunctor ((,) a) Source # 
Instance details

Defined in Data.Functor.Singletons

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

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

Defined in Data.Functor.Const.Singletons

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

PFunctor (Product f g) Source # 
Instance details

Defined in Data.Functor.Product.Singletons

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

PFunctor (Sum f g) Source # 
Instance details

Defined in Data.Functor.Sum.Singletons

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

PFunctor (Compose f g) Source # 
Instance details

Defined in Data.Functor.Compose.Singletons

Associated Types

type Fmap arg arg1 :: f b Source #

type arg <$ arg1 :: f a Source #

class SFunctor f where Source #

Minimal complete definition

sFmap

Methods

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

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

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

Instances

Instances details
SFunctor Identity Source # 
Instance details

Defined in Data.Functor.Identity.Singletons

Methods

sFmap :: forall a b (t1 :: a ~> b) (t2 :: Identity a). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) Source #

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

SFunctor First Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sFmap :: forall a b (t1 :: a ~> b) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) Source #

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

SFunctor Last Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sFmap :: forall a b (t1 :: a ~> b) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) Source #

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

SFunctor Down Source # 
Instance details

Defined in Data.Functor.Singletons

Methods

sFmap :: forall a b (t1 :: a ~> b) (t2 :: Down a). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) Source #

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

SFunctor First Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sFmap :: forall a b (t1 :: a ~> b) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) Source #

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

SFunctor Last Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sFmap :: forall a b (t1 :: a ~> b) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) Source #

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

SFunctor Max Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sFmap :: forall a b (t1 :: a ~> b) (t2 :: Max a). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) Source #

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

SFunctor Min Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sFmap :: forall a b (t1 :: a ~> b) (t2 :: Min a). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) Source #

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

SFunctor Dual Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

sFmap :: forall a b (t1 :: a ~> b) (t2 :: Dual a). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) Source #

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

SFunctor Product Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

sFmap :: forall a b (t1 :: a ~> b) (t2 :: Product a). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) Source #

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

SFunctor Sum Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

sFmap :: forall a b (t1 :: a ~> b) (t2 :: Sum a). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) Source #

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

SFunctor NonEmpty Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

sFmap :: forall a b (t1 :: a ~> b) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) Source #

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

SFunctor Maybe Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

sFmap :: forall a b (t1 :: a ~> b) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) Source #

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

SFunctor List Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

sFmap :: forall a b (t1 :: a ~> b) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) Source #

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

SFunctor (Either a) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

sFmap :: forall a0 b (t1 :: a0 ~> b) (t2 :: Either a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) Source #

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

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

Defined in Data.Proxy.Singletons

Methods

sFmap :: forall a b (t1 :: a ~> b) (t2 :: Proxy a). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) Source #

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

SFunctor (Arg a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sFmap :: forall a0 b (t1 :: a0 ~> b) (t2 :: Arg a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) Source #

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

SFunctor ((,) a) Source # 
Instance details

Defined in Data.Functor.Singletons

Methods

sFmap :: forall a0 b (t1 :: a0 ~> b) (t2 :: (a, a0)). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) Source #

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

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

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) Source #

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

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

Defined in Data.Functor.Product.Singletons

Methods

sFmap :: forall a b (t1 :: a ~> b) (t2 :: Product f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) Source #

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

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

Defined in Data.Functor.Sum.Singletons

Methods

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

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

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

Defined in Data.Functor.Compose.Singletons

Methods

sFmap :: forall a b (t1 :: a ~> b) (t2 :: Compose f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) Source #

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

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

Equations

a_6989586621679430458 <$> a_6989586621679430460 = Apply (Apply FmapSym0 a_6989586621679430458) a_6989586621679430460 

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

class PApplicative f Source #

Associated Types

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

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

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

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

type LiftA2 a a a = Apply (Apply (Apply LiftA2_6989586621679276606Sym0 a) a) a

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

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

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

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

Instances

Instances details
PApplicative Identity Source # 
Instance details

Defined in Data.Functor.Identity.Singletons

Associated Types

type Pure arg :: f a Source #

type arg <*> arg1 :: f b Source #

type LiftA2 arg arg1 arg2 :: f c Source #

type arg *> arg1 :: f b Source #

type arg <* arg1 :: f a Source #

PApplicative First Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Pure arg :: f a Source #

type arg <*> arg1 :: f b Source #

type LiftA2 arg arg1 arg2 :: f c Source #

type arg *> arg1 :: f b Source #

type arg <* arg1 :: f a Source #

PApplicative Last Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type Pure arg :: f a Source #

type arg <*> arg1 :: f b Source #

type LiftA2 arg arg1 arg2 :: f c Source #

type arg *> arg1 :: f b Source #

type arg <* arg1 :: f a Source #

PApplicative Down Source # 
Instance details

Defined in Control.Applicative.Singletons

Associated Types

type Pure arg :: f a Source #

type arg <*> arg1 :: f b Source #

type LiftA2 arg arg1 arg2 :: f c Source #

type arg *> arg1 :: f b Source #

type arg <* arg1 :: f a Source #

PApplicative First Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Pure arg :: f a Source #

type arg <*> arg1 :: f b Source #

type LiftA2 arg arg1 arg2 :: f c Source #

type arg *> arg1 :: f b Source #

type arg <* arg1 :: f a Source #

PApplicative Last Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Pure arg :: f a Source #

type arg <*> arg1 :: f b Source #

type LiftA2 arg arg1 arg2 :: f c Source #

type arg *> arg1 :: f b Source #

type arg <* arg1 :: f a Source #

PApplicative Max Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Pure arg :: f a Source #

type arg <*> arg1 :: f b Source #

type LiftA2 arg arg1 arg2 :: f c Source #

type arg *> arg1 :: f b Source #

type arg <* arg1 :: f a Source #

PApplicative Min Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Pure arg :: f a Source #

type arg <*> arg1 :: f b Source #

type LiftA2 arg arg1 arg2 :: f c Source #

type arg *> arg1 :: f b Source #

type arg <* arg1 :: f a Source #

PApplicative Dual Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type Pure arg :: f a Source #

type arg <*> arg1 :: f b Source #

type LiftA2 arg arg1 arg2 :: f c Source #

type arg *> arg1 :: f b Source #

type arg <* arg1 :: f a Source #

PApplicative Product Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type Pure arg :: f a Source #

type arg <*> arg1 :: f b Source #

type LiftA2 arg arg1 arg2 :: f c Source #

type arg *> arg1 :: f b Source #

type arg <* arg1 :: f a Source #

PApplicative Sum Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type Pure arg :: f a Source #

type arg <*> arg1 :: f b Source #

type LiftA2 arg arg1 arg2 :: f c Source #

type arg *> arg1 :: f b Source #

type arg <* arg1 :: f a Source #

PApplicative NonEmpty Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Associated Types

type Pure arg :: f a Source #

type arg <*> arg1 :: f b Source #

type LiftA2 arg arg1 arg2 :: f c Source #

type arg *> arg1 :: f b Source #

type arg <* arg1 :: f a Source #

PApplicative Maybe Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Associated Types

type Pure arg :: f a Source #

type arg <*> arg1 :: f b Source #

type LiftA2 arg arg1 arg2 :: f c Source #

type arg *> arg1 :: f b Source #

type arg <* arg1 :: f a Source #

PApplicative List Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Associated Types

type Pure arg :: f a Source #

type arg <*> arg1 :: f b Source #

type LiftA2 arg arg1 arg2 :: f c Source #

type arg *> arg1 :: f b Source #

type arg <* arg1 :: f a Source #

PApplicative (Either e) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Associated Types

type Pure arg :: f a Source #

type arg <*> arg1 :: f b Source #

type LiftA2 arg arg1 arg2 :: f c Source #

type arg *> arg1 :: f b Source #

type arg <* arg1 :: f a Source #

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

Defined in Data.Proxy.Singletons

Associated Types

type Pure arg :: f a Source #

type arg <*> arg1 :: f b Source #

type LiftA2 arg arg1 arg2 :: f c Source #

type arg *> arg1 :: f b Source #

type arg <* arg1 :: f a Source #

PApplicative ((,) a) Source # 
Instance details

Defined in Control.Applicative.Singletons

Associated Types

type Pure arg :: f a Source #

type arg <*> arg1 :: f b Source #

type LiftA2 arg arg1 arg2 :: f c Source #

type arg *> arg1 :: f b Source #

type arg <* arg1 :: f a Source #

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

Defined in Data.Functor.Const.Singletons

Associated Types

type Pure arg :: f a Source #

type arg <*> arg1 :: f b Source #

type LiftA2 arg arg1 arg2 :: f c Source #

type arg *> arg1 :: f b Source #

type arg <* arg1 :: f a Source #

PApplicative (Product f g) Source # 
Instance details

Defined in Data.Functor.Product.Singletons

Associated Types

type Pure arg :: f a Source #

type arg <*> arg1 :: f b Source #

type LiftA2 arg arg1 arg2 :: f c Source #

type arg *> arg1 :: f b Source #

type arg <* arg1 :: f a Source #

PApplicative (Compose f g) Source # 
Instance details

Defined in Data.Functor.Compose.Singletons

Associated Types

type Pure arg :: f a Source #

type arg <*> arg1 :: f b Source #

type LiftA2 arg arg1 arg2 :: f c Source #

type arg *> arg1 :: f b Source #

type arg <* arg1 :: f a Source #

class SFunctor f => SApplicative f where Source #

Minimal complete definition

sPure

Methods

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

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

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

sLiftA2 :: forall (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) :: Type Source #

default sLiftA2 :: forall (t :: (~>) a ((~>) b c)) (t :: f a) (t :: f b). (Apply (Apply (Apply LiftA2Sym0 t) t) t :: f c) ~ Apply (Apply (Apply LiftA2_6989586621679276606Sym0 t) t) t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t :: f c) :: Type Source #

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

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

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

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

Instances

Instances details
SApplicative Identity Source # 
Instance details

Defined in Data.Functor.Identity.Singletons

Methods

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

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

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) Source #

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

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

SApplicative First Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

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

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

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) Source #

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

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

SApplicative Last Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

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

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

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) Source #

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

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

SApplicative Down Source # 
Instance details

Defined in Control.Applicative.Singletons

Methods

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

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

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) Source #

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

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

SApplicative First Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

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

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) Source #

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

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

SApplicative Last Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

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

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) Source #

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

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

SApplicative Max Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

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

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) Source #

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

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

SApplicative Min Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

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

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) Source #

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

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

SApplicative Dual Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

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

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

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) Source #

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

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

SApplicative Product Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

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

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

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) Source #

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

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

SApplicative Sum Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

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

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

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) Source #

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

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

SApplicative NonEmpty Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

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

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) Source #

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

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

SApplicative Maybe Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

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

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) Source #

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

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

SApplicative List Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

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

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) Source #

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

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

SApplicative (Either e) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

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

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) Source #

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

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

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

Defined in Data.Proxy.Singletons

Methods

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

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

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) Source #

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

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

SMonoid a => SApplicative ((,) a) Source # 
Instance details

Defined in Control.Applicative.Singletons

Methods

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

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

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) Source #

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

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

SMonoid m => SApplicative (Const m :: Type -> Type) Source # 
Instance details

Defined in Data.Functor.Const.Singletons

Methods

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

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

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) Source #

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

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

(SApplicative f, SApplicative g) => SApplicative (Product f g) Source # 
Instance details

Defined in Data.Functor.Product.Singletons

Methods

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

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

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) Source #

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

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

(SApplicative f, SApplicative g) => SApplicative (Compose f g) Source # 
Instance details

Defined in Data.Functor.Compose.Singletons

Methods

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

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

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) Source #

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

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

class PMonad m Source #

Associated Types

type (arg :: m a) >>= (arg :: (~>) a (m b)) :: m b infixl 1 Source #

type (arg :: m a) >> (arg :: m b) :: m b infixl 1 Source #

type a >> a = Apply (Apply TFHelper_6989586621679276661Sym0 a) a

type Return (arg :: a) :: m a Source #

type Return a = Apply Return_6989586621679276678Sym0 a

Instances

Instances details
PMonad Identity Source # 
Instance details

Defined in Data.Functor.Identity.Singletons

Associated Types

type arg >>= arg1 :: m b Source #

type arg >> arg1 :: m b Source #

type Return arg :: m a Source #

PMonad First Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type arg >>= arg1 :: m b Source #

type arg >> arg1 :: m b Source #

type Return arg :: m a Source #

PMonad Last Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type arg >>= arg1 :: m b Source #

type arg >> arg1 :: m b Source #

type Return arg :: m a Source #

PMonad Down Source # 
Instance details

Defined in Control.Monad.Singletons

Associated Types

type arg >>= arg1 :: m b Source #

type arg >> arg1 :: m b Source #

type Return arg :: m a Source #

PMonad First Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type arg >>= arg1 :: m b Source #

type arg >> arg1 :: m b Source #

type Return arg :: m a Source #

PMonad Last Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type arg >>= arg1 :: m b Source #

type arg >> arg1 :: m b Source #

type Return arg :: m a Source #

PMonad Max Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type arg >>= arg1 :: m b Source #

type arg >> arg1 :: m b Source #

type Return arg :: m a Source #

PMonad Min Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type arg >>= arg1 :: m b Source #

type arg >> arg1 :: m b Source #

type Return arg :: m a Source #

PMonad Dual Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type arg >>= arg1 :: m b Source #

type arg >> arg1 :: m b Source #

type Return arg :: m a Source #

PMonad Product Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type arg >>= arg1 :: m b Source #

type arg >> arg1 :: m b Source #

type Return arg :: m a Source #

PMonad Sum Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Associated Types

type arg >>= arg1 :: m b Source #

type arg >> arg1 :: m b Source #

type Return arg :: m a Source #

PMonad NonEmpty Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Associated Types

type arg >>= arg1 :: m b Source #

type arg >> arg1 :: m b Source #

type Return arg :: m a Source #

PMonad Maybe Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Associated Types

type arg >>= arg1 :: m b Source #

type arg >> arg1 :: m b Source #

type Return arg :: m a Source #

PMonad List Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Associated Types

type arg >>= arg1 :: m b Source #

type arg >> arg1 :: m b Source #

type Return arg :: m a Source #

PMonad (Either e) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Associated Types

type arg >>= arg1 :: m b Source #

type arg >> arg1 :: m b Source #

type Return arg :: m a Source #

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

Defined in Data.Proxy.Singletons

Associated Types

type arg >>= arg1 :: m b Source #

type arg >> arg1 :: m b Source #

type Return arg :: m a Source #

PMonad ((,) a) Source # 
Instance details

Defined in Control.Monad.Singletons

Associated Types

type arg >>= arg1 :: m b Source #

type arg >> arg1 :: m b Source #

type Return arg :: m a Source #

PMonad (Product f g) Source # 
Instance details

Defined in Data.Functor.Product.Singletons

Associated Types

type arg >>= arg1 :: m b Source #

type arg >> arg1 :: m b Source #

type Return arg :: m a Source #

class SApplicative m => SMonad m where Source #

Minimal complete definition

(%>>=)

Methods

(%>>=) :: forall a b (t :: m a) (t :: (~>) a (m b)). Sing t -> Sing t -> Sing (Apply (Apply (>>=@#@$) t) t :: m b) infixl 1 Source #

(%>>) :: forall a b (t :: m a) (t :: m b). Sing t -> Sing t -> Sing (Apply (Apply (>>@#@$) t) t :: m b) infixl 1 Source #

default (%>>) :: forall a b (t :: m a) (t :: m b). (Apply (Apply (>>@#@$) t) t :: m b) ~ Apply (Apply TFHelper_6989586621679276661Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply (>>@#@$) t) t :: m b) Source #

sReturn :: forall (t :: a). Sing t -> Sing (Apply ReturnSym0 t :: m a) :: Type Source #

default sReturn :: forall (t :: a). (Apply ReturnSym0 t :: m a) ~ Apply Return_6989586621679276678Sym0 t => Sing t -> Sing (Apply ReturnSym0 t :: m a) :: Type Source #

Instances

Instances details
SMonad Identity Source # 
Instance details

Defined in Data.Functor.Identity.Singletons

Methods

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

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

sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source #

SMonad First Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

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

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

sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source #

SMonad Last Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

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

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

sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source #

SMonad Down Source # 
Instance details

Defined in Control.Monad.Singletons

Methods

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

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

sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source #

SMonad First Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

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

sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source #

SMonad Last Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

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

sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source #

SMonad Max Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

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

sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source #

SMonad Min Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

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

sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source #

SMonad Dual Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

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

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

sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source #

SMonad Product Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

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

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

sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source #

SMonad Sum Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Wrappers

Methods

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

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

sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source #

SMonad NonEmpty Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

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

sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source #

SMonad Maybe Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

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

sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source #

SMonad List Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

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

sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source #

SMonad (Either e) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

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

sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source #

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

Defined in Data.Proxy.Singletons

Methods

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

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

sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source #

SMonoid a => SMonad ((,) a) Source # 
Instance details

Defined in Control.Monad.Singletons

Methods

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

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

sReturn :: forall a0 (t :: a0). Sing t -> Sing (Apply ReturnSym0 t) Source #

(SMonad f, SMonad g) => SMonad (Product f g) Source # 
Instance details

Defined in Data.Functor.Product.Singletons

Methods

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

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

sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source #

class PMonadFail m Source #

Associated Types

type Fail (arg :: [Char]) :: m a Source #

Instances

Instances details
PMonadFail Maybe Source # 
Instance details

Defined in Control.Monad.Fail.Singletons

Associated Types

type Fail arg :: m a Source #

PMonadFail List Source # 
Instance details

Defined in Control.Monad.Fail.Singletons

Associated Types

type Fail arg :: m a Source #

class SMonad m => SMonadFail m where Source #

Methods

sFail :: forall (t :: [Char]). Sing t -> Sing (Apply FailSym0 t :: m a) :: Type Source #

Instances

Instances details
SMonadFail Maybe Source # 
Instance details

Defined in Control.Monad.Fail.Singletons

Methods

sFail :: forall a (t :: [Char]). Sing t -> Sing (Apply FailSym0 t) Source #

SMonadFail List Source # 
Instance details

Defined in Control.Monad.Fail.Singletons

Methods

sFail :: forall a (t :: [Char]). Sing t -> Sing (Apply FailSym0 t) Source #

type family MapM_ (a :: (~>) a (m b)) (a :: t a) :: m () where ... Source #

Equations

MapM_ f a_6989586621680110482 = Apply (Apply (Apply FoldrSym0 (Apply (Apply (.@#@$) (>>@#@$)) f)) (Apply ReturnSym0 Tuple0Sym0)) a_6989586621680110482 

sMapM_ :: forall (t :: (~>) a (m b)) (t :: t a). (SFoldable t, SMonad m) => Sing t -> Sing t -> Sing (Apply (Apply MapM_Sym0 t) t :: m ()) :: Type Source #

type family Sequence_ (a :: t (m a)) :: m () where ... Source #

Equations

Sequence_ a_6989586621680110459 = Apply (Apply (Apply FoldrSym0 (>>@#@$)) (Apply ReturnSym0 Tuple0Sym0)) a_6989586621680110459 

sSequence_ :: forall (t :: t (m a)). (SFoldable t, SMonad m) => Sing t -> Sing (Apply Sequence_Sym0 t :: m ()) :: Type Source #

type family (a :: (~>) a (m b)) =<< (a :: m a) :: m b where ... infixr 1 Source #

Equations

f =<< x = Apply (Apply (>>=@#@$) x) f 

(%=<<) :: forall (t :: (~>) a (m b)) (t :: m a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply (=<<@#@$) t) t :: m b) :: Type infixr 1 Source #

Folds and traversals

class PFoldable t Source #

Associated Types

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

type FoldMap a a = Apply (Apply FoldMap_6989586621680110630Sym0 a) a

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

type Foldr a a a = Apply (Apply (Apply Foldr_6989586621680110644Sym0 a) a) a

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

type Foldl a a a = Apply (Apply (Apply Foldl_6989586621680110682Sym0 a) a) a

type Foldr1 (arg :: (~>) a ((~>) a a)) (arg :: t a) :: a Source #

type Foldr1 a a = Apply (Apply Foldr1_6989586621680110719Sym0 a) a

type Foldl1 (arg :: (~>) a ((~>) a a)) (arg :: t a) :: a Source #

type Foldl1 a a = Apply (Apply Foldl1_6989586621680110740Sym0 a) a

type Elem (arg :: a) (arg :: t a) :: Bool Source #

type Elem a a = Apply (Apply Elem_6989586621680110805Sym0 a) a

type Maximum (arg :: t a) :: a Source #

type Maximum a = Apply Maximum_6989586621680110819Sym0 a

type Minimum (arg :: t a) :: a Source #

type Minimum a = Apply Minimum_6989586621680110834Sym0 a

type Sum (arg :: t a) :: a Source #

type Sum a = Apply Sum_6989586621680110849Sym0 a

type Product (arg :: t a) :: a Source #

type Product a = Apply Product_6989586621680110858Sym0 a

Instances

Instances details
PFoldable Identity Source # 
Instance details

Defined in Data.Functor.Identity.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

PFoldable First Source # 
Instance details

Defined in Data.Foldable.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

PFoldable Last Source # 
Instance details

Defined in Data.Foldable.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

PFoldable First Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

PFoldable Last Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

PFoldable Max Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

PFoldable Min Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

PFoldable Dual Source # 
Instance details

Defined in Data.Foldable.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

PFoldable Product Source # 
Instance details

Defined in Data.Foldable.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

PFoldable Sum Source # 
Instance details

Defined in Data.Foldable.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

PFoldable NonEmpty Source # 
Instance details

Defined in Data.Foldable.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

PFoldable Maybe Source # 
Instance details

Defined in Data.Foldable.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

PFoldable List Source # 
Instance details

Defined in Data.Foldable.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

PFoldable (Either a) Source # 
Instance details

Defined in Data.Foldable.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

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

Defined in Data.Foldable.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

PFoldable (Arg a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

PFoldable ((,) a) Source # 
Instance details

Defined in Data.Foldable.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

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

Defined in Data.Functor.Const.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

PFoldable (Product f g) Source # 
Instance details

Defined in Data.Functor.Product.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

PFoldable (Sum f g) Source # 
Instance details

Defined in Data.Functor.Sum.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

PFoldable (Compose f g) Source # 
Instance details

Defined in Data.Functor.Compose.Singletons

Associated Types

type Fold arg :: m Source #

type FoldMap arg arg1 :: m Source #

type Foldr arg arg1 arg2 :: b Source #

type Foldr' arg arg1 arg2 :: b Source #

type Foldl arg arg1 arg2 :: b Source #

type Foldl' arg arg1 arg2 :: b Source #

type Foldr1 arg arg1 :: a Source #

type Foldl1 arg arg1 :: a Source #

type ToList arg :: [a] Source #

type Null arg :: Bool Source #

type Length arg :: Natural Source #

type Elem arg arg1 :: Bool Source #

type Maximum arg :: a Source #

type Minimum arg :: a Source #

type Sum arg :: a Source #

type Product arg :: a Source #

class SFoldable t where Source #

Minimal complete definition

Nothing

Methods

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

default sFoldMap :: forall (t :: (~>) a m) (t :: t a). ((Apply (Apply FoldMapSym0 t) t :: m) ~ Apply (Apply FoldMap_6989586621680110630Sym0 t) t, SMonoid m) => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t :: m) :: Type Source #

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

default sFoldr :: forall (t :: (~>) a ((~>) b b)) (t :: b) (t :: t a). (Apply (Apply (Apply FoldrSym0 t) t) t :: b) ~ Apply (Apply (Apply Foldr_6989586621680110644Sym0 t) t) t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t :: b) :: Type Source #

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

default sFoldl :: forall (t :: (~>) b ((~>) a b)) (t :: b) (t :: t a). (Apply (Apply (Apply FoldlSym0 t) t) t :: b) ~ Apply (Apply (Apply Foldl_6989586621680110682Sym0 t) t) t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t :: b) :: Type Source #

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

default sFoldr1 :: forall (t :: (~>) a ((~>) a a)) (t :: t a). (Apply (Apply Foldr1Sym0 t) t :: a) ~ Apply (Apply Foldr1_6989586621680110719Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t :: a) :: Type Source #

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

default sFoldl1 :: forall (t :: (~>) a ((~>) a a)) (t :: t a). (Apply (Apply Foldl1Sym0 t) t :: a) ~ Apply (Apply Foldl1_6989586621680110740Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t :: a) :: Type Source #

sElem :: forall (t :: a) (t :: t a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t :: Bool) :: Type Source #

default sElem :: forall (t :: a) (t :: t a). ((Apply (Apply ElemSym0 t) t :: Bool) ~ Apply (Apply Elem_6989586621680110805Sym0 t) t, SEq a) => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t :: Bool) :: Type Source #

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

default sMaximum :: forall a (t :: t a). ((Apply MaximumSym0 t :: a) ~ Apply Maximum_6989586621680110819Sym0 t, SOrd a) => Sing t -> Sing (Apply MaximumSym0 t :: a) Source #

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

default sMinimum :: forall a (t :: t a). ((Apply MinimumSym0 t :: a) ~ Apply Minimum_6989586621680110834Sym0 t, SOrd a) => Sing t -> Sing (Apply MinimumSym0 t :: a) Source #

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

default sSum :: forall (t :: t a). ((Apply SumSym0 t :: a) ~ Apply Sum_6989586621680110849Sym0 t, SNum a) => Sing t -> Sing (Apply SumSym0 t :: a) :: Type Source #

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

default sProduct :: forall (t :: t a). ((Apply ProductSym0 t :: a) ~ Apply Product_6989586621680110858Sym0 t, SNum a) => Sing t -> Sing (Apply ProductSym0 t :: a) :: Type Source #

Instances

Instances details
SFoldable Identity Source # 
Instance details

Defined in Data.Functor.Identity.Singletons

Methods

sFold :: forall m (t1 :: Identity m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source #

sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Identity a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) Source #

sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Identity a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source #

sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Identity a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source #

sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Identity a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source #

sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Identity a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source #

sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Identity a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source #

sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Identity a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source #

sToList :: forall a (t1 :: Identity a). Sing t1 -> Sing (Apply ToListSym0 t1) Source #

sNull :: forall a (t1 :: Identity a). Sing t1 -> Sing (Apply NullSym0 t1) Source #

sLength :: forall a (t1 :: Identity a). Sing t1 -> Sing (Apply LengthSym0 t1) Source #

sElem :: forall a (t1 :: a) (t2 :: Identity a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source #

sMaximum :: forall a (t1 :: Identity a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source #

sMinimum :: forall a (t1 :: Identity a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source #

sSum :: forall a (t1 :: Identity a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source #

sProduct :: forall a (t1 :: Identity a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source #

SFoldable First Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sFold :: forall m (t1 :: First m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source #

sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: First a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) Source #

sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source #

sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source #

sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source #

sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source #

sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source #

sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source #

sToList :: forall a (t1 :: First a). Sing t1 -> Sing (Apply ToListSym0 t1) Source #

sNull :: forall a (t1 :: First a). Sing t1 -> Sing (Apply NullSym0 t1) Source #

sLength :: forall a (t1 :: First a). Sing t1 -> Sing (Apply LengthSym0 t1) Source #

sElem :: forall a (t1 :: a) (t2 :: First a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source #

sMaximum :: forall a (t1 :: First a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source #

sMinimum :: forall a (t1 :: First a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source #

sSum :: forall a (t1 :: First a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source #

sProduct :: forall a (t1 :: First a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source #

SFoldable Last Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sFold :: forall m (t1 :: Last m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source #

sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Last a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) Source #

sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source #

sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source #

sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source #

sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source #

sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source #

sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source #

sToList :: forall a (t1 :: Last a). Sing t1 -> Sing (Apply ToListSym0 t1) Source #

sNull :: forall a (t1 :: Last a). Sing t1 -> Sing (Apply NullSym0 t1) Source #

sLength :: forall a (t1 :: Last a). Sing t1 -> Sing (Apply LengthSym0 t1) Source #

sElem :: forall a (t1 :: a) (t2 :: Last a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source #

sMaximum :: forall a (t1 :: Last a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source #

sMinimum :: forall a (t1 :: Last a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source #

sSum :: forall a (t1 :: Last a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source #

sProduct :: forall a (t1 :: Last a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source #

SFoldable First Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sFold :: forall m (t1 :: First m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source #

sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: First a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) Source #

sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source #

sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source #

sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source #

sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source #

sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source #

sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source #

sToList :: forall a (t1 :: First a). Sing t1 -> Sing (Apply ToListSym0 t1) Source #

sNull :: forall a (t1 :: First a). Sing t1 -> Sing (Apply NullSym0 t1) Source #

sLength :: forall a (t1 :: First a). Sing t1 -> Sing (Apply LengthSym0 t1) Source #

sElem :: forall a (t1 :: a) (t2 :: First a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source #

sMaximum :: forall a (t1 :: First a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source #

sMinimum :: forall a (t1 :: First a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source #

sSum :: forall a (t1 :: First a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source #

sProduct :: forall a (t1 :: First a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source #

SFoldable Last Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sFold :: forall m (t1 :: Last m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source #

sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Last a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) Source #

sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source #

sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source #

sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source #

sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source #

sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source #

sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source #

sToList :: forall a (t1 :: Last a). Sing t1 -> Sing (Apply ToListSym0 t1) Source #

sNull :: forall a (t1 :: Last a). Sing t1 -> Sing (Apply NullSym0 t1) Source #

sLength :: forall a (t1 :: Last a). Sing t1 -> Sing (Apply LengthSym0 t1) Source #

sElem :: forall a (t1 :: a) (t2 :: Last a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source #

sMaximum :: forall a (t1 :: Last a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source #

sMinimum :: forall a (t1 :: Last a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source #

sSum :: forall a (t1 :: Last a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source #

sProduct :: forall a (t1 :: Last a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source #

SFoldable Max Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sFold :: forall m (t1 :: Max m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source #

sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Max a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) Source #

sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Max a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source #

sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Max a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source #

sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Max a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source #

sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Max a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source #

sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Max a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source #

sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Max a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source #

sToList :: forall a (t1 :: Max a). Sing t1 -> Sing (Apply ToListSym0 t1) Source #

sNull :: forall a (t1 :: Max a). Sing t1 -> Sing (Apply NullSym0 t1) Source #

sLength :: forall a (t1 :: Max a). Sing t1 -> Sing (Apply LengthSym0 t1) Source #

sElem :: forall a (t1 :: a) (t2 :: Max a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source #

sMaximum :: forall a (t1 :: Max a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source #

sMinimum :: forall a (t1 :: Max a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source #

sSum :: forall a (t1 :: Max a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source #

sProduct :: forall a (t1 :: Max a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source #

SFoldable Min Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sFold :: forall m (t1 :: Min m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source #

sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Min a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) Source #

sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Min a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source #

sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Min a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source #

sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Min a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source #

sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Min a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source #

sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Min a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source #

sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Min a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source #

sToList :: forall a (t1 :: Min a). Sing t1 -> Sing (Apply ToListSym0 t1) Source #

sNull :: forall a (t1 :: Min a). Sing t1 -> Sing (Apply NullSym0 t1) Source #

sLength :: forall a (t1 :: Min a). Sing t1 -> Sing (Apply LengthSym0 t1) Source #

sElem :: forall a (t1 :: a) (t2 :: Min a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source #

sMaximum :: forall a (t1 :: Min a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source #

sMinimum :: forall a (t1 :: Min a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source #

sSum :: forall a (t1 :: Min a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source #

sProduct :: forall a (t1 :: Min a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source #

SFoldable Dual Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sFold :: forall m (t1 :: Dual m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source #

sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Dual a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) Source #

sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Dual a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source #

sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Dual a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source #

sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Dual a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source #

sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Dual a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source #

sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Dual a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source #

sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Dual a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source #

sToList :: forall a (t1 :: Dual a). Sing t1 -> Sing (Apply ToListSym0 t1) Source #

sNull :: forall a (t1 :: Dual a). Sing t1 -> Sing (Apply NullSym0 t1) Source #

sLength :: forall a (t1 :: Dual a). Sing t1 -> Sing (Apply LengthSym0 t1) Source #

sElem :: forall a (t1 :: a) (t2 :: Dual a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source #

sMaximum :: forall a (t1 :: Dual a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source #

sMinimum :: forall a (t1 :: Dual a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source #

sSum :: forall a (t1 :: Dual a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source #

sProduct :: forall a (t1 :: Dual a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source #

SFoldable Product Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sFold :: forall m (t1 :: Product m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source #

sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Product a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) Source #

sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Product a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source #

sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Product a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source #

sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Product a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source #

sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Product a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source #

sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Product a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source #

sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Product a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source #

sToList :: forall a (t1 :: Product a). Sing t1 -> Sing (Apply ToListSym0 t1) Source #

sNull :: forall a (t1 :: Product a). Sing t1 -> Sing (Apply NullSym0 t1) Source #

sLength :: forall a (t1 :: Product a). Sing t1 -> Sing (Apply LengthSym0 t1) Source #

sElem :: forall a (t1 :: a) (t2 :: Product a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source #

sMaximum :: forall a (t1 :: Product a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source #

sMinimum :: forall a (t1 :: Product a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source #

sSum :: forall a (t1 :: Product a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source #

sProduct :: forall a (t1 :: Product a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source #

SFoldable Sum Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

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

sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Sum a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) Source #

sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Sum a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source #

sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Sum a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source #

sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Sum a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source #

sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Sum a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source #

sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Sum a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source #

sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Sum a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source #

sToList :: forall a (t1 :: Sum a). Sing t1 -> Sing (Apply ToListSym0 t1) Source #

sNull :: forall a (t1 :: Sum a). Sing t1 -> Sing (Apply NullSym0 t1) Source #

sLength :: forall a (t1 :: Sum a). Sing t1 -> Sing (Apply LengthSym0 t1) Source #

sElem :: forall a (t1 :: a) (t2 :: Sum a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source #

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

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

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

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

SFoldable NonEmpty Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sFold :: forall m (t1 :: NonEmpty m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source #

sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: NonEmpty a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) Source #

sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source #

sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source #

sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source #

sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source #

sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source #

sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source #

sToList :: forall a (t1 :: NonEmpty a). Sing t1 -> Sing (Apply ToListSym0 t1) Source #

sNull :: forall a (t1 :: NonEmpty a). Sing t1 -> Sing (Apply NullSym0 t1) Source #

sLength :: forall a (t1 :: NonEmpty a). Sing t1 -> Sing (Apply LengthSym0 t1) Source #

sElem :: forall a (t1 :: a) (t2 :: NonEmpty a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source #

sMaximum :: forall a (t1 :: NonEmpty a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source #

sMinimum :: forall a (t1 :: NonEmpty a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source #

sSum :: forall a (t1 :: NonEmpty a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source #

sProduct :: forall a (t1 :: NonEmpty a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source #

SFoldable Maybe Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sFold :: forall m (t1 :: Maybe m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source #

sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Maybe a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) Source #

sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source #

sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source #

sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source #

sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source #

sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source #

sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source #

sToList :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply ToListSym0 t1) Source #

sNull :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply NullSym0 t1) Source #

sLength :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply LengthSym0 t1) Source #

sElem :: forall a (t1 :: a) (t2 :: Maybe a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source #

sMaximum :: forall a (t1 :: Maybe a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source #

sMinimum :: forall a (t1 :: Maybe a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source #

sSum :: forall a (t1 :: Maybe a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source #

sProduct :: forall a (t1 :: Maybe a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source #

SFoldable List Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sFold :: forall m (t1 :: [m]). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source #

sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: [a]). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) Source #

sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: [a]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source #

sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: [a]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source #

sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: [a]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source #

sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: [a]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source #

sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source #

sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source #

sToList :: forall a (t1 :: [a]). Sing t1 -> Sing (Apply ToListSym0 t1) Source #

sNull :: forall a (t1 :: [a]). Sing t1 -> Sing (Apply NullSym0 t1) Source #

sLength :: forall a (t1 :: [a]). Sing t1 -> Sing (Apply LengthSym0 t1) Source #

sElem :: forall a (t1 :: a) (t2 :: [a]). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source #

sMaximum :: forall a (t1 :: [a]). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source #

sMinimum :: forall a (t1 :: [a]). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source #

sSum :: forall a (t1 :: [a]). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source #

sProduct :: forall a (t1 :: [a]). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source #

SFoldable (Either a) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sFold :: forall m (t1 :: Either a m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source #

sFoldMap :: forall a0 m (t1 :: a0 ~> m) (t2 :: Either a a0). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) Source #

sFoldr :: forall a0 b (t1 :: a0 ~> (b ~> b)) (t2 :: b) (t3 :: Either a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source #

sFoldr' :: forall a0 b (t1 :: a0 ~> (b ~> b)) (t2 :: b) (t3 :: Either a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source #

sFoldl :: forall b a0 (t1 :: b ~> (a0 ~> b)) (t2 :: b) (t3 :: Either a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source #

sFoldl' :: forall b a0 (t1 :: b ~> (a0 ~> b)) (t2 :: b) (t3 :: Either a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source #

sFoldr1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: Either a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source #

sFoldl1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: Either a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source #

sToList :: forall a0 (t1 :: Either a a0). Sing t1 -> Sing (Apply ToListSym0 t1) Source #

sNull :: forall a0 (t1 :: Either a a0). Sing t1 -> Sing (Apply NullSym0 t1) Source #

sLength :: forall a0 (t1 :: Either a a0). Sing t1 -> Sing (Apply LengthSym0 t1) Source #

sElem :: forall a0 (t1 :: a0) (t2 :: Either a a0). SEq a0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source #

sMaximum :: forall a0 (t1 :: Either a a0). SOrd a0 => Sing t1 -> Sing (Apply MaximumSym0 t1) Source #

sMinimum :: forall a0 (t1 :: Either a a0). SOrd a0 => Sing t1 -> Sing (Apply MinimumSym0 t1) Source #

sSum :: forall a0 (t1 :: Either a a0). SNum a0 => Sing t1 -> Sing (Apply SumSym0 t1) Source #

sProduct :: forall a0 (t1 :: Either a a0). SNum a0 => Sing t1 -> Sing (Apply ProductSym0 t1) Source #

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

Defined in Data.Foldable.Singletons

Methods

sFold :: forall m (t1 :: Proxy m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source #

sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Proxy a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) Source #

sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Proxy a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source #

sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Proxy a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source #

sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Proxy a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source #

sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Proxy a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source #

sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Proxy a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source #

sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Proxy a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source #

sToList :: forall a (t1 :: Proxy a). Sing t1 -> Sing (Apply ToListSym0 t1) Source #

sNull :: forall a (t1 :: Proxy a). Sing t1 -> Sing (Apply NullSym0 t1) Source #

sLength :: forall a (t1 :: Proxy a). Sing t1 -> Sing (Apply LengthSym0 t1) Source #

sElem :: forall a (t1 :: a) (t2 :: Proxy a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source #

sMaximum :: forall a (t1 :: Proxy a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source #

sMinimum :: forall a (t1 :: Proxy a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source #

sSum :: forall a (t1 :: Proxy a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source #

sProduct :: forall a (t1 :: Proxy a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source #

SFoldable (Arg a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sFold :: forall m (t1 :: Arg a m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source #

sFoldMap :: forall a0 m (t1 :: a0 ~> m) (t2 :: Arg a a0). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) Source #

sFoldr :: forall a0 b (t1 :: a0 ~> (b ~> b)) (t2 :: b) (t3 :: Arg a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source #

sFoldr' :: forall a0 b (t1 :: a0 ~> (b ~> b)) (t2 :: b) (t3 :: Arg a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source #

sFoldl :: forall b a0 (t1 :: b ~> (a0 ~> b)) (t2 :: b) (t3 :: Arg a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source #

sFoldl' :: forall b a0 (t1 :: b ~> (a0 ~> b)) (t2 :: b) (t3 :: Arg a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source #

sFoldr1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: Arg a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source #

sFoldl1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: Arg a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source #

sToList :: forall a0 (t1 :: Arg a a0). Sing t1 -> Sing (Apply ToListSym0 t1) Source #

sNull :: forall a0 (t1 :: Arg a a0). Sing t1 -> Sing (Apply NullSym0 t1) Source #

sLength :: forall a0 (t1 :: Arg a a0). Sing t1 -> Sing (Apply LengthSym0 t1) Source #

sElem :: forall a0 (t1 :: a0) (t2 :: Arg a a0). SEq a0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source #

sMaximum :: forall a0 (t1 :: Arg a a0). SOrd a0 => Sing t1 -> Sing (Apply MaximumSym0 t1) Source #

sMinimum :: forall a0 (t1 :: Arg a a0). SOrd a0 => Sing t1 -> Sing (Apply MinimumSym0 t1) Source #

sSum :: forall a0 (t1 :: Arg a a0). SNum a0 => Sing t1 -> Sing (Apply SumSym0 t1) Source #

sProduct :: forall a0 (t1 :: Arg a a0). SNum a0 => Sing t1 -> Sing (Apply ProductSym0 t1) Source #

SFoldable ((,) a) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sFold :: forall m (t1 :: (a, m)). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source #

sFoldMap :: forall a0 m (t1 :: a0 ~> m) (t2 :: (a, a0)). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) Source #

sFoldr :: forall a0 b (t1 :: a0 ~> (b ~> b)) (t2 :: b) (t3 :: (a, a0)). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source #

sFoldr' :: forall a0 b (t1 :: a0 ~> (b ~> b)) (t2 :: b) (t3 :: (a, a0)). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source #

sFoldl :: forall b a0 (t1 :: b ~> (a0 ~> b)) (t2 :: b) (t3 :: (a, a0)). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source #

sFoldl' :: forall b a0 (t1 :: b ~> (a0 ~> b)) (t2 :: b) (t3 :: (a, a0)). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source #

sFoldr1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: (a, a0)). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source #

sFoldl1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: (a, a0)). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source #

sToList :: forall a0 (t1 :: (a, a0)). Sing t1 -> Sing (Apply ToListSym0 t1) Source #

sNull :: forall a0 (t1 :: (a, a0)). Sing t1 -> Sing (Apply NullSym0 t1) Source #

sLength :: forall a0 (t1 :: (a, a0)). Sing t1 -> Sing (Apply LengthSym0 t1) Source #

sElem :: forall a0 (t1 :: a0) (t2 :: (a, a0)). SEq a0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source #

sMaximum :: forall a0 (t1 :: (a, a0)). SOrd a0 => Sing t1 -> Sing (Apply MaximumSym0 t1) Source #

sMinimum :: forall a0 (t1 :: (a, a0)). SOrd a0 => Sing t1 -> Sing (Apply MinimumSym0 t1) Source #

sSum :: forall a0 (t1 :: (a, a0)). SNum a0 => Sing t1 -> Sing (Apply SumSym0 t1) Source #

sProduct :: forall a0 (t1 :: (a, a0)). SNum a0 => Sing t1 -> Sing (Apply ProductSym0 t1) Source #

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

Defined in Data.Functor.Const.Singletons

Methods

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

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

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) Source #

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) Source #

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) Source #

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) Source #

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

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

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

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

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

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

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

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

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

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

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

Defined in Data.Functor.Product.Singletons

Methods

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

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

sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Product f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source #

sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Product f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source #

sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Product f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source #

sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Product f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source #

sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Product f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source #

sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Product f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source #

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

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

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

sElem :: forall a (t1 :: a) (t2 :: Product f g a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source #

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

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

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

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

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

Defined in Data.Functor.Sum.Singletons

Methods

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Defined in Data.Functor.Compose.Singletons

Methods

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

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

sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Compose f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source #

sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Compose f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source #

sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Compose f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source #

sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Compose f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source #

sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Compose f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source #

sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Compose f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source #

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

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

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

sElem :: forall a (t1 :: a) (t2 :: Compose f g a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source #

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

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

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

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

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_6989586621680379960Sym0 a) a

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

type SequenceA a = Apply SequenceA_6989586621680379972Sym0 a

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

type MapM a a = Apply (Apply MapM_6989586621680379982Sym0 a) a

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

type Sequence a = Apply Sequence_6989586621680379996Sym0 a

Instances

Instances details
PTraversable Identity Source # 
Instance details

Defined in Data.Traversable.Singletons

Associated Types

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

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

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

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

PTraversable First Source # 
Instance details

Defined in Data.Traversable.Singletons

Associated Types

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

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

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

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

PTraversable Last Source # 
Instance details

Defined in Data.Traversable.Singletons

Associated Types

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

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

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

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

PTraversable First Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

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

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

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

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

PTraversable Last Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

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

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

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

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

PTraversable Max Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

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

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

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

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

PTraversable Min Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

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

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

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

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

PTraversable Dual Source # 
Instance details

Defined in Data.Traversable.Singletons

Associated Types

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

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

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

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

PTraversable Product Source # 
Instance details

Defined in Data.Traversable.Singletons

Associated Types

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

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

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

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

PTraversable Sum Source # 
Instance details

Defined in Data.Traversable.Singletons

Associated Types

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

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

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

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

PTraversable NonEmpty Source # 
Instance details

Defined in Data.Traversable.Singletons

Associated Types

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

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

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

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

PTraversable Maybe Source # 
Instance details

Defined in Data.Traversable.Singletons

Associated Types

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

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

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

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

PTraversable List Source # 
Instance details

Defined in Data.Traversable.Singletons

Associated Types

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

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

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

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

PTraversable (Either a) Source # 
Instance details

Defined in Data.Traversable.Singletons

Associated Types

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

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

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

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

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

Defined in Data.Traversable.Singletons

Associated Types

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

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

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

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

PTraversable (Arg a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

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

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

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

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

PTraversable ((,) a) Source # 
Instance details

Defined in Data.Traversable.Singletons

Associated Types

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

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

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

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

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

Defined in Data.Traversable.Singletons

Associated Types

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

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

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

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

PTraversable (Product f g) Source # 
Instance details

Defined in Data.Functor.Product.Singletons

Associated Types

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

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

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

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

PTraversable (Sum f g) Source # 
Instance details

Defined in Data.Functor.Sum.Singletons

Associated Types

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

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

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

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

PTraversable (Compose f g) Source # 
Instance details

Defined in Data.Functor.Compose.Singletons

Associated Types

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

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

type MapM arg arg1 :: 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 (t :: (~>) a (f b)) (t :: t a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t :: f (t b)) :: Type Source #

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

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

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

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

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

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

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

Instances

Instances details
STraversable Identity Source # 
Instance details

Defined in Data.Traversable.Singletons

Methods

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

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

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

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

STraversable First Source # 
Instance details

Defined in Data.Traversable.Singletons

Methods

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

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

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

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

STraversable Last Source # 
Instance details

Defined in Data.Traversable.Singletons

Methods

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

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

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

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

STraversable First Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

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

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

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

STraversable Last Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

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

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

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

STraversable Max Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

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

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

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

STraversable Min Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

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

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

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

STraversable Dual Source # 
Instance details

Defined in Data.Traversable.Singletons

Methods

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

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

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

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

STraversable Product Source # 
Instance details

Defined in Data.Traversable.Singletons

Methods

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

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

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

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

STraversable Sum Source # 
Instance details

Defined in Data.Traversable.Singletons

Methods

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

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

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

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

STraversable NonEmpty Source # 
Instance details

Defined in Data.Traversable.Singletons

Methods

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

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

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

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

STraversable Maybe Source # 
Instance details

Defined in Data.Traversable.Singletons

Methods

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

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

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

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

STraversable List Source # 
Instance details

Defined in Data.Traversable.Singletons

Methods

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

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

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

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

STraversable (Either a) Source # 
Instance details

Defined in Data.Traversable.Singletons

Methods

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

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

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

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

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

Defined in Data.Traversable.Singletons

Methods

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

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

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

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

STraversable (Arg a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

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

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

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

STraversable ((,) a) Source # 
Instance details

Defined in Data.Traversable.Singletons

Methods

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

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

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

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

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

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) Source #

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

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) Source #

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

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

Defined in Data.Functor.Product.Singletons

Methods

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

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

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

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

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

Defined in Data.Functor.Sum.Singletons

Methods

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

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

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

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

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

Defined in Data.Functor.Compose.Singletons

Methods

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

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

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

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

Miscellaneous functions

type family Id (a :: a) :: a where ... Source #

Equations

Id x = x 

sId :: forall (t :: a). Sing t -> Sing (Apply IdSym0 t :: a) :: Type Source #

type family Const (a :: a) (a :: b) :: a where ... Source #

Equations

Const x _ = x 

sConst :: forall (t :: a) (t :: b). Sing t -> Sing t -> Sing (Apply (Apply ConstSym0 t) t :: a) :: Type Source #

type family ((a :: (~>) b c) . (a :: (~>) a b)) (a :: a) :: c where ... infixr 9 Source #

Equations

(f . g) a_6989586621679144168 = Apply (Apply (Apply (Apply Lambda_6989586621679144180Sym0 f) g) a_6989586621679144168) a_6989586621679144168 

(%.) :: forall (t :: (~>) b c) (t :: (~>) a b) (t :: a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply (.@#@$) t) t) t :: c) :: Type infixr 9 Source #

type family Flip (a :: (~>) a ((~>) b c)) (a :: b) (a :: a) :: c where ... Source #

Equations

Flip f x y = Apply (Apply f y) x 

sFlip :: forall (t :: (~>) a ((~>) b c)) (t :: b) (t :: a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FlipSym0 t) t) t :: c) :: Type Source #

type family (a :: (~>) a b) $ (a :: a) :: b where ... infixr 0 Source #

Equations

f $ x = Apply f x 

(%$) :: forall (t :: (~>) a b) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply ($@#@$) t) t :: b) :: Type infixr 0 Source #

type family Until (a :: (~>) a Bool) (a :: (~>) a a) (a :: a) :: a where ... Source #

Equations

Until p f a_6989586621679144110 = Apply (Let6989586621679144122GoSym3 p f a_6989586621679144110) a_6989586621679144110 

sUntil :: forall (t :: (~>) a Bool) (t :: (~>) a a) (t :: a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply UntilSym0 t) t) t :: a) :: Type Source #

type family AsTypeOf (a :: a) (a :: a) :: a where ... Source #

Equations

AsTypeOf a_6989586621679144147 a_6989586621679144149 = Apply (Apply ConstSym0 a_6989586621679144147) a_6989586621679144149 

sAsTypeOf :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply AsTypeOfSym0 t) t :: a) :: Type Source #

type family Error (str :: Symbol) :: a where ... Source #

A promoted version of error. This implements Error as a stuck type family with a Symbol argument. Depending on your needs, you might also consider the following alternatives:

  • Data.Singletons.Base.PolyError provides PolyError, which generalizes the argument to be kind-polymorphic. This allows passing additional information to the error besides raw Symbols.
  • Data.Singletons.Base.TypeError provides TypeError, a slightly modified version of the custom type error machinery found in GHC.TypeLits. This allows emitting error messages as compiler errors rather than as stuck type families.

sError :: HasCallStack => Sing (str :: Symbol) -> a Source #

The singleton for error.

type family ErrorWithoutStackTrace (str :: Symbol) :: a where ... Source #

The promotion of errorWithoutStackTrace.

sErrorWithoutStackTrace :: Sing (str :: Symbol) -> a Source #

The singleton for errorWithoutStackTrace.

type family Undefined :: a where ... Source #

The promotion of undefined.

sUndefined :: HasCallStack => a Source #

The singleton for undefined.

type family Seq (a :: a) (a :: b) :: b where ... infixr 0 Source #

Equations

Seq _ x = x 

sSeq :: forall (t :: a) (t :: b). Sing t -> Sing t -> Sing (Apply (Apply SeqSym0 t) t :: b) :: Type infixr 0 Source #

type family (a :: (~>) a b) $! (a :: a) :: b where ... infixr 0 Source #

Equations

f $! x = Apply f (Let6989586621679144138VxSym2 f x) 

(%$!) :: forall (t :: (~>) a b) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply ($!@#@$) t) t :: b) :: Type infixr 0 Source #

List operations

type family Map (a :: (~>) a b) (a :: [a]) :: [b] where ... Source #

Equations

Map _ '[] = NilSym0 
Map f ('(:) x xs) = Apply (Apply (:@#@$) (Apply f x)) (Apply (Apply MapSym0 f) xs) 

sMap :: forall (t :: (~>) a b) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply MapSym0 t) t :: [b]) :: Type Source #

type family (a :: [a]) ++ (a :: [a]) :: [a] where ... infixr 5 Source #

Equations

'[] ++ ys = ys 
('(:) x xs) ++ ys = Apply (Apply (:@#@$) x) (Apply (Apply (++@#@$) xs) ys) 

(%++) :: forall (t :: [a]) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply (++@#@$) t) t :: [a]) :: Type infixr 5 Source #

type family Filter (a :: (~>) a Bool) (a :: [a]) :: [a] where ... Source #

Equations

Filter _p '[] = NilSym0 
Filter p ('(:) x xs) = Case_6989586621679653538 p x xs (Let6989586621679653536Scrutinee_6989586621679650067Sym3 p x xs) 

sFilter :: forall (t :: (~>) a Bool) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply FilterSym0 t) t :: [a]) :: Type Source #

type family Head (a :: [a]) :: a where ... Source #

Equations

Head ('(:) a _) = a 
Head '[] = Apply ErrorSym0 "Data.Singletons.List.head: empty list" 

sHead :: forall (t :: [a]). Sing t -> Sing (Apply HeadSym0 t :: a) :: Type Source #

type family Last (a :: [a]) :: a where ... Source #

Equations

Last '[] = Apply ErrorSym0 "Data.Singletons.List.last: empty list" 
Last '[x] = x 
Last ('(:) _ ('(:) x xs)) = Apply LastSym0 (Apply (Apply (:@#@$) x) xs) 

sLast :: forall (t :: [a]). Sing t -> Sing (Apply LastSym0 t :: a) :: Type Source #

type family Tail (a :: [a]) :: [a] where ... Source #

Equations

Tail ('(:) _ t) = t 
Tail '[] = Apply ErrorSym0 "Data.Singletons.List.tail: empty list" 

sTail :: forall (t :: [a]). Sing t -> Sing (Apply TailSym0 t :: [a]) :: Type Source #

type family Init (a :: [a]) :: [a] where ... Source #

Equations

Init '[] = Apply ErrorSym0 "Data.Singletons.List.init: empty list" 
Init ('(:) x xs) = Apply (Apply (Let6989586621679654281Init'Sym2 x xs) x) xs 

sInit :: forall (t :: [a]). Sing t -> Sing (Apply InitSym0 t :: [a]) :: Type Source #

type family (a :: [a]) !! (a :: Natural) :: a where ... infixl 9 Source #

Equations

'[] !! _ = Apply ErrorSym0 "Data.Singletons.List.!!: index too large" 
('(:) x xs) !! n = Case_6989586621679653145 x xs n (Let6989586621679653143Scrutinee_6989586621679650107Sym3 x xs n) 

(%!!) :: forall (t :: [a]) (t :: Natural). Sing t -> Sing t -> Sing (Apply (Apply (!!@#@$) t) t :: a) :: Type infixl 9 Source #

type family Null (arg :: t a) :: Bool Source #

Instances

Instances details
type Null (a2 :: Identity a1) Source # 
Instance details

Defined in Data.Functor.Identity.Singletons

type Null (a2 :: Identity a1)
type Null (arg :: First a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Null (arg :: First a)
type Null (arg :: Last a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Null (arg :: Last a)
type Null (arg :: First a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

type Null (arg :: First a)
type Null (arg :: Last a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

type Null (arg :: Last a)
type Null (arg :: Max a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

type Null (arg :: Max a)
type Null (arg :: Min a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

type Null (arg :: Min a)
type Null (a2 :: Dual a1) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Null (a2 :: Dual a1)
type Null (a2 :: Product a1) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Null (a2 :: Product a1)
type Null (a2 :: Sum a1) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Null (a2 :: Sum a1)
type Null (arg :: NonEmpty a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Null (arg :: NonEmpty a)
type Null (arg :: Maybe a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Null (arg :: Maybe a)
type Null (a2 :: [a1]) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Null (a2 :: [a1])
type Null (a3 :: Either a1 a2) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Null (a3 :: Either a1 a2)
type Null (a2 :: Proxy a1) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Null (a2 :: Proxy a1)
type Null (arg :: Arg a1 a2) Source # 
Instance details

Defined in Data.Semigroup.Singletons

type Null (arg :: Arg a1 a2)
type Null (arg :: (a1, a2)) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Null (arg :: (a1, a2))
type Null (arg :: Const m a) Source # 
Instance details

Defined in Data.Functor.Const.Singletons

type Null (arg :: Const m a)
type Null (arg :: Product f g a) Source # 
Instance details

Defined in Data.Functor.Product.Singletons

type Null (arg :: Product f g a)
type Null (arg :: Sum f g a) Source # 
Instance details

Defined in Data.Functor.Sum.Singletons

type Null (arg :: Sum f g a)
type Null (arg :: Compose f g a) Source # 
Instance details

Defined in Data.Functor.Compose.Singletons

type Null (arg :: Compose f g a)

sNull :: SFoldable t => forall (t :: t a). Sing t -> Sing (Apply NullSym0 t :: Bool) :: Type Source #

type family Length (arg :: t a) :: Natural Source #

Instances

Instances details
type Length (a2 :: Identity a1) Source # 
Instance details

Defined in Data.Functor.Identity.Singletons

type Length (a2 :: Identity a1)
type Length (arg :: First a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Length (arg :: First a)
type Length (arg :: Last a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Length (arg :: Last a)
type Length (arg :: First a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

type Length (arg :: First a)
type Length (arg :: Last a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

type Length (arg :: Last a)
type Length (arg :: Max a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

type Length (arg :: Max a)
type Length (arg :: Min a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

type Length (arg :: Min a)
type Length (a2 :: Dual a1) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Length (a2 :: Dual a1)
type Length (a2 :: Product a1) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Length (a2 :: Product a1)
type Length (a2 :: Sum a1) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Length (a2 :: Sum a1)
type Length (arg :: NonEmpty a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Length (arg :: NonEmpty a)
type Length (arg :: Maybe a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Length (arg :: Maybe a)
type Length (a2 :: [a1]) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Length (a2 :: [a1])
type Length (a3 :: Either a1 a2) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Length (a3 :: Either a1 a2)
type Length (a2 :: Proxy a1) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Length (a2 :: Proxy a1)
type Length (arg :: Arg a1 a2) Source # 
Instance details

Defined in Data.Semigroup.Singletons

type Length (arg :: Arg a1 a2)
type Length (arg :: (a1, a2)) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Length (arg :: (a1, a2))
type Length (arg :: Const m a) Source # 
Instance details

Defined in Data.Functor.Const.Singletons

type Length (arg :: Const m a)
type Length (arg :: Product f g a) Source # 
Instance details

Defined in Data.Functor.Product.Singletons

type Length (arg :: Product f g a)
type Length (arg :: Sum f g a) Source # 
Instance details

Defined in Data.Functor.Sum.Singletons

type Length (arg :: Sum f g a)
type Length (arg :: Compose f g a) Source # 
Instance details

Defined in Data.Functor.Compose.Singletons

type Length (arg :: Compose f g a)

sLength :: SFoldable t => forall (t :: t a). Sing t -> Sing (Apply LengthSym0 t :: Natural) :: Type Source #

type family Reverse (a :: [a]) :: [a] where ... Source #

Equations

Reverse l = Apply (Apply (Let6989586621679654265RevSym1 l) l) NilSym0 

sReverse :: forall (t :: [a]). Sing t -> Sing (Apply ReverseSym0 t :: [a]) :: Type Source #

Special folds

type family And (a :: t Bool) :: Bool where ... Source #

Equations

And a_6989586621680110420 = Apply (Apply (Apply (.@#@$) GetAllSym0) (Apply FoldMapSym0 All_Sym0)) a_6989586621680110420 

sAnd :: forall (t :: t Bool). SFoldable t => Sing t -> Sing (Apply AndSym0 t :: Bool) :: Type Source #

type family Or (a :: t Bool) :: Bool where ... Source #

Equations

Or a_6989586621680110414 = Apply (Apply (Apply (.@#@$) GetAnySym0) (Apply FoldMapSym0 Any_Sym0)) a_6989586621680110414 

sOr :: forall (t :: t Bool). SFoldable t => Sing t -> Sing (Apply OrSym0 t :: Bool) :: Type Source #

type family Any (a :: (~>) a Bool) (a :: t a) :: Bool where ... Source #

Equations

Any p a_6989586621680110405 = Apply (Apply (Apply (.@#@$) GetAnySym0) (Apply FoldMapSym0 (Apply (Apply (.@#@$) Any_Sym0) p))) a_6989586621680110405 

sAny :: forall (t :: (~>) a Bool) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply AnySym0 t) t :: Bool) :: Type Source #

type family All (a :: (~>) a Bool) (a :: t a) :: Bool where ... Source #

Equations

All p a_6989586621680110396 = Apply (Apply (Apply (.@#@$) GetAllSym0) (Apply FoldMapSym0 (Apply (Apply (.@#@$) All_Sym0) p))) a_6989586621680110396 

sAll :: forall (t :: (~>) a Bool) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply AllSym0 t) t :: Bool) :: Type Source #

type family Concat (a :: t [a]) :: [a] where ... Source #

Equations

Concat xs = Apply (Apply (Apply FoldrSym0 (Apply Lambda_6989586621680110442Sym0 xs)) NilSym0) xs 

sConcat :: forall (t :: t [a]). SFoldable t => Sing t -> Sing (Apply ConcatSym0 t :: [a]) :: Type Source #

type family ConcatMap (a :: (~>) a [b]) (a :: t a) :: [b] where ... Source #

Equations

ConcatMap f xs = Apply (Apply (Apply FoldrSym0 (Apply (Apply Lambda_6989586621680110433Sym0 f) xs)) NilSym0) xs 

sConcatMap :: forall (t :: (~>) a [b]) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply ConcatMapSym0 t) t :: [b]) :: Type Source #

Building lists

Scans

type family Scanl (a :: (~>) b ((~>) a b)) (a :: b) (a :: [a]) :: [b] where ... Source #

Equations

Scanl f q ls = Apply (Apply (:@#@$) q) (Case_6989586621679654074 f q ls ls) 

sScanl :: forall (t :: (~>) b ((~>) a b)) (t :: b) (t :: [a]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ScanlSym0 t) t) t :: [b]) :: Type Source #

type family Scanl1 (a :: (~>) a ((~>) a a)) (a :: [a]) :: [a] where ... Source #

Equations

Scanl1 f ('(:) x xs) = Apply (Apply (Apply ScanlSym0 f) x) xs 
Scanl1 _ '[] = NilSym0 

sScanl1 :: forall (t :: (~>) a ((~>) a a)) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply Scanl1Sym0 t) t :: [a]) :: Type Source #

type family Scanr (a :: (~>) a ((~>) b b)) (a :: b) (a :: [a]) :: [b] where ... Source #

Equations

Scanr _ q0 '[] = Apply (Apply (:@#@$) q0) NilSym0 
Scanr f q0 ('(:) x xs) = Case_6989586621679654051 f q0 x xs (Let6989586621679654049Scrutinee_6989586621679649997Sym4 f q0 x xs) 

sScanr :: forall (t :: (~>) a ((~>) b b)) (t :: b) (t :: [a]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ScanrSym0 t) t) t :: [b]) :: Type Source #

type family Scanr1 (a :: (~>) a ((~>) a a)) (a :: [a]) :: [a] where ... Source #

Equations

Scanr1 _ '[] = NilSym0 
Scanr1 _ '[x] = Apply (Apply (:@#@$) x) NilSym0 
Scanr1 f ('(:) x ('(:) wild_6989586621679650009 wild_6989586621679650011)) = Case_6989586621679654032 f x wild_6989586621679650009 wild_6989586621679650011 (Let6989586621679654030Scrutinee_6989586621679650003Sym4 f x wild_6989586621679650009 wild_6989586621679650011) 

sScanr1 :: forall (t :: (~>) a ((~>) a a)) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply Scanr1Sym0 t) t :: [a]) :: Type Source #

Infinite lists

type family Replicate (a :: Natural) (a :: a) :: [a] where ... Source #

Equations

Replicate n x = Case_6989586621679653164 n x (Let6989586621679653162Scrutinee_6989586621679650105Sym2 n x) 

sReplicate :: forall (t :: Natural) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply ReplicateSym0 t) t :: [a]) :: Type Source #

Sublists

type family Take (a :: Natural) (a :: [a]) :: [a] where ... Source #

Equations

Take _ '[] = NilSym0 
Take n ('(:) x xs) = Case_6989586621679653320 n x xs (Let6989586621679653318Scrutinee_6989586621679650089Sym3 n x xs) 

sTake :: forall (t :: Natural) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply TakeSym0 t) t :: [a]) :: Type Source #

type family Drop (a :: Natural) (a :: [a]) :: [a] where ... Source #

Equations

Drop _ '[] = NilSym0 
Drop n ('(:) x xs) = Case_6989586621679653307 n x xs (Let6989586621679653305Scrutinee_6989586621679650091Sym3 n x xs) 

sDrop :: forall (t :: Natural) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply DropSym0 t) t :: [a]) :: Type Source #

type family TakeWhile (a :: (~>) a Bool) (a :: [a]) :: [a] where ... Source #

Equations

TakeWhile _ '[] = NilSym0 
TakeWhile p ('(:) x xs) = Case_6989586621679653437 p x xs (Let6989586621679653435Scrutinee_6989586621679650079Sym3 p x xs) 

sTakeWhile :: forall (t :: (~>) a Bool) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply TakeWhileSym0 t) t :: [a]) :: Type Source #

type family DropWhile (a :: (~>) a Bool) (a :: [a]) :: [a] where ... Source #

Equations

DropWhile _ '[] = NilSym0 
DropWhile p ('(:) x xs') = Case_6989586621679653424 p x xs' (Let6989586621679653422Scrutinee_6989586621679650081Sym3 p x xs') 

sDropWhile :: forall (t :: (~>) a Bool) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply DropWhileSym0 t) t :: [a]) :: Type Source #

type family Span (a :: (~>) a Bool) (a :: [a]) :: ([a], [a]) where ... Source #

Equations

Span _ '[] = Apply (Apply Tuple2Sym0 Let6989586621679653363XsSym0) Let6989586621679653363XsSym0 
Span p ('(:) x xs') = Case_6989586621679653372 p x xs' (Let6989586621679653370Scrutinee_6989586621679650085Sym3 p x xs') 

sSpan :: forall (t :: (~>) a Bool) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply SpanSym0 t) t :: ([a], [a])) :: Type Source #

type family Break (a :: (~>) a Bool) (a :: [a]) :: ([a], [a]) where ... Source #

Equations

Break _ '[] = Apply (Apply Tuple2Sym0 Let6989586621679653328XsSym0) Let6989586621679653328XsSym0 
Break p ('(:) x xs') = Case_6989586621679653337 p x xs' (Let6989586621679653335Scrutinee_6989586621679650087Sym3 p x xs') 

sBreak :: forall (t :: (~>) a Bool) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply BreakSym0 t) t :: ([a], [a])) :: Type Source #

type family SplitAt (a :: Natural) (a :: [a]) :: ([a], [a]) where ... Source #

Equations

SplitAt n xs = Apply (Apply Tuple2Sym0 (Apply (Apply TakeSym0 n) xs)) (Apply (Apply DropSym0 n) xs) 

sSplitAt :: forall (t :: Natural) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply SplitAtSym0 t) t :: ([a], [a])) :: Type Source #

Searching lists

type family NotElem (a :: a) (a :: t a) :: Bool where ... Source #

Equations

NotElem x a_6989586621680110347 = Apply (Apply (Apply (.@#@$) NotSym0) (Apply ElemSym0 x)) a_6989586621680110347 

sNotElem :: forall (t :: a) (t :: t a). (SFoldable t, SEq a) => Sing t -> Sing t -> Sing (Apply (Apply NotElemSym0 t) t :: Bool) :: Type Source #

type family Lookup (a :: a) (a :: [(a, b)]) :: Maybe b where ... Source #

Equations

Lookup _key '[] = NothingSym0 
Lookup key ('(:) '(x, y) xys) = Case_6989586621679653230 key x y xys (Let6989586621679653228Scrutinee_6989586621679650101Sym4 key x y xys) 

sLookup :: forall (t :: a) (t :: [(a, b)]). SEq a => Sing t -> Sing t -> Sing (Apply (Apply LookupSym0 t) t :: Maybe b) :: Type Source #

Zipping and unzipping lists

type family Zip (a :: [a]) (a :: [b]) :: [(a, b)] where ... Source #

Equations

Zip ('(:) x xs) ('(:) y ys) = Apply (Apply (:@#@$) (Apply (Apply Tuple2Sym0 x) y)) (Apply (Apply ZipSym0 xs) ys) 
Zip '[] '[] = NilSym0 
Zip ('(:) _ _) '[] = NilSym0 
Zip '[] ('(:) _ _) = NilSym0 

sZip :: forall (t :: [a]) (t :: [b]). Sing t -> Sing t -> Sing (Apply (Apply ZipSym0 t) t :: [(a, b)]) :: Type Source #

type family Zip3 (a :: [a]) (a :: [b]) (a :: [c]) :: [(a, b, c)] where ... Source #

Equations

Zip3 ('(:) a as) ('(:) b bs) ('(:) c cs) = Apply (Apply (:@#@$) (Apply (Apply (Apply Tuple3Sym0 a) b) c)) (Apply (Apply (Apply Zip3Sym0 as) bs) cs) 
Zip3 '[] '[] '[] = NilSym0 
Zip3 '[] '[] ('(:) _ _) = NilSym0 
Zip3 '[] ('(:) _ _) '[] = NilSym0 
Zip3 '[] ('(:) _ _) ('(:) _ _) = NilSym0 
Zip3 ('(:) _ _) '[] '[] = NilSym0 
Zip3 ('(:) _ _) '[] ('(:) _ _) = NilSym0 
Zip3 ('(:) _ _) ('(:) _ _) '[] = NilSym0 

sZip3 :: forall (t :: [a]) (t :: [b]) (t :: [c]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Zip3Sym0 t) t) t :: [(a, b, c)]) :: Type Source #

type family ZipWith (a :: (~>) a ((~>) b c)) (a :: [a]) (a :: [b]) :: [c] where ... Source #

Equations

ZipWith f ('(:) x xs) ('(:) y ys) = Apply (Apply (:@#@$) (Apply (Apply f x) y)) (Apply (Apply (Apply ZipWithSym0 f) xs) ys) 
ZipWith _ '[] '[] = NilSym0 
ZipWith _ ('(:) _ _) '[] = NilSym0 
ZipWith _ '[] ('(:) _ _) = NilSym0 

sZipWith :: forall (t :: (~>) a ((~>) b c)) (t :: [a]) (t :: [b]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ZipWithSym0 t) t) t :: [c]) :: Type Source #

type family ZipWith3 (a :: (~>) a ((~>) b ((~>) c d))) (a :: [a]) (a :: [b]) (a :: [c]) :: [d] where ... Source #

Equations

ZipWith3 z ('(:) a as) ('(:) b bs) ('(:) c cs) = Apply (Apply (:@#@$) (Apply (Apply (Apply z a) b) c)) (Apply (Apply (Apply (Apply ZipWith3Sym0 z) as) bs) cs) 
ZipWith3 _ '[] '[] '[] = NilSym0 
ZipWith3 _ '[] '[] ('(:) _ _) = NilSym0 
ZipWith3 _ '[] ('(:) _ _) '[] = NilSym0 
ZipWith3 _ '[] ('(:) _ _) ('(:) _ _) = NilSym0 
ZipWith3 _ ('(:) _ _) '[] '[] = NilSym0 
ZipWith3 _ ('(:) _ _) '[] ('(:) _ _) = NilSym0 
ZipWith3 _ ('(:) _ _) ('(:) _ _) '[] = NilSym0 

sZipWith3 :: forall (t :: (~>) a ((~>) b ((~>) c d))) (t :: [a]) (t :: [b]) (t :: [c]). Sing t -> Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply (Apply ZipWith3Sym0 t) t) t) t :: [d]) :: Type Source #

type family Unzip (a :: [(a, b)]) :: ([a], [b]) where ... Source #

Equations

Unzip xs = Apply (Apply (Apply FoldrSym0 (Apply Lambda_6989586621679653792Sym0 xs)) (Apply (Apply Tuple2Sym0 NilSym0) NilSym0)) xs 

sUnzip :: forall (t :: [(a, b)]). Sing t -> Sing (Apply UnzipSym0 t :: ([a], [b])) :: Type Source #

type family Unzip3 (a :: [(a, b, c)]) :: ([a], [b], [c]) where ... Source #

Equations

Unzip3 xs = Apply (Apply (Apply FoldrSym0 (Apply Lambda_6989586621679653774Sym0 xs)) (Apply (Apply (Apply Tuple3Sym0 NilSym0) NilSym0) NilSym0)) xs 

sUnzip3 :: forall (t :: [(a, b, c)]). Sing t -> Sing (Apply Unzip3Sym0 t :: ([a], [b], [c])) :: Type Source #

Functions on Symbols

type family Unlines (a :: [Symbol]) :: Symbol where ... Source #

Equations

Unlines '[] = "" 
Unlines ('(:) l ls) = Apply (Apply (<>@#@$) l) (Apply (Apply (<>@#@$) "\n") (Apply UnlinesSym0 ls)) 

sUnlines :: forall (t :: [Symbol]). Sing t -> Sing (Apply UnlinesSym0 t :: Symbol) :: Type Source #

type family Unwords (a :: [Symbol]) :: Symbol where ... Source #

Equations

Unwords '[] = "" 
Unwords ('(:) w ws) = Apply (Apply (<>@#@$) w) (Apply (Let6989586621679653668GoSym2 w ws) ws) 

sUnwords :: forall (t :: [Symbol]). Sing t -> Sing (Apply UnwordsSym0 t :: Symbol) :: Type Source #

Converting to and from Symbol

Converting to Symbol

type SymbolS = Symbol -> Symbol Source #

The shows functions return a function that prepends the output Symbol to an existing Symbol. This allows constant-time concatenation of results using function composition.

show_ :: Show a => a -> String Source #

show, but with an extra underscore so that its promoted counterpart (Show_) will not clash with the Show class.

class PShow a Source #

Associated Types

type ShowsPrec (arg :: Natural) (arg :: a) (arg :: Symbol) :: Symbol Source #

type ShowsPrec a a a = Apply (Apply (Apply ShowsPrec_6989586621679965756Sym0 a) a) a

type Show_ (arg :: a) :: Symbol Source #

type Show_ a = Apply Show__6989586621679965768Sym0 a

type ShowList (arg :: [a]) (arg :: Symbol) :: Symbol Source #

type ShowList a a = Apply (Apply ShowList_6989586621679965776Sym0 a) a

Instances

Instances details
PShow All Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow Any Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow Void Source # 
Instance details

Defined in Text.Show.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow Ordering Source # 
Instance details

Defined in Text.Show.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow Natural Source # 
Instance details

Defined in Text.Show.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow () Source # 
Instance details

Defined in Text.Show.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow Bool Source # 
Instance details

Defined in Text.Show.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow Char Source # 
Instance details

Defined in Text.Show.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow Symbol Source # 
Instance details

Defined in Text.Show.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (Identity a) Source # 
Instance details

Defined in Data.Functor.Identity.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (First a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (Last a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (First a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (Last a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (Max a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (Min a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (WrappedMonoid m) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (Dual a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (Product a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (Sum a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (NonEmpty a) Source # 
Instance details

Defined in Text.Show.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (Maybe a) Source # 
Instance details

Defined in Text.Show.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow [a] Source # 
Instance details

Defined in Text.Show.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (Either a b) Source # 
Instance details

Defined in Text.Show.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (Proxy s) Source # 
Instance details

Defined in Data.Proxy.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (Arg a b) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (a, b) Source # 
Instance details

Defined in Text.Show.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (Const a b) Source # 
Instance details

Defined in Data.Functor.Const.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (a, b, c) Source # 
Instance details

Defined in Text.Show.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (a, b, c, d) Source # 
Instance details

Defined in Text.Show.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (a, b, c, d, e) Source # 
Instance details

Defined in Text.Show.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (a, b, c, d, e, f) Source # 
Instance details

Defined in Text.Show.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

PShow (a, b, c, d, e, f, g) Source # 
Instance details

Defined in Text.Show.Singletons

Associated Types

type ShowsPrec arg arg1 arg2 :: Symbol Source #

type Show_ arg :: Symbol Source #

type ShowList arg arg1 :: Symbol Source #

class SShow a where Source #

Minimal complete definition

Nothing

Methods

sShowsPrec :: forall (t :: Natural) (t :: a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t :: Symbol) :: Type Source #

default sShowsPrec :: forall (t :: Natural) (t :: a) (t :: Symbol). (Apply (Apply (Apply ShowsPrecSym0 t) t) t :: Symbol) ~ Apply (Apply (Apply ShowsPrec_6989586621679965756Sym0 t) t) t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t :: Symbol) :: Type Source #

sShow_ :: forall (t :: a). Sing t -> Sing (Apply Show_Sym0 t :: Symbol) :: Type Source #

default sShow_ :: forall (t :: a). (Apply Show_Sym0 t :: Symbol) ~ Apply Show__6989586621679965768Sym0 t => Sing t -> Sing (Apply Show_Sym0 t :: Symbol) :: Type Source #

sShowList :: forall (t :: [a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t :: Symbol) :: Type Source #

default sShowList :: forall (t :: [a]) (t :: Symbol). (Apply (Apply ShowListSym0 t) t :: Symbol) ~ Apply (Apply ShowList_6989586621679965776Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t :: Symbol) :: Type Source #

Instances

Instances details
SShow Bool => SShow All Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: All) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: All). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [All]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow Bool => SShow Any Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: Any) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: Any). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [Any]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow Void Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: Void) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: Void). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [Void]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow Ordering Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: Ordering) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: Ordering). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [Ordering]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow Natural Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: Natural) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: Natural). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [Natural]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow () Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: ()) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: ()). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [()]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow Bool Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: Bool) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: Bool). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [Bool]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow Char Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: Char) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: Char). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [Char]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow Symbol Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: Symbol) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: Symbol). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [Symbol]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow a => SShow (Identity a) Source # 
Instance details

Defined in Data.Functor.Identity.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: Identity a) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: Identity a). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [Identity a]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow (Maybe a) => SShow (First a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: First a) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: First a). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [First a]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow (Maybe a) => SShow (Last a) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: Last a) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: Last a). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [Last a]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow a => SShow (First a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: First a) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: First a). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [First a]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow a => SShow (Last a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: Last a) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: Last a). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [Last a]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow a => SShow (Max a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: Max a) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: Max a). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [Max a]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow a => SShow (Min a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: Min a) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: Min a). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [Min a]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow m => SShow (WrappedMonoid m) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: WrappedMonoid m) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: WrappedMonoid m). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [WrappedMonoid m]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow a => SShow (Dual a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: Dual a) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: Dual a). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [Dual a]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow a => SShow (Product a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: Product a) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: Product a). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [Product a]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow a => SShow (Sum a) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: Sum a) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: Sum a). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [Sum a]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

(SShow a, SShow [a]) => SShow (NonEmpty a) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: NonEmpty a) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: NonEmpty a). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [NonEmpty a]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow a => SShow (Maybe a) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: Maybe a) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: Maybe a). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [Maybe a]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

SShow a => SShow [a] Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: [a]) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: [a]). Sing t -> Sing (Apply Show_Sym0 t) Source #

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

(SShow a, SShow b) => SShow (Either a b) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

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

sShow_ :: forall (t :: Either a b). Sing t -> Sing (Apply Show_Sym0 t) Source #

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

SShow (Proxy s) Source # 
Instance details

Defined in Data.Proxy.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: Proxy s) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: Proxy s). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [Proxy s]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

(SShow a, SShow b) => SShow (Arg a b) Source # 
Instance details

Defined in Data.Semigroup.Singletons

Methods

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

sShow_ :: forall (t :: Arg a b). Sing t -> Sing (Apply Show_Sym0 t) Source #

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

(SShow a, SShow b) => SShow (a, b) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

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

sShow_ :: forall (t :: (a, b)). Sing t -> Sing (Apply Show_Sym0 t) Source #

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

SShow a => SShow (Const a b) Source # 
Instance details

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) Source #

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

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

(SShow a, SShow b, SShow c) => SShow (a, b, c) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: (a, b, c)) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: (a, b, c)). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [(a, b, c)]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

(SShow a, SShow b, SShow c, SShow d) => SShow (a, b, c, d) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: (a, b, c, d)) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: (a, b, c, d)). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [(a, b, c, d)]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

(SShow a, SShow b, SShow c, SShow d, SShow e) => SShow (a, b, c, d, e) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: (a, b, c, d, e)) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: (a, b, c, d, e)). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [(a, b, c, d, e)]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

(SShow a, SShow b, SShow c, SShow d, SShow e, SShow f) => SShow (a, b, c, d, e, f) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: (a, b, c, d, e, f)) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: (a, b, c, d, e, f)). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [(a, b, c, d, e, f)]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

(SShow a, SShow b, SShow c, SShow d, SShow e, SShow f, SShow g) => SShow (a, b, c, d, e, f, g) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sShowsPrec :: forall (t1 :: Natural) (t2 :: (a, b, c, d, e, f, g)) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source #

sShow_ :: forall (t :: (a, b, c, d, e, f, g)). Sing t -> Sing (Apply Show_Sym0 t) Source #

sShowList :: forall (t1 :: [(a, b, c, d, e, f, g)]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source #

type family Shows (a :: a) (a :: Symbol) :: Symbol where ... Source #

Equations

Shows s a_6989586621679965729 = Apply (Apply (Apply ShowsPrecSym0 (FromInteger 0)) s) a_6989586621679965729 

sShows :: forall (t :: a) (t :: Symbol). SShow a => Sing t -> Sing t -> Sing (Apply (Apply ShowsSym0 t) t :: Symbol) :: Type Source #

type family ShowChar (a :: Char) (a :: Symbol) :: Symbol where ... Source #

Equations

ShowChar a_6989586621679965701 a_6989586621679965703 = Apply (Apply ConsSymbolSym0 a_6989586621679965701) a_6989586621679965703 

sShowChar :: forall (t :: Char) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowCharSym0 t) t :: Symbol) :: Type Source #

type family ShowString (a :: Symbol) (a :: Symbol) :: Symbol where ... Source #

Equations

ShowString a_6989586621679965690 a_6989586621679965692 = Apply (Apply (<>@#@$) a_6989586621679965690) a_6989586621679965692 

sShowString :: forall (t :: Symbol) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowStringSym0 t) t :: Symbol) :: Type Source #

type family ShowParen (a :: Bool) (a :: (~>) Symbol Symbol) (a :: Symbol) :: Symbol where ... Source #

Equations

ShowParen b p a_6989586621679965675 = Apply (Case_6989586621679965687 b p a_6989586621679965675 b) a_6989586621679965675 

sShowParen :: forall (t :: Bool) (t :: (~>) Symbol Symbol) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowParenSym0 t) t) t :: Symbol) :: Type Source #

Defunctionalization symbols

Basic data types

type family FalseSym0 :: Bool where ... Source #

Equations

FalseSym0 = 'False 

type family TrueSym0 :: Bool where ... Source #

Equations

TrueSym0 = 'True 

data IfSym0 :: (~>) Bool ((~>) k ((~>) k k)) Source #

Instances

Instances details
SingI (IfSym0 :: TyFun Bool (k ~> (k ~> k)) -> Type) Source # 
Instance details

Defined in Data.Bool.Singletons

Methods

sing :: Sing IfSym0 #

SuppressUnusedWarnings (IfSym0 :: TyFun Bool (k ~> (k ~> k)) -> Type) Source # 
Instance details

Defined in Data.Bool.Singletons

type Apply (IfSym0 :: TyFun Bool (k ~> (k ~> k)) -> Type) (a6989586621679106255 :: Bool) Source # 
Instance details

Defined in Data.Bool.Singletons

type Apply (IfSym0 :: TyFun Bool (k ~> (k ~> k)) -> Type) (a6989586621679106255 :: Bool) = IfSym1 a6989586621679106255 :: TyFun k (k ~> k) -> Type

data IfSym1 (a6989586621679106255 :: Bool) :: (~>) k ((~>) k k) Source #

Instances

Instances details
SingI1 (IfSym1 :: Bool -> TyFun k (k ~> k) -> Type) Source # 
Instance details

Defined in Data.Bool.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (IfSym1 x) #

SingI c => SingI (IfSym1 c :: TyFun k (k ~> k) -> Type) Source # 
Instance details

Defined in Data.Bool.Singletons

Methods

sing :: Sing (IfSym1 c) #

SuppressUnusedWarnings (IfSym1 a6989586621679106255 :: TyFun k (k ~> k) -> Type) Source # 
Instance details

Defined in Data.Bool.Singletons

type Apply (IfSym1 a6989586621679106255 :: TyFun k (k ~> k) -> Type) (a6989586621679106256 :: k) Source # 
Instance details

Defined in Data.Bool.Singletons

type Apply (IfSym1 a6989586621679106255 :: TyFun k (k ~> k) -> Type) (a6989586621679106256 :: k) = IfSym2 a6989586621679106255 a6989586621679106256

data IfSym2 (a6989586621679106255 :: Bool) (a6989586621679106256 :: k) :: (~>) k k Source #

Instances

Instances details
SingI2 (IfSym2 :: Bool -> k2 -> TyFun k2 k2 -> Type) Source # 
Instance details

Defined in Data.Bool.Singletons

Methods

liftSing2 :: forall (x :: k1) (y :: k20). Sing x -> Sing y -> Sing (IfSym2 x y) #

SingI c => SingI1 (IfSym2 c :: k1 -> TyFun k1 k1 -> Type) Source # 
Instance details

Defined in Data.Bool.Singletons

Methods

liftSing :: forall (x :: k10). Sing x -> Sing (IfSym2 c x) #

(SingI c, SingI t) => SingI (IfSym2 c t :: TyFun k k -> Type) Source # 
Instance details

Defined in Data.Bool.Singletons

Methods

sing :: Sing (IfSym2 c t) #

SuppressUnusedWarnings (IfSym2 a6989586621679106255 a6989586621679106256 :: TyFun k k -> Type) Source # 
Instance details

Defined in Data.Bool.Singletons

type Apply (IfSym2 a6989586621679106255 a6989586621679106256 :: TyFun k k -> Type) (a6989586621679106257 :: k) Source # 
Instance details

Defined in Data.Bool.Singletons

type Apply (IfSym2 a6989586621679106255 a6989586621679106256 :: TyFun k k -> Type) (a6989586621679106257 :: k) = If a6989586621679106255 a6989586621679106256 a6989586621679106257

type family IfSym3 (a6989586621679106255 :: Bool) (a6989586621679106256 :: k) (a6989586621679106257 :: k) :: k where ... Source #

Equations

IfSym3 a6989586621679106255 a6989586621679106256 a6989586621679106257 = If a6989586621679106255 a6989586621679106256 a6989586621679106257 

data (&&@#@$) :: (~>) Bool ((~>) Bool Bool) infixr 3 Source #

Instances

Instances details
SingI (&&@#@$) Source # 
Instance details

Defined in Data.Bool.Singletons

Methods

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

SuppressUnusedWarnings (&&@#@$) Source # 
Instance details

Defined in Data.Bool.Singletons

type Apply (&&@#@$) (a6989586621679105336 :: Bool) Source # 
Instance details

Defined in Data.Bool.Singletons

type Apply (&&@#@$) (a6989586621679105336 :: Bool) = (&&@#@$$) a6989586621679105336

data (&&@#@$$) (a6989586621679105336 :: Bool) :: (~>) Bool Bool infixr 3 Source #

Instances

Instances details
SingI x => SingI ((&&@#@$$) x :: TyFun Bool Bool -> Type) Source # 
Instance details

Defined in Data.Bool.Singletons

Methods

sing :: Sing ((&&@#@$$) x) #

SuppressUnusedWarnings ((&&@#@$$) a6989586621679105336 :: TyFun Bool Bool -> Type) Source # 
Instance details

Defined in Data.Bool.Singletons

type Apply ((&&@#@$$) a6989586621679105336 :: TyFun Bool Bool -> Type) (a6989586621679105337 :: Bool) Source # 
Instance details

Defined in Data.Bool.Singletons

type Apply ((&&@#@$$) a6989586621679105336 :: TyFun Bool Bool -> Type) (a6989586621679105337 :: Bool) = a6989586621679105336 && a6989586621679105337

type family (a6989586621679105336 :: Bool) &&@#@$$$ (a6989586621679105337 :: Bool) :: Bool where ... infixr 3 Source #

Equations

a6989586621679105336 &&@#@$$$ a6989586621679105337 = (&&) a6989586621679105336 a6989586621679105337 

data (||@#@$) :: (~>) Bool ((~>) Bool Bool) infixr 2 Source #

Instances

Instances details
SingI (||@#@$) Source # 
Instance details

Defined in Data.Bool.Singletons

Methods

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

SuppressUnusedWarnings (||@#@$) Source # 
Instance details

Defined in Data.Bool.Singletons

type Apply (||@#@$) (a6989586621679105694 :: Bool) Source # 
Instance details

Defined in Data.Bool.Singletons

type Apply (||@#@$) (a6989586621679105694 :: Bool) = (||@#@$$) a6989586621679105694

data (||@#@$$) (a6989586621679105694 :: Bool) :: (~>) Bool Bool infixr 2 Source #

Instances

Instances details
SingI x => SingI ((||@#@$$) x :: TyFun Bool Bool -> Type) Source # 
Instance details

Defined in Data.Bool.Singletons

Methods

sing :: Sing ((||@#@$$) x) #

SuppressUnusedWarnings ((||@#@$$) a6989586621679105694 :: TyFun Bool Bool -> Type) Source # 
Instance details

Defined in Data.Bool.Singletons

type Apply ((||@#@$$) a6989586621679105694 :: TyFun Bool Bool -> Type) (a6989586621679105695 :: Bool) Source # 
Instance details

Defined in Data.Bool.Singletons

type Apply ((||@#@$$) a6989586621679105694 :: TyFun Bool Bool -> Type) (a6989586621679105695 :: Bool) = a6989586621679105694 || a6989586621679105695

type family (a6989586621679105694 :: Bool) ||@#@$$$ (a6989586621679105695 :: Bool) :: Bool where ... infixr 2 Source #

Equations

a6989586621679105694 ||@#@$$$ a6989586621679105695 = (||) a6989586621679105694 a6989586621679105695 

data NotSym0 :: (~>) Bool Bool Source #

Instances

Instances details
SingI NotSym0 Source # 
Instance details

Defined in Data.Bool.Singletons

Methods

sing :: Sing NotSym0 #

SuppressUnusedWarnings NotSym0 Source # 
Instance details

Defined in Data.Bool.Singletons

type Apply NotSym0 (a6989586621679106035 :: Bool) Source # 
Instance details

Defined in Data.Bool.Singletons

type Apply NotSym0 (a6989586621679106035 :: Bool) = Not a6989586621679106035

type family NotSym1 (a6989586621679106035 :: Bool) :: Bool where ... Source #

Equations

NotSym1 a6989586621679106035 = Not a6989586621679106035 

type family OtherwiseSym0 :: Bool where ... Source #

type family NothingSym0 :: Maybe (a :: Type) where ... Source #

Equations

NothingSym0 = 'Nothing 

data JustSym0 :: (~>) a (Maybe (a :: Type)) Source #

Instances

Instances details
SingI (JustSym0 :: TyFun a (Maybe a) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing JustSym0 #

SuppressUnusedWarnings (JustSym0 :: TyFun a (Maybe a) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (a6989586621679037528 :: a) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (a6989586621679037528 :: a) = 'Just a6989586621679037528

type family JustSym1 (a6989586621679037528 :: a) :: Maybe (a :: Type) where ... Source #

Equations

JustSym1 a6989586621679037528 = 'Just a6989586621679037528 

data Maybe_Sym0 :: (~>) b ((~>) ((~>) a b) ((~>) (Maybe a) b)) Source #

Instances

Instances details
SingI (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) Source # 
Instance details

Defined in Data.Maybe.Singletons

Methods

sing :: Sing Maybe_Sym0 #

SuppressUnusedWarnings (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) Source # 
Instance details

Defined in Data.Maybe.Singletons

type Apply (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) (a6989586621679466255 :: b) Source # 
Instance details

Defined in Data.Maybe.Singletons

type Apply (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) (a6989586621679466255 :: b) = Maybe_Sym1 a6989586621679466255 :: TyFun (a ~> b) (Maybe a ~> b) -> Type

data Maybe_Sym1 (a6989586621679466255 :: b) :: (~>) ((~>) a b) ((~>) (Maybe a) b) Source #

Instances

Instances details
SingI1 (Maybe_Sym1 :: b -> TyFun (a ~> b) (Maybe a ~> b) -> Type) Source # 
Instance details

Defined in Data.Maybe.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Maybe_Sym1 x) #

SingI d => SingI (Maybe_Sym1 d :: TyFun (a ~> b) (Maybe a ~> b) -> Type) Source # 
Instance details

Defined in Data.Maybe.Singletons

Methods

sing :: Sing (Maybe_Sym1 d) #

SuppressUnusedWarnings (Maybe_Sym1 a6989586621679466255 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) Source # 
Instance details

Defined in Data.Maybe.Singletons

type Apply (Maybe_Sym1 a6989586621679466255 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) (a6989586621679466256 :: a ~> b) Source # 
Instance details

Defined in Data.Maybe.Singletons

type Apply (Maybe_Sym1 a6989586621679466255 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) (a6989586621679466256 :: a ~> b) = Maybe_Sym2 a6989586621679466255 a6989586621679466256

data Maybe_Sym2 (a6989586621679466255 :: b) (a6989586621679466256 :: (~>) a b) :: (~>) (Maybe a) b Source #

Instances

Instances details
SingI2 (Maybe_Sym2 :: b -> (a ~> b) -> TyFun (Maybe a) b -> Type) Source # 
Instance details

Defined in Data.Maybe.Singletons

Methods

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

SingI d => SingI1 (Maybe_Sym2 d :: (a ~> b) -> TyFun (Maybe a) b -> Type) Source # 
Instance details

Defined in Data.Maybe.Singletons

Methods

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

(SingI d1, SingI d2) => SingI (Maybe_Sym2 d1 d2 :: TyFun (Maybe a) b -> Type) Source # 
Instance details

Defined in Data.Maybe.Singletons

Methods

sing :: Sing (Maybe_Sym2 d1 d2) #

SuppressUnusedWarnings (Maybe_Sym2 a6989586621679466255 a6989586621679466256 :: TyFun (Maybe a) b -> Type) Source # 
Instance details

Defined in Data.Maybe.Singletons

type Apply (Maybe_Sym2 a6989586621679466255 a6989586621679466256 :: TyFun (Maybe a) b -> Type) (a6989586621679466257 :: Maybe a) Source # 
Instance details

Defined in Data.Maybe.Singletons

type Apply (Maybe_Sym2 a6989586621679466255 a6989586621679466256 :: TyFun (Maybe a) b -> Type) (a6989586621679466257 :: Maybe a) = Maybe_ a6989586621679466255 a6989586621679466256 a6989586621679466257

type family Maybe_Sym3 (a6989586621679466255 :: b) (a6989586621679466256 :: (~>) a b) (a6989586621679466257 :: Maybe a) :: b where ... Source #

Equations

Maybe_Sym3 a6989586621679466255 a6989586621679466256 a6989586621679466257 = Maybe_ a6989586621679466255 a6989586621679466256 a6989586621679466257 

data LeftSym0 :: (~>) a (Either (a :: Type) (b :: Type)) Source #

Instances

Instances details
SingI (LeftSym0 :: TyFun a (Either a b) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing LeftSym0 #

SuppressUnusedWarnings (LeftSym0 :: TyFun a (Either a b) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (LeftSym0 :: TyFun a (Either a b) -> Type) (a6989586621679037600 :: a) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (LeftSym0 :: TyFun a (Either a b) -> Type) (a6989586621679037600 :: a) = 'Left a6989586621679037600 :: Either a b

type family LeftSym1 (a6989586621679037600 :: a) :: Either (a :: Type) (b :: Type) where ... Source #

Equations

LeftSym1 a6989586621679037600 = 'Left a6989586621679037600 

data RightSym0 :: (~>) b (Either (a :: Type) (b :: Type)) Source #

Instances

Instances details
SingI (RightSym0 :: TyFun b (Either a b) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing RightSym0 #

SuppressUnusedWarnings (RightSym0 :: TyFun b (Either a b) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (RightSym0 :: TyFun b (Either a b) -> Type) (a6989586621679037602 :: b) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (RightSym0 :: TyFun b (Either a b) -> Type) (a6989586621679037602 :: b) = 'Right a6989586621679037602 :: Either a b

type family RightSym1 (a6989586621679037602 :: b) :: Either (a :: Type) (b :: Type) where ... Source #

Equations

RightSym1 a6989586621679037602 = 'Right a6989586621679037602 

data Either_Sym0 :: (~>) ((~>) a c) ((~>) ((~>) b c) ((~>) (Either a b) c)) Source #

Instances

Instances details
SingI (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) Source # 
Instance details

Defined in Data.Either.Singletons

SuppressUnusedWarnings (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) Source # 
Instance details

Defined in Data.Either.Singletons

type Apply (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) (a6989586621679264752 :: a ~> c) Source # 
Instance details

Defined in Data.Either.Singletons

type Apply (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) (a6989586621679264752 :: a ~> c) = Either_Sym1 a6989586621679264752 :: TyFun (b ~> c) (Either a b ~> c) -> Type

data Either_Sym1 (a6989586621679264752 :: (~>) a c) :: (~>) ((~>) b c) ((~>) (Either a b) c) Source #

Instances

Instances details
SingI1 (Either_Sym1 :: (a ~> c) -> TyFun (b ~> c) (Either a b ~> c) -> Type) Source # 
Instance details

Defined in Data.Either.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Either_Sym1 x) #

SingI d => SingI (Either_Sym1 d :: TyFun (b ~> c) (Either a b ~> c) -> Type) Source # 
Instance details

Defined in Data.Either.Singletons

Methods

sing :: Sing (Either_Sym1 d) #

SuppressUnusedWarnings (Either_Sym1 a6989586621679264752 :: TyFun (b ~> c) (Either a b ~> c) -> Type) Source # 
Instance details

Defined in Data.Either.Singletons

type Apply (Either_Sym1 a6989586621679264752 :: TyFun (b ~> c) (Either a b ~> c) -> Type) (a6989586621679264753 :: b ~> c) Source # 
Instance details

Defined in Data.Either.Singletons

type Apply (Either_Sym1 a6989586621679264752 :: TyFun (b ~> c) (Either a b ~> c) -> Type) (a6989586621679264753 :: b ~> c) = Either_Sym2 a6989586621679264752 a6989586621679264753

data Either_Sym2 (a6989586621679264752 :: (~>) a c) (a6989586621679264753 :: (~>) b c) :: (~>) (Either a b) c Source #

Instances

Instances details
SingI2 (Either_Sym2 :: (a ~> c) -> (b ~> c) -> TyFun (Either a b) c -> Type) Source # 
Instance details

Defined in Data.Either.Singletons

Methods

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

SingI d => SingI1 (Either_Sym2 d :: (b ~> c) -> TyFun (Either a b) c -> Type) Source # 
Instance details

Defined in Data.Either.Singletons

Methods

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

(SingI d1, SingI d2) => SingI (Either_Sym2 d1 d2 :: TyFun (Either a b) c -> Type) Source # 
Instance details

Defined in Data.Either.Singletons

Methods

sing :: Sing (Either_Sym2 d1 d2) #

SuppressUnusedWarnings (Either_Sym2 a6989586621679264752 a6989586621679264753 :: TyFun (Either a b) c -> Type) Source # 
Instance details

Defined in Data.Either.Singletons

type Apply (Either_Sym2 a6989586621679264752 a6989586621679264753 :: TyFun (Either a b) c -> Type) (a6989586621679264754 :: Either a b) Source # 
Instance details

Defined in Data.Either.Singletons

type Apply (Either_Sym2 a6989586621679264752 a6989586621679264753 :: TyFun (Either a b) c -> Type) (a6989586621679264754 :: Either a b) = Either_ a6989586621679264752 a6989586621679264753 a6989586621679264754

type family Either_Sym3 (a6989586621679264752 :: (~>) a c) (a6989586621679264753 :: (~>) b c) (a6989586621679264754 :: Either a b) :: c where ... Source #

Equations

Either_Sym3 a6989586621679264752 a6989586621679264753 a6989586621679264754 = Either_ a6989586621679264752 a6989586621679264753 a6989586621679264754 

type family LTSym0 :: Ordering where ... Source #

Equations

LTSym0 = 'LT 

type family EQSym0 :: Ordering where ... Source #

Equations

EQSym0 = 'EQ 

type family GTSym0 :: Ordering where ... Source #

Equations

GTSym0 = 'GT 

data (:@#@$) :: (~>) a ((~>) [a] [a :: Type]) infixr 5 Source #

Instances

Instances details
SingI ((:@#@$) :: TyFun a ([a] ~> [a]) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

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

SuppressUnusedWarnings ((:@#@$) :: TyFun a ([a] ~> [a]) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply ((:@#@$) :: TyFun a ([a] ~> [a]) -> Type) (a6989586621679037552 :: a) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply ((:@#@$) :: TyFun a ([a] ~> [a]) -> Type) (a6989586621679037552 :: a) = (:@#@$$) a6989586621679037552

data (:@#@$$) (a6989586621679037552 :: a) :: (~>) [a] [a :: Type] infixr 5 Source #

Instances

Instances details
SingI1 ((:@#@$$) :: a -> TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

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

SingI d => SingI ((:@#@$$) d :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

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

SuppressUnusedWarnings ((:@#@$$) a6989586621679037552 :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply ((:@#@$$) a6989586621679037552 :: TyFun [a] [a] -> Type) (a6989586621679037553 :: [a]) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply ((:@#@$$) a6989586621679037552 :: TyFun [a] [a] -> Type) (a6989586621679037553 :: [a]) = a6989586621679037552 ': a6989586621679037553

type family (a6989586621679037552 :: a) :@#@$$$ (a6989586621679037553 :: [a]) :: [a :: Type] where ... infixr 5 Source #

Equations

a6989586621679037552 :@#@$$$ a6989586621679037553 = '(:) a6989586621679037552 a6989586621679037553 

type family NilSym0 :: [a :: Type] where ... Source #

Equations

NilSym0 = '[] 

Tuples

type family Tuple0Sym0 :: () where ... Source #

Equations

Tuple0Sym0 = '() 

data Tuple2Sym0 :: (~>) a ((~>) b (a :: Type, b :: Type)) Source #

Instances

Instances details
SingI (Tuple2Sym0 :: TyFun a (b ~> (a, b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing Tuple2Sym0 #

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

Defined in Data.Singletons.Base.Instances

type Apply (Tuple2Sym0 :: TyFun a (b ~> (a, b)) -> Type) (a6989586621679038044 :: a) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple2Sym0 :: TyFun a (b ~> (a, b)) -> Type) (a6989586621679038044 :: a) = Tuple2Sym1 a6989586621679038044 :: TyFun b (a, b) -> Type

data Tuple2Sym1 (a6989586621679038044 :: a) :: (~>) b (a :: Type, b :: Type) Source #

Instances

Instances details
SingI1 (Tuple2Sym1 :: a -> TyFun b (a, b) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Tuple2Sym1 x) #

SingI d => SingI (Tuple2Sym1 d :: TyFun b (a, b) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple2Sym1 d) #

SuppressUnusedWarnings (Tuple2Sym1 a6989586621679038044 :: TyFun b (a, b) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple2Sym1 a6989586621679038044 :: TyFun k2 (k1, k2) -> Type) (a6989586621679038045 :: k2) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple2Sym1 a6989586621679038044 :: TyFun k2 (k1, k2) -> Type) (a6989586621679038045 :: k2) = '(a6989586621679038044, a6989586621679038045)

type family Tuple2Sym2 (a6989586621679038044 :: a) (a6989586621679038045 :: b) :: (a :: Type, b :: Type) where ... Source #

Equations

Tuple2Sym2 a6989586621679038044 a6989586621679038045 = '(a6989586621679038044, a6989586621679038045) 

data Tuple3Sym0 :: (~>) a ((~>) b ((~>) c (a :: Type, b :: Type, c :: Type))) Source #

Instances

Instances details
SingI (Tuple3Sym0 :: TyFun a (b ~> (c ~> (a, b, c))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing Tuple3Sym0 #

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

Defined in Data.Singletons.Base.Instances

type Apply (Tuple3Sym0 :: TyFun a (b ~> (c ~> (a, b, c))) -> Type) (a6989586621679038075 :: a) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple3Sym0 :: TyFun a (b ~> (c ~> (a, b, c))) -> Type) (a6989586621679038075 :: a) = Tuple3Sym1 a6989586621679038075 :: TyFun b (c ~> (a, b, c)) -> Type

data Tuple3Sym1 (a6989586621679038075 :: a) :: (~>) b ((~>) c (a :: Type, b :: Type, c :: Type)) Source #

Instances

Instances details
SingI1 (Tuple3Sym1 :: a -> TyFun b (c ~> (a, b, c)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Tuple3Sym1 x) #

SingI d => SingI (Tuple3Sym1 d :: TyFun b (c ~> (a, b, c)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple3Sym1 d) #

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

Defined in Data.Singletons.Base.Instances

type Apply (Tuple3Sym1 a6989586621679038075 :: TyFun b (c ~> (a, b, c)) -> Type) (a6989586621679038076 :: b) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple3Sym1 a6989586621679038075 :: TyFun b (c ~> (a, b, c)) -> Type) (a6989586621679038076 :: b) = Tuple3Sym2 a6989586621679038075 a6989586621679038076 :: TyFun c (a, b, c) -> Type

data Tuple3Sym2 (a6989586621679038075 :: a) (a6989586621679038076 :: b) :: (~>) c (a :: Type, b :: Type, c :: Type) Source #

Instances

Instances details
SingI2 (Tuple3Sym2 :: a -> b -> TyFun c (a, b, c) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

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

SingI d => SingI1 (Tuple3Sym2 d :: b -> TyFun c (a, b, c) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

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

(SingI d1, SingI d2) => SingI (Tuple3Sym2 d1 d2 :: TyFun c (a, b, c) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple3Sym2 d1 d2) #

SuppressUnusedWarnings (Tuple3Sym2 a6989586621679038075 a6989586621679038076 :: TyFun c (a, b, c) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple3Sym2 a6989586621679038075 a6989586621679038076 :: TyFun k3 (k1, k2, k3) -> Type) (a6989586621679038077 :: k3) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple3Sym2 a6989586621679038075 a6989586621679038076 :: TyFun k3 (k1, k2, k3) -> Type) (a6989586621679038077 :: k3) = '(a6989586621679038075, a6989586621679038076, a6989586621679038077)

type family Tuple3Sym3 (a6989586621679038075 :: a) (a6989586621679038076 :: b) (a6989586621679038077 :: c) :: (a :: Type, b :: Type, c :: Type) where ... Source #

Equations

Tuple3Sym3 a6989586621679038075 a6989586621679038076 a6989586621679038077 = '(a6989586621679038075, a6989586621679038076, a6989586621679038077) 

data Tuple4Sym0 :: (~>) a ((~>) b ((~>) c ((~>) d (a :: Type, b :: Type, c :: Type, d :: Type)))) Source #

Instances

Instances details
SingI (Tuple4Sym0 :: TyFun a (b ~> (c ~> (d ~> (a, b, c, d)))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing Tuple4Sym0 #

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

Defined in Data.Singletons.Base.Instances

type Apply (Tuple4Sym0 :: TyFun a (b ~> (c ~> (d ~> (a, b, c, d)))) -> Type) (a6989586621679038124 :: a) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple4Sym0 :: TyFun a (b ~> (c ~> (d ~> (a, b, c, d)))) -> Type) (a6989586621679038124 :: a) = Tuple4Sym1 a6989586621679038124 :: TyFun b (c ~> (d ~> (a, b, c, d))) -> Type

data Tuple4Sym1 (a6989586621679038124 :: a) :: (~>) b ((~>) c ((~>) d (a :: Type, b :: Type, c :: Type, d :: Type))) Source #

Instances

Instances details
SingI1 (Tuple4Sym1 :: a -> TyFun b (c ~> (d ~> (a, b, c, d))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Tuple4Sym1 x) #

SingI d1 => SingI (Tuple4Sym1 d1 :: TyFun b (c ~> (d2 ~> (a, b, c, d2))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple4Sym1 d1) #

SuppressUnusedWarnings (Tuple4Sym1 a6989586621679038124 :: TyFun b (c ~> (d ~> (a, b, c, d))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple4Sym1 a6989586621679038124 :: TyFun b (c ~> (d ~> (a, b, c, d))) -> Type) (a6989586621679038125 :: b) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple4Sym1 a6989586621679038124 :: TyFun b (c ~> (d ~> (a, b, c, d))) -> Type) (a6989586621679038125 :: b) = Tuple4Sym2 a6989586621679038124 a6989586621679038125 :: TyFun c (d ~> (a, b, c, d)) -> Type

data Tuple4Sym2 (a6989586621679038124 :: a) (a6989586621679038125 :: b) :: (~>) c ((~>) d (a :: Type, b :: Type, c :: Type, d :: Type)) Source #

Instances

Instances details
SingI2 (Tuple4Sym2 :: a -> b -> TyFun c (d ~> (a, b, c, d)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

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

SingI d1 => SingI1 (Tuple4Sym2 d1 :: b -> TyFun c (d2 ~> (a, b, c, d2)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Tuple4Sym2 d1 x) #

(SingI d1, SingI d2) => SingI (Tuple4Sym2 d1 d2 :: TyFun c (d3 ~> (a, b, c, d3)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple4Sym2 d1 d2) #

SuppressUnusedWarnings (Tuple4Sym2 a6989586621679038124 a6989586621679038125 :: TyFun c (d ~> (a, b, c, d)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple4Sym2 a6989586621679038124 a6989586621679038125 :: TyFun c (d ~> (a, b, c, d)) -> Type) (a6989586621679038126 :: c) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple4Sym2 a6989586621679038124 a6989586621679038125 :: TyFun c (d ~> (a, b, c, d)) -> Type) (a6989586621679038126 :: c) = Tuple4Sym3 a6989586621679038124 a6989586621679038125 a6989586621679038126 :: TyFun d (a, b, c, d) -> Type

data Tuple4Sym3 (a6989586621679038124 :: a) (a6989586621679038125 :: b) (a6989586621679038126 :: c) :: (~>) d (a :: Type, b :: Type, c :: Type, d :: Type) Source #

Instances

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

Defined in Data.Singletons.Base.Instances

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (Tuple4Sym3 d1 x y) #

(SingI d1, SingI d2) => SingI1 (Tuple4Sym3 d1 d2 :: c -> TyFun d3 (a, b, c, d3) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Tuple4Sym3 d1 d2 x) #

(SingI d1, SingI d2, SingI d3) => SingI (Tuple4Sym3 d1 d2 d3 :: TyFun d4 (a, b, c, d4) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple4Sym3 d1 d2 d3) #

SuppressUnusedWarnings (Tuple4Sym3 a6989586621679038124 a6989586621679038125 a6989586621679038126 :: TyFun d (a, b, c, d) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple4Sym3 a6989586621679038124 a6989586621679038125 a6989586621679038126 :: TyFun k4 (k1, k2, k3, k4) -> Type) (a6989586621679038127 :: k4) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple4Sym3 a6989586621679038124 a6989586621679038125 a6989586621679038126 :: TyFun k4 (k1, k2, k3, k4) -> Type) (a6989586621679038127 :: k4) = '(a6989586621679038124, a6989586621679038125, a6989586621679038126, a6989586621679038127)

type family Tuple4Sym4 (a6989586621679038124 :: a) (a6989586621679038125 :: b) (a6989586621679038126 :: c) (a6989586621679038127 :: d) :: (a :: Type, b :: Type, c :: Type, d :: Type) where ... Source #

Equations

Tuple4Sym4 a6989586621679038124 a6989586621679038125 a6989586621679038126 a6989586621679038127 = '(a6989586621679038124, a6989586621679038125, a6989586621679038126, a6989586621679038127) 

data Tuple5Sym0 :: (~>) a ((~>) b ((~>) c ((~>) d ((~>) e (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type))))) Source #

Instances

Instances details
SingI (Tuple5Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (a, b, c, d, e))))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing Tuple5Sym0 #

SuppressUnusedWarnings (Tuple5Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (a, b, c, d, e))))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple5Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (a, b, c, d, e))))) -> Type) (a6989586621679038193 :: a) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple5Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (a, b, c, d, e))))) -> Type) (a6989586621679038193 :: a) = Tuple5Sym1 a6989586621679038193 :: TyFun b (c ~> (d ~> (e ~> (a, b, c, d, e)))) -> Type

data Tuple5Sym1 (a6989586621679038193 :: a) :: (~>) b ((~>) c ((~>) d ((~>) e (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type)))) Source #

Instances

Instances details
SingI1 (Tuple5Sym1 :: a -> TyFun b (c ~> (d ~> (e ~> (a, b, c, d, e)))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Tuple5Sym1 x) #

SingI d1 => SingI (Tuple5Sym1 d1 :: TyFun b (c ~> (d2 ~> (e ~> (a, b, c, d2, e)))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple5Sym1 d1) #

SuppressUnusedWarnings (Tuple5Sym1 a6989586621679038193 :: TyFun b (c ~> (d ~> (e ~> (a, b, c, d, e)))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple5Sym1 a6989586621679038193 :: TyFun b (c ~> (d ~> (e ~> (a, b, c, d, e)))) -> Type) (a6989586621679038194 :: b) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple5Sym1 a6989586621679038193 :: TyFun b (c ~> (d ~> (e ~> (a, b, c, d, e)))) -> Type) (a6989586621679038194 :: b) = Tuple5Sym2 a6989586621679038193 a6989586621679038194 :: TyFun c (d ~> (e ~> (a, b, c, d, e))) -> Type

data Tuple5Sym2 (a6989586621679038193 :: a) (a6989586621679038194 :: b) :: (~>) c ((~>) d ((~>) e (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type))) Source #

Instances

Instances details
SingI2 (Tuple5Sym2 :: a -> b -> TyFun c (d ~> (e ~> (a, b, c, d, e))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

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

SingI d1 => SingI1 (Tuple5Sym2 d1 :: b -> TyFun c (d2 ~> (e ~> (a, b, c, d2, e))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Tuple5Sym2 d1 x) #

(SingI d1, SingI d2) => SingI (Tuple5Sym2 d1 d2 :: TyFun c (d3 ~> (e ~> (a, b, c, d3, e))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple5Sym2 d1 d2) #

SuppressUnusedWarnings (Tuple5Sym2 a6989586621679038193 a6989586621679038194 :: TyFun c (d ~> (e ~> (a, b, c, d, e))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple5Sym2 a6989586621679038193 a6989586621679038194 :: TyFun c (d ~> (e ~> (a, b, c, d, e))) -> Type) (a6989586621679038195 :: c) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple5Sym2 a6989586621679038193 a6989586621679038194 :: TyFun c (d ~> (e ~> (a, b, c, d, e))) -> Type) (a6989586621679038195 :: c) = Tuple5Sym3 a6989586621679038193 a6989586621679038194 a6989586621679038195 :: TyFun d (e ~> (a, b, c, d, e)) -> Type

data Tuple5Sym3 (a6989586621679038193 :: a) (a6989586621679038194 :: b) (a6989586621679038195 :: c) :: (~>) d ((~>) e (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type)) Source #

Instances

Instances details
SingI d1 => SingI2 (Tuple5Sym3 d1 :: b -> c -> TyFun d2 (e ~> (a, b, c, d2, e)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (Tuple5Sym3 d1 x y) #

(SingI d1, SingI d2) => SingI1 (Tuple5Sym3 d1 d2 :: c -> TyFun d3 (e ~> (a, b, c, d3, e)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Tuple5Sym3 d1 d2 x) #

(SingI d1, SingI d2, SingI d3) => SingI (Tuple5Sym3 d1 d2 d3 :: TyFun d4 (e ~> (a, b, c, d4, e)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple5Sym3 d1 d2 d3) #

SuppressUnusedWarnings (Tuple5Sym3 a6989586621679038193 a6989586621679038194 a6989586621679038195 :: TyFun d (e ~> (a, b, c, d, e)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple5Sym3 a6989586621679038193 a6989586621679038194 a6989586621679038195 :: TyFun d (e ~> (a, b, c, d, e)) -> Type) (a6989586621679038196 :: d) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple5Sym3 a6989586621679038193 a6989586621679038194 a6989586621679038195 :: TyFun d (e ~> (a, b, c, d, e)) -> Type) (a6989586621679038196 :: d) = Tuple5Sym4 a6989586621679038193 a6989586621679038194 a6989586621679038195 a6989586621679038196 :: TyFun e (a, b, c, d, e) -> Type

data Tuple5Sym4 (a6989586621679038193 :: a) (a6989586621679038194 :: b) (a6989586621679038195 :: c) (a6989586621679038196 :: d) :: (~>) e (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type) Source #

Instances

Instances details
(SingI d1, SingI d2) => SingI2 (Tuple5Sym4 d1 d2 :: c -> d3 -> TyFun e (a, b, c, d3, e) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (Tuple5Sym4 d1 d2 x y) #

(SingI d1, SingI d2, SingI d3) => SingI1 (Tuple5Sym4 d1 d2 d3 :: d4 -> TyFun e (a, b, c, d4, e) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Tuple5Sym4 d1 d2 d3 x) #

(SingI d1, SingI d2, SingI d3, SingI d5) => SingI (Tuple5Sym4 d1 d2 d3 d5 :: TyFun e (a, b, c, d4, e) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple5Sym4 d1 d2 d3 d5) #

SuppressUnusedWarnings (Tuple5Sym4 a6989586621679038193 a6989586621679038194 a6989586621679038195 a6989586621679038196 :: TyFun e (a, b, c, d, e) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple5Sym4 a6989586621679038193 a6989586621679038194 a6989586621679038195 a6989586621679038196 :: TyFun k5 (k1, k2, k3, k4, k5) -> Type) (a6989586621679038197 :: k5) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple5Sym4 a6989586621679038193 a6989586621679038194 a6989586621679038195 a6989586621679038196 :: TyFun k5 (k1, k2, k3, k4, k5) -> Type) (a6989586621679038197 :: k5) = '(a6989586621679038193, a6989586621679038194, a6989586621679038195, a6989586621679038196, a6989586621679038197)

type family Tuple5Sym5 (a6989586621679038193 :: a) (a6989586621679038194 :: b) (a6989586621679038195 :: c) (a6989586621679038196 :: d) (a6989586621679038197 :: e) :: (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type) where ... Source #

Equations

Tuple5Sym5 a6989586621679038193 a6989586621679038194 a6989586621679038195 a6989586621679038196 a6989586621679038197 = '(a6989586621679038193, a6989586621679038194, a6989586621679038195, a6989586621679038196, a6989586621679038197) 

data Tuple6Sym0 :: (~>) a ((~>) b ((~>) c ((~>) d ((~>) e ((~>) f (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type)))))) Source #

Instances

Instances details
SingI (Tuple6Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f)))))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing Tuple6Sym0 #

SuppressUnusedWarnings (Tuple6Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f)))))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple6Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f)))))) -> Type) (a6989586621679038284 :: a) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple6Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f)))))) -> Type) (a6989586621679038284 :: a) = Tuple6Sym1 a6989586621679038284 :: TyFun b (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f))))) -> Type

data Tuple6Sym1 (a6989586621679038284 :: a) :: (~>) b ((~>) c ((~>) d ((~>) e ((~>) f (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type))))) Source #

Instances

Instances details
SingI1 (Tuple6Sym1 :: a -> TyFun b (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f))))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Tuple6Sym1 x) #

SingI d1 => SingI (Tuple6Sym1 d1 :: TyFun b (c ~> (d2 ~> (e ~> (f ~> (a, b, c, d2, e, f))))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple6Sym1 d1) #

SuppressUnusedWarnings (Tuple6Sym1 a6989586621679038284 :: TyFun b (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f))))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple6Sym1 a6989586621679038284 :: TyFun b (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f))))) -> Type) (a6989586621679038285 :: b) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple6Sym1 a6989586621679038284 :: TyFun b (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f))))) -> Type) (a6989586621679038285 :: b) = Tuple6Sym2 a6989586621679038284 a6989586621679038285 :: TyFun c (d ~> (e ~> (f ~> (a, b, c, d, e, f)))) -> Type

data Tuple6Sym2 (a6989586621679038284 :: a) (a6989586621679038285 :: b) :: (~>) c ((~>) d ((~>) e ((~>) f (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type)))) Source #

Instances

Instances details
SingI2 (Tuple6Sym2 :: a -> b -> TyFun c (d ~> (e ~> (f ~> (a, b, c, d, e, f)))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

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

SingI d1 => SingI1 (Tuple6Sym2 d1 :: b -> TyFun c (d2 ~> (e ~> (f ~> (a, b, c, d2, e, f)))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Tuple6Sym2 d1 x) #

(SingI d1, SingI d2) => SingI (Tuple6Sym2 d1 d2 :: TyFun c (d3 ~> (e ~> (f ~> (a, b, c, d3, e, f)))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple6Sym2 d1 d2) #

SuppressUnusedWarnings (Tuple6Sym2 a6989586621679038284 a6989586621679038285 :: TyFun c (d ~> (e ~> (f ~> (a, b, c, d, e, f)))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple6Sym2 a6989586621679038284 a6989586621679038285 :: TyFun c (d ~> (e ~> (f ~> (a, b, c, d, e, f)))) -> Type) (a6989586621679038286 :: c) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple6Sym2 a6989586621679038284 a6989586621679038285 :: TyFun c (d ~> (e ~> (f ~> (a, b, c, d, e, f)))) -> Type) (a6989586621679038286 :: c) = Tuple6Sym3 a6989586621679038284 a6989586621679038285 a6989586621679038286 :: TyFun d (e ~> (f ~> (a, b, c, d, e, f))) -> Type

data Tuple6Sym3 (a6989586621679038284 :: a) (a6989586621679038285 :: b) (a6989586621679038286 :: c) :: (~>) d ((~>) e ((~>) f (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type))) Source #

Instances

Instances details
SingI d1 => SingI2 (Tuple6Sym3 d1 :: b -> c -> TyFun d2 (e ~> (f ~> (a, b, c, d2, e, f))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (Tuple6Sym3 d1 x y) #

(SingI d1, SingI d2) => SingI1 (Tuple6Sym3 d1 d2 :: c -> TyFun d3 (e ~> (f ~> (a, b, c, d3, e, f))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Tuple6Sym3 d1 d2 x) #

(SingI d1, SingI d2, SingI d3) => SingI (Tuple6Sym3 d1 d2 d3 :: TyFun d4 (e ~> (f ~> (a, b, c, d4, e, f))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple6Sym3 d1 d2 d3) #

SuppressUnusedWarnings (Tuple6Sym3 a6989586621679038284 a6989586621679038285 a6989586621679038286 :: TyFun d (e ~> (f ~> (a, b, c, d, e, f))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple6Sym3 a6989586621679038284 a6989586621679038285 a6989586621679038286 :: TyFun d (e ~> (f ~> (a, b, c, d, e, f))) -> Type) (a6989586621679038287 :: d) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple6Sym3 a6989586621679038284 a6989586621679038285 a6989586621679038286 :: TyFun d (e ~> (f ~> (a, b, c, d, e, f))) -> Type) (a6989586621679038287 :: d) = Tuple6Sym4 a6989586621679038284 a6989586621679038285 a6989586621679038286 a6989586621679038287 :: TyFun e (f ~> (a, b, c, d, e, f)) -> Type

data Tuple6Sym4 (a6989586621679038284 :: a) (a6989586621679038285 :: b) (a6989586621679038286 :: c) (a6989586621679038287 :: d) :: (~>) e ((~>) f (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type)) Source #

Instances

Instances details
(SingI d1, SingI d2) => SingI2 (Tuple6Sym4 d1 d2 :: c -> d3 -> TyFun e (f ~> (a, b, c, d3, e, f)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (Tuple6Sym4 d1 d2 x y) #

(SingI d1, SingI d2, SingI d3) => SingI1 (Tuple6Sym4 d1 d2 d3 :: d4 -> TyFun e (f ~> (a, b, c, d4, e, f)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Tuple6Sym4 d1 d2 d3 x) #

(SingI d1, SingI d2, SingI d3, SingI d5) => SingI (Tuple6Sym4 d1 d2 d3 d5 :: TyFun e (f ~> (a, b, c, d4, e, f)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple6Sym4 d1 d2 d3 d5) #

SuppressUnusedWarnings (Tuple6Sym4 a6989586621679038284 a6989586621679038285 a6989586621679038286 a6989586621679038287 :: TyFun e (f ~> (a, b, c, d, e, f)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple6Sym4 a6989586621679038284 a6989586621679038285 a6989586621679038286 a6989586621679038287 :: TyFun e (f ~> (a, b, c, d, e, f)) -> Type) (a6989586621679038288 :: e) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple6Sym4 a6989586621679038284 a6989586621679038285 a6989586621679038286 a6989586621679038287 :: TyFun e (f ~> (a, b, c, d, e, f)) -> Type) (a6989586621679038288 :: e) = Tuple6Sym5 a6989586621679038284 a6989586621679038285 a6989586621679038286 a6989586621679038287 a6989586621679038288 :: TyFun f (a, b, c, d, e, f) -> Type

data Tuple6Sym5 (a6989586621679038284 :: a) (a6989586621679038285 :: b) (a6989586621679038286 :: c) (a6989586621679038287 :: d) (a6989586621679038288 :: e) :: (~>) f (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type) Source #

Instances

Instances details
(SingI d1, SingI d2, SingI d3) => SingI2 (Tuple6Sym5 d1 d2 d3 :: d4 -> e -> TyFun f (a, b, c, d4, e, f) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (Tuple6Sym5 d1 d2 d3 x y) #

(SingI d1, SingI d2, SingI d3, SingI d5) => SingI1 (Tuple6Sym5 d1 d2 d3 d5 :: e -> TyFun f (a, b, c, d4, e, f) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Tuple6Sym5 d1 d2 d3 d5 x) #

(SingI d1, SingI d2, SingI d3, SingI d5, SingI d6) => SingI (Tuple6Sym5 d1 d2 d3 d5 d6 :: TyFun f (a, b, c, d4, e, f) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple6Sym5 d1 d2 d3 d5 d6) #

SuppressUnusedWarnings (Tuple6Sym5 a6989586621679038284 a6989586621679038285 a6989586621679038286 a6989586621679038287 a6989586621679038288 :: TyFun f (a, b, c, d, e, f) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple6Sym5 a6989586621679038284 a6989586621679038285 a6989586621679038286 a6989586621679038287 a6989586621679038288 :: TyFun k6 (k1, k2, k3, k4, k5, k6) -> Type) (a6989586621679038289 :: k6) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple6Sym5 a6989586621679038284 a6989586621679038285 a6989586621679038286 a6989586621679038287 a6989586621679038288 :: TyFun k6 (k1, k2, k3, k4, k5, k6) -> Type) (a6989586621679038289 :: k6) = '(a6989586621679038284, a6989586621679038285, a6989586621679038286, a6989586621679038287, a6989586621679038288, a6989586621679038289)

type family Tuple6Sym6 (a6989586621679038284 :: a) (a6989586621679038285 :: b) (a6989586621679038286 :: c) (a6989586621679038287 :: d) (a6989586621679038288 :: e) (a6989586621679038289 :: f) :: (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type) where ... Source #

Equations

Tuple6Sym6 a6989586621679038284 a6989586621679038285 a6989586621679038286 a6989586621679038287 a6989586621679038288 a6989586621679038289 = '(a6989586621679038284, a6989586621679038285, a6989586621679038286, a6989586621679038287, a6989586621679038288, a6989586621679038289) 

data Tuple7Sym0 :: (~>) a ((~>) b ((~>) c ((~>) d ((~>) e ((~>) f ((~>) g (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type, g :: Type))))))) Source #

Instances

Instances details
SingI (Tuple7Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing Tuple7Sym0 #

SuppressUnusedWarnings (Tuple7Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple7Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))))) -> Type) (a6989586621679038399 :: a) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple7Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))))) -> Type) (a6989586621679038399 :: a) = Tuple7Sym1 a6989586621679038399 :: TyFun b (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))))) -> Type

data Tuple7Sym1 (a6989586621679038399 :: a) :: (~>) b ((~>) c ((~>) d ((~>) e ((~>) f ((~>) g (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type, g :: Type)))))) Source #

Instances

Instances details
SingI1 (Tuple7Sym1 :: a -> TyFun b (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Tuple7Sym1 x) #

SingI d1 => SingI (Tuple7Sym1 d1 :: TyFun b (c ~> (d2 ~> (e ~> (f ~> (g ~> (a, b, c, d2, e, f, g)))))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple7Sym1 d1) #

SuppressUnusedWarnings (Tuple7Sym1 a6989586621679038399 :: TyFun b (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple7Sym1 a6989586621679038399 :: TyFun b (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))))) -> Type) (a6989586621679038400 :: b) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple7Sym1 a6989586621679038399 :: TyFun b (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))))) -> Type) (a6989586621679038400 :: b) = Tuple7Sym2 a6989586621679038399 a6989586621679038400 :: TyFun c (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))) -> Type

data Tuple7Sym2 (a6989586621679038399 :: a) (a6989586621679038400 :: b) :: (~>) c ((~>) d ((~>) e ((~>) f ((~>) g (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type, g :: Type))))) Source #

Instances

Instances details
SingI2 (Tuple7Sym2 :: a -> b -> TyFun c (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

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

SingI d1 => SingI1 (Tuple7Sym2 d1 :: b -> TyFun c (d2 ~> (e ~> (f ~> (g ~> (a, b, c, d2, e, f, g))))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Tuple7Sym2 d1 x) #

(SingI d1, SingI d2) => SingI (Tuple7Sym2 d1 d2 :: TyFun c (d3 ~> (e ~> (f ~> (g ~> (a, b, c, d3, e, f, g))))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple7Sym2 d1 d2) #

SuppressUnusedWarnings (Tuple7Sym2 a6989586621679038399 a6989586621679038400 :: TyFun c (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple7Sym2 a6989586621679038399 a6989586621679038400 :: TyFun c (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))) -> Type) (a6989586621679038401 :: c) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple7Sym2 a6989586621679038399 a6989586621679038400 :: TyFun c (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))) -> Type) (a6989586621679038401 :: c) = Tuple7Sym3 a6989586621679038399 a6989586621679038400 a6989586621679038401 :: TyFun d (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))) -> Type

data Tuple7Sym3 (a6989586621679038399 :: a) (a6989586621679038400 :: b) (a6989586621679038401 :: c) :: (~>) d ((~>) e ((~>) f ((~>) g (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type, g :: Type)))) Source #

Instances

Instances details
SingI d1 => SingI2 (Tuple7Sym3 d1 :: b -> c -> TyFun d2 (e ~> (f ~> (g ~> (a, b, c, d2, e, f, g)))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (Tuple7Sym3 d1 x y) #

(SingI d1, SingI d2) => SingI1 (Tuple7Sym3 d1 d2 :: c -> TyFun d3 (e ~> (f ~> (g ~> (a, b, c, d3, e, f, g)))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Tuple7Sym3 d1 d2 x) #

(SingI d1, SingI d2, SingI d3) => SingI (Tuple7Sym3 d1 d2 d3 :: TyFun d4 (e ~> (f ~> (g ~> (a, b, c, d4, e, f, g)))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple7Sym3 d1 d2 d3) #

SuppressUnusedWarnings (Tuple7Sym3 a6989586621679038399 a6989586621679038400 a6989586621679038401 :: TyFun d (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple7Sym3 a6989586621679038399 a6989586621679038400 a6989586621679038401 :: TyFun d (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))) -> Type) (a6989586621679038402 :: d) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple7Sym3 a6989586621679038399 a6989586621679038400 a6989586621679038401 :: TyFun d (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))) -> Type) (a6989586621679038402 :: d) = Tuple7Sym4 a6989586621679038399 a6989586621679038400 a6989586621679038401 a6989586621679038402 :: TyFun e (f ~> (g ~> (a, b, c, d, e, f, g))) -> Type

data Tuple7Sym4 (a6989586621679038399 :: a) (a6989586621679038400 :: b) (a6989586621679038401 :: c) (a6989586621679038402 :: d) :: (~>) e ((~>) f ((~>) g (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type, g :: Type))) Source #

Instances

Instances details
(SingI d1, SingI d2) => SingI2 (Tuple7Sym4 d1 d2 :: c -> d3 -> TyFun e (f ~> (g ~> (a, b, c, d3, e, f, g))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (Tuple7Sym4 d1 d2 x y) #

(SingI d1, SingI d2, SingI d3) => SingI1 (Tuple7Sym4 d1 d2 d3 :: d4 -> TyFun e (f ~> (g ~> (a, b, c, d4, e, f, g))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Tuple7Sym4 d1 d2 d3 x) #

(SingI d1, SingI d2, SingI d3, SingI d5) => SingI (Tuple7Sym4 d1 d2 d3 d5 :: TyFun e (f ~> (g ~> (a, b, c, d4, e, f, g))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple7Sym4 d1 d2 d3 d5) #

SuppressUnusedWarnings (Tuple7Sym4 a6989586621679038399 a6989586621679038400 a6989586621679038401 a6989586621679038402 :: TyFun e (f ~> (g ~> (a, b, c, d, e, f, g))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple7Sym4 a6989586621679038399 a6989586621679038400 a6989586621679038401 a6989586621679038402 :: TyFun e (f ~> (g ~> (a, b, c, d, e, f, g))) -> Type) (a6989586621679038403 :: e) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple7Sym4 a6989586621679038399 a6989586621679038400 a6989586621679038401 a6989586621679038402 :: TyFun e (f ~> (g ~> (a, b, c, d, e, f, g))) -> Type) (a6989586621679038403 :: e) = Tuple7Sym5 a6989586621679038399 a6989586621679038400 a6989586621679038401 a6989586621679038402 a6989586621679038403 :: TyFun f (g ~> (a, b, c, d, e, f, g)) -> Type

data Tuple7Sym5 (a6989586621679038399 :: a) (a6989586621679038400 :: b) (a6989586621679038401 :: c) (a6989586621679038402 :: d) (a6989586621679038403 :: e) :: (~>) f ((~>) g (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type, g :: Type)) Source #

Instances

Instances details
(SingI d1, SingI d2, SingI d3) => SingI2 (Tuple7Sym5 d1 d2 d3 :: d4 -> e -> TyFun f (g ~> (a, b, c, d4, e, f, g)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (Tuple7Sym5 d1 d2 d3 x y) #

(SingI d1, SingI d2, SingI d3, SingI d5) => SingI1 (Tuple7Sym5 d1 d2 d3 d5 :: e -> TyFun f (g ~> (a, b, c, d4, e, f, g)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Tuple7Sym5 d1 d2 d3 d5 x) #

(SingI d1, SingI d2, SingI d3, SingI d5, SingI d6) => SingI (Tuple7Sym5 d1 d2 d3 d5 d6 :: TyFun f (g ~> (a, b, c, d4, e, f, g)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple7Sym5 d1 d2 d3 d5 d6) #

SuppressUnusedWarnings (Tuple7Sym5 a6989586621679038399 a6989586621679038400 a6989586621679038401 a6989586621679038402 a6989586621679038403 :: TyFun f (g ~> (a, b, c, d, e, f, g)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple7Sym5 a6989586621679038399 a6989586621679038400 a6989586621679038401 a6989586621679038402 a6989586621679038403 :: TyFun f (g ~> (a, b, c, d, e, f, g)) -> Type) (a6989586621679038404 :: f) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple7Sym5 a6989586621679038399 a6989586621679038400 a6989586621679038401 a6989586621679038402 a6989586621679038403 :: TyFun f (g ~> (a, b, c, d, e, f, g)) -> Type) (a6989586621679038404 :: f) = Tuple7Sym6 a6989586621679038399 a6989586621679038400 a6989586621679038401 a6989586621679038402 a6989586621679038403 a6989586621679038404 :: TyFun g (a, b, c, d, e, f, g) -> Type

data Tuple7Sym6 (a6989586621679038399 :: a) (a6989586621679038400 :: b) (a6989586621679038401 :: c) (a6989586621679038402 :: d) (a6989586621679038403 :: e) (a6989586621679038404 :: f) :: (~>) g (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type, g :: Type) Source #

Instances

Instances details
(SingI d1, SingI d2, SingI d3, SingI d5) => SingI2 (Tuple7Sym6 d1 d2 d3 d5 :: e -> f -> TyFun g (a, b, c, d4, e, f, g) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (Tuple7Sym6 d1 d2 d3 d5 x y) #

(SingI d1, SingI d2, SingI d3, SingI d5, SingI d6) => SingI1 (Tuple7Sym6 d1 d2 d3 d5 d6 :: f -> TyFun g (a, b, c, d4, e, f, g) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Tuple7Sym6 d1 d2 d3 d5 d6 x) #

(SingI d1, SingI d2, SingI d3, SingI d5, SingI d6, SingI d7) => SingI (Tuple7Sym6 d1 d2 d3 d5 d6 d7 :: TyFun g (a, b, c, d4, e, f, g) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

Methods

sing :: Sing (Tuple7Sym6 d1 d2 d3 d5 d6 d7) #

SuppressUnusedWarnings (Tuple7Sym6 a6989586621679038399 a6989586621679038400 a6989586621679038401 a6989586621679038402 a6989586621679038403 a6989586621679038404 :: TyFun g (a, b, c, d, e, f, g) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple7Sym6 a6989586621679038399 a6989586621679038400 a6989586621679038401 a6989586621679038402 a6989586621679038403 a6989586621679038404 :: TyFun k7 (k1, k2, k3, k4, k5, k6, k7) -> Type) (a6989586621679038405 :: k7) Source # 
Instance details

Defined in Data.Singletons.Base.Instances

type Apply (Tuple7Sym6 a6989586621679038399 a6989586621679038400 a6989586621679038401 a6989586621679038402 a6989586621679038403 a6989586621679038404 :: TyFun k7 (k1, k2, k3, k4, k5, k6, k7) -> Type) (a6989586621679038405 :: k7) = '(a6989586621679038399, a6989586621679038400, a6989586621679038401, a6989586621679038402, a6989586621679038403, a6989586621679038404, a6989586621679038405)

type family Tuple7Sym7 (a6989586621679038399 :: a) (a6989586621679038400 :: b) (a6989586621679038401 :: c) (a6989586621679038402 :: d) (a6989586621679038403 :: e) (a6989586621679038404 :: f) (a6989586621679038405 :: g) :: (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type, g :: Type) where ... Source #

Equations

Tuple7Sym7 a6989586621679038399 a6989586621679038400 a6989586621679038401 a6989586621679038402 a6989586621679038403 a6989586621679038404 a6989586621679038405 = '(a6989586621679038399, a6989586621679038400, a6989586621679038401, a6989586621679038402, a6989586621679038403, a6989586621679038404, a6989586621679038405) 

data FstSym0 :: (~>) (a, b) a Source #

Instances

Instances details
SingI (FstSym0 :: TyFun (a, b) a -> Type) Source # 
Instance details

Defined in Data.Tuple.Singletons

Methods

sing :: Sing FstSym0 #

SuppressUnusedWarnings (FstSym0 :: TyFun (a, b) a -> Type) Source # 
Instance details

Defined in Data.Tuple.Singletons

type Apply (FstSym0 :: TyFun (a, b) a -> Type) (a6989586621679137835 :: (a, b)) Source # 
Instance details

Defined in Data.Tuple.Singletons

type Apply (FstSym0 :: TyFun (a, b) a -> Type) (a6989586621679137835 :: (a, b)) = Fst a6989586621679137835

type family FstSym1 (a6989586621679137835 :: (a, b)) :: a where ... Source #

Equations

FstSym1 a6989586621679137835 = Fst a6989586621679137835 

data SndSym0 :: (~>) (a, b) b Source #

Instances

Instances details
SingI (SndSym0 :: TyFun (a, b) b -> Type) Source # 
Instance details

Defined in Data.Tuple.Singletons

Methods

sing :: Sing SndSym0 #

SuppressUnusedWarnings (SndSym0 :: TyFun (a, b) b -> Type) Source # 
Instance details

Defined in Data.Tuple.Singletons

type Apply (SndSym0 :: TyFun (a, b) b -> Type) (a6989586621679137831 :: (a, b)) Source # 
Instance details

Defined in Data.Tuple.Singletons

type Apply (SndSym0 :: TyFun (a, b) b -> Type) (a6989586621679137831 :: (a, b)) = Snd a6989586621679137831

type family SndSym1 (a6989586621679137831 :: (a, b)) :: b where ... Source #

Equations

SndSym1 a6989586621679137831 = Snd a6989586621679137831 

data CurrySym0 :: (~>) ((~>) (a, b) c) ((~>) a ((~>) b c)) Source #

Instances

Instances details
SingI (CurrySym0 :: TyFun ((a, b) ~> c) (a ~> (b ~> c)) -> Type) Source # 
Instance details

Defined in Data.Tuple.Singletons

Methods

sing :: Sing CurrySym0 #

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

Defined in Data.Tuple.Singletons

type Apply (CurrySym0 :: TyFun ((a, b) ~> c) (a ~> (b ~> c)) -> Type) (a6989586621679137823 :: (a, b) ~> c) Source # 
Instance details

Defined in Data.Tuple.Singletons

type Apply (CurrySym0 :: TyFun ((a, b) ~> c) (a ~> (b ~> c)) -> Type) (a6989586621679137823 :: (a, b) ~> c) = CurrySym1 a6989586621679137823

data CurrySym1 (a6989586621679137823 :: (~>) (a, b) c) :: (~>) a ((~>) b c) Source #

Instances

Instances details
SingI1 (CurrySym1 :: ((a, b) ~> c) -> TyFun a (b ~> c) -> Type) Source # 
Instance details

Defined in Data.Tuple.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (CurrySym1 x) #

SingI d => SingI (CurrySym1 d :: TyFun a (b ~> c) -> Type) Source # 
Instance details

Defined in Data.Tuple.Singletons

Methods

sing :: Sing (CurrySym1 d) #

SuppressUnusedWarnings (CurrySym1 a6989586621679137823 :: TyFun a (b ~> c) -> Type) Source # 
Instance details

Defined in Data.Tuple.Singletons

type Apply (CurrySym1 a6989586621679137823 :: TyFun a (b ~> c) -> Type) (a6989586621679137824 :: a) Source # 
Instance details

Defined in Data.Tuple.Singletons

type Apply (CurrySym1 a6989586621679137823 :: TyFun a (b ~> c) -> Type) (a6989586621679137824 :: a) = CurrySym2 a6989586621679137823 a6989586621679137824

data CurrySym2 (a6989586621679137823 :: (~>) (a, b) c) (a6989586621679137824 :: a) :: (~>) b c Source #

Instances

Instances details
SingI d => SingI1 (CurrySym2 d :: a -> TyFun b c -> Type) Source # 
Instance details

Defined in Data.Tuple.Singletons

Methods

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

SingI2 (CurrySym2 :: ((a, b) ~> c) -> a -> TyFun b c -> Type) Source # 
Instance details

Defined in Data.Tuple.Singletons

Methods

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

(SingI d1, SingI d2) => SingI (CurrySym2 d1 d2 :: TyFun b c -> Type) Source # 
Instance details

Defined in Data.Tuple.Singletons

Methods

sing :: Sing (CurrySym2 d1 d2) #

SuppressUnusedWarnings (CurrySym2 a6989586621679137823 a6989586621679137824 :: TyFun b c -> Type) Source # 
Instance details

Defined in Data.Tuple.Singletons

type Apply (CurrySym2 a6989586621679137823 a6989586621679137824 :: TyFun b c -> Type) (a6989586621679137825 :: b) Source # 
Instance details

Defined in Data.Tuple.Singletons

type Apply (CurrySym2 a6989586621679137823 a6989586621679137824 :: TyFun b c -> Type) (a6989586621679137825 :: b) = Curry a6989586621679137823 a6989586621679137824 a6989586621679137825

type family CurrySym3 (a6989586621679137823 :: (~>) (a, b) c) (a6989586621679137824 :: a) (a6989586621679137825 :: b) :: c where ... Source #

Equations

CurrySym3 a6989586621679137823 a6989586621679137824 a6989586621679137825 = Curry a6989586621679137823 a6989586621679137824 a6989586621679137825 

data UncurrySym0 :: (~>) ((~>) a ((~>) b c)) ((~>) (a, b) c) Source #

Instances

Instances details
SingI (UncurrySym0 :: TyFun (a ~> (b ~> c)) ((a, b) ~> c) -> Type) Source # 
Instance details

Defined in Data.Tuple.Singletons

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

Defined in Data.Tuple.Singletons

type Apply (UncurrySym0 :: TyFun (a ~> (b ~> c)) ((a, b) ~> c) -> Type) (a6989586621679137815 :: a ~> (b ~> c)) Source # 
Instance details

Defined in Data.Tuple.Singletons

type Apply (UncurrySym0 :: TyFun (a ~> (b ~> c)) ((a, b) ~> c) -> Type) (a6989586621679137815 :: a ~> (b ~> c)) = UncurrySym1 a6989586621679137815

data UncurrySym1 (a6989586621679137815 :: (~>) a ((~>) b c)) :: (~>) (a, b) c Source #

Instances

Instances details
SingI1 (UncurrySym1 :: (a ~> (b ~> c)) -> TyFun (a, b) c -> Type) Source # 
Instance details

Defined in Data.Tuple.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (UncurrySym1 x) #

SingI d => SingI (UncurrySym1 d :: TyFun (a, b) c -> Type) Source # 
Instance details

Defined in Data.Tuple.Singletons

Methods

sing :: Sing (UncurrySym1 d) #

SuppressUnusedWarnings (UncurrySym1 a6989586621679137815 :: TyFun (a, b) c -> Type) Source # 
Instance details

Defined in Data.Tuple.Singletons

type Apply (UncurrySym1 a6989586621679137815 :: TyFun (a, b) c -> Type) (a6989586621679137816 :: (a, b)) Source # 
Instance details

Defined in Data.Tuple.Singletons

type Apply (UncurrySym1 a6989586621679137815 :: TyFun (a, b) c -> Type) (a6989586621679137816 :: (a, b)) = Uncurry a6989586621679137815 a6989586621679137816

type family UncurrySym2 (a6989586621679137815 :: (~>) a ((~>) b c)) (a6989586621679137816 :: (a, b)) :: c where ... Source #

Equations

UncurrySym2 a6989586621679137815 a6989586621679137816 = Uncurry a6989586621679137815 a6989586621679137816 

Basic type classes

data (==@#@$) :: (~>) a ((~>) a Bool) infix 4 Source #

Instances

Instances details
SEq a => SingI ((==@#@$) :: TyFun a (a ~> Bool) -> Type) Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

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

SuppressUnusedWarnings ((==@#@$) :: TyFun a (a ~> Bool) -> Type) Source # 
Instance details

Defined in Data.Eq.Singletons

type Apply ((==@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679109583 :: a) Source # 
Instance details

Defined in Data.Eq.Singletons

type Apply ((==@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679109583 :: a) = (==@#@$$) a6989586621679109583

data (==@#@$$) (a6989586621679109583 :: a) :: (~>) a Bool infix 4 Source #

Instances

Instances details
SEq a => SingI1 ((==@#@$$) :: a -> TyFun a Bool -> Type) Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

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

(SEq a, SingI d) => SingI ((==@#@$$) d :: TyFun a Bool -> Type) Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

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

SuppressUnusedWarnings ((==@#@$$) a6989586621679109583 :: TyFun a Bool -> Type) Source # 
Instance details

Defined in Data.Eq.Singletons

type Apply ((==@#@$$) a6989586621679109583 :: TyFun a Bool -> Type) (a6989586621679109584 :: a) Source # 
Instance details

Defined in Data.Eq.Singletons

type Apply ((==@#@$$) a6989586621679109583 :: TyFun a Bool -> Type) (a6989586621679109584 :: a) = a6989586621679109583 == a6989586621679109584

type family (a6989586621679109583 :: a) ==@#@$$$ (a6989586621679109584 :: a) :: Bool where ... infix 4 Source #

Equations

a6989586621679109583 ==@#@$$$ a6989586621679109584 = (==) a6989586621679109583 a6989586621679109584 

data (/=@#@$) :: (~>) a ((~>) a Bool) infix 4 Source #

Instances

Instances details
SEq a => SingI ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

sing :: Sing (/=@#@$) #

SuppressUnusedWarnings ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) Source # 
Instance details

Defined in Data.Eq.Singletons

type Apply ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679109588 :: a) Source # 
Instance details

Defined in Data.Eq.Singletons

type Apply ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679109588 :: a) = (/=@#@$$) a6989586621679109588

data (/=@#@$$) (a6989586621679109588 :: a) :: (~>) a Bool infix 4 Source #

Instances

Instances details
SEq a => SingI1 ((/=@#@$$) :: a -> TyFun a Bool -> Type) Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

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

(SEq a, SingI d) => SingI ((/=@#@$$) d :: TyFun a Bool -> Type) Source # 
Instance details

Defined in Data.Eq.Singletons

Methods

sing :: Sing ((/=@#@$$) d) #

SuppressUnusedWarnings ((/=@#@$$) a6989586621679109588 :: TyFun a Bool -> Type) Source # 
Instance details

Defined in Data.Eq.Singletons

type Apply ((/=@#@$$) a6989586621679109588 :: TyFun a Bool -> Type) (a6989586621679109589 :: a) Source # 
Instance details

Defined in Data.Eq.Singletons

type Apply ((/=@#@$$) a6989586621679109588 :: TyFun a Bool -> Type) (a6989586621679109589 :: a) = a6989586621679109588 /= a6989586621679109589

type family (a6989586621679109588 :: a) /=@#@$$$ (a6989586621679109589 :: a) :: Bool where ... infix 4 Source #

Equations

a6989586621679109588 /=@#@$$$ a6989586621679109589 = (/=) a6989586621679109588 a6989586621679109589 

data CompareSym0 :: (~>) a ((~>) a Ordering) Source #

Instances

Instances details
SOrd a => SingI (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

SuppressUnusedWarnings (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) (a6989586621679190369 :: a) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) (a6989586621679190369 :: a) = CompareSym1 a6989586621679190369

data CompareSym1 (a6989586621679190369 :: a) :: (~>) a Ordering Source #

Instances

Instances details
SOrd a => SingI1 (CompareSym1 :: a -> TyFun a Ordering -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (CompareSym1 x) #

(SOrd a, SingI d) => SingI (CompareSym1 d :: TyFun a Ordering -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sing :: Sing (CompareSym1 d) #

SuppressUnusedWarnings (CompareSym1 a6989586621679190369 :: TyFun a Ordering -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply (CompareSym1 a6989586621679190369 :: TyFun a Ordering -> Type) (a6989586621679190370 :: a) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply (CompareSym1 a6989586621679190369 :: TyFun a Ordering -> Type) (a6989586621679190370 :: a) = Compare a6989586621679190369 a6989586621679190370

type family CompareSym2 (a6989586621679190369 :: a) (a6989586621679190370 :: a) :: Ordering where ... Source #

Equations

CompareSym2 a6989586621679190369 a6989586621679190370 = Compare a6989586621679190369 a6989586621679190370 

data (<@#@$) :: (~>) a ((~>) a Bool) infix 4 Source #

Instances

Instances details
SOrd a => SingI ((<@#@$) :: TyFun a (a ~> Bool) -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

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

SuppressUnusedWarnings ((<@#@$) :: TyFun a (a ~> Bool) -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply ((<@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679190374 :: a) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply ((<@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679190374 :: a) = (<@#@$$) a6989586621679190374

data (<@#@$$) (a6989586621679190374 :: a) :: (~>) a Bool infix 4 Source #

Instances

Instances details
SOrd a => SingI1 ((<@#@$$) :: a -> TyFun a Bool -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

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

(SOrd a, SingI d) => SingI ((<@#@$$) d :: TyFun a Bool -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

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

SuppressUnusedWarnings ((<@#@$$) a6989586621679190374 :: TyFun a Bool -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply ((<@#@$$) a6989586621679190374 :: TyFun a Bool -> Type) (a6989586621679190375 :: a) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply ((<@#@$$) a6989586621679190374 :: TyFun a Bool -> Type) (a6989586621679190375 :: a) = a6989586621679190374 < a6989586621679190375

type family (a6989586621679190374 :: a) <@#@$$$ (a6989586621679190375 :: a) :: Bool where ... infix 4 Source #

Equations

a6989586621679190374 <@#@$$$ a6989586621679190375 = (<) a6989586621679190374 a6989586621679190375 

data (<=@#@$) :: (~>) a ((~>) a Bool) infix 4 Source #

Instances

Instances details
SOrd a => SingI ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

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

SuppressUnusedWarnings ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679190379 :: a) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679190379 :: a) = (<=@#@$$) a6989586621679190379

data (<=@#@$$) (a6989586621679190379 :: a) :: (~>) a Bool infix 4 Source #

Instances

Instances details
SOrd a => SingI1 ((<=@#@$$) :: a -> TyFun a Bool -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

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

(SOrd a, SingI d) => SingI ((<=@#@$$) d :: TyFun a Bool -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

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

SuppressUnusedWarnings ((<=@#@$$) a6989586621679190379 :: TyFun a Bool -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply ((<=@#@$$) a6989586621679190379 :: TyFun a Bool -> Type) (a6989586621679190380 :: a) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply ((<=@#@$$) a6989586621679190379 :: TyFun a Bool -> Type) (a6989586621679190380 :: a) = a6989586621679190379 <= a6989586621679190380

type family (a6989586621679190379 :: a) <=@#@$$$ (a6989586621679190380 :: a) :: Bool where ... infix 4 Source #

Equations

a6989586621679190379 <=@#@$$$ a6989586621679190380 = (<=) a6989586621679190379 a6989586621679190380 

data (>@#@$) :: (~>) a ((~>) a Bool) infix 4 Source #

Instances

Instances details
SOrd a => SingI ((>@#@$) :: TyFun a (a ~> Bool) -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

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

SuppressUnusedWarnings ((>@#@$) :: TyFun a (a ~> Bool) -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply ((>@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679190384 :: a) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply ((>@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679190384 :: a) = (>@#@$$) a6989586621679190384

data (>@#@$$) (a6989586621679190384 :: a) :: (~>) a Bool infix 4 Source #

Instances

Instances details
SOrd a => SingI1 ((>@#@$$) :: a -> TyFun a Bool -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

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

(SOrd a, SingI d) => SingI ((>@#@$$) d :: TyFun a Bool -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

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

SuppressUnusedWarnings ((>@#@$$) a6989586621679190384 :: TyFun a Bool -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply ((>@#@$$) a6989586621679190384 :: TyFun a Bool -> Type) (a6989586621679190385 :: a) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply ((>@#@$$) a6989586621679190384 :: TyFun a Bool -> Type) (a6989586621679190385 :: a) = a6989586621679190384 > a6989586621679190385

type family (a6989586621679190384 :: a) >@#@$$$ (a6989586621679190385 :: a) :: Bool where ... infix 4 Source #

Equations

a6989586621679190384 >@#@$$$ a6989586621679190385 = (>) a6989586621679190384 a6989586621679190385 

data (>=@#@$) :: (~>) a ((~>) a Bool) infix 4 Source #

Instances

Instances details
SOrd a => SingI ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

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

SuppressUnusedWarnings ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679190389 :: a) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679190389 :: a) = (>=@#@$$) a6989586621679190389

data (>=@#@$$) (a6989586621679190389 :: a) :: (~>) a Bool infix 4 Source #

Instances

Instances details
SOrd a => SingI1 ((>=@#@$$) :: a -> TyFun a Bool -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

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

(SOrd a, SingI d) => SingI ((>=@#@$$) d :: TyFun a Bool -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

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

SuppressUnusedWarnings ((>=@#@$$) a6989586621679190389 :: TyFun a Bool -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply ((>=@#@$$) a6989586621679190389 :: TyFun a Bool -> Type) (a6989586621679190390 :: a) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply ((>=@#@$$) a6989586621679190389 :: TyFun a Bool -> Type) (a6989586621679190390 :: a) = a6989586621679190389 >= a6989586621679190390

type family (a6989586621679190389 :: a) >=@#@$$$ (a6989586621679190390 :: a) :: Bool where ... infix 4 Source #

Equations

a6989586621679190389 >=@#@$$$ a6989586621679190390 = (>=) a6989586621679190389 a6989586621679190390 

data MaxSym0 :: (~>) a ((~>) a a) Source #

Instances

Instances details
SOrd a => SingI (MaxSym0 :: TyFun a (a ~> a) -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sing :: Sing MaxSym0 #

SuppressUnusedWarnings (MaxSym0 :: TyFun a (a ~> a) -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply (MaxSym0 :: TyFun a (a ~> a) -> Type) (a6989586621679190394 :: a) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply (MaxSym0 :: TyFun a (a ~> a) -> Type) (a6989586621679190394 :: a) = MaxSym1 a6989586621679190394

data MaxSym1 (a6989586621679190394 :: a) :: (~>) a a Source #

Instances

Instances details
SOrd a => SingI1 (MaxSym1 :: a -> TyFun a a -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (MaxSym1 x) #

(SOrd a, SingI d) => SingI (MaxSym1 d :: TyFun a a -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sing :: Sing (MaxSym1 d) #

SuppressUnusedWarnings (MaxSym1 a6989586621679190394 :: TyFun a a -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply (MaxSym1 a6989586621679190394 :: TyFun a a -> Type) (a6989586621679190395 :: a) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply (MaxSym1 a6989586621679190394 :: TyFun a a -> Type) (a6989586621679190395 :: a) = Max a6989586621679190394 a6989586621679190395

type family MaxSym2 (a6989586621679190394 :: a) (a6989586621679190395 :: a) :: a where ... Source #

Equations

MaxSym2 a6989586621679190394 a6989586621679190395 = Max a6989586621679190394 a6989586621679190395 

data MinSym0 :: (~>) a ((~>) a a) Source #

Instances

Instances details
SOrd a => SingI (MinSym0 :: TyFun a (a ~> a) -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sing :: Sing MinSym0 #

SuppressUnusedWarnings (MinSym0 :: TyFun a (a ~> a) -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply (MinSym0 :: TyFun a (a ~> a) -> Type) (a6989586621679190399 :: a) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply (MinSym0 :: TyFun a (a ~> a) -> Type) (a6989586621679190399 :: a) = MinSym1 a6989586621679190399

data MinSym1 (a6989586621679190399 :: a) :: (~>) a a Source #

Instances

Instances details
SOrd a => SingI1 (MinSym1 :: a -> TyFun a a -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (MinSym1 x) #

(SOrd a, SingI d) => SingI (MinSym1 d :: TyFun a a -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

Methods

sing :: Sing (MinSym1 d) #

SuppressUnusedWarnings (MinSym1 a6989586621679190399 :: TyFun a a -> Type) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply (MinSym1 a6989586621679190399 :: TyFun a a -> Type) (a6989586621679190400 :: a) Source # 
Instance details

Defined in Data.Ord.Singletons

type Apply (MinSym1 a6989586621679190399 :: TyFun a a -> Type) (a6989586621679190400 :: a) = Min a6989586621679190399 a6989586621679190400

type family MinSym2 (a6989586621679190399 :: a) (a6989586621679190400 :: a) :: a where ... Source #

Equations

MinSym2 a6989586621679190399 a6989586621679190400 = Min a6989586621679190399 a6989586621679190400 

data ToEnumSym0 :: (~>) Natural a Source #

Instances

Instances details
SEnum a => SingI (ToEnumSym0 :: TyFun Natural a -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Methods

sing :: Sing ToEnumSym0 #

SuppressUnusedWarnings (ToEnumSym0 :: TyFun Natural a -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

type Apply (ToEnumSym0 :: TyFun Natural k2 -> Type) (a6989586621679496118 :: Natural) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

type Apply (ToEnumSym0 :: TyFun Natural k2 -> Type) (a6989586621679496118 :: Natural) = ToEnum a6989586621679496118 :: k2

type family ToEnumSym1 (a6989586621679496118 :: Natural) :: a where ... Source #

Equations

ToEnumSym1 a6989586621679496118 = ToEnum a6989586621679496118 

data FromEnumSym0 :: (~>) a Natural Source #

Instances

Instances details
SEnum a => SingI (FromEnumSym0 :: TyFun a Natural -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

SuppressUnusedWarnings (FromEnumSym0 :: TyFun a Natural -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

type Apply (FromEnumSym0 :: TyFun a Natural -> Type) (a6989586621679496121 :: a) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

type Apply (FromEnumSym0 :: TyFun a Natural -> Type) (a6989586621679496121 :: a) = FromEnum a6989586621679496121

type family FromEnumSym1 (a6989586621679496121 :: a) :: Natural where ... Source #

Equations

FromEnumSym1 a6989586621679496121 = FromEnum a6989586621679496121 

data EnumFromToSym0 :: (~>) a ((~>) a [a]) Source #

Instances

Instances details
SEnum a => SingI (EnumFromToSym0 :: TyFun a (a ~> [a]) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

SuppressUnusedWarnings (EnumFromToSym0 :: TyFun a (a ~> [a]) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

type Apply (EnumFromToSym0 :: TyFun a (a ~> [a]) -> Type) (a6989586621679496125 :: a) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

type Apply (EnumFromToSym0 :: TyFun a (a ~> [a]) -> Type) (a6989586621679496125 :: a) = EnumFromToSym1 a6989586621679496125

data EnumFromToSym1 (a6989586621679496125 :: a) :: (~>) a [a] Source #

Instances

Instances details
SEnum a => SingI1 (EnumFromToSym1 :: a -> TyFun a [a] -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (EnumFromToSym1 x) #

(SEnum a, SingI d) => SingI (EnumFromToSym1 d :: TyFun a [a] -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Methods

sing :: Sing (EnumFromToSym1 d) #

SuppressUnusedWarnings (EnumFromToSym1 a6989586621679496125 :: TyFun a [a] -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

type Apply (EnumFromToSym1 a6989586621679496125 :: TyFun a [a] -> Type) (a6989586621679496126 :: a) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

type Apply (EnumFromToSym1 a6989586621679496125 :: TyFun a [a] -> Type) (a6989586621679496126 :: a) = EnumFromTo a6989586621679496125 a6989586621679496126

type family EnumFromToSym2 (a6989586621679496125 :: a) (a6989586621679496126 :: a) :: [a] where ... Source #

Equations

EnumFromToSym2 a6989586621679496125 a6989586621679496126 = EnumFromTo a6989586621679496125 a6989586621679496126 

data EnumFromThenToSym0 :: (~>) a ((~>) a ((~>) a [a])) Source #

Instances

Instances details
SEnum a => SingI (EnumFromThenToSym0 :: TyFun a (a ~> (a ~> [a])) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

SuppressUnusedWarnings (EnumFromThenToSym0 :: TyFun a (a ~> (a ~> [a])) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

type Apply (EnumFromThenToSym0 :: TyFun a (a ~> (a ~> [a])) -> Type) (a6989586621679496131 :: a) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

type Apply (EnumFromThenToSym0 :: TyFun a (a ~> (a ~> [a])) -> Type) (a6989586621679496131 :: a) = EnumFromThenToSym1 a6989586621679496131

data EnumFromThenToSym1 (a6989586621679496131 :: a) :: (~>) a ((~>) a [a]) Source #

Instances

Instances details
SEnum a => SingI1 (EnumFromThenToSym1 :: a -> TyFun a (a ~> [a]) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (EnumFromThenToSym1 x) #

(SEnum a, SingI d) => SingI (EnumFromThenToSym1 d :: TyFun a (a ~> [a]) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

SuppressUnusedWarnings (EnumFromThenToSym1 a6989586621679496131 :: TyFun a (a ~> [a]) -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

type Apply (EnumFromThenToSym1 a6989586621679496131 :: TyFun a (a ~> [a]) -> Type) (a6989586621679496132 :: a) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

type Apply (EnumFromThenToSym1 a6989586621679496131 :: TyFun a (a ~> [a]) -> Type) (a6989586621679496132 :: a) = EnumFromThenToSym2 a6989586621679496131 a6989586621679496132

data EnumFromThenToSym2 (a6989586621679496131 :: a) (a6989586621679496132 :: a) :: (~>) a [a] Source #

Instances

Instances details
SEnum a => SingI2 (EnumFromThenToSym2 :: a -> a -> TyFun a [a] -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Methods

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

(SEnum a, SingI d) => SingI1 (EnumFromThenToSym2 d :: a -> TyFun a [a] -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Methods

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

(SEnum a, SingI d1, SingI d2) => SingI (EnumFromThenToSym2 d1 d2 :: TyFun a [a] -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

Methods

sing :: Sing (EnumFromThenToSym2 d1 d2) #

SuppressUnusedWarnings (EnumFromThenToSym2 a6989586621679496131 a6989586621679496132 :: TyFun a [a] -> Type) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

type Apply (EnumFromThenToSym2 a6989586621679496131 a6989586621679496132 :: TyFun a [a] -> Type) (a6989586621679496133 :: a) Source # 
Instance details

Defined in Data.Singletons.Base.Enum

type Apply (EnumFromThenToSym2 a6989586621679496131 a6989586621679496132 :: TyFun a [a] -> Type) (a6989586621679496133 :: a) = EnumFromThenTo a6989586621679496131 a6989586621679496132 a6989586621679496133

type family EnumFromThenToSym3 (a6989586621679496131 :: a) (a6989586621679496132 :: a) (a6989586621679496133 :: a) :: [a] where ... Source #

Equations

EnumFromThenToSym3 a6989586621679496131 a6989586621679496132 a6989586621679496133 = EnumFromThenTo a6989586621679496131 a6989586621679496132 a6989586621679496133 

type family MinBoundSym0 :: a where ... Source #

Equations

MinBoundSym0 = MinBound 

type family MaxBoundSym0 :: a where ... Source #

Equations

MaxBoundSym0 = MaxBound 

Numbers

Numeric type classes

data (+@#@$) :: (~>) a ((~>) a a) infixl 6 Source #

Instances

Instances details
SNum a => SingI ((+@#@$) :: TyFun a (a ~> a) -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

Methods

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

SuppressUnusedWarnings ((+@#@$) :: TyFun a (a ~> a) -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply ((+@#@$) :: TyFun a (a ~> a) -> Type) (a6989586621679477080 :: a) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply ((+@#@$) :: TyFun a (a ~> a) -> Type) (a6989586621679477080 :: a) = (+@#@$$) a6989586621679477080

data (+@#@$$) (a6989586621679477080 :: a) :: (~>) a a infixl 6 Source #

Instances

Instances details
SNum a => SingI1 ((+@#@$$) :: a -> TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

Methods

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

(SNum a, SingI d) => SingI ((+@#@$$) d :: TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

Methods

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

SuppressUnusedWarnings ((+@#@$$) a6989586621679477080 :: TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply ((+@#@$$) a6989586621679477080 :: TyFun a a -> Type) (a6989586621679477081 :: a) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply ((+@#@$$) a6989586621679477080 :: TyFun a a -> Type) (a6989586621679477081 :: a) = a6989586621679477080 + a6989586621679477081

type family (a6989586621679477080 :: a) +@#@$$$ (a6989586621679477081 :: a) :: a where ... infixl 6 Source #

Equations

a6989586621679477080 +@#@$$$ a6989586621679477081 = (+) a6989586621679477080 a6989586621679477081 

data (-@#@$) :: (~>) a ((~>) a a) infixl 6 Source #

Instances

Instances details
SNum a => SingI ((-@#@$) :: TyFun a (a ~> a) -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

Methods

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

SuppressUnusedWarnings ((-@#@$) :: TyFun a (a ~> a) -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply ((-@#@$) :: TyFun a (a ~> a) -> Type) (a6989586621679477085 :: a) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply ((-@#@$) :: TyFun a (a ~> a) -> Type) (a6989586621679477085 :: a) = (-@#@$$) a6989586621679477085

data (-@#@$$) (a6989586621679477085 :: a) :: (~>) a a infixl 6 Source #

Instances

Instances details
SNum a => SingI1 ((-@#@$$) :: a -> TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

Methods

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

(SNum a, SingI d) => SingI ((-@#@$$) d :: TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

Methods

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

SuppressUnusedWarnings ((-@#@$$) a6989586621679477085 :: TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply ((-@#@$$) a6989586621679477085 :: TyFun a a -> Type) (a6989586621679477086 :: a) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply ((-@#@$$) a6989586621679477085 :: TyFun a a -> Type) (a6989586621679477086 :: a) = a6989586621679477085 - a6989586621679477086

type family (a6989586621679477085 :: a) -@#@$$$ (a6989586621679477086 :: a) :: a where ... infixl 6 Source #

Equations

a6989586621679477085 -@#@$$$ a6989586621679477086 = (-) a6989586621679477085 a6989586621679477086 

data (*@#@$) :: (~>) a ((~>) a a) infixl 7 Source #

Instances

Instances details
SNum a => SingI ((*@#@$) :: TyFun a (a ~> a) -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

Methods

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

SuppressUnusedWarnings ((*@#@$) :: TyFun a (a ~> a) -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply ((*@#@$) :: TyFun a (a ~> a) -> Type) (a6989586621679477090 :: a) Source # 
Instance details

Defined in GHC.Num.Singletons

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

data (*@#@$$) (a6989586621679477090 :: a) :: (~>) a a infixl 7 Source #

Instances

Instances details
SNum a => SingI1 ((*@#@$$) :: a -> TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

Methods

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

(SNum a, SingI d) => SingI ((*@#@$$) d :: TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

Methods

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

SuppressUnusedWarnings ((*@#@$$) a6989586621679477090 :: TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply ((*@#@$$) a6989586621679477090 :: TyFun a a -> Type) (a6989586621679477091 :: a) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply ((*@#@$$) a6989586621679477090 :: TyFun a a -> Type) (a6989586621679477091 :: a) = a6989586621679477090 * a6989586621679477091

type family (a6989586621679477090 :: a) *@#@$$$ (a6989586621679477091 :: a) :: a where ... infixl 7 Source #

Equations

a6989586621679477090 *@#@$$$ a6989586621679477091 = * a6989586621679477090 a6989586621679477091 

data NegateSym0 :: (~>) a a Source #

Instances

Instances details
SNum a => SingI (NegateSym0 :: TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

Methods

sing :: Sing NegateSym0 #

SuppressUnusedWarnings (NegateSym0 :: TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply (NegateSym0 :: TyFun a a -> Type) (a6989586621679477094 :: a) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply (NegateSym0 :: TyFun a a -> Type) (a6989586621679477094 :: a) = Negate a6989586621679477094

type family NegateSym1 (a6989586621679477094 :: a) :: a where ... Source #

Equations

NegateSym1 a6989586621679477094 = Negate a6989586621679477094 

data AbsSym0 :: (~>) a a Source #

Instances

Instances details
SNum a => SingI (AbsSym0 :: TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

Methods

sing :: Sing AbsSym0 #

SuppressUnusedWarnings (AbsSym0 :: TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply (AbsSym0 :: TyFun a a -> Type) (a6989586621679477097 :: a) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply (AbsSym0 :: TyFun a a -> Type) (a6989586621679477097 :: a) = Abs a6989586621679477097

type family AbsSym1 (a6989586621679477097 :: a) :: a where ... Source #

Equations

AbsSym1 a6989586621679477097 = Abs a6989586621679477097 

data SignumSym0 :: (~>) a a Source #

Instances

Instances details
SNum a => SingI (SignumSym0 :: TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

Methods

sing :: Sing SignumSym0 #

SuppressUnusedWarnings (SignumSym0 :: TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply (SignumSym0 :: TyFun a a -> Type) (a6989586621679477100 :: a) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply (SignumSym0 :: TyFun a a -> Type) (a6989586621679477100 :: a) = Signum a6989586621679477100

type family SignumSym1 (a6989586621679477100 :: a) :: a where ... Source #

Equations

SignumSym1 a6989586621679477100 = Signum a6989586621679477100 

data FromIntegerSym0 :: (~>) Natural a Source #

Instances

Instances details
SNum a => SingI (FromIntegerSym0 :: TyFun Natural a -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

SuppressUnusedWarnings (FromIntegerSym0 :: TyFun Natural a -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply (FromIntegerSym0 :: TyFun Natural k2 -> Type) (a6989586621679477103 :: Natural) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply (FromIntegerSym0 :: TyFun Natural k2 -> Type) (a6989586621679477103 :: Natural) = FromInteger a6989586621679477103 :: k2

type family FromIntegerSym1 (a6989586621679477103 :: Natural) :: a where ... Source #

Equations

FromIntegerSym1 a6989586621679477103 = FromInteger a6989586621679477103 

Numeric functions

data SubtractSym0 :: (~>) a ((~>) a a) Source #

Instances

Instances details
SNum a => SingI (SubtractSym0 :: TyFun a (a ~> a) -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

SuppressUnusedWarnings (SubtractSym0 :: TyFun a (a ~> a) -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply (SubtractSym0 :: TyFun a (a ~> a) -> Type) (a6989586621679477073 :: a) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply (SubtractSym0 :: TyFun a (a ~> a) -> Type) (a6989586621679477073 :: a) = SubtractSym1 a6989586621679477073

data SubtractSym1 (a6989586621679477073 :: a) :: (~>) a a Source #

Instances

Instances details
SNum a => SingI1 (SubtractSym1 :: a -> TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (SubtractSym1 x) #

(SNum a, SingI d) => SingI (SubtractSym1 d :: TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

Methods

sing :: Sing (SubtractSym1 d) #

SuppressUnusedWarnings (SubtractSym1 a6989586621679477073 :: TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply (SubtractSym1 a6989586621679477073 :: TyFun a a -> Type) (a6989586621679477074 :: a) Source # 
Instance details

Defined in GHC.Num.Singletons

type Apply (SubtractSym1 a6989586621679477073 :: TyFun a a -> Type) (a6989586621679477074 :: a) = Subtract a6989586621679477073 a6989586621679477074

type family SubtractSym2 (a6989586621679477073 :: a) (a6989586621679477074 :: a) :: a where ... Source #

Equations

SubtractSym2 a6989586621679477073 a6989586621679477074 = Subtract a6989586621679477073 a6989586621679477074 

Semigroups and Monoids

data (<>@#@$) :: (~>) a ((~>) a a) infixr 6 Source #

Instances

Instances details
SSemigroup a => SingI ((<>@#@$) :: TyFun a (a ~> a) -> Type) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Methods

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

SuppressUnusedWarnings ((<>@#@$) :: TyFun a (a ~> a) -> Type) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

type Apply ((<>@#@$) :: TyFun a (a ~> a) -> Type) (a6989586621679166895 :: a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

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

data (<>@#@$$) (a6989586621679166895 :: a) :: (~>) a a infixr 6 Source #

Instances

Instances details
SSemigroup a => SingI1 ((<>@#@$$) :: a -> TyFun a a -> Type) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Methods

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

(SSemigroup a, SingI d) => SingI ((<>@#@$$) d :: TyFun a a -> Type) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

Methods

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

SuppressUnusedWarnings ((<>@#@$$) a6989586621679166895 :: TyFun a a -> Type) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

type Apply ((<>@#@$$) a6989586621679166895 :: TyFun a a -> Type) (a6989586621679166896 :: a) Source # 
Instance details

Defined in Data.Semigroup.Singletons.Internal.Classes

type Apply ((<>@#@$$) a6989586621679166895 :: TyFun a a -> Type) (a6989586621679166896 :: a) = a6989586621679166895 <> a6989586621679166896

type family (a6989586621679166895 :: a) <>@#@$$$ (a6989586621679166896 :: a) :: a where ... infixr 6 Source #

Equations

a6989586621679166895 <>@#@$$$ a6989586621679166896 = (<>) a6989586621679166895 a6989586621679166896 

type family MemptySym0 :: a where ... Source #

Equations

MemptySym0 = Mempty 

data MappendSym0 :: (~>) a ((~>) a a) Source #

Instances

Instances details
SMonoid a => SingI (MappendSym0 :: TyFun a (a ~> a) -> Type) Source # 
Instance details

Defined in Data.Monoid.Singletons

SuppressUnusedWarnings (MappendSym0 :: TyFun a (a ~> a) -> Type) Source # 
Instance details

Defined in Data.Monoid.Singletons

type Apply (MappendSym0 :: TyFun a (a ~> a) -> Type) (a6989586621680031457 :: a) Source # 
Instance details

Defined in Data.Monoid.Singletons

type Apply (MappendSym0 :: TyFun a (a ~> a) -> Type) (a6989586621680031457 :: a) = MappendSym1 a6989586621680031457

data MappendSym1 (a6989586621680031457 :: a) :: (~>) a a Source #

Instances

Instances details
SMonoid a => SingI1 (MappendSym1 :: a -> TyFun a a -> Type) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (MappendSym1 x) #

(SMonoid a, SingI d) => SingI (MappendSym1 d :: TyFun a a -> Type) Source # 
Instance details

Defined in Data.Monoid.Singletons

Methods

sing :: Sing (MappendSym1 d) #

SuppressUnusedWarnings (MappendSym1 a6989586621680031457 :: TyFun a a -> Type) Source # 
Instance details

Defined in Data.Monoid.Singletons

type Apply (MappendSym1 a6989586621680031457 :: TyFun a a -> Type) (a6989586621680031458 :: a) Source # 
Instance details

Defined in Data.Monoid.Singletons

type Apply (MappendSym1 a6989586621680031457 :: TyFun a a -> Type) (a6989586621680031458 :: a) = Mappend a6989586621680031457 a6989586621680031458

type family MappendSym2 (a6989586621680031457 :: a) (a6989586621680031458 :: a) :: a where ... Source #

Equations

MappendSym2 a6989586621680031457 a6989586621680031458 = Mappend a6989586621680031457 a6989586621680031458 

data MconcatSym0 :: (~>) [a] a Source #

Instances

Instances details
SMonoid a => SingI (MconcatSym0 :: TyFun [a] a -> Type) Source # 
Instance details

Defined in Data.Monoid.Singletons

SuppressUnusedWarnings (MconcatSym0 :: TyFun [a] a -> Type) Source # 
Instance details

Defined in Data.Monoid.Singletons

type Apply (MconcatSym0 :: TyFun [a] a -> Type) (a6989586621680031461 :: [a]) Source # 
Instance details

Defined in Data.Monoid.Singletons

type Apply (MconcatSym0 :: TyFun [a] a -> Type) (a6989586621680031461 :: [a]) = Mconcat a6989586621680031461

type family MconcatSym1 (a6989586621680031461 :: [a]) :: a where ... Source #

Equations

MconcatSym1 a6989586621680031461 = Mconcat a6989586621680031461 

Monads and functors

data FmapSym0 :: (~>) ((~>) a b) ((~>) (f a) (f b)) Source #

Instances

Instances details
SFunctor f => SingI (FmapSym0 :: TyFun (a ~> b) (f a ~> f b) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing FmapSym0 #

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

Defined in Control.Monad.Singletons.Internal

type Apply (FmapSym0 :: TyFun (a ~> b) (f a ~> f b) -> Type) (a6989586621679276541 :: a ~> b) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply (FmapSym0 :: TyFun (a ~> b) (f a ~> f b) -> Type) (a6989586621679276541 :: a ~> b) = FmapSym1 a6989586621679276541 :: TyFun (f a) (f b) -> Type

data FmapSym1 (a6989586621679276541 :: (~>) a b) :: (~>) (f a) (f b) Source #

Instances

Instances details
SFunctor f => SingI1 (FmapSym1 :: (a ~> b) -> TyFun (f a) (f b) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (FmapSym1 x) #

(SFunctor f, SingI d) => SingI (FmapSym1 d :: TyFun (f a) (f b) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing (FmapSym1 d) #

SuppressUnusedWarnings (FmapSym1 a6989586621679276541 :: TyFun (f a) (f b) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply (FmapSym1 a6989586621679276541 :: TyFun (f a) (f b) -> Type) (a6989586621679276542 :: f a) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply (FmapSym1 a6989586621679276541 :: TyFun (f a) (f b) -> Type) (a6989586621679276542 :: f a) = Fmap a6989586621679276541 a6989586621679276542

type family FmapSym2 (a6989586621679276541 :: (~>) a b) (a6989586621679276542 :: f a) :: f b where ... Source #

Equations

FmapSym2 a6989586621679276541 a6989586621679276542 = Fmap a6989586621679276541 a6989586621679276542 

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

Instances

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

Defined in Control.Monad.Singletons.Internal

Methods

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

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

Defined in Control.Monad.Singletons.Internal

type Apply ((<$@#@$) :: TyFun a (f b ~> f a) -> Type) (a6989586621679276546 :: a) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

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

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

Instances

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

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) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

SuppressUnusedWarnings ((<$@#@$$) a6989586621679276546 :: TyFun (f b) (f a) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply ((<$@#@$$) a6989586621679276546 :: TyFun (f b) (f a) -> Type) (a6989586621679276547 :: f b) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

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

type family (a6989586621679276546 :: a) <$@#@$$$ (a6989586621679276547 :: f b) :: f a where ... infixl 4 Source #

Equations

a6989586621679276546 <$@#@$$$ a6989586621679276547 = (<$) a6989586621679276546 a6989586621679276547 

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

Instances

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

Defined in Data.Functor.Singletons

Methods

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

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

Defined in Data.Functor.Singletons

type Apply ((<$>@#@$) :: TyFun (a ~> b) (f a ~> f b) -> Type) (a6989586621679430465 :: a ~> b) Source # 
Instance details

Defined in Data.Functor.Singletons

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

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

Instances

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

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) Source # 
Instance details

Defined in Data.Functor.Singletons

Methods

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

SuppressUnusedWarnings ((<$>@#@$$) a6989586621679430465 :: TyFun (f a) (f b) -> Type) Source # 
Instance details

Defined in Data.Functor.Singletons

type Apply ((<$>@#@$$) a6989586621679430465 :: TyFun (f a) (f b) -> Type) (a6989586621679430466 :: f a) Source # 
Instance details

Defined in Data.Functor.Singletons

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

type family (a6989586621679430465 :: (~>) a b) <$>@#@$$$ (a6989586621679430466 :: f a) :: f b where ... infixl 4 Source #

Equations

a6989586621679430465 <$>@#@$$$ a6989586621679430466 = (<$>) a6989586621679430465 a6989586621679430466 

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

Instances

Instances details
SApplicative f => SingI (PureSym0 :: TyFun a (f a) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing PureSym0 #

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

Defined in Control.Monad.Singletons.Internal

type Apply (PureSym0 :: TyFun a (f a) -> Type) (a6989586621679276565 :: a) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

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

type family PureSym1 (a6989586621679276565 :: a) :: f a where ... Source #

Equations

PureSym1 a6989586621679276565 = Pure a6989586621679276565 

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

Instances

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

Defined in Control.Monad.Singletons.Internal

Methods

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

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

Defined in Control.Monad.Singletons.Internal

type Apply ((<*>@#@$) :: TyFun (f (a ~> b)) (f a ~> f b) -> Type) (a6989586621679276569 :: f (a ~> b)) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

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

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

Instances

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

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) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

SuppressUnusedWarnings ((<*>@#@$$) a6989586621679276569 :: TyFun (f a) (f b) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply ((<*>@#@$$) a6989586621679276569 :: TyFun (f a) (f b) -> Type) (a6989586621679276570 :: f a) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

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

type family (a6989586621679276569 :: f ((~>) a b)) <*>@#@$$$ (a6989586621679276570 :: f a) :: f b where ... infixl 4 Source #

Equations

a6989586621679276569 <*>@#@$$$ a6989586621679276570 = (<*>) a6989586621679276569 a6989586621679276570 

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

Instances

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

Defined in Control.Monad.Singletons.Internal

Methods

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

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

Defined in Control.Monad.Singletons.Internal

type Apply ((*>@#@$) :: TyFun (f a) (f b ~> f b) -> Type) (a6989586621679276581 :: f a) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

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

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

Instances

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

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) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

SuppressUnusedWarnings ((*>@#@$$) a6989586621679276581 :: TyFun (f b) (f b) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply ((*>@#@$$) a6989586621679276581 :: TyFun (f b) (f b) -> Type) (a6989586621679276582 :: f b) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

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

type family (a6989586621679276581 :: f a) *>@#@$$$ (a6989586621679276582 :: f b) :: f b where ... infixl 4 Source #

Equations

a6989586621679276581 *>@#@$$$ a6989586621679276582 = (*>) a6989586621679276581 a6989586621679276582 

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

Instances

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

Defined in Control.Monad.Singletons.Internal

Methods

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

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

Defined in Control.Monad.Singletons.Internal

type Apply ((<*@#@$) :: TyFun (f a) (f b ~> f a) -> Type) (a6989586621679276586 :: f a) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

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

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

Instances

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

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) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

SuppressUnusedWarnings ((<*@#@$$) a6989586621679276586 :: TyFun (f b) (f a) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply ((<*@#@$$) a6989586621679276586 :: TyFun (f b) (f a) -> Type) (a6989586621679276587 :: f b) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

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

type family (a6989586621679276586 :: f a) <*@#@$$$ (a6989586621679276587 :: f b) :: f a where ... infixl 4 Source #

Equations

a6989586621679276586 <*@#@$$$ a6989586621679276587 = (<*) a6989586621679276586 a6989586621679276587 

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

Instances

Instances details
SApplicative f => SingI (LiftA2Sym0 :: TyFun (a ~> (b ~> c)) (f a ~> (f b ~> f c)) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing LiftA2Sym0 #

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

Defined in Control.Monad.Singletons.Internal

type Apply (LiftA2Sym0 :: TyFun (a ~> (b ~> c)) (f a ~> (f b ~> f c)) -> Type) (a6989586621679276575 :: a ~> (b ~> c)) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

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

data LiftA2Sym1 (a6989586621679276575 :: (~>) a ((~>) b c)) :: (~>) (f a) ((~>) (f b) (f c)) Source #

Instances

Instances details
SApplicative f => SingI1 (LiftA2Sym1 :: (a ~> (b ~> c)) -> TyFun (f a) (f b ~> f c) -> Type) Source # 
Instance details

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) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing (LiftA2Sym1 d) #

SuppressUnusedWarnings (LiftA2Sym1 a6989586621679276575 :: TyFun (f a) (f b ~> f c) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply (LiftA2Sym1 a6989586621679276575 :: TyFun (f a) (f b ~> f c) -> Type) (a6989586621679276576 :: f a) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

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

data LiftA2Sym2 (a6989586621679276575 :: (~>) a ((~>) b c)) (a6989586621679276576 :: f a) :: (~>) (f b) (f c) Source #

Instances

Instances details
(SApplicative f, SingI d) => SingI1 (LiftA2Sym2 d :: f a -> TyFun (f b) (f c) -> Type) Source # 
Instance details

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) Source # 
Instance details

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) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing (LiftA2Sym2 d1 d2) #

SuppressUnusedWarnings (LiftA2Sym2 a6989586621679276575 a6989586621679276576 :: TyFun (f b) (f c) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply (LiftA2Sym2 a6989586621679276575 a6989586621679276576 :: TyFun (f b) (f c) -> Type) (a6989586621679276577 :: f b) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply (LiftA2Sym2 a6989586621679276575 a6989586621679276576 :: TyFun (f b) (f c) -> Type) (a6989586621679276577 :: f b) = LiftA2 a6989586621679276575 a6989586621679276576 a6989586621679276577

type family LiftA2Sym3 (a6989586621679276575 :: (~>) a ((~>) b c)) (a6989586621679276576 :: f a) (a6989586621679276577 :: f b) :: f c where ... Source #

Equations

LiftA2Sym3 a6989586621679276575 a6989586621679276576 a6989586621679276577 = LiftA2 a6989586621679276575 a6989586621679276576 a6989586621679276577 

data (>>=@#@$) :: (~>) (m a) ((~>) ((~>) a (m b)) (m b)) infixl 1 Source #

Instances

Instances details
SMonad m => SingI ((>>=@#@$) :: TyFun (m a) ((a ~> m b) ~> m b) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

SuppressUnusedWarnings ((>>=@#@$) :: TyFun (m a) ((a ~> m b) ~> m b) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply ((>>=@#@$) :: TyFun (m a) ((a ~> m b) ~> m b) -> Type) (a6989586621679276649 :: m a) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply ((>>=@#@$) :: TyFun (m a) ((a ~> m b) ~> m b) -> Type) (a6989586621679276649 :: m a) = (>>=@#@$$) a6989586621679276649 :: TyFun (a ~> m b) (m b) -> Type

data (>>=@#@$$) (a6989586621679276649 :: m a) :: (~>) ((~>) a (m b)) (m b) infixl 1 Source #

Instances

Instances details
SMonad m => SingI1 ((>>=@#@$$) :: m a -> TyFun (a ~> m b) (m b) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

(SMonad m, SingI d) => SingI ((>>=@#@$$) d :: TyFun (a ~> m b) (m b) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

SuppressUnusedWarnings ((>>=@#@$$) a6989586621679276649 :: TyFun (a ~> m b) (m b) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply ((>>=@#@$$) a6989586621679276649 :: TyFun (a ~> m b) (m b) -> Type) (a6989586621679276650 :: a ~> m b) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply ((>>=@#@$$) a6989586621679276649 :: TyFun (a ~> m b) (m b) -> Type) (a6989586621679276650 :: a ~> m b) = a6989586621679276649 >>= a6989586621679276650

type family (a6989586621679276649 :: m a) >>=@#@$$$ (a6989586621679276650 :: (~>) a (m b)) :: m b where ... infixl 1 Source #

Equations

a6989586621679276649 >>=@#@$$$ a6989586621679276650 = (>>=) a6989586621679276649 a6989586621679276650 

data (>>@#@$) :: (~>) (m a) ((~>) (m b) (m b)) infixl 1 Source #

Instances

Instances details
SMonad m => SingI ((>>@#@$) :: TyFun (m a) (m b ~> m b) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

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

Defined in Control.Monad.Singletons.Internal

type Apply ((>>@#@$) :: TyFun (m a) (m b ~> m b) -> Type) (a6989586621679276654 :: m a) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply ((>>@#@$) :: TyFun (m a) (m b ~> m b) -> Type) (a6989586621679276654 :: m a) = (>>@#@$$) a6989586621679276654 :: TyFun (m b) (m b) -> Type

data (>>@#@$$) (a6989586621679276654 :: m a) :: (~>) (m b) (m b) infixl 1 Source #

Instances

Instances details
SMonad m => SingI1 ((>>@#@$$) :: m a -> TyFun (m b) (m b) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

(SMonad m, SingI d) => SingI ((>>@#@$$) d :: TyFun (m b) (m b) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

SuppressUnusedWarnings ((>>@#@$$) a6989586621679276654 :: TyFun (m b) (m b) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply ((>>@#@$$) a6989586621679276654 :: TyFun (m b) (m b) -> Type) (a6989586621679276655 :: m b) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply ((>>@#@$$) a6989586621679276654 :: TyFun (m b) (m b) -> Type) (a6989586621679276655 :: m b) = a6989586621679276654 >> a6989586621679276655

type family (a6989586621679276654 :: m a) >>@#@$$$ (a6989586621679276655 :: m b) :: m b where ... infixl 1 Source #

Equations

a6989586621679276654 >>@#@$$$ a6989586621679276655 = (>>) a6989586621679276654 a6989586621679276655 

data ReturnSym0 :: (~>) a (m a) Source #

Instances

Instances details
SMonad m => SingI (ReturnSym0 :: TyFun a (m a) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

sing :: Sing ReturnSym0 #

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

Defined in Control.Monad.Singletons.Internal

type Apply (ReturnSym0 :: TyFun a (m a) -> Type) (a6989586621679276658 :: a) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply (ReturnSym0 :: TyFun a (m a) -> Type) (a6989586621679276658 :: a) = Return a6989586621679276658 :: m a

type family ReturnSym1 (a6989586621679276658 :: a) :: m a where ... Source #

Equations

ReturnSym1 a6989586621679276658 = Return a6989586621679276658 

data FailSym0 :: (~>) [Char] (m a) Source #

Instances

Instances details
SMonadFail m => SingI (FailSym0 :: TyFun [Char] (m a) -> Type) Source # 
Instance details

Defined in Control.Monad.Fail.Singletons

Methods

sing :: Sing FailSym0 #

SuppressUnusedWarnings (FailSym0 :: TyFun [Char] (m a) -> Type) Source # 
Instance details

Defined in Control.Monad.Fail.Singletons

type Apply (FailSym0 :: TyFun [Char] (m a) -> Type) (a6989586621679444078 :: [Char]) Source # 
Instance details

Defined in Control.Monad.Fail.Singletons

type Apply (FailSym0 :: TyFun [Char] (m a) -> Type) (a6989586621679444078 :: [Char]) = Fail a6989586621679444078 :: m a

type family FailSym1 (a6989586621679444078 :: [Char]) :: m a where ... Source #

Equations

FailSym1 a6989586621679444078 = Fail a6989586621679444078 

data MapM_Sym0 :: (~>) ((~>) a (m b)) ((~>) (t a) (m ())) Source #

Instances

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

Defined in Data.Foldable.Singletons

Methods

sing :: Sing MapM_Sym0 #

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

Defined in Data.Foldable.Singletons

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

Defined in Data.Foldable.Singletons

type Apply (MapM_Sym0 :: TyFun (a ~> m b) (t a ~> m ()) -> Type) (a6989586621680110487 :: a ~> m b) = MapM_Sym1 a6989586621680110487 :: TyFun (t a) (m ()) -> Type

data MapM_Sym1 (a6989586621680110487 :: (~>) a (m b)) :: (~>) (t a) (m ()) Source #

Instances

Instances details
(SFoldable t, SMonad m) => SingI1 (MapM_Sym1 :: (a ~> m b) -> TyFun (t a) (m ()) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (MapM_Sym1 x) #

(SFoldable t, SMonad m, SingI d) => SingI (MapM_Sym1 d :: TyFun (t a) (m ()) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing (MapM_Sym1 d) #

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

Defined in Data.Foldable.Singletons

type Apply (MapM_Sym1 a6989586621680110487 :: TyFun (t a) (m ()) -> Type) (a6989586621680110488 :: t a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (MapM_Sym1 a6989586621680110487 :: TyFun (t a) (m ()) -> Type) (a6989586621680110488 :: t a) = MapM_ a6989586621680110487 a6989586621680110488

type family MapM_Sym2 (a6989586621680110487 :: (~>) a (m b)) (a6989586621680110488 :: t a) :: m () where ... Source #

Equations

MapM_Sym2 a6989586621680110487 a6989586621680110488 = MapM_ a6989586621680110487 a6989586621680110488 

data Sequence_Sym0 :: (~>) (t (m a)) (m ()) Source #

Instances

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

Defined in Data.Foldable.Singletons

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

Defined in Data.Foldable.Singletons

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

Defined in Data.Foldable.Singletons

type Apply (Sequence_Sym0 :: TyFun (t (m a)) (m ()) -> Type) (a6989586621680110463 :: t (m a)) = Sequence_ a6989586621680110463

type family Sequence_Sym1 (a6989586621680110463 :: t (m a)) :: m () where ... Source #

Equations

Sequence_Sym1 a6989586621680110463 = Sequence_ a6989586621680110463 

data (=<<@#@$) :: (~>) ((~>) a (m b)) ((~>) (m a) (m b)) infixr 1 Source #

Instances

Instances details
SMonad m => SingI ((=<<@#@$) :: TyFun (a ~> m b) (m a ~> m b) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

SuppressUnusedWarnings ((=<<@#@$) :: TyFun (a ~> m b) (m a ~> m b) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply ((=<<@#@$) :: TyFun (a ~> m b) (m a ~> m b) -> Type) (a6989586621679276494 :: a ~> m b) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

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

data (=<<@#@$$) (a6989586621679276494 :: (~>) a (m b)) :: (~>) (m a) (m b) infixr 1 Source #

Instances

Instances details
SMonad m => SingI1 ((=<<@#@$$) :: (a ~> m b) -> TyFun (m a) (m b) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

(SMonad m, SingI d) => SingI ((=<<@#@$$) d :: TyFun (m a) (m b) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

Methods

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

SuppressUnusedWarnings ((=<<@#@$$) a6989586621679276494 :: TyFun (m a) (m b) -> Type) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply ((=<<@#@$$) a6989586621679276494 :: TyFun (m a) (m b) -> Type) (a6989586621679276495 :: m a) Source # 
Instance details

Defined in Control.Monad.Singletons.Internal

type Apply ((=<<@#@$$) a6989586621679276494 :: TyFun (m a) (m b) -> Type) (a6989586621679276495 :: m a) = a6989586621679276494 =<< a6989586621679276495

type family (a6989586621679276494 :: (~>) a (m b)) =<<@#@$$$ (a6989586621679276495 :: m a) :: m b where ... infixr 1 Source #

Equations

a6989586621679276494 =<<@#@$$$ a6989586621679276495 = (=<<) a6989586621679276494 a6989586621679276495 

Folds and traversals

data ElemSym0 :: (~>) a ((~>) (t a) Bool) Source #

Instances

Instances details
(SFoldable t, SEq a) => SingI (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing ElemSym0 #

SuppressUnusedWarnings (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680110605 :: a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680110605 :: a) = ElemSym1 a6989586621680110605 :: TyFun (t a) Bool -> Type

data ElemSym1 (a6989586621680110605 :: a) :: (~>) (t a) Bool Source #

Instances

Instances details
(SFoldable t, SEq a) => SingI1 (ElemSym1 :: a -> TyFun (t a) Bool -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ElemSym1 x) #

(SFoldable t, SEq a, SingI d) => SingI (ElemSym1 d :: TyFun (t a) Bool -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing (ElemSym1 d) #

SuppressUnusedWarnings (ElemSym1 a6989586621680110605 :: TyFun (t a) Bool -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (ElemSym1 a6989586621680110605 :: TyFun (t a) Bool -> Type) (a6989586621680110606 :: t a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (ElemSym1 a6989586621680110605 :: TyFun (t a) Bool -> Type) (a6989586621680110606 :: t a) = Elem a6989586621680110605 a6989586621680110606

type family ElemSym2 (a6989586621680110605 :: a) (a6989586621680110606 :: t a) :: Bool where ... Source #

Equations

ElemSym2 a6989586621680110605 a6989586621680110606 = Elem a6989586621680110605 a6989586621680110606 

data FoldMapSym0 :: (~>) ((~>) a m) ((~>) (t a) m) Source #

Instances

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

Defined in Data.Foldable.Singletons

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

Defined in Data.Foldable.Singletons

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

Defined in Data.Foldable.Singletons

type Apply (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) (a6989586621680110553 :: a ~> m) = FoldMapSym1 a6989586621680110553 :: TyFun (t a) m -> Type

data FoldMapSym1 (a6989586621680110553 :: (~>) a m) :: (~>) (t a) m Source #

Instances

Instances details
(SFoldable t, SMonoid m) => SingI1 (FoldMapSym1 :: (a ~> m) -> TyFun (t a) m -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (FoldMapSym1 x) #

(SFoldable t, SMonoid m, SingI d) => SingI (FoldMapSym1 d :: TyFun (t a) m -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing (FoldMapSym1 d) #

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

Defined in Data.Foldable.Singletons

type Apply (FoldMapSym1 a6989586621680110553 :: TyFun (t a) m -> Type) (a6989586621680110554 :: t a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (FoldMapSym1 a6989586621680110553 :: TyFun (t a) m -> Type) (a6989586621680110554 :: t a) = FoldMap a6989586621680110553 a6989586621680110554

type family FoldMapSym2 (a6989586621680110553 :: (~>) a m) (a6989586621680110554 :: t a) :: m where ... Source #

Equations

FoldMapSym2 a6989586621680110553 a6989586621680110554 = FoldMap a6989586621680110553 a6989586621680110554 

data FoldrSym0 :: (~>) ((~>) a ((~>) b b)) ((~>) b ((~>) (t a) b)) Source #

Instances

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

Defined in Data.Foldable.Singletons

Methods

sing :: Sing FoldrSym0 #

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

Defined in Data.Foldable.Singletons

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

Defined in Data.Foldable.Singletons

type Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680110559 :: a ~> (b ~> b)) = FoldrSym1 a6989586621680110559 :: TyFun b (t a ~> b) -> Type

data FoldrSym1 (a6989586621680110559 :: (~>) a ((~>) b b)) :: (~>) b ((~>) (t a) b) Source #

Instances

Instances details
SFoldable t => SingI1 (FoldrSym1 :: (a ~> (b ~> b)) -> TyFun b (t a ~> b) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (FoldrSym1 x) #

(SFoldable t, SingI d) => SingI (FoldrSym1 d :: TyFun b (t a ~> b) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing (FoldrSym1 d) #

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

Defined in Data.Foldable.Singletons

type Apply (FoldrSym1 a6989586621680110559 :: TyFun b (t a ~> b) -> Type) (a6989586621680110560 :: b) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (FoldrSym1 a6989586621680110559 :: TyFun b (t a ~> b) -> Type) (a6989586621680110560 :: b) = FoldrSym2 a6989586621680110559 a6989586621680110560 :: TyFun (t a) b -> Type

data FoldrSym2 (a6989586621680110559 :: (~>) a ((~>) b b)) (a6989586621680110560 :: b) :: (~>) (t a) b Source #

Instances

Instances details
(SFoldable t, SingI d) => SingI1 (FoldrSym2 d :: b -> TyFun (t a) b -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

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

SFoldable t => SingI2 (FoldrSym2 :: (a ~> (b ~> b)) -> b -> TyFun (t a) b -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

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

(SFoldable t, SingI d1, SingI d2) => SingI (FoldrSym2 d1 d2 :: TyFun (t a) b -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing (FoldrSym2 d1 d2) #

SuppressUnusedWarnings (FoldrSym2 a6989586621680110559 a6989586621680110560 :: TyFun (t a) b -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (FoldrSym2 a6989586621680110559 a6989586621680110560 :: TyFun (t a) b -> Type) (a6989586621680110561 :: t a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (FoldrSym2 a6989586621680110559 a6989586621680110560 :: TyFun (t a) b -> Type) (a6989586621680110561 :: t a) = Foldr a6989586621680110559 a6989586621680110560 a6989586621680110561

type family FoldrSym3 (a6989586621680110559 :: (~>) a ((~>) b b)) (a6989586621680110560 :: b) (a6989586621680110561 :: t a) :: b where ... Source #

Equations

FoldrSym3 a6989586621680110559 a6989586621680110560 a6989586621680110561 = Foldr a6989586621680110559 a6989586621680110560 a6989586621680110561 

data FoldlSym0 :: (~>) ((~>) b ((~>) a b)) ((~>) b ((~>) (t a) b)) Source #

Instances

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

Defined in Data.Foldable.Singletons

Methods

sing :: Sing FoldlSym0 #

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

Defined in Data.Foldable.Singletons

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

Defined in Data.Foldable.Singletons

type Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680110573 :: b ~> (a ~> b)) = FoldlSym1 a6989586621680110573 :: TyFun b (t a ~> b) -> Type

data FoldlSym1 (a6989586621680110573 :: (~>) b ((~>) a b)) :: (~>) b ((~>) (t a) b) Source #

Instances

Instances details
SFoldable t => SingI1 (FoldlSym1 :: (b ~> (a ~> b)) -> TyFun b (t a ~> b) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (FoldlSym1 x) #

(SFoldable t, SingI d) => SingI (FoldlSym1 d :: TyFun b (t a ~> b) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing (FoldlSym1 d) #

SuppressUnusedWarnings (FoldlSym1 a6989586621680110573 :: TyFun b (t a ~> b) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (FoldlSym1 a6989586621680110573 :: TyFun b (t a ~> b) -> Type) (a6989586621680110574 :: b) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (FoldlSym1 a6989586621680110573 :: TyFun b (t a ~> b) -> Type) (a6989586621680110574 :: b) = FoldlSym2 a6989586621680110573 a6989586621680110574 :: TyFun (t a) b -> Type

data FoldlSym2 (a6989586621680110573 :: (~>) b ((~>) a b)) (a6989586621680110574 :: b) :: (~>) (t a) b Source #

Instances

Instances details
(SFoldable t, SingI d) => SingI1 (FoldlSym2 d :: b -> TyFun (t a) b -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (FoldlSym2 d x) #

SFoldable t => SingI2 (FoldlSym2 :: (b ~> (a ~> b)) -> b -> TyFun (t a) b -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (FoldlSym2 x y) #

(SFoldable t, SingI d1, SingI d2) => SingI (FoldlSym2 d1 d2 :: TyFun (t a) b -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing (FoldlSym2 d1 d2) #

SuppressUnusedWarnings (FoldlSym2 a6989586621680110573 a6989586621680110574 :: TyFun (t a) b -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (FoldlSym2 a6989586621680110573 a6989586621680110574 :: TyFun (t a) b -> Type) (a6989586621680110575 :: t a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (FoldlSym2 a6989586621680110573 a6989586621680110574 :: TyFun (t a) b -> Type) (a6989586621680110575 :: t a) = Foldl a6989586621680110573 a6989586621680110574 a6989586621680110575

type family FoldlSym3 (a6989586621680110573 :: (~>) b ((~>) a b)) (a6989586621680110574 :: b) (a6989586621680110575 :: t a) :: b where ... Source #

Equations

FoldlSym3 a6989586621680110573 a6989586621680110574 a6989586621680110575 = Foldl a6989586621680110573 a6989586621680110574 a6989586621680110575 

data Foldr1Sym0 :: (~>) ((~>) a ((~>) a a)) ((~>) (t a) a) Source #

Instances

Instances details
SFoldable t => SingI (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing Foldr1Sym0 #

SuppressUnusedWarnings (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) (a6989586621680110586 :: a ~> (a ~> a)) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) (a6989586621680110586 :: a ~> (a ~> a)) = Foldr1Sym1 a6989586621680110586 :: TyFun (t a) a -> Type

data Foldr1Sym1 (a6989586621680110586 :: (~>) a ((~>) a a)) :: (~>) (t a) a Source #

Instances

Instances details
SFoldable t => SingI1 (Foldr1Sym1 :: (a ~> (a ~> a)) -> TyFun (t a) a -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Foldr1Sym1 x) #

(SFoldable t, SingI d) => SingI (Foldr1Sym1 d :: TyFun (t a) a -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing (Foldr1Sym1 d) #

SuppressUnusedWarnings (Foldr1Sym1 a6989586621680110586 :: TyFun (t a) a -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (Foldr1Sym1 a6989586621680110586 :: TyFun (t a) a -> Type) (a6989586621680110587 :: t a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (Foldr1Sym1 a6989586621680110586 :: TyFun (t a) a -> Type) (a6989586621680110587 :: t a) = Foldr1 a6989586621680110586 a6989586621680110587

type family Foldr1Sym2 (a6989586621680110586 :: (~>) a ((~>) a a)) (a6989586621680110587 :: t a) :: a where ... Source #

Equations

Foldr1Sym2 a6989586621680110586 a6989586621680110587 = Foldr1 a6989586621680110586 a6989586621680110587 

data Foldl1Sym0 :: (~>) ((~>) a ((~>) a a)) ((~>) (t a) a) Source #

Instances

Instances details
SFoldable t => SingI (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing Foldl1Sym0 #

SuppressUnusedWarnings (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) (a6989586621680110591 :: a ~> (a ~> a)) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) (a6989586621680110591 :: a ~> (a ~> a)) = Foldl1Sym1 a6989586621680110591 :: TyFun (t a) a -> Type

data Foldl1Sym1 (a6989586621680110591 :: (~>) a ((~>) a a)) :: (~>) (t a) a Source #

Instances

Instances details
SFoldable t => SingI1 (Foldl1Sym1 :: (a ~> (a ~> a)) -> TyFun (t a) a -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Foldl1Sym1 x) #

(SFoldable t, SingI d) => SingI (Foldl1Sym1 d :: TyFun (t a) a -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing (Foldl1Sym1 d) #

SuppressUnusedWarnings (Foldl1Sym1 a6989586621680110591 :: TyFun (t a) a -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (Foldl1Sym1 a6989586621680110591 :: TyFun (t a) a -> Type) (a6989586621680110592 :: t a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (Foldl1Sym1 a6989586621680110591 :: TyFun (t a) a -> Type) (a6989586621680110592 :: t a) = Foldl1 a6989586621680110591 a6989586621680110592

type family Foldl1Sym2 (a6989586621680110591 :: (~>) a ((~>) a a)) (a6989586621680110592 :: t a) :: a where ... Source #

Equations

Foldl1Sym2 a6989586621680110591 a6989586621680110592 = Foldl1 a6989586621680110591 a6989586621680110592 

data MaximumSym0 :: (~>) (t a) a Source #

Instances

Instances details
(SFoldable t, SOrd a) => SingI (MaximumSym0 :: TyFun (t a) a -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

SuppressUnusedWarnings (MaximumSym0 :: TyFun (t a) a -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (MaximumSym0 :: TyFun (t a) a -> Type) (a6989586621680110609 :: t a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (MaximumSym0 :: TyFun (t a) a -> Type) (a6989586621680110609 :: t a) = Maximum a6989586621680110609

type family MaximumSym1 (a6989586621680110609 :: t a) :: a where ... Source #

Equations

MaximumSym1 a6989586621680110609 = Maximum a6989586621680110609 

data MinimumSym0 :: (~>) (t a) a Source #

Instances

Instances details
(SFoldable t, SOrd a) => SingI (MinimumSym0 :: TyFun (t a) a -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

SuppressUnusedWarnings (MinimumSym0 :: TyFun (t a) a -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (MinimumSym0 :: TyFun (t a) a -> Type) (a6989586621680110612 :: t a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (MinimumSym0 :: TyFun (t a) a -> Type) (a6989586621680110612 :: t a) = Minimum a6989586621680110612

type family MinimumSym1 (a6989586621680110612 :: t a) :: a where ... Source #

Equations

MinimumSym1 a6989586621680110612 = Minimum a6989586621680110612 

data ProductSym0 :: (~>) (t a) a Source #

Instances

Instances details
(SFoldable t, SNum a) => SingI (ProductSym0 :: TyFun (t a) a -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

SuppressUnusedWarnings (ProductSym0 :: TyFun (t a) a -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (ProductSym0 :: TyFun (t a) a -> Type) (a6989586621680110618 :: t a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (ProductSym0 :: TyFun (t a) a -> Type) (a6989586621680110618 :: t a) = Product a6989586621680110618

type family ProductSym1 (a6989586621680110618 :: t a) :: a where ... Source #

Equations

ProductSym1 a6989586621680110618 = Product a6989586621680110618 

data SumSym0 :: (~>) (t a) a Source #

Instances

Instances details
(SFoldable t, SNum a) => SingI (SumSym0 :: TyFun (t a) a -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing SumSym0 #

SuppressUnusedWarnings (SumSym0 :: TyFun (t a) a -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (SumSym0 :: TyFun (t a) a -> Type) (a6989586621680110615 :: t a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (SumSym0 :: TyFun (t a) a -> Type) (a6989586621680110615 :: t a) = Sum a6989586621680110615

type family SumSym1 (a6989586621680110615 :: t a) :: a where ... Source #

Equations

SumSym1 a6989586621680110615 = Sum a6989586621680110615 

data TraverseSym0 :: (~>) ((~>) a (f b)) ((~>) (t a) (f (t b))) 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.Traversable.Singletons

SuppressUnusedWarnings (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) Source # 
Instance details

Defined in Data.Traversable.Singletons

type Apply (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) (a6989586621680379945 :: a ~> f b) Source # 
Instance details

Defined in Data.Traversable.Singletons

type Apply (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) (a6989586621680379945 :: a ~> f b) = TraverseSym1 a6989586621680379945 :: TyFun (t a) (f (t b)) -> Type

data TraverseSym1 (a6989586621680379945 :: (~>) a (f b)) :: (~>) (t a) (f (t b)) Source #

Instances

Instances details
(STraversable t, SApplicative f) => SingI1 (TraverseSym1 :: (a ~> f b) -> TyFun (t a) (f (t b)) -> Type) Source # 
Instance details

Defined in Data.Traversable.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (TraverseSym1 x) #

(STraversable t, SApplicative f, SingI d) => SingI (TraverseSym1 d :: TyFun (t a) (f (t b)) -> Type) Source # 
Instance details

Defined in Data.Traversable.Singletons

Methods

sing :: Sing (TraverseSym1 d) #

SuppressUnusedWarnings (TraverseSym1 a6989586621680379945 :: TyFun (t a) (f (t b)) -> Type) Source # 
Instance details

Defined in Data.Traversable.Singletons

type Apply (TraverseSym1 a6989586621680379945 :: TyFun (t a) (f (t b)) -> Type) (a6989586621680379946 :: t a) Source # 
Instance details

Defined in Data.Traversable.Singletons

type Apply (TraverseSym1 a6989586621680379945 :: TyFun (t a) (f (t b)) -> Type) (a6989586621680379946 :: t a) = Traverse a6989586621680379945 a6989586621680379946

type family TraverseSym2 (a6989586621680379945 :: (~>) a (f b)) (a6989586621680379946 :: t a) :: f (t b) where ... Source #

Equations

TraverseSym2 a6989586621680379945 a6989586621680379946 = Traverse a6989586621680379945 a6989586621680379946 

data SequenceASym0 :: (~>) (t (f a)) (f (t a)) Source #

Instances

Instances details
(STraversable t, SApplicative f) => SingI (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) Source # 
Instance details

Defined in Data.Traversable.Singletons

SuppressUnusedWarnings (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) Source # 
Instance details

Defined in Data.Traversable.Singletons

type Apply (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) (a6989586621680379949 :: t (f a)) Source # 
Instance details

Defined in Data.Traversable.Singletons

type Apply (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) (a6989586621680379949 :: t (f a)) = SequenceA a6989586621680379949

type family SequenceASym1 (a6989586621680379949 :: t (f a)) :: f (t a) where ... Source #

Equations

SequenceASym1 a6989586621680379949 = SequenceA a6989586621680379949 

data MapMSym0 :: (~>) ((~>) a (m b)) ((~>) (t a) (m (t b))) 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.Traversable.Singletons

Methods

sing :: Sing MapMSym0 #

SuppressUnusedWarnings (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) Source # 
Instance details

Defined in Data.Traversable.Singletons

type Apply (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) (a6989586621680379953 :: a ~> m b) Source # 
Instance details

Defined in Data.Traversable.Singletons

type Apply (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) (a6989586621680379953 :: a ~> m b) = MapMSym1 a6989586621680379953 :: TyFun (t a) (m (t b)) -> Type

data MapMSym1 (a6989586621680379953 :: (~>) a (m b)) :: (~>) (t a) (m (t b)) Source #

Instances

Instances details
(STraversable t, SMonad m) => SingI1 (MapMSym1 :: (a ~> m b) -> TyFun (t a) (m (t b)) -> Type) Source # 
Instance details

Defined in Data.Traversable.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (MapMSym1 x) #

(STraversable t, SMonad m, SingI d) => SingI (MapMSym1 d :: TyFun (t a) (m (t b)) -> Type) Source # 
Instance details

Defined in Data.Traversable.Singletons

Methods

sing :: Sing (MapMSym1 d) #

SuppressUnusedWarnings (MapMSym1 a6989586621680379953 :: TyFun (t a) (m (t b)) -> Type) Source # 
Instance details

Defined in Data.Traversable.Singletons

type Apply (MapMSym1 a6989586621680379953 :: TyFun (t a) (m (t b)) -> Type) (a6989586621680379954 :: t a) Source # 
Instance details

Defined in Data.Traversable.Singletons

type Apply (MapMSym1 a6989586621680379953 :: TyFun (t a) (m (t b)) -> Type) (a6989586621680379954 :: t a) = MapM a6989586621680379953 a6989586621680379954

type family MapMSym2 (a6989586621680379953 :: (~>) a (m b)) (a6989586621680379954 :: t a) :: m (t b) where ... Source #

Equations

MapMSym2 a6989586621680379953 a6989586621680379954 = MapM a6989586621680379953 a6989586621680379954 

data SequenceSym0 :: (~>) (t (m a)) (m (t a)) Source #

Instances

Instances details
(STraversable t, SMonad m) => SingI (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) Source # 
Instance details

Defined in Data.Traversable.Singletons

SuppressUnusedWarnings (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) Source # 
Instance details

Defined in Data.Traversable.Singletons

type Apply (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) (a6989586621680379957 :: t (m a)) Source # 
Instance details

Defined in Data.Traversable.Singletons

type Apply (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) (a6989586621680379957 :: t (m a)) = Sequence a6989586621680379957

type family SequenceSym1 (a6989586621680379957 :: t (m a)) :: m (t a) where ... Source #

Equations

SequenceSym1 a6989586621680379957 = Sequence a6989586621680379957 

Miscellaneous functions

data IdSym0 :: (~>) a a Source #

Instances

Instances details
SingI (IdSym0 :: TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing IdSym0 #

SuppressUnusedWarnings (IdSym0 :: TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (IdSym0 :: TyFun a a -> Type) (a6989586621679144192 :: a) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (IdSym0 :: TyFun a a -> Type) (a6989586621679144192 :: a) = Id a6989586621679144192

type family IdSym1 (a6989586621679144192 :: a) :: a where ... Source #

Equations

IdSym1 a6989586621679144192 = Id a6989586621679144192 

data ConstSym0 :: (~>) a ((~>) b a) Source #

Instances

Instances details
SingI (ConstSym0 :: TyFun a (b ~> a) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing ConstSym0 #

SuppressUnusedWarnings (ConstSym0 :: TyFun a (b ~> a) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (ConstSym0 :: TyFun a (b ~> a) -> Type) (a6989586621679144187 :: a) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (ConstSym0 :: TyFun a (b ~> a) -> Type) (a6989586621679144187 :: a) = ConstSym1 a6989586621679144187 :: TyFun b a -> Type

data ConstSym1 (a6989586621679144187 :: a) :: (~>) b a Source #

Instances

Instances details
SingI1 (ConstSym1 :: a -> TyFun b a -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ConstSym1 x) #

SingI d => SingI (ConstSym1 d :: TyFun b a -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing (ConstSym1 d) #

SuppressUnusedWarnings (ConstSym1 a6989586621679144187 :: TyFun b a -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (ConstSym1 a6989586621679144187 :: TyFun b a -> Type) (a6989586621679144188 :: b) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (ConstSym1 a6989586621679144187 :: TyFun b a -> Type) (a6989586621679144188 :: b) = Const a6989586621679144187 a6989586621679144188

type family ConstSym2 (a6989586621679144187 :: a) (a6989586621679144188 :: b) :: a where ... Source #

Equations

ConstSym2 a6989586621679144187 a6989586621679144188 = Const a6989586621679144187 a6989586621679144188 

data (.@#@$) :: (~>) ((~>) b c) ((~>) ((~>) a b) ((~>) a c)) infixr 9 Source #

Instances

Instances details
SingI ((.@#@$) :: TyFun (b ~> c) ((a ~> b) ~> (a ~> c)) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing (.@#@$) #

SuppressUnusedWarnings ((.@#@$) :: TyFun (b ~> c) ((a ~> b) ~> (a ~> c)) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply ((.@#@$) :: TyFun (b ~> c) ((a ~> b) ~> (a ~> c)) -> Type) (a6989586621679144174 :: b ~> c) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply ((.@#@$) :: TyFun (b ~> c) ((a ~> b) ~> (a ~> c)) -> Type) (a6989586621679144174 :: b ~> c) = (.@#@$$) a6989586621679144174 :: TyFun (a ~> b) (a ~> c) -> Type

data (.@#@$$) (a6989586621679144174 :: (~>) b c) :: (~>) ((~>) a b) ((~>) a c) infixr 9 Source #

Instances

Instances details
SingI1 ((.@#@$$) :: (b ~> c) -> TyFun (a ~> b) (a ~> c) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing ((.@#@$$) x) #

SingI d => SingI ((.@#@$$) d :: TyFun (a ~> b) (a ~> c) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing ((.@#@$$) d) #

SuppressUnusedWarnings ((.@#@$$) a6989586621679144174 :: TyFun (a ~> b) (a ~> c) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply ((.@#@$$) a6989586621679144174 :: TyFun (a ~> b) (a ~> c) -> Type) (a6989586621679144175 :: a ~> b) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply ((.@#@$$) a6989586621679144174 :: TyFun (a ~> b) (a ~> c) -> Type) (a6989586621679144175 :: a ~> b) = a6989586621679144174 .@#@$$$ a6989586621679144175

data (a6989586621679144174 :: (~>) b c) .@#@$$$ (a6989586621679144175 :: (~>) a b) :: (~>) a c infixr 9 Source #

Instances

Instances details
SingI2 ((.@#@$$$) :: (b ~> c) -> (a ~> b) -> TyFun a c -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (x .@#@$$$ y) #

SingI d => SingI1 ((.@#@$$$) d :: (a ~> b) -> TyFun a c -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (d .@#@$$$ x) #

(SingI d1, SingI d2) => SingI (d1 .@#@$$$ d2 :: TyFun a c -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing (d1 .@#@$$$ d2) #

SuppressUnusedWarnings (a6989586621679144174 .@#@$$$ a6989586621679144175 :: TyFun a c -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (a6989586621679144174 .@#@$$$ a6989586621679144175 :: TyFun a c -> Type) (a6989586621679144176 :: a) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (a6989586621679144174 .@#@$$$ a6989586621679144175 :: TyFun a c -> Type) (a6989586621679144176 :: a) = (a6989586621679144174 . a6989586621679144175) a6989586621679144176

type family ((a6989586621679144174 :: (~>) b c) .@#@$$$$ (a6989586621679144175 :: (~>) a b)) (a6989586621679144176 :: a) :: c where ... infixr 9 Source #

Equations

(a6989586621679144174 .@#@$$$$ a6989586621679144175) a6989586621679144176 = (.) a6989586621679144174 a6989586621679144175 a6989586621679144176 

data FlipSym0 :: (~>) ((~>) a ((~>) b c)) ((~>) b ((~>) a c)) Source #

Instances

Instances details
SingI (FlipSym0 :: TyFun (a ~> (b ~> c)) (b ~> (a ~> c)) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing FlipSym0 #

SuppressUnusedWarnings (FlipSym0 :: TyFun (a ~> (b ~> c)) (b ~> (a ~> c)) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (FlipSym0 :: TyFun (a ~> (b ~> c)) (b ~> (a ~> c)) -> Type) (a6989586621679144162 :: a ~> (b ~> c)) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (FlipSym0 :: TyFun (a ~> (b ~> c)) (b ~> (a ~> c)) -> Type) (a6989586621679144162 :: a ~> (b ~> c)) = FlipSym1 a6989586621679144162

data FlipSym1 (a6989586621679144162 :: (~>) a ((~>) b c)) :: (~>) b ((~>) a c) Source #

Instances

Instances details
SingI1 (FlipSym1 :: (a ~> (b ~> c)) -> TyFun b (a ~> c) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (FlipSym1 x) #

SingI d => SingI (FlipSym1 d :: TyFun b (a ~> c) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing (FlipSym1 d) #

SuppressUnusedWarnings (FlipSym1 a6989586621679144162 :: TyFun b (a ~> c) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (FlipSym1 a6989586621679144162 :: TyFun b (a ~> c) -> Type) (a6989586621679144163 :: b) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (FlipSym1 a6989586621679144162 :: TyFun b (a ~> c) -> Type) (a6989586621679144163 :: b) = FlipSym2 a6989586621679144162 a6989586621679144163

data FlipSym2 (a6989586621679144162 :: (~>) a ((~>) b c)) (a6989586621679144163 :: b) :: (~>) a c Source #

Instances

Instances details
SingI d => SingI1 (FlipSym2 d :: b -> TyFun a c -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (FlipSym2 d x) #

SingI2 (FlipSym2 :: (a ~> (b ~> c)) -> b -> TyFun a c -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (FlipSym2 x y) #

(SingI d1, SingI d2) => SingI (FlipSym2 d1 d2 :: TyFun a c -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing (FlipSym2 d1 d2) #

SuppressUnusedWarnings (FlipSym2 a6989586621679144162 a6989586621679144163 :: TyFun a c -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (FlipSym2 a6989586621679144162 a6989586621679144163 :: TyFun a c -> Type) (a6989586621679144164 :: a) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (FlipSym2 a6989586621679144162 a6989586621679144163 :: TyFun a c -> Type) (a6989586621679144164 :: a) = Flip a6989586621679144162 a6989586621679144163 a6989586621679144164

type family FlipSym3 (a6989586621679144162 :: (~>) a ((~>) b c)) (a6989586621679144163 :: b) (a6989586621679144164 :: a) :: c where ... Source #

Equations

FlipSym3 a6989586621679144162 a6989586621679144163 a6989586621679144164 = Flip a6989586621679144162 a6989586621679144163 a6989586621679144164 

data ($@#@$) :: (~>) ((~>) a b) ((~>) a b) infixr 0 Source #

Instances

Instances details
SingI (($@#@$) :: TyFun (a ~> b) (a ~> b) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing ($@#@$) #

SuppressUnusedWarnings (($@#@$) :: TyFun (a ~> b) (a ~> b) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (($@#@$) :: TyFun (a ~> b) (a ~> b) -> Type) (a6989586621679144143 :: a ~> b) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (($@#@$) :: TyFun (a ~> b) (a ~> b) -> Type) (a6989586621679144143 :: a ~> b) = ($@#@$$) a6989586621679144143

data ($@#@$$) (a6989586621679144143 :: (~>) a b) :: (~>) a b infixr 0 Source #

Instances

Instances details
SingI1 (($@#@$$) :: (a ~> b) -> TyFun a b -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (($@#@$$) x) #

SingI d => SingI (($@#@$$) d :: TyFun a b -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing (($@#@$$) d) #

SuppressUnusedWarnings (($@#@$$) a6989586621679144143 :: TyFun a b -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (($@#@$$) a6989586621679144143 :: TyFun a b -> Type) (a6989586621679144144 :: a) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (($@#@$$) a6989586621679144143 :: TyFun a b -> Type) (a6989586621679144144 :: a) = a6989586621679144143 $ a6989586621679144144

type family (a6989586621679144143 :: (~>) a b) $@#@$$$ (a6989586621679144144 :: a) :: b where ... infixr 0 Source #

Equations

a6989586621679144143 $@#@$$$ a6989586621679144144 = ($) a6989586621679144143 a6989586621679144144 

data UntilSym0 :: (~>) ((~>) a Bool) ((~>) ((~>) a a) ((~>) a a)) Source #

Instances

Instances details
SingI (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing UntilSym0 #

SuppressUnusedWarnings (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type) (a6989586621679144116 :: a ~> Bool) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type) (a6989586621679144116 :: a ~> Bool) = UntilSym1 a6989586621679144116

data UntilSym1 (a6989586621679144116 :: (~>) a Bool) :: (~>) ((~>) a a) ((~>) a a) Source #

Instances

Instances details
SingI d => SingI (UntilSym1 d :: TyFun (a ~> a) (a ~> a) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing (UntilSym1 d) #

SuppressUnusedWarnings (UntilSym1 a6989586621679144116 :: TyFun (a ~> a) (a ~> a) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

SingI1 (UntilSym1 :: (a ~> Bool) -> TyFun (a ~> a) (a ~> a) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (UntilSym1 x) #

type Apply (UntilSym1 a6989586621679144116 :: TyFun (a ~> a) (a ~> a) -> Type) (a6989586621679144117 :: a ~> a) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (UntilSym1 a6989586621679144116 :: TyFun (a ~> a) (a ~> a) -> Type) (a6989586621679144117 :: a ~> a) = UntilSym2 a6989586621679144116 a6989586621679144117

data UntilSym2 (a6989586621679144116 :: (~>) a Bool) (a6989586621679144117 :: (~>) a a) :: (~>) a a Source #

Instances

Instances details
SingI d => SingI1 (UntilSym2 d :: (a ~> a) -> TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (UntilSym2 d x) #

SingI2 (UntilSym2 :: (a ~> Bool) -> (a ~> a) -> TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (UntilSym2 x y) #

(SingI d1, SingI d2) => SingI (UntilSym2 d1 d2 :: TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing (UntilSym2 d1 d2) #

SuppressUnusedWarnings (UntilSym2 a6989586621679144116 a6989586621679144117 :: TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (UntilSym2 a6989586621679144116 a6989586621679144117 :: TyFun a a -> Type) (a6989586621679144118 :: a) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (UntilSym2 a6989586621679144116 a6989586621679144117 :: TyFun a a -> Type) (a6989586621679144118 :: a) = Until a6989586621679144116 a6989586621679144117 a6989586621679144118

type family UntilSym3 (a6989586621679144116 :: (~>) a Bool) (a6989586621679144117 :: (~>) a a) (a6989586621679144118 :: a) :: a where ... Source #

Equations

UntilSym3 a6989586621679144116 a6989586621679144117 a6989586621679144118 = Until a6989586621679144116 a6989586621679144117 a6989586621679144118 

data AsTypeOfSym0 :: (~>) a ((~>) a a) Source #

Instances

Instances details
SingI (AsTypeOfSym0 :: TyFun a (a ~> a) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

SuppressUnusedWarnings (AsTypeOfSym0 :: TyFun a (a ~> a) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (AsTypeOfSym0 :: TyFun a (a ~> a) -> Type) (a6989586621679144154 :: a) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (AsTypeOfSym0 :: TyFun a (a ~> a) -> Type) (a6989586621679144154 :: a) = AsTypeOfSym1 a6989586621679144154

data AsTypeOfSym1 (a6989586621679144154 :: a) :: (~>) a a Source #

Instances

Instances details
SingI1 (AsTypeOfSym1 :: a -> TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (AsTypeOfSym1 x) #

SingI d => SingI (AsTypeOfSym1 d :: TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing (AsTypeOfSym1 d) #

SuppressUnusedWarnings (AsTypeOfSym1 a6989586621679144154 :: TyFun a a -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (AsTypeOfSym1 a6989586621679144154 :: TyFun a a -> Type) (a6989586621679144155 :: a) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (AsTypeOfSym1 a6989586621679144154 :: TyFun a a -> Type) (a6989586621679144155 :: a) = AsTypeOf a6989586621679144154 a6989586621679144155

type family AsTypeOfSym2 (a6989586621679144154 :: a) (a6989586621679144155 :: a) :: a where ... Source #

Equations

AsTypeOfSym2 a6989586621679144154 a6989586621679144155 = AsTypeOf a6989586621679144154 a6989586621679144155 

data ErrorSym0 :: (~>) Symbol a Source #

Instances

Instances details
SingI (ErrorSym0 :: TyFun Symbol a -> Type) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

Methods

sing :: Sing ErrorSym0 #

SuppressUnusedWarnings (ErrorSym0 :: TyFun Symbol a -> Type) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type Apply (ErrorSym0 :: TyFun Symbol k2 -> Type) (a6989586621679450964 :: Symbol) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type Apply (ErrorSym0 :: TyFun Symbol k2 -> Type) (a6989586621679450964 :: Symbol) = Error a6989586621679450964 :: k2

type family ErrorSym1 (a6989586621679450964 :: Symbol) :: a where ... Source #

Equations

ErrorSym1 a6989586621679450964 = Error a6989586621679450964 

data ErrorWithoutStackTraceSym0 :: (~>) Symbol a Source #

Instances

Instances details
SingI (ErrorWithoutStackTraceSym0 :: TyFun Symbol a -> Type) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

SuppressUnusedWarnings (ErrorWithoutStackTraceSym0 :: TyFun Symbol a -> Type) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type Apply (ErrorWithoutStackTraceSym0 :: TyFun Symbol k2 -> Type) (a6989586621679451222 :: Symbol) Source # 
Instance details

Defined in GHC.TypeLits.Singletons.Internal

type Apply (ErrorWithoutStackTraceSym0 :: TyFun Symbol k2 -> Type) (a6989586621679451222 :: Symbol) = ErrorWithoutStackTrace a6989586621679451222 :: k2

type family ErrorWithoutStackTraceSym1 (a6989586621679451222 :: Symbol) :: a where ... Source #

Equations

ErrorWithoutStackTraceSym1 a6989586621679451222 = ErrorWithoutStackTrace a6989586621679451222 

type family UndefinedSym0 :: a where ... Source #

data SeqSym0 :: (~>) a ((~>) b b) infixr 0 Source #

Instances

Instances details
SingI (SeqSym0 :: TyFun a (b ~> b) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing SeqSym0 #

SuppressUnusedWarnings (SeqSym0 :: TyFun a (b ~> b) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (SeqSym0 :: TyFun a (b ~> b) -> Type) (a6989586621679144107 :: a) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (SeqSym0 :: TyFun a (b ~> b) -> Type) (a6989586621679144107 :: a) = SeqSym1 a6989586621679144107 :: TyFun b b -> Type

data SeqSym1 (a6989586621679144107 :: a) :: (~>) b b infixr 0 Source #

Instances

Instances details
SingI1 (SeqSym1 :: a -> TyFun b b -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (SeqSym1 x) #

SingI d => SingI (SeqSym1 d :: TyFun b b -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing (SeqSym1 d) #

SuppressUnusedWarnings (SeqSym1 a6989586621679144107 :: TyFun b b -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (SeqSym1 a6989586621679144107 :: TyFun b b -> Type) (a6989586621679144108 :: b) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (SeqSym1 a6989586621679144107 :: TyFun b b -> Type) (a6989586621679144108 :: b) = Seq a6989586621679144107 a6989586621679144108

type family SeqSym2 (a6989586621679144107 :: a) (a6989586621679144108 :: b) :: b where ... infixr 0 Source #

Equations

SeqSym2 a6989586621679144107 a6989586621679144108 = Seq a6989586621679144107 a6989586621679144108 

data ($!@#@$) :: (~>) ((~>) a b) ((~>) a b) infixr 0 Source #

Instances

Instances details
SingI (($!@#@$) :: TyFun (a ~> b) (a ~> b) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing ($!@#@$) #

SuppressUnusedWarnings (($!@#@$) :: TyFun (a ~> b) (a ~> b) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (($!@#@$) :: TyFun (a ~> b) (a ~> b) -> Type) (a6989586621679144134 :: a ~> b) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (($!@#@$) :: TyFun (a ~> b) (a ~> b) -> Type) (a6989586621679144134 :: a ~> b) = ($!@#@$$) a6989586621679144134

data ($!@#@$$) (a6989586621679144134 :: (~>) a b) :: (~>) a b infixr 0 Source #

Instances

Instances details
SingI1 (($!@#@$$) :: (a ~> b) -> TyFun a b -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (($!@#@$$) x) #

SingI d => SingI (($!@#@$$) d :: TyFun a b -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing (($!@#@$$) d) #

SuppressUnusedWarnings (($!@#@$$) a6989586621679144134 :: TyFun a b -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (($!@#@$$) a6989586621679144134 :: TyFun a b -> Type) (a6989586621679144135 :: a) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (($!@#@$$) a6989586621679144134 :: TyFun a b -> Type) (a6989586621679144135 :: a) = a6989586621679144134 $! a6989586621679144135

type family (a6989586621679144134 :: (~>) a b) $!@#@$$$ (a6989586621679144135 :: a) :: b where ... infixr 0 Source #

Equations

a6989586621679144134 $!@#@$$$ a6989586621679144135 = ($!) a6989586621679144134 a6989586621679144135 

List operations

data MapSym0 :: (~>) ((~>) a b) ((~>) [a] [b]) Source #

Instances

Instances details
SingI (MapSym0 :: TyFun (a ~> b) ([a] ~> [b]) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing MapSym0 #

SuppressUnusedWarnings (MapSym0 :: TyFun (a ~> b) ([a] ~> [b]) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (MapSym0 :: TyFun (a ~> b) ([a] ~> [b]) -> Type) (a6989586621679144206 :: a ~> b) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (MapSym0 :: TyFun (a ~> b) ([a] ~> [b]) -> Type) (a6989586621679144206 :: a ~> b) = MapSym1 a6989586621679144206

data MapSym1 (a6989586621679144206 :: (~>) a b) :: (~>) [a] [b] Source #

Instances

Instances details
SingI1 (MapSym1 :: (a ~> b) -> TyFun [a] [b] -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (MapSym1 x) #

SingI d => SingI (MapSym1 d :: TyFun [a] [b] -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing (MapSym1 d) #

SuppressUnusedWarnings (MapSym1 a6989586621679144206 :: TyFun [a] [b] -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (MapSym1 a6989586621679144206 :: TyFun [a] [b] -> Type) (a6989586621679144207 :: [a]) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply (MapSym1 a6989586621679144206 :: TyFun [a] [b] -> Type) (a6989586621679144207 :: [a]) = Map a6989586621679144206 a6989586621679144207

type family MapSym2 (a6989586621679144206 :: (~>) a b) (a6989586621679144207 :: [a]) :: [b] where ... Source #

Equations

MapSym2 a6989586621679144206 a6989586621679144207 = Map a6989586621679144206 a6989586621679144207 

data (++@#@$) :: (~>) [a] ((~>) [a] [a]) infixr 5 Source #

Instances

Instances details
SingI ((++@#@$) :: TyFun [a] ([a] ~> [a]) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing (++@#@$) #

SuppressUnusedWarnings ((++@#@$) :: TyFun [a] ([a] ~> [a]) -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply ((++@#@$) :: TyFun [a] ([a] ~> [a]) -> Type) (a6989586621679144197 :: [a]) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply ((++@#@$) :: TyFun [a] ([a] ~> [a]) -> Type) (a6989586621679144197 :: [a]) = (++@#@$$) a6989586621679144197

data (++@#@$$) (a6989586621679144197 :: [a]) :: (~>) [a] [a] infixr 5 Source #

Instances

Instances details
SingI1 ((++@#@$$) :: [a] -> TyFun [a] [a] -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing ((++@#@$$) x) #

SingI d => SingI ((++@#@$$) d :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

Methods

sing :: Sing ((++@#@$$) d) #

SuppressUnusedWarnings ((++@#@$$) a6989586621679144197 :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply ((++@#@$$) a6989586621679144197 :: TyFun [a] [a] -> Type) (a6989586621679144198 :: [a]) Source # 
Instance details

Defined in GHC.Base.Singletons

type Apply ((++@#@$$) a6989586621679144197 :: TyFun [a] [a] -> Type) (a6989586621679144198 :: [a]) = a6989586621679144197 ++ a6989586621679144198

type family (a6989586621679144197 :: [a]) ++@#@$$$ (a6989586621679144198 :: [a]) :: [a] where ... infixr 5 Source #

Equations

a6989586621679144197 ++@#@$$$ a6989586621679144198 = (++) a6989586621679144197 a6989586621679144198 

data FilterSym0 :: (~>) ((~>) a Bool) ((~>) [a] [a]) Source #

Instances

Instances details
SingI (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing FilterSym0 #

SuppressUnusedWarnings (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679653530 :: a ~> Bool) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679653530 :: a ~> Bool) = FilterSym1 a6989586621679653530

data FilterSym1 (a6989586621679653530 :: (~>) a Bool) :: (~>) [a] [a] Source #

Instances

Instances details
SingI d => SingI (FilterSym1 d :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (FilterSym1 d) #

SuppressUnusedWarnings (FilterSym1 a6989586621679653530 :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

SingI1 (FilterSym1 :: (a ~> Bool) -> TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (FilterSym1 x) #

type Apply (FilterSym1 a6989586621679653530 :: TyFun [a] [a] -> Type) (a6989586621679653531 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (FilterSym1 a6989586621679653530 :: TyFun [a] [a] -> Type) (a6989586621679653531 :: [a]) = Filter a6989586621679653530 a6989586621679653531

type family FilterSym2 (a6989586621679653530 :: (~>) a Bool) (a6989586621679653531 :: [a]) :: [a] where ... Source #

Equations

FilterSym2 a6989586621679653530 a6989586621679653531 = Filter a6989586621679653530 a6989586621679653531 

data HeadSym0 :: (~>) [a] a Source #

Instances

Instances details
SingI (HeadSym0 :: TyFun [a] a -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing HeadSym0 #

SuppressUnusedWarnings (HeadSym0 :: TyFun [a] a -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (HeadSym0 :: TyFun [a] a -> Type) (a6989586621679654300 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (HeadSym0 :: TyFun [a] a -> Type) (a6989586621679654300 :: [a]) = Head a6989586621679654300

type family HeadSym1 (a6989586621679654300 :: [a]) :: a where ... Source #

Equations

HeadSym1 a6989586621679654300 = Head a6989586621679654300 

data LastSym0 :: (~>) [a] a Source #

Instances

Instances details
SingI (LastSym0 :: TyFun [a] a -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing LastSym0 #

SuppressUnusedWarnings (LastSym0 :: TyFun [a] a -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (LastSym0 :: TyFun [a] a -> Type) (a6989586621679654294 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (LastSym0 :: TyFun [a] a -> Type) (a6989586621679654294 :: [a]) = Last a6989586621679654294

type family LastSym1 (a6989586621679654294 :: [a]) :: a where ... Source #

Equations

LastSym1 a6989586621679654294 = Last a6989586621679654294 

data TailSym0 :: (~>) [a] [a] Source #

Instances

Instances details
SingI (TailSym0 :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing TailSym0 #

SuppressUnusedWarnings (TailSym0 :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (TailSym0 :: TyFun [a] [a] -> Type) (a6989586621679654290 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (TailSym0 :: TyFun [a] [a] -> Type) (a6989586621679654290 :: [a]) = Tail a6989586621679654290

type family TailSym1 (a6989586621679654290 :: [a]) :: [a] where ... Source #

Equations

TailSym1 a6989586621679654290 = Tail a6989586621679654290 

data InitSym0 :: (~>) [a] [a] Source #

Instances

Instances details
SingI (InitSym0 :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing InitSym0 #

SuppressUnusedWarnings (InitSym0 :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (InitSym0 :: TyFun [a] [a] -> Type) (a6989586621679654278 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (InitSym0 :: TyFun [a] [a] -> Type) (a6989586621679654278 :: [a]) = Init a6989586621679654278

type family InitSym1 (a6989586621679654278 :: [a]) :: [a] where ... Source #

Equations

InitSym1 a6989586621679654278 = Init a6989586621679654278 

data (!!@#@$) :: (~>) [a] ((~>) Natural a) infixl 9 Source #

Instances

Instances details
SingI ((!!@#@$) :: TyFun [a] (Natural ~> a) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (!!@#@$) #

SuppressUnusedWarnings ((!!@#@$) :: TyFun [a] (Natural ~> a) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply ((!!@#@$) :: TyFun [a] (Natural ~> a) -> Type) (a6989586621679653138 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply ((!!@#@$) :: TyFun [a] (Natural ~> a) -> Type) (a6989586621679653138 :: [a]) = (!!@#@$$) a6989586621679653138

data (!!@#@$$) (a6989586621679653138 :: [a]) :: (~>) Natural a infixl 9 Source #

Instances

Instances details
SingI1 ((!!@#@$$) :: [a] -> TyFun Natural a -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing ((!!@#@$$) x) #

SingI d => SingI ((!!@#@$$) d :: TyFun Natural a -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing ((!!@#@$$) d) #

SuppressUnusedWarnings ((!!@#@$$) a6989586621679653138 :: TyFun Natural a -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply ((!!@#@$$) a6989586621679653138 :: TyFun Natural a -> Type) (a6989586621679653139 :: Natural) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply ((!!@#@$$) a6989586621679653138 :: TyFun Natural a -> Type) (a6989586621679653139 :: Natural) = a6989586621679653138 !! a6989586621679653139

type family (a6989586621679653138 :: [a]) !!@#@$$$ (a6989586621679653139 :: Natural) :: a where ... infixl 9 Source #

Equations

a6989586621679653138 !!@#@$$$ a6989586621679653139 = (!!) a6989586621679653138 a6989586621679653139 

data NullSym0 :: (~>) (t a) Bool Source #

Instances

Instances details
SFoldable t => SingI (NullSym0 :: TyFun (t a) Bool -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing NullSym0 #

SuppressUnusedWarnings (NullSym0 :: TyFun (t a) Bool -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (a6989586621680110598 :: t a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (a6989586621680110598 :: t a) = Null a6989586621680110598

type family NullSym1 (a6989586621680110598 :: t a) :: Bool where ... Source #

Equations

NullSym1 a6989586621680110598 = Null a6989586621680110598 

data LengthSym0 :: (~>) (t a) Natural Source #

Instances

Instances details
SFoldable t => SingI (LengthSym0 :: TyFun (t a) Natural -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing LengthSym0 #

SuppressUnusedWarnings (LengthSym0 :: TyFun (t a) Natural -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (LengthSym0 :: TyFun (t a) Natural -> Type) (a6989586621680110601 :: t a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (LengthSym0 :: TyFun (t a) Natural -> Type) (a6989586621680110601 :: t a) = Length a6989586621680110601

type family LengthSym1 (a6989586621680110601 :: t a) :: Natural where ... Source #

Equations

LengthSym1 a6989586621680110601 = Length a6989586621680110601 

data ReverseSym0 :: (~>) [a] [a] Source #

Instances

Instances details
SingI (ReverseSym0 :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

SuppressUnusedWarnings (ReverseSym0 :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ReverseSym0 :: TyFun [a] [a] -> Type) (a6989586621679654263 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ReverseSym0 :: TyFun [a] [a] -> Type) (a6989586621679654263 :: [a]) = Reverse a6989586621679654263

type family ReverseSym1 (a6989586621679654263 :: [a]) :: [a] where ... Source #

Equations

ReverseSym1 a6989586621679654263 = Reverse a6989586621679654263 

Special folds

data AndSym0 :: (~>) (t Bool) Bool Source #

Instances

Instances details
SFoldable t => SingI (AndSym0 :: TyFun (t Bool) Bool -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing AndSym0 #

SuppressUnusedWarnings (AndSym0 :: TyFun (t Bool) Bool -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680110424 :: t Bool) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680110424 :: t Bool) = And a6989586621680110424

type family AndSym1 (a6989586621680110424 :: t Bool) :: Bool where ... Source #

Equations

AndSym1 a6989586621680110424 = And a6989586621680110424 

data OrSym0 :: (~>) (t Bool) Bool Source #

Instances

Instances details
SFoldable t => SingI (OrSym0 :: TyFun (t Bool) Bool -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing OrSym0 #

SuppressUnusedWarnings (OrSym0 :: TyFun (t Bool) Bool -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680110418 :: t Bool) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680110418 :: t Bool) = Or a6989586621680110418

type family OrSym1 (a6989586621680110418 :: t Bool) :: Bool where ... Source #

Equations

OrSym1 a6989586621680110418 = Or a6989586621680110418 

data AnySym0 :: (~>) ((~>) a Bool) ((~>) (t a) Bool) Source #

Instances

Instances details
SFoldable t => SingI (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing AnySym0 #

SuppressUnusedWarnings (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680110410 :: a ~> Bool) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680110410 :: a ~> Bool) = AnySym1 a6989586621680110410 :: TyFun (t a) Bool -> Type

data AnySym1 (a6989586621680110410 :: (~>) a Bool) :: (~>) (t a) Bool Source #

Instances

Instances details
SFoldable t => SingI1 (AnySym1 :: (a ~> Bool) -> TyFun (t a) Bool -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (AnySym1 x) #

(SFoldable t, SingI d) => SingI (AnySym1 d :: TyFun (t a) Bool -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing (AnySym1 d) #

SuppressUnusedWarnings (AnySym1 a6989586621680110410 :: TyFun (t a) Bool -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (AnySym1 a6989586621680110410 :: TyFun (t a) Bool -> Type) (a6989586621680110411 :: t a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (AnySym1 a6989586621680110410 :: TyFun (t a) Bool -> Type) (a6989586621680110411 :: t a) = Any a6989586621680110410 a6989586621680110411

type family AnySym2 (a6989586621680110410 :: (~>) a Bool) (a6989586621680110411 :: t a) :: Bool where ... Source #

Equations

AnySym2 a6989586621680110410 a6989586621680110411 = Any a6989586621680110410 a6989586621680110411 

data AllSym0 :: (~>) ((~>) a Bool) ((~>) (t a) Bool) Source #

Instances

Instances details
SFoldable t => SingI (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing AllSym0 #

SuppressUnusedWarnings (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680110401 :: a ~> Bool) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680110401 :: a ~> Bool) = AllSym1 a6989586621680110401 :: TyFun (t a) Bool -> Type

data AllSym1 (a6989586621680110401 :: (~>) a Bool) :: (~>) (t a) Bool Source #

Instances

Instances details
SFoldable t => SingI1 (AllSym1 :: (a ~> Bool) -> TyFun (t a) Bool -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (AllSym1 x) #

(SFoldable t, SingI d) => SingI (AllSym1 d :: TyFun (t a) Bool -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing (AllSym1 d) #

SuppressUnusedWarnings (AllSym1 a6989586621680110401 :: TyFun (t a) Bool -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (AllSym1 a6989586621680110401 :: TyFun (t a) Bool -> Type) (a6989586621680110402 :: t a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (AllSym1 a6989586621680110401 :: TyFun (t a) Bool -> Type) (a6989586621680110402 :: t a) = All a6989586621680110401 a6989586621680110402

type family AllSym2 (a6989586621680110401 :: (~>) a Bool) (a6989586621680110402 :: t a) :: Bool where ... Source #

Equations

AllSym2 a6989586621680110401 a6989586621680110402 = All a6989586621680110401 a6989586621680110402 

data ConcatSym0 :: (~>) (t [a]) [a] Source #

Instances

Instances details
SFoldable t => SingI (ConcatSym0 :: TyFun (t [a]) [a] -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing ConcatSym0 #

SuppressUnusedWarnings (ConcatSym0 :: TyFun (t [a]) [a] -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (ConcatSym0 :: TyFun (t [a]) [a] -> Type) (a6989586621680110440 :: t [a]) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (ConcatSym0 :: TyFun (t [a]) [a] -> Type) (a6989586621680110440 :: t [a]) = Concat a6989586621680110440

type family ConcatSym1 (a6989586621680110440 :: t [a]) :: [a] where ... Source #

Equations

ConcatSym1 a6989586621680110440 = Concat a6989586621680110440 

data ConcatMapSym0 :: (~>) ((~>) a [b]) ((~>) (t a) [b]) Source #

Instances

Instances details
SFoldable t => SingI (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

SuppressUnusedWarnings (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) (a6989586621680110429 :: a ~> [b]) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) (a6989586621680110429 :: a ~> [b]) = ConcatMapSym1 a6989586621680110429 :: TyFun (t a) [b] -> Type

data ConcatMapSym1 (a6989586621680110429 :: (~>) a [b]) :: (~>) (t a) [b] Source #

Instances

Instances details
SFoldable t => SingI1 (ConcatMapSym1 :: (a ~> [b]) -> TyFun (t a) [b] -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ConcatMapSym1 x) #

(SFoldable t, SingI d) => SingI (ConcatMapSym1 d :: TyFun (t a) [b] -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing (ConcatMapSym1 d) #

SuppressUnusedWarnings (ConcatMapSym1 a6989586621680110429 :: TyFun (t a) [b] -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (ConcatMapSym1 a6989586621680110429 :: TyFun (t a) [b] -> Type) (a6989586621680110430 :: t a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (ConcatMapSym1 a6989586621680110429 :: TyFun (t a) [b] -> Type) (a6989586621680110430 :: t a) = ConcatMap a6989586621680110429 a6989586621680110430

type family ConcatMapSym2 (a6989586621680110429 :: (~>) a [b]) (a6989586621680110430 :: t a) :: [b] where ... Source #

Equations

ConcatMapSym2 a6989586621680110429 a6989586621680110430 = ConcatMap a6989586621680110429 a6989586621680110430 

Building lists

Scans

data ScanlSym0 :: (~>) ((~>) b ((~>) a b)) ((~>) b ((~>) [a] [b])) Source #

Instances

Instances details
SingI (ScanlSym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> [b])) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing ScanlSym0 #

SuppressUnusedWarnings (ScanlSym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> [b])) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ScanlSym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> [b])) -> Type) (a6989586621679654068 :: b ~> (a ~> b)) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ScanlSym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> [b])) -> Type) (a6989586621679654068 :: b ~> (a ~> b)) = ScanlSym1 a6989586621679654068

data ScanlSym1 (a6989586621679654068 :: (~>) b ((~>) a b)) :: (~>) b ((~>) [a] [b]) Source #

Instances

Instances details
SingI1 (ScanlSym1 :: (b ~> (a ~> b)) -> TyFun b ([a] ~> [b]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ScanlSym1 x) #

SingI d => SingI (ScanlSym1 d :: TyFun b ([a] ~> [b]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (ScanlSym1 d) #

SuppressUnusedWarnings (ScanlSym1 a6989586621679654068 :: TyFun b ([a] ~> [b]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ScanlSym1 a6989586621679654068 :: TyFun b ([a] ~> [b]) -> Type) (a6989586621679654069 :: b) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ScanlSym1 a6989586621679654068 :: TyFun b ([a] ~> [b]) -> Type) (a6989586621679654069 :: b) = ScanlSym2 a6989586621679654068 a6989586621679654069

data ScanlSym2 (a6989586621679654068 :: (~>) b ((~>) a b)) (a6989586621679654069 :: b) :: (~>) [a] [b] Source #

Instances

Instances details
SingI d => SingI1 (ScanlSym2 d :: b -> TyFun [a] [b] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ScanlSym2 d x) #

SingI2 (ScanlSym2 :: (b ~> (a ~> b)) -> b -> TyFun [a] [b] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (ScanlSym2 x y) #

(SingI d1, SingI d2) => SingI (ScanlSym2 d1 d2 :: TyFun [a] [b] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (ScanlSym2 d1 d2) #

SuppressUnusedWarnings (ScanlSym2 a6989586621679654068 a6989586621679654069 :: TyFun [a] [b] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ScanlSym2 a6989586621679654068 a6989586621679654069 :: TyFun [a] [b] -> Type) (a6989586621679654070 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ScanlSym2 a6989586621679654068 a6989586621679654069 :: TyFun [a] [b] -> Type) (a6989586621679654070 :: [a]) = Scanl a6989586621679654068 a6989586621679654069 a6989586621679654070

type family ScanlSym3 (a6989586621679654068 :: (~>) b ((~>) a b)) (a6989586621679654069 :: b) (a6989586621679654070 :: [a]) :: [b] where ... Source #

Equations

ScanlSym3 a6989586621679654068 a6989586621679654069 a6989586621679654070 = Scanl a6989586621679654068 a6989586621679654069 a6989586621679654070 

data Scanl1Sym0 :: (~>) ((~>) a ((~>) a a)) ((~>) [a] [a]) Source #

Instances

Instances details
SingI (Scanl1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing Scanl1Sym0 #

SuppressUnusedWarnings (Scanl1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (Scanl1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) (a6989586621679654059 :: a ~> (a ~> a)) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (Scanl1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) (a6989586621679654059 :: a ~> (a ~> a)) = Scanl1Sym1 a6989586621679654059

data Scanl1Sym1 (a6989586621679654059 :: (~>) a ((~>) a a)) :: (~>) [a] [a] Source #

Instances

Instances details
SingI d => SingI (Scanl1Sym1 d :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (Scanl1Sym1 d) #

SuppressUnusedWarnings (Scanl1Sym1 a6989586621679654059 :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

SingI1 (Scanl1Sym1 :: (a ~> (a ~> a)) -> TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Scanl1Sym1 x) #

type Apply (Scanl1Sym1 a6989586621679654059 :: TyFun [a] [a] -> Type) (a6989586621679654060 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (Scanl1Sym1 a6989586621679654059 :: TyFun [a] [a] -> Type) (a6989586621679654060 :: [a]) = Scanl1 a6989586621679654059 a6989586621679654060

type family Scanl1Sym2 (a6989586621679654059 :: (~>) a ((~>) a a)) (a6989586621679654060 :: [a]) :: [a] where ... Source #

Equations

Scanl1Sym2 a6989586621679654059 a6989586621679654060 = Scanl1 a6989586621679654059 a6989586621679654060 

data ScanrSym0 :: (~>) ((~>) a ((~>) b b)) ((~>) b ((~>) [a] [b])) Source #

Instances

Instances details
SingI (ScanrSym0 :: TyFun (a ~> (b ~> b)) (b ~> ([a] ~> [b])) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing ScanrSym0 #

SuppressUnusedWarnings (ScanrSym0 :: TyFun (a ~> (b ~> b)) (b ~> ([a] ~> [b])) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ScanrSym0 :: TyFun (a ~> (b ~> b)) (b ~> ([a] ~> [b])) -> Type) (a6989586621679654041 :: a ~> (b ~> b)) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ScanrSym0 :: TyFun (a ~> (b ~> b)) (b ~> ([a] ~> [b])) -> Type) (a6989586621679654041 :: a ~> (b ~> b)) = ScanrSym1 a6989586621679654041

data ScanrSym1 (a6989586621679654041 :: (~>) a ((~>) b b)) :: (~>) b ((~>) [a] [b]) Source #

Instances

Instances details
SingI1 (ScanrSym1 :: (a ~> (b ~> b)) -> TyFun b ([a] ~> [b]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ScanrSym1 x) #

SingI d => SingI (ScanrSym1 d :: TyFun b ([a] ~> [b]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (ScanrSym1 d) #

SuppressUnusedWarnings (ScanrSym1 a6989586621679654041 :: TyFun b ([a] ~> [b]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ScanrSym1 a6989586621679654041 :: TyFun b ([a] ~> [b]) -> Type) (a6989586621679654042 :: b) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ScanrSym1 a6989586621679654041 :: TyFun b ([a] ~> [b]) -> Type) (a6989586621679654042 :: b) = ScanrSym2 a6989586621679654041 a6989586621679654042

data ScanrSym2 (a6989586621679654041 :: (~>) a ((~>) b b)) (a6989586621679654042 :: b) :: (~>) [a] [b] Source #

Instances

Instances details
SingI d => SingI1 (ScanrSym2 d :: b -> TyFun [a] [b] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ScanrSym2 d x) #

SingI2 (ScanrSym2 :: (a ~> (b ~> b)) -> b -> TyFun [a] [b] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (ScanrSym2 x y) #

(SingI d1, SingI d2) => SingI (ScanrSym2 d1 d2 :: TyFun [a] [b] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (ScanrSym2 d1 d2) #

SuppressUnusedWarnings (ScanrSym2 a6989586621679654041 a6989586621679654042 :: TyFun [a] [b] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ScanrSym2 a6989586621679654041 a6989586621679654042 :: TyFun [a] [b] -> Type) (a6989586621679654043 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ScanrSym2 a6989586621679654041 a6989586621679654042 :: TyFun [a] [b] -> Type) (a6989586621679654043 :: [a]) = Scanr a6989586621679654041 a6989586621679654042 a6989586621679654043

type family ScanrSym3 (a6989586621679654041 :: (~>) a ((~>) b b)) (a6989586621679654042 :: b) (a6989586621679654043 :: [a]) :: [b] where ... Source #

Equations

ScanrSym3 a6989586621679654041 a6989586621679654042 a6989586621679654043 = Scanr a6989586621679654041 a6989586621679654042 a6989586621679654043 

data Scanr1Sym0 :: (~>) ((~>) a ((~>) a a)) ((~>) [a] [a]) Source #

Instances

Instances details
SingI (Scanr1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing Scanr1Sym0 #

SuppressUnusedWarnings (Scanr1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (Scanr1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) (a6989586621679654021 :: a ~> (a ~> a)) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (Scanr1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) (a6989586621679654021 :: a ~> (a ~> a)) = Scanr1Sym1 a6989586621679654021

data Scanr1Sym1 (a6989586621679654021 :: (~>) a ((~>) a a)) :: (~>) [a] [a] Source #

Instances

Instances details
SingI d => SingI (Scanr1Sym1 d :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (Scanr1Sym1 d) #

SuppressUnusedWarnings (Scanr1Sym1 a6989586621679654021 :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

SingI1 (Scanr1Sym1 :: (a ~> (a ~> a)) -> TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Scanr1Sym1 x) #

type Apply (Scanr1Sym1 a6989586621679654021 :: TyFun [a] [a] -> Type) (a6989586621679654022 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (Scanr1Sym1 a6989586621679654021 :: TyFun [a] [a] -> Type) (a6989586621679654022 :: [a]) = Scanr1 a6989586621679654021 a6989586621679654022

type family Scanr1Sym2 (a6989586621679654021 :: (~>) a ((~>) a a)) (a6989586621679654022 :: [a]) :: [a] where ... Source #

Equations

Scanr1Sym2 a6989586621679654021 a6989586621679654022 = Scanr1 a6989586621679654021 a6989586621679654022 

Infinite lists

data ReplicateSym0 :: (~>) Natural ((~>) a [a]) Source #

Instances

Instances details
SingI (ReplicateSym0 :: TyFun Natural (a ~> [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

SuppressUnusedWarnings (ReplicateSym0 :: TyFun Natural (a ~> [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ReplicateSym0 :: TyFun Natural (a ~> [a]) -> Type) (a6989586621679653158 :: Natural) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ReplicateSym0 :: TyFun Natural (a ~> [a]) -> Type) (a6989586621679653158 :: Natural) = ReplicateSym1 a6989586621679653158 :: TyFun a [a] -> Type

data ReplicateSym1 (a6989586621679653158 :: Natural) :: (~>) a [a] Source #

Instances

Instances details
SingI1 (ReplicateSym1 :: Natural -> TyFun a [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ReplicateSym1 x) #

SingI d => SingI (ReplicateSym1 d :: TyFun a [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (ReplicateSym1 d) #

SuppressUnusedWarnings (ReplicateSym1 a6989586621679653158 :: TyFun a [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ReplicateSym1 a6989586621679653158 :: TyFun a [a] -> Type) (a6989586621679653159 :: a) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ReplicateSym1 a6989586621679653158 :: TyFun a [a] -> Type) (a6989586621679653159 :: a) = Replicate a6989586621679653158 a6989586621679653159

type family ReplicateSym2 (a6989586621679653158 :: Natural) (a6989586621679653159 :: a) :: [a] where ... Source #

Equations

ReplicateSym2 a6989586621679653158 a6989586621679653159 = Replicate a6989586621679653158 a6989586621679653159 

Sublists

data TakeSym0 :: (~>) Natural ((~>) [a] [a]) Source #

Instances

Instances details
SingI (TakeSym0 :: TyFun Natural ([a] ~> [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing TakeSym0 #

SuppressUnusedWarnings (TakeSym0 :: TyFun Natural ([a] ~> [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (TakeSym0 :: TyFun Natural ([a] ~> [a]) -> Type) (a6989586621679653313 :: Natural) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (TakeSym0 :: TyFun Natural ([a] ~> [a]) -> Type) (a6989586621679653313 :: Natural) = TakeSym1 a6989586621679653313 :: TyFun [a] [a] -> Type

data TakeSym1 (a6989586621679653313 :: Natural) :: (~>) [a] [a] Source #

Instances

Instances details
SingI1 (TakeSym1 :: Natural -> TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (TakeSym1 x) #

SingI d => SingI (TakeSym1 d :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (TakeSym1 d) #

SuppressUnusedWarnings (TakeSym1 a6989586621679653313 :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (TakeSym1 a6989586621679653313 :: TyFun [a] [a] -> Type) (a6989586621679653314 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (TakeSym1 a6989586621679653313 :: TyFun [a] [a] -> Type) (a6989586621679653314 :: [a]) = Take a6989586621679653313 a6989586621679653314

type family TakeSym2 (a6989586621679653313 :: Natural) (a6989586621679653314 :: [a]) :: [a] where ... Source #

Equations

TakeSym2 a6989586621679653313 a6989586621679653314 = Take a6989586621679653313 a6989586621679653314 

data DropSym0 :: (~>) Natural ((~>) [a] [a]) Source #

Instances

Instances details
SingI (DropSym0 :: TyFun Natural ([a] ~> [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing DropSym0 #

SuppressUnusedWarnings (DropSym0 :: TyFun Natural ([a] ~> [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (DropSym0 :: TyFun Natural ([a] ~> [a]) -> Type) (a6989586621679653300 :: Natural) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (DropSym0 :: TyFun Natural ([a] ~> [a]) -> Type) (a6989586621679653300 :: Natural) = DropSym1 a6989586621679653300 :: TyFun [a] [a] -> Type

data DropSym1 (a6989586621679653300 :: Natural) :: (~>) [a] [a] Source #

Instances

Instances details
SingI1 (DropSym1 :: Natural -> TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (DropSym1 x) #

SingI d => SingI (DropSym1 d :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (DropSym1 d) #

SuppressUnusedWarnings (DropSym1 a6989586621679653300 :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (DropSym1 a6989586621679653300 :: TyFun [a] [a] -> Type) (a6989586621679653301 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (DropSym1 a6989586621679653300 :: TyFun [a] [a] -> Type) (a6989586621679653301 :: [a]) = Drop a6989586621679653300 a6989586621679653301

type family DropSym2 (a6989586621679653300 :: Natural) (a6989586621679653301 :: [a]) :: [a] where ... Source #

Equations

DropSym2 a6989586621679653300 a6989586621679653301 = Drop a6989586621679653300 a6989586621679653301 

data TakeWhileSym0 :: (~>) ((~>) a Bool) ((~>) [a] [a]) Source #

Instances

Instances details
SingI (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

SuppressUnusedWarnings (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679653430 :: a ~> Bool) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679653430 :: a ~> Bool) = TakeWhileSym1 a6989586621679653430

data TakeWhileSym1 (a6989586621679653430 :: (~>) a Bool) :: (~>) [a] [a] Source #

Instances

Instances details
SingI d => SingI (TakeWhileSym1 d :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (TakeWhileSym1 d) #

SuppressUnusedWarnings (TakeWhileSym1 a6989586621679653430 :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

SingI1 (TakeWhileSym1 :: (a ~> Bool) -> TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (TakeWhileSym1 x) #

type Apply (TakeWhileSym1 a6989586621679653430 :: TyFun [a] [a] -> Type) (a6989586621679653431 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (TakeWhileSym1 a6989586621679653430 :: TyFun [a] [a] -> Type) (a6989586621679653431 :: [a]) = TakeWhile a6989586621679653430 a6989586621679653431

type family TakeWhileSym2 (a6989586621679653430 :: (~>) a Bool) (a6989586621679653431 :: [a]) :: [a] where ... Source #

Equations

TakeWhileSym2 a6989586621679653430 a6989586621679653431 = TakeWhile a6989586621679653430 a6989586621679653431 

data DropWhileSym0 :: (~>) ((~>) a Bool) ((~>) [a] [a]) Source #

Instances

Instances details
SingI (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

SuppressUnusedWarnings (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679653415 :: a ~> Bool) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679653415 :: a ~> Bool) = DropWhileSym1 a6989586621679653415

data DropWhileSym1 (a6989586621679653415 :: (~>) a Bool) :: (~>) [a] [a] Source #

Instances

Instances details
SingI d => SingI (DropWhileSym1 d :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (DropWhileSym1 d) #

SuppressUnusedWarnings (DropWhileSym1 a6989586621679653415 :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

SingI1 (DropWhileSym1 :: (a ~> Bool) -> TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (DropWhileSym1 x) #

type Apply (DropWhileSym1 a6989586621679653415 :: TyFun [a] [a] -> Type) (a6989586621679653416 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (DropWhileSym1 a6989586621679653415 :: TyFun [a] [a] -> Type) (a6989586621679653416 :: [a]) = DropWhile a6989586621679653415 a6989586621679653416

type family DropWhileSym2 (a6989586621679653415 :: (~>) a Bool) (a6989586621679653416 :: [a]) :: [a] where ... Source #

Equations

DropWhileSym2 a6989586621679653415 a6989586621679653416 = DropWhile a6989586621679653415 a6989586621679653416 

data DropWhileEndSym0 :: (~>) ((~>) a Bool) ((~>) [a] [a]) Source #

Instances

Instances details
SingI (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

SuppressUnusedWarnings (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679653398 :: a ~> Bool) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679653398 :: a ~> Bool) = DropWhileEndSym1 a6989586621679653398

data DropWhileEndSym1 (a6989586621679653398 :: (~>) a Bool) :: (~>) [a] [a] Source #

Instances

Instances details
SingI d => SingI (DropWhileEndSym1 d :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (DropWhileEndSym1 d) #

SuppressUnusedWarnings (DropWhileEndSym1 a6989586621679653398 :: TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

SingI1 (DropWhileEndSym1 :: (a ~> Bool) -> TyFun [a] [a] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (DropWhileEndSym1 x) #

type Apply (DropWhileEndSym1 a6989586621679653398 :: TyFun [a] [a] -> Type) (a6989586621679653399 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (DropWhileEndSym1 a6989586621679653398 :: TyFun [a] [a] -> Type) (a6989586621679653399 :: [a]) = DropWhileEnd a6989586621679653398 a6989586621679653399

type family DropWhileEndSym2 (a6989586621679653398 :: (~>) a Bool) (a6989586621679653399 :: [a]) :: [a] where ... Source #

Equations

DropWhileEndSym2 a6989586621679653398 a6989586621679653399 = DropWhileEnd a6989586621679653398 a6989586621679653399 

data SpanSym0 :: (~>) ((~>) a Bool) ((~>) [a] ([a], [a])) Source #

Instances

Instances details
SingI (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing SpanSym0 #

SuppressUnusedWarnings (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621679653361 :: a ~> Bool) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621679653361 :: a ~> Bool) = SpanSym1 a6989586621679653361

data SpanSym1 (a6989586621679653361 :: (~>) a Bool) :: (~>) [a] ([a], [a]) Source #

Instances

Instances details
SingI d => SingI (SpanSym1 d :: TyFun [a] ([a], [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (SpanSym1 d) #

SuppressUnusedWarnings (SpanSym1 a6989586621679653361 :: TyFun [a] ([a], [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

SingI1 (SpanSym1 :: (a ~> Bool) -> TyFun [a] ([a], [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (SpanSym1 x) #

type Apply (SpanSym1 a6989586621679653361 :: TyFun [a] ([a], [a]) -> Type) (a6989586621679653362 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (SpanSym1 a6989586621679653361 :: TyFun [a] ([a], [a]) -> Type) (a6989586621679653362 :: [a]) = Span a6989586621679653361 a6989586621679653362

type family SpanSym2 (a6989586621679653361 :: (~>) a Bool) (a6989586621679653362 :: [a]) :: ([a], [a]) where ... Source #

Equations

SpanSym2 a6989586621679653361 a6989586621679653362 = Span a6989586621679653361 a6989586621679653362 

data BreakSym0 :: (~>) ((~>) a Bool) ((~>) [a] ([a], [a])) Source #

Instances

Instances details
SingI (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing BreakSym0 #

SuppressUnusedWarnings (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621679653326 :: a ~> Bool) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621679653326 :: a ~> Bool) = BreakSym1 a6989586621679653326

data BreakSym1 (a6989586621679653326 :: (~>) a Bool) :: (~>) [a] ([a], [a]) Source #

Instances

Instances details
SingI d => SingI (BreakSym1 d :: TyFun [a] ([a], [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (BreakSym1 d) #

SuppressUnusedWarnings (BreakSym1 a6989586621679653326 :: TyFun [a] ([a], [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

SingI1 (BreakSym1 :: (a ~> Bool) -> TyFun [a] ([a], [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (BreakSym1 x) #

type Apply (BreakSym1 a6989586621679653326 :: TyFun [a] ([a], [a]) -> Type) (a6989586621679653327 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (BreakSym1 a6989586621679653326 :: TyFun [a] ([a], [a]) -> Type) (a6989586621679653327 :: [a]) = Break a6989586621679653326 a6989586621679653327

type family BreakSym2 (a6989586621679653326 :: (~>) a Bool) (a6989586621679653327 :: [a]) :: ([a], [a]) where ... Source #

Equations

BreakSym2 a6989586621679653326 a6989586621679653327 = Break a6989586621679653326 a6989586621679653327 

data SplitAtSym0 :: (~>) Natural ((~>) [a] ([a], [a])) Source #

Instances

Instances details
SingI (SplitAtSym0 :: TyFun Natural ([a] ~> ([a], [a])) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

SuppressUnusedWarnings (SplitAtSym0 :: TyFun Natural ([a] ~> ([a], [a])) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (SplitAtSym0 :: TyFun Natural ([a] ~> ([a], [a])) -> Type) (a6989586621679653293 :: Natural) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (SplitAtSym0 :: TyFun Natural ([a] ~> ([a], [a])) -> Type) (a6989586621679653293 :: Natural) = SplitAtSym1 a6989586621679653293 :: TyFun [a] ([a], [a]) -> Type

data SplitAtSym1 (a6989586621679653293 :: Natural) :: (~>) [a] ([a], [a]) Source #

Instances

Instances details
SingI1 (SplitAtSym1 :: Natural -> TyFun [a] ([a], [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (SplitAtSym1 x) #

SingI d => SingI (SplitAtSym1 d :: TyFun [a] ([a], [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (SplitAtSym1 d) #

SuppressUnusedWarnings (SplitAtSym1 a6989586621679653293 :: TyFun [a] ([a], [a]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (SplitAtSym1 a6989586621679653293 :: TyFun [a] ([a], [a]) -> Type) (a6989586621679653294 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (SplitAtSym1 a6989586621679653293 :: TyFun [a] ([a], [a]) -> Type) (a6989586621679653294 :: [a]) = SplitAt a6989586621679653293 a6989586621679653294

type family SplitAtSym2 (a6989586621679653293 :: Natural) (a6989586621679653294 :: [a]) :: ([a], [a]) where ... Source #

Equations

SplitAtSym2 a6989586621679653293 a6989586621679653294 = SplitAt a6989586621679653293 a6989586621679653294 

Searching lists

data NotElemSym0 :: (~>) a ((~>) (t a) Bool) Source #

Instances

Instances details
(SFoldable t, SEq a) => SingI (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

SuppressUnusedWarnings (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680110352 :: a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680110352 :: a) = NotElemSym1 a6989586621680110352 :: TyFun (t a) Bool -> Type

data NotElemSym1 (a6989586621680110352 :: a) :: (~>) (t a) Bool Source #

Instances

Instances details
(SFoldable t, SEq a) => SingI1 (NotElemSym1 :: a -> TyFun (t a) Bool -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (NotElemSym1 x) #

(SFoldable t, SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun (t a) Bool -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

Methods

sing :: Sing (NotElemSym1 d) #

SuppressUnusedWarnings (NotElemSym1 a6989586621680110352 :: TyFun (t a) Bool -> Type) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (NotElemSym1 a6989586621680110352 :: TyFun (t a) Bool -> Type) (a6989586621680110353 :: t a) Source # 
Instance details

Defined in Data.Foldable.Singletons

type Apply (NotElemSym1 a6989586621680110352 :: TyFun (t a) Bool -> Type) (a6989586621680110353 :: t a) = NotElem a6989586621680110352 a6989586621680110353

type family NotElemSym2 (a6989586621680110352 :: a) (a6989586621680110353 :: t a) :: Bool where ... Source #

Equations

NotElemSym2 a6989586621680110352 a6989586621680110353 = NotElem a6989586621680110352 a6989586621680110353 

data LookupSym0 :: (~>) a ((~>) [(a, b)] (Maybe b)) Source #

Instances

Instances details
SEq a => SingI (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing LookupSym0 #

SuppressUnusedWarnings (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) (a6989586621679653221 :: a) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) (a6989586621679653221 :: a) = LookupSym1 a6989586621679653221 :: TyFun [(a, b)] (Maybe b) -> Type

data LookupSym1 (a6989586621679653221 :: a) :: (~>) [(a, b)] (Maybe b) Source #

Instances

Instances details
SEq a => SingI1 (LookupSym1 :: a -> TyFun [(a, b)] (Maybe b) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (LookupSym1 x) #

(SEq a, SingI d) => SingI (LookupSym1 d :: TyFun [(a, b)] (Maybe b) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (LookupSym1 d) #

SuppressUnusedWarnings (LookupSym1 a6989586621679653221 :: TyFun [(a, b)] (Maybe b) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (LookupSym1 a6989586621679653221 :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621679653222 :: [(a, b)]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (LookupSym1 a6989586621679653221 :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621679653222 :: [(a, b)]) = Lookup a6989586621679653221 a6989586621679653222

type family LookupSym2 (a6989586621679653221 :: a) (a6989586621679653222 :: [(a, b)]) :: Maybe b where ... Source #

Equations

LookupSym2 a6989586621679653221 a6989586621679653222 = Lookup a6989586621679653221 a6989586621679653222 

Zipping and unzipping lists

data ZipSym0 :: (~>) [a] ((~>) [b] [(a, b)]) Source #

Instances

Instances details
SingI (ZipSym0 :: TyFun [a] ([b] ~> [(a, b)]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing ZipSym0 #

SuppressUnusedWarnings (ZipSym0 :: TyFun [a] ([b] ~> [(a, b)]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ZipSym0 :: TyFun [a] ([b] ~> [(a, b)]) -> Type) (a6989586621679653848 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ZipSym0 :: TyFun [a] ([b] ~> [(a, b)]) -> Type) (a6989586621679653848 :: [a]) = ZipSym1 a6989586621679653848 :: TyFun [b] [(a, b)] -> Type

data ZipSym1 (a6989586621679653848 :: [a]) :: (~>) [b] [(a, b)] Source #

Instances

Instances details
SingI1 (ZipSym1 :: [a] -> TyFun [b] [(a, b)] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ZipSym1 x) #

SingI d => SingI (ZipSym1 d :: TyFun [b] [(a, b)] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (ZipSym1 d) #

SuppressUnusedWarnings (ZipSym1 a6989586621679653848 :: TyFun [b] [(a, b)] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ZipSym1 a6989586621679653848 :: TyFun [b] [(a, b)] -> Type) (a6989586621679653849 :: [b]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ZipSym1 a6989586621679653848 :: TyFun [b] [(a, b)] -> Type) (a6989586621679653849 :: [b]) = Zip a6989586621679653848 a6989586621679653849

type family ZipSym2 (a6989586621679653848 :: [a]) (a6989586621679653849 :: [b]) :: [(a, b)] where ... Source #

Equations

ZipSym2 a6989586621679653848 a6989586621679653849 = Zip a6989586621679653848 a6989586621679653849 

data Zip3Sym0 :: (~>) [a] ((~>) [b] ((~>) [c] [(a, b, c)])) Source #

Instances

Instances details
SingI (Zip3Sym0 :: TyFun [a] ([b] ~> ([c] ~> [(a, b, c)])) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing Zip3Sym0 #

SuppressUnusedWarnings (Zip3Sym0 :: TyFun [a] ([b] ~> ([c] ~> [(a, b, c)])) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (Zip3Sym0 :: TyFun [a] ([b] ~> ([c] ~> [(a, b, c)])) -> Type) (a6989586621679653836 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (Zip3Sym0 :: TyFun [a] ([b] ~> ([c] ~> [(a, b, c)])) -> Type) (a6989586621679653836 :: [a]) = Zip3Sym1 a6989586621679653836 :: TyFun [b] ([c] ~> [(a, b, c)]) -> Type

data Zip3Sym1 (a6989586621679653836 :: [a]) :: (~>) [b] ((~>) [c] [(a, b, c)]) Source #

Instances

Instances details
SingI1 (Zip3Sym1 :: [a] -> TyFun [b] ([c] ~> [(a, b, c)]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Zip3Sym1 x) #

SingI d => SingI (Zip3Sym1 d :: TyFun [b] ([c] ~> [(a, b, c)]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (Zip3Sym1 d) #

SuppressUnusedWarnings (Zip3Sym1 a6989586621679653836 :: TyFun [b] ([c] ~> [(a, b, c)]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (Zip3Sym1 a6989586621679653836 :: TyFun [b] ([c] ~> [(a, b, c)]) -> Type) (a6989586621679653837 :: [b]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (Zip3Sym1 a6989586621679653836 :: TyFun [b] ([c] ~> [(a, b, c)]) -> Type) (a6989586621679653837 :: [b]) = Zip3Sym2 a6989586621679653836 a6989586621679653837 :: TyFun [c] [(a, b, c)] -> Type

data Zip3Sym2 (a6989586621679653836 :: [a]) (a6989586621679653837 :: [b]) :: (~>) [c] [(a, b, c)] Source #

Instances

Instances details
SingI2 (Zip3Sym2 :: [a] -> [b] -> TyFun [c] [(a, b, c)] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (Zip3Sym2 x y) #

SingI d => SingI1 (Zip3Sym2 d :: [b] -> TyFun [c] [(a, b, c)] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (Zip3Sym2 d x) #

(SingI d1, SingI d2) => SingI (Zip3Sym2 d1 d2 :: TyFun [c] [(a, b, c)] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (Zip3Sym2 d1 d2) #

SuppressUnusedWarnings (Zip3Sym2 a6989586621679653836 a6989586621679653837 :: TyFun [c] [(a, b, c)] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (Zip3Sym2 a6989586621679653836 a6989586621679653837 :: TyFun [c] [(a, b, c)] -> Type) (a6989586621679653838 :: [c]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (Zip3Sym2 a6989586621679653836 a6989586621679653837 :: TyFun [c] [(a, b, c)] -> Type) (a6989586621679653838 :: [c]) = Zip3 a6989586621679653836 a6989586621679653837 a6989586621679653838

type family Zip3Sym3 (a6989586621679653836 :: [a]) (a6989586621679653837 :: [b]) (a6989586621679653838 :: [c]) :: [(a, b, c)] where ... Source #

Equations

Zip3Sym3 a6989586621679653836 a6989586621679653837 a6989586621679653838 = Zip3 a6989586621679653836 a6989586621679653837 a6989586621679653838 

data ZipWithSym0 :: (~>) ((~>) a ((~>) b c)) ((~>) [a] ((~>) [b] [c])) Source #

Instances

Instances details
SingI (ZipWithSym0 :: TyFun (a ~> (b ~> c)) ([a] ~> ([b] ~> [c])) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

SuppressUnusedWarnings (ZipWithSym0 :: TyFun (a ~> (b ~> c)) ([a] ~> ([b] ~> [c])) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ZipWithSym0 :: TyFun (a ~> (b ~> c)) ([a] ~> ([b] ~> [c])) -> Type) (a6989586621679653824 :: a ~> (b ~> c)) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ZipWithSym0 :: TyFun (a ~> (b ~> c)) ([a] ~> ([b] ~> [c])) -> Type) (a6989586621679653824 :: a ~> (b ~> c)) = ZipWithSym1 a6989586621679653824

data ZipWithSym1 (a6989586621679653824 :: (~>) a ((~>) b c)) :: (~>) [a] ((~>) [b] [c]) Source #

Instances

Instances details
SingI1 (ZipWithSym1 :: (a ~> (b ~> c)) -> TyFun [a] ([b] ~> [c]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ZipWithSym1 x) #

SingI d => SingI (ZipWithSym1 d :: TyFun [a] ([b] ~> [c]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (ZipWithSym1 d) #

SuppressUnusedWarnings (ZipWithSym1 a6989586621679653824 :: TyFun [a] ([b] ~> [c]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ZipWithSym1 a6989586621679653824 :: TyFun [a] ([b] ~> [c]) -> Type) (a6989586621679653825 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ZipWithSym1 a6989586621679653824 :: TyFun [a] ([b] ~> [c]) -> Type) (a6989586621679653825 :: [a]) = ZipWithSym2 a6989586621679653824 a6989586621679653825

data ZipWithSym2 (a6989586621679653824 :: (~>) a ((~>) b c)) (a6989586621679653825 :: [a]) :: (~>) [b] [c] Source #

Instances

Instances details
SingI d => SingI1 (ZipWithSym2 d :: [a] -> TyFun [b] [c] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ZipWithSym2 d x) #

SingI2 (ZipWithSym2 :: (a ~> (b ~> c)) -> [a] -> TyFun [b] [c] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (ZipWithSym2 x y) #

(SingI d1, SingI d2) => SingI (ZipWithSym2 d1 d2 :: TyFun [b] [c] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (ZipWithSym2 d1 d2) #

SuppressUnusedWarnings (ZipWithSym2 a6989586621679653824 a6989586621679653825 :: TyFun [b] [c] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ZipWithSym2 a6989586621679653824 a6989586621679653825 :: TyFun [b] [c] -> Type) (a6989586621679653826 :: [b]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ZipWithSym2 a6989586621679653824 a6989586621679653825 :: TyFun [b] [c] -> Type) (a6989586621679653826 :: [b]) = ZipWith a6989586621679653824 a6989586621679653825 a6989586621679653826

type family ZipWithSym3 (a6989586621679653824 :: (~>) a ((~>) b c)) (a6989586621679653825 :: [a]) (a6989586621679653826 :: [b]) :: [c] where ... Source #

Equations

ZipWithSym3 a6989586621679653824 a6989586621679653825 a6989586621679653826 = ZipWith a6989586621679653824 a6989586621679653825 a6989586621679653826 

data ZipWith3Sym0 :: (~>) ((~>) a ((~>) b ((~>) c d))) ((~>) [a] ((~>) [b] ((~>) [c] [d]))) Source #

Instances

Instances details
SingI (ZipWith3Sym0 :: TyFun (a ~> (b ~> (c ~> d))) ([a] ~> ([b] ~> ([c] ~> [d]))) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

SuppressUnusedWarnings (ZipWith3Sym0 :: TyFun (a ~> (b ~> (c ~> d))) ([a] ~> ([b] ~> ([c] ~> [d]))) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ZipWith3Sym0 :: TyFun (a ~> (b ~> (c ~> d))) ([a] ~> ([b] ~> ([c] ~> [d]))) -> Type) (a6989586621679653809 :: a ~> (b ~> (c ~> d))) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ZipWith3Sym0 :: TyFun (a ~> (b ~> (c ~> d))) ([a] ~> ([b] ~> ([c] ~> [d]))) -> Type) (a6989586621679653809 :: a ~> (b ~> (c ~> d))) = ZipWith3Sym1 a6989586621679653809

data ZipWith3Sym1 (a6989586621679653809 :: (~>) a ((~>) b ((~>) c d))) :: (~>) [a] ((~>) [b] ((~>) [c] [d])) Source #

Instances

Instances details
SingI1 (ZipWith3Sym1 :: (a ~> (b ~> (c ~> d))) -> TyFun [a] ([b] ~> ([c] ~> [d])) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ZipWith3Sym1 x) #

SingI d2 => SingI (ZipWith3Sym1 d2 :: TyFun [a] ([b] ~> ([c] ~> [d1])) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (ZipWith3Sym1 d2) #

SuppressUnusedWarnings (ZipWith3Sym1 a6989586621679653809 :: TyFun [a] ([b] ~> ([c] ~> [d])) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ZipWith3Sym1 a6989586621679653809 :: TyFun [a] ([b] ~> ([c] ~> [d])) -> Type) (a6989586621679653810 :: [a]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ZipWith3Sym1 a6989586621679653809 :: TyFun [a] ([b] ~> ([c] ~> [d])) -> Type) (a6989586621679653810 :: [a]) = ZipWith3Sym2 a6989586621679653809 a6989586621679653810

data ZipWith3Sym2 (a6989586621679653809 :: (~>) a ((~>) b ((~>) c d))) (a6989586621679653810 :: [a]) :: (~>) [b] ((~>) [c] [d]) Source #

Instances

Instances details
SingI d2 => SingI1 (ZipWith3Sym2 d2 :: [a] -> TyFun [b] ([c] ~> [d1]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ZipWith3Sym2 d2 x) #

SingI2 (ZipWith3Sym2 :: (a ~> (b ~> (c ~> d))) -> [a] -> TyFun [b] ([c] ~> [d]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (ZipWith3Sym2 x y) #

(SingI d2, SingI d3) => SingI (ZipWith3Sym2 d2 d3 :: TyFun [b] ([c] ~> [d1]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (ZipWith3Sym2 d2 d3) #

SuppressUnusedWarnings (ZipWith3Sym2 a6989586621679653809 a6989586621679653810 :: TyFun [b] ([c] ~> [d]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ZipWith3Sym2 a6989586621679653809 a6989586621679653810 :: TyFun [b] ([c] ~> [d]) -> Type) (a6989586621679653811 :: [b]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ZipWith3Sym2 a6989586621679653809 a6989586621679653810 :: TyFun [b] ([c] ~> [d]) -> Type) (a6989586621679653811 :: [b]) = ZipWith3Sym3 a6989586621679653809 a6989586621679653810 a6989586621679653811

data ZipWith3Sym3 (a6989586621679653809 :: (~>) a ((~>) b ((~>) c d))) (a6989586621679653810 :: [a]) (a6989586621679653811 :: [b]) :: (~>) [c] [d] Source #

Instances

Instances details
SingI d2 => SingI2 (ZipWith3Sym3 d2 :: [a] -> [b] -> TyFun [c] [d1] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (ZipWith3Sym3 d2 x y) #

(SingI d2, SingI d3) => SingI1 (ZipWith3Sym3 d2 d3 :: [b] -> TyFun [c] [d1] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ZipWith3Sym3 d2 d3 x) #

(SingI d2, SingI d3, SingI d4) => SingI (ZipWith3Sym3 d2 d3 d4 :: TyFun [c] [d1] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing (ZipWith3Sym3 d2 d3 d4) #

SuppressUnusedWarnings (ZipWith3Sym3 a6989586621679653809 a6989586621679653810 a6989586621679653811 :: TyFun [c] [d] -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ZipWith3Sym3 a6989586621679653809 a6989586621679653810 a6989586621679653811 :: TyFun [c] [d] -> Type) (a6989586621679653812 :: [c]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (ZipWith3Sym3 a6989586621679653809 a6989586621679653810 a6989586621679653811 :: TyFun [c] [d] -> Type) (a6989586621679653812 :: [c]) = ZipWith3 a6989586621679653809 a6989586621679653810 a6989586621679653811 a6989586621679653812

data UnzipSym0 :: (~>) [(a, b)] ([a], [b]) Source #

Instances

Instances details
SingI (UnzipSym0 :: TyFun [(a, b)] ([a], [b]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing UnzipSym0 #

SuppressUnusedWarnings (UnzipSym0 :: TyFun [(a, b)] ([a], [b]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (UnzipSym0 :: TyFun [(a, b)] ([a], [b]) -> Type) (a6989586621679653790 :: [(a, b)]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (UnzipSym0 :: TyFun [(a, b)] ([a], [b]) -> Type) (a6989586621679653790 :: [(a, b)]) = Unzip a6989586621679653790

type family UnzipSym1 (a6989586621679653790 :: [(a, b)]) :: ([a], [b]) where ... Source #

Equations

UnzipSym1 a6989586621679653790 = Unzip a6989586621679653790 

data Unzip3Sym0 :: (~>) [(a, b, c)] ([a], [b], [c]) Source #

Instances

Instances details
SingI (Unzip3Sym0 :: TyFun [(a, b, c)] ([a], [b], [c]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

Methods

sing :: Sing Unzip3Sym0 #

SuppressUnusedWarnings (Unzip3Sym0 :: TyFun [(a, b, c)] ([a], [b], [c]) -> Type) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (Unzip3Sym0 :: TyFun [(a, b, c)] ([a], [b], [c]) -> Type) (a6989586621679653772 :: [(a, b, c)]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply (Unzip3Sym0 :: TyFun [(a, b, c)] ([a], [b], [c]) -> Type) (a6989586621679653772 :: [(a, b, c)]) = Unzip3 a6989586621679653772

type family Unzip3Sym1 (a6989586621679653772 :: [(a, b, c)]) :: ([a], [b], [c]) where ... Source #

Equations

Unzip3Sym1 a6989586621679653772 = Unzip3 a6989586621679653772 

Functions on Symbols

data UnlinesSym0 :: (~>) [Symbol] Symbol Source #

Instances

Instances details
SingI UnlinesSym0 Source # 
Instance details

Defined in Data.List.Singletons.Internal

SuppressUnusedWarnings UnlinesSym0 Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply UnlinesSym0 (a6989586621679653675 :: [Symbol]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply UnlinesSym0 (a6989586621679653675 :: [Symbol]) = Unlines a6989586621679653675

type family UnlinesSym1 (a6989586621679653675 :: [Symbol]) :: Symbol where ... Source #

Equations

UnlinesSym1 a6989586621679653675 = Unlines a6989586621679653675 

data UnwordsSym0 :: (~>) [Symbol] Symbol Source #

Instances

Instances details
SingI UnwordsSym0 Source # 
Instance details

Defined in Data.List.Singletons.Internal

SuppressUnusedWarnings UnwordsSym0 Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply UnwordsSym0 (a6989586621679653665 :: [Symbol]) Source # 
Instance details

Defined in Data.List.Singletons.Internal

type Apply UnwordsSym0 (a6989586621679653665 :: [Symbol]) = Unwords a6989586621679653665

type family UnwordsSym1 (a6989586621679653665 :: [Symbol]) :: Symbol where ... Source #

Equations

UnwordsSym1 a6989586621679653665 = Unwords a6989586621679653665 

Converting to and from Symbol

Converting to Symbol

data ShowsPrecSym0 :: (~>) Natural ((~>) a ((~>) Symbol Symbol)) Source #

Instances

Instances details
SShow a => SingI (ShowsPrecSym0 :: TyFun Natural (a ~> (Symbol ~> Symbol)) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings (ShowsPrecSym0 :: TyFun Natural (a ~> (Symbol ~> Symbol)) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowsPrecSym0 :: TyFun Natural (a ~> (Symbol ~> Symbol)) -> Type) (a6989586621679965742 :: Natural) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowsPrecSym0 :: TyFun Natural (a ~> (Symbol ~> Symbol)) -> Type) (a6989586621679965742 :: Natural) = ShowsPrecSym1 a6989586621679965742 :: TyFun a (Symbol ~> Symbol) -> Type

data ShowsPrecSym1 (a6989586621679965742 :: Natural) :: (~>) a ((~>) Symbol Symbol) Source #

Instances

Instances details
SShow a => SingI1 (ShowsPrecSym1 :: Natural -> TyFun a (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ShowsPrecSym1 x) #

(SShow a, SingI d) => SingI (ShowsPrecSym1 d :: TyFun a (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing (ShowsPrecSym1 d) #

SuppressUnusedWarnings (ShowsPrecSym1 a6989586621679965742 :: TyFun a (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowsPrecSym1 a6989586621679965742 :: TyFun a (Symbol ~> Symbol) -> Type) (a6989586621679965743 :: a) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowsPrecSym1 a6989586621679965742 :: TyFun a (Symbol ~> Symbol) -> Type) (a6989586621679965743 :: a) = ShowsPrecSym2 a6989586621679965742 a6989586621679965743

data ShowsPrecSym2 (a6989586621679965742 :: Natural) (a6989586621679965743 :: a) :: (~>) Symbol Symbol Source #

Instances

Instances details
SShow a => SingI2 (ShowsPrecSym2 :: Natural -> a -> TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (ShowsPrecSym2 x y) #

(SShow a, SingI d) => SingI1 (ShowsPrecSym2 d :: a -> TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ShowsPrecSym2 d x) #

(SShow a, SingI d1, SingI d2) => SingI (ShowsPrecSym2 d1 d2 :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing (ShowsPrecSym2 d1 d2) #

SuppressUnusedWarnings (ShowsPrecSym2 a6989586621679965742 a6989586621679965743 :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowsPrecSym2 a6989586621679965742 a6989586621679965743 :: TyFun Symbol Symbol -> Type) (a6989586621679965744 :: Symbol) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowsPrecSym2 a6989586621679965742 a6989586621679965743 :: TyFun Symbol Symbol -> Type) (a6989586621679965744 :: Symbol) = ShowsPrec a6989586621679965742 a6989586621679965743 a6989586621679965744

type family ShowsPrecSym3 (a6989586621679965742 :: Natural) (a6989586621679965743 :: a) (a6989586621679965744 :: Symbol) :: Symbol where ... Source #

Equations

ShowsPrecSym3 a6989586621679965742 a6989586621679965743 a6989586621679965744 = ShowsPrec a6989586621679965742 a6989586621679965743 a6989586621679965744 

data ShowListSym0 :: (~>) [a] ((~>) Symbol Symbol) Source #

Instances

Instances details
SShow a => SingI (ShowListSym0 :: TyFun [a] (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings (ShowListSym0 :: TyFun [a] (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowListSym0 :: TyFun [a] (Symbol ~> Symbol) -> Type) (a6989586621679965751 :: [a]) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowListSym0 :: TyFun [a] (Symbol ~> Symbol) -> Type) (a6989586621679965751 :: [a]) = ShowListSym1 a6989586621679965751

data ShowListSym1 (a6989586621679965751 :: [a]) :: (~>) Symbol Symbol Source #

Instances

Instances details
SShow a => SingI1 (ShowListSym1 :: [a] -> TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ShowListSym1 x) #

(SShow a, SingI d) => SingI (ShowListSym1 d :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing (ShowListSym1 d) #

SuppressUnusedWarnings (ShowListSym1 a6989586621679965751 :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowListSym1 a6989586621679965751 :: TyFun Symbol Symbol -> Type) (a6989586621679965752 :: Symbol) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowListSym1 a6989586621679965751 :: TyFun Symbol Symbol -> Type) (a6989586621679965752 :: Symbol) = ShowList a6989586621679965751 a6989586621679965752

type family ShowListSym2 (a6989586621679965751 :: [a]) (a6989586621679965752 :: Symbol) :: Symbol where ... Source #

Equations

ShowListSym2 a6989586621679965751 a6989586621679965752 = ShowList a6989586621679965751 a6989586621679965752 

data Show_Sym0 :: (~>) a Symbol Source #

Instances

Instances details
SShow a => SingI (Show_Sym0 :: TyFun a Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing Show_Sym0 #

SuppressUnusedWarnings (Show_Sym0 :: TyFun a Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (Show_Sym0 :: TyFun a Symbol -> Type) (a6989586621679965747 :: a) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (Show_Sym0 :: TyFun a Symbol -> Type) (a6989586621679965747 :: a) = Show_ a6989586621679965747

type family Show_Sym1 (a6989586621679965747 :: a) :: Symbol where ... Source #

Equations

Show_Sym1 a6989586621679965747 = Show_ a6989586621679965747 

data ShowsSym0 :: (~>) a ((~>) Symbol Symbol) Source #

Instances

Instances details
SShow a => SingI (ShowsSym0 :: TyFun a (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing ShowsSym0 #

SuppressUnusedWarnings (ShowsSym0 :: TyFun a (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowsSym0 :: TyFun a (Symbol ~> Symbol) -> Type) (a6989586621679965734 :: a) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowsSym0 :: TyFun a (Symbol ~> Symbol) -> Type) (a6989586621679965734 :: a) = ShowsSym1 a6989586621679965734

data ShowsSym1 (a6989586621679965734 :: a) :: (~>) Symbol Symbol Source #

Instances

Instances details
SShow a => SingI1 (ShowsSym1 :: a -> TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ShowsSym1 x) #

(SShow a, SingI d) => SingI (ShowsSym1 d :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing (ShowsSym1 d) #

SuppressUnusedWarnings (ShowsSym1 a6989586621679965734 :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowsSym1 a6989586621679965734 :: TyFun Symbol Symbol -> Type) (a6989586621679965735 :: Symbol) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowsSym1 a6989586621679965734 :: TyFun Symbol Symbol -> Type) (a6989586621679965735 :: Symbol) = Shows a6989586621679965734 a6989586621679965735

type family ShowsSym2 (a6989586621679965734 :: a) (a6989586621679965735 :: Symbol) :: Symbol where ... Source #

Equations

ShowsSym2 a6989586621679965734 a6989586621679965735 = Shows a6989586621679965734 a6989586621679965735 

data ShowCharSym0 :: (~>) Char ((~>) Symbol Symbol) Source #

Instances

Instances details
SingI ShowCharSym0 Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings ShowCharSym0 Source # 
Instance details

Defined in Text.Show.Singletons

type Apply ShowCharSym0 (a6989586621679965708 :: Char) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply ShowCharSym0 (a6989586621679965708 :: Char) = ShowCharSym1 a6989586621679965708

data ShowCharSym1 (a6989586621679965708 :: Char) :: (~>) Symbol Symbol Source #

Instances

Instances details
SingI1 ShowCharSym1 Source # 
Instance details

Defined in Text.Show.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ShowCharSym1 x) #

SingI d => SingI (ShowCharSym1 d :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing (ShowCharSym1 d) #

SuppressUnusedWarnings (ShowCharSym1 a6989586621679965708 :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowCharSym1 a6989586621679965708 :: TyFun Symbol Symbol -> Type) (a6989586621679965709 :: Symbol) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowCharSym1 a6989586621679965708 :: TyFun Symbol Symbol -> Type) (a6989586621679965709 :: Symbol) = ShowChar a6989586621679965708 a6989586621679965709

type family ShowCharSym2 (a6989586621679965708 :: Char) (a6989586621679965709 :: Symbol) :: Symbol where ... Source #

Equations

ShowCharSym2 a6989586621679965708 a6989586621679965709 = ShowChar a6989586621679965708 a6989586621679965709 

data ShowStringSym0 :: (~>) Symbol ((~>) Symbol Symbol) Source #

Instances

Instances details
SingI ShowStringSym0 Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings ShowStringSym0 Source # 
Instance details

Defined in Text.Show.Singletons

type Apply ShowStringSym0 (a6989586621679965697 :: Symbol) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply ShowStringSym0 (a6989586621679965697 :: Symbol) = ShowStringSym1 a6989586621679965697

data ShowStringSym1 (a6989586621679965697 :: Symbol) :: (~>) Symbol Symbol Source #

Instances

Instances details
SingI1 ShowStringSym1 Source # 
Instance details

Defined in Text.Show.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ShowStringSym1 x) #

SingI d => SingI (ShowStringSym1 d :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing (ShowStringSym1 d) #

SuppressUnusedWarnings (ShowStringSym1 a6989586621679965697 :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowStringSym1 a6989586621679965697 :: TyFun Symbol Symbol -> Type) (a6989586621679965698 :: Symbol) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowStringSym1 a6989586621679965697 :: TyFun Symbol Symbol -> Type) (a6989586621679965698 :: Symbol) = ShowString a6989586621679965697 a6989586621679965698

type family ShowStringSym2 (a6989586621679965697 :: Symbol) (a6989586621679965698 :: Symbol) :: Symbol where ... Source #

Equations

ShowStringSym2 a6989586621679965697 a6989586621679965698 = ShowString a6989586621679965697 a6989586621679965698 

data ShowParenSym0 :: (~>) Bool ((~>) ((~>) Symbol Symbol) ((~>) Symbol Symbol)) Source #

Instances

Instances details
SingI ShowParenSym0 Source # 
Instance details

Defined in Text.Show.Singletons

SuppressUnusedWarnings ShowParenSym0 Source # 
Instance details

Defined in Text.Show.Singletons

type Apply ShowParenSym0 (a6989586621679965681 :: Bool) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply ShowParenSym0 (a6989586621679965681 :: Bool) = ShowParenSym1 a6989586621679965681

data ShowParenSym1 (a6989586621679965681 :: Bool) :: (~>) ((~>) Symbol Symbol) ((~>) Symbol Symbol) Source #

Instances

Instances details
SingI1 ShowParenSym1 Source # 
Instance details

Defined in Text.Show.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ShowParenSym1 x) #

SingI d => SingI (ShowParenSym1 d :: TyFun (Symbol ~> Symbol) (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing (ShowParenSym1 d) #

SuppressUnusedWarnings (ShowParenSym1 a6989586621679965681 :: TyFun (Symbol ~> Symbol) (Symbol ~> Symbol) -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowParenSym1 a6989586621679965681 :: TyFun (Symbol ~> Symbol) (Symbol ~> Symbol) -> Type) (a6989586621679965682 :: Symbol ~> Symbol) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowParenSym1 a6989586621679965681 :: TyFun (Symbol ~> Symbol) (Symbol ~> Symbol) -> Type) (a6989586621679965682 :: Symbol ~> Symbol) = ShowParenSym2 a6989586621679965681 a6989586621679965682

data ShowParenSym2 (a6989586621679965681 :: Bool) (a6989586621679965682 :: (~>) Symbol Symbol) :: (~>) Symbol Symbol Source #

Instances

Instances details
SingI2 ShowParenSym2 Source # 
Instance details

Defined in Text.Show.Singletons

Methods

liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing (ShowParenSym2 x y) #

(SingI d1, SingI d2) => SingI (ShowParenSym2 d1 d2 :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

sing :: Sing (ShowParenSym2 d1 d2) #

SuppressUnusedWarnings (ShowParenSym2 a6989586621679965681 a6989586621679965682 :: TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

SingI d => SingI1 (ShowParenSym2 d :: (Symbol ~> Symbol) -> TyFun Symbol Symbol -> Type) Source # 
Instance details

Defined in Text.Show.Singletons

Methods

liftSing :: forall (x :: k1). Sing x -> Sing (ShowParenSym2 d x) #

type Apply (ShowParenSym2 a6989586621679965681 a6989586621679965682 :: TyFun Symbol Symbol -> Type) (a6989586621679965683 :: Symbol) Source # 
Instance details

Defined in Text.Show.Singletons

type Apply (ShowParenSym2 a6989586621679965681 a6989586621679965682 :: TyFun Symbol Symbol -> Type) (a6989586621679965683 :: Symbol) = ShowParen a6989586621679965681 a6989586621679965682 a6989586621679965683