Copyright	(C) 2013 Richard Eisenberg
License	BSD-style (see LICENSE)
Maintainer	Ryan Scott
Stability	experimental
Portability	non-portable
Safe Haskell	None
Language	Haskell2010

Data.Singletons.TH

Contents

Primary Template Haskell generation functions
Basic singleton definitions
Auxiliary definitions

Description

This module contains everything you need to derive your own singletons via Template Haskell.

TURN ON -XScopedTypeVariables IN YOUR MODULE IF YOU WANT THIS TO WORK.

Synopsis

singletons :: OptionsMonad q => q [Dec] -> q [Dec]
singletonsOnly :: OptionsMonad q => q [Dec] -> q [Dec]
genSingletons :: OptionsMonad q => [Name] -> q [Dec]
promote :: OptionsMonad q => q [Dec] -> q [Dec]
promoteOnly :: OptionsMonad q => q [Dec] -> q [Dec]
genDefunSymbols :: OptionsMonad q => [Name] -> q [Dec]
genPromotions :: OptionsMonad q => [Name] -> q [Dec]
promoteEqInstances :: OptionsMonad q => [Name] -> q [Dec]
promoteEqInstance :: OptionsMonad q => Name -> q [Dec]
singEqInstances :: OptionsMonad q => [Name] -> q [Dec]
singEqInstance :: OptionsMonad q => Name -> q [Dec]
singEqInstancesOnly :: OptionsMonad q => [Name] -> q [Dec]
singEqInstanceOnly :: OptionsMonad q => Name -> q [Dec]
singDecideInstances :: OptionsMonad q => [Name] -> q [Dec]
singDecideInstance :: OptionsMonad q => Name -> q [Dec]
promoteOrdInstances :: OptionsMonad q => [Name] -> q [Dec]
promoteOrdInstance :: OptionsMonad q => Name -> q [Dec]
singOrdInstances :: OptionsMonad q => [Name] -> q [Dec]
singOrdInstance :: OptionsMonad q => Name -> q [Dec]
promoteBoundedInstances :: OptionsMonad q => [Name] -> q [Dec]
promoteBoundedInstance :: OptionsMonad q => Name -> q [Dec]
singBoundedInstances :: OptionsMonad q => [Name] -> q [Dec]
singBoundedInstance :: OptionsMonad q => Name -> q [Dec]
promoteEnumInstances :: OptionsMonad q => [Name] -> q [Dec]
promoteEnumInstance :: OptionsMonad q => Name -> q [Dec]
singEnumInstances :: OptionsMonad q => [Name] -> q [Dec]
singEnumInstance :: OptionsMonad q => Name -> q [Dec]
promoteShowInstances :: OptionsMonad q => [Name] -> q [Dec]
promoteShowInstance :: OptionsMonad q => Name -> q [Dec]
singShowInstances :: OptionsMonad q => [Name] -> q [Dec]
singShowInstance :: OptionsMonad q => Name -> q [Dec]
showSingInstances :: OptionsMonad q => [Name] -> q [Dec]
showSingInstance :: OptionsMonad q => Name -> q [Dec]
singITyConInstances :: DsMonad q => [Int] -> q [Dec]
singITyConInstance :: DsMonad q => Int -> q [Dec]
cases :: DsMonad q => Name -> q Exp -> q Exp -> q Exp
sCases :: OptionsMonad q => Name -> q Exp -> q Exp -> q Exp
data SBool z where
- SFalse :: SBool ('False :: Bool)
- STrue :: SBool ('True :: Bool)
data STuple0 z where
- STuple0 :: STuple0 ('() :: ())
data STuple2 z where
- STuple2 :: forall (a :: Type) (b :: Type) (n :: a) (n :: b). (Sing n) -> (Sing n) -> STuple2 ('(n, n) :: (a :: Type, b :: Type))
data STuple3 z where
- 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))
data STuple4 z where
- 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))
data STuple5 z where
- 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))
data STuple6 z where
- 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))
data STuple7 z where
- 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))
data SOrdering z where
- SLT :: SOrdering ('LT :: Ordering)
- SEQ :: SOrdering ('EQ :: Ordering)
- SGT :: SOrdering ('GT :: Ordering)
module Data.Singletons
class PEq a where
- type (x :: a) == (y :: a) :: Bool
- type (x :: a) /= (y :: a) :: Bool
type family If (cond :: Bool) (tru :: k) (fls :: k) :: k where ...
sIf :: Sing a -> Sing b -> Sing c -> Sing (If a b c)
type family (a :: Bool) && (b :: Bool) :: Bool where ...
(%&&) :: Sing a -> Sing b -> Sing (a && b)
class SEq k where
- (%==) :: forall (a :: k) (b :: k). Sing a -> Sing b -> Sing (a == b)
- (%/=) :: forall (a :: k) (b :: k). Sing a -> Sing b -> Sing (a /= b)
class POrd a where
- type Compare (arg :: a) (arg :: a) :: Ordering
- type (arg :: a) < (arg :: a) :: Bool
- type (arg :: a) <= (arg :: a) :: Bool
- type (arg :: a) > (arg :: a) :: Bool
- type (arg :: a) >= (arg :: a) :: Bool
- type Max (arg :: a) (arg :: a) :: a
- type Min (arg :: a) (arg :: a) :: a
class SEq a => SOrd a where
- sCompare :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t :: Ordering)
- (%<) :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t :: Bool)
- (%<=) :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t :: Bool)
- (%>) :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t :: Bool)
- (%>=) :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t :: Bool)
- sMax :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t :: a)
- sMin :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t :: a)
type family ThenCmp a a where ...
sThenCmp :: forall (t :: Ordering) (t :: Ordering). Sing t -> Sing t -> Sing (Apply (Apply ThenCmpSym0 t) t :: Ordering)
class SDecide k where
- (%~) :: forall (a :: k) (b :: k). Sing a -> Sing b -> Decision (a :~: b)
data (a :: k) :~: (b :: k) where
- Refl :: forall k (a :: k). a :~: a
data Void
type Refuted a = a -> Void
data Decision a
- = Proved a
- | Disproved (Refuted a)
class PBounded a where
- type MinBound :: a
- type MaxBound :: a
class SBounded a where
- sMinBound :: Sing (MinBoundSym0 :: a)
- sMaxBound :: Sing (MaxBoundSym0 :: a)
class PEnum a where
- type ToEnum (arg :: Nat) :: a
- type FromEnum (arg :: a) :: Nat
class SEnum a where
- sToEnum :: forall (t :: Nat). Sing t -> Sing (Apply ToEnumSym0 t :: a)
- sFromEnum :: forall (t :: a). Sing t -> Sing (Apply FromEnumSym0 t :: Nat)
class PShow a where
- type ShowsPrec (arg :: Nat) (arg :: a) (arg :: Symbol) :: Symbol
- type Show_ (arg :: a) :: Symbol
- type ShowList (arg :: [a]) (arg :: Symbol) :: Symbol
class SShow a where
- sShowsPrec :: forall (t :: Nat) (t :: a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t :: Symbol)
- sShow_ :: forall (t :: a). Sing t -> Sing (Apply Show_Sym0 t :: Symbol)
- sShowList :: forall (t :: [a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t :: Symbol)
type family ShowString a a where ...
sShowString :: forall (t :: Symbol) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowStringSym0 t) t :: Symbol)
type family ShowParen a a a where ...
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 family ShowSpace a where ...
sShowSpace :: forall (t :: Symbol). Sing t -> Sing (Apply ShowSpaceSym0 t :: Symbol)
type family ShowChar a a where ...
sShowChar :: forall (t :: Symbol) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowCharSym0 t) t :: Symbol)
type family ShowCommaSpace a where ...
sShowCommaSpace :: forall (t :: Symbol). Sing t -> Sing (Apply ShowCommaSpaceSym0 t :: Symbol)
class PFunctor f where
- type Fmap (arg :: (~>) a b) (arg :: f a) :: f b
- type (arg :: a) <$ (arg :: f b) :: f a
class SFunctor f where
- sFmap :: forall a b (t :: (~>) a b) (t :: f a). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t :: f b)
- (%<$) :: forall a b (t :: a) (t :: f b). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t :: f a)
class PFoldable t where
- type Fold (arg :: t m) :: m
- type FoldMap (arg :: (~>) a m) (arg :: t a) :: m
- type Foldr (arg :: (~>) a ((~>) b b)) (arg :: b) (arg :: t a) :: b
- type Foldr' (arg :: (~>) a ((~>) b b)) (arg :: b) (arg :: t a) :: b
- type Foldl (arg :: (~>) b ((~>) a b)) (arg :: b) (arg :: t a) :: b
- type Foldl' (arg :: (~>) b ((~>) a b)) (arg :: b) (arg :: t a) :: b
- type Foldr1 (arg :: (~>) a ((~>) a a)) (arg :: t a) :: a
- type Foldl1 (arg :: (~>) a ((~>) a a)) (arg :: t a) :: a
- type ToList (arg :: t a) :: [a]
- type Null (arg :: t a) :: Bool
- type Length (arg :: t a) :: Nat
- type Elem (arg :: a) (arg :: t a) :: Bool
- type Maximum (arg :: t a) :: a
- type Minimum (arg :: t a) :: a
- type Sum (arg :: t a) :: a
- type Product (arg :: t a) :: a
class SFoldable t where
- sFold :: forall m (t :: t m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t :: m)
- sFoldMap :: forall a m (t :: (~>) a m) (t :: t a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t :: m)
- sFoldr :: forall a b (t :: (~>) a ((~>) b b)) (t :: b) (t :: t a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t :: b)
- sFoldr' :: forall a b (t :: (~>) a ((~>) b b)) (t :: b) (t :: t a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t :: b)
- sFoldl :: forall b a (t :: (~>) b ((~>) a b)) (t :: b) (t :: t a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t :: b)
- sFoldl' :: forall b a (t :: (~>) b ((~>) a b)) (t :: b) (t :: t a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t :: b)
- sFoldr1 :: forall a (t :: (~>) a ((~>) a a)) (t :: t a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t :: a)
- sFoldl1 :: forall a (t :: (~>) a ((~>) a a)) (t :: t a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t :: a)
- sToList :: forall a (t :: t a). Sing t -> Sing (Apply ToListSym0 t :: [a])
- sNull :: forall a (t :: t a). Sing t -> Sing (Apply NullSym0 t :: Bool)
- sLength :: forall a (t :: t a). Sing t -> Sing (Apply LengthSym0 t :: Nat)
- sElem :: forall a (t :: a) (t :: t a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t :: Bool)
- sMaximum :: forall a (t :: t a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t :: a)
- sMinimum :: forall a (t :: t a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t :: a)
- sSum :: forall a (t :: t a). SNum a => Sing t -> Sing (Apply SumSym0 t :: a)
- sProduct :: forall a (t :: t a). SNum a => Sing t -> Sing (Apply ProductSym0 t :: a)
class PMonoid a where
- type Mempty :: a
- type Mappend (arg :: a) (arg :: a) :: a
- type Mconcat (arg :: [a]) :: a
class SSemigroup a => SMonoid a where
- sMempty :: Sing (MemptySym0 :: a)
- sMappend :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t :: a)
- sMconcat :: forall (t :: [a]). Sing t -> Sing (Apply MconcatSym0 t :: a)
class PTraversable t where
- type Traverse (arg :: (~>) a (f b)) (arg :: t a) :: f (t b)
- type SequenceA (arg :: t (f a)) :: f (t a)
- type MapM (arg :: (~>) a (m b)) (arg :: t a) :: m (t b)
- type Sequence (arg :: t (m a)) :: m (t a)
class (SFunctor t, SFoldable t) => STraversable t where
- sTraverse :: forall a f b (t :: (~>) a (f b)) (t :: t a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t :: f (t b))
- sSequenceA :: forall f a (t :: t (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t :: f (t a))
- sMapM :: forall a m b (t :: (~>) a (m b)) (t :: t a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t :: m (t b))
- sSequence :: forall m a (t :: t (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t :: m (t a))
class PApplicative f where
- type Pure (arg :: a) :: f a
- type (arg :: f ((~>) a b)) <*> (arg :: f a) :: f b
- type LiftA2 (arg :: (~>) a ((~>) b c)) (arg :: f a) (arg :: f b) :: f c
- type (arg :: f a) *> (arg :: f b) :: f b
- type (arg :: f a) <* (arg :: f b) :: f a
class SFunctor f => SApplicative f where
- sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t :: f a)
- (%<*>) :: forall a b (t :: f ((~>) a b)) (t :: f a). Sing t -> Sing t -> Sing (Apply (Apply (<*>@#@$) t) t :: f b)
- sLiftA2 :: forall a b c (t :: (~>) a ((~>) b c)) (t :: f a) (t :: f b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t :: f c)
- (%*>) :: forall a b (t :: f a) (t :: f b). Sing t -> Sing t -> Sing (Apply (Apply (*>@#@$) t) t :: f b)
- (%<*) :: forall a b (t :: f a) (t :: f b). Sing t -> Sing t -> Sing (Apply (Apply (<*@#@$) t) t :: f a)
type family (a . a) a where ...
(%.) :: forall b c a (t :: (~>) b c) (t :: (~>) a b) (t :: a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply (.@#@$) t) t) t :: c)
data SomeSing k where
- SomeSing :: Sing (a :: k) -> SomeSing k
type family Error str where ...
sError :: HasCallStack => Sing (str :: Symbol) -> a
data ErrorSym0 a6989586621679472252
type ErrorSym1 (a6989586621679472252 :: k0) = Error a6989586621679472252 :: k
type family Undefined where ...
sUndefined :: HasCallStack => a
type UndefinedSym0 = Undefined :: k
type TrueSym0 = 'True :: Bool
type FalseSym0 = 'False :: Bool
data (==@#@$) a6989586621679370055
data a6989586621679370055 ==@#@$$ a6989586621679370056
type (==@#@$$$) (a6989586621679370055 :: a) (a6989586621679370056 :: a) = (==) a6989586621679370055 a6989586621679370056 :: Bool
data (>@#@$) a6989586621679383655
data a6989586621679383655 >@#@$$ a6989586621679383656
type (>@#@$$$) (a6989586621679383655 :: a) (a6989586621679383656 :: a) = (>) a6989586621679383655 a6989586621679383656 :: Bool
type LTSym0 = 'LT :: Ordering
type EQSym0 = 'EQ :: Ordering
type GTSym0 = 'GT :: Ordering
type Tuple0Sym0 = '() :: ()
data Tuple2Sym0 a6989586621679304233
data Tuple2Sym1 a6989586621679304233 a6989586621679304234
type Tuple2Sym2 (a6989586621679304233 :: a) (a6989586621679304234 :: b) = '(a6989586621679304233, a6989586621679304234) :: (a :: Type, b :: Type)
data Tuple3Sym0 a6989586621679304264
data Tuple3Sym1 a6989586621679304264 a6989586621679304265
data Tuple3Sym2 a6989586621679304264 a6989586621679304265 a6989586621679304266
type Tuple3Sym3 (a6989586621679304264 :: a) (a6989586621679304265 :: b) (a6989586621679304266 :: c) = '(a6989586621679304264, a6989586621679304265, a6989586621679304266) :: (a :: Type, b :: Type, c :: Type)
data Tuple4Sym0 a6989586621679304310
data Tuple4Sym1 a6989586621679304310 a6989586621679304311
data Tuple4Sym2 a6989586621679304310 a6989586621679304311 a6989586621679304312
data Tuple4Sym3 a6989586621679304310 a6989586621679304311 a6989586621679304312 a6989586621679304313
type Tuple4Sym4 (a6989586621679304310 :: a) (a6989586621679304311 :: b) (a6989586621679304312 :: c) (a6989586621679304313 :: d) = '(a6989586621679304310, a6989586621679304311, a6989586621679304312, a6989586621679304313) :: (a :: Type, b :: Type, c :: Type, d :: Type)
data Tuple5Sym0 a6989586621679304373
data Tuple5Sym1 a6989586621679304373 a6989586621679304374
data Tuple5Sym2 a6989586621679304373 a6989586621679304374 a6989586621679304375
data Tuple5Sym3 a6989586621679304373 a6989586621679304374 a6989586621679304375 a6989586621679304376
data Tuple5Sym4 a6989586621679304373 a6989586621679304374 a6989586621679304375 a6989586621679304376 a6989586621679304377
type Tuple5Sym5 (a6989586621679304373 :: a) (a6989586621679304374 :: b) (a6989586621679304375 :: c) (a6989586621679304376 :: d) (a6989586621679304377 :: e) = '(a6989586621679304373, a6989586621679304374, a6989586621679304375, a6989586621679304376, a6989586621679304377) :: (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type)
data Tuple6Sym0 a6989586621679304455
data Tuple6Sym1 a6989586621679304455 a6989586621679304456
data Tuple6Sym2 a6989586621679304455 a6989586621679304456 a6989586621679304457
data Tuple6Sym3 a6989586621679304455 a6989586621679304456 a6989586621679304457 a6989586621679304458
data Tuple6Sym4 a6989586621679304455 a6989586621679304456 a6989586621679304457 a6989586621679304458 a6989586621679304459
data Tuple6Sym5 a6989586621679304455 a6989586621679304456 a6989586621679304457 a6989586621679304458 a6989586621679304459 a6989586621679304460
type Tuple6Sym6 (a6989586621679304455 :: a) (a6989586621679304456 :: b) (a6989586621679304457 :: c) (a6989586621679304458 :: d) (a6989586621679304459 :: e) (a6989586621679304460 :: f) = '(a6989586621679304455, a6989586621679304456, a6989586621679304457, a6989586621679304458, a6989586621679304459, a6989586621679304460) :: (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type)
data Tuple7Sym0 a6989586621679304558
data Tuple7Sym1 a6989586621679304558 a6989586621679304559
data Tuple7Sym2 a6989586621679304558 a6989586621679304559 a6989586621679304560
data Tuple7Sym3 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561
data Tuple7Sym4 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 a6989586621679304562
data Tuple7Sym5 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 a6989586621679304562 a6989586621679304563
data Tuple7Sym6 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 a6989586621679304562 a6989586621679304563 a6989586621679304564
type Tuple7Sym7 (a6989586621679304558 :: a) (a6989586621679304559 :: b) (a6989586621679304560 :: c) (a6989586621679304561 :: d) (a6989586621679304562 :: e) (a6989586621679304563 :: f) (a6989586621679304564 :: g) = '(a6989586621679304558, a6989586621679304559, a6989586621679304560, a6989586621679304561, a6989586621679304562, a6989586621679304563, a6989586621679304564) :: (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type, g :: Type)
data CompareSym0 a6989586621679383640
data CompareSym1 a6989586621679383640 a6989586621679383641
type CompareSym2 (a6989586621679383640 :: a) (a6989586621679383641 :: a) = Compare a6989586621679383640 a6989586621679383641 :: Ordering
data ThenCmpSym0 a6989586621679394586
data ThenCmpSym1 a6989586621679394586 a6989586621679394587
type ThenCmpSym2 (a6989586621679394586 :: Ordering) (a6989586621679394587 :: Ordering) = ThenCmp a6989586621679394586 a6989586621679394587 :: Ordering
data FoldlSym0 a6989586621680492465
data FoldlSym1 a6989586621680492465 a6989586621680492466
data FoldlSym2 a6989586621680492465 a6989586621680492466 a6989586621680492467
type FoldlSym3 (a6989586621680492465 :: (~>) b ((~>) a b)) (a6989586621680492466 :: b) (a6989586621680492467 :: t a) = Foldl a6989586621680492465 a6989586621680492466 a6989586621680492467 :: b
type MinBoundSym0 = MinBound :: a
type MaxBoundSym0 = MaxBound :: a
data ShowsPrecSym0 a6989586621680279568
data ShowsPrecSym1 a6989586621680279568 a6989586621680279569
data ShowsPrecSym2 a6989586621680279568 a6989586621680279569 a6989586621680279570
type ShowsPrecSym3 (a6989586621680279568 :: Nat) (a6989586621680279569 :: a) (a6989586621680279570 :: Symbol) = ShowsPrec a6989586621680279568 a6989586621680279569 a6989586621680279570 :: Symbol
data ShowStringSym0 a6989586621680279523
data ShowStringSym1 a6989586621680279523 a6989586621680279524
type ShowStringSym2 (a6989586621680279523 :: Symbol) (a6989586621680279524 :: Symbol) = ShowString a6989586621680279523 a6989586621680279524 :: Symbol
data ShowParenSym0 a6989586621680279507
data ShowParenSym1 a6989586621680279507 a6989586621680279508
data ShowParenSym2 a6989586621680279507 a6989586621680279508 a6989586621680279509
data ShowSpaceSym0 a6989586621680279495
type ShowSpaceSym1 (a6989586621680279495 :: Symbol) = ShowSpace a6989586621680279495 :: Symbol
data ShowCharSym0 a6989586621680279534
data ShowCharSym1 a6989586621680279534 a6989586621680279535
type ShowCharSym2 (a6989586621680279534 :: Symbol) (a6989586621680279535 :: Symbol) = ShowChar a6989586621680279534 a6989586621680279535 :: Symbol
data ShowCommaSpaceSym0 a6989586621680279489
type ShowCommaSpaceSym1 (a6989586621680279489 :: Symbol) = ShowCommaSpace a6989586621680279489 :: Symbol
data FmapSym0 a6989586621679559667
data FmapSym1 a6989586621679559667 a6989586621679559668
type FmapSym2 (a6989586621679559667 :: (~>) a b) (a6989586621679559668 :: f a) = Fmap a6989586621679559667 a6989586621679559668 :: f b
data (<$@#@$) a6989586621679559672
data a6989586621679559672 <$@#@$$ a6989586621679559673
type (<$@#@$$$) (a6989586621679559672 :: a) (a6989586621679559673 :: f b) = (<$) a6989586621679559672 a6989586621679559673 :: f a
data FoldMapSym0 a6989586621680492445
data FoldMapSym1 a6989586621680492445 a6989586621680492446
type FoldMapSym2 (a6989586621680492445 :: (~>) a m) (a6989586621680492446 :: t a) = FoldMap a6989586621680492445 a6989586621680492446 :: m
type MemptySym0 = Mempty :: a
data MappendSym0 a6989586621680347244
data MappendSym1 a6989586621680347244 a6989586621680347245
type MappendSym2 (a6989586621680347244 :: a) (a6989586621680347245 :: a) = Mappend a6989586621680347244 a6989586621680347245 :: a
data FoldrSym0 a6989586621680492451
data FoldrSym1 a6989586621680492451 a6989586621680492452
data FoldrSym2 a6989586621680492451 a6989586621680492452 a6989586621680492453
type FoldrSym3 (a6989586621680492451 :: (~>) a ((~>) b b)) (a6989586621680492452 :: b) (a6989586621680492453 :: t a) = Foldr a6989586621680492451 a6989586621680492452 a6989586621680492453 :: b
data TraverseSym0 a6989586621680816742
data TraverseSym1 a6989586621680816742 a6989586621680816743
type TraverseSym2 (a6989586621680816742 :: (~>) a (f b)) (a6989586621680816743 :: t a) = Traverse a6989586621680816742 a6989586621680816743 :: f (t b)
data PureSym0 a6989586621679559691
type PureSym1 (a6989586621679559691 :: a) = Pure a6989586621679559691 :: f a
data (<*>@#@$) a6989586621679559695
data a6989586621679559695 <*>@#@$$ a6989586621679559696
type (<*>@#@$$$) (a6989586621679559695 :: f ((~>) a b)) (a6989586621679559696 :: f a) = (<*>) a6989586621679559695 a6989586621679559696 :: f b
data LiftA2Sym0 a6989586621679559701
data LiftA2Sym1 a6989586621679559701 a6989586621679559702
data LiftA2Sym2 a6989586621679559701 a6989586621679559702 a6989586621679559703
type LiftA2Sym3 (a6989586621679559701 :: (~>) a ((~>) b c)) (a6989586621679559702 :: f a) (a6989586621679559703 :: f b) = LiftA2 a6989586621679559701 a6989586621679559702 a6989586621679559703 :: f c
data (.@#@$) a6989586621679534187
data a6989586621679534187 .@#@$$ a6989586621679534188
data (a6989586621679534187 .@#@$$$ a6989586621679534188) a6989586621679534189
type (.@#@$$$$) (a6989586621679534187 :: (~>) b c) (a6989586621679534188 :: (~>) a b) (a6989586621679534189 :: a) = (.) a6989586621679534187 a6989586621679534188 a6989586621679534189 :: c
type NilSym0 = '[] :: [a :: Type]
data (:@#@$) a6989586621679304138
data a6989586621679304138 :@#@$$ a6989586621679304139
type (:@#@$$$) (a6989586621679304138 :: a) (a6989586621679304139 :: [a]) = '(:) a6989586621679304138 a6989586621679304139 :: [a :: Type]
class SuppressUnusedWarnings t where
- suppressUnusedWarnings :: ()

Primary Template Haskell generation functions

singletons :: OptionsMonad q => q [Dec] -> q [Dec] Source #

Make promoted and singled versions of all declarations given, retaining the original declarations. See the README for further explanation.

singletonsOnly :: OptionsMonad q => q [Dec] -> q [Dec] Source #

Make promoted and singled versions of all declarations given, discarding the original declarations. Note that a singleton based on a datatype needs the original datatype, so this will fail if it sees any datatype declarations. Classes, instances, and functions are all fine.

genSingletons :: OptionsMonad q => [Name] -> q [Dec] Source #

Generate singled definitions for each of the provided type-level declaration Names. For example, the singletons package itself uses

$(genSingletons [''Bool, ''Maybe, ''Either, ''[]])

to generate singletons for Prelude types.

promote :: OptionsMonad q => q [Dec] -> q [Dec] Source #

Promote every declaration given to the type level, retaining the originals. See the README for further explanation.

promoteOnly :: OptionsMonad q => q [Dec] -> q [Dec] Source #

Promote each declaration, discarding the originals. Note that a promoted datatype uses the same definition as an original datatype, so this will not work with datatypes. Classes, instances, and functions are all fine.

genDefunSymbols :: OptionsMonad q => [Name] -> q [Dec] Source #

Generate defunctionalization symbols for each of the provided type-level declaration Names. See the "Promotion and partial application" section of the singletons README for further explanation.

genPromotions :: OptionsMonad q => [Name] -> q [Dec] Source #

Generate promoted definitions for each of the provided type-level declaration Names. This is generally only useful with classes.

Functions to generate equality instances

promoteEqInstances :: OptionsMonad q => [Name] -> q [Dec] Source #

Produce instances for (==) (type-level equality) from the given types

promoteEqInstance :: OptionsMonad q => Name -> q [Dec] Source #

Produce an instance for (==) (type-level equality) from the given type

singEqInstances :: OptionsMonad q => [Name] -> q [Dec] Source #

Create instances of SEq and type-level (==) for each type in the list

singEqInstance :: OptionsMonad q => Name -> q [Dec] Source #

Create instance of SEq and type-level (==) for the given type

singEqInstancesOnly :: OptionsMonad q => [Name] -> q [Dec] Source #

Create instances of SEq (only -- no instance for (==), which SEq generally relies on) for each type in the list

singEqInstanceOnly :: OptionsMonad q => Name -> q [Dec] Source #

Create instances of SEq (only -- no instance for (==), which SEq generally relies on) for the given type

singDecideInstances :: OptionsMonad q => [Name] -> q [Dec] Source #

Create instances of SDecide, TestEquality, and TestCoercion for each type in the list.

singDecideInstance :: OptionsMonad q => Name -> q [Dec] Source #

Create instance of SDecide, TestEquality, and TestCoercion for the given type.

Functions to generate `Ord` instances

promoteOrdInstances :: OptionsMonad q => [Name] -> q [Dec] Source #

Produce instances for POrd from the given types

promoteOrdInstance :: OptionsMonad q => Name -> q [Dec] Source #

Produce an instance for POrd from the given type

singOrdInstances :: OptionsMonad q => [Name] -> q [Dec] Source #

Create instances of SOrd for the given types

singOrdInstance :: OptionsMonad q => Name -> q [Dec] Source #

Create instance of SOrd for the given type

Functions to generate `Bounded` instances

promoteBoundedInstances :: OptionsMonad q => [Name] -> q [Dec] Source #

Produce instances for PBounded from the given types

promoteBoundedInstance :: OptionsMonad q => Name -> q [Dec] Source #

Produce an instance for PBounded from the given type

singBoundedInstances :: OptionsMonad q => [Name] -> q [Dec] Source #

Create instances of SBounded for the given types

singBoundedInstance :: OptionsMonad q => Name -> q [Dec] Source #

Create instance of SBounded for the given type

Functions to generate `Enum` instances

promoteEnumInstances :: OptionsMonad q => [Name] -> q [Dec] Source #

Produce instances for PEnum from the given types

promoteEnumInstance :: OptionsMonad q => Name -> q [Dec] Source #

Produce an instance for PEnum from the given type

singEnumInstances :: OptionsMonad q => [Name] -> q [Dec] Source #

Create instances of SEnum for the given types

singEnumInstance :: OptionsMonad q => Name -> q [Dec] Source #

Create instance of SEnum for the given type

Functions to generate `Show` instances

promoteShowInstances :: OptionsMonad q => [Name] -> q [Dec] Source #

Produce instances for PShow from the given types

promoteShowInstance :: OptionsMonad q => Name -> q [Dec] Source #

Produce an instance for PShow from the given type

singShowInstances :: OptionsMonad q => [Name] -> q [Dec] Source #

Create instances of SShow for the given types

(Not to be confused with showSingInstances.)

singShowInstance :: OptionsMonad q => Name -> q [Dec] Source #

Create instance of SShow for the given type

(Not to be confused with showShowInstance.)

showSingInstances :: OptionsMonad q => [Name] -> q [Dec] Source #

Create instances of Show for the given singleton types

(Not to be confused with singShowInstances.)

showSingInstance :: OptionsMonad q => Name -> q [Dec] Source #

Create instance of Show for the given singleton type

(Not to be confused with singShowInstance.)

Utility functions

singITyConInstances :: DsMonad q => [Int] -> q [Dec] Source #

Create an instance for SingI TyCon{N}, where N is the positive number provided as an argument.

Note that the generated code requires the use of the QuantifiedConstraints language extension.

singITyConInstance :: DsMonad q => Int -> q [Dec] Source #

Create an instance for SingI TyCon{N}, where N is the positive number provided as an argument.

Note that the generated code requires the use of the QuantifiedConstraints language extension.

cases Source #

Arguments

:: DsMonad q
=> Name	The head of the type of the scrutinee. (Like `''Maybe` or `''Bool`.)
-> q Exp	The scrutinee, in a Template Haskell quote
-> q Exp	The body, in a Template Haskell quote
-> q Exp

The function cases generates a case expression where each right-hand side is identical. This may be useful if the type-checker requires knowledge of which constructor is used to satisfy equality or type-class constraints, but where each constructor is treated the same.

sCases Source #

Arguments

:: OptionsMonad q
=> Name	The head of the type the scrutinee's type is based on. (Like `''Maybe` or `''Bool`.)
-> q Exp	The scrutinee, in a Template Haskell quote
-> q Exp	The body, in a Template Haskell quote
-> q Exp

The function sCases generates a case expression where each right-hand side is identical. This may be useful if the type-checker requires knowledge of which constructor is used to satisfy equality or type-class constraints, but where each constructor is treated the same. For sCases, unlike cases, the scrutinee is a singleton. But make sure to pass in the name of the original datatype, preferring ''Maybe over ''SMaybe.

Basic singleton definitions

data SBool z where Source #

Constructors

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

Instances

Instances details

TestCoercion SBool Source #
Instance details Defined in Data.Singletons.Prelude.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.Prelude.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.ShowSing Methods showsPrec :: Int -> SBool z -> ShowS # show :: SBool z -> String # showList :: [SBool z] -> ShowS #

data STuple0 z where Source #

Constructors

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

Instances

Instances details

TestCoercion STuple0 Source #
Instance details Defined in Data.Singletons.Prelude.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.Prelude.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.ShowSing Methods showsPrec :: Int -> STuple0 z -> ShowS # show :: STuple0 z -> String # showList :: [STuple0 z] -> ShowS #

data STuple2 z 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.Prelude.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.Prelude.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.ShowSing Methods showsPrec :: Int -> STuple2 z -> ShowS # show :: STuple2 z -> String # showList :: [STuple2 z] -> ShowS #

data STuple3 z 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.Prelude.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.Prelude.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.ShowSing Methods showsPrec :: Int -> STuple3 z -> ShowS # show :: STuple3 z -> String # showList :: [STuple3 z] -> ShowS #

data STuple4 z 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.Prelude.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.Prelude.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.ShowSing Methods showsPrec :: Int -> STuple4 z -> ShowS # show :: STuple4 z -> String # showList :: [STuple4 z] -> ShowS #

data STuple5 z 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.Prelude.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.Prelude.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.ShowSing Methods showsPrec :: Int -> STuple5 z -> ShowS # show :: STuple5 z -> String # showList :: [STuple5 z] -> ShowS #

data STuple6 z 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.Prelude.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.Prelude.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.ShowSing Methods showsPrec :: Int -> STuple6 z -> ShowS # show :: STuple6 z -> String # showList :: [STuple6 z] -> ShowS #

data STuple7 z 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.Prelude.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.Prelude.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.ShowSing Methods showsPrec :: Int -> STuple7 z -> ShowS # show :: STuple7 z -> String # showList :: [STuple7 z] -> ShowS #

data SOrdering z 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.Prelude.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.Prelude.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.ShowSing Methods showsPrec :: Int -> SOrdering z -> ShowS # show :: SOrdering z -> String # showList :: [SOrdering z] -> ShowS #

module Data.Singletons

Auxiliary definitions

These definitions might be mentioned in code generated by Template Haskell, so they must be in scope.

class PEq a Source #

The promoted analogue of Eq. If you supply no definition for (==), then it defaults to a use of DefaultEq.

Associated Types

type (x :: a) == (y :: a) :: Bool infix 4 Source #

type (x :: a) == (y :: a) = x `DefaultEq` y

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

type (x :: a) /= (y :: a) = Not (x == y)

Instances

Instances details

PEq Bool Source #
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq Ordering Source #
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq Nat Source #
Instance details Defined in Data.Singletons.TypeLits.Internal Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq Symbol Source #
Instance details Defined in Data.Singletons.TypeLits.Internal Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq () Source #
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq Void Source #
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq All Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq Any Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq [a] Source #
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (Maybe a) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (TYPE rep) Source #
Instance details Defined in Data.Singletons.TypeRepTYPE Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (Min a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (Max a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (First a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (Last a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (WrappedMonoid m) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (Option a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (Identity a) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (First a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (Last a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (Dual a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (Sum a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (Product a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (Down a) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (NonEmpty a) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (Either a b) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (a, b) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (Arg a b) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (Proxy s) Source #
Instance details Defined in Data.Singletons.Prelude.Proxy Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (a, b, c) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (Const a b) Source #
Instance details Defined in Data.Singletons.Prelude.Const Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (a, b, c, d) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (a, b, c, d, e) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (a, b, c, d, e, f) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
PEq (a, b, c, d, e, f, g) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #

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

Type-level If. If True a b ==> a; If False a b ==> b

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 ... infixr 3 #

Type-level "and"

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

class SEq k where Source #

The singleton analogue of Eq. Unlike the definition for Eq, it is required that instances define a body for (%==). You may also supply a body for (%/=).

Minimal complete definition

(%==)

Methods

(%==) :: forall (a :: k) (b :: k). Sing a -> Sing b -> Sing (a == b) infix 4 Source #

Boolean equality on singletons

(%/=) :: forall (a :: k) (b :: k). Sing a -> Sing b -> Sing (a /= b) infix 4 Source #

Boolean disequality on singletons

default (%/=) :: forall (a :: k) (b :: k). (a /= b) ~ Not (a == b) => Sing a -> Sing b -> Sing (a /= b) Source #

Instances

Instances details

SEq Bool Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: forall (a :: Bool) (b :: Bool). Sing a -> Sing b -> Sing (a == b) Source # (%/=) :: forall (a :: Bool) (b :: Bool). Sing a -> Sing b -> Sing (a /= b) Source #
SEq Ordering Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: forall (a :: Ordering) (b :: Ordering). Sing a -> Sing b -> Sing (a == b) Source # (%/=) :: forall (a :: Ordering) (b :: Ordering). Sing a -> Sing b -> Sing (a /= b) Source #
SEq Nat Source #
Instance details Defined in Data.Singletons.TypeLits.Internal Methods (%==) :: forall (a :: Nat) (b :: Nat). Sing a -> Sing b -> Sing (a == b) Source # (%/=) :: forall (a :: Nat) (b :: Nat). Sing a -> Sing b -> Sing (a /= b) Source #
SEq Symbol Source #
Instance details Defined in Data.Singletons.TypeLits.Internal Methods (%==) :: forall (a :: Symbol) (b :: Symbol). Sing a -> Sing b -> Sing (a == b) Source # (%/=) :: forall (a :: Symbol) (b :: Symbol). Sing a -> Sing b -> Sing (a /= b) Source #
SEq () Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: forall (a :: ()) (b :: ()). Sing a -> Sing b -> Sing (a == b) Source # (%/=) :: forall (a :: ()) (b :: ()). Sing a -> Sing b -> Sing (a /= b) Source #
SEq Void Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: forall (a :: Void) (b :: Void). Sing a -> Sing b -> Sing (a == b) Source # (%/=) :: forall (a :: Void) (b :: Void). Sing a -> Sing b -> Sing (a /= b) Source #
SEq Bool => SEq All Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%==) :: forall (a :: All) (b :: All). Sing a -> Sing b -> Sing (a == b) Source # (%/=) :: forall (a :: All) (b :: All). Sing a -> Sing b -> Sing (a /= b) Source #
SEq Bool => SEq Any Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%==) :: forall (a :: Any) (b :: Any). Sing a -> Sing b -> Sing (a == b) Source # (%/=) :: forall (a :: Any) (b :: Any). Sing a -> Sing b -> Sing (a /= b) Source #
(SEq a, SEq [a]) => SEq [a] Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: forall (a0 :: [a]) (b :: [a]). Sing a0 -> Sing b -> Sing (a0 == b) Source # (%/=) :: forall (a0 :: [a]) (b :: [a]). Sing a0 -> Sing b -> Sing (a0 /= b) Source #
SEq a => SEq (Maybe a) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: forall (a0 :: Maybe a) (b :: Maybe a). Sing a0 -> Sing b -> Sing (a0 == b) Source # (%/=) :: forall (a0 :: Maybe a) (b :: Maybe a). Sing a0 -> Sing b -> Sing (a0 /= b) Source #
SEq (TYPE rep) Source #
Instance details Defined in Data.Singletons.TypeRepTYPE Methods (%==) :: forall (a :: TYPE rep) (b :: TYPE rep). Sing a -> Sing b -> Sing (a == b) Source # (%/=) :: forall (a :: TYPE rep) (b :: TYPE rep). Sing a -> Sing b -> Sing (a /= b) Source #
SEq a => SEq (Min a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%==) :: forall (a0 :: Min a) (b :: Min a). Sing a0 -> Sing b -> Sing (a0 == b) Source # (%/=) :: forall (a0 :: Min a) (b :: Min a). Sing a0 -> Sing b -> Sing (a0 /= b) Source #
SEq a => SEq (Max a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%==) :: forall (a0 :: Max a) (b :: Max a). Sing a0 -> Sing b -> Sing (a0 == b) Source # (%/=) :: forall (a0 :: Max a) (b :: Max a). Sing a0 -> Sing b -> Sing (a0 /= b) Source #
SEq a => SEq (First a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%==) :: forall (a0 :: First a) (b :: First a). Sing a0 -> Sing b -> Sing (a0 == b) Source # (%/=) :: forall (a0 :: First a) (b :: First a). Sing a0 -> Sing b -> Sing (a0 /= b) Source #
SEq a => SEq (Last a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%==) :: forall (a0 :: Last a) (b :: Last a). Sing a0 -> Sing b -> Sing (a0 == b) Source # (%/=) :: forall (a0 :: Last a) (b :: Last a). Sing a0 -> Sing b -> Sing (a0 /= b) Source #
SEq m => SEq (WrappedMonoid m) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%==) :: forall (a :: WrappedMonoid m) (b :: WrappedMonoid m). Sing a -> Sing b -> Sing (a == b) Source # (%/=) :: forall (a :: WrappedMonoid m) (b :: WrappedMonoid m). Sing a -> Sing b -> Sing (a /= b) Source #
SEq (Maybe a) => SEq (Option a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%==) :: forall (a0 :: Option a) (b :: Option a). Sing a0 -> Sing b -> Sing (a0 == b) Source # (%/=) :: forall (a0 :: Option a) (b :: Option a). Sing a0 -> Sing b -> Sing (a0 /= b) Source #
SEq a => SEq (Identity a) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: forall (a0 :: Identity a) (b :: Identity a). Sing a0 -> Sing b -> Sing (a0 == b) Source # (%/=) :: forall (a0 :: Identity a) (b :: Identity a). Sing a0 -> Sing b -> Sing (a0 /= b) Source #
SEq (Maybe a) => SEq (First a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods (%==) :: forall (a0 :: First a) (b :: First a). Sing a0 -> Sing b -> Sing (a0 == b) Source # (%/=) :: forall (a0 :: First a) (b :: First a). Sing a0 -> Sing b -> Sing (a0 /= b) Source #
SEq (Maybe a) => SEq (Last a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods (%==) :: forall (a0 :: Last a) (b :: Last a). Sing a0 -> Sing b -> Sing (a0 == b) Source # (%/=) :: forall (a0 :: Last a) (b :: Last a). Sing a0 -> Sing b -> Sing (a0 /= b) Source #
SEq a => SEq (Dual a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%==) :: forall (a0 :: Dual a) (b :: Dual a). Sing a0 -> Sing b -> Sing (a0 == b) Source # (%/=) :: forall (a0 :: Dual a) (b :: Dual a). Sing a0 -> Sing b -> Sing (a0 /= b) Source #
SEq a => SEq (Sum a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%==) :: forall (a0 :: Sum a) (b :: Sum a). Sing a0 -> Sing b -> Sing (a0 == b) Source # (%/=) :: forall (a0 :: Sum a) (b :: Sum a). Sing a0 -> Sing b -> Sing (a0 /= b) Source #
SEq a => SEq (Product a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%==) :: forall (a0 :: Product a) (b :: Product a). Sing a0 -> Sing b -> Sing (a0 == b) Source # (%/=) :: forall (a0 :: Product a) (b :: Product a). Sing a0 -> Sing b -> Sing (a0 /= b) Source #
SEq a => SEq (Down a) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods (%==) :: forall (a0 :: Down a) (b :: Down a). Sing a0 -> Sing b -> Sing (a0 == b) Source # (%/=) :: forall (a0 :: Down a) (b :: Down a). Sing a0 -> Sing b -> Sing (a0 /= b) Source #
(SEq a, SEq [a]) => SEq (NonEmpty a) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: forall (a0 :: NonEmpty a) (b :: NonEmpty a). Sing a0 -> Sing b -> Sing (a0 == b) Source # (%/=) :: forall (a0 :: NonEmpty a) (b :: NonEmpty a). Sing a0 -> Sing b -> Sing (a0 /= b) Source #
(SEq a, SEq b) => SEq (Either a b) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: forall (a0 :: Either a b) (b0 :: Either a b). Sing a0 -> Sing b0 -> Sing (a0 == b0) Source # (%/=) :: forall (a0 :: Either a b) (b0 :: Either a b). Sing a0 -> Sing b0 -> Sing (a0 /= b0) Source #
(SEq a, SEq b) => SEq (a, b) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: forall (a0 :: (a, b)) (b0 :: (a, b)). Sing a0 -> Sing b0 -> Sing (a0 == b0) Source # (%/=) :: forall (a0 :: (a, b)) (b0 :: (a, b)). Sing a0 -> Sing b0 -> Sing (a0 /= b0) Source #
SEq a => SEq (Arg a b) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods (%==) :: forall (a0 :: Arg a b) (b0 :: Arg a b). Sing a0 -> Sing b0 -> Sing (a0 == b0) Source # (%/=) :: forall (a0 :: Arg a b) (b0 :: Arg a b). Sing a0 -> Sing b0 -> Sing (a0 /= b0) Source #
SEq (Proxy s) Source #
Instance details Defined in Data.Singletons.Prelude.Proxy Methods (%==) :: forall (a :: Proxy s) (b :: Proxy s). Sing a -> Sing b -> Sing (a == b) Source # (%/=) :: forall (a :: Proxy s) (b :: Proxy s). Sing a -> Sing b -> Sing (a /= b) Source #
(SEq a, SEq b, SEq c) => SEq (a, b, c) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: forall (a0 :: (a, b, c)) (b0 :: (a, b, c)). Sing a0 -> Sing b0 -> Sing (a0 == b0) Source # (%/=) :: forall (a0 :: (a, b, c)) (b0 :: (a, b, c)). Sing a0 -> Sing b0 -> Sing (a0 /= b0) Source #
SEq a => SEq (Const a b) Source #
Instance details Defined in Data.Singletons.Prelude.Const Methods (%==) :: forall (a0 :: Const a b) (b0 :: Const a b). Sing a0 -> Sing b0 -> Sing (a0 == b0) Source # (%/=) :: forall (a0 :: Const a b) (b0 :: Const a b). Sing a0 -> Sing b0 -> Sing (a0 /= b0) Source #
(SEq a, SEq b, SEq c, SEq d) => SEq (a, b, c, d) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: forall (a0 :: (a, b, c, d)) (b0 :: (a, b, c, d)). Sing a0 -> Sing b0 -> Sing (a0 == b0) Source # (%/=) :: forall (a0 :: (a, b, c, d)) (b0 :: (a, b, c, d)). Sing a0 -> Sing b0 -> Sing (a0 /= b0) Source #
(SEq a, SEq b, SEq c, SEq d, SEq e) => SEq (a, b, c, d, e) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: forall (a0 :: (a, b, c, d, e)) (b0 :: (a, b, c, d, e)). Sing a0 -> Sing b0 -> Sing (a0 == b0) Source # (%/=) :: forall (a0 :: (a, b, c, d, e)) (b0 :: (a, b, c, d, e)). Sing a0 -> Sing b0 -> Sing (a0 /= b0) 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.Singletons.Prelude.Eq Methods (%==) :: forall (a0 :: (a, b, c, d, e, f)) (b0 :: (a, b, c, d, e, f)). Sing a0 -> Sing b0 -> Sing (a0 == b0) Source # (%/=) :: forall (a0 :: (a, b, c, d, e, f)) (b0 :: (a, b, c, d, e, f)). Sing a0 -> Sing b0 -> Sing (a0 /= b0) 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.Singletons.Prelude.Eq Methods (%==) :: forall (a0 :: (a, b, c, d, e, f, g)) (b0 :: (a, b, c, d, e, f, g)). Sing a0 -> Sing b0 -> Sing (a0 == b0) Source # (%/=) :: forall (a0 :: (a, b, c, d, e, f, g)) (b0 :: (a, b, c, d, e, f, g)). Sing a0 -> Sing b0 -> Sing (a0 /= b0) Source #

class POrd a Source #

Associated Types

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

type Compare a a = Apply (Apply Compare_6989586621679383674Sym0 a) a

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

type a < a = Apply (Apply TFHelper_6989586621679383695Sym0 a) a

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

type a <= a = Apply (Apply TFHelper_6989586621679383711Sym0 a) a

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

type a > a = Apply (Apply TFHelper_6989586621679383727Sym0 a) a

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

type a >= a = Apply (Apply TFHelper_6989586621679383743Sym0 a) a

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

type Max a a = Apply (Apply Max_6989586621679383759Sym0 a) a

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

type Min a a = Apply (Apply Min_6989586621679383775Sym0 a) a

Instances

Instances details

POrd Bool Source #
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd Ordering Source #
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd Nat Source #
Instance details Defined in Data.Singletons.TypeLits.Internal Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd Symbol Source #
Instance details Defined in Data.Singletons.TypeLits.Internal Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd () Source #
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd Void Source #
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd All Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd Any Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd [a] Source #
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (Maybe a) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (Min a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (Max a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (First a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (Last a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (WrappedMonoid m) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (Option a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (Identity a) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (First a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (Last a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (Dual a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (Sum a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (Product a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (Down a) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (NonEmpty a) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (Either a b) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (a, b) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (Arg a b) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (Proxy s) Source #
Instance details Defined in Data.Singletons.Prelude.Proxy Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (a, b, c) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (Const a b) Source #
Instance details Defined in Data.Singletons.Prelude.Const Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (a, b, c, d) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (a, b, c, d, e) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (a, b, c, d, e, f) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
POrd (a, b, c, d, e, f, g) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: 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) Source #

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

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

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

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

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

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

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

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

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

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

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

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

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

Instances

Instances details

SOrd Bool Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t :: Bool) (t :: Bool). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Bool) (t :: Bool). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Bool) (t :: Bool). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Bool) (t :: Bool). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Bool) (t :: Bool). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Bool) (t :: Bool). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Bool) (t :: Bool). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd Ordering Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t :: Ordering) (t :: Ordering). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Ordering) (t :: Ordering). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Ordering) (t :: Ordering). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Ordering) (t :: Ordering). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Ordering) (t :: Ordering). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Ordering) (t :: Ordering). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Ordering) (t :: Ordering). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd Nat Source #
Instance details Defined in Data.Singletons.TypeLits.Internal Methods sCompare :: forall (t :: Nat) (t :: Nat). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Nat) (t :: Nat). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Nat) (t :: Nat). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Nat) (t :: Nat). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Nat) (t :: Nat). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Nat) (t :: Nat). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Nat) (t :: Nat). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd Symbol Source #
Instance details Defined in Data.Singletons.TypeLits.Internal Methods sCompare :: forall (t :: Symbol) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Symbol) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Symbol) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Symbol) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Symbol) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Symbol) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Symbol) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd () Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t :: ()) (t :: ()). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: ()) (t :: ()). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: ()) (t :: ()). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: ()) (t :: ()). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: ()) (t :: ()). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: ()) (t :: ()). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: ()) (t :: ()). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd Void Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t :: Void) (t :: Void). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Void) (t :: Void). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Void) (t :: Void). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Void) (t :: Void). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Void) (t :: Void). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Void) (t :: Void). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Void) (t :: Void). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd Bool => SOrd All Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sCompare :: forall (t :: All) (t :: All). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: All) (t :: All). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: All) (t :: All). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: All) (t :: All). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: All) (t :: All). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: All) (t :: All). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: All) (t :: All). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd Bool => SOrd Any Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sCompare :: forall (t :: Any) (t :: Any). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Any) (t :: Any). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Any) (t :: Any). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Any) (t :: Any). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Any) (t :: Any). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Any) (t :: Any). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Any) (t :: Any). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
(SOrd a, SOrd [a]) => SOrd [a] Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t :: [a]) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: [a]) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: [a]) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: [a]) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: [a]) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: [a]) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: [a]) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd a => SOrd (Maybe a) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t :: Maybe a) (t :: Maybe a). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Maybe a) (t :: Maybe a). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Maybe a) (t :: Maybe a). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Maybe a) (t :: Maybe a). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Maybe a) (t :: Maybe a). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Maybe a) (t :: Maybe a). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Maybe a) (t :: Maybe a). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd a => SOrd (Min a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sCompare :: forall (t :: Min a) (t :: Min a). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Min a) (t :: Min a). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Min a) (t :: Min a). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Min a) (t :: Min a). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Min a) (t :: Min a). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Min a) (t :: Min a). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Min a) (t :: Min a). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd a => SOrd (Max a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sCompare :: forall (t :: Max a) (t :: Max a). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Max a) (t :: Max a). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Max a) (t :: Max a). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Max a) (t :: Max a). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Max a) (t :: Max a). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Max a) (t :: Max a). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Max a) (t :: Max a). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd a => SOrd (First a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sCompare :: forall (t :: First a) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: First a) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: First a) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: First a) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: First a) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: First a) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: First a) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd a => SOrd (Last a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sCompare :: forall (t :: Last a) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Last a) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Last a) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Last a) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Last a) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Last a) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Last a) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd m => SOrd (WrappedMonoid m) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sCompare :: forall (t :: WrappedMonoid m) (t :: WrappedMonoid m). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: WrappedMonoid m) (t :: WrappedMonoid m). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: WrappedMonoid m) (t :: WrappedMonoid m). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: WrappedMonoid m) (t :: WrappedMonoid m). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: WrappedMonoid m) (t :: WrappedMonoid m). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: WrappedMonoid m) (t :: WrappedMonoid m). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: WrappedMonoid m) (t :: WrappedMonoid m). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd (Maybe a) => SOrd (Option a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sCompare :: forall (t :: Option a) (t :: Option a). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Option a) (t :: Option a). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Option a) (t :: Option a). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Option a) (t :: Option a). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Option a) (t :: Option a). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Option a) (t :: Option a). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Option a) (t :: Option a). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd a => SOrd (Identity a) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t :: Identity a) (t :: Identity a). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Identity a) (t :: Identity a). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Identity a) (t :: Identity a). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Identity a) (t :: Identity a). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Identity a) (t :: Identity a). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Identity a) (t :: Identity a). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Identity a) (t :: Identity a). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd (Maybe a) => SOrd (First a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sCompare :: forall (t :: First a) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: First a) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: First a) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: First a) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: First a) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: First a) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: First a) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd (Maybe a) => SOrd (Last a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sCompare :: forall (t :: Last a) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Last a) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Last a) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Last a) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Last a) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Last a) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Last a) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd a => SOrd (Dual a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sCompare :: forall (t :: Dual a) (t :: Dual a). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Dual a) (t :: Dual a). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Dual a) (t :: Dual a). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Dual a) (t :: Dual a). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Dual a) (t :: Dual a). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Dual a) (t :: Dual a). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Dual a) (t :: Dual a). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd a => SOrd (Sum a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sCompare :: forall (t :: Sum a) (t :: Sum a). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Sum a) (t :: Sum a). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Sum a) (t :: Sum a). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Sum a) (t :: Sum a). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Sum a) (t :: Sum a). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Sum a) (t :: Sum a). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Sum a) (t :: Sum a). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd a => SOrd (Product a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sCompare :: forall (t :: Product a) (t :: Product a). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Product a) (t :: Product a). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Product a) (t :: Product a). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Product a) (t :: Product a). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Product a) (t :: Product a). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Product a) (t :: Product a). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Product a) (t :: Product a). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd a => SOrd (Down a) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t :: Down a) (t :: Down a). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Down a) (t :: Down a). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Down a) (t :: Down a). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Down a) (t :: Down a). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Down a) (t :: Down a). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Down a) (t :: Down a). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Down a) (t :: Down a). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
(SOrd a, SOrd [a]) => SOrd (NonEmpty a) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t :: NonEmpty a) (t :: NonEmpty a). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: NonEmpty a) (t :: NonEmpty a). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: NonEmpty a) (t :: NonEmpty a). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: NonEmpty a) (t :: NonEmpty a). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: NonEmpty a) (t :: NonEmpty a). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: NonEmpty a) (t :: NonEmpty a). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: NonEmpty a) (t :: NonEmpty a). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
(SOrd a, SOrd b) => SOrd (Either a b) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t :: Either a b) (t :: Either a b). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Either a b) (t :: Either a b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Either a b) (t :: Either a b). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Either a b) (t :: Either a b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Either a b) (t :: Either a b). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Either a b) (t :: Either a b). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Either a b) (t :: Either a b). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
(SOrd a, SOrd b) => SOrd (a, b) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t :: (a, b)) (t :: (a, b)). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: (a, b)) (t :: (a, b)). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: (a, b)) (t :: (a, b)). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: (a, b)) (t :: (a, b)). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: (a, b)) (t :: (a, b)). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: (a, b)) (t :: (a, b)). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: (a, b)) (t :: (a, b)). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd a => SOrd (Arg a b) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sCompare :: forall (t :: Arg a b) (t :: Arg a b). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Arg a b) (t :: Arg a b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Arg a b) (t :: Arg a b). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Arg a b) (t :: Arg a b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Arg a b) (t :: Arg a b). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Arg a b) (t :: Arg a b). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Arg a b) (t :: Arg a b). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd (Proxy s) Source #
Instance details Defined in Data.Singletons.Prelude.Proxy Methods sCompare :: forall (t :: Proxy s) (t :: Proxy s). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Proxy s) (t :: Proxy s). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Proxy s) (t :: Proxy s). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Proxy s) (t :: Proxy s). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Proxy s) (t :: Proxy s). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Proxy s) (t :: Proxy s). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Proxy s) (t :: Proxy s). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
(SOrd a, SOrd b, SOrd c) => SOrd (a, b, c) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t :: (a, b, c)) (t :: (a, b, c)). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: (a, b, c)) (t :: (a, b, c)). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: (a, b, c)) (t :: (a, b, c)). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: (a, b, c)) (t :: (a, b, c)). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: (a, b, c)) (t :: (a, b, c)). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: (a, b, c)) (t :: (a, b, c)). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: (a, b, c)) (t :: (a, b, c)). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
SOrd a => SOrd (Const a b) Source #
Instance details Defined in Data.Singletons.Prelude.Const Methods sCompare :: forall (t :: Const a b) (t :: Const a b). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Const a b) (t :: Const a b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Const a b) (t :: Const a b). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Const a b) (t :: Const a b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Const a b) (t :: Const a b). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Const a b) (t :: Const a b). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Const a b) (t :: Const a b). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
(SOrd a, SOrd b, SOrd c, SOrd d) => SOrd (a, b, c, d) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t :: (a, b, c, d)) (t :: (a, b, c, d)). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: (a, b, c, d)) (t :: (a, b, c, d)). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: (a, b, c, d)) (t :: (a, b, c, d)). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: (a, b, c, d)) (t :: (a, b, c, d)). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: (a, b, c, d)) (t :: (a, b, c, d)). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: (a, b, c, d)) (t :: (a, b, c, d)). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: (a, b, c, d)) (t :: (a, b, c, d)). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
(SOrd a, SOrd b, SOrd c, SOrd d, SOrd e) => SOrd (a, b, c, d, e) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t :: (a, b, c, d, e)) (t :: (a, b, c, d, e)). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: (a, b, c, d, e)) (t :: (a, b, c, d, e)). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: (a, b, c, d, e)) (t :: (a, b, c, d, e)). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: (a, b, c, d, e)) (t :: (a, b, c, d, e)). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: (a, b, c, d, e)) (t :: (a, b, c, d, e)). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: (a, b, c, d, e)) (t :: (a, b, c, d, e)). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: (a, b, c, d, e)) (t :: (a, b, c, d, e)). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) 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.Singletons.Prelude.Ord Methods sCompare :: forall (t :: (a, b, c, d, e, f)) (t :: (a, b, c, d, e, f)). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: (a, b, c, d, e, f)) (t :: (a, b, c, d, e, f)). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: (a, b, c, d, e, f)) (t :: (a, b, c, d, e, f)). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: (a, b, c, d, e, f)) (t :: (a, b, c, d, e, f)). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: (a, b, c, d, e, f)) (t :: (a, b, c, d, e, f)). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: (a, b, c, d, e, f)) (t :: (a, b, c, d, e, f)). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: (a, b, c, d, e, f)) (t :: (a, b, c, d, e, f)). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) 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.Singletons.Prelude.Ord Methods sCompare :: forall (t :: (a, b, c, d, e, f, g)) (t :: (a, b, c, d, e, f, g)). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: (a, b, c, d, e, f, g)) (t :: (a, b, c, d, e, f, g)). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: (a, b, c, d, e, f, g)) (t :: (a, b, c, d, e, f, g)). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: (a, b, c, d, e, f, g)) (t :: (a, b, c, d, e, f, g)). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: (a, b, c, d, e, f, g)) (t :: (a, b, c, d, e, f, g)). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: (a, b, c, d, e, f, g)) (t :: (a, b, c, d, e, f, g)). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: (a, b, c, d, e, f, g)) (t :: (a, b, c, d, e, f, g)). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #

type family ThenCmp a a where ... Source #

Equations

ThenCmp 'EQ x = x
ThenCmp 'LT _ = LTSym0
ThenCmp 'GT _ = GTSym0

sThenCmp :: forall (t :: Ordering) (t :: Ordering). Sing t -> Sing t -> Sing (Apply (Apply ThenCmpSym0 t) t :: Ordering) Source #

class SDecide k where Source #

Members of the SDecide "kind" class support decidable equality. Instances of this class are generated alongside singleton definitions for datatypes that derive an Eq instance.

Methods

(%~) :: forall (a :: k) (b :: k). Sing a -> Sing b -> Decision (a :~: b) infix 4 Source #

Compute a proof or disproof of equality, given two singletons.

Instances

Instances details

SDecide Bool Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods (%~) :: forall (a :: Bool) (b :: Bool). Sing a -> Sing b -> Decision (a :~: b) Source #
SDecide Ordering Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods (%~) :: forall (a :: Ordering) (b :: Ordering). Sing a -> Sing b -> Decision (a :~: b) Source #
SDecide Nat Source #
Instance details Defined in Data.Singletons.TypeLits.Internal Methods (%~) :: forall (a :: Nat) (b :: Nat). Sing a -> Sing b -> Decision (a :~: b) Source #
SDecide Symbol Source #
Instance details Defined in Data.Singletons.TypeLits.Internal Methods (%~) :: forall (a :: Symbol) (b :: Symbol). Sing a -> Sing b -> Decision (a :~: b) Source #
SDecide () Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods (%~) :: forall (a :: ()) (b :: ()). Sing a -> Sing b -> Decision (a :~: b) Source #
SDecide Void Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods (%~) :: forall (a :: Void) (b :: Void). Sing a -> Sing b -> Decision (a :~: b) Source #
SDecide Bool => SDecide All Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%~) :: forall (a :: All) (b :: All). Sing a -> Sing b -> Decision (a :~: b) Source #
SDecide Bool => SDecide Any Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%~) :: forall (a :: Any) (b :: Any). Sing a -> Sing b -> Decision (a :~: b) Source #
(SDecide a, SDecide [a]) => SDecide [a] Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods (%~) :: forall (a0 :: [a]) (b :: [a]). Sing a0 -> Sing b -> Decision (a0 :~: b) Source #
SDecide a => SDecide (Maybe a) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods (%~) :: forall (a0 :: Maybe a) (b :: Maybe a). Sing a0 -> Sing b -> Decision (a0 :~: b) Source #
SDecide (TYPE rep) Source #
Instance details Defined in Data.Singletons.TypeRepTYPE Methods (%~) :: forall (a :: TYPE rep) (b :: TYPE rep). Sing a -> Sing b -> Decision (a :~: b) Source #
SDecide a => SDecide (Min a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%~) :: forall (a0 :: Min a) (b :: Min a). Sing a0 -> Sing b -> Decision (a0 :~: b) Source #
SDecide a => SDecide (Max a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%~) :: forall (a0 :: Max a) (b :: Max a). Sing a0 -> Sing b -> Decision (a0 :~: b) Source #
SDecide a => SDecide (First a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%~) :: forall (a0 :: First a) (b :: First a). Sing a0 -> Sing b -> Decision (a0 :~: b) Source #
SDecide a => SDecide (Last a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%~) :: forall (a0 :: Last a) (b :: Last a). Sing a0 -> Sing b -> Decision (a0 :~: b) Source #
SDecide m => SDecide (WrappedMonoid m) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%~) :: forall (a :: WrappedMonoid m) (b :: WrappedMonoid m). Sing a -> Sing b -> Decision (a :~: b) Source #
SDecide (Maybe a) => SDecide (Option a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%~) :: forall (a0 :: Option a) (b :: Option a). Sing a0 -> Sing b -> Decision (a0 :~: b) Source #
SDecide a => SDecide (Identity a) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods (%~) :: forall (a0 :: Identity a) (b :: Identity a). Sing a0 -> Sing b -> Decision (a0 :~: b) Source #
SDecide (Maybe a) => SDecide (First a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods (%~) :: forall (a0 :: First a) (b :: First a). Sing a0 -> Sing b -> Decision (a0 :~: b) Source #
SDecide (Maybe a) => SDecide (Last a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods (%~) :: forall (a0 :: Last a) (b :: Last a). Sing a0 -> Sing b -> Decision (a0 :~: b) Source #
SDecide a => SDecide (Dual a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%~) :: forall (a0 :: Dual a) (b :: Dual a). Sing a0 -> Sing b -> Decision (a0 :~: b) Source #
SDecide a => SDecide (Sum a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%~) :: forall (a0 :: Sum a) (b :: Sum a). Sing a0 -> Sing b -> Decision (a0 :~: b) Source #
SDecide a => SDecide (Product a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%~) :: forall (a0 :: Product a) (b :: Product a). Sing a0 -> Sing b -> Decision (a0 :~: b) Source #
SDecide a => SDecide (Down a) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods (%~) :: forall (a0 :: Down a) (b :: Down a). Sing a0 -> Sing b -> Decision (a0 :~: b) Source #
(SDecide a, SDecide [a]) => SDecide (NonEmpty a) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods (%~) :: forall (a0 :: NonEmpty a) (b :: NonEmpty a). Sing a0 -> Sing b -> Decision (a0 :~: b) Source #
(SDecide a, SDecide b) => SDecide (Either a b) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods (%~) :: forall (a0 :: Either a b) (b0 :: Either a b). Sing a0 -> Sing b0 -> Decision (a0 :~: b0) Source #
(SDecide a, SDecide b) => SDecide (a, b) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods (%~) :: forall (a0 :: (a, b)) (b0 :: (a, b)). Sing a0 -> Sing b0 -> Decision (a0 :~: b0) Source #
SDecide (Proxy t) Source #
Instance details Defined in Data.Singletons.Prelude.Proxy Methods (%~) :: forall (a :: Proxy t) (b :: Proxy t). Sing a -> Sing b -> Decision (a :~: b) Source #
(SDecide a, SDecide b, SDecide c) => SDecide (a, b, c) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods (%~) :: forall (a0 :: (a, b, c)) (b0 :: (a, b, c)). Sing a0 -> Sing b0 -> Decision (a0 :~: b0) Source #
SDecide a => SDecide (Const a b) Source #
Instance details Defined in Data.Singletons.Prelude.Const Methods (%~) :: forall (a0 :: Const a b) (b0 :: Const a b). Sing a0 -> Sing b0 -> Decision (a0 :~: b0) Source #
(SDecide a, SDecide b, SDecide c, SDecide d) => SDecide (a, b, c, d) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods (%~) :: forall (a0 :: (a, b, c, d)) (b0 :: (a, b, c, d)). Sing a0 -> Sing b0 -> Decision (a0 :~: b0) Source #
(SDecide a, SDecide b, SDecide c, SDecide d, SDecide e) => SDecide (a, b, c, d, e) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods (%~) :: forall (a0 :: (a, b, c, d, e)) (b0 :: (a, b, c, d, e)). Sing a0 -> Sing b0 -> Decision (a0 :~: b0) Source #
(SDecide a, SDecide b, SDecide c, SDecide d, SDecide e, SDecide f) => SDecide (a, b, c, d, e, f) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods (%~) :: forall (a0 :: (a, b, c, d, e, f)) (b0 :: (a, b, c, d, e, f)). Sing a0 -> Sing b0 -> Decision (a0 :~: b0) Source #
(SDecide a, SDecide b, SDecide c, SDecide d, SDecide e, SDecide f, SDecide g) => SDecide (a, b, c, d, e, f, g) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods (%~) :: forall (a0 :: (a, b, c, d, e, f, g)) (b0 :: (a, b, c, d, e, f, g)). Sing a0 -> Sing b0 -> Decision (a0 :~: b0) Source #

data (a :: k) :~: (b :: k) where infix 4 #

Propositional equality. If a :~: b is inhabited by some terminating value, then the type a is the same as the type b. To use this equality in practice, pattern-match on the a :~: b to get out the Refl constructor; in the body of the pattern-match, the compiler knows that a ~ b.

Since: base-4.7.0.0

Constructors

Refl :: forall k (a :: k). a :~: a

Instances

Instances details

TestCoercion ((:~:) a :: k -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Coercion Methods testCoercion :: forall (a0 :: k0) (b :: k0). (a :~: a0) -> (a :~: b) -> Maybe (Coercion a0 b) #
TestEquality ((:~:) a :: k -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods testEquality :: forall (a0 :: k0) (b :: k0). (a :~: a0) -> (a :~: b) -> Maybe (a0 :~: b) #
a ~ b => Bounded (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods minBound :: a :~: b # maxBound :: a :~: b #
a ~ b => Enum (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods succ :: (a :~: b) -> a :~: b # pred :: (a :~: b) -> a :~: b # toEnum :: Int -> a :~: b # fromEnum :: (a :~: b) -> Int # enumFrom :: (a :~: b) -> [a :~: b] # enumFromThen :: (a :~: b) -> (a :~: b) -> [a :~: b] # enumFromTo :: (a :~: b) -> (a :~: b) -> [a :~: b] # enumFromThenTo :: (a :~: b) -> (a :~: b) -> (a :~: b) -> [a :~: b] #
Eq (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods (==) :: (a :~: b) -> (a :~: b) -> Bool # (/=) :: (a :~: b) -> (a :~: b) -> Bool #
(a ~ b, Data a) => Data (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Data Methods gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> (a :~: b) -> c (a :~: b) # gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (a :~: b) # toConstr :: (a :~: b) -> Constr # dataTypeOf :: (a :~: b) -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (a :~: b)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (a :~: b)) # gmapT :: (forall b0. Data b0 => b0 -> b0) -> (a :~: b) -> a :~: b # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> (a :~: b) -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> (a :~: b) -> r # gmapQ :: (forall d. Data d => d -> u) -> (a :~: b) -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> (a :~: b) -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> (a :~: b) -> m (a :~: b) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> (a :~: b) -> m (a :~: b) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> (a :~: b) -> m (a :~: b) #
Ord (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods compare :: (a :~: b) -> (a :~: b) -> Ordering # (<) :: (a :~: b) -> (a :~: b) -> Bool # (<=) :: (a :~: b) -> (a :~: b) -> Bool # (>) :: (a :~: b) -> (a :~: b) -> Bool # (>=) :: (a :~: b) -> (a :~: b) -> Bool # max :: (a :~: b) -> (a :~: b) -> a :~: b # min :: (a :~: b) -> (a :~: b) -> a :~: b #
a ~ b => Read (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods readsPrec :: Int -> ReadS (a :~: b) # readList :: ReadS [a :~: b] # readPrec :: ReadPrec (a :~: b) # readListPrec :: ReadPrec [a :~: b] #
Show (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods showsPrec :: Int -> (a :~: b) -> ShowS # show :: (a :~: b) -> String # showList :: [a :~: b] -> ShowS #

data Void #

Uninhabited data type

Since: base-4.8.0.0

Instances

Instances details

Eq Void	Since: base-4.8.0.0
Instance details Defined in Data.Void Methods (==) :: Void -> Void -> Bool # (/=) :: Void -> Void -> Bool #
Data Void	Since: base-4.8.0.0
Instance details Defined in Data.Void Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Void -> c Void # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Void # toConstr :: Void -> Constr # dataTypeOf :: Void -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Void) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Void) # gmapT :: (forall b. Data b => b -> b) -> Void -> Void # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Void -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Void -> r # gmapQ :: (forall d. Data d => d -> u) -> Void -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Void -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Void -> m Void # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Void -> m Void # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Void -> m Void #
Ord Void	Since: base-4.8.0.0
Instance details Defined in Data.Void Methods compare :: Void -> Void -> Ordering # (<) :: Void -> Void -> Bool # (<=) :: Void -> Void -> Bool # (>) :: Void -> Void -> Bool # (>=) :: Void -> Void -> Bool # max :: Void -> Void -> Void # min :: Void -> Void -> Void #
Read Void	Reading a `Void` value is always a parse error, considering `Void` as a data type with no constructors. Since: base-4.8.0.0
Instance details Defined in Data.Void Methods readsPrec :: Int -> ReadS Void # readList :: ReadS [Void] # readPrec :: ReadPrec Void # readListPrec :: ReadPrec [Void] #
Show Void	Since: base-4.8.0.0
Instance details Defined in Data.Void Methods showsPrec :: Int -> Void -> ShowS # show :: Void -> String # showList :: [Void] -> ShowS #
Ix Void	Since: base-4.8.0.0
Instance details Defined in Data.Void Methods range :: (Void, Void) -> [Void] # index :: (Void, Void) -> Void -> Int # unsafeIndex :: (Void, Void) -> Void -> Int # inRange :: (Void, Void) -> Void -> Bool # rangeSize :: (Void, Void) -> Int # unsafeRangeSize :: (Void, Void) -> Int #
Generic Void	Since: base-4.8.0.0
Instance details Defined in Data.Void Associated Types type Rep Void :: Type -> Type # Methods from :: Void -> Rep Void x # to :: Rep Void x -> Void #
Semigroup Void	Since: base-4.9.0.0
Instance details Defined in Data.Void Methods (<>) :: Void -> Void -> Void # sconcat :: NonEmpty Void -> Void # stimes :: Integral b => b -> Void -> Void #
Exception Void	Since: base-4.8.0.0
Instance details Defined in Data.Void Methods toException :: Void -> SomeException # fromException :: SomeException -> Maybe Void # displayException :: Void -> String #
SingKind Void Source #
Instance details Defined in Data.Singletons.Prelude.Instances Associated Types type Demote Void = (r :: Type) Source # Methods fromSing :: forall (a :: Void). Sing a -> Demote Void Source # toSing :: Demote Void -> SomeSing Void Source #
SDecide Void Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods (%~) :: forall (a :: Void) (b :: Void). Sing a -> Sing b -> Decision (a :~: b) Source #
PEq Void Source #
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool Source # type x /= y :: Bool Source #
SEq Void Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: forall (a :: Void) (b :: Void). Sing a -> Sing b -> Sing (a == b) Source # (%/=) :: forall (a :: Void) (b :: Void). Sing a -> Sing b -> Sing (a /= b) Source #
SOrd Void Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t :: Void) (t :: Void). Sing t -> Sing t -> Sing (Apply (Apply CompareSym0 t) t) Source # (%<) :: forall (t :: Void) (t :: Void). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source # (%<=) :: forall (t :: Void) (t :: Void). Sing t -> Sing t -> Sing (Apply (Apply (<=@#@$) t) t) Source # (%>) :: forall (t :: Void) (t :: Void). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%>=) :: forall (t :: Void) (t :: Void). Sing t -> Sing t -> Sing (Apply (Apply (>=@#@$) t) t) Source # sMax :: forall (t :: Void) (t :: Void). Sing t -> Sing t -> Sing (Apply (Apply MaxSym0 t) t) Source # sMin :: forall (t :: Void) (t :: Void). Sing t -> Sing t -> Sing (Apply (Apply MinSym0 t) t) Source #
POrd Void Source #
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg :: Ordering Source # type arg < arg :: Bool Source # type arg <= arg :: Bool Source # type arg > arg :: Bool Source # type arg >= arg :: Bool Source # type Max arg arg :: a Source # type Min arg arg :: a Source #
SSemigroup Void Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%<>) :: forall (t :: Void) (t :: Void). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sSconcat :: forall (t :: NonEmpty Void). Sing t -> Sing (Apply SconcatSym0 t) Source #
PSemigroup Void Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type arg <> arg :: a Source # type Sconcat arg :: a Source #
SShow Void Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t :: Nat) (t :: Void) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Void). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Void]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
PShow Void Source #
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
Lift Void	Since: template-haskell-2.15.0.0
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Void -> Q Exp # liftTyped :: Void -> Q (TExp Void) #
TestCoercion SVoid Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods testCoercion :: forall (a :: k) (b :: k). SVoid a -> SVoid b -> Maybe (Coercion a b) #
TestEquality SVoid Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods testEquality :: forall (a :: k) (b :: k). SVoid a -> SVoid b -> Maybe (a :~: b) #
SingI (AbsurdSym0 :: TyFun Void a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Void Methods sing :: Sing AbsurdSym0 Source #
SuppressUnusedWarnings (AbsurdSym0 :: TyFun Void a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Void Methods suppressUnusedWarnings :: () Source #
type Rep Void
Instance details Defined in Data.Void type Rep Void = D1 ('MetaData "Void" "Data.Void" "base" 'False) (V1 :: Type -> Type)
type Demote Void Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Demote Void = Void
type Sing Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Sing = SVoid
type Sconcat (arg :: NonEmpty Void) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Sconcat (arg :: NonEmpty Void)
type Show_ (arg :: Void) Source #
Instance details Defined in Data.Singletons.Prelude.Show type Show_ (arg :: Void)
type (a :: Void) == (b :: Void) Source #
Instance details Defined in Data.Singletons.Prelude.Eq type (a :: Void) == (b :: Void)
type (x :: Void) /= (y :: Void) Source #
Instance details Defined in Data.Singletons.Prelude.Eq type (x :: Void) /= (y :: Void) = Not (x == y)
type Compare (a1 :: Void) (a2 :: Void) Source #
Instance details Defined in Data.Singletons.Prelude.Ord type Compare (a1 :: Void) (a2 :: Void)
type (arg1 :: Void) < (arg2 :: Void) Source #
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Void) < (arg2 :: Void)
type (arg1 :: Void) <= (arg2 :: Void) Source #
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Void) <= (arg2 :: Void)
type (arg1 :: Void) > (arg2 :: Void) Source #
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Void) > (arg2 :: Void)
type (arg1 :: Void) >= (arg2 :: Void) Source #
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Void) >= (arg2 :: Void)
type Max (arg1 :: Void) (arg2 :: Void) Source #
Instance details Defined in Data.Singletons.Prelude.Ord type Max (arg1 :: Void) (arg2 :: Void)
type Min (arg1 :: Void) (arg2 :: Void) Source #
Instance details Defined in Data.Singletons.Prelude.Ord type Min (arg1 :: Void) (arg2 :: Void)
type (a1 :: Void) <> (a2 :: Void) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type (a1 :: Void) <> (a2 :: Void)
type ShowList (arg1 :: [Void]) arg2 Source #
Instance details Defined in Data.Singletons.Prelude.Show type ShowList (arg1 :: [Void]) arg2
type ShowsPrec a1 (a2 :: Void) a3 Source #
Instance details Defined in Data.Singletons.Prelude.Show type ShowsPrec a1 (a2 :: Void) a3
type Apply (AbsurdSym0 :: TyFun Void k2 -> Type) (a6989586621679359469 :: Void) Source #
Instance details Defined in Data.Singletons.Prelude.Void type Apply (AbsurdSym0 :: TyFun Void k2 -> Type) (a6989586621679359469 :: Void) = AbsurdSym1 a6989586621679359469 :: k2

type Refuted a = a -> Void Source #

Because we can never create a value of type Void, a function that type-checks at a -> Void shows that objects of type a can never exist. Thus, we say that a is Refuted

data Decision a Source #

A Decision about a type a is either a proof of existence or a proof that a cannot exist.

Constructors

Proved a	Witness for `a`
Disproved (Refuted a)	Proof that no `a` exists

class PBounded a Source #

Associated Types

type MinBound :: a Source #

type MaxBound :: a Source #

Instances

Instances details

PBounded Bool Source #
Instance details Defined in Data.Singletons.Prelude.Enum Associated Types type MinBound :: a Source # type MaxBound :: a Source #
PBounded Ordering Source #
Instance details Defined in Data.Singletons.Prelude.Enum Associated Types type MinBound :: a Source # type MaxBound :: a Source #
PBounded () Source #
Instance details Defined in Data.Singletons.Prelude.Enum Associated Types type MinBound :: a Source # type MaxBound :: a Source #
PBounded All Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type MinBound :: a Source # type MaxBound :: a Source #
PBounded Any Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type MinBound :: a Source # type MaxBound :: a Source #
PBounded (Min a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type MinBound :: a Source # type MaxBound :: a Source #
PBounded (Max a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type MinBound :: a Source # type MaxBound :: a Source #
PBounded (First a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type MinBound :: a Source # type MaxBound :: a Source #
PBounded (Last a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type MinBound :: a Source # type MaxBound :: a Source #
PBounded (WrappedMonoid m) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type MinBound :: a Source # type MaxBound :: a Source #
PBounded (Identity a) Source #
Instance details Defined in Data.Singletons.Prelude.Enum Associated Types type MinBound :: a Source # type MaxBound :: a Source #
PBounded (Dual a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type MinBound :: a Source # type MaxBound :: a Source #
PBounded (Sum a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type MinBound :: a Source # type MaxBound :: a Source #
PBounded (Product a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type MinBound :: a Source # type MaxBound :: a Source #
PBounded (a, b) Source #
Instance details Defined in Data.Singletons.Prelude.Enum Associated Types type MinBound :: a Source # type MaxBound :: a Source #
PBounded (Proxy s) Source #
Instance details Defined in Data.Singletons.Prelude.Proxy Associated Types type MinBound :: a Source # type MaxBound :: a Source #
PBounded (a, b, c) Source #
Instance details Defined in Data.Singletons.Prelude.Enum Associated Types type MinBound :: a Source # type MaxBound :: a Source #
PBounded (Const a b) Source #
Instance details Defined in Data.Singletons.Prelude.Const Associated Types type MinBound :: a Source # type MaxBound :: a Source #
PBounded (a, b, c, d) Source #
Instance details Defined in Data.Singletons.Prelude.Enum Associated Types type MinBound :: a Source # type MaxBound :: a Source #
PBounded (a, b, c, d, e) Source #
Instance details Defined in Data.Singletons.Prelude.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.Prelude.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.Prelude.Enum Associated Types type MinBound :: a Source # type MaxBound :: a Source #

class SBounded a where Source #

Methods

sMinBound :: Sing (MinBoundSym0 :: a) Source #

sMaxBound :: Sing (MaxBoundSym0 :: a) Source #

Instances

Instances details

SBounded Bool Source #
Instance details Defined in Data.Singletons.Prelude.Enum Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
SBounded Ordering Source #
Instance details Defined in Data.Singletons.Prelude.Enum Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
SBounded () Source #
Instance details Defined in Data.Singletons.Prelude.Enum Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
SBounded Bool => SBounded All Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
SBounded Bool => SBounded Any Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
SBounded a => SBounded (Min a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
SBounded a => SBounded (Max a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
SBounded a => SBounded (First a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
SBounded a => SBounded (Last a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
SBounded m => SBounded (WrappedMonoid m) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
SBounded a => SBounded (Identity a) Source #
Instance details Defined in Data.Singletons.Prelude.Enum Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
SBounded a => SBounded (Dual a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
SBounded a => SBounded (Sum a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
SBounded a => SBounded (Product a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
(SBounded a, SBounded b) => SBounded (a, b) Source #
Instance details Defined in Data.Singletons.Prelude.Enum Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
SBounded (Proxy s) Source #
Instance details Defined in Data.Singletons.Prelude.Proxy Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
(SBounded a, SBounded b, SBounded c) => SBounded (a, b, c) Source #
Instance details Defined in Data.Singletons.Prelude.Enum Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
SBounded a => SBounded (Const a b) Source #
Instance details Defined in Data.Singletons.Prelude.Const Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
(SBounded a, SBounded b, SBounded c, SBounded d) => SBounded (a, b, c, d) Source #
Instance details Defined in Data.Singletons.Prelude.Enum Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
(SBounded a, SBounded b, SBounded c, SBounded d, SBounded e) => SBounded (a, b, c, d, e) Source #
Instance details Defined in Data.Singletons.Prelude.Enum Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
(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.Prelude.Enum Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #
(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.Prelude.Enum Methods sMinBound :: Sing MinBoundSym0 Source # sMaxBound :: Sing MaxBoundSym0 Source #

class PEnum a Source #

Associated Types

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

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

Instances

Instances details

PEnum Bool Source #
Instance details Defined in Data.Singletons.Prelude.Enum Associated Types type Succ arg :: a Source # type Pred arg :: a Source # type ToEnum arg :: a Source # type FromEnum arg :: Nat Source # type EnumFromTo arg arg :: [a] Source # type EnumFromThenTo arg arg arg :: [a] Source #
PEnum Ordering Source #
Instance details Defined in Data.Singletons.Prelude.Enum Associated Types type Succ arg :: a Source # type Pred arg :: a Source # type ToEnum arg :: a Source # type FromEnum arg :: Nat Source # type EnumFromTo arg arg :: [a] Source # type EnumFromThenTo arg arg arg :: [a] Source #
PEnum Nat Source #
Instance details Defined in Data.Singletons.Prelude.Enum Associated Types type Succ arg :: a Source # type Pred arg :: a Source # type ToEnum arg :: a Source # type FromEnum arg :: Nat Source # type EnumFromTo arg arg :: [a] Source # type EnumFromThenTo arg arg arg :: [a] Source #
PEnum () Source #
Instance details Defined in Data.Singletons.Prelude.Enum Associated Types type Succ arg :: a Source # type Pred arg :: a Source # type ToEnum arg :: a Source # type FromEnum arg :: Nat Source # type EnumFromTo arg arg :: [a] Source # type EnumFromThenTo arg arg arg :: [a] Source #
PEnum (Min a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Succ arg :: a Source # type Pred arg :: a Source # type ToEnum arg :: a Source # type FromEnum arg :: Nat Source # type EnumFromTo arg arg :: [a] Source # type EnumFromThenTo arg arg arg :: [a] Source #
PEnum (Max a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Succ arg :: a Source # type Pred arg :: a Source # type ToEnum arg :: a Source # type FromEnum arg :: Nat Source # type EnumFromTo arg arg :: [a] Source # type EnumFromThenTo arg arg arg :: [a] Source #
PEnum (First a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Succ arg :: a Source # type Pred arg :: a Source # type ToEnum arg :: a Source # type FromEnum arg :: Nat Source # type EnumFromTo arg arg :: [a] Source # type EnumFromThenTo arg arg arg :: [a] Source #
PEnum (Last a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Succ arg :: a Source # type Pred arg :: a Source # type ToEnum arg :: a Source # type FromEnum arg :: Nat Source # type EnumFromTo arg arg :: [a] Source # type EnumFromThenTo arg arg arg :: [a] Source #
PEnum (WrappedMonoid a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Succ arg :: a Source # type Pred arg :: a Source # type ToEnum arg :: a Source # type FromEnum arg :: Nat Source # type EnumFromTo arg arg :: [a] Source # type EnumFromThenTo arg arg arg :: [a] Source #
PEnum (Identity a) Source #
Instance details Defined in Data.Singletons.Prelude.Identity Associated Types type Succ arg :: a Source # type Pred arg :: a Source # type ToEnum arg :: a Source # type FromEnum arg :: Nat Source # type EnumFromTo arg arg :: [a] Source # type EnumFromThenTo arg arg arg :: [a] Source #
PEnum (Proxy s) Source #
Instance details Defined in Data.Singletons.Prelude.Proxy Associated Types type Succ arg :: a Source # type Pred arg :: a Source # type ToEnum arg :: a Source # type FromEnum arg :: Nat Source # type EnumFromTo arg arg :: [a] Source # type EnumFromThenTo arg arg arg :: [a] Source #
PEnum (Const a b) Source #
Instance details Defined in Data.Singletons.Prelude.Const Associated Types type Succ arg :: a Source # type Pred arg :: a Source # type ToEnum arg :: a Source # type FromEnum arg :: Nat Source # type EnumFromTo arg arg :: [a] Source # type EnumFromThenTo arg arg arg :: [a] Source #

class SEnum a where Source #

Methods

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

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

Instances

Instances details

SEnum Bool Source #
Instance details Defined in Data.Singletons.Prelude.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 :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) Source # sFromEnum :: forall (t :: Bool). Sing t -> Sing (Apply FromEnumSym0 t) Source # sEnumFromTo :: forall (t :: Bool) (t :: Bool). Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t) Source # sEnumFromThenTo :: forall (t :: Bool) (t :: Bool) (t :: Bool). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t) Source #
SEnum Ordering Source #
Instance details Defined in Data.Singletons.Prelude.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 :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) Source # sFromEnum :: forall (t :: Ordering). Sing t -> Sing (Apply FromEnumSym0 t) Source # sEnumFromTo :: forall (t :: Ordering) (t :: Ordering). Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t) Source # sEnumFromThenTo :: forall (t :: Ordering) (t :: Ordering) (t :: Ordering). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t) Source #
SEnum Nat Source #
Instance details Defined in Data.Singletons.Prelude.Enum Methods sSucc :: forall (t :: Nat). Sing t -> Sing (Apply SuccSym0 t) Source # sPred :: forall (t :: Nat). Sing t -> Sing (Apply PredSym0 t) Source # sToEnum :: forall (t :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) Source # sFromEnum :: forall (t :: Nat). Sing t -> Sing (Apply FromEnumSym0 t) Source # sEnumFromTo :: forall (t :: Nat) (t :: Nat). Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t) Source # sEnumFromThenTo :: forall (t :: Nat) (t :: Nat) (t :: Nat). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t) Source #
SEnum () Source #
Instance details Defined in Data.Singletons.Prelude.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 :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) Source # sFromEnum :: forall (t :: ()). Sing t -> Sing (Apply FromEnumSym0 t) Source # sEnumFromTo :: forall (t :: ()) (t :: ()). Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t) Source # sEnumFromThenTo :: forall (t :: ()) (t :: ()) (t :: ()). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t) Source #
SEnum a => SEnum (Min a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup 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 :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) Source # sFromEnum :: forall (t :: Min a). Sing t -> Sing (Apply FromEnumSym0 t) Source # sEnumFromTo :: forall (t :: Min a) (t :: Min a). Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t) Source # sEnumFromThenTo :: forall (t :: Min a) (t :: Min a) (t :: Min a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t) Source #
SEnum a => SEnum (Max a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup 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 :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) Source # sFromEnum :: forall (t :: Max a). Sing t -> Sing (Apply FromEnumSym0 t) Source # sEnumFromTo :: forall (t :: Max a) (t :: Max a). Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t) Source # sEnumFromThenTo :: forall (t :: Max a) (t :: Max a) (t :: Max a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t) Source #
SEnum a => SEnum (First a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup 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 :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) Source # sFromEnum :: forall (t :: First a). Sing t -> Sing (Apply FromEnumSym0 t) Source # sEnumFromTo :: forall (t :: First a) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t) Source # sEnumFromThenTo :: forall (t :: First a) (t :: First a) (t :: First a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t) Source #
SEnum a => SEnum (Last a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup 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 :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) Source # sFromEnum :: forall (t :: Last a). Sing t -> Sing (Apply FromEnumSym0 t) Source # sEnumFromTo :: forall (t :: Last a) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t) Source # sEnumFromThenTo :: forall (t :: Last a) (t :: Last a) (t :: Last a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t) Source #
SEnum a => SEnum (WrappedMonoid a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup 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 :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) Source # sFromEnum :: forall (t :: WrappedMonoid a). Sing t -> Sing (Apply FromEnumSym0 t) Source # sEnumFromTo :: forall (t :: WrappedMonoid a) (t :: WrappedMonoid a). Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t) Source # sEnumFromThenTo :: forall (t :: WrappedMonoid a) (t :: WrappedMonoid a) (t :: WrappedMonoid a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t) Source #
SEnum a => SEnum (Identity a) Source #
Instance details Defined in Data.Singletons.Prelude.Identity 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 :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) Source # sFromEnum :: forall (t :: Identity a). Sing t -> Sing (Apply FromEnumSym0 t) Source # sEnumFromTo :: forall (t :: Identity a) (t :: Identity a). Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t) Source # sEnumFromThenTo :: forall (t :: Identity a) (t :: Identity a) (t :: Identity a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t) Source #
SEnum (Proxy s) Source #
Instance details Defined in Data.Singletons.Prelude.Proxy 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 :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) Source # sFromEnum :: forall (t :: Proxy s). Sing t -> Sing (Apply FromEnumSym0 t) Source # sEnumFromTo :: forall (t :: Proxy s) (t :: Proxy s). Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t) Source # sEnumFromThenTo :: forall (t :: Proxy s) (t :: Proxy s) (t :: Proxy s). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t) Source #
SEnum a => SEnum (Const a b) Source #
Instance details Defined in Data.Singletons.Prelude.Const 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 :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) Source # sFromEnum :: forall (t :: Const a b). Sing t -> Sing (Apply FromEnumSym0 t) Source # sEnumFromTo :: forall (t :: Const a b) (t :: Const a b). Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t) Source # sEnumFromThenTo :: forall (t :: Const a b) (t :: Const a b) (t :: Const a b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t) Source #

class PShow a Source #

Associated Types

type ShowsPrec (arg :: Nat) (arg :: a) (arg :: Symbol) :: Symbol Source #

type ShowsPrec a a a = Apply (Apply (Apply ShowsPrec_6989586621680279582Sym0 a) a) a

type Show_ (arg :: a) :: Symbol Source #

type Show_ a = Apply Show__6989586621680279594Sym0 a

type ShowList (arg :: [a]) (arg :: Symbol) :: Symbol Source #

type ShowList a a = Apply (Apply ShowList_6989586621680279602Sym0 a) a

Instances

Instances details

PShow Bool Source #
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow Ordering Source #
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow Nat Source #
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow Symbol Source #
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow () Source #
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow Void Source #
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow All Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow Any Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow [a] Source #
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (Maybe a) Source #
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (Min a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (Max a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (First a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (Last a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (WrappedMonoid m) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (Option a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (Identity a) Source #
Instance details Defined in Data.Singletons.Prelude.Identity Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (First a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (Last a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (Dual a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (Sum a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (Product a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (NonEmpty a) Source #
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (Either a b) Source #
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (a, b) Source #
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (Arg a b) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (Proxy s) Source #
Instance details Defined in Data.Singletons.Prelude.Proxy Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (a, b, c) Source #
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (Const a b) Source #
Instance details Defined in Data.Singletons.Prelude.Const Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (a, b, c, d) Source #
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (a, b, c, d, e) Source #
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (a, b, c, d, e, f) Source #
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #
PShow (a, b, c, d, e, f, g) Source #
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg arg :: Symbol Source # type Show_ arg :: Symbol Source # type ShowList arg arg :: Symbol Source #

class SShow a where Source #

Minimal complete definition

Nothing

Methods

sShowsPrec :: forall (t :: Nat) (t :: a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t :: Symbol) Source #

default sShowsPrec :: forall (t :: Nat) (t :: a) (t :: Symbol). (Apply (Apply (Apply ShowsPrecSym0 t) t) t :: Symbol) ~ Apply (Apply (Apply ShowsPrec_6989586621680279582Sym0 t) t) t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t :: Symbol) Source #

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

default sShow_ :: forall (t :: a). (Apply Show_Sym0 t :: Symbol) ~ Apply Show__6989586621680279594Sym0 t => Sing t -> Sing (Apply Show_Sym0 t :: Symbol) Source #

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

default sShowList :: forall (t :: [a]) (t :: Symbol). (Apply (Apply ShowListSym0 t) t :: Symbol) ~ Apply (Apply ShowList_6989586621680279602Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t :: Symbol) Source #

Instances

Instances details

SShow Bool Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t :: Nat) (t :: Bool) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Bool). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Bool]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow Ordering Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t :: Nat) (t :: Ordering) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Ordering). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Ordering]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow Nat Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t :: Nat) (t :: Nat) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Nat). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Nat]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow Symbol Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t :: Nat) (t :: Symbol) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Symbol). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Symbol]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow () Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t :: Nat) (t :: ()) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: ()). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [()]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow Void Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t :: Nat) (t :: Void) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Void). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Void]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow Bool => SShow All Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sShowsPrec :: forall (t :: Nat) (t :: All) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: All). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [All]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow Bool => SShow Any Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sShowsPrec :: forall (t :: Nat) (t :: Any) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Any). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Any]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow a => SShow [a] Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t :: Nat) (t :: [a]) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: [a]). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [[a]]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow a => SShow (Maybe a) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t :: Nat) (t :: Maybe a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Maybe a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Maybe a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow a => SShow (Min a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sShowsPrec :: forall (t :: Nat) (t :: Min a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Min a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Min a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow a => SShow (Max a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sShowsPrec :: forall (t :: Nat) (t :: Max a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Max a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Max a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow a => SShow (First a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sShowsPrec :: forall (t :: Nat) (t :: First a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: First a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [First a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow a => SShow (Last a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sShowsPrec :: forall (t :: Nat) (t :: Last a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Last a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Last a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow m => SShow (WrappedMonoid m) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sShowsPrec :: forall (t :: Nat) (t :: WrappedMonoid m) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: WrappedMonoid m). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [WrappedMonoid m]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow (Maybe a) => SShow (Option a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sShowsPrec :: forall (t :: Nat) (t :: Option a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Option a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Option a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow a => SShow (Identity a) Source #
Instance details Defined in Data.Singletons.Prelude.Identity Methods sShowsPrec :: forall (t :: Nat) (t :: Identity a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Identity a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Identity a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow (Maybe a) => SShow (First a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sShowsPrec :: forall (t :: Nat) (t :: First a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: First a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [First a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow (Maybe a) => SShow (Last a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sShowsPrec :: forall (t :: Nat) (t :: Last a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Last a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Last a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow a => SShow (Dual a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sShowsPrec :: forall (t :: Nat) (t :: Dual a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Dual a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Dual a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow a => SShow (Sum a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sShowsPrec :: forall (t :: Nat) (t :: Sum a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Sum a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Sum a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow a => SShow (Product a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sShowsPrec :: forall (t :: Nat) (t :: Product a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Product a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Product a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
(SShow a, SShow [a]) => SShow (NonEmpty a) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t :: Nat) (t :: NonEmpty a) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: NonEmpty a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [NonEmpty a]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
(SShow a, SShow b) => SShow (Either a b) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t :: Nat) (t :: Either a b) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Either a b). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Either a b]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
(SShow a, SShow b) => SShow (a, b) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t :: Nat) (t :: (a, b)) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: (a, b)). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [(a, b)]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
(SShow a, SShow b) => SShow (Arg a b) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sShowsPrec :: forall (t :: Nat) (t :: Arg a b) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Arg a b). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Arg a b]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow (Proxy s) Source #
Instance details Defined in Data.Singletons.Prelude.Proxy Methods sShowsPrec :: forall (t :: Nat) (t :: Proxy s) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Proxy s). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Proxy s]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
(SShow a, SShow b, SShow c) => SShow (a, b, c) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t :: Nat) (t :: (a, b, c)) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: (a, b, c)). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [(a, b, c)]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
SShow a => SShow (Const a b) Source #
Instance details Defined in Data.Singletons.Prelude.Const Methods sShowsPrec :: forall (t :: Nat) (t :: Const a b) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: Const a b). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [Const a b]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
(SShow a, SShow b, SShow c, SShow d) => SShow (a, b, c, d) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t :: Nat) (t :: (a, b, c, d)) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: (a, b, c, d)). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [(a, b, c, d)]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #
(SShow a, SShow b, SShow c, SShow d, SShow e) => SShow (a, b, c, d, e) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t :: Nat) (t :: (a, b, c, d, e)) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: (a, b, c, d, e)). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [(a, b, c, d, e)]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) 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 Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t :: Nat) (t :: (a, b, c, d, e, f)) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: (a, b, c, d, e, f)). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [(a, b, c, d, e, f)]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) 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 Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t :: Nat) (t :: (a, b, c, d, e, f, g)) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowsPrecSym0 t) t) t) Source # sShow_ :: forall (t :: (a, b, c, d, e, f, g)). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t :: [(a, b, c, d, e, f, g)]) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowListSym0 t) t) Source #

type family ShowString a a where ... Source #

Equations

ShowString a_6989586621680279516 a_6989586621680279518 = Apply (Apply (<>@#@$) a_6989586621680279516) a_6989586621680279518

sShowString :: forall (t :: Symbol) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowStringSym0 t) t :: Symbol) Source #

type family ShowParen a a a where ... Source #

Equations

ShowParen b p a_6989586621680279501 = Apply (Case_6989586621680279513 b p a_6989586621680279501 b) a_6989586621680279501

sShowParen :: forall (t :: Bool) (t :: (~>) Symbol Symbol) (t :: Symbol). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ShowParenSym0 t) t) t :: Symbol) Source #

type family ShowSpace a where ... Source #

Equations

ShowSpace a_6989586621680279491 = Apply (Apply Lambda_6989586621680279497Sym0 a_6989586621680279491) a_6989586621680279491

sShowSpace :: forall (t :: Symbol). Sing t -> Sing (Apply ShowSpaceSym0 t :: Symbol) Source #

type family ShowChar a a where ... Source #

Equations

ShowChar a_6989586621680279527 a_6989586621680279529 = Apply (Apply (<>@#@$) a_6989586621680279527) a_6989586621680279529

sShowChar :: forall (t :: Symbol) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowCharSym0 t) t :: Symbol) Source #

type family ShowCommaSpace a where ... Source #

Equations

ShowCommaSpace a_6989586621680279485 = Apply (Apply ShowStringSym0 ", ") a_6989586621680279485

sShowCommaSpace :: forall (t :: Symbol). Sing t -> Sing (Apply ShowCommaSpaceSym0 t :: Symbol) Source #

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_6989586621679559676Sym0 a) a

Instances

Instances details

PFunctor [] Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Fmap arg arg :: f b Source # type arg <$ arg :: f a Source #
PFunctor Maybe Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Fmap arg arg :: f b Source # type arg <$ arg :: f a Source #
PFunctor Min Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Fmap arg arg :: f b Source # type arg <$ arg :: f a Source #
PFunctor Max Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Fmap arg arg :: f b Source # type arg <$ arg :: f a Source #
PFunctor First Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Fmap arg arg :: f b Source # type arg <$ arg :: f a Source #
PFunctor Last Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Fmap arg arg :: f b Source # type arg <$ arg :: f a Source #
PFunctor Option Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Fmap arg arg :: f b Source # type arg <$ arg :: f a Source #
PFunctor Identity Source #
Instance details Defined in Data.Singletons.Prelude.Identity Associated Types type Fmap arg arg :: f b Source # type arg <$ arg :: f a Source #
PFunctor First Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Fmap arg arg :: f b Source # type arg <$ arg :: f a Source #
PFunctor Last Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Fmap arg arg :: f b Source # type arg <$ arg :: f a Source #
PFunctor Dual Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type Fmap arg arg :: f b Source # type arg <$ arg :: f a Source #
PFunctor Sum Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type Fmap arg arg :: f b Source # type arg <$ arg :: f a Source #
PFunctor Product Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type Fmap arg arg :: f b Source # type arg <$ arg :: f a Source #
PFunctor Down Source #
Instance details Defined in Data.Singletons.Prelude.Functor Associated Types type Fmap arg arg :: f b Source # type arg <$ arg :: f a Source #
PFunctor NonEmpty Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Fmap arg arg :: f b Source # type arg <$ arg :: f a Source #
PFunctor (Either a) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Fmap arg arg :: f b Source # type arg <$ arg :: f a Source #
PFunctor ((,) a) Source #
Instance details Defined in Data.Singletons.Prelude.Functor Associated Types type Fmap arg arg :: f b Source # type arg <$ arg :: f a Source #
PFunctor (Arg a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Fmap arg arg :: f b Source # type arg <$ arg :: f a Source #
PFunctor (Proxy :: Type -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Proxy Associated Types type Fmap arg arg :: f b Source # type arg <$ arg :: f a Source #
PFunctor (Const m :: Type -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Const Associated Types type Fmap arg arg :: f b Source # type arg <$ arg :: f a Source #

class SFunctor f where Source #

Minimal complete definition

sFmap

Methods

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

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

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

Instances

Instances details

SFunctor [] Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sFmap :: forall a b (t :: a ~> b) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source # (%<$) :: forall a b (t :: a) (t :: [b]). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #
SFunctor Maybe Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sFmap :: forall a b (t :: a ~> b) (t :: Maybe a). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source # (%<$) :: forall a b (t :: a) (t :: Maybe b). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #
SFunctor Min Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sFmap :: forall a b (t :: a ~> b) (t :: Min a). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source # (%<$) :: forall a b (t :: a) (t :: Min b). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #
SFunctor Max Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sFmap :: forall a b (t :: a ~> b) (t :: Max a). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source # (%<$) :: forall a b (t :: a) (t :: Max b). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #
SFunctor First Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sFmap :: forall a b (t :: a ~> b) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source # (%<$) :: forall a b (t :: a) (t :: First b). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #
SFunctor Last Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sFmap :: forall a b (t :: a ~> b) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source # (%<$) :: forall a b (t :: a) (t :: Last b). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #
SFunctor Option Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sFmap :: forall a b (t :: a ~> b) (t :: Option a). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source # (%<$) :: forall a b (t :: a) (t :: Option b). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #
SFunctor Identity Source #
Instance details Defined in Data.Singletons.Prelude.Identity Methods sFmap :: forall a b (t :: a ~> b) (t :: Identity a). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source # (%<$) :: forall a b (t :: a) (t :: Identity b). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #
SFunctor First Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sFmap :: forall a b (t :: a ~> b) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source # (%<$) :: forall a b (t :: a) (t :: First b). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #
SFunctor Last Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sFmap :: forall a b (t :: a ~> b) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source # (%<$) :: forall a b (t :: a) (t :: Last b). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #
SFunctor Dual Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sFmap :: forall a b (t :: a ~> b) (t :: Dual a). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source # (%<$) :: forall a b (t :: a) (t :: Dual b). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #
SFunctor Sum Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sFmap :: forall a b (t :: a ~> b) (t :: Sum a). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source # (%<$) :: forall a b (t :: a) (t :: Sum b). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #
SFunctor Product Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sFmap :: forall a b (t :: a ~> b) (t :: Product a). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source # (%<$) :: forall a b (t :: a) (t :: Product b). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #
SFunctor Down Source #
Instance details Defined in Data.Singletons.Prelude.Functor Methods sFmap :: forall a b (t :: a ~> b) (t :: Down a). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source # (%<$) :: forall a b (t :: a) (t :: Down b). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #
SFunctor NonEmpty Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sFmap :: forall a b (t :: a ~> b) (t :: NonEmpty a). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source # (%<$) :: forall a b (t :: a) (t :: NonEmpty b). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #
SFunctor (Either a) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sFmap :: forall a0 b (t :: a0 ~> b) (t :: Either a a0). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source # (%<$) :: forall a0 b (t :: a0) (t :: Either a b). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #
SFunctor ((,) a) Source #
Instance details Defined in Data.Singletons.Prelude.Functor Methods sFmap :: forall a0 b (t :: a0 ~> b) (t :: (a, a0)). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source # (%<$) :: forall a0 b (t :: a0) (t :: (a, b)). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #
SFunctor (Arg a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sFmap :: forall a0 b (t :: a0 ~> b) (t :: Arg a a0). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source # (%<$) :: forall a0 b (t :: a0) (t :: Arg a b). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #
SFunctor (Proxy :: Type -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Proxy Methods sFmap :: forall a b (t :: a ~> b) (t :: Proxy a). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source # (%<$) :: forall a b (t :: a) (t :: Proxy b). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #
SFunctor (Const m :: Type -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Const Methods sFmap :: forall a b (t :: a ~> b) (t :: Const m a). Sing t -> Sing t -> Sing (Apply (Apply FmapSym0 t) t) Source # (%<$) :: forall a b (t :: a) (t :: Const m b). Sing t -> Sing t -> Sing (Apply (Apply (<$@#@$) t) t) Source #

class PFoldable t Source #

Associated Types

type Fold (arg :: t m) :: m Source #

type Fold a = Apply Fold_6989586621680492512Sym0 a

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

type FoldMap a a = Apply (Apply FoldMap_6989586621680492522Sym0 a) a

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

type Foldr a a a = Apply (Apply (Apply Foldr_6989586621680492536Sym0 a) a) a

type Foldr' (arg :: (~>) a ((~>) b b)) (arg :: b) (arg :: t a) :: b Source #

type Foldr' a a a = Apply (Apply (Apply Foldr'_6989586621680492551Sym0 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_6989586621680492574Sym0 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'_6989586621680492589Sym0 a) a) a

type Foldr1 (arg :: (~>) a ((~>) a a)) (arg :: t a) :: a Source #

type Foldr1 a a = Apply (Apply Foldr1_6989586621680492611Sym0 a) a

type Foldl1 (arg :: (~>) a ((~>) a a)) (arg :: t a) :: a Source #

type Foldl1 a a = Apply (Apply Foldl1_6989586621680492632Sym0 a) a

type ToList (arg :: t a) :: [a] Source #

type ToList a = Apply ToList_6989586621680492652Sym0 a

type Null (arg :: t a) :: Bool Source #

type Null a = Apply Null_6989586621680492661Sym0 a

type Length (arg :: t a) :: Nat Source #

type Length a = Apply Length_6989586621680492678Sym0 a

type Elem (arg :: a) (arg :: t a) :: Bool Source #

type Elem a a = Apply (Apply Elem_6989586621680492697Sym0 a) a

type Maximum (arg :: t a) :: a Source #

type Maximum a = Apply Maximum_6989586621680492711Sym0 a

type Minimum (arg :: t a) :: a Source #

type Minimum a = Apply Minimum_6989586621680492726Sym0 a

type Sum (arg :: t a) :: a Source #

type Sum a = Apply Sum_6989586621680492741Sym0 a

type Product (arg :: t a) :: a Source #

type Product a = Apply Product_6989586621680492750Sym0 a

Instances

Instances details

PFoldable [] Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Associated Types type Fold arg :: m Source # type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # type Minimum arg :: a Source # type Sum arg :: a Source # type Product arg :: a Source #
PFoldable Maybe Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Associated Types type Fold arg :: m Source # type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # type Minimum arg :: a Source # type Sum arg :: a Source # type Product arg :: a Source #
PFoldable Min Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Fold arg :: m Source # type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # type Minimum arg :: a Source # type Sum arg :: a Source # type Product arg :: a Source #
PFoldable Max Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Fold arg :: m Source # type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # type Minimum arg :: a Source # type Sum arg :: a Source # type Product arg :: a Source #
PFoldable First Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Fold arg :: m Source # type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # type Minimum arg :: a Source # type Sum arg :: a Source # type Product arg :: a Source #
PFoldable Last Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Fold arg :: m Source # type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # type Minimum arg :: a Source # type Sum arg :: a Source # type Product arg :: a Source #
PFoldable Option Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Fold arg :: m Source # type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # type Minimum arg :: a Source # type Sum arg :: a Source # type Product arg :: a Source #
PFoldable Identity Source #
Instance details Defined in Data.Singletons.Prelude.Identity Associated Types type Fold arg :: m Source # type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # type Minimum arg :: a Source # type Sum arg :: a Source # type Product arg :: a Source #
PFoldable First Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Associated Types type Fold arg :: m Source # type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # type Minimum arg :: a Source # type Sum arg :: a Source # type Product arg :: a Source #
PFoldable Last Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Associated Types type Fold arg :: m Source # type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # type Minimum arg :: a Source # type Sum arg :: a Source # type Product arg :: a Source #
PFoldable Dual Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Associated Types type Fold arg :: m Source # type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # type Minimum arg :: a Source # type Sum arg :: a Source # type Product arg :: a Source #
PFoldable Sum Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Associated Types type Fold arg :: m Source # type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # type Minimum arg :: a Source # type Sum arg :: a Source # type Product arg :: a Source #
PFoldable Product Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Associated Types type Fold arg :: m Source # type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # type Minimum arg :: a Source # type Sum arg :: a Source # type Product arg :: a Source #
PFoldable NonEmpty Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Associated Types type Fold arg :: m Source # type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # type Minimum arg :: a Source # type Sum arg :: a Source # type Product arg :: a Source #
PFoldable (Either a) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Associated Types type Fold arg :: m Source # type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # type Minimum arg :: a Source # type Sum arg :: a Source # type Product arg :: a Source #
PFoldable ((,) a) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Associated Types type Fold arg :: m Source # type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # type Minimum arg :: a Source # type Sum arg :: a Source # type Product arg :: a Source #
PFoldable (Arg a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Fold arg :: m Source # type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # type Minimum arg :: a Source # type Sum arg :: a Source # type Product arg :: a Source #
PFoldable (Proxy :: Type -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Associated Types type Fold arg :: m Source # type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # type Minimum arg :: a Source # type Sum arg :: a Source # type Product arg :: a Source #
PFoldable (Const m :: Type -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Const Associated Types type Fold arg :: m Source # type FoldMap arg arg :: m Source # type Foldr arg arg arg :: b Source # type Foldr' arg arg arg :: b Source # type Foldl arg arg arg :: b Source # type Foldl' arg arg arg :: b Source # type Foldr1 arg arg :: a Source # type Foldl1 arg arg :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg :: Bool Source # type Maximum arg :: a Source # type Minimum arg :: a Source # type Sum arg :: a Source # type Product arg :: a Source #

class SFoldable t where Source #

Minimal complete definition

Nothing

Methods

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

default sFold :: forall m (t :: t m). ((Apply FoldSym0 t :: m) ~ Apply Fold_6989586621680492512Sym0 t, SMonoid m) => Sing t -> Sing (Apply FoldSym0 t :: m) Source #

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

default sFoldMap :: forall a m (t :: (~>) a m) (t :: t a). ((Apply (Apply FoldMapSym0 t) t :: m) ~ Apply (Apply FoldMap_6989586621680492522Sym0 t) t, SMonoid m) => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t :: m) Source #

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

default sFoldr :: forall a b (t :: (~>) a ((~>) b b)) (t :: b) (t :: t a). (Apply (Apply (Apply FoldrSym0 t) t) t :: b) ~ Apply (Apply (Apply Foldr_6989586621680492536Sym0 t) t) t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t :: b) Source #

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

default sFoldr' :: forall a b (t :: (~>) a ((~>) b b)) (t :: b) (t :: t a). (Apply (Apply (Apply Foldr'Sym0 t) t) t :: b) ~ Apply (Apply (Apply Foldr'_6989586621680492551Sym0 t) t) t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t :: b) Source #

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

default sFoldl :: forall b a (t :: (~>) b ((~>) a b)) (t :: b) (t :: t a). (Apply (Apply (Apply FoldlSym0 t) t) t :: b) ~ Apply (Apply (Apply Foldl_6989586621680492574Sym0 t) t) t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t :: b) Source #

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

default sFoldl' :: forall b a (t :: (~>) b ((~>) a b)) (t :: b) (t :: t a). (Apply (Apply (Apply Foldl'Sym0 t) t) t :: b) ~ Apply (Apply (Apply Foldl'_6989586621680492589Sym0 t) t) t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t :: b) Source #

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

default sFoldr1 :: forall a (t :: (~>) a ((~>) a a)) (t :: t a). (Apply (Apply Foldr1Sym0 t) t :: a) ~ Apply (Apply Foldr1_6989586621680492611Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t :: a) Source #

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

default sFoldl1 :: forall a (t :: (~>) a ((~>) a a)) (t :: t a). (Apply (Apply Foldl1Sym0 t) t :: a) ~ Apply (Apply Foldl1_6989586621680492632Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t :: a) Source #

sToList :: forall a (t :: t a). Sing t -> Sing (Apply ToListSym0 t :: [a]) Source #

default sToList :: forall a (t :: t a). (Apply ToListSym0 t :: [a]) ~ Apply ToList_6989586621680492652Sym0 t => Sing t -> Sing (Apply ToListSym0 t :: [a]) Source #

sNull :: forall a (t :: t a). Sing t -> Sing (Apply NullSym0 t :: Bool) Source #

default sNull :: forall a (t :: t a). (Apply NullSym0 t :: Bool) ~ Apply Null_6989586621680492661Sym0 t => Sing t -> Sing (Apply NullSym0 t :: Bool) Source #

sLength :: forall a (t :: t a). Sing t -> Sing (Apply LengthSym0 t :: Nat) Source #

default sLength :: forall a (t :: t a). (Apply LengthSym0 t :: Nat) ~ Apply Length_6989586621680492678Sym0 t => Sing t -> Sing (Apply LengthSym0 t :: Nat) Source #

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

default sElem :: forall a (t :: a) (t :: t a). ((Apply (Apply ElemSym0 t) t :: Bool) ~ Apply (Apply Elem_6989586621680492697Sym0 t) t, SEq a) => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t :: Bool) 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_6989586621680492711Sym0 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_6989586621680492726Sym0 t, SOrd a) => Sing t -> Sing (Apply MinimumSym0 t :: a) Source #

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

default sSum :: forall a (t :: t a). ((Apply SumSym0 t :: a) ~ Apply Sum_6989586621680492741Sym0 t, SNum a) => Sing t -> Sing (Apply SumSym0 t :: a) Source #

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

default sProduct :: forall a (t :: t a). ((Apply ProductSym0 t :: a) ~ Apply Product_6989586621680492750Sym0 t, SNum a) => Sing t -> Sing (Apply ProductSym0 t :: a) Source #

Instances

Instances details

SFoldable [] Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t :: [m]). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m (t :: a ~> m) (t :: [a]). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: [a]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: [a]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: [a]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: [a]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: [a]). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: [a]). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: [a]). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: [a]). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: [a]). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: [a]). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: [a]). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: [a]). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source #
SFoldable Maybe Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t :: Maybe m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m (t :: a ~> m) (t :: Maybe a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Maybe a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Maybe a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Maybe a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Maybe a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: Maybe a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: Maybe a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: Maybe a). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: Maybe a). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: Maybe a). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: Maybe a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: Maybe a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: Maybe a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: Maybe a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: Maybe a). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source #
SFoldable Min Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sFold :: forall m (t :: Min m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m (t :: a ~> m) (t :: Min a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Min a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Min a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Min a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Min a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: Min a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: Min a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: Min a). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: Min a). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: Min a). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: Min a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: Min a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: Min a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: Min a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: Min a). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source #
SFoldable Max Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sFold :: forall m (t :: Max m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m (t :: a ~> m) (t :: Max a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Max a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Max a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Max a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Max a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: Max a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: Max a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: Max a). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: Max a). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: Max a). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: Max a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: Max a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: Max a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: Max a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: Max a). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source #
SFoldable First Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sFold :: forall m (t :: First m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m (t :: a ~> m) (t :: First a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: First a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: First a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: First a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: First a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: First a). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: First a). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: First a). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: First a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: First a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: First a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: First a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: First a). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source #
SFoldable Last Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sFold :: forall m (t :: Last m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m (t :: a ~> m) (t :: Last a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Last a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Last a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Last a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Last a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: Last a). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: Last a). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: Last a). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: Last a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: Last a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: Last a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: Last a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: Last a). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source #
SFoldable Option Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sFold :: forall m (t :: Option m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m (t :: a ~> m) (t :: Option a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Option a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Option a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Option a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Option a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: Option a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: Option a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: Option a). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: Option a). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: Option a). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: Option a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: Option a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: Option a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: Option a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: Option a). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source #
SFoldable Identity Source #
Instance details Defined in Data.Singletons.Prelude.Identity Methods sFold :: forall m (t :: Identity m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m (t :: a ~> m) (t :: Identity a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Identity a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Identity a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Identity a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Identity a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: Identity a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: Identity a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: Identity a). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: Identity a). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: Identity a). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: Identity a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: Identity a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: Identity a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: Identity a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: Identity a). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source #
SFoldable First Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t :: First m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m (t :: a ~> m) (t :: First a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: First a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: First a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: First a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: First a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: First a). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: First a). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: First a). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: First a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: First a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: First a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: First a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: First a). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source #
SFoldable Last Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t :: Last m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m (t :: a ~> m) (t :: Last a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Last a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Last a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Last a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Last a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: Last a). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: Last a). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: Last a). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: Last a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: Last a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: Last a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: Last a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: Last a). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source #
SFoldable Dual Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t :: Dual m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m (t :: a ~> m) (t :: Dual a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Dual a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Dual a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Dual a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Dual a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: Dual a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: Dual a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: Dual a). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: Dual a). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: Dual a). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: Dual a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: Dual a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: Dual a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: Dual a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: Dual a). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source #
SFoldable Sum Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t :: Sum m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m (t :: a ~> m) (t :: Sum a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Sum a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Sum a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Sum a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Sum a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: Sum a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: Sum a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: Sum a). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: Sum a). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: Sum a). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: Sum a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: Sum a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: Sum a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: Sum a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: Sum a). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source #
SFoldable Product Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t :: Product m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m (t :: a ~> m) (t :: Product a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Product a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Product a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Product a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Product a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: Product a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: Product a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: Product a). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: Product a). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: Product a). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: Product a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: Product a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: Product a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: Product a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: Product a). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source #
SFoldable NonEmpty Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t :: NonEmpty m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m (t :: a ~> m) (t :: NonEmpty a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: NonEmpty a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: NonEmpty a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: NonEmpty a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: NonEmpty a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: NonEmpty a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: NonEmpty a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: NonEmpty a). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: NonEmpty a). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: NonEmpty a). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: NonEmpty a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: NonEmpty a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: NonEmpty a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: NonEmpty a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: NonEmpty a). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source #
SFoldable (Either a) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t :: Either a m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a0 m (t :: a0 ~> m) (t :: Either a a0). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a0 b (t :: a0 ~> (b ~> b)) (t :: b) (t :: Either a a0). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a0 b (t :: a0 ~> (b ~> b)) (t :: b) (t :: Either a a0). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a0 (t :: b ~> (a0 ~> b)) (t :: b) (t :: Either a a0). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a0 (t :: b ~> (a0 ~> b)) (t :: b) (t :: Either a a0). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a0 (t :: a0 ~> (a0 ~> a0)) (t :: Either a a0). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a0 (t :: a0 ~> (a0 ~> a0)) (t :: Either a a0). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a0 (t :: Either a a0). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a0 (t :: Either a a0). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a0 (t :: Either a a0). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a0 (t :: a0) (t :: Either a a0). SEq a0 => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a0 (t :: Either a a0). SOrd a0 => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a0 (t :: Either a a0). SOrd a0 => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a0 (t :: Either a a0). SNum a0 => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a0 (t :: Either a a0). SNum a0 => Sing t -> Sing (Apply ProductSym0 t) Source #
SFoldable ((,) a) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t :: (a, m)). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a0 m (t :: a0 ~> m) (t :: (a, a0)). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a0 b (t :: a0 ~> (b ~> b)) (t :: b) (t :: (a, a0)). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a0 b (t :: a0 ~> (b ~> b)) (t :: b) (t :: (a, a0)). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a0 (t :: b ~> (a0 ~> b)) (t :: b) (t :: (a, a0)). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a0 (t :: b ~> (a0 ~> b)) (t :: b) (t :: (a, a0)). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a0 (t :: a0 ~> (a0 ~> a0)) (t :: (a, a0)). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a0 (t :: a0 ~> (a0 ~> a0)) (t :: (a, a0)). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a0 (t :: (a, a0)). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a0 (t :: (a, a0)). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a0 (t :: (a, a0)). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a0 (t :: a0) (t :: (a, a0)). SEq a0 => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a0 (t :: (a, a0)). SOrd a0 => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a0 (t :: (a, a0)). SOrd a0 => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a0 (t :: (a, a0)). SNum a0 => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a0 (t :: (a, a0)). SNum a0 => Sing t -> Sing (Apply ProductSym0 t) Source #
SFoldable (Arg a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sFold :: forall m (t :: Arg a m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a0 m (t :: a0 ~> m) (t :: Arg a a0). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a0 b (t :: a0 ~> (b ~> b)) (t :: b) (t :: Arg a a0). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a0 b (t :: a0 ~> (b ~> b)) (t :: b) (t :: Arg a a0). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a0 (t :: b ~> (a0 ~> b)) (t :: b) (t :: Arg a a0). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a0 (t :: b ~> (a0 ~> b)) (t :: b) (t :: Arg a a0). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a0 (t :: a0 ~> (a0 ~> a0)) (t :: Arg a a0). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a0 (t :: a0 ~> (a0 ~> a0)) (t :: Arg a a0). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a0 (t :: Arg a a0). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a0 (t :: Arg a a0). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a0 (t :: Arg a a0). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a0 (t :: a0) (t :: Arg a a0). SEq a0 => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a0 (t :: Arg a a0). SOrd a0 => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a0 (t :: Arg a a0). SOrd a0 => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a0 (t :: Arg a a0). SNum a0 => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a0 (t :: Arg a a0). SNum a0 => Sing t -> Sing (Apply ProductSym0 t) Source #
SFoldable (Proxy :: Type -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t :: Proxy m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m (t :: a ~> m) (t :: Proxy a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Proxy a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Proxy a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Proxy a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Proxy a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: Proxy a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: Proxy a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: Proxy a). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: Proxy a). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: Proxy a). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: Proxy a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: Proxy a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: Proxy a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: Proxy a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: Proxy a). SNum a => Sing t -> Sing (Apply ProductSym0 t) Source #
SFoldable (Const m :: Type -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Const Methods sFold :: forall m0 (t :: Const m m0). SMonoid m0 => Sing t -> Sing (Apply FoldSym0 t) Source # sFoldMap :: forall a m0 (t :: a ~> m0) (t :: Const m a). SMonoid m0 => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t) Source # sFoldr :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Const m a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t) Source # sFoldr' :: forall a b (t :: a ~> (b ~> b)) (t :: b) (t :: Const m a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t) Source # sFoldl :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Const m a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t) Source # sFoldl' :: forall b a (t :: b ~> (a ~> b)) (t :: b) (t :: Const m a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t) Source # sFoldr1 :: forall a (t :: a ~> (a ~> a)) (t :: Const m a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t) Source # sFoldl1 :: forall a (t :: a ~> (a ~> a)) (t :: Const m a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t) Source # sToList :: forall a (t :: Const m a). Sing t -> Sing (Apply ToListSym0 t) Source # sNull :: forall a (t :: Const m a). Sing t -> Sing (Apply NullSym0 t) Source # sLength :: forall a (t :: Const m a). Sing t -> Sing (Apply LengthSym0 t) Source # sElem :: forall a (t :: a) (t :: Const m a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t) Source # sMaximum :: forall a (t :: Const m a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) Source # sMinimum :: forall a (t :: Const m a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) Source # sSum :: forall a (t :: Const m a). SNum a => Sing t -> Sing (Apply SumSym0 t) Source # sProduct :: forall a (t :: Const m a). SNum a => Sing t -> Sing (Apply ProductSym0 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_6989586621680347251Sym0 a) a

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

type Mconcat a = Apply Mconcat_6989586621680347265Sym0 a

Instances

Instances details

PMonoid Ordering Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid Symbol Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid () Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid All Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid Any Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid [a] Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid (Maybe a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid (Min a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid (Max a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid (WrappedMonoid m) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid (Option a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid (Identity a) Source #
Instance details Defined in Data.Singletons.Prelude.Identity Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid (First a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid (Last a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid (Dual a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid (Sum a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid (Product a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid (Down a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid (a, b) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid (Proxy s) Source #
Instance details Defined in Data.Singletons.Prelude.Proxy Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid (a ~> b) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid (a, b, c) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid (Const a b) Source #
Instance details Defined in Data.Singletons.Prelude.Const Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid (a, b, c, d) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #
PMonoid (a, b, c, d, e) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a Source # type Mappend arg arg :: a Source # type Mconcat arg :: a Source #

class SSemigroup a => SMonoid a where Source #

Minimal complete definition

sMempty

Methods

sMempty :: Sing (MemptySym0 :: a) Source #

sMappend :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t :: a) Source #

default sMappend :: forall (t :: a) (t :: a). (Apply (Apply MappendSym0 t) t :: a) ~ Apply (Apply Mappend_6989586621680347251Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t :: a) Source #

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

default sMconcat :: forall (t :: [a]). (Apply MconcatSym0 t :: a) ~ Apply Mconcat_6989586621680347265Sym0 t => Sing t -> Sing (Apply MconcatSym0 t :: a) Source #

Instances

Instances details

SMonoid Ordering Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: Ordering) (t :: Ordering). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [Ordering]). Sing t -> Sing (Apply MconcatSym0 t) Source #
SMonoid Symbol Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: Symbol) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [Symbol]). Sing t -> Sing (Apply MconcatSym0 t) Source #
SMonoid () Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: ()) (t :: ()). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [()]). Sing t -> Sing (Apply MconcatSym0 t) Source #
SMonoid All Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: All) (t :: All). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [All]). Sing t -> Sing (Apply MconcatSym0 t) Source #
SMonoid Any Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: Any) (t :: Any). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [Any]). Sing t -> Sing (Apply MconcatSym0 t) Source #
SMonoid [a] Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: [a]) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [[a]]). Sing t -> Sing (Apply MconcatSym0 t) Source #
SSemigroup a => SMonoid (Maybe a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: Maybe a) (t :: Maybe a). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [Maybe a]). Sing t -> Sing (Apply MconcatSym0 t) Source #
(SOrd a, SBounded a) => SMonoid (Min a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: Min a) (t :: Min a). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [Min a]). Sing t -> Sing (Apply MconcatSym0 t) Source #
(SOrd a, SBounded a) => SMonoid (Max a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: Max a) (t :: Max a). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [Max a]). Sing t -> Sing (Apply MconcatSym0 t) Source #
SMonoid m => SMonoid (WrappedMonoid m) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: WrappedMonoid m) (t :: WrappedMonoid m). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [WrappedMonoid m]). Sing t -> Sing (Apply MconcatSym0 t) Source #
SSemigroup a => SMonoid (Option a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: Option a) (t :: Option a). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [Option a]). Sing t -> Sing (Apply MconcatSym0 t) Source #
SMonoid a => SMonoid (Identity a) Source #
Instance details Defined in Data.Singletons.Prelude.Identity Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: Identity a) (t :: Identity a). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [Identity a]). Sing t -> Sing (Apply MconcatSym0 t) Source #
SMonoid (First a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: First a) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [First a]). Sing t -> Sing (Apply MconcatSym0 t) Source #
SMonoid (Last a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: Last a) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [Last a]). Sing t -> Sing (Apply MconcatSym0 t) Source #
SMonoid a => SMonoid (Dual a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: Dual a) (t :: Dual a). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [Dual a]). Sing t -> Sing (Apply MconcatSym0 t) Source #
SNum a => SMonoid (Sum a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: Sum a) (t :: Sum a). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [Sum a]). Sing t -> Sing (Apply MconcatSym0 t) Source #
SNum a => SMonoid (Product a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: Product a) (t :: Product a). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [Product a]). Sing t -> Sing (Apply MconcatSym0 t) Source #
SMonoid a => SMonoid (Down a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: Down a) (t :: Down a). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [Down a]). Sing t -> Sing (Apply MconcatSym0 t) Source #
(SMonoid a, SMonoid b) => SMonoid (a, b) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: (a, b)) (t :: (a, b)). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [(a, b)]). Sing t -> Sing (Apply MconcatSym0 t) Source #
SMonoid (Proxy s) Source #
Instance details Defined in Data.Singletons.Prelude.Proxy Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: Proxy s) (t :: Proxy s). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [Proxy s]). Sing t -> Sing (Apply MconcatSym0 t) Source #
SMonoid b => SMonoid (a ~> b) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: a ~> b) (t :: a ~> b). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [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.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: (a, b, c)) (t :: (a, b, c)). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [(a, b, c)]). Sing t -> Sing (Apply MconcatSym0 t) Source #
SMonoid a => SMonoid (Const a b) Source #
Instance details Defined in Data.Singletons.Prelude.Const Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: Const a b) (t :: Const a b). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [Const a b]). 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.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: (a, b, c, d)) (t :: (a, b, c, d)). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) 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.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 Source # sMappend :: forall (t :: (a, b, c, d, e)) (t :: (a, b, c, d, e)). Sing t -> Sing t -> Sing (Apply (Apply MappendSym0 t) t) Source # sMconcat :: forall (t :: [(a, b, c, d, e)]). Sing t -> Sing (Apply MconcatSym0 t) 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_6989586621680816757Sym0 a) a

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

type SequenceA a = Apply SequenceA_6989586621680816769Sym0 a

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

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

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

type Sequence a = Apply Sequence_6989586621680816793Sym0 a

Instances

Instances details

PTraversable [] Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable Maybe Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable Min Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable Max Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable First Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable Last Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable Option Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable Identity Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable First Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable Last Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable Dual Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable Sum Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable Product Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable NonEmpty Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable (Either a) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable ((,) a) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable (Arg a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable (Proxy :: Type -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable (Const m :: Type -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #

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

Minimal complete definition

Nothing

Methods

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

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

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

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

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

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

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

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

Instances

Instances details

STraversable [] Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: [a]). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: [f a]). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: [a]). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a (t :: [m a]). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #
STraversable Maybe Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: Maybe a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: Maybe (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: Maybe a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a (t :: Maybe (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #
STraversable Min Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: Min a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: Min (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: Min a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a (t :: Min (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #
STraversable Max Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: Max a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: Max (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: Max a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a (t :: Max (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #
STraversable First Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: First a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: First (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: First a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a (t :: First (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #
STraversable Last Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: Last a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: Last (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: Last a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a (t :: Last (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #
STraversable Option Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: Option a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: Option (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: Option a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a (t :: Option (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #
STraversable Identity Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: Identity a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: Identity (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: Identity a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a (t :: Identity (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #
STraversable First Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: First a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: First (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: First a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a (t :: First (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #
STraversable Last Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: Last a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: Last (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: Last a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a (t :: Last (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #
STraversable Dual Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: Dual a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: Dual (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: Dual a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a (t :: Dual (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #
STraversable Sum Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: Sum a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: Sum (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: Sum a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a (t :: Sum (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #
STraversable Product Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: Product a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: Product (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: Product a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a (t :: Product (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #
STraversable NonEmpty Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: NonEmpty a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: NonEmpty (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: NonEmpty a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a (t :: NonEmpty (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #
STraversable (Either a) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a0 (f :: Type -> Type) b (t :: a0 ~> f b) (t :: Either a a0). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a0 (t :: Either a (f a0)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a0 (m :: Type -> Type) b (t :: a0 ~> m b) (t :: Either a a0). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a0 (t :: Either a (m a0)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #
STraversable ((,) a) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a0 (f :: Type -> Type) b (t :: a0 ~> f b) (t :: (a, a0)). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a0 (t :: (a, f a0)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a0 (m :: Type -> Type) b (t :: a0 ~> m b) (t :: (a, a0)). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a0 (t :: (a, m a0)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #
STraversable (Arg a) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sTraverse :: forall a0 (f :: Type -> Type) b (t :: a0 ~> f b) (t :: Arg a a0). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a0 (t :: Arg a (f a0)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a0 (m :: Type -> Type) b (t :: a0 ~> m b) (t :: Arg a a0). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a0 (t :: Arg a (m a0)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #
STraversable (Proxy :: Type -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: Proxy a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: Proxy (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m :: Type -> Type) b (t :: a ~> m b) (t :: Proxy a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m :: Type -> Type) a (t :: Proxy (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) Source #
STraversable (Const m :: Type -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t :: a ~> f b) (t :: Const m a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t) Source # sSequenceA :: forall (f :: Type -> Type) a (t :: Const m (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) Source # sMapM :: forall a (m0 :: Type -> Type) b (t :: a ~> m0 b) (t :: Const m a). SMonad m0 => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t) Source # sSequence :: forall (m0 :: Type -> Type) a (t :: Const m (m0 a)). SMonad m0 => Sing t -> Sing (Apply SequenceSym0 t) Source #

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_6989586621679559716Sym0 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_6989586621679559732Sym0 a) a) a

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

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

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

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

Instances

Instances details

PApplicative [] Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Pure arg :: f a Source # type arg <> arg :: f b Source # type LiftA2 arg arg arg :: f c Source # type arg > arg :: f b Source # type arg <* arg :: f a Source #
PApplicative Maybe Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Pure arg :: f a Source # type arg <> arg :: f b Source # type LiftA2 arg arg arg :: f c Source # type arg > arg :: f b Source # type arg <* arg :: f a Source #
PApplicative Min Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Pure arg :: f a Source # type arg <> arg :: f b Source # type LiftA2 arg arg arg :: f c Source # type arg > arg :: f b Source # type arg <* arg :: f a Source #
PApplicative Max Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Pure arg :: f a Source # type arg <> arg :: f b Source # type LiftA2 arg arg arg :: f c Source # type arg > arg :: f b Source # type arg <* arg :: f a Source #
PApplicative First Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Pure arg :: f a Source # type arg <> arg :: f b Source # type LiftA2 arg arg arg :: f c Source # type arg > arg :: f b Source # type arg <* arg :: f a Source #
PApplicative Last Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Pure arg :: f a Source # type arg <> arg :: f b Source # type LiftA2 arg arg arg :: f c Source # type arg > arg :: f b Source # type arg <* arg :: f a Source #
PApplicative Option Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Associated Types type Pure arg :: f a Source # type arg <> arg :: f b Source # type LiftA2 arg arg arg :: f c Source # type arg > arg :: f b Source # type arg <* arg :: f a Source #
PApplicative Identity Source #
Instance details Defined in Data.Singletons.Prelude.Identity Associated Types type Pure arg :: f a Source # type arg <> arg :: f b Source # type LiftA2 arg arg arg :: f c Source # type arg > arg :: f b Source # type arg <* arg :: f a Source #
PApplicative First Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Pure arg :: f a Source # type arg <> arg :: f b Source # type LiftA2 arg arg arg :: f c Source # type arg > arg :: f b Source # type arg <* arg :: f a Source #
PApplicative Last Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Pure arg :: f a Source # type arg <> arg :: f b Source # type LiftA2 arg arg arg :: f c Source # type arg > arg :: f b Source # type arg <* arg :: f a Source #
PApplicative Dual Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type Pure arg :: f a Source # type arg <> arg :: f b Source # type LiftA2 arg arg arg :: f c Source # type arg > arg :: f b Source # type arg <* arg :: f a Source #
PApplicative Sum Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type Pure arg :: f a Source # type arg <> arg :: f b Source # type LiftA2 arg arg arg :: f c Source # type arg > arg :: f b Source # type arg <* arg :: f a Source #
PApplicative Product Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type Pure arg :: f a Source # type arg <> arg :: f b Source # type LiftA2 arg arg arg :: f c Source # type arg > arg :: f b Source # type arg <* arg :: f a Source #
PApplicative Down Source #
Instance details Defined in Data.Singletons.Prelude.Applicative Associated Types type Pure arg :: f a Source # type arg <> arg :: f b Source # type LiftA2 arg arg arg :: f c Source # type arg > arg :: f b Source # type arg <* arg :: f a Source #
PApplicative NonEmpty Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Pure arg :: f a Source # type arg <> arg :: f b Source # type LiftA2 arg arg arg :: f c Source # type arg > arg :: f b Source # type arg <* arg :: f a Source #
PApplicative (Either e) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Pure arg :: f a Source # type arg <> arg :: f b Source # type LiftA2 arg arg arg :: f c Source # type arg > arg :: f b Source # type arg <* arg :: f a Source #
PApplicative ((,) a) Source #
Instance details Defined in Data.Singletons.Prelude.Applicative Associated Types type Pure arg :: f a Source # type arg <> arg :: f b Source # type LiftA2 arg arg arg :: f c Source # type arg > arg :: f b Source # type arg <* arg :: f a Source #
PApplicative (Proxy :: Type -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Proxy Associated Types type Pure arg :: f a Source # type arg <> arg :: f b Source # type LiftA2 arg arg arg :: f c Source # type arg > arg :: f b Source # type arg <* arg :: f a Source #
PApplicative (Const m :: Type -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Const Associated Types type Pure arg :: f a Source # type arg <> arg :: f b Source # type LiftA2 arg arg arg :: f c Source # type arg > arg :: f b Source # type arg <* arg :: f a Source #

class SFunctor f => SApplicative f where Source #

Minimal complete definition

sPure

Methods

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

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

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

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

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

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

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

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

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

Instances

Instances details

SApplicative [] Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<>) :: forall a b (t :: [a ~> b]) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: [a]) (t :: [b]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%>) :: forall a b (t :: [a]) (t :: [b]). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%<) :: forall a b (t :: [a]) (t :: [b]). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source #
SApplicative Maybe Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<>) :: forall a b (t :: Maybe (a ~> b)) (t :: Maybe a). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: Maybe a) (t :: Maybe b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%>) :: forall a b (t :: Maybe a) (t :: Maybe b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%<) :: forall a b (t :: Maybe a) (t :: Maybe b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source #
SApplicative Min Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<>) :: forall a b (t :: Min (a ~> b)) (t :: Min a). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: Min a) (t :: Min b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%>) :: forall a b (t :: Min a) (t :: Min b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%<) :: forall a b (t :: Min a) (t :: Min b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source #
SApplicative Max Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<>) :: forall a b (t :: Max (a ~> b)) (t :: Max a). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: Max a) (t :: Max b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%>) :: forall a b (t :: Max a) (t :: Max b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%<) :: forall a b (t :: Max a) (t :: Max b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source #
SApplicative First Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<>) :: forall a b (t :: First (a ~> b)) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: First a) (t :: First b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%>) :: forall a b (t :: First a) (t :: First b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%<) :: forall a b (t :: First a) (t :: First b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source #
SApplicative Last Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<>) :: forall a b (t :: Last (a ~> b)) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: Last a) (t :: Last b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%>) :: forall a b (t :: Last a) (t :: Last b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%<) :: forall a b (t :: Last a) (t :: Last b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source #
SApplicative Option Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<>) :: forall a b (t :: Option (a ~> b)) (t :: Option a). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: Option a) (t :: Option b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%>) :: forall a b (t :: Option a) (t :: Option b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%<) :: forall a b (t :: Option a) (t :: Option b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source #
SApplicative Identity Source #
Instance details Defined in Data.Singletons.Prelude.Identity Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<>) :: forall a b (t :: Identity (a ~> b)) (t :: Identity a). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: Identity a) (t :: Identity b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%>) :: forall a b (t :: Identity a) (t :: Identity b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%<) :: forall a b (t :: Identity a) (t :: Identity b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source #
SApplicative First Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<>) :: forall a b (t :: First (a ~> b)) (t :: First a). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: First a) (t :: First b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%>) :: forall a b (t :: First a) (t :: First b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%<) :: forall a b (t :: First a) (t :: First b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source #
SApplicative Last Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<>) :: forall a b (t :: Last (a ~> b)) (t :: Last a). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: Last a) (t :: Last b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%>) :: forall a b (t :: Last a) (t :: Last b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%<) :: forall a b (t :: Last a) (t :: Last b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source #
SApplicative Dual Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<>) :: forall a b (t :: Dual (a ~> b)) (t :: Dual a). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: Dual a) (t :: Dual b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%>) :: forall a b (t :: Dual a) (t :: Dual b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%<) :: forall a b (t :: Dual a) (t :: Dual b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source #
SApplicative Sum Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<>) :: forall a b (t :: Sum (a ~> b)) (t :: Sum a). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: Sum a) (t :: Sum b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%>) :: forall a b (t :: Sum a) (t :: Sum b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%<) :: forall a b (t :: Sum a) (t :: Sum b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source #
SApplicative Product Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<>) :: forall a b (t :: Product (a ~> b)) (t :: Product a). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: Product a) (t :: Product b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%>) :: forall a b (t :: Product a) (t :: Product b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%<) :: forall a b (t :: Product a) (t :: Product b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source #
SApplicative Down Source #
Instance details Defined in Data.Singletons.Prelude.Applicative Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<>) :: forall a b (t :: Down (a ~> b)) (t :: Down a). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: Down a) (t :: Down b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%>) :: forall a b (t :: Down a) (t :: Down b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%<) :: forall a b (t :: Down a) (t :: Down b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source #
SApplicative NonEmpty Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<>) :: forall a b (t :: NonEmpty (a ~> b)) (t :: NonEmpty a). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: NonEmpty a) (t :: NonEmpty b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%>) :: forall a b (t :: NonEmpty a) (t :: NonEmpty b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%<) :: forall a b (t :: NonEmpty a) (t :: NonEmpty b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source #
SApplicative (Either e) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<>) :: forall a b (t :: Either e (a ~> b)) (t :: Either e a). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: Either e a) (t :: Either e b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%>) :: forall a b (t :: Either e a) (t :: Either e b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%<) :: forall a b (t :: Either e a) (t :: Either e b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source #
SMonoid a => SApplicative ((,) a) Source #
Instance details Defined in Data.Singletons.Prelude.Applicative Methods sPure :: forall a0 (t :: a0). Sing t -> Sing (Apply PureSym0 t) Source # (%<>) :: forall a0 b (t :: (a, a0 ~> b)) (t :: (a, a0)). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sLiftA2 :: forall a0 b c (t :: a0 ~> (b ~> c)) (t :: (a, a0)) (t :: (a, b)). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%>) :: forall a0 b (t :: (a, a0)) (t :: (a, b)). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%<) :: forall a0 b (t :: (a, a0)) (t :: (a, b)). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source #
SApplicative (Proxy :: Type -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Proxy Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<>) :: forall a b (t :: Proxy (a ~> b)) (t :: Proxy a). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: Proxy a) (t :: Proxy b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%>) :: forall a b (t :: Proxy a) (t :: Proxy b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%<) :: forall a b (t :: Proxy a) (t :: Proxy b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source #
SMonoid m => SApplicative (Const m :: Type -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Const Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<>) :: forall a b (t :: Const m (a ~> b)) (t :: Const m a). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t) Source # sLiftA2 :: forall a b c (t :: a ~> (b ~> c)) (t :: Const m a) (t :: Const m b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply LiftA2Sym0 t) t) t) Source # (%>) :: forall a b (t :: Const m a) (t :: Const m b). Sing t -> Sing t -> Sing (Apply (Apply (>@#@$) t) t) Source # (%<) :: forall a b (t :: Const m a) (t :: Const m b). Sing t -> Sing t -> Sing (Apply (Apply (<@#@$) t) t) Source #

type family (a . a) a where ... infixr 9 Source #

Equations

(f . g) a_6989586621679534181 = Apply (Apply (Apply (Apply Lambda_6989586621679534193Sym0 f) g) a_6989586621679534181) a_6989586621679534181

(%.) :: forall b c a (t :: (~>) b c) (t :: (~>) a b) (t :: a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply (.@#@$) t) t) t :: c) infixr 9 Source #

data SomeSing k where Source #

An existentially-quantified singleton. This type is useful when you want a singleton type, but there is no way of knowing, at compile-time, what the type index will be. To make use of this type, you will generally have to use a pattern-match:

foo :: Bool -> ...
foo b = case toSing b of
          SomeSing sb -> {- fancy dependently-typed code with sb -}

An example like the one above may be easier to write using withSomeSing.

Constructors

SomeSing :: Sing (a :: k) -> SomeSing k

Instances

Instances details

SBounded k => Bounded (SomeSing k) Source #
Instance details Defined in Data.Singletons Methods minBound :: SomeSing k # maxBound :: SomeSing k #
SEnum k => Enum (SomeSing k) Source #
Instance details Defined in Data.Singletons Methods succ :: SomeSing k -> SomeSing k # pred :: SomeSing k -> SomeSing k # toEnum :: Int -> SomeSing k # fromEnum :: SomeSing k -> Int # enumFrom :: SomeSing k -> [SomeSing k] # enumFromThen :: SomeSing k -> SomeSing k -> [SomeSing k] # enumFromTo :: SomeSing k -> SomeSing k -> [SomeSing k] # enumFromThenTo :: SomeSing k -> SomeSing k -> SomeSing k -> [SomeSing k] #
SEq k => Eq (SomeSing k) Source #
Instance details Defined in Data.Singletons Methods (==) :: SomeSing k -> SomeSing k -> Bool # (/=) :: SomeSing k -> SomeSing k -> Bool #
SNum k => Num (SomeSing k) Source #
Instance details Defined in Data.Singletons Methods (+) :: SomeSing k -> SomeSing k -> SomeSing k # (-) :: SomeSing k -> SomeSing k -> SomeSing k # (*) :: SomeSing k -> SomeSing k -> SomeSing k # negate :: SomeSing k -> SomeSing k # abs :: SomeSing k -> SomeSing k # signum :: SomeSing k -> SomeSing k # fromInteger :: Integer -> SomeSing k #
SOrd k => Ord (SomeSing k) Source #
Instance details Defined in Data.Singletons Methods compare :: SomeSing k -> SomeSing k -> Ordering # (<) :: SomeSing k -> SomeSing k -> Bool # (<=) :: SomeSing k -> SomeSing k -> Bool # (>) :: SomeSing k -> SomeSing k -> Bool # (>=) :: SomeSing k -> SomeSing k -> Bool # max :: SomeSing k -> SomeSing k -> SomeSing k # min :: SomeSing k -> SomeSing k -> SomeSing k #
ShowSing k => Show (SomeSing k) Source #
Instance details Defined in Data.Singletons Methods showsPrec :: Int -> SomeSing k -> ShowS # show :: SomeSing k -> String # showList :: [SomeSing k] -> ShowS #
SIsString k => IsString (SomeSing k) Source #
Instance details Defined in Data.Singletons Methods fromString :: String -> SomeSing k #
SSemigroup k => Semigroup (SomeSing k) Source #
Instance details Defined in Data.Singletons Methods (<>) :: SomeSing k -> SomeSing k -> SomeSing k # sconcat :: NonEmpty (SomeSing k) -> SomeSing k # stimes :: Integral b => b -> SomeSing k -> SomeSing k #
SMonoid k => Monoid (SomeSing k) Source #
Instance details Defined in Data.Singletons Methods mempty :: SomeSing k # mappend :: SomeSing k -> SomeSing k -> SomeSing k # mconcat :: [SomeSing k] -> SomeSing k #

type family Error str where ... Source #

The promotion of error. This version is more poly-kinded for easier use.

sError :: HasCallStack => Sing (str :: Symbol) -> a Source #

The singleton for error

data ErrorSym0 a6989586621679472252 Source #

Instances

Instances details

SingI (ErrorSym0 :: TyFun Symbol a -> Type) Source #
Instance details Defined in Data.Singletons.TypeLits.Internal Methods sing :: Sing ErrorSym0 Source #
SuppressUnusedWarnings (ErrorSym0 :: TyFun k0 k -> Type) Source #
Instance details Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () Source #
type Apply (ErrorSym0 :: TyFun k0 k2 -> Type) (a6989586621679472252 :: k0) Source #
Instance details Defined in Data.Singletons.TypeLits.Internal type Apply (ErrorSym0 :: TyFun k0 k2 -> Type) (a6989586621679472252 :: k0) = ErrorSym1 a6989586621679472252 :: k2

type ErrorSym1 (a6989586621679472252 :: k0) = Error a6989586621679472252 :: k Source #

type family Undefined where ... Source #

The promotion of undefined.

sUndefined :: HasCallStack => a Source #

The singleton for undefined.

type UndefinedSym0 = Undefined :: k Source #

type TrueSym0 = 'True :: Bool Source #

type FalseSym0 = 'False :: Bool Source #

data (==@#@$) a6989586621679370055 infix 4 Source #

Instances

Instances details

SEq a => SingI ((==@#@$) :: TyFun a (a ~> Bool) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods sing :: Sing (==@#@$) Source #
SuppressUnusedWarnings ((==@#@$) :: TyFun a (a ~> Bool) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () Source #
type Apply ((==@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679370055 :: a) Source #
Instance details Defined in Data.Singletons.Prelude.Eq type Apply ((==@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679370055 :: a) = (==@#@$$) a6989586621679370055

data a6989586621679370055 ==@#@$$ a6989586621679370056 infix 4 Source #

Instances

Instances details

(SEq a, SingI x) => SingI ((==@#@$$) x :: TyFun a Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods sing :: Sing ((==@#@$$) x) Source #
SuppressUnusedWarnings ((==@#@$$) a6989586621679370055 :: TyFun a Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () Source #
type Apply ((==@#@$$) a6989586621679370055 :: TyFun a Bool -> Type) (a6989586621679370056 :: a) Source #
Instance details Defined in Data.Singletons.Prelude.Eq type Apply ((==@#@$$) a6989586621679370055 :: TyFun a Bool -> Type) (a6989586621679370056 :: a) = a6989586621679370055 ==@#@$$$ a6989586621679370056

type (==@#@$$$) (a6989586621679370055 :: a) (a6989586621679370056 :: a) = (==) a6989586621679370055 a6989586621679370056 :: Bool infix 4 Source #

data (>@#@$) a6989586621679383655 infix 4 Source #

Instances

Instances details

SOrd a => SingI ((>@#@$) :: TyFun a (a ~> Bool) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (>@#@$) Source #
SuppressUnusedWarnings ((>@#@$) :: TyFun a (a ~> Bool) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
type Apply ((>@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679383655 :: a) Source #
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((>@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679383655 :: a) = (>@#@$$) a6989586621679383655

data a6989586621679383655 >@#@$$ a6989586621679383656 infix 4 Source #

Instances

Instances details

(SOrd a, SingI d) => SingI ((>@#@$$) d :: TyFun a Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ((>@#@$$) d) Source #
SuppressUnusedWarnings ((>@#@$$) a6989586621679383655 :: TyFun a Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
type Apply ((>@#@$$) a6989586621679383655 :: TyFun a Bool -> Type) (a6989586621679383656 :: a) Source #
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((>@#@$$) a6989586621679383655 :: TyFun a Bool -> Type) (a6989586621679383656 :: a) = a6989586621679383655 >@#@$$$ a6989586621679383656

type (>@#@$$$) (a6989586621679383655 :: a) (a6989586621679383656 :: a) = (>) a6989586621679383655 a6989586621679383656 :: Bool infix 4 Source #

type LTSym0 = 'LT :: Ordering Source #

type EQSym0 = 'EQ :: Ordering Source #

type GTSym0 = 'GT :: Ordering Source #

type Tuple0Sym0 = '() :: () Source #

data Tuple2Sym0 a6989586621679304233 Source #

Instances

Instances details

SingI (Tuple2Sym0 :: TyFun a (b ~> (a, b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing Tuple2Sym0 Source #
SuppressUnusedWarnings (Tuple2Sym0 :: TyFun a (b ~> (a, b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple2Sym0 :: TyFun a (b ~> (a, b)) -> Type) (a6989586621679304233 :: a) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple2Sym0 :: TyFun a (b ~> (a, b)) -> Type) (a6989586621679304233 :: a) = Tuple2Sym1 a6989586621679304233 :: TyFun b (a, b) -> Type

data Tuple2Sym1 a6989586621679304233 a6989586621679304234 Source #

Instances

Instances details

SingI d => SingI (Tuple2Sym1 d :: TyFun b (a, b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing (Tuple2Sym1 d) Source #
SuppressUnusedWarnings (Tuple2Sym1 a6989586621679304233 :: TyFun b (a, b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple2Sym1 a6989586621679304233 :: TyFun b (a, b) -> Type) (a6989586621679304234 :: b) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple2Sym1 a6989586621679304233 :: TyFun b (a, b) -> Type) (a6989586621679304234 :: b) = Tuple2Sym2 a6989586621679304233 a6989586621679304234

type Tuple2Sym2 (a6989586621679304233 :: a) (a6989586621679304234 :: b) = '(a6989586621679304233, a6989586621679304234) :: (a :: Type, b :: Type) Source #

data Tuple3Sym0 a6989586621679304264 Source #

Instances

Instances details

SingI (Tuple3Sym0 :: TyFun a (b ~> (c ~> (a, b, c))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing Tuple3Sym0 Source #
SuppressUnusedWarnings (Tuple3Sym0 :: TyFun a (b ~> (c ~> (a, b, c))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple3Sym0 :: TyFun a (b ~> (c ~> (a, b, c))) -> Type) (a6989586621679304264 :: a) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple3Sym0 :: TyFun a (b ~> (c ~> (a, b, c))) -> Type) (a6989586621679304264 :: a) = Tuple3Sym1 a6989586621679304264 :: TyFun b (c ~> (a, b, c)) -> Type

data Tuple3Sym1 a6989586621679304264 a6989586621679304265 Source #

Instances

Instances details

SingI d => SingI (Tuple3Sym1 d :: TyFun b (c ~> (a, b, c)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing (Tuple3Sym1 d) Source #
SuppressUnusedWarnings (Tuple3Sym1 a6989586621679304264 :: TyFun b (c ~> (a, b, c)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple3Sym1 a6989586621679304264 :: TyFun b (c ~> (a, b, c)) -> Type) (a6989586621679304265 :: b) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple3Sym1 a6989586621679304264 :: TyFun b (c ~> (a, b, c)) -> Type) (a6989586621679304265 :: b) = Tuple3Sym2 a6989586621679304264 a6989586621679304265 :: TyFun c (a, b, c) -> Type

data Tuple3Sym2 a6989586621679304264 a6989586621679304265 a6989586621679304266 Source #

Instances

Instances details

(SingI d1, SingI d2) => SingI (Tuple3Sym2 d1 d2 :: TyFun c (a, b, c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing (Tuple3Sym2 d1 d2) Source #
SuppressUnusedWarnings (Tuple3Sym2 a6989586621679304264 a6989586621679304265 :: TyFun c (a, b, c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple3Sym2 a6989586621679304264 a6989586621679304265 :: TyFun c (a, b, c) -> Type) (a6989586621679304266 :: c) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple3Sym2 a6989586621679304264 a6989586621679304265 :: TyFun c (a, b, c) -> Type) (a6989586621679304266 :: c) = Tuple3Sym3 a6989586621679304264 a6989586621679304265 a6989586621679304266

type Tuple3Sym3 (a6989586621679304264 :: a) (a6989586621679304265 :: b) (a6989586621679304266 :: c) = '(a6989586621679304264, a6989586621679304265, a6989586621679304266) :: (a :: Type, b :: Type, c :: Type) Source #

data Tuple4Sym0 a6989586621679304310 Source #

Instances

Instances details

SingI (Tuple4Sym0 :: TyFun a (b ~> (c ~> (d ~> (a, b, c, d)))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing Tuple4Sym0 Source #
SuppressUnusedWarnings (Tuple4Sym0 :: TyFun a (b ~> (c ~> (d ~> (a, b, c, d)))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple4Sym0 :: TyFun a (b ~> (c ~> (d ~> (a, b, c, d)))) -> Type) (a6989586621679304310 :: a) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple4Sym0 :: TyFun a (b ~> (c ~> (d ~> (a, b, c, d)))) -> Type) (a6989586621679304310 :: a) = Tuple4Sym1 a6989586621679304310 :: TyFun b (c ~> (d ~> (a, b, c, d))) -> Type

data Tuple4Sym1 a6989586621679304310 a6989586621679304311 Source #

Instances

Instances details

SingI d1 => SingI (Tuple4Sym1 d1 :: TyFun b (c ~> (d2 ~> (a, b, c, d2))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing (Tuple4Sym1 d1) Source #
SuppressUnusedWarnings (Tuple4Sym1 a6989586621679304310 :: TyFun b (c ~> (d ~> (a, b, c, d))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple4Sym1 a6989586621679304310 :: TyFun b (c ~> (d ~> (a, b, c, d))) -> Type) (a6989586621679304311 :: b) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple4Sym1 a6989586621679304310 :: TyFun b (c ~> (d ~> (a, b, c, d))) -> Type) (a6989586621679304311 :: b) = Tuple4Sym2 a6989586621679304310 a6989586621679304311 :: TyFun c (d ~> (a, b, c, d)) -> Type

data Tuple4Sym2 a6989586621679304310 a6989586621679304311 a6989586621679304312 Source #

Instances

Instances details

(SingI d1, SingI d2) => SingI (Tuple4Sym2 d1 d2 :: TyFun c (d3 ~> (a, b, c, d3)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing (Tuple4Sym2 d1 d2) Source #
SuppressUnusedWarnings (Tuple4Sym2 a6989586621679304310 a6989586621679304311 :: TyFun c (d ~> (a, b, c, d)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple4Sym2 a6989586621679304310 a6989586621679304311 :: TyFun c (d ~> (a, b, c, d)) -> Type) (a6989586621679304312 :: c) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple4Sym2 a6989586621679304310 a6989586621679304311 :: TyFun c (d ~> (a, b, c, d)) -> Type) (a6989586621679304312 :: c) = Tuple4Sym3 a6989586621679304310 a6989586621679304311 a6989586621679304312 :: TyFun d (a, b, c, d) -> Type

data Tuple4Sym3 a6989586621679304310 a6989586621679304311 a6989586621679304312 a6989586621679304313 Source #

Instances

Instances details

(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.Prelude.Instances Methods sing :: Sing (Tuple4Sym3 d1 d2 d3) Source #
SuppressUnusedWarnings (Tuple4Sym3 a6989586621679304310 a6989586621679304311 a6989586621679304312 :: TyFun d (a, b, c, d) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple4Sym3 a6989586621679304310 a6989586621679304311 a6989586621679304312 :: TyFun d (a, b, c, d) -> Type) (a6989586621679304313 :: d) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple4Sym3 a6989586621679304310 a6989586621679304311 a6989586621679304312 :: TyFun d (a, b, c, d) -> Type) (a6989586621679304313 :: d) = Tuple4Sym4 a6989586621679304310 a6989586621679304311 a6989586621679304312 a6989586621679304313

type Tuple4Sym4 (a6989586621679304310 :: a) (a6989586621679304311 :: b) (a6989586621679304312 :: c) (a6989586621679304313 :: d) = '(a6989586621679304310, a6989586621679304311, a6989586621679304312, a6989586621679304313) :: (a :: Type, b :: Type, c :: Type, d :: Type) Source #

data Tuple5Sym0 a6989586621679304373 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.Prelude.Instances Methods sing :: Sing Tuple5Sym0 Source #
SuppressUnusedWarnings (Tuple5Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (a, b, c, d, e))))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple5Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (a, b, c, d, e))))) -> Type) (a6989586621679304373 :: a) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple5Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (a, b, c, d, e))))) -> Type) (a6989586621679304373 :: a) = Tuple5Sym1 a6989586621679304373 :: TyFun b (c ~> (d ~> (e ~> (a, b, c, d, e)))) -> Type

data Tuple5Sym1 a6989586621679304373 a6989586621679304374 Source #

Instances

Instances details

SingI d1 => SingI (Tuple5Sym1 d1 :: TyFun b (c ~> (d2 ~> (e ~> (a, b, c, d2, e)))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing (Tuple5Sym1 d1) Source #
SuppressUnusedWarnings (Tuple5Sym1 a6989586621679304373 :: TyFun b (c ~> (d ~> (e ~> (a, b, c, d, e)))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple5Sym1 a6989586621679304373 :: TyFun b (c ~> (d ~> (e ~> (a, b, c, d, e)))) -> Type) (a6989586621679304374 :: b) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple5Sym1 a6989586621679304373 :: TyFun b (c ~> (d ~> (e ~> (a, b, c, d, e)))) -> Type) (a6989586621679304374 :: b) = Tuple5Sym2 a6989586621679304373 a6989586621679304374 :: TyFun c (d ~> (e ~> (a, b, c, d, e))) -> Type

data Tuple5Sym2 a6989586621679304373 a6989586621679304374 a6989586621679304375 Source #

Instances

Instances details

(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.Prelude.Instances Methods sing :: Sing (Tuple5Sym2 d1 d2) Source #
SuppressUnusedWarnings (Tuple5Sym2 a6989586621679304373 a6989586621679304374 :: TyFun c (d ~> (e ~> (a, b, c, d, e))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple5Sym2 a6989586621679304373 a6989586621679304374 :: TyFun c (d ~> (e ~> (a, b, c, d, e))) -> Type) (a6989586621679304375 :: c) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple5Sym2 a6989586621679304373 a6989586621679304374 :: TyFun c (d ~> (e ~> (a, b, c, d, e))) -> Type) (a6989586621679304375 :: c) = Tuple5Sym3 a6989586621679304373 a6989586621679304374 a6989586621679304375 :: TyFun d (e ~> (a, b, c, d, e)) -> Type

data Tuple5Sym3 a6989586621679304373 a6989586621679304374 a6989586621679304375 a6989586621679304376 Source #

Instances

Instances details

(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.Prelude.Instances Methods sing :: Sing (Tuple5Sym3 d1 d2 d3) Source #
SuppressUnusedWarnings (Tuple5Sym3 a6989586621679304373 a6989586621679304374 a6989586621679304375 :: TyFun d (e ~> (a, b, c, d, e)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple5Sym3 a6989586621679304373 a6989586621679304374 a6989586621679304375 :: TyFun d (e ~> (a, b, c, d, e)) -> Type) (a6989586621679304376 :: d) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple5Sym3 a6989586621679304373 a6989586621679304374 a6989586621679304375 :: TyFun d (e ~> (a, b, c, d, e)) -> Type) (a6989586621679304376 :: d) = Tuple5Sym4 a6989586621679304373 a6989586621679304374 a6989586621679304375 a6989586621679304376 :: TyFun e (a, b, c, d, e) -> Type

data Tuple5Sym4 a6989586621679304373 a6989586621679304374 a6989586621679304375 a6989586621679304376 a6989586621679304377 Source #

Instances

Instances details

(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.Prelude.Instances Methods sing :: Sing (Tuple5Sym4 d1 d2 d3 d5) Source #
SuppressUnusedWarnings (Tuple5Sym4 a6989586621679304373 a6989586621679304374 a6989586621679304375 a6989586621679304376 :: TyFun e (a, b, c, d, e) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple5Sym4 a6989586621679304373 a6989586621679304374 a6989586621679304375 a6989586621679304376 :: TyFun e (a, b, c, d, e) -> Type) (a6989586621679304377 :: e) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple5Sym4 a6989586621679304373 a6989586621679304374 a6989586621679304375 a6989586621679304376 :: TyFun e (a, b, c, d, e) -> Type) (a6989586621679304377 :: e) = Tuple5Sym5 a6989586621679304373 a6989586621679304374 a6989586621679304375 a6989586621679304376 a6989586621679304377

type Tuple5Sym5 (a6989586621679304373 :: a) (a6989586621679304374 :: b) (a6989586621679304375 :: c) (a6989586621679304376 :: d) (a6989586621679304377 :: e) = '(a6989586621679304373, a6989586621679304374, a6989586621679304375, a6989586621679304376, a6989586621679304377) :: (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type) Source #

data Tuple6Sym0 a6989586621679304455 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.Prelude.Instances Methods sing :: Sing Tuple6Sym0 Source #
SuppressUnusedWarnings (Tuple6Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f)))))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple6Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f)))))) -> Type) (a6989586621679304455 :: a) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple6Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f)))))) -> Type) (a6989586621679304455 :: a) = Tuple6Sym1 a6989586621679304455 :: TyFun b (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f))))) -> Type

data Tuple6Sym1 a6989586621679304455 a6989586621679304456 Source #

Instances

Instances details

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.Prelude.Instances Methods sing :: Sing (Tuple6Sym1 d1) Source #
SuppressUnusedWarnings (Tuple6Sym1 a6989586621679304455 :: TyFun b (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f))))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple6Sym1 a6989586621679304455 :: TyFun b (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f))))) -> Type) (a6989586621679304456 :: b) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple6Sym1 a6989586621679304455 :: TyFun b (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f))))) -> Type) (a6989586621679304456 :: b) = Tuple6Sym2 a6989586621679304455 a6989586621679304456 :: TyFun c (d ~> (e ~> (f ~> (a, b, c, d, e, f)))) -> Type

data Tuple6Sym2 a6989586621679304455 a6989586621679304456 a6989586621679304457 Source #

Instances

Instances details

(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.Prelude.Instances Methods sing :: Sing (Tuple6Sym2 d1 d2) Source #
SuppressUnusedWarnings (Tuple6Sym2 a6989586621679304455 a6989586621679304456 :: TyFun c (d ~> (e ~> (f ~> (a, b, c, d, e, f)))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple6Sym2 a6989586621679304455 a6989586621679304456 :: TyFun c (d ~> (e ~> (f ~> (a, b, c, d, e, f)))) -> Type) (a6989586621679304457 :: c) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple6Sym2 a6989586621679304455 a6989586621679304456 :: TyFun c (d ~> (e ~> (f ~> (a, b, c, d, e, f)))) -> Type) (a6989586621679304457 :: c) = Tuple6Sym3 a6989586621679304455 a6989586621679304456 a6989586621679304457 :: TyFun d (e ~> (f ~> (a, b, c, d, e, f))) -> Type

data Tuple6Sym3 a6989586621679304455 a6989586621679304456 a6989586621679304457 a6989586621679304458 Source #

Instances

Instances details

(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.Prelude.Instances Methods sing :: Sing (Tuple6Sym3 d1 d2 d3) Source #
SuppressUnusedWarnings (Tuple6Sym3 a6989586621679304455 a6989586621679304456 a6989586621679304457 :: TyFun d (e ~> (f ~> (a, b, c, d, e, f))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple6Sym3 a6989586621679304455 a6989586621679304456 a6989586621679304457 :: TyFun d (e ~> (f ~> (a, b, c, d, e, f))) -> Type) (a6989586621679304458 :: d) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple6Sym3 a6989586621679304455 a6989586621679304456 a6989586621679304457 :: TyFun d (e ~> (f ~> (a, b, c, d, e, f))) -> Type) (a6989586621679304458 :: d) = Tuple6Sym4 a6989586621679304455 a6989586621679304456 a6989586621679304457 a6989586621679304458 :: TyFun e (f ~> (a, b, c, d, e, f)) -> Type

data Tuple6Sym4 a6989586621679304455 a6989586621679304456 a6989586621679304457 a6989586621679304458 a6989586621679304459 Source #

Instances

Instances details

(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.Prelude.Instances Methods sing :: Sing (Tuple6Sym4 d1 d2 d3 d5) Source #
SuppressUnusedWarnings (Tuple6Sym4 a6989586621679304455 a6989586621679304456 a6989586621679304457 a6989586621679304458 :: TyFun e (f ~> (a, b, c, d, e, f)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple6Sym4 a6989586621679304455 a6989586621679304456 a6989586621679304457 a6989586621679304458 :: TyFun e (f ~> (a, b, c, d, e, f)) -> Type) (a6989586621679304459 :: e) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple6Sym4 a6989586621679304455 a6989586621679304456 a6989586621679304457 a6989586621679304458 :: TyFun e (f ~> (a, b, c, d, e, f)) -> Type) (a6989586621679304459 :: e) = Tuple6Sym5 a6989586621679304455 a6989586621679304456 a6989586621679304457 a6989586621679304458 a6989586621679304459 :: TyFun f (a, b, c, d, e, f) -> Type

data Tuple6Sym5 a6989586621679304455 a6989586621679304456 a6989586621679304457 a6989586621679304458 a6989586621679304459 a6989586621679304460 Source #

Instances

Instances details

(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.Prelude.Instances Methods sing :: Sing (Tuple6Sym5 d1 d2 d3 d5 d6) Source #
SuppressUnusedWarnings (Tuple6Sym5 a6989586621679304455 a6989586621679304456 a6989586621679304457 a6989586621679304458 a6989586621679304459 :: TyFun f (a, b, c, d, e, f) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple6Sym5 a6989586621679304455 a6989586621679304456 a6989586621679304457 a6989586621679304458 a6989586621679304459 :: TyFun f (a, b, c, d, e, f) -> Type) (a6989586621679304460 :: f) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple6Sym5 a6989586621679304455 a6989586621679304456 a6989586621679304457 a6989586621679304458 a6989586621679304459 :: TyFun f (a, b, c, d, e, f) -> Type) (a6989586621679304460 :: f) = Tuple6Sym6 a6989586621679304455 a6989586621679304456 a6989586621679304457 a6989586621679304458 a6989586621679304459 a6989586621679304460

type Tuple6Sym6 (a6989586621679304455 :: a) (a6989586621679304456 :: b) (a6989586621679304457 :: c) (a6989586621679304458 :: d) (a6989586621679304459 :: e) (a6989586621679304460 :: f) = '(a6989586621679304455, a6989586621679304456, a6989586621679304457, a6989586621679304458, a6989586621679304459, a6989586621679304460) :: (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type) Source #

data Tuple7Sym0 a6989586621679304558 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.Prelude.Instances Methods sing :: Sing Tuple7Sym0 Source #
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.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple7Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))))) -> Type) (a6989586621679304558 :: a) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple7Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))))) -> Type) (a6989586621679304558 :: a) = Tuple7Sym1 a6989586621679304558 :: TyFun b (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))))) -> Type

data Tuple7Sym1 a6989586621679304558 a6989586621679304559 Source #

Instances

Instances details

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.Prelude.Instances Methods sing :: Sing (Tuple7Sym1 d1) Source #
SuppressUnusedWarnings (Tuple7Sym1 a6989586621679304558 :: TyFun b (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple7Sym1 a6989586621679304558 :: TyFun b (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))))) -> Type) (a6989586621679304559 :: b) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple7Sym1 a6989586621679304558 :: TyFun b (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))))) -> Type) (a6989586621679304559 :: b) = Tuple7Sym2 a6989586621679304558 a6989586621679304559 :: TyFun c (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))) -> Type

data Tuple7Sym2 a6989586621679304558 a6989586621679304559 a6989586621679304560 Source #

Instances

Instances details

(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.Prelude.Instances Methods sing :: Sing (Tuple7Sym2 d1 d2) Source #
SuppressUnusedWarnings (Tuple7Sym2 a6989586621679304558 a6989586621679304559 :: TyFun c (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple7Sym2 a6989586621679304558 a6989586621679304559 :: TyFun c (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))) -> Type) (a6989586621679304560 :: c) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple7Sym2 a6989586621679304558 a6989586621679304559 :: TyFun c (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))) -> Type) (a6989586621679304560 :: c) = Tuple7Sym3 a6989586621679304558 a6989586621679304559 a6989586621679304560 :: TyFun d (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))) -> Type

data Tuple7Sym3 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 Source #

Instances

Instances details

(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.Prelude.Instances Methods sing :: Sing (Tuple7Sym3 d1 d2 d3) Source #
SuppressUnusedWarnings (Tuple7Sym3 a6989586621679304558 a6989586621679304559 a6989586621679304560 :: TyFun d (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple7Sym3 a6989586621679304558 a6989586621679304559 a6989586621679304560 :: TyFun d (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))) -> Type) (a6989586621679304561 :: d) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple7Sym3 a6989586621679304558 a6989586621679304559 a6989586621679304560 :: TyFun d (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))) -> Type) (a6989586621679304561 :: d) = Tuple7Sym4 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 :: TyFun e (f ~> (g ~> (a, b, c, d, e, f, g))) -> Type

data Tuple7Sym4 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 a6989586621679304562 Source #

Instances

Instances details

(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.Prelude.Instances Methods sing :: Sing (Tuple7Sym4 d1 d2 d3 d5) Source #
SuppressUnusedWarnings (Tuple7Sym4 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 :: TyFun e (f ~> (g ~> (a, b, c, d, e, f, g))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple7Sym4 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 :: TyFun e (f ~> (g ~> (a, b, c, d, e, f, g))) -> Type) (a6989586621679304562 :: e) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple7Sym4 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 :: TyFun e (f ~> (g ~> (a, b, c, d, e, f, g))) -> Type) (a6989586621679304562 :: e) = Tuple7Sym5 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 a6989586621679304562 :: TyFun f (g ~> (a, b, c, d, e, f, g)) -> Type

data Tuple7Sym5 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 a6989586621679304562 a6989586621679304563 Source #

Instances

Instances details

(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.Prelude.Instances Methods sing :: Sing (Tuple7Sym5 d1 d2 d3 d5 d6) Source #
SuppressUnusedWarnings (Tuple7Sym5 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 a6989586621679304562 :: TyFun f (g ~> (a, b, c, d, e, f, g)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple7Sym5 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 a6989586621679304562 :: TyFun f (g ~> (a, b, c, d, e, f, g)) -> Type) (a6989586621679304563 :: f) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple7Sym5 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 a6989586621679304562 :: TyFun f (g ~> (a, b, c, d, e, f, g)) -> Type) (a6989586621679304563 :: f) = Tuple7Sym6 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 a6989586621679304562 a6989586621679304563 :: TyFun g (a, b, c, d, e, f, g) -> Type

data Tuple7Sym6 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 a6989586621679304562 a6989586621679304563 a6989586621679304564 Source #

Instances

Instances details

(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.Prelude.Instances Methods sing :: Sing (Tuple7Sym6 d1 d2 d3 d5 d6 d7) Source #
SuppressUnusedWarnings (Tuple7Sym6 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 a6989586621679304562 a6989586621679304563 :: TyFun g (a, b, c, d, e, f, g) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply (Tuple7Sym6 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 a6989586621679304562 a6989586621679304563 :: TyFun g (a, b, c, d, e, f, g) -> Type) (a6989586621679304564 :: g) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (Tuple7Sym6 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 a6989586621679304562 a6989586621679304563 :: TyFun g (a, b, c, d, e, f, g) -> Type) (a6989586621679304564 :: g) = Tuple7Sym7 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 a6989586621679304562 a6989586621679304563 a6989586621679304564

type Tuple7Sym7 (a6989586621679304558 :: a) (a6989586621679304559 :: b) (a6989586621679304560 :: c) (a6989586621679304561 :: d) (a6989586621679304562 :: e) (a6989586621679304563 :: f) (a6989586621679304564 :: g) = '(a6989586621679304558, a6989586621679304559, a6989586621679304560, a6989586621679304561, a6989586621679304562, a6989586621679304563, a6989586621679304564) :: (a :: Type, b :: Type, c :: Type, d :: Type, e :: Type, f :: Type, g :: Type) Source #

data CompareSym0 a6989586621679383640 Source #

Instances

Instances details

SOrd a => SingI (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing CompareSym0 Source #
SuppressUnusedWarnings (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
type Apply (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) (a6989586621679383640 :: a) Source #
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) (a6989586621679383640 :: a) = CompareSym1 a6989586621679383640

data CompareSym1 a6989586621679383640 a6989586621679383641 Source #

Instances

Instances details

(SOrd a, SingI d) => SingI (CompareSym1 d :: TyFun a Ordering -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (CompareSym1 d) Source #
SuppressUnusedWarnings (CompareSym1 a6989586621679383640 :: TyFun a Ordering -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
type Apply (CompareSym1 a6989586621679383640 :: TyFun a Ordering -> Type) (a6989586621679383641 :: a) Source #
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (CompareSym1 a6989586621679383640 :: TyFun a Ordering -> Type) (a6989586621679383641 :: a) = CompareSym2 a6989586621679383640 a6989586621679383641

type CompareSym2 (a6989586621679383640 :: a) (a6989586621679383641 :: a) = Compare a6989586621679383640 a6989586621679383641 :: Ordering Source #

data ThenCmpSym0 a6989586621679394586 Source #

Instances

Instances details

SingI ThenCmpSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ThenCmpSym0 Source #
SuppressUnusedWarnings ThenCmpSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
type Apply ThenCmpSym0 (a6989586621679394586 :: Ordering) Source #
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ThenCmpSym0 (a6989586621679394586 :: Ordering) = ThenCmpSym1 a6989586621679394586

data ThenCmpSym1 a6989586621679394586 a6989586621679394587 Source #

Instances

Instances details

SingI d => SingI (ThenCmpSym1 d :: TyFun Ordering Ordering -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (ThenCmpSym1 d) Source #
SuppressUnusedWarnings (ThenCmpSym1 a6989586621679394586 :: TyFun Ordering Ordering -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
type Apply (ThenCmpSym1 a6989586621679394586 :: TyFun Ordering Ordering -> Type) (a6989586621679394587 :: Ordering) Source #
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (ThenCmpSym1 a6989586621679394586 :: TyFun Ordering Ordering -> Type) (a6989586621679394587 :: Ordering) = ThenCmpSym2 a6989586621679394586 a6989586621679394587

type ThenCmpSym2 (a6989586621679394586 :: Ordering) (a6989586621679394587 :: Ordering) = ThenCmp a6989586621679394586 a6989586621679394587 :: Ordering Source #

data FoldlSym0 a6989586621680492465 Source #

Instances

Instances details

SFoldable t => SingI (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing FoldlSym0 Source #
SuppressUnusedWarnings (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
type Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680492465 :: b ~> (a ~> b)) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680492465 :: b ~> (a ~> b)) = FoldlSym1 a6989586621680492465 :: TyFun b (t a ~> b) -> Type

data FoldlSym1 a6989586621680492465 a6989586621680492466 Source #

Instances

Instances details

(SFoldable t, SingI d) => SingI (FoldlSym1 d :: TyFun b (t a ~> b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (FoldlSym1 d) Source #
SuppressUnusedWarnings (FoldlSym1 a6989586621680492465 :: TyFun b (t a ~> b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
type Apply (FoldlSym1 a6989586621680492465 :: TyFun b (t a ~> b) -> Type) (a6989586621680492466 :: b) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FoldlSym1 a6989586621680492465 :: TyFun b (t a ~> b) -> Type) (a6989586621680492466 :: b) = FoldlSym2 a6989586621680492465 a6989586621680492466 :: TyFun (t a) b -> Type

data FoldlSym2 a6989586621680492465 a6989586621680492466 a6989586621680492467 Source #

Instances

Instances details

(SFoldable t, SingI d1, SingI d2) => SingI (FoldlSym2 d1 d2 :: TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (FoldlSym2 d1 d2) Source #
SuppressUnusedWarnings (FoldlSym2 a6989586621680492465 a6989586621680492466 :: TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
type Apply (FoldlSym2 a6989586621680492465 a6989586621680492466 :: TyFun (t a) b -> Type) (a6989586621680492467 :: t a) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FoldlSym2 a6989586621680492465 a6989586621680492466 :: TyFun (t a) b -> Type) (a6989586621680492467 :: t a) = FoldlSym3 a6989586621680492465 a6989586621680492466 a6989586621680492467

type FoldlSym3 (a6989586621680492465 :: (~>) b ((~>) a b)) (a6989586621680492466 :: b) (a6989586621680492467 :: t a) = Foldl a6989586621680492465 a6989586621680492466 a6989586621680492467 :: b Source #

type MinBoundSym0 = MinBound :: a Source #

type MaxBoundSym0 = MaxBound :: a Source #

data ShowsPrecSym0 a6989586621680279568 Source #

Instances

Instances details

SShow a => SingI (ShowsPrecSym0 :: TyFun Nat (a ~> (Symbol ~> Symbol)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sing :: Sing ShowsPrecSym0 Source #
SuppressUnusedWarnings (ShowsPrecSym0 :: TyFun Nat (a ~> (Symbol ~> Symbol)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
type Apply (ShowsPrecSym0 :: TyFun Nat (a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680279568 :: Nat) Source #
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrecSym0 :: TyFun Nat (a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680279568 :: Nat) = ShowsPrecSym1 a6989586621680279568 :: TyFun a (Symbol ~> Symbol) -> Type

data ShowsPrecSym1 a6989586621680279568 a6989586621680279569 Source #

Instances

Instances details

(SShow a, SingI d) => SingI (ShowsPrecSym1 d :: TyFun a (Symbol ~> Symbol) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sing :: Sing (ShowsPrecSym1 d) Source #
SuppressUnusedWarnings (ShowsPrecSym1 a6989586621680279568 :: TyFun a (Symbol ~> Symbol) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
type Apply (ShowsPrecSym1 a6989586621680279568 :: TyFun a (Symbol ~> Symbol) -> Type) (a6989586621680279569 :: a) Source #
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrecSym1 a6989586621680279568 :: TyFun a (Symbol ~> Symbol) -> Type) (a6989586621680279569 :: a) = ShowsPrecSym2 a6989586621680279568 a6989586621680279569

data ShowsPrecSym2 a6989586621680279568 a6989586621680279569 a6989586621680279570 Source #

Instances

Instances details

(SShow a, SingI d1, SingI d2) => SingI (ShowsPrecSym2 d1 d2 :: TyFun Symbol Symbol -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sing :: Sing (ShowsPrecSym2 d1 d2) Source #
SuppressUnusedWarnings (ShowsPrecSym2 a6989586621680279568 a6989586621680279569 :: TyFun Symbol Symbol -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
type Apply (ShowsPrecSym2 a6989586621680279568 a6989586621680279569 :: TyFun Symbol Symbol -> Type) (a6989586621680279570 :: Symbol) Source #
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrecSym2 a6989586621680279568 a6989586621680279569 :: TyFun Symbol Symbol -> Type) (a6989586621680279570 :: Symbol) = ShowsPrecSym3 a6989586621680279568 a6989586621680279569 a6989586621680279570

type ShowsPrecSym3 (a6989586621680279568 :: Nat) (a6989586621680279569 :: a) (a6989586621680279570 :: Symbol) = ShowsPrec a6989586621680279568 a6989586621680279569 a6989586621680279570 :: Symbol Source #

data ShowStringSym0 a6989586621680279523 Source #

Instances

Instances details

SingI ShowStringSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sing :: Sing ShowStringSym0 Source #
SuppressUnusedWarnings ShowStringSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
type Apply ShowStringSym0 (a6989586621680279523 :: Symbol) Source #
Instance details Defined in Data.Singletons.Prelude.Show type Apply ShowStringSym0 (a6989586621680279523 :: Symbol) = ShowStringSym1 a6989586621680279523

data ShowStringSym1 a6989586621680279523 a6989586621680279524 Source #

Instances

Instances details

SingI d => SingI (ShowStringSym1 d :: TyFun Symbol Symbol -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sing :: Sing (ShowStringSym1 d) Source #
SuppressUnusedWarnings (ShowStringSym1 a6989586621680279523 :: TyFun Symbol Symbol -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
type Apply (ShowStringSym1 a6989586621680279523 :: TyFun Symbol Symbol -> Type) (a6989586621680279524 :: Symbol) Source #
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowStringSym1 a6989586621680279523 :: TyFun Symbol Symbol -> Type) (a6989586621680279524 :: Symbol) = ShowStringSym2 a6989586621680279523 a6989586621680279524

type ShowStringSym2 (a6989586621680279523 :: Symbol) (a6989586621680279524 :: Symbol) = ShowString a6989586621680279523 a6989586621680279524 :: Symbol Source #

data ShowParenSym0 a6989586621680279507 Source #

Instances

Instances details

SingI ShowParenSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sing :: Sing ShowParenSym0 Source #
SuppressUnusedWarnings ShowParenSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
type Apply ShowParenSym0 (a6989586621680279507 :: Bool) Source #
Instance details Defined in Data.Singletons.Prelude.Show type Apply ShowParenSym0 (a6989586621680279507 :: Bool) = ShowParenSym1 a6989586621680279507

data ShowParenSym1 a6989586621680279507 a6989586621680279508 Source #

Instances

Instances details

SingI d => SingI (ShowParenSym1 d :: TyFun (Symbol ~> Symbol) (Symbol ~> Symbol) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sing :: Sing (ShowParenSym1 d) Source #
SuppressUnusedWarnings (ShowParenSym1 a6989586621680279507 :: TyFun (Symbol ~> Symbol) (Symbol ~> Symbol) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
type Apply (ShowParenSym1 a6989586621680279507 :: TyFun (Symbol ~> Symbol) (Symbol ~> Symbol) -> Type) (a6989586621680279508 :: Symbol ~> Symbol) Source #
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowParenSym1 a6989586621680279507 :: TyFun (Symbol ~> Symbol) (Symbol ~> Symbol) -> Type) (a6989586621680279508 :: Symbol ~> Symbol) = ShowParenSym2 a6989586621680279507 a6989586621680279508

data ShowParenSym2 a6989586621680279507 a6989586621680279508 a6989586621680279509 Source #

Instances

Instances details

(SingI d1, SingI d2) => SingI (ShowParenSym2 d1 d2 :: TyFun Symbol Symbol -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sing :: Sing (ShowParenSym2 d1 d2) Source #
SuppressUnusedWarnings (ShowParenSym2 a6989586621680279507 a6989586621680279508 :: TyFun Symbol Symbol -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
type Apply (ShowParenSym2 a6989586621680279507 a6989586621680279508 :: TyFun Symbol Symbol -> Type) (a6989586621680279509 :: Symbol) Source #
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowParenSym2 a6989586621680279507 a6989586621680279508 :: TyFun Symbol Symbol -> Type) (a6989586621680279509 :: Symbol)

data ShowSpaceSym0 a6989586621680279495 Source #

Instances

Instances details

SingI ShowSpaceSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sing :: Sing ShowSpaceSym0 Source #
SuppressUnusedWarnings ShowSpaceSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
type Apply ShowSpaceSym0 (a6989586621680279495 :: Symbol) Source #
Instance details Defined in Data.Singletons.Prelude.Show type Apply ShowSpaceSym0 (a6989586621680279495 :: Symbol) = ShowSpaceSym1 a6989586621680279495

type ShowSpaceSym1 (a6989586621680279495 :: Symbol) = ShowSpace a6989586621680279495 :: Symbol Source #

data ShowCharSym0 a6989586621680279534 Source #

Instances

Instances details

SingI ShowCharSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sing :: Sing ShowCharSym0 Source #
SuppressUnusedWarnings ShowCharSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
type Apply ShowCharSym0 (a6989586621680279534 :: Symbol) Source #
Instance details Defined in Data.Singletons.Prelude.Show type Apply ShowCharSym0 (a6989586621680279534 :: Symbol) = ShowCharSym1 a6989586621680279534

data ShowCharSym1 a6989586621680279534 a6989586621680279535 Source #

Instances

Instances details

SingI d => SingI (ShowCharSym1 d :: TyFun Symbol Symbol -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sing :: Sing (ShowCharSym1 d) Source #
SuppressUnusedWarnings (ShowCharSym1 a6989586621680279534 :: TyFun Symbol Symbol -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
type Apply (ShowCharSym1 a6989586621680279534 :: TyFun Symbol Symbol -> Type) (a6989586621680279535 :: Symbol) Source #
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowCharSym1 a6989586621680279534 :: TyFun Symbol Symbol -> Type) (a6989586621680279535 :: Symbol) = ShowCharSym2 a6989586621680279534 a6989586621680279535

type ShowCharSym2 (a6989586621680279534 :: Symbol) (a6989586621680279535 :: Symbol) = ShowChar a6989586621680279534 a6989586621680279535 :: Symbol Source #

data ShowCommaSpaceSym0 a6989586621680279489 Source #

Instances

Instances details

SingI ShowCommaSpaceSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods sing :: Sing ShowCommaSpaceSym0 Source #
SuppressUnusedWarnings ShowCommaSpaceSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
type Apply ShowCommaSpaceSym0 (a6989586621680279489 :: Symbol) Source #
Instance details Defined in Data.Singletons.Prelude.Show type Apply ShowCommaSpaceSym0 (a6989586621680279489 :: Symbol) = ShowCommaSpaceSym1 a6989586621680279489

type ShowCommaSpaceSym1 (a6989586621680279489 :: Symbol) = ShowCommaSpace a6989586621680279489 :: Symbol Source #

data FmapSym0 a6989586621679559667 Source #

Instances

Instances details

SFunctor f => SingI (FmapSym0 :: TyFun (a ~> b) (f a ~> f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sing :: Sing FmapSym0 Source #
SuppressUnusedWarnings (FmapSym0 :: TyFun (a ~> b) (f a ~> f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
type Apply (FmapSym0 :: TyFun (a ~> b) (f a ~> f b) -> Type) (a6989586621679559667 :: a ~> b) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (FmapSym0 :: TyFun (a ~> b) (f a ~> f b) -> Type) (a6989586621679559667 :: a ~> b) = FmapSym1 a6989586621679559667 :: TyFun (f a) (f b) -> Type

data FmapSym1 a6989586621679559667 a6989586621679559668 Source #

Instances

Instances details

(SFunctor f, SingI d) => SingI (FmapSym1 d :: TyFun (f a) (f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sing :: Sing (FmapSym1 d) Source #
SuppressUnusedWarnings (FmapSym1 a6989586621679559667 :: TyFun (f a) (f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
type Apply (FmapSym1 a6989586621679559667 :: TyFun (f a) (f b) -> Type) (a6989586621679559668 :: f a) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (FmapSym1 a6989586621679559667 :: TyFun (f a) (f b) -> Type) (a6989586621679559668 :: f a) = FmapSym2 a6989586621679559667 a6989586621679559668

type FmapSym2 (a6989586621679559667 :: (~>) a b) (a6989586621679559668 :: f a) = Fmap a6989586621679559667 a6989586621679559668 :: f b Source #

data (<$@#@$) a6989586621679559672 infixl 4 Source #

Instances

Instances details

SFunctor f => SingI ((<$@#@$) :: TyFun a (f b ~> f a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sing :: Sing (<$@#@$) Source #
SuppressUnusedWarnings ((<$@#@$) :: TyFun a (f b ~> f a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
type Apply ((<$@#@$) :: TyFun a (f b ~> f a) -> Type) (a6989586621679559672 :: a) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply ((<$@#@$) :: TyFun a (f b ~> f a) -> Type) (a6989586621679559672 :: a) = (<$@#@$$) a6989586621679559672 :: TyFun (f b) (f a) -> Type

data a6989586621679559672 <$@#@$$ a6989586621679559673 infixl 4 Source #

Instances

Instances details

(SFunctor f, SingI d) => SingI ((<$@#@$$) d :: TyFun (f b) (f a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sing :: Sing ((<$@#@$$) d) Source #
SuppressUnusedWarnings ((<$@#@$$) a6989586621679559672 :: TyFun (f b) (f a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
type Apply ((<$@#@$$) a6989586621679559672 :: TyFun (f b) (f a) -> Type) (a6989586621679559673 :: f b) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply ((<$@#@$$) a6989586621679559672 :: TyFun (f b) (f a) -> Type) (a6989586621679559673 :: f b) = a6989586621679559672 <$@#@$$$ a6989586621679559673

type (<$@#@$$$) (a6989586621679559672 :: a) (a6989586621679559673 :: f b) = (<$) a6989586621679559672 a6989586621679559673 :: f a infixl 4 Source #

data FoldMapSym0 a6989586621680492445 Source #

Instances

Instances details

(SFoldable t, SMonoid m) => SingI (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing FoldMapSym0 Source #
SuppressUnusedWarnings (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
type Apply (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) (a6989586621680492445 :: a ~> m) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) (a6989586621680492445 :: a ~> m) = FoldMapSym1 a6989586621680492445 :: TyFun (t a) m -> Type

data FoldMapSym1 a6989586621680492445 a6989586621680492446 Source #

Instances

Instances details

(SFoldable t, SMonoid m, SingI d) => SingI (FoldMapSym1 d :: TyFun (t a) m -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (FoldMapSym1 d) Source #
SuppressUnusedWarnings (FoldMapSym1 a6989586621680492445 :: TyFun (t a) m -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
type Apply (FoldMapSym1 a6989586621680492445 :: TyFun (t a) m -> Type) (a6989586621680492446 :: t a) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FoldMapSym1 a6989586621680492445 :: TyFun (t a) m -> Type) (a6989586621680492446 :: t a) = FoldMapSym2 a6989586621680492445 a6989586621680492446

type FoldMapSym2 (a6989586621680492445 :: (~>) a m) (a6989586621680492446 :: t a) = FoldMap a6989586621680492445 a6989586621680492446 :: m Source #

type MemptySym0 = Mempty :: a Source #

data MappendSym0 a6989586621680347244 Source #

Instances

Instances details

SMonoid a => SingI (MappendSym0 :: TyFun a (a ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sing :: Sing MappendSym0 Source #
SuppressUnusedWarnings (MappendSym0 :: TyFun a (a ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source #
type Apply (MappendSym0 :: TyFun a (a ~> a) -> Type) (a6989586621680347244 :: a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (MappendSym0 :: TyFun a (a ~> a) -> Type) (a6989586621680347244 :: a) = MappendSym1 a6989586621680347244

data MappendSym1 a6989586621680347244 a6989586621680347245 Source #

Instances

Instances details

(SMonoid a, SingI d) => SingI (MappendSym1 d :: TyFun a a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sing :: Sing (MappendSym1 d) Source #
SuppressUnusedWarnings (MappendSym1 a6989586621680347244 :: TyFun a a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source #
type Apply (MappendSym1 a6989586621680347244 :: TyFun a a -> Type) (a6989586621680347245 :: a) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (MappendSym1 a6989586621680347244 :: TyFun a a -> Type) (a6989586621680347245 :: a) = MappendSym2 a6989586621680347244 a6989586621680347245

type MappendSym2 (a6989586621680347244 :: a) (a6989586621680347245 :: a) = Mappend a6989586621680347244 a6989586621680347245 :: a Source #

data FoldrSym0 a6989586621680492451 Source #

Instances

Instances details

SFoldable t => SingI (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing FoldrSym0 Source #
SuppressUnusedWarnings (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
type Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680492451 :: a ~> (b ~> b)) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680492451 :: a ~> (b ~> b)) = FoldrSym1 a6989586621680492451 :: TyFun b (t a ~> b) -> Type

data FoldrSym1 a6989586621680492451 a6989586621680492452 Source #

Instances

Instances details

(SFoldable t, SingI d) => SingI (FoldrSym1 d :: TyFun b (t a ~> b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (FoldrSym1 d) Source #
SuppressUnusedWarnings (FoldrSym1 a6989586621680492451 :: TyFun b (t a ~> b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
type Apply (FoldrSym1 a6989586621680492451 :: TyFun b (t a ~> b) -> Type) (a6989586621680492452 :: b) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FoldrSym1 a6989586621680492451 :: TyFun b (t a ~> b) -> Type) (a6989586621680492452 :: b) = FoldrSym2 a6989586621680492451 a6989586621680492452 :: TyFun (t a) b -> Type

data FoldrSym2 a6989586621680492451 a6989586621680492452 a6989586621680492453 Source #

Instances

Instances details

(SFoldable t, SingI d1, SingI d2) => SingI (FoldrSym2 d1 d2 :: TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (FoldrSym2 d1 d2) Source #
SuppressUnusedWarnings (FoldrSym2 a6989586621680492451 a6989586621680492452 :: TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
type Apply (FoldrSym2 a6989586621680492451 a6989586621680492452 :: TyFun (t a) b -> Type) (a6989586621680492453 :: t a) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FoldrSym2 a6989586621680492451 a6989586621680492452 :: TyFun (t a) b -> Type) (a6989586621680492453 :: t a) = FoldrSym3 a6989586621680492451 a6989586621680492452 a6989586621680492453

type FoldrSym3 (a6989586621680492451 :: (~>) a ((~>) b b)) (a6989586621680492452 :: b) (a6989586621680492453 :: t a) = Foldr a6989586621680492451 a6989586621680492452 a6989586621680492453 :: b Source #

data TraverseSym0 a6989586621680816742 Source #

Instances

Instances details

(STraversable t, SApplicative f) => SingI (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods sing :: Sing TraverseSym0 Source #
SuppressUnusedWarnings (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
type Apply (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) (a6989586621680816742 :: a ~> f b) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) (a6989586621680816742 :: a ~> f b) = TraverseSym1 a6989586621680816742 :: TyFun (t a) (f (t b)) -> Type

data TraverseSym1 a6989586621680816742 a6989586621680816743 Source #

Instances

Instances details

(STraversable t, SApplicative f, SingI d) => SingI (TraverseSym1 d :: TyFun (t a) (f (t b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods sing :: Sing (TraverseSym1 d) Source #
SuppressUnusedWarnings (TraverseSym1 a6989586621680816742 :: TyFun (t a) (f (t b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
type Apply (TraverseSym1 a6989586621680816742 :: TyFun (t a) (f (t b)) -> Type) (a6989586621680816743 :: t a) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (TraverseSym1 a6989586621680816742 :: TyFun (t a) (f (t b)) -> Type) (a6989586621680816743 :: t a) = TraverseSym2 a6989586621680816742 a6989586621680816743

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

data PureSym0 a6989586621679559691 Source #

Instances

Instances details

SApplicative f => SingI (PureSym0 :: TyFun a (f a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sing :: Sing PureSym0 Source #
SuppressUnusedWarnings (PureSym0 :: TyFun a (f a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
type Apply (PureSym0 :: TyFun a (f a) -> Type) (a6989586621679559691 :: a) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (PureSym0 :: TyFun a (f a) -> Type) (a6989586621679559691 :: a) = PureSym1 a6989586621679559691 :: f a

type PureSym1 (a6989586621679559691 :: a) = Pure a6989586621679559691 :: f a Source #

data (<*>@#@$) a6989586621679559695 infixl 4 Source #

Instances

Instances details

SApplicative f => SingI ((<*>@#@$) :: TyFun (f (a ~> b)) (f a ~> f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sing :: Sing (<*>@#@$) Source #
SuppressUnusedWarnings ((<*>@#@$) :: TyFun (f (a ~> b)) (f a ~> f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
type Apply ((<*>@#@$) :: TyFun (f (a ~> b)) (f a ~> f b) -> Type) (a6989586621679559695 :: f (a ~> b)) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply ((<>@#@$) :: TyFun (f (a ~> b)) (f a ~> f b) -> Type) (a6989586621679559695 :: f (a ~> b)) = (<>@#@$$) a6989586621679559695

data a6989586621679559695 <*>@#@$$ a6989586621679559696 infixl 4 Source #

Instances

Instances details

(SApplicative f, SingI d) => SingI ((<*>@#@$$) d :: TyFun (f a) (f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sing :: Sing ((<*>@#@$$) d) Source #
SuppressUnusedWarnings ((<*>@#@$$) a6989586621679559695 :: TyFun (f a) (f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
type Apply ((<*>@#@$$) a6989586621679559695 :: TyFun (f a) (f b) -> Type) (a6989586621679559696 :: f a) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply ((<>@#@$$) a6989586621679559695 :: TyFun (f a) (f b) -> Type) (a6989586621679559696 :: f a) = a6989586621679559695 <>@#@$$$ a6989586621679559696

type (<*>@#@$$$) (a6989586621679559695 :: f ((~>) a b)) (a6989586621679559696 :: f a) = (<*>) a6989586621679559695 a6989586621679559696 :: f b infixl 4 Source #

data LiftA2Sym0 a6989586621679559701 Source #

Instances

Instances details

SApplicative f => SingI (LiftA2Sym0 :: TyFun (a ~> (b ~> c)) (f a ~> (f b ~> f c)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sing :: Sing LiftA2Sym0 Source #
SuppressUnusedWarnings (LiftA2Sym0 :: TyFun (a ~> (b ~> c)) (f a ~> (f b ~> f c)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
type Apply (LiftA2Sym0 :: TyFun (a ~> (b ~> c)) (f a ~> (f b ~> f c)) -> Type) (a6989586621679559701 :: a ~> (b ~> c)) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2Sym0 :: TyFun (a ~> (b ~> c)) (f a ~> (f b ~> f c)) -> Type) (a6989586621679559701 :: a ~> (b ~> c)) = LiftA2Sym1 a6989586621679559701 :: TyFun (f a) (f b ~> f c) -> Type

data LiftA2Sym1 a6989586621679559701 a6989586621679559702 Source #

Instances

Instances details

(SApplicative f, SingI d) => SingI (LiftA2Sym1 d :: TyFun (f a) (f b ~> f c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sing :: Sing (LiftA2Sym1 d) Source #
SuppressUnusedWarnings (LiftA2Sym1 a6989586621679559701 :: TyFun (f a) (f b ~> f c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
type Apply (LiftA2Sym1 a6989586621679559701 :: TyFun (f a) (f b ~> f c) -> Type) (a6989586621679559702 :: f a) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2Sym1 a6989586621679559701 :: TyFun (f a) (f b ~> f c) -> Type) (a6989586621679559702 :: f a) = LiftA2Sym2 a6989586621679559701 a6989586621679559702

data LiftA2Sym2 a6989586621679559701 a6989586621679559702 a6989586621679559703 Source #

Instances

Instances details

(SApplicative f, SingI d1, SingI d2) => SingI (LiftA2Sym2 d1 d2 :: TyFun (f b) (f c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sing :: Sing (LiftA2Sym2 d1 d2) Source #
SuppressUnusedWarnings (LiftA2Sym2 a6989586621679559701 a6989586621679559702 :: TyFun (f b) (f c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
type Apply (LiftA2Sym2 a6989586621679559701 a6989586621679559702 :: TyFun (f b) (f c) -> Type) (a6989586621679559703 :: f b) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2Sym2 a6989586621679559701 a6989586621679559702 :: TyFun (f b) (f c) -> Type) (a6989586621679559703 :: f b) = LiftA2Sym3 a6989586621679559701 a6989586621679559702 a6989586621679559703

type LiftA2Sym3 (a6989586621679559701 :: (~>) a ((~>) b c)) (a6989586621679559702 :: f a) (a6989586621679559703 :: f b) = LiftA2 a6989586621679559701 a6989586621679559702 a6989586621679559703 :: f c Source #

data (.@#@$) a6989586621679534187 infixr 9 Source #

Instances

Instances details

SingI ((.@#@$) :: TyFun (b ~> c) ((a ~> b) ~> (a ~> c)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods sing :: Sing (.@#@$) Source #
SuppressUnusedWarnings ((.@#@$) :: TyFun (b ~> c) ((a ~> b) ~> (a ~> c)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
type Apply ((.@#@$) :: TyFun (b ~> c) ((a ~> b) ~> (a ~> c)) -> Type) (a6989586621679534187 :: b ~> c) Source #
Instance details Defined in Data.Singletons.Prelude.Base type Apply ((.@#@$) :: TyFun (b ~> c) ((a ~> b) ~> (a ~> c)) -> Type) (a6989586621679534187 :: b ~> c) = (.@#@$$) a6989586621679534187 :: TyFun (a ~> b) (a ~> c) -> Type

data a6989586621679534187 .@#@$$ a6989586621679534188 infixr 9 Source #

Instances

Instances details

SingI d => SingI ((.@#@$$) d :: TyFun (a ~> b) (a ~> c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods sing :: Sing ((.@#@$$) d) Source #
SuppressUnusedWarnings ((.@#@$$) a6989586621679534187 :: TyFun (a ~> b) (a ~> c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
type Apply ((.@#@$$) a6989586621679534187 :: TyFun (a ~> b) (a ~> c) -> Type) (a6989586621679534188 :: a ~> b) Source #
Instance details Defined in Data.Singletons.Prelude.Base type Apply ((.@#@$$) a6989586621679534187 :: TyFun (a ~> b) (a ~> c) -> Type) (a6989586621679534188 :: a ~> b) = a6989586621679534187 .@#@$$$ a6989586621679534188

data (a6989586621679534187 .@#@$$$ a6989586621679534188) a6989586621679534189 infixr 9 Source #

Instances

Instances details

(SingI d1, SingI d2) => SingI (d1 .@#@$$$ d2 :: TyFun a c -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods sing :: Sing (d1 .@#@$$$ d2) Source #
SuppressUnusedWarnings (a6989586621679534187 .@#@$$$ a6989586621679534188 :: TyFun a c -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
type Apply (a6989586621679534187 .@#@$$$ a6989586621679534188 :: TyFun a c -> Type) (a6989586621679534189 :: a) Source #
Instance details Defined in Data.Singletons.Prelude.Base type Apply (a6989586621679534187 .@#@$$$ a6989586621679534188 :: TyFun a c -> Type) (a6989586621679534189 :: a) = (a6989586621679534187 .@#@$$$$ a6989586621679534188) a6989586621679534189

type (.@#@$$$$) (a6989586621679534187 :: (~>) b c) (a6989586621679534188 :: (~>) a b) (a6989586621679534189 :: a) = (.) a6989586621679534187 a6989586621679534188 a6989586621679534189 :: c infixr 9 Source #

type NilSym0 = '[] :: [a :: Type] Source #

data (:@#@$) a6989586621679304138 infixr 5 Source #

Instances

Instances details

SingI ((:@#@$) :: TyFun a ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing (:@#@$) Source #
SuppressUnusedWarnings ((:@#@$) :: TyFun a ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply ((:@#@$) :: TyFun a ([a] ~> [a]) -> Type) (a6989586621679304138 :: a) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply ((:@#@$) :: TyFun a ([a] ~> [a]) -> Type) (a6989586621679304138 :: a) = (:@#@$$) a6989586621679304138

data a6989586621679304138 :@#@$$ a6989586621679304139 infixr 5 Source #

Instances

Instances details

SingI d => SingI ((:@#@$$) d :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing ((:@#@$$) d) Source #
SuppressUnusedWarnings ((:@#@$$) a6989586621679304138 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
type Apply ((:@#@$$) a6989586621679304138 :: TyFun [a] [a] -> Type) (a6989586621679304139 :: [a]) Source #
Instance details Defined in Data.Singletons.Prelude.Instances type Apply ((:@#@$$) a6989586621679304138 :: TyFun [a] [a] -> Type) (a6989586621679304139 :: [a]) = a6989586621679304138 :@#@$$$ a6989586621679304139

type (:@#@$$$) (a6989586621679304138 :: a) (a6989586621679304139 :: [a]) = '(:) a6989586621679304138 a6989586621679304139 :: [a :: Type] infixr 5 Source #

class SuppressUnusedWarnings t where Source #

This class (which users should never see) is to be instantiated in order to use an otherwise-unused data constructor, such as the "kind-inference" data constructor for defunctionalization symbols.

Methods

suppressUnusedWarnings :: () Source #

Instances

Instances details

SuppressUnusedWarnings NotSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings AllSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings AnySym0 Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (&&@#@$) Source #
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (\|\|@#@$) Source #
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ShowParenSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings UnlinesSym0 Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings UnwordsSym0 Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ThenCmpSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings DemoteSym0 Source #
Instance details Defined in Data.Singletons Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (~>@#@$) Source #
Instance details Defined in Data.Singletons Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings KnownNatSym0 Source #
Instance details Defined in Data.Singletons.TypeLits Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings Log2Sym0 Source #
Instance details Defined in Data.Singletons.TypeLits Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (<=?@#@$) Source #
Instance details Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (^@#@$) Source #
Instance details Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings DivSym0 Source #
Instance details Defined in Data.Singletons.TypeLits Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ModSym0 Source #
Instance details Defined in Data.Singletons.TypeLits Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings QuotSym0 Source #
Instance details Defined in Data.Singletons.TypeLits Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings RemSym0 Source #
Instance details Defined in Data.Singletons.TypeLits Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings DivModSym0 Source #
Instance details Defined in Data.Singletons.TypeLits Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings QuotRemSym0 Source #
Instance details Defined in Data.Singletons.TypeLits Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings KnownSymbolSym0 Source #
Instance details Defined in Data.Singletons.TypeLits Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ShowSpaceSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ShowCommaSpaceSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ShowCharSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ShowStringSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings GetAllSym0 Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings GetAnySym0 Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings XorSym0 Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((&&@#@$$) a6989586621679366665 :: TyFun Bool Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((\|\|@#@$$) a6989586621679366963 :: TyFun Bool Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GuardSym0 :: TyFun Bool (f ()) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (TransposeSym0 :: TyFun [[a]] [[a]] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((++@#@$) :: TyFun [a] ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((!!@#@$) :: TyFun [a] (Nat ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GroupSym0 :: TyFun [a] [[a]] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SortSym0 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UnionSym0 :: TyFun [a] ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((\\@#@$) :: TyFun [a] ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (NubSym0 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (TailsSym0 :: TyFun [a] [[a]] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (InitsSym0 :: TyFun [a] [[a]] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IntersectSym0 :: TyFun [a] ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (PermutationsSym0 :: TyFun [a] [[a]] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SubsequencesSym0 :: TyFun [a] [[a]] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IntercalateSym0 :: TyFun [a] ([[a]] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ReverseSym0 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (InitSym0 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (TailSym0 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LastSym0 :: TyFun [a] a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (HeadSym0 :: TyFun [a] a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (StripPrefixSym0 :: TyFun [a] ([a] ~> Maybe [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ShowListSym0 :: TyFun [a] (Symbol ~> Symbol) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MconcatSym0 :: TyFun [a] a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IsPrefixOfSym0 :: TyFun [a] (NonEmpty a ~> Bool) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GroupSym0 :: TyFun [a] [NonEmpty a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FromListSym0 :: TyFun [a] (NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (InitsSym0 :: TyFun [a] (NonEmpty [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (TailsSym0 :: TyFun [a] (NonEmpty [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (NonEmpty_Sym0 :: TyFun [a] (Maybe (NonEmpty a)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FromJustSym0 :: TyFun (Maybe a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ThenCmpSym1 a6989586621679394586 :: TyFun Ordering Ordering -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((~>@#@$$) a6989586621681337324 :: TyFun Type Type -> Type) Source #
Instance details Defined in Data.Singletons Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<=?@#@$$) a6989586621679473158 :: TyFun Nat Bool -> Type) Source #
Instance details Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((^@#@$$) a6989586621679472866 :: TyFun Nat Nat -> Type) Source #
Instance details Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DivSym1 a6989586621679492680 :: TyFun Nat Nat -> Type) Source #
Instance details Defined in Data.Singletons.TypeLits Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ModSym1 a6989586621679493016 :: TyFun Nat Nat -> Type) Source #
Instance details Defined in Data.Singletons.TypeLits Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (QuotSym1 a6989586621679493492 :: TyFun Nat Nat -> Type) Source #
Instance details Defined in Data.Singletons.TypeLits Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (RemSym1 a6989586621679493481 :: TyFun Nat Nat -> Type) Source #
Instance details Defined in Data.Singletons.TypeLits Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DivModSym1 a6989586621679493510 :: TyFun Nat (Nat, Nat) -> Type) Source #
Instance details Defined in Data.Singletons.TypeLits Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (QuotRemSym1 a6989586621679493503 :: TyFun Nat (Nat, Nat) -> Type) Source #
Instance details Defined in Data.Singletons.TypeLits Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FromIntegerSym0 :: TyFun Nat a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Num Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ToEnumSym0 :: TyFun Nat a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DropSym0 :: TyFun Nat ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (TakeSym0 :: TyFun Nat ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SplitAtSym0 :: TyFun Nat ([a] ~> ([a], [a])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ReplicateSym0 :: TyFun Nat (a ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ShowsPrecSym0 :: TyFun Nat (a ~> (Symbol ~> Symbol)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (TakeSym0 :: TyFun Nat (NonEmpty a ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DropSym0 :: TyFun Nat (NonEmpty a ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SplitAtSym0 :: TyFun Nat (NonEmpty a ~> ([a], [a])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ShowCharSym1 a6989586621680279534 :: TyFun Symbol Symbol -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ShowStringSym1 a6989586621680279523 :: TyFun Symbol Symbol -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FromStringSym0 :: TyFun Symbol a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.IsString Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (JustSym0 :: TyFun a (Maybe a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((:@#@$) :: TyFun a ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((:\|@#@$) :: TyFun a ([a] ~> NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IdentitySym0 :: TyFun a (Identity a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((==@#@$) :: TyFun a (a ~> Bool) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DefaultEqSym0 :: TyFun k (k ~> Bool) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MinSym0 :: TyFun a (a ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MaxSym0 :: TyFun a (a ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((>@#@$) :: TyFun a (a ~> Bool) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<@#@$) :: TyFun a (a ~> Bool) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DownSym0 :: TyFun a (Down a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (NegateSym0 :: TyFun a a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Num Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((-@#@$) :: TyFun a (a ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Num Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((+@#@$) :: TyFun a (a ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Num Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SignumSym0 :: TyFun a a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Num Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (AbsSym0 :: TyFun a a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Num Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((*@#@$) :: TyFun a (a ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Num Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SubtractSym0 :: TyFun a (a ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Num Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (AsTypeOfSym0 :: TyFun a (a ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IdSym0 :: TyFun a a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (EnumFromThenToSym0 :: TyFun a (a ~> (a ~> [a])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (EnumFromToSym0 :: TyFun a (a ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FromEnumSym0 :: TyFun a Nat -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (PredSym0 :: TyFun a a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SuccSym0 :: TyFun a a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<>@#@$) :: TyFun a (a ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DualSym0 :: TyFun a (Dual a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SumSym0 :: TyFun a (Sum a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ProductSym0 :: TyFun a (Product a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MinSym0 :: TyFun a (Min a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MaxSym0 :: TyFun a (Max a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FirstSym0 :: TyFun a (First a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LastSym0 :: TyFun a (Last a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (WrapMonoidSym0 :: TyFun m (WrappedMonoid m) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (InsertSym0 :: TyFun a ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DeleteSym0 :: TyFun a ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ElemIndicesSym0 :: TyFun a ([a] ~> [Nat]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IntersperseSym0 :: TyFun a ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Show_Sym0 :: TyFun a Symbol -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ShowsSym0 :: TyFun a (Symbol ~> Symbol) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MappendSym0 :: TyFun a (a ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (AndSym0 :: TyFun (t Bool) Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (OrSym0 :: TyFun (t Bool) Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IntersperseSym0 :: TyFun a (NonEmpty a ~> NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (InsertSym0 :: TyFun a ([a] ~> NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<\|@#@$) :: TyFun a (NonEmpty a ~> NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ConsSym0 :: TyFun a (NonEmpty a ~> NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SameKindSym0 :: TyFun k (k ~> Constraint) -> Type) Source #
Instance details Defined in Data.Singletons Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (KindOfSym0 :: TyFun k Type -> Type) Source #
Instance details Defined in Data.Singletons Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (TextSym0 :: TyFun s (ErrorMessage' s) -> Type) Source #
Instance details Defined in Data.Singletons.TypeError Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (AbsurdSym0 :: TyFun Void a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Void Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GetMinSym0 :: TyFun (Min a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GetMaxSym0 :: TyFun (Max a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UnwrapMonoidSym0 :: TyFun (WrappedMonoid m) m -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (RunIdentitySym0 :: TyFun (Identity a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GetDualSym0 :: TyFun (Dual a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GetSumSym0 :: TyFun (Sum a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GetProductSym0 :: TyFun (Product a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GetDownSym0 :: TyFun (Down a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SconcatSym0 :: TyFun (NonEmpty a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (NubSym0 :: TyFun (NonEmpty a) (NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((!!@#@$) :: TyFun (NonEmpty a) (Nat ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Group1Sym0 :: TyFun (NonEmpty a) (NonEmpty (NonEmpty a)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ToListSym0 :: TyFun (NonEmpty a) [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ReverseSym0 :: TyFun (NonEmpty a) (NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SortSym0 :: TyFun (NonEmpty a) (NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (InitSym0 :: TyFun (NonEmpty a) [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LastSym0 :: TyFun (NonEmpty a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (TailSym0 :: TyFun (NonEmpty a) [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (HeadSym0 :: TyFun (NonEmpty a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UnconsSym0 :: TyFun (NonEmpty a) (a, Maybe (NonEmpty a)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LengthSym0 :: TyFun (NonEmpty a) Nat -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (TransposeSym0 :: TyFun (NonEmpty (NonEmpty a)) (NonEmpty (NonEmpty a)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ShowParenSym1 a6989586621680279507 :: TyFun (Symbol ~> Symbol) (Symbol ~> Symbol) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (InsertBySym0 :: TyFun (a ~> (a ~> Ordering)) (a ~> ([a] ~> [a])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Nat]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Scanr1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Scanl1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Foldl1'Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ShowListWithSym0 :: TyFun (a ~> (Symbol ~> Symbol)) ([a] ~> (Symbol ~> Symbol)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (NubBySym0 :: TyFun (a ~> (a ~> Bool)) (NonEmpty a ~> NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [NonEmpty a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GroupBy1Sym0 :: TyFun (a ~> (a ~> Bool)) (NonEmpty a ~> NonEmpty (NonEmpty a)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (TakeWhileSym0 :: TyFun (a ~> Bool) (NonEmpty a ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DropWhileSym0 :: TyFun (a ~> Bool) (NonEmpty a ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SpanSym0 :: TyFun (a ~> Bool) (NonEmpty a ~> ([a], [a])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (BreakSym0 :: TyFun (a ~> Bool) (NonEmpty a ~> ([a], [a])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FilterSym0 :: TyFun (a ~> Bool) (NonEmpty a ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (PartitionSym0 :: TyFun (a ~> Bool) (NonEmpty a ~> ([a], [a])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SortBySym0 :: TyFun (a ~> (a ~> Ordering)) (NonEmpty a ~> NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Scanl1Sym0 :: TyFun (a ~> (a ~> a)) (NonEmpty a ~> NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Scanr1Sym0 :: TyFun (a ~> (a ~> a)) (NonEmpty a ~> NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (TypeErrorSym0 :: TyFun PErrorMessage a -> Type) Source #
Instance details Defined in Data.Singletons.TypeError Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((:<>:@#@$) :: TyFun (ErrorMessage' s) (ErrorMessage' s ~> ErrorMessage' s) -> Type) Source #
Instance details Defined in Data.Singletons.TypeError Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((:$$:@#@$) :: TyFun (ErrorMessage' s) (ErrorMessage' s ~> ErrorMessage' s) -> Type) Source #
Instance details Defined in Data.Singletons.TypeError Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IntercalateSym1 a6989586621679969986 :: TyFun [[a]] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (RightsSym0 :: TyFun [Either a b] [b] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LeftsSym0 :: TyFun [Either a b] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UnzipSym0 :: TyFun [(a, b)] ([a], [b]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((:@#@$$) a6989586621679304138 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((:\|@#@$$) a6989586621679304206 :: TyFun [a] (NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((++@#@$$) a6989586621679534210 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GenericLengthSym0 :: TyFun [a] i -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (NubBySym1 a6989586621679968840 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (PartitionSym1 a6989586621679968951 :: TyFun [a] ([a], [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DropSym1 a6989586621679969037 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (TakeSym1 a6989586621679969050 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SplitAtSym1 a6989586621679969030 :: TyFun [a] ([a], [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (BreakSym1 a6989586621679969063 :: TyFun [a] ([a], [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SpanSym1 a6989586621679969098 :: TyFun [a] ([a], [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GroupBySym1 a6989586621679968973 :: TyFun [a] [[a]] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DropWhileSym1 a6989586621679969152 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (TakeWhileSym1 a6989586621679969167 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FilterSym1 a6989586621679969267 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (InsertSym1 a6989586621679969005 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SortBySym1 a6989586621679969344 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DeleteFirstsBySym1 a6989586621679969356 :: TyFun [a] ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UnionBySym1 a6989586621679968820 :: TyFun [a] ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UnionSym1 a6989586621679968812 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DeleteSym1 a6989586621679969396 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((\\@#@$$) a6989586621679969385 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipSym0 :: TyFun [a] ([b] ~> [(a, b)]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FindIndicesSym1 a6989586621679969210 :: TyFun [a] [Nat] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ElemIndicesSym1 a6989586621679969242 :: TyFun [a] [Nat] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FindIndexSym1 a6989586621679969233 :: TyFun [a] (Maybe Nat) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ElemIndexSym1 a6989586621679969251 :: TyFun [a] (Maybe Nat) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IsPrefixOfSym1 a6989586621679969624 :: TyFun [a] Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Scanr1Sym1 a6989586621679969758 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Scanl1Sym1 a6989586621679969796 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IsInfixOfSym1 a6989586621679969610 :: TyFun [a] Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IntersectBySym1 a6989586621679969181 :: TyFun [a] ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IntersectSym1 a6989586621679969203 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Foldl1'Sym1 a6989586621679969872 :: TyFun [a] a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IntersperseSym1 a6989586621679969993 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IsSuffixOfSym1 a6989586621679969617 :: TyFun [a] Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DropWhileEndSym1 a6989586621679969135 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (StripPrefixSym1 a6989586621680091346 :: TyFun [a] (Maybe [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ShowListWithSym1 a6989586621680279542 :: TyFun [a] (Symbol ~> Symbol) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GroupBySym1 a6989586621681185955 :: TyFun [a] [NonEmpty a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (InsertSym1 a6989586621681186133 :: TyFun [a] (NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FromMaybeSym1 a6989586621679502222 :: TyFun (Maybe a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a b) Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((!!@#@$$) a6989586621679968875 :: TyFun Nat a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((!!@#@$$) a6989586621681185857 :: TyFun Nat a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ReplicateM_Sym0 :: TyFun Nat (m a ~> m ()) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ReplicateMSym0 :: TyFun Nat (m a ~> m [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ShowListSym1 a6989586621680279577 :: TyFun Symbol Symbol -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ShowsSym1 a6989586621680279560 :: TyFun Symbol Symbol -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ShowParenSym2 a6989586621680279507 a6989586621680279508 :: TyFun Symbol Symbol -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SwapSym0 :: TyFun (a, b) (b, a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Tuple Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SndSym0 :: TyFun (a, b) b -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Tuple Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FstSym0 :: TyFun (a, b) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Tuple Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LeftSym0 :: TyFun a (Either a b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (RightSym0 :: TyFun b (Either a b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple2Sym0 :: TyFun a (b ~> (a, b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Bool_Sym1 a6989586621679365865 :: TyFun a (Bool ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((==@#@$$) a6989586621679370055 :: TyFun a Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((/=@#@$$) a6989586621679370058 :: TyFun a Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DefaultEqSym1 a6989586621679370061 :: TyFun k Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<=@#@$$) a6989586621679383650 :: TyFun a Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (CompareSym1 a6989586621679383640 :: TyFun a Ordering -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MinSym1 a6989586621679383670 :: TyFun a a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MaxSym1 a6989586621679383665 :: TyFun a a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((>=@#@$$) a6989586621679383660 :: TyFun a Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((>@#@$$) a6989586621679383655 :: TyFun a Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<@#@$$) a6989586621679383645 :: TyFun a Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ErrorSym0 :: TyFun k0 k -> Type) Source #
Instance details Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ErrorWithoutStackTraceSym0 :: TyFun k0 k -> Type) Source #
Instance details Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((-@#@$$) a6989586621679517801 :: TyFun a a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Num Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((+@#@$$) a6989586621679517796 :: TyFun a a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Num Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((*@#@$$) a6989586621679517806 :: TyFun a a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Num Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SubtractSym1 a6989586621679517789 :: TyFun a a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Num Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SeqSym0 :: TyFun a (b ~> b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ConstSym0 :: TyFun a (b ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (AsTypeOfSym1 a6989586621679534167 :: TyFun a a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (PureSym0 :: TyFun a (f a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (WhenSym1 a6989586621679559610 :: TyFun (f ()) (f ()) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ReturnSym0 :: TyFun a (m a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (JoinSym0 :: TyFun (m (m a)) (m a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (VoidSym0 :: TyFun (f a) (f ()) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Functor Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((&@#@$) :: TyFun a ((a ~> b) ~> b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Function Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (EnumFromThenToSym1 a6989586621679758488 :: TyFun a (a ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (EnumFromToSym1 a6989586621679758482 :: TyFun a [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<>@#@$$) a6989586621679830624 :: TyFun a a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ReplicateSym1 a6989586621679968895 :: TyFun a [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (InsertBySym1 a6989586621679969324 :: TyFun a ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DeleteBySym1 a6989586621679969366 :: TyFun a ([a] ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ShowsPrecSym1 a6989586621680279568 :: TyFun a (Symbol ~> Symbol) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MappendSym1 a6989586621680347244 :: TyFun a a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (AsProxyTypeOfSym0 :: TyFun a (proxy a ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ProductSym0 :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SumSym0 :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MinimumSym0 :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MaximumSym0 :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ToListSym0 :: TyFun (t a) [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ConcatSym0 :: TyFun (t [a]) [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FoldSym0 :: TyFun (t m) m -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ArgSym0 :: TyFun a (b ~> Arg a b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Applicative Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UnlessSym1 a6989586621681292265 :: TyFun (f ()) (f ()) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SameKindSym1 a6989586621681337319 :: TyFun k Constraint -> Type) Source #
Instance details Defined in Data.Singletons Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ShowTypeSym0 :: TyFun t (ErrorMessage' s) -> Type) Source #
Instance details Defined in Data.Singletons.TypeError Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UnzipSym0 :: TyFun (NonEmpty (a, b)) (NonEmpty a, NonEmpty b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (NubBySym1 a6989586621681185794 :: TyFun (NonEmpty a) (NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipSym0 :: TyFun (NonEmpty a) (NonEmpty b ~> NonEmpty (a, b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IsPrefixOfSym1 a6989586621681185876 :: TyFun (NonEmpty a) Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GroupBy1Sym1 a6989586621681185903 :: TyFun (NonEmpty a) (NonEmpty (NonEmpty a)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IntersperseSym1 a6989586621681186080 :: TyFun (NonEmpty a) (NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (TakeSym1 a6989586621681186067 :: TyFun (NonEmpty a) [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DropSym1 a6989586621681186058 :: TyFun (NonEmpty a) [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SplitAtSym1 a6989586621681186049 :: TyFun (NonEmpty a) ([a], [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (TakeWhileSym1 a6989586621681186040 :: TyFun (NonEmpty a) [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DropWhileSym1 a6989586621681186031 :: TyFun (NonEmpty a) [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SpanSym1 a6989586621681186022 :: TyFun (NonEmpty a) ([a], [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (BreakSym1 a6989586621681186013 :: TyFun (NonEmpty a) ([a], [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FilterSym1 a6989586621681186004 :: TyFun (NonEmpty a) [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (PartitionSym1 a6989586621681185995 :: TyFun (NonEmpty a) ([a], [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SortBySym1 a6989586621681185781 :: TyFun (NonEmpty a) (NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Scanl1Sym1 a6989586621681186099 :: TyFun (NonEmpty a) (NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Scanr1Sym1 a6989586621681186091 :: TyFun (NonEmpty a) (NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<\|@#@$$) a6989586621681186196 :: TyFun (NonEmpty a) (NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ConsSym1 a6989586621681186189 :: TyFun (NonEmpty a) (NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ComparingSym0 :: TyFun (b ~> a) (b ~> (b ~> Ordering)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UntilSym1 a6989586621679534129 :: TyFun (a ~> a) (a ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (($!@#@$) :: TyFun (a ~> b) (a ~> b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (($@#@$) :: TyFun (a ~> b) (a ~> b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MapSym0 :: TyFun (a ~> b) ([a] ~> [b]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> ([a] ~> b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ScanrSym0 :: TyFun (a ~> (b ~> b)) (b ~> ([a] ~> [b])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ScanlSym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> [b])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GroupWithSym0 :: TyFun (a ~> b) ([a] ~> [NonEmpty a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GroupAllWithSym0 :: TyFun (a ~> b) ([a] ~> [NonEmpty a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GroupWith1Sym0 :: TyFun (a ~> b) (NonEmpty a ~> NonEmpty (NonEmpty a)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MapSym0 :: TyFun (a ~> b) (NonEmpty a ~> NonEmpty b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SortWithSym0 :: TyFun (a ~> o) (NonEmpty a ~> NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GroupAllWith1Sym0 :: TyFun (a ~> b) (NonEmpty a ~> NonEmpty (NonEmpty a)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ScanlSym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> NonEmpty b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ScanrSym0 :: TyFun (a ~> (b ~> b)) (b ~> ([a] ~> NonEmpty b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UnfoldrSym0 :: TyFun (a ~> (b, Maybe a)) (a ~> NonEmpty b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UnfoldSym0 :: TyFun (a ~> (b, Maybe a)) (a ~> NonEmpty b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ApplySym0 :: TyFun (k1 ~> k2) (k1 ~> k2) -> Type) Source #
Instance details Defined in Data.Singletons Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((@@@#@$) :: TyFun (k1 ~> k2) (k1 ~> k2) -> Type) Source #
Instance details Defined in Data.Singletons Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((:<>:@#@$$) a6989586621681349587 :: TyFun (ErrorMessage' s) (ErrorMessage' s) -> Type) Source #
Instance details Defined in Data.Singletons.TypeError Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((:$$:@#@$$) a6989586621681349590 :: TyFun (ErrorMessage' s) (ErrorMessage' s) -> Type) Source #
Instance details Defined in Data.Singletons.TypeError Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Bool_Sym2 a6989586621679365865 a6989586621679365866 :: TyFun Bool a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FailSym0 :: TyFun [Char] (m a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Fail Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LookupSym1 a6989586621679968958 :: TyFun [(a, b)] (Maybe b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Unzip3Sym0 :: TyFun [(a, b, c)] ([a], [b], [c]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MapMaybeSym1 a6989586621679502192 :: TyFun [a] [b] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MapSym1 a6989586621679534219 :: TyFun [a] [b] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (InsertBySym2 a6989586621679969324 a6989586621679969325 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DeleteBySym2 a6989586621679969366 a6989586621679969367 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (DeleteFirstsBySym2 a6989586621679969356 a6989586621679969357 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UnionBySym2 a6989586621679968820 a6989586621679968821 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip3Sym0 :: TyFun [a] ([b] ~> ([c] ~> [(a, b, c)])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipSym1 a6989586621679969585 :: TyFun [b] [(a, b)] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (IntersectBySym2 a6989586621679969181 a6989586621679969182 :: TyFun [a] [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GroupWithSym1 a6989586621681185946 :: TyFun [a] [NonEmpty a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GroupAllWithSym1 a6989586621681185937 :: TyFun [a] [NonEmpty a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FilterMSym1 a6989586621681292398 :: TyFun [a] (m [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ShowsPrecSym2 a6989586621680279568 a6989586621680279569 :: TyFun Symbol Symbol -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ShowListWithSym2 a6989586621680279542 a6989586621680279543 :: TyFun Symbol Symbol -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple2Sym1 a6989586621679304233 :: TyFun b (a, b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple3Sym0 :: TyFun a (b ~> (c ~> (a, b, c))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ComparingSym1 a6989586621679383631 :: TyFun b (b ~> Ordering) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SeqSym1 a6989586621679534120 :: TyFun b b -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UntilSym2 a6989586621679534129 a6989586621679534130 :: TyFun a a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (($!@#@$$) a6989586621679534147 :: TyFun a b -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (($@#@$$) a6989586621679534156 :: TyFun a b -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ConstSym1 a6989586621679534200 :: TyFun b a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FoldrSym1 a6989586621679534230 :: TyFun b ([a] ~> b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<$@#@$) :: TyFun a (f b ~> f a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<*>@#@$) :: TyFun (f (a ~> b)) (f a ~> f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<**>@#@$) :: TyFun (f a) (f (a ~> b) ~> f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((>>=@#@$) :: TyFun (m a) ((a ~> m b) ~> m b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ApSym0 :: TyFun (m (a ~> b)) (m a ~> m b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<\|>@#@$) :: TyFun (f a) (f a ~> f a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MplusSym0 :: TyFun (m a) (m a ~> m a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (($>@#@$) :: TyFun (f a) (b ~> f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Functor Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<&>@#@$) :: TyFun (f a) ((a ~> b) ~> f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Functor Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (EnumFromThenToSym2 a6989586621679758488 a6989586621679758489 :: TyFun a [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UnfoldrSym1 a6989586621679969650 :: TyFun b [a] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ScanrSym1 a6989586621679969778 :: TyFun b ([a] ~> [b]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ScanlSym1 a6989586621679969805 :: TyFun b ([a] ~> [b]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (AsProxyTypeOfSym1 a6989586621680453165 :: TyFun (proxy a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (AnySym1 a6989586621680492302 :: TyFun (t a) Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ElemSym1 a6989586621680492497 :: TyFun (t a) Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (NotElemSym1 a6989586621680492244 :: TyFun (t a) Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LengthSym0 :: TyFun (t a) Nat -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (NullSym0 :: TyFun (t a) Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Foldl1Sym1 a6989586621680492483 :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MaximumBySym1 a6989586621680492273 :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MinimumBySym1 a6989586621680492253 :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Foldr1Sym1 a6989586621680492478 :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SequenceA_Sym0 :: TyFun (t (f a)) (f ()) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Sequence_Sym0 :: TyFun (t (m a)) (m ()) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (AllSym1 a6989586621680492293 :: TyFun (t a) Bool -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FindSym1 a6989586621680492226 :: TyFun (t a) (Maybe a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ConstSym0 :: TyFun a (Const a b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ArgSym1 a6989586621680936903 :: TyFun b (Arg a b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MzipSym0 :: TyFun (m a) (m b ~> m (a, b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Zip Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MunzipSym0 :: TyFun (m (a, b)) (m a, m b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Zip Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ScanlSym1 a6989586621681186122 :: TyFun b ([a] ~> NonEmpty b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ScanrSym1 a6989586621681186110 :: TyFun b ([a] ~> NonEmpty b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UnfoldrSym1 a6989586621681186222 :: TyFun a (NonEmpty b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UnfoldSym1 a6989586621681186257 :: TyFun a (NonEmpty b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MfilterSym1 a6989586621681292236 :: TyFun (m a) (m a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ReplicateM_Sym1 a6989586621681292275 :: TyFun (m a) (m ()) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ReplicateMSym1 a6989586621681292293 :: TyFun (m a) (m [a]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ApplySym1 a6989586621681337327 :: TyFun k1 k2 -> Type) Source #
Instance details Defined in Data.Singletons Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((@@@#@$$) a6989586621681337330 :: TyFun k1 k2 -> Type) Source #
Instance details Defined in Data.Singletons Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GetConstSym0 :: TyFun (Const a b) a -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipSym1 a6989586621681185848 :: TyFun (NonEmpty b) (NonEmpty (a, b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GroupWith1Sym1 a6989586621681185896 :: TyFun (NonEmpty a) (NonEmpty (NonEmpty a)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MapSym1 a6989586621681186152 :: TyFun (NonEmpty a) (NonEmpty b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (SortWithSym1 a6989586621681185772 :: TyFun (NonEmpty a) (NonEmpty a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (GroupAllWith1Sym1 a6989586621681185887 :: TyFun (NonEmpty a) (NonEmpty (NonEmpty a)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (CurrySym0 :: TyFun ((a, b) ~> c) (a ~> (b ~> c)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Tuple Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UncurrySym0 :: TyFun (a ~> (b ~> c)) ((a, b) ~> c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Tuple Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Maybe_Sym1 a6989586621679500654 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FlipSym0 :: TyFun (a ~> (b ~> c)) (b ~> (a ~> c)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((.@#@$) :: TyFun (b ~> c) ((a ~> b) ~> (a ~> c)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FmapSym0 :: TyFun (a ~> b) (f a ~> f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftASym0 :: TyFun (a ~> b) (f a ~> f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((=<<@#@$) :: TyFun (a ~> m b) (m a ~> m b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftMSym0 :: TyFun (a1 ~> r) (m a1 ~> m r) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<$>@#@$) :: TyFun (a ~> b) (f a ~> f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Functor Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((&@#@$$) a6989586621679747410 :: TyFun (a ~> b) b -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Function Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (OnSym0 :: TyFun (b ~> (b ~> c)) ((a ~> b) ~> (a ~> (a ~> c))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Function Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWithSym0 :: TyFun (a ~> (b ~> c)) ([a] ~> ([b] ~> [c])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FoldMapDefaultSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FmapDefaultSym0 :: TyFun (a ~> b) (t a ~> t b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWithSym0 :: TyFun (a ~> (b ~> c)) (NonEmpty a ~> (NonEmpty b ~> NonEmpty c)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<$!>@#@$) :: TyFun (a ~> b) (m a ~> m b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Unzip4Sym0 :: TyFun [(a, b, c, d)] ([a], [b], [c], [d]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FoldrSym2 a6989586621679534230 a6989586621679534231 :: TyFun [a] b -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWithSym1 a6989586621679969561 :: TyFun [a] ([b] ~> [c]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip3Sym1 a6989586621679969573 :: TyFun [b] ([c] ~> [(a, b, c)]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ScanrSym2 a6989586621679969778 a6989586621679969779 :: TyFun [a] [b] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ScanlSym2 a6989586621679969805 a6989586621679969806 :: TyFun [a] [b] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip4Sym0 :: TyFun [a] ([b] ~> ([c] ~> ([d] ~> [(a, b, c, d)]))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ScanlSym2 a6989586621681186122 a6989586621681186123 :: TyFun [a] (NonEmpty b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ScanrSym2 a6989586621681186110 a6989586621681186111 :: TyFun [a] (NonEmpty b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Maybe_Sym2 a6989586621679500654 a6989586621679500655 :: TyFun (Maybe a) b -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (UncurrySym1 a6989586621679360426 :: TyFun (a, b) c -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Tuple Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple3Sym1 a6989586621679304264 :: TyFun b (c ~> (a, b, c)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple4Sym0 :: TyFun a (b ~> (c ~> (d ~> (a, b, c, d)))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (CurrySym1 a6989586621679360434 :: TyFun a (b ~> c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Tuple Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ComparingSym2 a6989586621679383631 a6989586621679383632 :: TyFun b Ordering -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FlipSym1 a6989586621679534175 :: TyFun b (a ~> c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FmapSym1 a6989586621679559667 :: TyFun (f a) (f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<$@#@$$) a6989586621679559672 :: TyFun (f b) (f a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<*>@#@$$) a6989586621679559695 :: TyFun (f a) (f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<*@#@$) :: TyFun (f a) (f b ~> f a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((*>@#@$) :: TyFun (f a) (f b ~> f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<**>@#@$$) a6989586621679559655 :: TyFun (f (a ~> b)) (f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftASym1 a6989586621679559644 :: TyFun (f a) (f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((>>@#@$) :: TyFun (m a) (m b ~> m b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((=<<@#@$$) a6989586621679559620 :: TyFun (m a) (m b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftMSym1 a6989586621679559599 :: TyFun (m a1) (m r) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ApSym1 a6989586621679559470 :: TyFun (m a) (m b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<\|>@#@$$) a6989586621679559816 :: TyFun (f a) (f a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MplusSym1 a6989586621679559822 :: TyFun (m a) (m a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (($>@#@$$) a6989586621679731612 :: TyFun b (f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Functor Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<$>@#@$$) a6989586621679731630 :: TyFun (f a) (f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Functor Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Foldl'Sym1 a6989586621680492472 :: TyFun b (t a ~> b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FoldlSym1 a6989586621680492465 :: TyFun b (t a ~> b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FoldrSym1 a6989586621680492451 :: TyFun b (t a ~> b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FoldMapSym1 a6989586621680492445 :: TyFun (t a) m -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Foldr'Sym1 a6989586621680492458 :: TyFun b (t a ~> b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (For_Sym0 :: TyFun (t a) ((a ~> f b) ~> f ()) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ForM_Sym0 :: TyFun (t a) ((a ~> m b) ~> m ()) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (AsumSym0 :: TyFun (t (f a)) (f a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MsumSym0 :: TyFun (t (m a)) (m a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ConcatMapSym1 a6989586621680492321 :: TyFun (t a) [b] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FoldMapDefaultSym1 a6989586621680822963 :: TyFun (t a) m -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FmapDefaultSym1 a6989586621680822982 :: TyFun (t a) (t b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ForMSym0 :: TyFun (t a) ((a ~> m b) ~> m (t b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ForSym0 :: TyFun (t a) ((a ~> f b) ~> f (t b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MzipSym1 a6989586621681150519 :: TyFun (m b) (m (a, b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Zip Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<$!>@#@$$) a6989586621681292252 :: TyFun (m a) (m b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWithSym1 a6989586621681185837 :: TyFun (NonEmpty a) (NonEmpty b ~> NonEmpty c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((.@#@$$) a6989586621679534187 :: TyFun (a ~> b) (a ~> c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftA2Sym0 :: TyFun (a ~> (b ~> c)) (f a ~> (f b ~> f c)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((>>=@#@$$) a6989586621679559775 :: TyFun (a ~> m b) (m b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftM2Sym0 :: TyFun (a1 ~> (a2 ~> r)) (m a1 ~> (m a2 ~> m r)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<&>@#@$$) a6989586621679731619 :: TyFun (a ~> b) (f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Functor Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (OnSym1 a6989586621679747423 :: TyFun (a ~> b) (a ~> (a ~> c)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Function Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith3Sym0 :: TyFun (a ~> (b ~> (c ~> d))) ([a] ~> ([b] ~> ([c] ~> [d]))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Either_Sym1 a6989586621680470389 :: TyFun (b ~> c) (Either a b ~> c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FoldrMSym0 :: TyFun (a ~> (b ~> m b)) (b ~> (t a ~> m b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FoldlMSym0 :: TyFun (b ~> (a ~> m b)) (b ~> (t a ~> m b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Traverse_Sym0 :: TyFun (a ~> f b) (t a ~> f ()) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MapM_Sym0 :: TyFun (a ~> m b) (t a ~> m ()) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MapAccumRSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MapAccumLSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MzipWithSym0 :: TyFun (a ~> (b ~> c)) (m a ~> (m b ~> m c)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Zip Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWithM_Sym0 :: TyFun (a ~> (b ~> m c)) ([a] ~> ([b] ~> m ())) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWithMSym0 :: TyFun (a ~> (b ~> m c)) ([a] ~> ([b] ~> m [c])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MapAndUnzipMSym0 :: TyFun (a ~> m (b, c)) ([a] ~> m ([b], [c])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((>=>@#@$) :: TyFun (a ~> m b) ((b ~> m c) ~> (a ~> m c)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<=<@#@$) :: TyFun (b ~> m c) ((a ~> m b) ~> (a ~> m c)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Unzip5Sym0 :: TyFun [(a, b, c, d, e)] ([a], [b], [c], [d], [e]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith3Sym1 a6989586621679969546 :: TyFun [a] ([b] ~> ([c] ~> [d])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWithSym2 a6989586621679969561 a6989586621679969562 :: TyFun [b] [c] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip3Sym2 a6989586621679969573 a6989586621679969574 :: TyFun [c] [(a, b, c)] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip5Sym0 :: TyFun [a] ([b] ~> ([c] ~> ([d] ~> ([e] ~> [(a, b, c, d, e)])))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip4Sym1 a6989586621680091335 :: TyFun [b] ([c] ~> ([d] ~> [(a, b, c, d)])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWithM_Sym1 a6989586621681292338 :: TyFun [a] ([b] ~> m ()) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWithMSym1 a6989586621681292348 :: TyFun [a] ([b] ~> m [c]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MapAndUnzipMSym1 a6989586621681292357 :: TyFun [a] (m ([b], [c])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Either_Sym2 a6989586621680470389 a6989586621680470390 :: TyFun (Either a b) c -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple3Sym2 a6989586621679304264 a6989586621679304265 :: TyFun c (a, b, c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple4Sym1 a6989586621679304310 :: TyFun b (c ~> (d ~> (a, b, c, d))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple5Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (a, b, c, d, e))))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (CurrySym2 a6989586621679360434 a6989586621679360435 :: TyFun b c -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Tuple Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FlipSym2 a6989586621679534175 a6989586621679534176 :: TyFun a c -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (a6989586621679534187 .@#@$$$ a6989586621679534188 :: TyFun a c -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftA2Sym1 a6989586621679559701 :: TyFun (f a) (f b ~> f c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<*@#@$$) a6989586621679559712 :: TyFun (f b) (f a) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((*>@#@$$) a6989586621679559707 :: TyFun (f b) (f b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((>>@#@$$) a6989586621679559780 :: TyFun (m b) (m b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftM2Sym1 a6989586621679559582 :: TyFun (m a1) (m a2 ~> m r) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (OnSym2 a6989586621679747423 a6989586621679747424 :: TyFun a (a ~> c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Function Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Foldl'Sym2 a6989586621680492472 a6989586621680492473 :: TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FoldlSym2 a6989586621680492465 a6989586621680492466 :: TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FoldrSym2 a6989586621680492451 a6989586621680492452 :: TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FoldrMSym1 a6989586621680492425 :: TyFun b (t a ~> m b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Foldr'Sym2 a6989586621680492458 a6989586621680492459 :: TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FoldlMSym1 a6989586621680492407 :: TyFun b (t a ~> m b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Traverse_Sym1 a6989586621680492399 :: TyFun (t a) (f ()) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MapM_Sym1 a6989586621680492379 :: TyFun (t a) (m ()) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (TraverseSym1 a6989586621680816742 :: TyFun (t a) (f (t b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MapMSym1 a6989586621680816750 :: TyFun (t a) (m (t b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MapAccumRSym1 a6989586621680822996 :: TyFun a (t b ~> (a, t c)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MapAccumLSym1 a6989586621680823006 :: TyFun a (t b ~> (a, t c)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MzipWithSym1 a6989586621681150525 :: TyFun (m a) (m b ~> m c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Zip Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWithSym2 a6989586621681185837 a6989586621681185838 :: TyFun (NonEmpty b) (NonEmpty c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.NonEmpty Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftA3Sym0 :: TyFun (a ~> (b ~> (c ~> d))) (f a ~> (f b ~> (f c ~> f d))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftM3Sym0 :: TyFun (a1 ~> (a2 ~> (a3 ~> r))) (m a1 ~> (m a2 ~> (m a3 ~> m r))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith4Sym0 :: TyFun (a ~> (b ~> (c ~> (d ~> e)))) ([a] ~> ([b] ~> ([c] ~> ([d] ~> [e])))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (For_Sym1 a6989586621680492390 :: TyFun (a ~> f b) (f ()) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ForM_Sym1 a6989586621680492370 :: TyFun (a ~> m b) (m ()) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ForMSym1 a6989586621680823019 :: TyFun (a ~> m b) (m (t b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ForSym1 a6989586621680823030 :: TyFun (a ~> f b) (f (t b)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((>=>@#@$$) a6989586621681292383 :: TyFun (b ~> m c) (a ~> m c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings ((<=<@#@$$) a6989586621681292371 :: TyFun (a ~> m b) (a ~> m c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Unzip6Sym0 :: TyFun [(a, b, c, d, e, f)] ([a], [b], [c], [d], [e], [f]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith3Sym2 a6989586621679969546 a6989586621679969547 :: TyFun [b] ([c] ~> [d]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith4Sym1 a6989586621680091215 :: TyFun [a] ([b] ~> ([c] ~> ([d] ~> [e]))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip6Sym0 :: TyFun [a] ([b] ~> ([c] ~> ([d] ~> ([e] ~> ([f] ~> [(a, b, c, d, e, f)]))))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip5Sym1 a6989586621680091312 :: TyFun [b] ([c] ~> ([d] ~> ([e] ~> [(a, b, c, d, e)]))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip4Sym2 a6989586621680091335 a6989586621680091336 :: TyFun [c] ([d] ~> [(a, b, c, d)]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWithM_Sym2 a6989586621681292338 a6989586621681292339 :: TyFun [b] (m ()) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWithMSym2 a6989586621681292348 a6989586621681292349 :: TyFun [b] (m [c]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple4Sym2 a6989586621679304310 a6989586621679304311 :: TyFun c (d ~> (a, b, c, d)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple5Sym1 a6989586621679304373 :: TyFun b (c ~> (d ~> (e ~> (a, b, c, d, e)))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple6Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f)))))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftA2Sym2 a6989586621679559701 a6989586621679559702 :: TyFun (f b) (f c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftA3Sym1 a6989586621679559633 :: TyFun (f a) (f b ~> (f c ~> f d)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftM2Sym2 a6989586621679559582 a6989586621679559583 :: TyFun (m a2) (m r) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftM3Sym1 a6989586621679559558 :: TyFun (m a1) (m a2 ~> (m a3 ~> m r)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (OnSym3 a6989586621679747423 a6989586621679747424 a6989586621679747425 :: TyFun a c -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Function Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FoldrMSym2 a6989586621680492425 a6989586621680492426 :: TyFun (t a) (m b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (FoldlMSym2 a6989586621680492407 a6989586621680492408 :: TyFun (t a) (m b) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MapAccumRSym2 a6989586621680822996 a6989586621680822997 :: TyFun (t b) (a, t c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MapAccumLSym2 a6989586621680823006 a6989586621680823007 :: TyFun (t b) (a, t c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (MzipWithSym2 a6989586621681150525 a6989586621681150526 :: TyFun (m b) (m c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Zip Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (a6989586621681292383 >=>@#@$$$ a6989586621681292384 :: TyFun a (m c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (a6989586621681292371 <=<@#@$$$ a6989586621681292372 :: TyFun a (m c) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftM4Sym0 :: TyFun (a1 ~> (a2 ~> (a3 ~> (a4 ~> r)))) (m a1 ~> (m a2 ~> (m a3 ~> (m a4 ~> m r)))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith5Sym0 :: TyFun (a ~> (b ~> (c ~> (d ~> (e ~> f))))) ([a] ~> ([b] ~> ([c] ~> ([d] ~> ([e] ~> [f]))))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Unzip7Sym0 :: TyFun [(a, b, c, d, e, f, g)] ([a], [b], [c], [d], [e], [f], [g]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith3Sym3 a6989586621679969546 a6989586621679969547 a6989586621679969548 :: TyFun [c] [d] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith5Sym1 a6989586621680091192 :: TyFun [a] ([b] ~> ([c] ~> ([d] ~> ([e] ~> [f])))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith4Sym2 a6989586621680091215 a6989586621680091216 :: TyFun [b] ([c] ~> ([d] ~> [e])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip7Sym0 :: TyFun [a] ([b] ~> ([c] ~> ([d] ~> ([e] ~> ([f] ~> ([g] ~> [(a, b, c, d, e, f, g)])))))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip6Sym1 a6989586621680091284 :: TyFun [b] ([c] ~> ([d] ~> ([e] ~> ([f] ~> [(a, b, c, d, e, f)])))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip5Sym2 a6989586621680091312 a6989586621680091313 :: TyFun [c] ([d] ~> ([e] ~> [(a, b, c, d, e)])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip4Sym3 a6989586621680091335 a6989586621680091336 a6989586621680091337 :: TyFun [d] [(a, b, c, d)] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple4Sym3 a6989586621679304310 a6989586621679304311 a6989586621679304312 :: TyFun d (a, b, c, d) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple5Sym2 a6989586621679304373 a6989586621679304374 :: TyFun c (d ~> (e ~> (a, b, c, d, e))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple6Sym1 a6989586621679304455 :: TyFun b (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f))))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
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.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftA3Sym2 a6989586621679559633 a6989586621679559634 :: TyFun (f b) (f c ~> f d) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftM3Sym2 a6989586621679559558 a6989586621679559559 :: TyFun (m a2) (m a3 ~> m r) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftM4Sym1 a6989586621679559527 :: TyFun (m a1) (m a2 ~> (m a3 ~> (m a4 ~> m r))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftM5Sym0 :: TyFun (a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> r))))) (m a1 ~> (m a2 ~> (m a3 ~> (m a4 ~> (m a5 ~> m r))))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith6Sym0 :: TyFun (a ~> (b ~> (c ~> (d ~> (e ~> (f ~> g)))))) ([a] ~> ([b] ~> ([c] ~> ([d] ~> ([e] ~> ([f] ~> [g])))))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith6Sym1 a6989586621680091165 :: TyFun [a] ([b] ~> ([c] ~> ([d] ~> ([e] ~> ([f] ~> [g]))))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith5Sym2 a6989586621680091192 a6989586621680091193 :: TyFun [b] ([c] ~> ([d] ~> ([e] ~> [f]))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith4Sym3 a6989586621680091215 a6989586621680091216 a6989586621680091217 :: TyFun [c] ([d] ~> [e]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip7Sym1 a6989586621680091251 :: TyFun [b] ([c] ~> ([d] ~> ([e] ~> ([f] ~> ([g] ~> [(a, b, c, d, e, f, g)]))))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip6Sym2 a6989586621680091284 a6989586621680091285 :: TyFun [c] ([d] ~> ([e] ~> ([f] ~> [(a, b, c, d, e, f)]))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip5Sym3 a6989586621680091312 a6989586621680091313 a6989586621680091314 :: TyFun [d] ([e] ~> [(a, b, c, d, e)]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple5Sym3 a6989586621679304373 a6989586621679304374 a6989586621679304375 :: TyFun d (e ~> (a, b, c, d, e)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple6Sym2 a6989586621679304455 a6989586621679304456 :: TyFun c (d ~> (e ~> (f ~> (a, b, c, d, e, f)))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple7Sym1 a6989586621679304558 :: TyFun b (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftA3Sym3 a6989586621679559633 a6989586621679559634 a6989586621679559635 :: TyFun (f c) (f d) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftM3Sym3 a6989586621679559558 a6989586621679559559 a6989586621679559560 :: TyFun (m a3) (m r) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftM4Sym2 a6989586621679559527 a6989586621679559528 :: TyFun (m a2) (m a3 ~> (m a4 ~> m r)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftM5Sym1 a6989586621679559489 :: TyFun (m a1) (m a2 ~> (m a3 ~> (m a4 ~> (m a5 ~> m r)))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith7Sym0 :: TyFun (a ~> (b ~> (c ~> (d ~> (e ~> (f ~> (g ~> h))))))) ([a] ~> ([b] ~> ([c] ~> ([d] ~> ([e] ~> ([f] ~> ([g] ~> [h]))))))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith7Sym1 a6989586621680091134 :: TyFun [a] ([b] ~> ([c] ~> ([d] ~> ([e] ~> ([f] ~> ([g] ~> [h])))))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith6Sym2 a6989586621680091165 a6989586621680091166 :: TyFun [b] ([c] ~> ([d] ~> ([e] ~> ([f] ~> [g])))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith5Sym3 a6989586621680091192 a6989586621680091193 a6989586621680091194 :: TyFun [c] ([d] ~> ([e] ~> [f])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith4Sym4 a6989586621680091215 a6989586621680091216 a6989586621680091217 a6989586621680091218 :: TyFun [d] [e] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip7Sym2 a6989586621680091251 a6989586621680091252 :: TyFun [c] ([d] ~> ([e] ~> ([f] ~> ([g] ~> [(a, b, c, d, e, f, g)])))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip6Sym3 a6989586621680091284 a6989586621680091285 a6989586621680091286 :: TyFun [d] ([e] ~> ([f] ~> [(a, b, c, d, e, f)])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip5Sym4 a6989586621680091312 a6989586621680091313 a6989586621680091314 a6989586621680091315 :: TyFun [e] [(a, b, c, d, e)] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple5Sym4 a6989586621679304373 a6989586621679304374 a6989586621679304375 a6989586621679304376 :: TyFun e (a, b, c, d, e) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple6Sym3 a6989586621679304455 a6989586621679304456 a6989586621679304457 :: TyFun d (e ~> (f ~> (a, b, c, d, e, f))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple7Sym2 a6989586621679304558 a6989586621679304559 :: TyFun c (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftM4Sym3 a6989586621679559527 a6989586621679559528 a6989586621679559529 :: TyFun (m a3) (m a4 ~> m r) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftM5Sym2 a6989586621679559489 a6989586621679559490 :: TyFun (m a2) (m a3 ~> (m a4 ~> (m a5 ~> m r))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith7Sym2 a6989586621680091134 a6989586621680091135 :: TyFun [b] ([c] ~> ([d] ~> ([e] ~> ([f] ~> ([g] ~> [h]))))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith6Sym3 a6989586621680091165 a6989586621680091166 a6989586621680091167 :: TyFun [c] ([d] ~> ([e] ~> ([f] ~> [g]))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith5Sym4 a6989586621680091192 a6989586621680091193 a6989586621680091194 a6989586621680091195 :: TyFun [d] ([e] ~> [f]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip7Sym3 a6989586621680091251 a6989586621680091252 a6989586621680091253 :: TyFun [d] ([e] ~> ([f] ~> ([g] ~> [(a, b, c, d, e, f, g)]))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip6Sym4 a6989586621680091284 a6989586621680091285 a6989586621680091286 a6989586621680091287 :: TyFun [e] ([f] ~> [(a, b, c, d, e, f)]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple6Sym4 a6989586621679304455 a6989586621679304456 a6989586621679304457 a6989586621679304458 :: TyFun e (f ~> (a, b, c, d, e, f)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple7Sym3 a6989586621679304558 a6989586621679304559 a6989586621679304560 :: TyFun d (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftM4Sym4 a6989586621679559527 a6989586621679559528 a6989586621679559529 a6989586621679559530 :: TyFun (m a4) (m r) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftM5Sym3 a6989586621679559489 a6989586621679559490 a6989586621679559491 :: TyFun (m a3) (m a4 ~> (m a5 ~> m r)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith7Sym3 a6989586621680091134 a6989586621680091135 a6989586621680091136 :: TyFun [c] ([d] ~> ([e] ~> ([f] ~> ([g] ~> [h])))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith6Sym4 a6989586621680091165 a6989586621680091166 a6989586621680091167 a6989586621680091168 :: TyFun [d] ([e] ~> ([f] ~> [g])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith5Sym5 a6989586621680091192 a6989586621680091193 a6989586621680091194 a6989586621680091195 a6989586621680091196 :: TyFun [e] [f] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip7Sym4 a6989586621680091251 a6989586621680091252 a6989586621680091253 a6989586621680091254 :: TyFun [e] ([f] ~> ([g] ~> [(a, b, c, d, e, f, g)])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip6Sym5 a6989586621680091284 a6989586621680091285 a6989586621680091286 a6989586621680091287 a6989586621680091288 :: TyFun [f] [(a, b, c, d, e, f)] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple6Sym5 a6989586621679304455 a6989586621679304456 a6989586621679304457 a6989586621679304458 a6989586621679304459 :: TyFun f (a, b, c, d, e, f) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple7Sym4 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 :: TyFun e (f ~> (g ~> (a, b, c, d, e, f, g))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftM5Sym4 a6989586621679559489 a6989586621679559490 a6989586621679559491 a6989586621679559492 :: TyFun (m a4) (m a5 ~> m r) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith7Sym4 a6989586621680091134 a6989586621680091135 a6989586621680091136 a6989586621680091137 :: TyFun [d] ([e] ~> ([f] ~> ([g] ~> [h]))) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith6Sym5 a6989586621680091165 a6989586621680091166 a6989586621680091167 a6989586621680091168 a6989586621680091169 :: TyFun [e] ([f] ~> [g]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip7Sym5 a6989586621680091251 a6989586621680091252 a6989586621680091253 a6989586621680091254 a6989586621680091255 :: TyFun [f] ([g] ~> [(a, b, c, d, e, f, g)]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple7Sym5 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 a6989586621679304562 :: TyFun f (g ~> (a, b, c, d, e, f, g)) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (LiftM5Sym5 a6989586621679559489 a6989586621679559490 a6989586621679559491 a6989586621679559492 a6989586621679559493 :: TyFun (m a5) (m r) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith7Sym5 a6989586621680091134 a6989586621680091135 a6989586621680091136 a6989586621680091137 a6989586621680091138 :: TyFun [e] ([f] ~> ([g] ~> [h])) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith6Sym6 a6989586621680091165 a6989586621680091166 a6989586621680091167 a6989586621680091168 a6989586621680091169 a6989586621680091170 :: TyFun [f] [g] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Zip7Sym6 a6989586621680091251 a6989586621680091252 a6989586621680091253 a6989586621680091254 a6989586621680091255 a6989586621680091256 :: TyFun [g] [(a, b, c, d, e, f, g)] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (Tuple7Sym6 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 a6989586621679304562 a6989586621679304563 :: TyFun g (a, b, c, d, e, f, g) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith7Sym6 a6989586621680091134 a6989586621680091135 a6989586621680091136 a6989586621680091137 a6989586621680091138 a6989586621680091139 :: TyFun [f] ([g] ~> [h]) -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #
SuppressUnusedWarnings (ZipWith7Sym7 a6989586621680091134 a6989586621680091135 a6989586621680091136 a6989586621680091137 a6989586621680091138 a6989586621680091139 a6989586621680091140 :: TyFun [g] [h] -> Type) Source #
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source #

Primary Template Haskell generation functions

Functions to generate equality instances

Functions to generate Ord instances

Functions to generate Bounded instances

Functions to generate Enum instances

Functions to generate Show instances

Utility functions

Basic singleton definitions

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Auxiliary definitions

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Instances

Functions to generate `Ord` instances

Functions to generate `Bounded` instances

Functions to generate `Enum` instances

Functions to generate `Show` instances