Copyright | (C) 2013 Richard Eisenberg |
---|---|
License | BSD-style (see LICENSE) |
Maintainer | Ryan Scott |
Stability | experimental |
Portability | non-portable |
Safe Haskell | None |
Language | Haskell2010 |
- Basic singleton definitions
- Singleton types
- Functions working with
Bool
- Error reporting
- Singleton equality
- Singleton comparisons
- Singleton Enum and Bounded
- Singletons numbers
- Singleton
Show
- Singleton
Semigroup
andMonoid
- Singleton
Functor
,Applicative
,Monad
, andMonadFail
- Singleton
Foldable
andTraversable
- List operations
- Other datatypes
- Other functions
- Defunctionalization symbols
Mimics the Haskell Prelude, but with singleton types. Includes the basic singleton definitions. Note: This is currently very incomplete!
Because many of these definitions are produced by Template Haskell, it is not possible to create proper Haddock documentation. Also, please excuse the apparent repeated variable names. This is due to an interaction between Template Haskell and Haddock.
Synopsis
- module Data.Singletons
- data SBool z where
- data SList z where
- data SMaybe z where
- data SEither z where
- data SOrdering z where
- data STuple0 z where
- data STuple2 z where
- data STuple3 z where
- data STuple4 z where
- data STuple5 z where
- 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))
- 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 Not (a :: Bool) = (res :: Bool) | res -> a where ...
- sNot :: Sing a -> Sing (Not a)
- type family (a :: Bool) && (b :: Bool) :: Bool where ...
- type family (a :: Bool) || (b :: Bool) :: Bool where ...
- (%&&) :: Sing a -> Sing b -> Sing (a && b)
- (%||) :: Sing a -> Sing b -> Sing (a || b)
- type family Otherwise where ...
- sOtherwise :: Sing (OtherwiseSym0 :: Bool)
- type family Error str where ...
- sError :: HasCallStack => Sing (str :: Symbol) -> a
- type family ErrorWithoutStackTrace str where ...
- sErrorWithoutStackTrace :: Sing (str :: Symbol) -> a
- type family Undefined where ...
- sUndefined :: HasCallStack => a
- module Data.Singletons.Prelude.Eq
- class POrd a where
- 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)
- class SBounded a where
- sMinBound :: Sing (MinBoundSym0 :: a)
- sMaxBound :: Sing (MaxBoundSym0 :: a)
- class PBounded a where
- type MaxBoundSym0 = MaxBound :: a
- type MinBoundSym0 = MinBound :: a
- 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)
- sEnumFromTo :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t :: [a])
- sEnumFromThenTo :: forall (t :: a) (t :: a) (t :: a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t :: [a])
- class PEnum a where
- type ToEnum (arg :: Nat) :: a
- type FromEnum (arg :: a) :: Nat
- type EnumFromTo (arg :: a) (arg :: a) :: [a]
- type EnumFromThenTo (arg :: a) (arg :: a) (arg :: a) :: [a]
- type EnumFromThenToSym3 (a6989586621679758488 :: a) (a6989586621679758489 :: a) (a6989586621679758490 :: a) = EnumFromThenTo a6989586621679758488 a6989586621679758489 a6989586621679758490 :: [a]
- data EnumFromThenToSym2 a6989586621679758488 a6989586621679758489 a6989586621679758490
- data EnumFromThenToSym1 a6989586621679758488 a6989586621679758489
- data EnumFromThenToSym0 a6989586621679758488
- type EnumFromToSym2 (a6989586621679758482 :: a) (a6989586621679758483 :: a) = EnumFromTo a6989586621679758482 a6989586621679758483 :: [a]
- data EnumFromToSym1 a6989586621679758482 a6989586621679758483
- data EnumFromToSym0 a6989586621679758482
- type FromEnumSym1 (a6989586621679758478 :: a) = FromEnum a6989586621679758478 :: Nat
- data FromEnumSym0 a6989586621679758478
- type ToEnumSym1 (a6989586621679758475 :: Nat) = ToEnum a6989586621679758475 :: a
- data ToEnumSym0 a6989586621679758475
- module Data.Singletons.Prelude.Num
- type family (a :: Nat) ^ (b :: Nat) :: Nat where ...
- (%^) :: Sing a -> Sing b -> Sing (a ^ b)
- class PShow a where
- 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 ShowS = String -> String
- type SChar = Symbol
- type family Shows a a where ...
- sShows :: forall a (t :: a) (t :: Symbol). SShow a => Sing t -> Sing t -> Sing (Apply (Apply ShowsSym0 t) 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 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)
- class PSemigroup a where
- type (arg :: a) <> (arg :: a) :: a
- class SSemigroup a where
- class PMonoid a where
- 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 PFunctor f where
- class SFunctor f where
- type family a <$> a where ...
- (%<$>) :: forall a b f (t :: (~>) a b) (t :: f a). SFunctor f => Sing t -> Sing t -> Sing (Apply (Apply (<$>@#@$) t) t :: f b)
- class PApplicative f where
- 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)
- (%*>) :: 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)
- class PMonad m where
- class SApplicative m => SMonad m where
- class PMonadFail m where
- class SMonad m => SMonadFail m where
- type family MapM_ a a where ...
- sMapM_ :: forall a m b t (t :: (~>) a (m b)) (t :: t a). (SFoldable t, SMonad m) => Sing t -> Sing t -> Sing (Apply (Apply MapM_Sym0 t) t :: m ())
- type family Sequence_ a where ...
- sSequence_ :: forall t m a (t :: t (m a)). (SFoldable t, SMonad m) => Sing t -> Sing (Apply Sequence_Sym0 t :: m ())
- type family a =<< a where ...
- (%=<<) :: forall a m b (t :: (~>) a (m b)) (t :: m a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply (=<<@#@$) t) t :: m b)
- class PFoldable t where
- type FoldMap (arg :: (~>) a m) (arg :: t a) :: m
- 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 Foldr1 (arg :: (~>) a ((~>) a a)) (arg :: t a) :: a
- type Foldl1 (arg :: (~>) a ((~>) a a)) (arg :: t a) :: a
- 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
- 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)
- 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)
- 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)
- 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 PTraversable t where
- 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))
- type family Id a where ...
- sId :: forall a (t :: a). Sing t -> Sing (Apply IdSym0 t :: a)
- type family Const a a where ...
- sConst :: forall a b (t :: a) (t :: b). Sing t -> Sing t -> Sing (Apply (Apply ConstSym0 t) t :: 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)
- type family a $ a where ...
- (%$) :: forall a b (t :: (~>) a b) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply ($@#@$) t) t :: b)
- type family a $! a where ...
- (%$!) :: forall a b (t :: (~>) a b) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply ($!@#@$) t) t :: b)
- type family Flip a a a where ...
- sFlip :: forall a b c (t :: (~>) a ((~>) b c)) (t :: b) (t :: a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FlipSym0 t) t) t :: c)
- type family AsTypeOf a a where ...
- sAsTypeOf :: forall a (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply AsTypeOfSym0 t) t :: a)
- type family Seq a a where ...
- sSeq :: forall a b (t :: a) (t :: b). Sing t -> Sing t -> Sing (Apply (Apply SeqSym0 t) t :: b)
- type family Map a a where ...
- sMap :: forall a b (t :: (~>) a b) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply MapSym0 t) t :: [b])
- type family a ++ a where ...
- (%++) :: forall a (t :: [a]) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply (++@#@$) t) t :: [a])
- type family Filter a a where ...
- sFilter :: forall a (t :: (~>) a Bool) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply FilterSym0 t) t :: [a])
- type family Head a where ...
- sHead :: forall a (t :: [a]). Sing t -> Sing (Apply HeadSym0 t :: a)
- type family Last a where ...
- sLast :: forall a (t :: [a]). Sing t -> Sing (Apply LastSym0 t :: a)
- type family Tail a where ...
- sTail :: forall a (t :: [a]). Sing t -> Sing (Apply TailSym0 t :: [a])
- type family Init a where ...
- sInit :: forall a (t :: [a]). Sing t -> Sing (Apply InitSym0 t :: [a])
- type family Null (arg :: t a) :: Bool
- sNull :: forall a (t :: t a). SFoldable t => Sing t -> Sing (Apply NullSym0 t :: Bool)
- type family Reverse a where ...
- sReverse :: forall a (t :: [a]). Sing t -> Sing (Apply ReverseSym0 t :: [a])
- type family And a where ...
- sAnd :: forall t (t :: t Bool). SFoldable t => Sing t -> Sing (Apply AndSym0 t :: Bool)
- type family Or a where ...
- sOr :: forall t (t :: t Bool). SFoldable t => Sing t -> Sing (Apply OrSym0 t :: Bool)
- type family Any a a where ...
- sAny :: forall a t (t :: (~>) a Bool) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply AnySym0 t) t :: Bool)
- type family All a a where ...
- sAll :: forall a t (t :: (~>) a Bool) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply AllSym0 t) t :: Bool)
- type family Concat a where ...
- sConcat :: forall t a (t :: t [a]). SFoldable t => Sing t -> Sing (Apply ConcatSym0 t :: [a])
- type family ConcatMap a a where ...
- sConcatMap :: forall a b t (t :: (~>) a [b]) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply ConcatMapSym0 t) t :: [b])
- type family Scanl a a a where ...
- sScanl :: forall b a (t :: (~>) b ((~>) a b)) (t :: b) (t :: [a]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ScanlSym0 t) t) t :: [b])
- type family Scanl1 a a where ...
- sScanl1 :: forall a (t :: (~>) a ((~>) a a)) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply Scanl1Sym0 t) t :: [a])
- type family Scanr a a a where ...
- sScanr :: forall a b (t :: (~>) a ((~>) b b)) (t :: b) (t :: [a]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ScanrSym0 t) t) t :: [b])
- type family Scanr1 a a where ...
- sScanr1 :: forall a (t :: (~>) a ((~>) a a)) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply Scanr1Sym0 t) t :: [a])
- type family Replicate a a where ...
- sReplicate :: forall a (t :: Nat) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply ReplicateSym0 t) t :: [a])
- type family Take a a where ...
- sTake :: forall a (t :: Nat) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply TakeSym0 t) t :: [a])
- type family Drop a a where ...
- sDrop :: forall a (t :: Nat) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply DropSym0 t) t :: [a])
- type family SplitAt a a where ...
- sSplitAt :: forall a (t :: Nat) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply SplitAtSym0 t) t :: ([a], [a]))
- type family TakeWhile a a where ...
- sTakeWhile :: forall a (t :: (~>) a Bool) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply TakeWhileSym0 t) t :: [a])
- type family Span a a where ...
- sSpan :: forall a (t :: (~>) a Bool) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply SpanSym0 t) t :: ([a], [a]))
- type family Break a a where ...
- sBreak :: forall a (t :: (~>) a Bool) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply BreakSym0 t) t :: ([a], [a]))
- type family NotElem a a where ...
- sNotElem :: forall a t (t :: a) (t :: t a). (SFoldable t, SEq a) => Sing t -> Sing t -> Sing (Apply (Apply NotElemSym0 t) t :: Bool)
- type family Lookup a a where ...
- sLookup :: forall a b (t :: a) (t :: [(a, b)]). SEq a => Sing t -> Sing t -> Sing (Apply (Apply LookupSym0 t) t :: Maybe b)
- type family Zip a a where ...
- sZip :: forall a b (t :: [a]) (t :: [b]). Sing t -> Sing t -> Sing (Apply (Apply ZipSym0 t) t :: [(a, b)])
- type family Zip3 a a a where ...
- sZip3 :: forall a b c (t :: [a]) (t :: [b]) (t :: [c]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Zip3Sym0 t) t) t :: [(a, b, c)])
- type family ZipWith a a a where ...
- sZipWith :: forall a b c (t :: (~>) a ((~>) b c)) (t :: [a]) (t :: [b]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ZipWithSym0 t) t) t :: [c])
- type family ZipWith3 a a a a where ...
- sZipWith3 :: forall a b c d (t :: (~>) a ((~>) b ((~>) c d))) (t :: [a]) (t :: [b]) (t :: [c]). Sing t -> Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply (Apply ZipWith3Sym0 t) t) t) t :: [d])
- type family Unzip a where ...
- sUnzip :: forall a b (t :: [(a, b)]). Sing t -> Sing (Apply UnzipSym0 t :: ([a], [b]))
- type family Unzip3 a where ...
- sUnzip3 :: forall a b c (t :: [(a, b, c)]). Sing t -> Sing (Apply Unzip3Sym0 t :: ([a], [b], [c]))
- type family Unlines a where ...
- sUnlines :: forall (t :: [Symbol]). Sing t -> Sing (Apply UnlinesSym0 t :: Symbol)
- type family Unwords a where ...
- sUnwords :: forall (t :: [Symbol]). Sing t -> Sing (Apply UnwordsSym0 t :: Symbol)
- type family Maybe_ a a a where ...
- sMaybe_ :: forall b a (t :: b) (t :: (~>) a b) (t :: Maybe a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Maybe_Sym0 t) t) t :: b)
- type family Either_ a a a where ...
- sEither_ :: forall a c b (t :: (~>) a c) (t :: (~>) b c) (t :: Either a b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Either_Sym0 t) t) t :: c)
- type family Fst a where ...
- sFst :: forall a b (t :: (a, b)). Sing t -> Sing (Apply FstSym0 t :: a)
- type family Snd a where ...
- sSnd :: forall a b (t :: (a, b)). Sing t -> Sing (Apply SndSym0 t :: b)
- type family Curry a a a where ...
- sCurry :: forall a b c (t :: (~>) (a, b) c) (t :: a) (t :: b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply CurrySym0 t) t) t :: c)
- type family Uncurry a a where ...
- sUncurry :: forall a b c (t :: (~>) a ((~>) b c)) (t :: (a, b)). Sing t -> Sing t -> Sing (Apply (Apply UncurrySym0 t) t :: c)
- data Symbol
- either_ :: (a -> c) -> (b -> c) -> Either a b -> c
- maybe_ :: b -> (a -> b) -> Maybe a -> b
- bool_ :: a -> a -> Bool -> a
- show_ :: Show a => a -> String
- type FalseSym0 = 'False :: Bool
- type TrueSym0 = 'True :: Bool
- data NotSym0 a6989586621679367240
- type NotSym1 (a6989586621679367240 :: Bool) = Not a6989586621679367240 :: Bool
- data (&&@#@$) a6989586621679366665
- data a6989586621679366665 &&@#@$$ a6989586621679366666
- type (&&@#@$$$) (a6989586621679366665 :: Bool) (a6989586621679366666 :: Bool) = (&&) a6989586621679366665 a6989586621679366666 :: Bool
- data (||@#@$) a6989586621679366963
- data a6989586621679366963 ||@#@$$ a6989586621679366964
- type (||@#@$$$) (a6989586621679366963 :: Bool) (a6989586621679366964 :: Bool) = (||) a6989586621679366963 a6989586621679366964 :: Bool
- type OtherwiseSym0 = Otherwise :: Bool
- type NothingSym0 = 'Nothing :: Maybe (a :: Type)
- data JustSym0 a6989586621679304113
- type JustSym1 (a6989586621679304113 :: a) = 'Just a6989586621679304113 :: Maybe (a :: Type)
- data Maybe_Sym0 a6989586621679500654
- data Maybe_Sym1 a6989586621679500654 a6989586621679500655
- data Maybe_Sym2 a6989586621679500654 a6989586621679500655 a6989586621679500656
- type Maybe_Sym3 (a6989586621679500654 :: b) (a6989586621679500655 :: (~>) a b) (a6989586621679500656 :: Maybe a) = Maybe_ a6989586621679500654 a6989586621679500655 a6989586621679500656 :: b
- data LeftSym0 a6989586621679304182
- type LeftSym1 (a6989586621679304182 :: a) = 'Left a6989586621679304182 :: Either (a :: Type) (b :: Type)
- data RightSym0 a6989586621679304184
- type RightSym1 (a6989586621679304184 :: b) = 'Right a6989586621679304184 :: Either (a :: Type) (b :: Type)
- data Either_Sym0 a6989586621680470389
- data Either_Sym1 a6989586621680470389 a6989586621680470390
- data Either_Sym2 a6989586621680470389 a6989586621680470390 a6989586621680470391
- type Either_Sym3 (a6989586621680470389 :: (~>) a c) (a6989586621680470390 :: (~>) b c) (a6989586621680470391 :: Either a b) = Either_ a6989586621680470389 a6989586621680470390 a6989586621680470391 :: c
- 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 FstSym0 a6989586621679360446
- type FstSym1 (a6989586621679360446 :: (a, b)) = Fst a6989586621679360446 :: a
- data SndSym0 a6989586621679360442
- type SndSym1 (a6989586621679360442 :: (a, b)) = Snd a6989586621679360442 :: b
- data CurrySym0 a6989586621679360434
- data CurrySym1 a6989586621679360434 a6989586621679360435
- data CurrySym2 a6989586621679360434 a6989586621679360435 a6989586621679360436
- type CurrySym3 (a6989586621679360434 :: (~>) (a, b) c) (a6989586621679360435 :: a) (a6989586621679360436 :: b) = Curry a6989586621679360434 a6989586621679360435 a6989586621679360436 :: c
- data UncurrySym0 a6989586621679360426
- data UncurrySym1 a6989586621679360426 a6989586621679360427
- type UncurrySym2 (a6989586621679360426 :: (~>) a ((~>) b c)) (a6989586621679360427 :: (a, b)) = Uncurry a6989586621679360426 a6989586621679360427 :: c
- data ErrorSym0 a6989586621679472252
- type ErrorSym1 (a6989586621679472252 :: k0) = Error a6989586621679472252 :: k
- data ErrorWithoutStackTraceSym0 a6989586621679472488
- type ErrorWithoutStackTraceSym1 (a6989586621679472488 :: k0) = ErrorWithoutStackTrace a6989586621679472488 :: k
- type UndefinedSym0 = Undefined :: k
- type LTSym0 = 'LT :: Ordering
- type EQSym0 = 'EQ :: Ordering
- type GTSym0 = 'GT :: Ordering
- data CompareSym0 a6989586621679383640
- data CompareSym1 a6989586621679383640 a6989586621679383641
- type CompareSym2 (a6989586621679383640 :: a) (a6989586621679383641 :: a) = Compare a6989586621679383640 a6989586621679383641 :: Ordering
- data (<@#@$) a6989586621679383645
- data a6989586621679383645 <@#@$$ a6989586621679383646
- type (<@#@$$$) (a6989586621679383645 :: a) (a6989586621679383646 :: a) = (<) a6989586621679383645 a6989586621679383646 :: Bool
- data (<=@#@$) a6989586621679383650
- data a6989586621679383650 <=@#@$$ a6989586621679383651
- type (<=@#@$$$) (a6989586621679383650 :: a) (a6989586621679383651 :: a) = (<=) a6989586621679383650 a6989586621679383651 :: Bool
- data (>@#@$) a6989586621679383655
- data a6989586621679383655 >@#@$$ a6989586621679383656
- type (>@#@$$$) (a6989586621679383655 :: a) (a6989586621679383656 :: a) = (>) a6989586621679383655 a6989586621679383656 :: Bool
- data (>=@#@$) a6989586621679383660
- data a6989586621679383660 >=@#@$$ a6989586621679383661
- type (>=@#@$$$) (a6989586621679383660 :: a) (a6989586621679383661 :: a) = (>=) a6989586621679383660 a6989586621679383661 :: Bool
- data MaxSym0 a6989586621679383665
- data MaxSym1 a6989586621679383665 a6989586621679383666
- type MaxSym2 (a6989586621679383665 :: a) (a6989586621679383666 :: a) = Max a6989586621679383665 a6989586621679383666 :: a
- data MinSym0 a6989586621679383670
- data MinSym1 a6989586621679383670 a6989586621679383671
- type MinSym2 (a6989586621679383670 :: a) (a6989586621679383671 :: a) = Min a6989586621679383670 a6989586621679383671 :: a
- data (^@#@$) a6989586621679472866
- data a6989586621679472866 ^@#@$$ a6989586621679472867
- type (^@#@$$$) (a6989586621679472866 :: Nat) (a6989586621679472867 :: Nat) = (^) a6989586621679472866 a6989586621679472867 :: Nat
- 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 Show_Sym0 a6989586621680279573
- type Show_Sym1 (a6989586621680279573 :: a) = Show_ a6989586621680279573 :: Symbol
- data ShowListSym0 a6989586621680279577
- data ShowListSym1 a6989586621680279577 a6989586621680279578
- type ShowListSym2 (a6989586621680279577 :: [a]) (a6989586621680279578 :: Symbol) = ShowList a6989586621680279577 a6989586621680279578 :: Symbol
- data ShowsSym0 a6989586621680279560
- data ShowsSym1 a6989586621680279560 a6989586621680279561
- type ShowsSym2 (a6989586621680279560 :: a) (a6989586621680279561 :: Symbol) = Shows a6989586621680279560 a6989586621680279561 :: Symbol
- data ShowCharSym0 a6989586621680279534
- data ShowCharSym1 a6989586621680279534 a6989586621680279535
- type ShowCharSym2 (a6989586621680279534 :: Symbol) (a6989586621680279535 :: Symbol) = ShowChar a6989586621680279534 a6989586621680279535 :: 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 (<>@#@$) a6989586621679830624
- data a6989586621679830624 <>@#@$$ a6989586621679830625
- type (<>@#@$$$) (a6989586621679830624 :: a) (a6989586621679830625 :: a) = (<>) a6989586621679830624 a6989586621679830625 :: a
- type MemptySym0 = Mempty :: a
- data MappendSym0 a6989586621680347244
- data MappendSym1 a6989586621680347244 a6989586621680347245
- type MappendSym2 (a6989586621680347244 :: a) (a6989586621680347245 :: a) = Mappend a6989586621680347244 a6989586621680347245 :: a
- data MconcatSym0 a6989586621680347248
- type MconcatSym1 (a6989586621680347248 :: [a]) = Mconcat a6989586621680347248 :: a
- 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 (<$>@#@$) a6989586621679731630
- data a6989586621679731630 <$>@#@$$ a6989586621679731631
- type (<$>@#@$$$) (a6989586621679731630 :: (~>) a b) (a6989586621679731631 :: f a) = (<$>) a6989586621679731630 a6989586621679731631 :: f 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 (*>@#@$) a6989586621679559707
- data a6989586621679559707 *>@#@$$ a6989586621679559708
- type (*>@#@$$$) (a6989586621679559707 :: f a) (a6989586621679559708 :: f b) = (*>) a6989586621679559707 a6989586621679559708 :: f b
- data (<*@#@$) a6989586621679559712
- data a6989586621679559712 <*@#@$$ a6989586621679559713
- type (<*@#@$$$) (a6989586621679559712 :: f a) (a6989586621679559713 :: f b) = (<*) a6989586621679559712 a6989586621679559713 :: f a
- data (>>=@#@$) a6989586621679559775
- data a6989586621679559775 >>=@#@$$ a6989586621679559776
- type (>>=@#@$$$) (a6989586621679559775 :: m a) (a6989586621679559776 :: (~>) a (m b)) = (>>=) a6989586621679559775 a6989586621679559776 :: m b
- data (>>@#@$) a6989586621679559780
- data a6989586621679559780 >>@#@$$ a6989586621679559781
- type (>>@#@$$$) (a6989586621679559780 :: m a) (a6989586621679559781 :: m b) = (>>) a6989586621679559780 a6989586621679559781 :: m b
- data ReturnSym0 a6989586621679559784
- type ReturnSym1 (a6989586621679559784 :: a) = Return a6989586621679559784 :: m a
- data FailSym0 a6989586621679729522
- type FailSym1 (a6989586621679729522 :: [Char]) = Fail a6989586621679729522 :: m a
- data MapM_Sym0 a6989586621680492379
- data MapM_Sym1 a6989586621680492379 a6989586621680492380
- type MapM_Sym2 (a6989586621680492379 :: (~>) a (m b)) (a6989586621680492380 :: t a) = MapM_ a6989586621680492379 a6989586621680492380 :: m ()
- data Sequence_Sym0 a6989586621680492355
- type Sequence_Sym1 (a6989586621680492355 :: t (m a)) = Sequence_ a6989586621680492355 :: m ()
- data (=<<@#@$) a6989586621679559620
- data a6989586621679559620 =<<@#@$$ a6989586621679559621
- type (=<<@#@$$$) (a6989586621679559620 :: (~>) a (m b)) (a6989586621679559621 :: m a) = (=<<) a6989586621679559620 a6989586621679559621 :: m b
- data ElemSym0 a6989586621680492497
- data ElemSym1 a6989586621680492497 a6989586621680492498
- type ElemSym2 (a6989586621680492497 :: a) (a6989586621680492498 :: t a) = Elem a6989586621680492497 a6989586621680492498 :: Bool
- data FoldMapSym0 a6989586621680492445
- data FoldMapSym1 a6989586621680492445 a6989586621680492446
- type FoldMapSym2 (a6989586621680492445 :: (~>) a m) (a6989586621680492446 :: t a) = FoldMap a6989586621680492445 a6989586621680492446 :: m
- 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 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
- data Foldr1Sym0 a6989586621680492478
- data Foldr1Sym1 a6989586621680492478 a6989586621680492479
- type Foldr1Sym2 (a6989586621680492478 :: (~>) a ((~>) a a)) (a6989586621680492479 :: t a) = Foldr1 a6989586621680492478 a6989586621680492479 :: a
- data Foldl1Sym0 a6989586621680492483
- data Foldl1Sym1 a6989586621680492483 a6989586621680492484
- type Foldl1Sym2 (a6989586621680492483 :: (~>) a ((~>) a a)) (a6989586621680492484 :: t a) = Foldl1 a6989586621680492483 a6989586621680492484 :: a
- data MaximumSym0 a6989586621680492501
- type MaximumSym1 (a6989586621680492501 :: t a) = Maximum a6989586621680492501 :: a
- data MinimumSym0 a6989586621680492504
- type MinimumSym1 (a6989586621680492504 :: t a) = Minimum a6989586621680492504 :: a
- data SumSym0 a6989586621680492507
- type SumSym1 (a6989586621680492507 :: t a) = Sum a6989586621680492507 :: a
- data ProductSym0 a6989586621680492510
- type ProductSym1 (a6989586621680492510 :: t a) = Product a6989586621680492510 :: a
- data TraverseSym0 a6989586621680816742
- data TraverseSym1 a6989586621680816742 a6989586621680816743
- type TraverseSym2 (a6989586621680816742 :: (~>) a (f b)) (a6989586621680816743 :: t a) = Traverse a6989586621680816742 a6989586621680816743 :: f (t b)
- data SequenceASym0 a6989586621680816746
- type SequenceASym1 (a6989586621680816746 :: t (f a)) = SequenceA a6989586621680816746 :: f (t a)
- data MapMSym0 a6989586621680816750
- data MapMSym1 a6989586621680816750 a6989586621680816751
- type MapMSym2 (a6989586621680816750 :: (~>) a (m b)) (a6989586621680816751 :: t a) = MapM a6989586621680816750 a6989586621680816751 :: m (t b)
- data SequenceSym0 a6989586621680816754
- type SequenceSym1 (a6989586621680816754 :: t (m a)) = Sequence a6989586621680816754 :: m (t a)
- data IdSym0 a6989586621679534205
- type IdSym1 (a6989586621679534205 :: a) = Id a6989586621679534205 :: a
- data ConstSym0 a6989586621679534200
- data ConstSym1 a6989586621679534200 a6989586621679534201
- type ConstSym2 (a6989586621679534200 :: a) (a6989586621679534201 :: b) = Const a6989586621679534200 a6989586621679534201 :: a
- data (.@#@$) a6989586621679534187
- data a6989586621679534187 .@#@$$ a6989586621679534188
- data (a6989586621679534187 .@#@$$$ a6989586621679534188) a6989586621679534189
- data ($@#@$) a6989586621679534156
- data a6989586621679534156 $@#@$$ a6989586621679534157
- type ($@#@$$$) (a6989586621679534156 :: (~>) a b) (a6989586621679534157 :: a) = ($) a6989586621679534156 a6989586621679534157 :: b
- data ($!@#@$) a6989586621679534147
- data a6989586621679534147 $!@#@$$ a6989586621679534148
- type ($!@#@$$$) (a6989586621679534147 :: (~>) a b) (a6989586621679534148 :: a) = ($!) a6989586621679534147 a6989586621679534148 :: b
- data FlipSym0 a6989586621679534175
- data FlipSym1 a6989586621679534175 a6989586621679534176
- data FlipSym2 a6989586621679534175 a6989586621679534176 a6989586621679534177
- data AsTypeOfSym0 a6989586621679534167
- data AsTypeOfSym1 a6989586621679534167 a6989586621679534168
- type AsTypeOfSym2 (a6989586621679534167 :: a) (a6989586621679534168 :: a) = AsTypeOf a6989586621679534167 a6989586621679534168 :: a
- data SeqSym0 a6989586621679534120
- data SeqSym1 a6989586621679534120 a6989586621679534121
- type SeqSym2 (a6989586621679534120 :: a) (a6989586621679534121 :: b) = Seq a6989586621679534120 a6989586621679534121 :: b
- data (:@#@$) a6989586621679304138
- data a6989586621679304138 :@#@$$ a6989586621679304139
- type (:@#@$$$) (a6989586621679304138 :: a) (a6989586621679304139 :: [a]) = '(:) a6989586621679304138 a6989586621679304139 :: [a :: Type]
- type NilSym0 = '[] :: [a :: Type]
- data MapSym0 a6989586621679534219
- data MapSym1 a6989586621679534219 a6989586621679534220
- type MapSym2 (a6989586621679534219 :: (~>) a b) (a6989586621679534220 :: [a]) = Map a6989586621679534219 a6989586621679534220 :: [b]
- data ReverseSym0 a6989586621679970000
- type ReverseSym1 (a6989586621679970000 :: [a]) = Reverse a6989586621679970000 :: [a]
- data a6989586621679534210 ++@#@$$ a6989586621679534211
- data (++@#@$) a6989586621679534210
- data FilterSym0 a6989586621679969267
- data FilterSym1 a6989586621679969267 a6989586621679969268
- type FilterSym2 (a6989586621679969267 :: (~>) a Bool) (a6989586621679969268 :: [a]) = Filter a6989586621679969267 a6989586621679969268 :: [a]
- data HeadSym0 a6989586621679970037
- type HeadSym1 (a6989586621679970037 :: [a]) = Head a6989586621679970037 :: a
- data LastSym0 a6989586621679970031
- type LastSym1 (a6989586621679970031 :: [a]) = Last a6989586621679970031 :: a
- data TailSym0 a6989586621679970027
- type TailSym1 (a6989586621679970027 :: [a]) = Tail a6989586621679970027 :: [a]
- data InitSym0 a6989586621679970015
- type InitSym1 (a6989586621679970015 :: [a]) = Init a6989586621679970015 :: [a]
- data NullSym0 a6989586621680492490
- type NullSym1 (a6989586621680492490 :: t a) = Null a6989586621680492490 :: Bool
- data ConcatSym0 a6989586621680492332
- type ConcatSym1 (a6989586621680492332 :: t [a]) = Concat a6989586621680492332 :: [a]
- data ConcatMapSym0 a6989586621680492321
- data ConcatMapSym1 a6989586621680492321 a6989586621680492322
- type ConcatMapSym2 (a6989586621680492321 :: (~>) a [b]) (a6989586621680492322 :: t a) = ConcatMap a6989586621680492321 a6989586621680492322 :: [b]
- data AndSym0 a6989586621680492316
- type AndSym1 (a6989586621680492316 :: t Bool) = And a6989586621680492316 :: Bool
- data OrSym0 a6989586621680492310
- type OrSym1 (a6989586621680492310 :: t Bool) = Or a6989586621680492310 :: Bool
- data AnySym0 a6989586621680492302
- data AnySym1 a6989586621680492302 a6989586621680492303
- type AnySym2 (a6989586621680492302 :: (~>) a Bool) (a6989586621680492303 :: t a) = Any a6989586621680492302 a6989586621680492303 :: Bool
- data AllSym0 a6989586621680492293
- data AllSym1 a6989586621680492293 a6989586621680492294
- type AllSym2 (a6989586621680492293 :: (~>) a Bool) (a6989586621680492294 :: t a) = All a6989586621680492293 a6989586621680492294 :: Bool
- data ScanlSym0 a6989586621679969805
- data ScanlSym1 a6989586621679969805 a6989586621679969806
- data ScanlSym2 a6989586621679969805 a6989586621679969806 a6989586621679969807
- type ScanlSym3 (a6989586621679969805 :: (~>) b ((~>) a b)) (a6989586621679969806 :: b) (a6989586621679969807 :: [a]) = Scanl a6989586621679969805 a6989586621679969806 a6989586621679969807 :: [b]
- data Scanl1Sym0 a6989586621679969796
- data Scanl1Sym1 a6989586621679969796 a6989586621679969797
- type Scanl1Sym2 (a6989586621679969796 :: (~>) a ((~>) a a)) (a6989586621679969797 :: [a]) = Scanl1 a6989586621679969796 a6989586621679969797 :: [a]
- data ScanrSym0 a6989586621679969778
- data ScanrSym1 a6989586621679969778 a6989586621679969779
- data ScanrSym2 a6989586621679969778 a6989586621679969779 a6989586621679969780
- type ScanrSym3 (a6989586621679969778 :: (~>) a ((~>) b b)) (a6989586621679969779 :: b) (a6989586621679969780 :: [a]) = Scanr a6989586621679969778 a6989586621679969779 a6989586621679969780 :: [b]
- data Scanr1Sym0 a6989586621679969758
- data Scanr1Sym1 a6989586621679969758 a6989586621679969759
- type Scanr1Sym2 (a6989586621679969758 :: (~>) a ((~>) a a)) (a6989586621679969759 :: [a]) = Scanr1 a6989586621679969758 a6989586621679969759 :: [a]
- data ReplicateSym0 a6989586621679968895
- data ReplicateSym1 a6989586621679968895 a6989586621679968896
- type ReplicateSym2 (a6989586621679968895 :: Nat) (a6989586621679968896 :: a) = Replicate a6989586621679968895 a6989586621679968896 :: [a]
- data TakeSym0 a6989586621679969050
- data TakeSym1 a6989586621679969050 a6989586621679969051
- type TakeSym2 (a6989586621679969050 :: Nat) (a6989586621679969051 :: [a]) = Take a6989586621679969050 a6989586621679969051 :: [a]
- data DropSym0 a6989586621679969037
- data DropSym1 a6989586621679969037 a6989586621679969038
- type DropSym2 (a6989586621679969037 :: Nat) (a6989586621679969038 :: [a]) = Drop a6989586621679969037 a6989586621679969038 :: [a]
- data SplitAtSym0 a6989586621679969030
- data SplitAtSym1 a6989586621679969030 a6989586621679969031
- type SplitAtSym2 (a6989586621679969030 :: Nat) (a6989586621679969031 :: [a]) = SplitAt a6989586621679969030 a6989586621679969031 :: ([a], [a])
- data TakeWhileSym0 a6989586621679969167
- data TakeWhileSym1 a6989586621679969167 a6989586621679969168
- type TakeWhileSym2 (a6989586621679969167 :: (~>) a Bool) (a6989586621679969168 :: [a]) = TakeWhile a6989586621679969167 a6989586621679969168 :: [a]
- data DropWhileSym0 a6989586621679969152
- data DropWhileSym1 a6989586621679969152 a6989586621679969153
- type DropWhileSym2 (a6989586621679969152 :: (~>) a Bool) (a6989586621679969153 :: [a]) = DropWhile a6989586621679969152 a6989586621679969153 :: [a]
- data DropWhileEndSym0 a6989586621679969135
- data DropWhileEndSym1 a6989586621679969135 a6989586621679969136
- type DropWhileEndSym2 (a6989586621679969135 :: (~>) a Bool) (a6989586621679969136 :: [a]) = DropWhileEnd a6989586621679969135 a6989586621679969136 :: [a]
- data SpanSym0 a6989586621679969098
- data SpanSym1 a6989586621679969098 a6989586621679969099
- type SpanSym2 (a6989586621679969098 :: (~>) a Bool) (a6989586621679969099 :: [a]) = Span a6989586621679969098 a6989586621679969099 :: ([a], [a])
- data BreakSym0 a6989586621679969063
- data BreakSym1 a6989586621679969063 a6989586621679969064
- type BreakSym2 (a6989586621679969063 :: (~>) a Bool) (a6989586621679969064 :: [a]) = Break a6989586621679969063 a6989586621679969064 :: ([a], [a])
- data NotElemSym0 a6989586621680492244
- data NotElemSym1 a6989586621680492244 a6989586621680492245
- type NotElemSym2 (a6989586621680492244 :: a) (a6989586621680492245 :: t a) = NotElem a6989586621680492244 a6989586621680492245 :: Bool
- data ZipSym0 a6989586621679969585
- data ZipSym1 a6989586621679969585 a6989586621679969586
- type ZipSym2 (a6989586621679969585 :: [a]) (a6989586621679969586 :: [b]) = Zip a6989586621679969585 a6989586621679969586 :: [(a, b)]
- data Zip3Sym0 a6989586621679969573
- data Zip3Sym1 a6989586621679969573 a6989586621679969574
- data Zip3Sym2 a6989586621679969573 a6989586621679969574 a6989586621679969575
- type Zip3Sym3 (a6989586621679969573 :: [a]) (a6989586621679969574 :: [b]) (a6989586621679969575 :: [c]) = Zip3 a6989586621679969573 a6989586621679969574 a6989586621679969575 :: [(a, b, c)]
- data ZipWithSym0 a6989586621679969561
- data ZipWithSym1 a6989586621679969561 a6989586621679969562
- data ZipWithSym2 a6989586621679969561 a6989586621679969562 a6989586621679969563
- type ZipWithSym3 (a6989586621679969561 :: (~>) a ((~>) b c)) (a6989586621679969562 :: [a]) (a6989586621679969563 :: [b]) = ZipWith a6989586621679969561 a6989586621679969562 a6989586621679969563 :: [c]
- data ZipWith3Sym0 a6989586621679969546
- data ZipWith3Sym1 a6989586621679969546 a6989586621679969547
- data ZipWith3Sym2 a6989586621679969546 a6989586621679969547 a6989586621679969548
- data ZipWith3Sym3 a6989586621679969546 a6989586621679969547 a6989586621679969548 a6989586621679969549
- data UnzipSym0 a6989586621679969527
- type UnzipSym1 (a6989586621679969527 :: [(a, b)]) = Unzip a6989586621679969527 :: ([a], [b])
- data UnlinesSym0 a6989586621679969412
- type UnlinesSym1 (a6989586621679969412 :: [Symbol]) = Unlines a6989586621679969412 :: Symbol
- data UnwordsSym0 a6989586621679969402
- type UnwordsSym1 (a6989586621679969402 :: [Symbol]) = Unwords a6989586621679969402 :: Symbol
Basic singleton definitions
module Data.Singletons
Singleton types
Instances
TestCoercion SBool Source # | |
Defined in Data.Singletons.Prelude.Instances | |
TestEquality SBool Source # | |
Defined in Data.Singletons.Prelude.Instances | |
Show (SBool z) Source # | |
SNil :: forall (a :: Type). SList ('[] :: [a :: Type]) | |
SCons :: forall (a :: Type) (n :: a) (n :: [a]). (Sing n) -> (Sing n) -> SList ('(:) n n :: [a :: Type]) infixr 5 |
SNothing :: forall (a :: Type). SMaybe ('Nothing :: Maybe (a :: Type)) | |
SJust :: forall (a :: Type) (n :: a). (Sing n) -> SMaybe ('Just n :: Maybe (a :: Type)) |
SLeft :: forall (a :: Type) (b :: Type) (n :: a). (Sing n) -> SEither ('Left n :: Either (a :: Type) (b :: Type)) | |
SRight :: forall (a :: Type) (b :: Type) (n :: b). (Sing n) -> SEither ('Right n :: Either (a :: Type) (b :: Type)) |
Instances
(SDecide a, SDecide b) => TestCoercion (SEither :: Either a b -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances | |
(SDecide a, SDecide b) => TestEquality (SEither :: Either a b -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances | |
(ShowSing a, ShowSing b) => Show (SEither z) Source # | |
data SOrdering z where Source #
SLT :: SOrdering ('LT :: Ordering) | |
SEQ :: SOrdering ('EQ :: Ordering) | |
SGT :: SOrdering ('GT :: Ordering) |
Instances
TestCoercion SOrdering Source # | |
Defined in Data.Singletons.Prelude.Instances | |
TestEquality SOrdering Source # | |
Defined in Data.Singletons.Prelude.Instances | |
Show (SOrdering z) Source # | |
Instances
TestCoercion STuple0 Source # | |
Defined in Data.Singletons.Prelude.Instances | |
TestEquality STuple0 Source # | |
Defined in Data.Singletons.Prelude.Instances | |
Show (STuple0 z) Source # | |
STuple2 :: forall (a :: Type) (b :: Type) (n :: a) (n :: b). (Sing n) -> (Sing n) -> STuple2 ('(n, n) :: (a :: Type, b :: Type)) |
Instances
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
(SDecide a, SDecide b, SDecide c) => TestCoercion (STuple3 :: (a, b, c) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances | |
(SDecide a, SDecide b, SDecide c) => TestEquality (STuple3 :: (a, b, c) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances | |
(ShowSing a, ShowSing b, ShowSing c) => Show (STuple3 z) Source # | |
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
(SDecide a, SDecide b, SDecide c, SDecide d) => TestCoercion (STuple4 :: (a, b, c, d) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances | |
(SDecide a, SDecide b, SDecide c, SDecide d) => TestEquality (STuple4 :: (a, b, c, d) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances | |
(ShowSing a, ShowSing b, ShowSing c, ShowSing d) => Show (STuple4 z) Source # | |
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
(SDecide a, SDecide b, SDecide c, SDecide d, SDecide e) => TestCoercion (STuple5 :: (a, b, c, d, e) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances | |
(SDecide a, SDecide b, SDecide c, SDecide d, SDecide e) => TestEquality (STuple5 :: (a, b, c, d, e) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances | |
(ShowSing a, ShowSing b, ShowSing c, ShowSing d, ShowSing e) => Show (STuple5 z) Source # | |
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
(SDecide a, SDecide b, SDecide c, SDecide d, SDecide e, SDecide f) => TestCoercion (STuple6 :: (a, b, c, d, e, f) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances | |
(SDecide a, SDecide b, SDecide c, SDecide d, SDecide e, SDecide f) => TestEquality (STuple6 :: (a, b, c, d, e, f) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances | |
(ShowSing a, ShowSing b, ShowSing c, ShowSing d, ShowSing e, ShowSing f) => Show (STuple6 z) Source # | |
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
(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 # | |
Defined in Data.Singletons.Prelude.Instances | |
(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 # | |
Defined in Data.Singletons.Prelude.Instances | |
(ShowSing a, ShowSing b, ShowSing c, ShowSing d, ShowSing e, ShowSing f, ShowSing g) => Show (STuple7 z) Source # | |
Functions working with Bool
type family If (cond :: Bool) (tru :: k) (fls :: k) :: k where ... #
Type-level If. If True a b
==> a
; If False a b
==> b
type family Not (a :: Bool) = (res :: Bool) | res -> a where ... #
Type-level "not". An injective type family since 4.10.0.0
.
Since: base-4.7.0.0
sOtherwise :: Sing (OtherwiseSym0 :: Bool) Source #
Error reporting
type family Error str where ... Source #
The promotion of error
. This version is more poly-kinded for
easier use.
type family ErrorWithoutStackTrace str where ... Source #
The promotion of errorWithoutStackTrace
. This version is more
poly-kinded for easier use.
sErrorWithoutStackTrace :: Sing (str :: Symbol) -> a Source #
The singleton for errorWithoutStackTrace
.
sUndefined :: HasCallStack => a Source #
The singleton for undefined
.
Singleton equality
module Data.Singletons.Prelude.Eq
Singleton comparisons
type Compare (arg :: a) (arg :: a) :: Ordering Source #
type (arg :: a) < (arg :: a) :: Bool infix 4 Source #
type (arg :: a) <= (arg :: a) :: Bool infix 4 Source #
type (arg :: a) > (arg :: a) :: Bool infix 4 Source #
type (arg :: a) >= (arg :: a) :: Bool infix 4 Source #
Instances
POrd Bool Source # | |
POrd Ordering Source # | |
POrd Nat Source # | |
POrd Symbol Source # | |
POrd () Source # | |
POrd Void Source # | |
POrd All Source # | |
POrd Any Source # | |
POrd [a] Source # | |
POrd (Maybe a) Source # | |
POrd (Min a) Source # | |
POrd (Max a) Source # | |
POrd (First a) Source # | |
POrd (Last a) Source # | |
POrd (WrappedMonoid m) Source # | |
POrd (Option a) Source # | |
POrd (Identity a) Source # | |
POrd (First a) Source # | |
POrd (Last a) Source # | |
POrd (Dual a) Source # | |
POrd (Sum a) Source # | |
POrd (Product a) Source # | |
POrd (Down a) Source # | |
POrd (NonEmpty a) Source # | |
POrd (Either a b) Source # | |
POrd (a, b) Source # | |
POrd (Arg a b) Source # | |
POrd (Proxy s) Source # | |
POrd (a, b, c) Source # | |
POrd (Const a b) Source # | |
POrd (a, b, c, d) Source # | |
POrd (a, b, c, d, e) Source # | |
POrd (a, b, c, d, e, f) Source # | |
POrd (a, b, c, d, e, f, g) Source # | |
class SEq a => SOrd a where Source #
Nothing
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 #
Instances
SOrd Bool Source # | |
Defined in Data.Singletons.Prelude.Ord 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 # | |
Defined in Data.Singletons.Prelude.Ord 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 # | |
Defined in Data.Singletons.TypeLits.Internal 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 # | |
Defined in Data.Singletons.TypeLits.Internal 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 # | |
Defined in Data.Singletons.Prelude.Ord 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 # | |
Defined in Data.Singletons.Prelude.Ord 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 # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal 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 # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal 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 # | |
Defined in Data.Singletons.Prelude.Ord 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 # | |
Defined in Data.Singletons.Prelude.Ord 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 # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal 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 # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal 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 # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal 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 # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal 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 # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal 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 # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal 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 # | |
Defined in Data.Singletons.Prelude.Ord 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 # | |
Defined in Data.Singletons.Prelude.Monoid 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 # | |
Defined in Data.Singletons.Prelude.Monoid 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 # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal 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 # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal 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 # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal 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 # | |
Defined in Data.Singletons.Prelude.Ord 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 # | |
Defined in Data.Singletons.Prelude.Ord 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 # | |
Defined in Data.Singletons.Prelude.Ord 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 # | |
Defined in Data.Singletons.Prelude.Ord 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 # | |
Defined in Data.Singletons.Prelude.Semigroup 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 # | |
Defined in Data.Singletons.Prelude.Proxy 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 # | |
Defined in Data.Singletons.Prelude.Ord 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 # | |
Defined in Data.Singletons.Prelude.Const 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 # | |
Defined in Data.Singletons.Prelude.Ord 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 # | |
Defined in Data.Singletons.Prelude.Ord 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 # | |
Defined in Data.Singletons.Prelude.Ord 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 # | |
Defined in Data.Singletons.Prelude.Ord 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 # |
Singleton Enum and Bounded
As a matter of convenience, the singletons Prelude does not export
promoted/singletonized succ
and pred
, due to likely conflicts with
unary numbers. Please import Enum
directly if
you want these.
class SBounded a where Source #
sMinBound :: Sing (MinBoundSym0 :: a) Source #
sMaxBound :: Sing (MaxBoundSym0 :: a) Source #
Instances
Instances
PBounded Bool Source # | |
PBounded Ordering Source # | |
PBounded () Source # | |
PBounded All Source # | |
PBounded Any Source # | |
PBounded (Min a) Source # | |
PBounded (Max a) Source # | |
PBounded (First a) Source # | |
PBounded (Last a) Source # | |
PBounded (WrappedMonoid m) Source # | |
PBounded (Identity a) Source # | |
PBounded (Dual a) Source # | |
PBounded (Sum a) Source # | |
PBounded (Product a) Source # | |
PBounded (a, b) Source # | |
PBounded (Proxy s) Source # | |
PBounded (a, b, c) Source # | |
PBounded (Const a b) Source # | |
PBounded (a, b, c, d) Source # | |
PBounded (a, b, c, d, e) Source # | |
PBounded (a, b, c, d, e, f) Source # | |
PBounded (a, b, c, d, e, f, g) Source # | |
type MaxBoundSym0 = MaxBound :: a Source #
type MinBoundSym0 = MinBound :: a Source #
sToEnum :: forall (t :: Nat). Sing t -> Sing (Apply ToEnumSym0 t :: a) Source #
sFromEnum :: forall (t :: a). Sing t -> Sing (Apply FromEnumSym0 t :: Nat) Source #
sEnumFromTo :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t :: [a]) Source #
default sEnumFromTo :: forall (t :: a) (t :: a). (Apply (Apply EnumFromToSym0 t) t :: [a]) ~ Apply (Apply EnumFromTo_6989586621679758515Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply EnumFromToSym0 t) t :: [a]) Source #
sEnumFromThenTo :: forall (t :: a) (t :: a) (t :: a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t) t) t :: [a]) Source #
Instances
type ToEnum (arg :: Nat) :: a Source #
type FromEnum (arg :: a) :: Nat Source #
type EnumFromTo (arg :: a) (arg :: a) :: [a] Source #
type EnumFromTo a a = Apply (Apply EnumFromTo_6989586621679758515Sym0 a) a
type EnumFromThenTo (arg :: a) (arg :: a) (arg :: a) :: [a] Source #
type EnumFromThenTo a a a = Apply (Apply (Apply EnumFromThenTo_6989586621679758527Sym0 a) a) a
type EnumFromThenToSym3 (a6989586621679758488 :: a) (a6989586621679758489 :: a) (a6989586621679758490 :: a) = EnumFromThenTo a6989586621679758488 a6989586621679758489 a6989586621679758490 :: [a] Source #
data EnumFromThenToSym2 a6989586621679758488 a6989586621679758489 a6989586621679758490 Source #
Instances
(SEnum a, SingI d1, SingI d2) => SingI (EnumFromThenToSym2 d1 d2 :: TyFun a [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.Enum sing :: Sing (EnumFromThenToSym2 d1 d2) Source # | |
SuppressUnusedWarnings (EnumFromThenToSym2 a6989586621679758488 a6989586621679758489 :: TyFun a [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () Source # | |
type Apply (EnumFromThenToSym2 a6989586621679758488 a6989586621679758489 :: TyFun a [a] -> Type) (a6989586621679758490 :: a) Source # | |
Defined in Data.Singletons.Prelude.Enum type Apply (EnumFromThenToSym2 a6989586621679758488 a6989586621679758489 :: TyFun a [a] -> Type) (a6989586621679758490 :: a) = EnumFromThenToSym3 a6989586621679758488 a6989586621679758489 a6989586621679758490 |
data EnumFromThenToSym1 a6989586621679758488 a6989586621679758489 Source #
Instances
(SEnum a, SingI d) => SingI (EnumFromThenToSym1 d :: TyFun a (a ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Enum sing :: Sing (EnumFromThenToSym1 d) Source # | |
SuppressUnusedWarnings (EnumFromThenToSym1 a6989586621679758488 :: TyFun a (a ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () Source # | |
type Apply (EnumFromThenToSym1 a6989586621679758488 :: TyFun a (a ~> [a]) -> Type) (a6989586621679758489 :: a) Source # | |
Defined in Data.Singletons.Prelude.Enum type Apply (EnumFromThenToSym1 a6989586621679758488 :: TyFun a (a ~> [a]) -> Type) (a6989586621679758489 :: a) = EnumFromThenToSym2 a6989586621679758488 a6989586621679758489 |
data EnumFromThenToSym0 a6989586621679758488 Source #
Instances
SEnum a => SingI (EnumFromThenToSym0 :: TyFun a (a ~> (a ~> [a])) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Enum | |
SuppressUnusedWarnings (EnumFromThenToSym0 :: TyFun a (a ~> (a ~> [a])) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () Source # | |
type Apply (EnumFromThenToSym0 :: TyFun a (a ~> (a ~> [a])) -> Type) (a6989586621679758488 :: a) Source # | |
Defined in Data.Singletons.Prelude.Enum type Apply (EnumFromThenToSym0 :: TyFun a (a ~> (a ~> [a])) -> Type) (a6989586621679758488 :: a) = EnumFromThenToSym1 a6989586621679758488 |
type EnumFromToSym2 (a6989586621679758482 :: a) (a6989586621679758483 :: a) = EnumFromTo a6989586621679758482 a6989586621679758483 :: [a] Source #
data EnumFromToSym1 a6989586621679758482 a6989586621679758483 Source #
Instances
(SEnum a, SingI d) => SingI (EnumFromToSym1 d :: TyFun a [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.Enum sing :: Sing (EnumFromToSym1 d) Source # | |
SuppressUnusedWarnings (EnumFromToSym1 a6989586621679758482 :: TyFun a [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () Source # | |
type Apply (EnumFromToSym1 a6989586621679758482 :: TyFun a [a] -> Type) (a6989586621679758483 :: a) Source # | |
Defined in Data.Singletons.Prelude.Enum type Apply (EnumFromToSym1 a6989586621679758482 :: TyFun a [a] -> Type) (a6989586621679758483 :: a) = EnumFromToSym2 a6989586621679758482 a6989586621679758483 |
data EnumFromToSym0 a6989586621679758482 Source #
Instances
SEnum a => SingI (EnumFromToSym0 :: TyFun a (a ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Enum | |
SuppressUnusedWarnings (EnumFromToSym0 :: TyFun a (a ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () Source # | |
type Apply (EnumFromToSym0 :: TyFun a (a ~> [a]) -> Type) (a6989586621679758482 :: a) Source # | |
Defined in Data.Singletons.Prelude.Enum type Apply (EnumFromToSym0 :: TyFun a (a ~> [a]) -> Type) (a6989586621679758482 :: a) = EnumFromToSym1 a6989586621679758482 |
type FromEnumSym1 (a6989586621679758478 :: a) = FromEnum a6989586621679758478 :: Nat Source #
data FromEnumSym0 a6989586621679758478 Source #
Instances
SEnum a => SingI (FromEnumSym0 :: TyFun a Nat -> Type) Source # | |
Defined in Data.Singletons.Prelude.Enum sing :: Sing FromEnumSym0 Source # | |
SuppressUnusedWarnings (FromEnumSym0 :: TyFun a Nat -> Type) Source # | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () Source # | |
type Apply (FromEnumSym0 :: TyFun a Nat -> Type) (a6989586621679758478 :: a) Source # | |
Defined in Data.Singletons.Prelude.Enum type Apply (FromEnumSym0 :: TyFun a Nat -> Type) (a6989586621679758478 :: a) = FromEnumSym1 a6989586621679758478 |
type ToEnumSym1 (a6989586621679758475 :: Nat) = ToEnum a6989586621679758475 :: a Source #
data ToEnumSym0 a6989586621679758475 Source #
Instances
SEnum a => SingI (ToEnumSym0 :: TyFun Nat a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Enum sing :: Sing ToEnumSym0 Source # | |
SuppressUnusedWarnings (ToEnumSym0 :: TyFun Nat a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () Source # | |
type Apply (ToEnumSym0 :: TyFun Nat k2 -> Type) (a6989586621679758475 :: Nat) Source # | |
Defined in Data.Singletons.Prelude.Enum type Apply (ToEnumSym0 :: TyFun Nat k2 -> Type) (a6989586621679758475 :: Nat) = ToEnumSym1 a6989586621679758475 :: k2 |
Singletons numbers
module Data.Singletons.Prelude.Num
type family (a :: Nat) ^ (b :: Nat) :: Nat where ... infixr 8 #
Exponentiation of type-level naturals.
Since: base-4.7.0.0
Singleton Show
type ShowsPrec (arg :: Nat) (arg :: a) (arg :: Symbol) :: Symbol Source #
type Show_ (arg :: a) :: Symbol Source #
type ShowList (arg :: [a]) (arg :: Symbol) :: Symbol Source #
Instances
PShow Bool Source # | |
PShow Ordering Source # | |
PShow Nat Source # | |
PShow Symbol Source # | |
PShow () Source # | |
PShow Void Source # | |
PShow All Source # | |
PShow Any Source # | |
PShow [a] Source # | |
PShow (Maybe a) Source # | |
PShow (Min a) Source # | |
PShow (Max a) Source # | |
PShow (First a) Source # | |
PShow (Last a) Source # | |
PShow (WrappedMonoid m) Source # | |
PShow (Option a) Source # | |
PShow (Identity a) Source # | |
PShow (First a) Source # | |
PShow (Last a) Source # | |
PShow (Dual a) Source # | |
PShow (Sum a) Source # | |
PShow (Product a) Source # | |
PShow (NonEmpty a) Source # | |
PShow (Either a b) Source # | |
PShow (a, b) Source # | |
PShow (Arg a b) Source # | |
PShow (Proxy s) Source # | |
PShow (a, b, c) Source # | |
PShow (Const a b) Source # | |
PShow (a, b, c, d) Source # | |
PShow (a, b, c, d, e) Source # | |
PShow (a, b, c, d, e, f) Source # | |
PShow (a, b, c, d, e, f, g) Source # | |
Nothing
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 #
Instances
type family Shows a a where ... Source #
Shows s a_6989586621680279555 = Apply (Apply (Apply ShowsPrecSym0 (FromInteger 0)) s) a_6989586621680279555 |
sShows :: forall a (t :: a) (t :: Symbol). SShow a => Sing t -> Sing t -> Sing (Apply (Apply ShowsSym0 t) t :: Symbol) Source #
sShowChar :: forall (t :: Symbol) (t :: Symbol). Sing t -> Sing t -> Sing (Apply (Apply ShowCharSym0 t) t :: Symbol) Source #
type family ShowString a a where ... Source #
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 #
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 #
Singleton Semigroup
and Monoid
class PSemigroup a Source #
Instances
PSemigroup Ordering Source # | |
PSemigroup Symbol Source # | |
PSemigroup () Source # | |
PSemigroup Void Source # | |
PSemigroup All Source # | |
PSemigroup Any Source # | |
PSemigroup [a] Source # | |
PSemigroup (Maybe a) Source # | |
PSemigroup (Min a) Source # | |
PSemigroup (Max a) Source # | |
PSemigroup (First a) Source # | |
PSemigroup (Last a) Source # | |
PSemigroup (WrappedMonoid m) Source # | |
PSemigroup (Option a) Source # | |
PSemigroup (Identity a) Source # | |
PSemigroup (First a) Source # | |
PSemigroup (Last a) Source # | |
PSemigroup (Dual a) Source # | |
PSemigroup (Sum a) Source # | |
PSemigroup (Product a) Source # | |
PSemigroup (Down a) Source # | |
PSemigroup (NonEmpty a) Source # | |
PSemigroup (Either a b) Source # | |
PSemigroup (a, b) Source # | |
PSemigroup (Proxy s) Source # | |
PSemigroup (a ~> b) Source # | |
PSemigroup (a, b, c) Source # | |
PSemigroup (Const a b) Source # | |
PSemigroup (a, b, c, d) Source # | |
PSemigroup (a, b, c, d, e) Source # | |
class SSemigroup a where Source #
(%<>) :: forall (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply (<>@#@$) t) t :: a) infixr 6 Source #
Instances
Instances
PMonoid Ordering Source # | |
PMonoid Symbol Source # | |
PMonoid () Source # | |
PMonoid All Source # | |
PMonoid Any Source # | |
PMonoid [a] Source # | |
PMonoid (Maybe a) Source # | |
PMonoid (Min a) Source # | |
PMonoid (Max a) Source # | |
PMonoid (WrappedMonoid m) Source # | |
PMonoid (Option a) Source # | |
PMonoid (Identity a) Source # | |
PMonoid (First a) Source # | |
PMonoid (Last a) Source # | |
PMonoid (Dual a) Source # | |
PMonoid (Sum a) Source # | |
PMonoid (Product a) Source # | |
PMonoid (Down a) Source # | |
PMonoid (a, b) Source # | |
PMonoid (Proxy s) Source # | |
PMonoid (a ~> b) Source # | |
PMonoid (a, b, c) Source # | |
PMonoid (Const a b) Source # | |
PMonoid (a, b, c, d) Source # | |
PMonoid (a, b, c, d, e) Source # | |
class SSemigroup a => SMonoid a where Source #
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
Singleton Functor
, Applicative
, Monad
, and MonadFail
Instances
PFunctor [] Source # | |
PFunctor Maybe Source # | |
PFunctor Min Source # | |
PFunctor Max Source # | |
PFunctor First Source # | |
PFunctor Last Source # | |
PFunctor Option Source # | |
PFunctor Identity Source # | |
PFunctor First Source # | |
PFunctor Last Source # | |
PFunctor Dual Source # | |
PFunctor Sum Source # | |
PFunctor Product Source # | |
PFunctor Down Source # | |
PFunctor NonEmpty Source # | |
PFunctor (Either a) Source # | |
PFunctor ((,) a) Source # | |
PFunctor (Arg a) Source # | |
PFunctor (Proxy :: Type -> Type) Source # | |
PFunctor (Const m :: Type -> Type) Source # | |
class SFunctor f where Source #
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 #
Instances
SFunctor [] Source # | |
SFunctor Maybe Source # | |
SFunctor Min Source # | |
SFunctor Max Source # | |
SFunctor First Source # | |
SFunctor Last Source # | |
SFunctor Option Source # | |
SFunctor Identity Source # | |
SFunctor First Source # | |
SFunctor Last Source # | |
SFunctor Dual Source # | |
SFunctor Sum Source # | |
SFunctor Product Source # | |
SFunctor Down Source # | |
SFunctor NonEmpty Source # | |
SFunctor (Either a) Source # | |
SFunctor ((,) a) Source # | |
SFunctor (Arg a) Source # | |
SFunctor (Proxy :: Type -> Type) Source # | |
SFunctor (Const m :: Type -> Type) Source # | |
(%<$>) :: forall a b f (t :: (~>) a b) (t :: f a). SFunctor f => Sing t -> Sing t -> Sing (Apply (Apply (<$>@#@$) t) t :: f b) infixl 4 Source #
class PApplicative f Source #
type Pure (arg :: a) :: f a Source #
type (arg :: f ((~>) a b)) <*> (arg :: f a) :: f b infixl 4 Source #
Instances
class SFunctor f => SApplicative f where Source #
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 #
(%*>) :: 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 #
Instances
SApplicative [] Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal 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 # | |
Defined in Data.Singletons.Prelude.Monad.Internal 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 # | |
Defined in Data.Singletons.Prelude.Semigroup 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 # | |
Defined in Data.Singletons.Prelude.Semigroup 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 # | |
Defined in Data.Singletons.Prelude.Semigroup 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 # | |
Defined in Data.Singletons.Prelude.Semigroup 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 # | |
Defined in Data.Singletons.Prelude.Semigroup 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 # | |
Defined in Data.Singletons.Prelude.Identity 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 # | |
Defined in Data.Singletons.Prelude.Monoid 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 # | |
Defined in Data.Singletons.Prelude.Monoid 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 # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal 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 # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal 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 # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal 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 # | |
Defined in Data.Singletons.Prelude.Applicative 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 # | |
Defined in Data.Singletons.Prelude.Monad.Internal 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 # | |
Defined in Data.Singletons.Prelude.Monad.Internal 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 # | |
Defined in Data.Singletons.Prelude.Applicative 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 # | |
Defined in Data.Singletons.Prelude.Proxy 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 # | |
Defined in Data.Singletons.Prelude.Const 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 (arg :: m a) >>= (arg :: (~>) a (m b)) :: m b infixl 1 Source #
Instances
PMonad [] Source # | |
PMonad Maybe Source # | |
PMonad Min Source # | |
PMonad Max Source # | |
PMonad First Source # | |
PMonad Last Source # | |
PMonad Option Source # | |
PMonad Identity Source # | |
PMonad First Source # | |
PMonad Last Source # | |
PMonad Dual Source # | |
PMonad Sum Source # | |
PMonad Product Source # | |
PMonad Down Source # | |
PMonad NonEmpty Source # | |
PMonad (Either e) Source # | |
PMonad ((,) a) Source # | |
PMonad (Proxy :: Type -> Type) Source # | |
class SApplicative m => SMonad m where Source #
(%>>=) :: forall a b (t :: m a) (t :: (~>) a (m b)). Sing t -> Sing t -> Sing (Apply (Apply (>>=@#@$) t) t :: m b) infixl 1 Source #
(%>>) :: forall a b (t :: m a) (t :: m b). Sing t -> Sing t -> Sing (Apply (Apply (>>@#@$) t) t :: m b) infixl 1 Source #
default (%>>) :: forall a b (t :: m a) (t :: m b). (Apply (Apply (>>@#@$) t) t :: m b) ~ Apply (Apply TFHelper_6989586621679559787Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply (>>@#@$) t) t :: m b) Source #
sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t :: m a) Source #
default sReturn :: forall a (t :: a). (Apply ReturnSym0 t :: m a) ~ Apply Return_6989586621679559804Sym0 t => Sing t -> Sing (Apply ReturnSym0 t :: m a) Source #
Instances
class PMonadFail m Source #
Instances
PMonadFail [] Source # | |
Defined in Data.Singletons.Prelude.Monad.Fail | |
PMonadFail Maybe Source # | |
Defined in Data.Singletons.Prelude.Monad.Fail |
class SMonad m => SMonadFail m where Source #
Instances
sMapM_ :: forall a m b t (t :: (~>) a (m b)) (t :: t a). (SFoldable t, SMonad m) => Sing t -> Sing t -> Sing (Apply (Apply MapM_Sym0 t) t :: m ()) Source #
type family Sequence_ a where ... Source #
Sequence_ a_6989586621680492351 = Apply (Apply (Apply FoldrSym0 (>>@#@$)) (Apply ReturnSym0 Tuple0Sym0)) a_6989586621680492351 |
sSequence_ :: forall t m a (t :: t (m a)). (SFoldable t, SMonad m) => Sing t -> Sing (Apply Sequence_Sym0 t :: m ()) Source #
(%=<<) :: forall a m b (t :: (~>) a (m b)) (t :: m a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply (=<<@#@$) t) t :: m b) infixr 1 Source #
Singleton Foldable
and Traversable
type FoldMap (arg :: (~>) a m) (arg :: t a) :: m Source #
type Foldr (arg :: (~>) a ((~>) b b)) (arg :: b) (arg :: t a) :: b Source #
type Foldl (arg :: (~>) b ((~>) a b)) (arg :: b) (arg :: t a) :: b Source #
type Foldr1 (arg :: (~>) a ((~>) a a)) (arg :: t a) :: a Source #
type Foldl1 (arg :: (~>) a ((~>) a a)) (arg :: t a) :: a Source #
type Elem (arg :: a) (arg :: t a) :: Bool Source #
type Maximum (arg :: t a) :: a Source #
type Minimum (arg :: t a) :: a Source #
Instances
PFoldable [] Source # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
PFoldable Maybe Source # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
PFoldable Min Source # | |
Defined in Data.Singletons.Prelude.Semigroup 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 # | |
PFoldable Max Source # | |
Defined in Data.Singletons.Prelude.Semigroup 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 # | |
PFoldable First Source # | |
Defined in Data.Singletons.Prelude.Semigroup 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 # | |
PFoldable Last Source # | |
Defined in Data.Singletons.Prelude.Semigroup 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 # | |
PFoldable Option Source # | |
Defined in Data.Singletons.Prelude.Semigroup 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 # | |
PFoldable Identity Source # | |
Defined in Data.Singletons.Prelude.Identity 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 # | |
PFoldable First Source # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
PFoldable Last Source # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
PFoldable Dual Source # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
PFoldable Sum Source # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
PFoldable Product Source # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
PFoldable NonEmpty Source # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
PFoldable (Either a) Source # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
PFoldable ((,) a) Source # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
PFoldable (Arg a) Source # | |
Defined in Data.Singletons.Prelude.Semigroup 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 # | |
PFoldable (Proxy :: Type -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
PFoldable (Const m :: Type -> Type) Source # | |
Defined in Data.Singletons.Prelude.Const 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 # |
class SFoldable t where Source #
Nothing
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 #
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 #
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 #
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 #
Instances
SFoldable [] Source # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
Defined in Data.Singletons.Prelude.Semigroup 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 # | |
Defined in Data.Singletons.Prelude.Semigroup 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 # | |
Defined in Data.Singletons.Prelude.Semigroup 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 # | |
Defined in Data.Singletons.Prelude.Semigroup 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 # | |
Defined in Data.Singletons.Prelude.Semigroup 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 # | |
Defined in Data.Singletons.Prelude.Identity 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 # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
Defined in Data.Singletons.Prelude.Semigroup 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 # | |
Defined in Data.Singletons.Prelude.Foldable 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 # | |
Defined in Data.Singletons.Prelude.Const 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 PTraversable t Source #
type Traverse (arg :: (~>) a (f b)) (arg :: t a) :: f (t b) Source #
type SequenceA (arg :: t (f a)) :: f (t a) Source #
type MapM (arg :: (~>) a (m b)) (arg :: t a) :: m (t b) Source #
Instances
class (SFunctor t, SFoldable t) => STraversable t where Source #
Nothing
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 #
Instances
Miscellaneous functions
sConst :: forall a b (t :: a) (t :: b). Sing t -> Sing t -> Sing (Apply (Apply ConstSym0 t) t :: a) Source #
(%.) :: 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 #
(%$) :: forall a b (t :: (~>) a b) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply ($@#@$) t) t :: b) infixr 0 Source #
(%$!) :: forall a b (t :: (~>) a b) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply ($!@#@$) t) t :: b) infixr 0 Source #
sFlip :: forall a b c (t :: (~>) a ((~>) b c)) (t :: b) (t :: a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FlipSym0 t) t) t :: c) Source #
sAsTypeOf :: forall a (t :: a) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply AsTypeOfSym0 t) t :: a) Source #
sSeq :: forall a b (t :: a) (t :: b). Sing t -> Sing t -> Sing (Apply (Apply SeqSym0 t) t :: b) infixr 0 Source #
List operations
sMap :: forall a b (t :: (~>) a b) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply MapSym0 t) t :: [b]) Source #
(%++) :: forall a (t :: [a]) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply (++@#@$) t) t :: [a]) infixr 5 Source #
sFilter :: forall a (t :: (~>) a Bool) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply FilterSym0 t) t :: [a]) Source #
type family Null (arg :: t a) :: Bool Source #
Instances
Special folds
type family And a where ... Source #
And a_6989586621680492312 = Apply (Apply (Apply (.@#@$) GetAllSym0) (Apply FoldMapSym0 All_Sym0)) a_6989586621680492312 |
type family Or a where ... Source #
Or a_6989586621680492306 = Apply (Apply (Apply (.@#@$) GetAnySym0) (Apply FoldMapSym0 Any_Sym0)) a_6989586621680492306 |
sAny :: forall a t (t :: (~>) a Bool) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply AnySym0 t) t :: Bool) Source #
sAll :: forall a t (t :: (~>) a Bool) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply AllSym0 t) t :: Bool) Source #
sConcat :: forall t a (t :: t [a]). SFoldable t => Sing t -> Sing (Apply ConcatSym0 t :: [a]) Source #
sConcatMap :: forall a b t (t :: (~>) a [b]) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply ConcatMapSym0 t) t :: [b]) Source #
Scans
sScanl :: forall b a (t :: (~>) b ((~>) a b)) (t :: b) (t :: [a]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ScanlSym0 t) t) t :: [b]) Source #
sScanl1 :: forall a (t :: (~>) a ((~>) a a)) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply Scanl1Sym0 t) t :: [a]) Source #
sScanr :: forall a b (t :: (~>) a ((~>) b b)) (t :: b) (t :: [a]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ScanrSym0 t) t) t :: [b]) Source #
type family Scanr1 a a where ... Source #
Scanr1 _ '[] = NilSym0 | |
Scanr1 _ '[x] = Apply (Apply (:@#@$) x) NilSym0 | |
Scanr1 f ('(:) x ('(:) wild_6989586621679965248 wild_6989586621679965250)) = Case_6989586621679969769 f x wild_6989586621679965248 wild_6989586621679965250 (Let6989586621679969767Scrutinee_6989586621679965242Sym4 f x wild_6989586621679965248 wild_6989586621679965250) |
sScanr1 :: forall a (t :: (~>) a ((~>) a a)) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply Scanr1Sym0 t) t :: [a]) Source #
Infinite lists
type family Replicate a a where ... Source #
Replicate n x = Case_6989586621679968901 n x (Let6989586621679968899Scrutinee_6989586621679965344Sym2 n x) |
sReplicate :: forall a (t :: Nat) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply ReplicateSym0 t) t :: [a]) Source #
Sublists
sTake :: forall a (t :: Nat) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply TakeSym0 t) t :: [a]) Source #
sDrop :: forall a (t :: Nat) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply DropSym0 t) t :: [a]) Source #
sSplitAt :: forall a (t :: Nat) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply SplitAtSym0 t) t :: ([a], [a])) Source #
sTakeWhile :: forall a (t :: (~>) a Bool) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply TakeWhileSym0 t) t :: [a]) Source #
type family Span a a where ... Source #
Span _ '[] = Apply (Apply Tuple2Sym0 Let6989586621679969100XsSym0) Let6989586621679969100XsSym0 | |
Span p ('(:) x xs') = Case_6989586621679969109 p x xs' (Let6989586621679969107Scrutinee_6989586621679965324Sym3 p x xs') |
sSpan :: forall a (t :: (~>) a Bool) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply SpanSym0 t) t :: ([a], [a])) Source #
type family Break a a where ... Source #
Break _ '[] = Apply (Apply Tuple2Sym0 Let6989586621679969065XsSym0) Let6989586621679969065XsSym0 | |
Break p ('(:) x xs') = Case_6989586621679969074 p x xs' (Let6989586621679969072Scrutinee_6989586621679965326Sym3 p x xs') |
sBreak :: forall a (t :: (~>) a Bool) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply BreakSym0 t) t :: ([a], [a])) Source #
Searching lists
sNotElem :: forall a t (t :: a) (t :: t a). (SFoldable t, SEq a) => Sing t -> Sing t -> Sing (Apply (Apply NotElemSym0 t) t :: Bool) Source #
type family Lookup a a where ... Source #
Lookup _key '[] = NothingSym0 | |
Lookup key ('(:) '(x, y) xys) = Case_6989586621679968967 key x y xys (Let6989586621679968965Scrutinee_6989586621679965340Sym4 key x y xys) |
sLookup :: forall a b (t :: a) (t :: [(a, b)]). SEq a => Sing t -> Sing t -> Sing (Apply (Apply LookupSym0 t) t :: Maybe b) Source #
Zipping and unzipping lists
sZip :: forall a b (t :: [a]) (t :: [b]). Sing t -> Sing t -> Sing (Apply (Apply ZipSym0 t) t :: [(a, b)]) Source #
type family Zip3 a a a where ... Source #
Zip3 ('(:) a as) ('(:) b bs) ('(:) c cs) = Apply (Apply (:@#@$) (Apply (Apply (Apply Tuple3Sym0 a) b) c)) (Apply (Apply (Apply Zip3Sym0 as) bs) cs) | |
Zip3 '[] '[] '[] = NilSym0 | |
Zip3 '[] '[] ('(:) _ _) = NilSym0 | |
Zip3 '[] ('(:) _ _) '[] = NilSym0 | |
Zip3 '[] ('(:) _ _) ('(:) _ _) = NilSym0 | |
Zip3 ('(:) _ _) '[] '[] = NilSym0 | |
Zip3 ('(:) _ _) '[] ('(:) _ _) = NilSym0 | |
Zip3 ('(:) _ _) ('(:) _ _) '[] = NilSym0 |
sZip3 :: forall a b c (t :: [a]) (t :: [b]) (t :: [c]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Zip3Sym0 t) t) t :: [(a, b, c)]) Source #
sZipWith :: forall a b c (t :: (~>) a ((~>) b c)) (t :: [a]) (t :: [b]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ZipWithSym0 t) t) t :: [c]) Source #
type family ZipWith3 a a a a where ... Source #
ZipWith3 z ('(:) a as) ('(:) b bs) ('(:) c cs) = Apply (Apply (:@#@$) (Apply (Apply (Apply z a) b) c)) (Apply (Apply (Apply (Apply ZipWith3Sym0 z) as) bs) cs) | |
ZipWith3 _ '[] '[] '[] = NilSym0 | |
ZipWith3 _ '[] '[] ('(:) _ _) = NilSym0 | |
ZipWith3 _ '[] ('(:) _ _) '[] = NilSym0 | |
ZipWith3 _ '[] ('(:) _ _) ('(:) _ _) = NilSym0 | |
ZipWith3 _ ('(:) _ _) '[] '[] = NilSym0 | |
ZipWith3 _ ('(:) _ _) '[] ('(:) _ _) = NilSym0 | |
ZipWith3 _ ('(:) _ _) ('(:) _ _) '[] = NilSym0 |
sZipWith3 :: forall a b c d (t :: (~>) a ((~>) b ((~>) c d))) (t :: [a]) (t :: [b]) (t :: [c]). Sing t -> Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply (Apply ZipWith3Sym0 t) t) t) t :: [d]) Source #
sUnzip3 :: forall a b c (t :: [(a, b, c)]). Sing t -> Sing (Apply Unzip3Sym0 t :: ([a], [b], [c])) Source #
Functions on Symbol
s
Other datatypes
sMaybe_ :: forall b a (t :: b) (t :: (~>) a b) (t :: Maybe a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Maybe_Sym0 t) t) t :: b) Source #
sEither_ :: forall a c b (t :: (~>) a c) (t :: (~>) b c) (t :: Either a b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Either_Sym0 t) t) t :: c) Source #
sCurry :: forall a b c (t :: (~>) (a, b) c) (t :: a) (t :: b). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply CurrySym0 t) t) t :: c) Source #
sUncurry :: forall a b c (t :: (~>) a ((~>) b c)) (t :: (a, b)). Sing t -> Sing t -> Sing (Apply (Apply UncurrySym0 t) t :: c) Source #
(Kind) This is the kind of type-level symbols. Declared here because class IP needs it
Instances
Other functions
Defunctionalization symbols
data NotSym0 a6989586621679367240 Source #
Instances
SingI NotSym0 Source # | |
SuppressUnusedWarnings NotSym0 Source # | |
Defined in Data.Singletons.Prelude.Bool suppressUnusedWarnings :: () Source # | |
type Apply NotSym0 (a6989586621679367240 :: Bool) Source # | |
Defined in Data.Singletons.Prelude.Bool |
data (&&@#@$) a6989586621679366665 infixr 3 Source #
Instances
SingI (&&@#@$) Source # | |
SuppressUnusedWarnings (&&@#@$) Source # | |
Defined in Data.Singletons.Prelude.Bool suppressUnusedWarnings :: () Source # | |
type Apply (&&@#@$) (a6989586621679366665 :: Bool) Source # | |
Defined in Data.Singletons.Prelude.Bool |
data a6989586621679366665 &&@#@$$ a6989586621679366666 infixr 3 Source #
Instances
SingI x => SingI ((&&@#@$$) x :: TyFun Bool Bool -> Type) Source # | |
SuppressUnusedWarnings ((&&@#@$$) a6989586621679366665 :: TyFun Bool Bool -> Type) Source # | |
Defined in Data.Singletons.Prelude.Bool suppressUnusedWarnings :: () Source # | |
type Apply ((&&@#@$$) a6989586621679366665 :: TyFun Bool Bool -> Type) (a6989586621679366666 :: Bool) Source # | |
type (&&@#@$$$) (a6989586621679366665 :: Bool) (a6989586621679366666 :: Bool) = (&&) a6989586621679366665 a6989586621679366666 :: Bool infixr 3 Source #
data (||@#@$) a6989586621679366963 infixr 2 Source #
Instances
SingI (||@#@$) Source # | |
SuppressUnusedWarnings (||@#@$) Source # | |
Defined in Data.Singletons.Prelude.Bool suppressUnusedWarnings :: () Source # | |
type Apply (||@#@$) (a6989586621679366963 :: Bool) Source # | |
Defined in Data.Singletons.Prelude.Bool |
data a6989586621679366963 ||@#@$$ a6989586621679366964 infixr 2 Source #
Instances
SingI x => SingI ((||@#@$$) x :: TyFun Bool Bool -> Type) Source # | |
SuppressUnusedWarnings ((||@#@$$) a6989586621679366963 :: TyFun Bool Bool -> Type) Source # | |
Defined in Data.Singletons.Prelude.Bool suppressUnusedWarnings :: () Source # | |
type Apply ((||@#@$$) a6989586621679366963 :: TyFun Bool Bool -> Type) (a6989586621679366964 :: Bool) Source # | |
type (||@#@$$$) (a6989586621679366963 :: Bool) (a6989586621679366964 :: Bool) = (||) a6989586621679366963 a6989586621679366964 :: Bool infixr 2 Source #
type OtherwiseSym0 = Otherwise :: Bool Source #
data JustSym0 a6989586621679304113 Source #
Instances
type JustSym1 (a6989586621679304113 :: a) = 'Just a6989586621679304113 :: Maybe (a :: Type) Source #
data Maybe_Sym0 a6989586621679500654 Source #
Instances
SingI (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing Maybe_Sym0 Source # | |
SuppressUnusedWarnings (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () Source # | |
type Apply (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) (a6989586621679500654 :: b) Source # | |
Defined in Data.Singletons.Prelude.Maybe |
data Maybe_Sym1 a6989586621679500654 a6989586621679500655 Source #
Instances
SingI d => SingI (Maybe_Sym1 d :: TyFun (a ~> b) (Maybe a ~> b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing (Maybe_Sym1 d) Source # | |
SuppressUnusedWarnings (Maybe_Sym1 a6989586621679500654 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () Source # | |
type Apply (Maybe_Sym1 a6989586621679500654 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) (a6989586621679500655 :: a ~> b) Source # | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym1 a6989586621679500654 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) (a6989586621679500655 :: a ~> b) = Maybe_Sym2 a6989586621679500654 a6989586621679500655 |
data Maybe_Sym2 a6989586621679500654 a6989586621679500655 a6989586621679500656 Source #
Instances
(SingI d1, SingI d2) => SingI (Maybe_Sym2 d1 d2 :: TyFun (Maybe a) b -> Type) Source # | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing (Maybe_Sym2 d1 d2) Source # | |
SuppressUnusedWarnings (Maybe_Sym2 a6989586621679500654 a6989586621679500655 :: TyFun (Maybe a) b -> Type) Source # | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () Source # | |
type Apply (Maybe_Sym2 a6989586621679500654 a6989586621679500655 :: TyFun (Maybe a) b -> Type) (a6989586621679500656 :: Maybe a) Source # | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym2 a6989586621679500654 a6989586621679500655 :: TyFun (Maybe a) b -> Type) (a6989586621679500656 :: Maybe a) = Maybe_Sym3 a6989586621679500654 a6989586621679500655 a6989586621679500656 |
type Maybe_Sym3 (a6989586621679500654 :: b) (a6989586621679500655 :: (~>) a b) (a6989586621679500656 :: Maybe a) = Maybe_ a6989586621679500654 a6989586621679500655 a6989586621679500656 :: b Source #
data LeftSym0 a6989586621679304182 Source #
Instances
SingI (LeftSym0 :: TyFun a (Either a b) -> Type) Source # | |
SuppressUnusedWarnings (LeftSym0 :: TyFun a (Either a b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (LeftSym0 :: TyFun a (Either a b) -> Type) (a6989586621679304182 :: a) Source # | |
type LeftSym1 (a6989586621679304182 :: a) = 'Left a6989586621679304182 :: Either (a :: Type) (b :: Type) Source #
data RightSym0 a6989586621679304184 Source #
Instances
SingI (RightSym0 :: TyFun b (Either a b) -> Type) Source # | |
SuppressUnusedWarnings (RightSym0 :: TyFun b (Either a b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (RightSym0 :: TyFun b (Either a b) -> Type) (a6989586621679304184 :: b) Source # | |
type RightSym1 (a6989586621679304184 :: b) = 'Right a6989586621679304184 :: Either (a :: Type) (b :: Type) Source #
data Either_Sym0 a6989586621680470389 Source #
Instances
SingI (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Either sing :: Sing Either_Sym0 Source # | |
SuppressUnusedWarnings (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Either suppressUnusedWarnings :: () Source # | |
type Apply (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) (a6989586621680470389 :: a ~> c) Source # | |
data Either_Sym1 a6989586621680470389 a6989586621680470390 Source #
Instances
SingI d => SingI (Either_Sym1 d :: TyFun (b ~> c) (Either a b ~> c) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Either sing :: Sing (Either_Sym1 d) Source # | |
SuppressUnusedWarnings (Either_Sym1 a6989586621680470389 :: TyFun (b ~> c) (Either a b ~> c) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Either suppressUnusedWarnings :: () Source # | |
type Apply (Either_Sym1 a6989586621680470389 :: TyFun (b ~> c) (Either a b ~> c) -> Type) (a6989586621680470390 :: b ~> c) Source # | |
Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym1 a6989586621680470389 :: TyFun (b ~> c) (Either a b ~> c) -> Type) (a6989586621680470390 :: b ~> c) = Either_Sym2 a6989586621680470389 a6989586621680470390 |
data Either_Sym2 a6989586621680470389 a6989586621680470390 a6989586621680470391 Source #
Instances
(SingI d1, SingI d2) => SingI (Either_Sym2 d1 d2 :: TyFun (Either a b) c -> Type) Source # | |
Defined in Data.Singletons.Prelude.Either sing :: Sing (Either_Sym2 d1 d2) Source # | |
SuppressUnusedWarnings (Either_Sym2 a6989586621680470389 a6989586621680470390 :: TyFun (Either a b) c -> Type) Source # | |
Defined in Data.Singletons.Prelude.Either suppressUnusedWarnings :: () Source # | |
type Apply (Either_Sym2 a6989586621680470389 a6989586621680470390 :: TyFun (Either a b) c -> Type) (a6989586621680470391 :: Either a b) Source # | |
Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym2 a6989586621680470389 a6989586621680470390 :: TyFun (Either a b) c -> Type) (a6989586621680470391 :: Either a b) = Either_Sym3 a6989586621680470389 a6989586621680470390 a6989586621680470391 |
type Either_Sym3 (a6989586621680470389 :: (~>) a c) (a6989586621680470390 :: (~>) b c) (a6989586621680470391 :: Either a b) = Either_ a6989586621680470389 a6989586621680470390 a6989586621680470391 :: c Source #
type Tuple0Sym0 = '() :: () Source #
data Tuple2Sym0 a6989586621679304233 Source #
Instances
SingI (Tuple2Sym0 :: TyFun a (b ~> (a, b)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances sing :: Sing Tuple2Sym0 Source # | |
SuppressUnusedWarnings (Tuple2Sym0 :: TyFun a (b ~> (a, b)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple2Sym0 :: TyFun a (b ~> (a, b)) -> Type) (a6989586621679304233 :: a) Source # | |
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
SingI d => SingI (Tuple2Sym1 d :: TyFun b (a, b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances sing :: Sing (Tuple2Sym1 d) Source # | |
SuppressUnusedWarnings (Tuple2Sym1 a6989586621679304233 :: TyFun b (a, b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple2Sym1 a6989586621679304233 :: TyFun b (a, b) -> Type) (a6989586621679304234 :: b) Source # | |
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
SingI (Tuple3Sym0 :: TyFun a (b ~> (c ~> (a, b, c))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances sing :: Sing Tuple3Sym0 Source # | |
SuppressUnusedWarnings (Tuple3Sym0 :: TyFun a (b ~> (c ~> (a, b, c))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple3Sym0 :: TyFun a (b ~> (c ~> (a, b, c))) -> Type) (a6989586621679304264 :: a) Source # | |
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
SingI d => SingI (Tuple3Sym1 d :: TyFun b (c ~> (a, b, c)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances sing :: Sing (Tuple3Sym1 d) Source # | |
SuppressUnusedWarnings (Tuple3Sym1 a6989586621679304264 :: TyFun b (c ~> (a, b, c)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple3Sym1 a6989586621679304264 :: TyFun b (c ~> (a, b, c)) -> Type) (a6989586621679304265 :: b) Source # | |
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
(SingI d1, SingI d2) => SingI (Tuple3Sym2 d1 d2 :: TyFun c (a, b, c) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances sing :: Sing (Tuple3Sym2 d1 d2) Source # | |
SuppressUnusedWarnings (Tuple3Sym2 a6989586621679304264 a6989586621679304265 :: TyFun c (a, b, c) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple3Sym2 a6989586621679304264 a6989586621679304265 :: TyFun c (a, b, c) -> Type) (a6989586621679304266 :: c) Source # | |
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
SingI (Tuple4Sym0 :: TyFun a (b ~> (c ~> (d ~> (a, b, c, d)))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances sing :: Sing Tuple4Sym0 Source # | |
SuppressUnusedWarnings (Tuple4Sym0 :: TyFun a (b ~> (c ~> (d ~> (a, b, c, d)))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple4Sym0 :: TyFun a (b ~> (c ~> (d ~> (a, b, c, d)))) -> Type) (a6989586621679304310 :: a) Source # | |
Defined in Data.Singletons.Prelude.Instances |
data Tuple4Sym1 a6989586621679304310 a6989586621679304311 Source #
Instances
SingI d1 => SingI (Tuple4Sym1 d1 :: TyFun b (c ~> (d2 ~> (a, b, c, d2))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances sing :: Sing (Tuple4Sym1 d1) Source # | |
SuppressUnusedWarnings (Tuple4Sym1 a6989586621679304310 :: TyFun b (c ~> (d ~> (a, b, c, d))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple4Sym1 a6989586621679304310 :: TyFun b (c ~> (d ~> (a, b, c, d))) -> Type) (a6989586621679304311 :: b) Source # | |
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
(SingI d1, SingI d2) => SingI (Tuple4Sym2 d1 d2 :: TyFun c (d3 ~> (a, b, c, d3)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances sing :: Sing (Tuple4Sym2 d1 d2) Source # | |
SuppressUnusedWarnings (Tuple4Sym2 a6989586621679304310 a6989586621679304311 :: TyFun c (d ~> (a, b, c, d)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple4Sym2 a6989586621679304310 a6989586621679304311 :: TyFun c (d ~> (a, b, c, d)) -> Type) (a6989586621679304312 :: c) Source # | |
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
(SingI d1, SingI d2, SingI d3) => SingI (Tuple4Sym3 d1 d2 d3 :: TyFun d4 (a, b, c, d4) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances sing :: Sing (Tuple4Sym3 d1 d2 d3) Source # | |
SuppressUnusedWarnings (Tuple4Sym3 a6989586621679304310 a6989586621679304311 a6989586621679304312 :: TyFun d (a, b, c, d) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple4Sym3 a6989586621679304310 a6989586621679304311 a6989586621679304312 :: TyFun d (a, b, c, d) -> Type) (a6989586621679304313 :: d) Source # | |
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
SingI (Tuple5Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (a, b, c, d, e))))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances sing :: Sing Tuple5Sym0 Source # | |
SuppressUnusedWarnings (Tuple5Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (a, b, c, d, e))))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple5Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (a, b, c, d, e))))) -> Type) (a6989586621679304373 :: a) Source # | |
Defined in Data.Singletons.Prelude.Instances |
data Tuple5Sym1 a6989586621679304373 a6989586621679304374 Source #
Instances
SingI d1 => SingI (Tuple5Sym1 d1 :: TyFun b (c ~> (d2 ~> (e ~> (a, b, c, d2, e)))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances sing :: Sing (Tuple5Sym1 d1) Source # | |
SuppressUnusedWarnings (Tuple5Sym1 a6989586621679304373 :: TyFun b (c ~> (d ~> (e ~> (a, b, c, d, e)))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple5Sym1 a6989586621679304373 :: TyFun b (c ~> (d ~> (e ~> (a, b, c, d, e)))) -> Type) (a6989586621679304374 :: b) Source # | |
Defined in Data.Singletons.Prelude.Instances |
data Tuple5Sym2 a6989586621679304373 a6989586621679304374 a6989586621679304375 Source #
Instances
(SingI d1, SingI d2) => SingI (Tuple5Sym2 d1 d2 :: TyFun c (d3 ~> (e ~> (a, b, c, d3, e))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances sing :: Sing (Tuple5Sym2 d1 d2) Source # | |
SuppressUnusedWarnings (Tuple5Sym2 a6989586621679304373 a6989586621679304374 :: TyFun c (d ~> (e ~> (a, b, c, d, e))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple5Sym2 a6989586621679304373 a6989586621679304374 :: TyFun c (d ~> (e ~> (a, b, c, d, e))) -> Type) (a6989586621679304375 :: c) Source # | |
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
(SingI d1, SingI d2, SingI d3) => SingI (Tuple5Sym3 d1 d2 d3 :: TyFun d4 (e ~> (a, b, c, d4, e)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances sing :: Sing (Tuple5Sym3 d1 d2 d3) Source # | |
SuppressUnusedWarnings (Tuple5Sym3 a6989586621679304373 a6989586621679304374 a6989586621679304375 :: TyFun d (e ~> (a, b, c, d, e)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple5Sym3 a6989586621679304373 a6989586621679304374 a6989586621679304375 :: TyFun d (e ~> (a, b, c, d, e)) -> Type) (a6989586621679304376 :: d) Source # | |
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
(SingI d1, SingI d2, SingI d3, SingI d5) => SingI (Tuple5Sym4 d1 d2 d3 d5 :: TyFun e (a, b, c, d4, e) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances sing :: Sing (Tuple5Sym4 d1 d2 d3 d5) Source # | |
SuppressUnusedWarnings (Tuple5Sym4 a6989586621679304373 a6989586621679304374 a6989586621679304375 a6989586621679304376 :: TyFun e (a, b, c, d, e) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple5Sym4 a6989586621679304373 a6989586621679304374 a6989586621679304375 a6989586621679304376 :: TyFun e (a, b, c, d, e) -> Type) (a6989586621679304377 :: e) Source # | |
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
SingI (Tuple6Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f)))))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances sing :: Sing Tuple6Sym0 Source # | |
SuppressUnusedWarnings (Tuple6Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f)))))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple6Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f)))))) -> Type) (a6989586621679304455 :: a) Source # | |
data Tuple6Sym1 a6989586621679304455 a6989586621679304456 Source #
Instances
SingI d1 => SingI (Tuple6Sym1 d1 :: TyFun b (c ~> (d2 ~> (e ~> (f ~> (a, b, c, d2, e, f))))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances sing :: Sing (Tuple6Sym1 d1) Source # | |
SuppressUnusedWarnings (Tuple6Sym1 a6989586621679304455 :: TyFun b (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f))))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple6Sym1 a6989586621679304455 :: TyFun b (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f))))) -> Type) (a6989586621679304456 :: b) Source # | |
Defined in Data.Singletons.Prelude.Instances |
data Tuple6Sym2 a6989586621679304455 a6989586621679304456 a6989586621679304457 Source #
Instances
(SingI d1, SingI d2) => SingI (Tuple6Sym2 d1 d2 :: TyFun c (d3 ~> (e ~> (f ~> (a, b, c, d3, e, f)))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances sing :: Sing (Tuple6Sym2 d1 d2) Source # | |
SuppressUnusedWarnings (Tuple6Sym2 a6989586621679304455 a6989586621679304456 :: TyFun c (d ~> (e ~> (f ~> (a, b, c, d, e, f)))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple6Sym2 a6989586621679304455 a6989586621679304456 :: TyFun c (d ~> (e ~> (f ~> (a, b, c, d, e, f)))) -> Type) (a6989586621679304457 :: c) Source # | |
Defined in Data.Singletons.Prelude.Instances |
data Tuple6Sym3 a6989586621679304455 a6989586621679304456 a6989586621679304457 a6989586621679304458 Source #
Instances
(SingI d1, SingI d2, SingI d3) => SingI (Tuple6Sym3 d1 d2 d3 :: TyFun d4 (e ~> (f ~> (a, b, c, d4, e, f))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances sing :: Sing (Tuple6Sym3 d1 d2 d3) Source # | |
SuppressUnusedWarnings (Tuple6Sym3 a6989586621679304455 a6989586621679304456 a6989586621679304457 :: TyFun d (e ~> (f ~> (a, b, c, d, e, f))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple6Sym3 a6989586621679304455 a6989586621679304456 a6989586621679304457 :: TyFun d (e ~> (f ~> (a, b, c, d, e, f))) -> Type) (a6989586621679304458 :: d) Source # | |
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
(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 # | |
Defined in Data.Singletons.Prelude.Instances 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 # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple6Sym4 a6989586621679304455 a6989586621679304456 a6989586621679304457 a6989586621679304458 :: TyFun e (f ~> (a, b, c, d, e, f)) -> Type) (a6989586621679304459 :: e) Source # | |
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
(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 # | |
Defined in Data.Singletons.Prelude.Instances 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 # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple6Sym5 a6989586621679304455 a6989586621679304456 a6989586621679304457 a6989586621679304458 a6989586621679304459 :: TyFun f (a, b, c, d, e, f) -> Type) (a6989586621679304460 :: f) Source # | |
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
SingI (Tuple7Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances sing :: Sing Tuple7Sym0 Source # | |
SuppressUnusedWarnings (Tuple7Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple7Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))))) -> Type) (a6989586621679304558 :: a) Source # | |
data Tuple7Sym1 a6989586621679304558 a6989586621679304559 Source #
Instances
SingI d1 => SingI (Tuple7Sym1 d1 :: TyFun b (c ~> (d2 ~> (e ~> (f ~> (g ~> (a, b, c, d2, e, f, g)))))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances sing :: Sing (Tuple7Sym1 d1) Source # | |
SuppressUnusedWarnings (Tuple7Sym1 a6989586621679304558 :: TyFun b (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple7Sym1 a6989586621679304558 :: TyFun b (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))))) -> Type) (a6989586621679304559 :: b) Source # | |
Defined in Data.Singletons.Prelude.Instances |
data Tuple7Sym2 a6989586621679304558 a6989586621679304559 a6989586621679304560 Source #
Instances
(SingI d1, SingI d2) => SingI (Tuple7Sym2 d1 d2 :: TyFun c (d3 ~> (e ~> (f ~> (g ~> (a, b, c, d3, e, f, g))))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances 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 # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple7Sym2 a6989586621679304558 a6989586621679304559 :: TyFun c (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))) -> Type) (a6989586621679304560 :: c) Source # | |
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
(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 # | |
Defined in Data.Singletons.Prelude.Instances 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 # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple7Sym3 a6989586621679304558 a6989586621679304559 a6989586621679304560 :: TyFun d (e ~> (f ~> (g ~> (a, b, c, d, e, f, g)))) -> Type) (a6989586621679304561 :: d) Source # | |
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
(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 # | |
Defined in Data.Singletons.Prelude.Instances 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 # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple7Sym4 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 :: TyFun e (f ~> (g ~> (a, b, c, d, e, f, g))) -> Type) (a6989586621679304562 :: e) Source # | |
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
(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 # | |
Defined in Data.Singletons.Prelude.Instances 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 # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple7Sym5 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 a6989586621679304562 :: TyFun f (g ~> (a, b, c, d, e, f, g)) -> Type) (a6989586621679304563 :: f) Source # | |
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
(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 # | |
Defined in Data.Singletons.Prelude.Instances 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 # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply (Tuple7Sym6 a6989586621679304558 a6989586621679304559 a6989586621679304560 a6989586621679304561 a6989586621679304562 a6989586621679304563 :: TyFun g (a, b, c, d, e, f, g) -> Type) (a6989586621679304564 :: g) Source # | |
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 CurrySym0 a6989586621679360434 Source #
Instances
SingI (CurrySym0 :: TyFun ((a, b) ~> c) (a ~> (b ~> c)) -> Type) Source # | |
SuppressUnusedWarnings (CurrySym0 :: TyFun ((a, b) ~> c) (a ~> (b ~> c)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Tuple suppressUnusedWarnings :: () Source # | |
type Apply (CurrySym0 :: TyFun ((a, b) ~> c) (a ~> (b ~> c)) -> Type) (a6989586621679360434 :: (a, b) ~> c) Source # | |
data CurrySym1 a6989586621679360434 a6989586621679360435 Source #
Instances
SingI d => SingI (CurrySym1 d :: TyFun a (b ~> c) -> Type) Source # | |
SuppressUnusedWarnings (CurrySym1 a6989586621679360434 :: TyFun a (b ~> c) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Tuple suppressUnusedWarnings :: () Source # | |
type Apply (CurrySym1 a6989586621679360434 :: TyFun a (b ~> c) -> Type) (a6989586621679360435 :: a) Source # | |
data CurrySym2 a6989586621679360434 a6989586621679360435 a6989586621679360436 Source #
Instances
(SingI d1, SingI d2) => SingI (CurrySym2 d1 d2 :: TyFun b c -> Type) Source # | |
SuppressUnusedWarnings (CurrySym2 a6989586621679360434 a6989586621679360435 :: TyFun b c -> Type) Source # | |
Defined in Data.Singletons.Prelude.Tuple suppressUnusedWarnings :: () Source # | |
type Apply (CurrySym2 a6989586621679360434 a6989586621679360435 :: TyFun b c -> Type) (a6989586621679360436 :: b) Source # | |
type CurrySym3 (a6989586621679360434 :: (~>) (a, b) c) (a6989586621679360435 :: a) (a6989586621679360436 :: b) = Curry a6989586621679360434 a6989586621679360435 a6989586621679360436 :: c Source #
data UncurrySym0 a6989586621679360426 Source #
Instances
SingI (UncurrySym0 :: TyFun (a ~> (b ~> c)) ((a, b) ~> c) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Tuple sing :: Sing UncurrySym0 Source # | |
SuppressUnusedWarnings (UncurrySym0 :: TyFun (a ~> (b ~> c)) ((a, b) ~> c) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Tuple suppressUnusedWarnings :: () Source # | |
type Apply (UncurrySym0 :: TyFun (a ~> (b ~> c)) ((a, b) ~> c) -> Type) (a6989586621679360426 :: a ~> (b ~> c)) Source # | |
Defined in Data.Singletons.Prelude.Tuple type Apply (UncurrySym0 :: TyFun (a ~> (b ~> c)) ((a, b) ~> c) -> Type) (a6989586621679360426 :: a ~> (b ~> c)) = UncurrySym1 a6989586621679360426 |
data UncurrySym1 a6989586621679360426 a6989586621679360427 Source #
Instances
SingI d => SingI (UncurrySym1 d :: TyFun (a, b) c -> Type) Source # | |
Defined in Data.Singletons.Prelude.Tuple sing :: Sing (UncurrySym1 d) Source # | |
SuppressUnusedWarnings (UncurrySym1 a6989586621679360426 :: TyFun (a, b) c -> Type) Source # | |
Defined in Data.Singletons.Prelude.Tuple suppressUnusedWarnings :: () Source # | |
type Apply (UncurrySym1 a6989586621679360426 :: TyFun (a, b) c -> Type) (a6989586621679360427 :: (a, b)) Source # | |
Defined in Data.Singletons.Prelude.Tuple type Apply (UncurrySym1 a6989586621679360426 :: TyFun (a, b) c -> Type) (a6989586621679360427 :: (a, b)) = UncurrySym2 a6989586621679360426 a6989586621679360427 |
type UncurrySym2 (a6989586621679360426 :: (~>) a ((~>) b c)) (a6989586621679360427 :: (a, b)) = Uncurry a6989586621679360426 a6989586621679360427 :: c Source #
data ErrorWithoutStackTraceSym0 a6989586621679472488 Source #
Instances
SingI (ErrorWithoutStackTraceSym0 :: TyFun Symbol a -> Type) Source # | |
Defined in Data.Singletons.TypeLits.Internal | |
SuppressUnusedWarnings (ErrorWithoutStackTraceSym0 :: TyFun k0 k -> Type) Source # | |
Defined in Data.Singletons.TypeLits.Internal suppressUnusedWarnings :: () Source # | |
type Apply (ErrorWithoutStackTraceSym0 :: TyFun k0 k2 -> Type) (a6989586621679472488 :: k0) Source # | |
Defined in Data.Singletons.TypeLits.Internal type Apply (ErrorWithoutStackTraceSym0 :: TyFun k0 k2 -> Type) (a6989586621679472488 :: k0) = ErrorWithoutStackTraceSym1 a6989586621679472488 :: k2 |
type ErrorWithoutStackTraceSym1 (a6989586621679472488 :: k0) = ErrorWithoutStackTrace a6989586621679472488 :: k Source #
type UndefinedSym0 = Undefined :: k Source #
data CompareSym0 a6989586621679383640 Source #
Instances
SOrd a => SingI (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Ord sing :: Sing CompareSym0 Source # | |
SuppressUnusedWarnings (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () Source # | |
type Apply (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) (a6989586621679383640 :: a) Source # | |
Defined in Data.Singletons.Prelude.Ord type Apply (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) (a6989586621679383640 :: a) = CompareSym1 a6989586621679383640 |
data CompareSym1 a6989586621679383640 a6989586621679383641 Source #
Instances
(SOrd a, SingI d) => SingI (CompareSym1 d :: TyFun a Ordering -> Type) Source # | |
Defined in Data.Singletons.Prelude.Ord sing :: Sing (CompareSym1 d) Source # | |
SuppressUnusedWarnings (CompareSym1 a6989586621679383640 :: TyFun a Ordering -> Type) Source # | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () Source # | |
type Apply (CompareSym1 a6989586621679383640 :: TyFun a Ordering -> Type) (a6989586621679383641 :: a) Source # | |
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 (<@#@$) a6989586621679383645 infix 4 Source #
Instances
SOrd a => SingI ((<@#@$) :: TyFun a (a ~> Bool) -> Type) Source # | |
SuppressUnusedWarnings ((<@#@$) :: TyFun a (a ~> Bool) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () Source # | |
type Apply ((<@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679383645 :: a) Source # | |
data a6989586621679383645 <@#@$$ a6989586621679383646 infix 4 Source #
Instances
(SOrd a, SingI d) => SingI ((<@#@$$) d :: TyFun a Bool -> Type) Source # | |
SuppressUnusedWarnings ((<@#@$$) a6989586621679383645 :: TyFun a Bool -> Type) Source # | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () Source # | |
type Apply ((<@#@$$) a6989586621679383645 :: TyFun a Bool -> Type) (a6989586621679383646 :: a) Source # | |
type (<@#@$$$) (a6989586621679383645 :: a) (a6989586621679383646 :: a) = (<) a6989586621679383645 a6989586621679383646 :: Bool infix 4 Source #
data (<=@#@$) a6989586621679383650 infix 4 Source #
Instances
SOrd a => SingI ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) Source # | |
SuppressUnusedWarnings ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () Source # | |
type Apply ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679383650 :: a) Source # | |
data a6989586621679383650 <=@#@$$ a6989586621679383651 infix 4 Source #
Instances
(SOrd a, SingI d) => SingI ((<=@#@$$) d :: TyFun a Bool -> Type) Source # | |
SuppressUnusedWarnings ((<=@#@$$) a6989586621679383650 :: TyFun a Bool -> Type) Source # | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () Source # | |
type Apply ((<=@#@$$) a6989586621679383650 :: TyFun a Bool -> Type) (a6989586621679383651 :: a) Source # | |
type (<=@#@$$$) (a6989586621679383650 :: a) (a6989586621679383651 :: a) = (<=) a6989586621679383650 a6989586621679383651 :: Bool infix 4 Source #
data (>@#@$) a6989586621679383655 infix 4 Source #
Instances
SOrd a => SingI ((>@#@$) :: TyFun a (a ~> Bool) -> Type) Source # | |
SuppressUnusedWarnings ((>@#@$) :: TyFun a (a ~> Bool) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () Source # | |
type Apply ((>@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679383655 :: a) Source # | |
data a6989586621679383655 >@#@$$ a6989586621679383656 infix 4 Source #
Instances
(SOrd a, SingI d) => SingI ((>@#@$$) d :: TyFun a Bool -> Type) Source # | |
SuppressUnusedWarnings ((>@#@$$) a6989586621679383655 :: TyFun a Bool -> Type) Source # | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () Source # | |
type Apply ((>@#@$$) a6989586621679383655 :: TyFun a Bool -> Type) (a6989586621679383656 :: a) Source # | |
type (>@#@$$$) (a6989586621679383655 :: a) (a6989586621679383656 :: a) = (>) a6989586621679383655 a6989586621679383656 :: Bool infix 4 Source #
data (>=@#@$) a6989586621679383660 infix 4 Source #
Instances
SOrd a => SingI ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) Source # | |
SuppressUnusedWarnings ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () Source # | |
type Apply ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679383660 :: a) Source # | |
data a6989586621679383660 >=@#@$$ a6989586621679383661 infix 4 Source #
Instances
(SOrd a, SingI d) => SingI ((>=@#@$$) d :: TyFun a Bool -> Type) Source # | |
SuppressUnusedWarnings ((>=@#@$$) a6989586621679383660 :: TyFun a Bool -> Type) Source # | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () Source # | |
type Apply ((>=@#@$$) a6989586621679383660 :: TyFun a Bool -> Type) (a6989586621679383661 :: a) Source # | |
type (>=@#@$$$) (a6989586621679383660 :: a) (a6989586621679383661 :: a) = (>=) a6989586621679383660 a6989586621679383661 :: Bool infix 4 Source #
data MaxSym0 a6989586621679383665 Source #
Instances
data MaxSym1 a6989586621679383665 a6989586621679383666 Source #
Instances
(SOrd a, SingI d) => SingI (MaxSym1 d :: TyFun a a -> Type) Source # | |
SuppressUnusedWarnings (MaxSym1 a6989586621679383665 :: TyFun a a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () Source # | |
type Apply (MaxSym1 a6989586621679383665 :: TyFun a a -> Type) (a6989586621679383666 :: a) Source # | |
type MaxSym2 (a6989586621679383665 :: a) (a6989586621679383666 :: a) = Max a6989586621679383665 a6989586621679383666 :: a Source #
data MinSym0 a6989586621679383670 Source #
Instances
data MinSym1 a6989586621679383670 a6989586621679383671 Source #
Instances
(SOrd a, SingI d) => SingI (MinSym1 d :: TyFun a a -> Type) Source # | |
SuppressUnusedWarnings (MinSym1 a6989586621679383670 :: TyFun a a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () Source # | |
type Apply (MinSym1 a6989586621679383670 :: TyFun a a -> Type) (a6989586621679383671 :: a) Source # | |
type MinSym2 (a6989586621679383670 :: a) (a6989586621679383671 :: a) = Min a6989586621679383670 a6989586621679383671 :: a Source #
data (^@#@$) a6989586621679472866 infixr 8 Source #
Instances
SingI (^@#@$) Source # | |
SuppressUnusedWarnings (^@#@$) Source # | |
Defined in Data.Singletons.TypeLits.Internal suppressUnusedWarnings :: () Source # | |
type Apply (^@#@$) (a6989586621679472866 :: Nat) Source # | |
Defined in Data.Singletons.TypeLits.Internal |
data a6989586621679472866 ^@#@$$ a6989586621679472867 infixr 8 Source #
Instances
SingI x => SingI ((^@#@$$) x :: TyFun Nat Nat -> Type) Source # | |
SuppressUnusedWarnings ((^@#@$$) a6989586621679472866 :: TyFun Nat Nat -> Type) Source # | |
Defined in Data.Singletons.TypeLits.Internal suppressUnusedWarnings :: () Source # | |
type Apply ((^@#@$$) a6989586621679472866 :: TyFun Nat Nat -> Type) (a6989586621679472867 :: Nat) Source # | |
type (^@#@$$$) (a6989586621679472866 :: Nat) (a6989586621679472867 :: Nat) = (^) a6989586621679472866 a6989586621679472867 :: Nat infixr 8 Source #
data ShowsPrecSym0 a6989586621680279568 Source #
Instances
SShow a => SingI (ShowsPrecSym0 :: TyFun Nat (a ~> (Symbol ~> Symbol)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Show sing :: Sing ShowsPrecSym0 Source # | |
SuppressUnusedWarnings (ShowsPrecSym0 :: TyFun Nat (a ~> (Symbol ~> Symbol)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () Source # | |
type Apply (ShowsPrecSym0 :: TyFun Nat (a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680279568 :: Nat) Source # | |
data ShowsPrecSym1 a6989586621680279568 a6989586621680279569 Source #
Instances
(SShow a, SingI d) => SingI (ShowsPrecSym1 d :: TyFun a (Symbol ~> Symbol) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Show sing :: Sing (ShowsPrecSym1 d) Source # | |
SuppressUnusedWarnings (ShowsPrecSym1 a6989586621680279568 :: TyFun a (Symbol ~> Symbol) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () Source # | |
type Apply (ShowsPrecSym1 a6989586621680279568 :: TyFun a (Symbol ~> Symbol) -> Type) (a6989586621680279569 :: a) Source # | |
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
(SShow a, SingI d1, SingI d2) => SingI (ShowsPrecSym2 d1 d2 :: TyFun Symbol Symbol -> Type) Source # | |
Defined in Data.Singletons.Prelude.Show sing :: Sing (ShowsPrecSym2 d1 d2) Source # | |
SuppressUnusedWarnings (ShowsPrecSym2 a6989586621680279568 a6989586621680279569 :: TyFun Symbol Symbol -> Type) Source # | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () Source # | |
type Apply (ShowsPrecSym2 a6989586621680279568 a6989586621680279569 :: TyFun Symbol Symbol -> Type) (a6989586621680279570 :: Symbol) Source # | |
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 Show_Sym0 a6989586621680279573 Source #
Instances
data ShowListSym0 a6989586621680279577 Source #
Instances
SShow a => SingI (ShowListSym0 :: TyFun [a] (Symbol ~> Symbol) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Show sing :: Sing ShowListSym0 Source # | |
SuppressUnusedWarnings (ShowListSym0 :: TyFun [a] (Symbol ~> Symbol) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () Source # | |
type Apply (ShowListSym0 :: TyFun [a] (Symbol ~> Symbol) -> Type) (a6989586621680279577 :: [a]) Source # | |
Defined in Data.Singletons.Prelude.Show type Apply (ShowListSym0 :: TyFun [a] (Symbol ~> Symbol) -> Type) (a6989586621680279577 :: [a]) = ShowListSym1 a6989586621680279577 |
data ShowListSym1 a6989586621680279577 a6989586621680279578 Source #
Instances
(SShow a, SingI d) => SingI (ShowListSym1 d :: TyFun Symbol Symbol -> Type) Source # | |
Defined in Data.Singletons.Prelude.Show sing :: Sing (ShowListSym1 d) Source # | |
SuppressUnusedWarnings (ShowListSym1 a6989586621680279577 :: TyFun Symbol Symbol -> Type) Source # | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () Source # | |
type Apply (ShowListSym1 a6989586621680279577 :: TyFun Symbol Symbol -> Type) (a6989586621680279578 :: Symbol) Source # | |
Defined in Data.Singletons.Prelude.Show type Apply (ShowListSym1 a6989586621680279577 :: TyFun Symbol Symbol -> Type) (a6989586621680279578 :: Symbol) = ShowListSym2 a6989586621680279577 a6989586621680279578 |
type ShowListSym2 (a6989586621680279577 :: [a]) (a6989586621680279578 :: Symbol) = ShowList a6989586621680279577 a6989586621680279578 :: Symbol Source #
data ShowsSym0 a6989586621680279560 Source #
Instances
SShow a => SingI (ShowsSym0 :: TyFun a (Symbol ~> Symbol) -> Type) Source # | |
SuppressUnusedWarnings (ShowsSym0 :: TyFun a (Symbol ~> Symbol) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () Source # | |
type Apply (ShowsSym0 :: TyFun a (Symbol ~> Symbol) -> Type) (a6989586621680279560 :: a) Source # | |
data ShowsSym1 a6989586621680279560 a6989586621680279561 Source #
Instances
(SShow a, SingI d) => SingI (ShowsSym1 d :: TyFun Symbol Symbol -> Type) Source # | |
SuppressUnusedWarnings (ShowsSym1 a6989586621680279560 :: TyFun Symbol Symbol -> Type) Source # | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () Source # | |
type Apply (ShowsSym1 a6989586621680279560 :: TyFun Symbol Symbol -> Type) (a6989586621680279561 :: Symbol) Source # | |
type ShowsSym2 (a6989586621680279560 :: a) (a6989586621680279561 :: Symbol) = Shows a6989586621680279560 a6989586621680279561 :: Symbol Source #
data ShowCharSym0 a6989586621680279534 Source #
Instances
SingI ShowCharSym0 Source # | |
Defined in Data.Singletons.Prelude.Show sing :: Sing ShowCharSym0 Source # | |
SuppressUnusedWarnings ShowCharSym0 Source # | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () Source # | |
type Apply ShowCharSym0 (a6989586621680279534 :: Symbol) Source # | |
Defined in Data.Singletons.Prelude.Show |
data ShowCharSym1 a6989586621680279534 a6989586621680279535 Source #
Instances
SingI d => SingI (ShowCharSym1 d :: TyFun Symbol Symbol -> Type) Source # | |
Defined in Data.Singletons.Prelude.Show sing :: Sing (ShowCharSym1 d) Source # | |
SuppressUnusedWarnings (ShowCharSym1 a6989586621680279534 :: TyFun Symbol Symbol -> Type) Source # | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () Source # | |
type Apply (ShowCharSym1 a6989586621680279534 :: TyFun Symbol Symbol -> Type) (a6989586621680279535 :: Symbol) Source # | |
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 ShowStringSym0 a6989586621680279523 Source #
Instances
SingI ShowStringSym0 Source # | |
Defined in Data.Singletons.Prelude.Show | |
SuppressUnusedWarnings ShowStringSym0 Source # | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () Source # | |
type Apply ShowStringSym0 (a6989586621680279523 :: Symbol) Source # | |
Defined in Data.Singletons.Prelude.Show |
data ShowStringSym1 a6989586621680279523 a6989586621680279524 Source #
Instances
SingI d => SingI (ShowStringSym1 d :: TyFun Symbol Symbol -> Type) Source # | |
Defined in Data.Singletons.Prelude.Show sing :: Sing (ShowStringSym1 d) Source # | |
SuppressUnusedWarnings (ShowStringSym1 a6989586621680279523 :: TyFun Symbol Symbol -> Type) Source # | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () Source # | |
type Apply (ShowStringSym1 a6989586621680279523 :: TyFun Symbol Symbol -> Type) (a6989586621680279524 :: Symbol) Source # | |
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
SingI ShowParenSym0 Source # | |
Defined in Data.Singletons.Prelude.Show sing :: Sing ShowParenSym0 Source # | |
SuppressUnusedWarnings ShowParenSym0 Source # | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () Source # | |
type Apply ShowParenSym0 (a6989586621680279507 :: Bool) Source # | |
Defined in Data.Singletons.Prelude.Show |
data ShowParenSym1 a6989586621680279507 a6989586621680279508 Source #
Instances
SingI d => SingI (ShowParenSym1 d :: TyFun (Symbol ~> Symbol) (Symbol ~> Symbol) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Show sing :: Sing (ShowParenSym1 d) Source # | |
SuppressUnusedWarnings (ShowParenSym1 a6989586621680279507 :: TyFun (Symbol ~> Symbol) (Symbol ~> Symbol) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () Source # | |
type Apply (ShowParenSym1 a6989586621680279507 :: TyFun (Symbol ~> Symbol) (Symbol ~> Symbol) -> Type) (a6989586621680279508 :: Symbol ~> Symbol) Source # | |
Defined in Data.Singletons.Prelude.Show |
data ShowParenSym2 a6989586621680279507 a6989586621680279508 a6989586621680279509 Source #
Instances
(SingI d1, SingI d2) => SingI (ShowParenSym2 d1 d2 :: TyFun Symbol Symbol -> Type) Source # | |
Defined in Data.Singletons.Prelude.Show sing :: Sing (ShowParenSym2 d1 d2) Source # | |
SuppressUnusedWarnings (ShowParenSym2 a6989586621680279507 a6989586621680279508 :: TyFun Symbol Symbol -> Type) Source # | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () Source # | |
type Apply (ShowParenSym2 a6989586621680279507 a6989586621680279508 :: TyFun Symbol Symbol -> Type) (a6989586621680279509 :: Symbol) Source # | |
Defined in Data.Singletons.Prelude.Show |
data (<>@#@$) a6989586621679830624 infixr 6 Source #
Instances
SSemigroup a => SingI ((<>@#@$) :: TyFun a (a ~> a) -> Type) Source # | |
SuppressUnusedWarnings ((<>@#@$) :: TyFun a (a ~> a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal suppressUnusedWarnings :: () Source # | |
type Apply ((<>@#@$) :: TyFun a (a ~> a) -> Type) (a6989586621679830624 :: a) Source # | |
data a6989586621679830624 <>@#@$$ a6989586621679830625 infixr 6 Source #
Instances
(SSemigroup a, SingI d) => SingI ((<>@#@$$) d :: TyFun a a -> Type) Source # | |
SuppressUnusedWarnings ((<>@#@$$) a6989586621679830624 :: TyFun a a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Semigroup.Internal suppressUnusedWarnings :: () Source # | |
type Apply ((<>@#@$$) a6989586621679830624 :: TyFun a a -> Type) (a6989586621679830625 :: a) Source # | |
type (<>@#@$$$) (a6989586621679830624 :: a) (a6989586621679830625 :: a) = (<>) a6989586621679830624 a6989586621679830625 :: a infixr 6 Source #
type MemptySym0 = Mempty :: a Source #
data MappendSym0 a6989586621680347244 Source #
Instances
SMonoid a => SingI (MappendSym0 :: TyFun a (a ~> a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monoid sing :: Sing MappendSym0 Source # | |
SuppressUnusedWarnings (MappendSym0 :: TyFun a (a ~> a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () Source # | |
type Apply (MappendSym0 :: TyFun a (a ~> a) -> Type) (a6989586621680347244 :: a) Source # | |
Defined in Data.Singletons.Prelude.Monoid type Apply (MappendSym0 :: TyFun a (a ~> a) -> Type) (a6989586621680347244 :: a) = MappendSym1 a6989586621680347244 |
data MappendSym1 a6989586621680347244 a6989586621680347245 Source #
Instances
(SMonoid a, SingI d) => SingI (MappendSym1 d :: TyFun a a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monoid sing :: Sing (MappendSym1 d) Source # | |
SuppressUnusedWarnings (MappendSym1 a6989586621680347244 :: TyFun a a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () Source # | |
type Apply (MappendSym1 a6989586621680347244 :: TyFun a a -> Type) (a6989586621680347245 :: a) Source # | |
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 MconcatSym0 a6989586621680347248 Source #
Instances
SMonoid a => SingI (MconcatSym0 :: TyFun [a] a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monoid sing :: Sing MconcatSym0 Source # | |
SuppressUnusedWarnings (MconcatSym0 :: TyFun [a] a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () Source # | |
type Apply (MconcatSym0 :: TyFun [a] a -> Type) (a6989586621680347248 :: [a]) Source # | |
Defined in Data.Singletons.Prelude.Monoid type Apply (MconcatSym0 :: TyFun [a] a -> Type) (a6989586621680347248 :: [a]) = MconcatSym1 a6989586621680347248 |
type MconcatSym1 (a6989586621680347248 :: [a]) = Mconcat a6989586621680347248 :: a Source #
data FmapSym0 a6989586621679559667 Source #
Instances
SFunctor f => SingI (FmapSym0 :: TyFun (a ~> b) (f a ~> f b) -> Type) Source # | |
SuppressUnusedWarnings (FmapSym0 :: TyFun (a ~> b) (f a ~> f b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () Source # | |
type Apply (FmapSym0 :: TyFun (a ~> b) (f a ~> f b) -> Type) (a6989586621679559667 :: a ~> b) Source # | |
data FmapSym1 a6989586621679559667 a6989586621679559668 Source #
Instances
(SFunctor f, SingI d) => SingI (FmapSym1 d :: TyFun (f a) (f b) -> Type) Source # | |
SuppressUnusedWarnings (FmapSym1 a6989586621679559667 :: TyFun (f a) (f b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () Source # | |
type Apply (FmapSym1 a6989586621679559667 :: TyFun (f a) (f b) -> Type) (a6989586621679559668 :: f a) Source # | |
type FmapSym2 (a6989586621679559667 :: (~>) a b) (a6989586621679559668 :: f a) = Fmap a6989586621679559667 a6989586621679559668 :: f b Source #
data (<$@#@$) a6989586621679559672 infixl 4 Source #
Instances
SFunctor f => SingI ((<$@#@$) :: TyFun a (f b ~> f a) -> Type) Source # | |
SuppressUnusedWarnings ((<$@#@$) :: TyFun a (f b ~> f a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () Source # | |
type Apply ((<$@#@$) :: TyFun a (f b ~> f a) -> Type) (a6989586621679559672 :: a) Source # | |
data a6989586621679559672 <$@#@$$ a6989586621679559673 infixl 4 Source #
Instances
(SFunctor f, SingI d) => SingI ((<$@#@$$) d :: TyFun (f b) (f a) -> Type) Source # | |
SuppressUnusedWarnings ((<$@#@$$) a6989586621679559672 :: TyFun (f b) (f a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () Source # | |
type Apply ((<$@#@$$) a6989586621679559672 :: TyFun (f b) (f a) -> Type) (a6989586621679559673 :: f b) Source # | |
type (<$@#@$$$) (a6989586621679559672 :: a) (a6989586621679559673 :: f b) = (<$) a6989586621679559672 a6989586621679559673 :: f a infixl 4 Source #
data (<$>@#@$) a6989586621679731630 infixl 4 Source #
Instances
SFunctor f => SingI ((<$>@#@$) :: TyFun (a ~> b) (f a ~> f b) -> Type) Source # | |
SuppressUnusedWarnings ((<$>@#@$) :: TyFun (a ~> b) (f a ~> f b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Functor suppressUnusedWarnings :: () Source # | |
type Apply ((<$>@#@$) :: TyFun (a ~> b) (f a ~> f b) -> Type) (a6989586621679731630 :: a ~> b) Source # | |
data a6989586621679731630 <$>@#@$$ a6989586621679731631 infixl 4 Source #
Instances
(SFunctor f, SingI d) => SingI ((<$>@#@$$) d :: TyFun (f a) (f b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Functor sing :: Sing ((<$>@#@$$) d) Source # | |
SuppressUnusedWarnings ((<$>@#@$$) a6989586621679731630 :: TyFun (f a) (f b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Functor suppressUnusedWarnings :: () Source # | |
type Apply ((<$>@#@$$) a6989586621679731630 :: TyFun (f a) (f b) -> Type) (a6989586621679731631 :: f a) Source # | |
Defined in Data.Singletons.Prelude.Functor type Apply ((<$>@#@$$) a6989586621679731630 :: TyFun (f a) (f b) -> Type) (a6989586621679731631 :: f a) = a6989586621679731630 <$>@#@$$$ a6989586621679731631 |
type (<$>@#@$$$) (a6989586621679731630 :: (~>) a b) (a6989586621679731631 :: f a) = (<$>) a6989586621679731630 a6989586621679731631 :: f b infixl 4 Source #
data PureSym0 a6989586621679559691 Source #
Instances
SApplicative f => SingI (PureSym0 :: TyFun a (f a) -> Type) Source # | |
SuppressUnusedWarnings (PureSym0 :: TyFun a (f a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () Source # | |
type Apply (PureSym0 :: TyFun a (f a) -> Type) (a6989586621679559691 :: a) Source # | |
data (<*>@#@$) a6989586621679559695 infixl 4 Source #
Instances
SApplicative f => SingI ((<*>@#@$) :: TyFun (f (a ~> b)) (f a ~> f b) -> Type) Source # | |
SuppressUnusedWarnings ((<*>@#@$) :: TyFun (f (a ~> b)) (f a ~> f b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () Source # | |
type Apply ((<*>@#@$) :: TyFun (f (a ~> b)) (f a ~> f b) -> Type) (a6989586621679559695 :: f (a ~> b)) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal |
data a6989586621679559695 <*>@#@$$ a6989586621679559696 infixl 4 Source #
Instances
(SApplicative f, SingI d) => SingI ((<*>@#@$$) d :: TyFun (f a) (f b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal sing :: Sing ((<*>@#@$$) d) Source # | |
SuppressUnusedWarnings ((<*>@#@$$) a6989586621679559695 :: TyFun (f a) (f b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () Source # | |
type Apply ((<*>@#@$$) a6989586621679559695 :: TyFun (f a) (f b) -> Type) (a6989586621679559696 :: f a) Source # | |
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 (*>@#@$) a6989586621679559707 infixl 4 Source #
Instances
SApplicative f => SingI ((*>@#@$) :: TyFun (f a) (f b ~> f b) -> Type) Source # | |
SuppressUnusedWarnings ((*>@#@$) :: TyFun (f a) (f b ~> f b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () Source # | |
type Apply ((*>@#@$) :: TyFun (f a) (f b ~> f b) -> Type) (a6989586621679559707 :: f a) Source # | |
data a6989586621679559707 *>@#@$$ a6989586621679559708 infixl 4 Source #
Instances
(SApplicative f, SingI d) => SingI ((*>@#@$$) d :: TyFun (f b) (f b) -> Type) Source # | |
SuppressUnusedWarnings ((*>@#@$$) a6989586621679559707 :: TyFun (f b) (f b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () Source # | |
type Apply ((*>@#@$$) a6989586621679559707 :: TyFun (f b) (f b) -> Type) (a6989586621679559708 :: f b) Source # | |
type (*>@#@$$$) (a6989586621679559707 :: f a) (a6989586621679559708 :: f b) = (*>) a6989586621679559707 a6989586621679559708 :: f b infixl 4 Source #
data (<*@#@$) a6989586621679559712 infixl 4 Source #
Instances
SApplicative f => SingI ((<*@#@$) :: TyFun (f a) (f b ~> f a) -> Type) Source # | |
SuppressUnusedWarnings ((<*@#@$) :: TyFun (f a) (f b ~> f a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () Source # | |
type Apply ((<*@#@$) :: TyFun (f a) (f b ~> f a) -> Type) (a6989586621679559712 :: f a) Source # | |
data a6989586621679559712 <*@#@$$ a6989586621679559713 infixl 4 Source #
Instances
(SApplicative f, SingI d) => SingI ((<*@#@$$) d :: TyFun (f b) (f a) -> Type) Source # | |
SuppressUnusedWarnings ((<*@#@$$) a6989586621679559712 :: TyFun (f b) (f a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () Source # | |
type Apply ((<*@#@$$) a6989586621679559712 :: TyFun (f b) (f a) -> Type) (a6989586621679559713 :: f b) Source # | |
type (<*@#@$$$) (a6989586621679559712 :: f a) (a6989586621679559713 :: f b) = (<*) a6989586621679559712 a6989586621679559713 :: f a infixl 4 Source #
data (>>=@#@$) a6989586621679559775 infixl 1 Source #
Instances
SMonad m => SingI ((>>=@#@$) :: TyFun (m a) ((a ~> m b) ~> m b) -> Type) Source # | |
SuppressUnusedWarnings ((>>=@#@$) :: TyFun (m a) ((a ~> m b) ~> m b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () Source # | |
type Apply ((>>=@#@$) :: TyFun (m a) ((a ~> m b) ~> m b) -> Type) (a6989586621679559775 :: m a) Source # | |
data a6989586621679559775 >>=@#@$$ a6989586621679559776 infixl 1 Source #
Instances
(SMonad m, SingI d) => SingI ((>>=@#@$$) d :: TyFun (a ~> m b) (m b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal sing :: Sing ((>>=@#@$$) d) Source # | |
SuppressUnusedWarnings ((>>=@#@$$) a6989586621679559775 :: TyFun (a ~> m b) (m b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () Source # | |
type Apply ((>>=@#@$$) a6989586621679559775 :: TyFun (a ~> m b) (m b) -> Type) (a6989586621679559776 :: a ~> m b) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal |
type (>>=@#@$$$) (a6989586621679559775 :: m a) (a6989586621679559776 :: (~>) a (m b)) = (>>=) a6989586621679559775 a6989586621679559776 :: m b infixl 1 Source #
data (>>@#@$) a6989586621679559780 infixl 1 Source #
Instances
SMonad m => SingI ((>>@#@$) :: TyFun (m a) (m b ~> m b) -> Type) Source # | |
SuppressUnusedWarnings ((>>@#@$) :: TyFun (m a) (m b ~> m b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () Source # | |
type Apply ((>>@#@$) :: TyFun (m a) (m b ~> m b) -> Type) (a6989586621679559780 :: m a) Source # | |
data a6989586621679559780 >>@#@$$ a6989586621679559781 infixl 1 Source #
Instances
(SMonad m, SingI d) => SingI ((>>@#@$$) d :: TyFun (m b) (m b) -> Type) Source # | |
SuppressUnusedWarnings ((>>@#@$$) a6989586621679559780 :: TyFun (m b) (m b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () Source # | |
type Apply ((>>@#@$$) a6989586621679559780 :: TyFun (m b) (m b) -> Type) (a6989586621679559781 :: m b) Source # | |
type (>>@#@$$$) (a6989586621679559780 :: m a) (a6989586621679559781 :: m b) = (>>) a6989586621679559780 a6989586621679559781 :: m b infixl 1 Source #
data ReturnSym0 a6989586621679559784 Source #
Instances
SMonad m => SingI (ReturnSym0 :: TyFun a (m a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal sing :: Sing ReturnSym0 Source # | |
SuppressUnusedWarnings (ReturnSym0 :: TyFun a (m a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () Source # | |
type Apply (ReturnSym0 :: TyFun a (m a) -> Type) (a6989586621679559784 :: a) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (ReturnSym0 :: TyFun a (m a) -> Type) (a6989586621679559784 :: a) = ReturnSym1 a6989586621679559784 :: m a |
type ReturnSym1 (a6989586621679559784 :: a) = Return a6989586621679559784 :: m a Source #
data FailSym0 a6989586621679729522 Source #
Instances
SMonadFail m => SingI (FailSym0 :: TyFun [Char] (m a) -> Type) Source # | |
SuppressUnusedWarnings (FailSym0 :: TyFun [Char] (m a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Fail suppressUnusedWarnings :: () Source # | |
type Apply (FailSym0 :: TyFun [Char] (m a) -> Type) (a6989586621679729522 :: [Char]) Source # | |
data MapM_Sym0 a6989586621680492379 Source #
Instances
(SFoldable t, SMonad m) => SingI (MapM_Sym0 :: TyFun (a ~> m b) (t a ~> m ()) -> Type) Source # | |
SuppressUnusedWarnings (MapM_Sym0 :: TyFun (a ~> m b) (t a ~> m ()) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (MapM_Sym0 :: TyFun (a ~> m b) (t a ~> m ()) -> Type) (a6989586621680492379 :: a ~> m b) Source # | |
data MapM_Sym1 a6989586621680492379 a6989586621680492380 Source #
Instances
(SFoldable t, SMonad m, SingI d) => SingI (MapM_Sym1 d :: TyFun (t a) (m ()) -> Type) Source # | |
SuppressUnusedWarnings (MapM_Sym1 a6989586621680492379 :: TyFun (t a) (m ()) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (MapM_Sym1 a6989586621680492379 :: TyFun (t a) (m ()) -> Type) (a6989586621680492380 :: t a) Source # | |
type MapM_Sym2 (a6989586621680492379 :: (~>) a (m b)) (a6989586621680492380 :: t a) = MapM_ a6989586621680492379 a6989586621680492380 :: m () Source #
data Sequence_Sym0 a6989586621680492355 Source #
Instances
(SFoldable t, SMonad m) => SingI (Sequence_Sym0 :: TyFun (t (m a)) (m ()) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable sing :: Sing Sequence_Sym0 Source # | |
SuppressUnusedWarnings (Sequence_Sym0 :: TyFun (t (m a)) (m ()) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (Sequence_Sym0 :: TyFun (t (m a)) (m ()) -> Type) (a6989586621680492355 :: t (m a)) Source # | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Sequence_Sym0 :: TyFun (t (m a)) (m ()) -> Type) (a6989586621680492355 :: t (m a)) = Sequence_Sym1 a6989586621680492355 |
type Sequence_Sym1 (a6989586621680492355 :: t (m a)) = Sequence_ a6989586621680492355 :: m () Source #
data (=<<@#@$) a6989586621679559620 infixr 1 Source #
Instances
SMonad m => SingI ((=<<@#@$) :: TyFun (a ~> m b) (m a ~> m b) -> Type) Source # | |
SuppressUnusedWarnings ((=<<@#@$) :: TyFun (a ~> m b) (m a ~> m b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () Source # | |
type Apply ((=<<@#@$) :: TyFun (a ~> m b) (m a ~> m b) -> Type) (a6989586621679559620 :: a ~> m b) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal |
data a6989586621679559620 =<<@#@$$ a6989586621679559621 infixr 1 Source #
Instances
(SMonad m, SingI d) => SingI ((=<<@#@$$) d :: TyFun (m a) (m b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal sing :: Sing ((=<<@#@$$) d) Source # | |
SuppressUnusedWarnings ((=<<@#@$$) a6989586621679559620 :: TyFun (m a) (m b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () Source # | |
type Apply ((=<<@#@$$) a6989586621679559620 :: TyFun (m a) (m b) -> Type) (a6989586621679559621 :: m a) Source # | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply ((=<<@#@$$) a6989586621679559620 :: TyFun (m a) (m b) -> Type) (a6989586621679559621 :: m a) = a6989586621679559620 =<<@#@$$$ a6989586621679559621 |
type (=<<@#@$$$) (a6989586621679559620 :: (~>) a (m b)) (a6989586621679559621 :: m a) = (=<<) a6989586621679559620 a6989586621679559621 :: m b infixr 1 Source #
data ElemSym0 a6989586621680492497 Source #
Instances
(SFoldable t, SEq a) => SingI (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source # | |
SuppressUnusedWarnings (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680492497 :: a) Source # | |
data ElemSym1 a6989586621680492497 a6989586621680492498 Source #
Instances
(SFoldable t, SEq a, SingI d) => SingI (ElemSym1 d :: TyFun (t a) Bool -> Type) Source # | |
SuppressUnusedWarnings (ElemSym1 a6989586621680492497 :: TyFun (t a) Bool -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (ElemSym1 a6989586621680492497 :: TyFun (t a) Bool -> Type) (a6989586621680492498 :: t a) Source # | |
type ElemSym2 (a6989586621680492497 :: a) (a6989586621680492498 :: t a) = Elem a6989586621680492497 a6989586621680492498 :: Bool Source #
data FoldMapSym0 a6989586621680492445 Source #
Instances
(SFoldable t, SMonoid m) => SingI (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable sing :: Sing FoldMapSym0 Source # | |
SuppressUnusedWarnings (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) (a6989586621680492445 :: a ~> m) Source # | |
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
(SFoldable t, SMonoid m, SingI d) => SingI (FoldMapSym1 d :: TyFun (t a) m -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable sing :: Sing (FoldMapSym1 d) Source # | |
SuppressUnusedWarnings (FoldMapSym1 a6989586621680492445 :: TyFun (t a) m -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (FoldMapSym1 a6989586621680492445 :: TyFun (t a) m -> Type) (a6989586621680492446 :: t a) Source # | |
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 #
data FoldrSym0 a6989586621680492451 Source #
Instances
SFoldable t => SingI (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) Source # | |
SuppressUnusedWarnings (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680492451 :: a ~> (b ~> b)) Source # | |
data FoldrSym1 a6989586621680492451 a6989586621680492452 Source #
Instances
(SFoldable t, SingI d) => SingI (FoldrSym1 d :: TyFun b (t a ~> b) -> Type) Source # | |
SuppressUnusedWarnings (FoldrSym1 a6989586621680492451 :: TyFun b (t a ~> b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (FoldrSym1 a6989586621680492451 :: TyFun b (t a ~> b) -> Type) (a6989586621680492452 :: b) Source # | |
data FoldrSym2 a6989586621680492451 a6989586621680492452 a6989586621680492453 Source #
Instances
(SFoldable t, SingI d1, SingI d2) => SingI (FoldrSym2 d1 d2 :: TyFun (t a) b -> Type) Source # | |
SuppressUnusedWarnings (FoldrSym2 a6989586621680492451 a6989586621680492452 :: TyFun (t a) b -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (FoldrSym2 a6989586621680492451 a6989586621680492452 :: TyFun (t a) b -> Type) (a6989586621680492453 :: t a) Source # | |
type FoldrSym3 (a6989586621680492451 :: (~>) a ((~>) b b)) (a6989586621680492452 :: b) (a6989586621680492453 :: t a) = Foldr a6989586621680492451 a6989586621680492452 a6989586621680492453 :: b Source #
data FoldlSym0 a6989586621680492465 Source #
Instances
SFoldable t => SingI (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) Source # | |
SuppressUnusedWarnings (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680492465 :: b ~> (a ~> b)) Source # | |
data FoldlSym1 a6989586621680492465 a6989586621680492466 Source #
Instances
(SFoldable t, SingI d) => SingI (FoldlSym1 d :: TyFun b (t a ~> b) -> Type) Source # | |
SuppressUnusedWarnings (FoldlSym1 a6989586621680492465 :: TyFun b (t a ~> b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (FoldlSym1 a6989586621680492465 :: TyFun b (t a ~> b) -> Type) (a6989586621680492466 :: b) Source # | |
data FoldlSym2 a6989586621680492465 a6989586621680492466 a6989586621680492467 Source #
Instances
(SFoldable t, SingI d1, SingI d2) => SingI (FoldlSym2 d1 d2 :: TyFun (t a) b -> Type) Source # | |
SuppressUnusedWarnings (FoldlSym2 a6989586621680492465 a6989586621680492466 :: TyFun (t a) b -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (FoldlSym2 a6989586621680492465 a6989586621680492466 :: TyFun (t a) b -> Type) (a6989586621680492467 :: t a) Source # | |
type FoldlSym3 (a6989586621680492465 :: (~>) b ((~>) a b)) (a6989586621680492466 :: b) (a6989586621680492467 :: t a) = Foldl a6989586621680492465 a6989586621680492466 a6989586621680492467 :: b Source #
data Foldr1Sym0 a6989586621680492478 Source #
Instances
SFoldable t => SingI (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable sing :: Sing Foldr1Sym0 Source # | |
SuppressUnusedWarnings (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) (a6989586621680492478 :: a ~> (a ~> a)) Source # | |
Defined in Data.Singletons.Prelude.Foldable |
data Foldr1Sym1 a6989586621680492478 a6989586621680492479 Source #
Instances
(SFoldable t, SingI d) => SingI (Foldr1Sym1 d :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable sing :: Sing (Foldr1Sym1 d) Source # | |
SuppressUnusedWarnings (Foldr1Sym1 a6989586621680492478 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (Foldr1Sym1 a6989586621680492478 :: TyFun (t a) a -> Type) (a6989586621680492479 :: t a) Source # | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Foldr1Sym1 a6989586621680492478 :: TyFun (t a) a -> Type) (a6989586621680492479 :: t a) = Foldr1Sym2 a6989586621680492478 a6989586621680492479 |
type Foldr1Sym2 (a6989586621680492478 :: (~>) a ((~>) a a)) (a6989586621680492479 :: t a) = Foldr1 a6989586621680492478 a6989586621680492479 :: a Source #
data Foldl1Sym0 a6989586621680492483 Source #
Instances
SFoldable t => SingI (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable sing :: Sing Foldl1Sym0 Source # | |
SuppressUnusedWarnings (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) (a6989586621680492483 :: a ~> (a ~> a)) Source # | |
Defined in Data.Singletons.Prelude.Foldable |
data Foldl1Sym1 a6989586621680492483 a6989586621680492484 Source #
Instances
(SFoldable t, SingI d) => SingI (Foldl1Sym1 d :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable sing :: Sing (Foldl1Sym1 d) Source # | |
SuppressUnusedWarnings (Foldl1Sym1 a6989586621680492483 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (Foldl1Sym1 a6989586621680492483 :: TyFun (t a) a -> Type) (a6989586621680492484 :: t a) Source # | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Foldl1Sym1 a6989586621680492483 :: TyFun (t a) a -> Type) (a6989586621680492484 :: t a) = Foldl1Sym2 a6989586621680492483 a6989586621680492484 |
type Foldl1Sym2 (a6989586621680492483 :: (~>) a ((~>) a a)) (a6989586621680492484 :: t a) = Foldl1 a6989586621680492483 a6989586621680492484 :: a Source #
data MaximumSym0 a6989586621680492501 Source #
Instances
(SFoldable t, SOrd a) => SingI (MaximumSym0 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable sing :: Sing MaximumSym0 Source # | |
SuppressUnusedWarnings (MaximumSym0 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (MaximumSym0 :: TyFun (t a) a -> Type) (a6989586621680492501 :: t a) Source # | |
Defined in Data.Singletons.Prelude.Foldable type Apply (MaximumSym0 :: TyFun (t a) a -> Type) (a6989586621680492501 :: t a) = MaximumSym1 a6989586621680492501 |
type MaximumSym1 (a6989586621680492501 :: t a) = Maximum a6989586621680492501 :: a Source #
data MinimumSym0 a6989586621680492504 Source #
Instances
(SFoldable t, SOrd a) => SingI (MinimumSym0 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable sing :: Sing MinimumSym0 Source # | |
SuppressUnusedWarnings (MinimumSym0 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (MinimumSym0 :: TyFun (t a) a -> Type) (a6989586621680492504 :: t a) Source # | |
Defined in Data.Singletons.Prelude.Foldable type Apply (MinimumSym0 :: TyFun (t a) a -> Type) (a6989586621680492504 :: t a) = MinimumSym1 a6989586621680492504 |
type MinimumSym1 (a6989586621680492504 :: t a) = Minimum a6989586621680492504 :: a Source #
data SumSym0 a6989586621680492507 Source #
Instances
(SFoldable t, SNum a) => SingI (SumSym0 :: TyFun (t a) a -> Type) Source # | |
SuppressUnusedWarnings (SumSym0 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (SumSym0 :: TyFun (t a) a -> Type) (a6989586621680492507 :: t a) Source # | |
data ProductSym0 a6989586621680492510 Source #
Instances
(SFoldable t, SNum a) => SingI (ProductSym0 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable sing :: Sing ProductSym0 Source # | |
SuppressUnusedWarnings (ProductSym0 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (ProductSym0 :: TyFun (t a) a -> Type) (a6989586621680492510 :: t a) Source # | |
Defined in Data.Singletons.Prelude.Foldable type Apply (ProductSym0 :: TyFun (t a) a -> Type) (a6989586621680492510 :: t a) = ProductSym1 a6989586621680492510 |
type ProductSym1 (a6989586621680492510 :: t a) = Product a6989586621680492510 :: a Source #
data TraverseSym0 a6989586621680816742 Source #
Instances
(STraversable t, SApplicative f) => SingI (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Traversable sing :: Sing TraverseSym0 Source # | |
SuppressUnusedWarnings (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Traversable suppressUnusedWarnings :: () Source # | |
type Apply (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) (a6989586621680816742 :: a ~> f b) Source # | |
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
(STraversable t, SApplicative f, SingI d) => SingI (TraverseSym1 d :: TyFun (t a) (f (t b)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Traversable sing :: Sing (TraverseSym1 d) Source # | |
SuppressUnusedWarnings (TraverseSym1 a6989586621680816742 :: TyFun (t a) (f (t b)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Traversable suppressUnusedWarnings :: () Source # | |
type Apply (TraverseSym1 a6989586621680816742 :: TyFun (t a) (f (t b)) -> Type) (a6989586621680816743 :: t a) Source # | |
Defined in Data.Singletons.Prelude.Traversable type Apply (TraverseSym1 a6989586621680816742 :: TyFun (t a) (f (t b)) -> Type) (a6989586621680816743 :: t a) = TraverseSym2 a6989586621680816742 a6989586621680816743 |
type TraverseSym2 (a6989586621680816742 :: (~>) a (f b)) (a6989586621680816743 :: t a) = Traverse a6989586621680816742 a6989586621680816743 :: f (t b) Source #
data SequenceASym0 a6989586621680816746 Source #
Instances
(STraversable t, SApplicative f) => SingI (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Traversable sing :: Sing SequenceASym0 Source # | |
SuppressUnusedWarnings (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Traversable suppressUnusedWarnings :: () Source # | |
type Apply (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) (a6989586621680816746 :: t (f a)) Source # | |
Defined in Data.Singletons.Prelude.Traversable type Apply (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) (a6989586621680816746 :: t (f a)) = SequenceASym1 a6989586621680816746 |
type SequenceASym1 (a6989586621680816746 :: t (f a)) = SequenceA a6989586621680816746 :: f (t a) Source #
data MapMSym0 a6989586621680816750 Source #
Instances
(STraversable t, SMonad m) => SingI (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) Source # | |
SuppressUnusedWarnings (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Traversable suppressUnusedWarnings :: () Source # | |
type Apply (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) (a6989586621680816750 :: a ~> m b) Source # | |
data MapMSym1 a6989586621680816750 a6989586621680816751 Source #
Instances
(STraversable t, SMonad m, SingI d) => SingI (MapMSym1 d :: TyFun (t a) (m (t b)) -> Type) Source # | |
SuppressUnusedWarnings (MapMSym1 a6989586621680816750 :: TyFun (t a) (m (t b)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Traversable suppressUnusedWarnings :: () Source # | |
type Apply (MapMSym1 a6989586621680816750 :: TyFun (t a) (m (t b)) -> Type) (a6989586621680816751 :: t a) Source # | |
type MapMSym2 (a6989586621680816750 :: (~>) a (m b)) (a6989586621680816751 :: t a) = MapM a6989586621680816750 a6989586621680816751 :: m (t b) Source #
data SequenceSym0 a6989586621680816754 Source #
Instances
(STraversable t, SMonad m) => SingI (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Traversable sing :: Sing SequenceSym0 Source # | |
SuppressUnusedWarnings (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Traversable suppressUnusedWarnings :: () Source # | |
type Apply (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) (a6989586621680816754 :: t (m a)) Source # | |
Defined in Data.Singletons.Prelude.Traversable type Apply (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) (a6989586621680816754 :: t (m a)) = SequenceSym1 a6989586621680816754 |
type SequenceSym1 (a6989586621680816754 :: t (m a)) = Sequence a6989586621680816754 :: m (t a) Source #
data ConstSym0 a6989586621679534200 Source #
Instances
data ConstSym1 a6989586621679534200 a6989586621679534201 Source #
Instances
SingI d => SingI (ConstSym1 d :: TyFun b a -> Type) Source # | |
SuppressUnusedWarnings (ConstSym1 a6989586621679534200 :: TyFun b a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Base suppressUnusedWarnings :: () Source # | |
type Apply (ConstSym1 a6989586621679534200 :: TyFun b a -> Type) (a6989586621679534201 :: b) Source # | |
type ConstSym2 (a6989586621679534200 :: a) (a6989586621679534201 :: b) = Const a6989586621679534200 a6989586621679534201 :: a Source #
data (.@#@$) a6989586621679534187 infixr 9 Source #
Instances
SingI ((.@#@$) :: TyFun (b ~> c) ((a ~> b) ~> (a ~> c)) -> Type) Source # | |
SuppressUnusedWarnings ((.@#@$) :: TyFun (b ~> c) ((a ~> b) ~> (a ~> c)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Base suppressUnusedWarnings :: () Source # | |
type Apply ((.@#@$) :: TyFun (b ~> c) ((a ~> b) ~> (a ~> c)) -> Type) (a6989586621679534187 :: b ~> c) Source # | |
data a6989586621679534187 .@#@$$ a6989586621679534188 infixr 9 Source #
Instances
SingI d => SingI ((.@#@$$) d :: TyFun (a ~> b) (a ~> c) -> Type) Source # | |
SuppressUnusedWarnings ((.@#@$$) a6989586621679534187 :: TyFun (a ~> b) (a ~> c) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Base suppressUnusedWarnings :: () Source # | |
type Apply ((.@#@$$) a6989586621679534187 :: TyFun (a ~> b) (a ~> c) -> Type) (a6989586621679534188 :: a ~> b) Source # | |
data (a6989586621679534187 .@#@$$$ a6989586621679534188) a6989586621679534189 infixr 9 Source #
Instances
(SingI d1, SingI d2) => SingI (d1 .@#@$$$ d2 :: TyFun a c -> Type) Source # | |
SuppressUnusedWarnings (a6989586621679534187 .@#@$$$ a6989586621679534188 :: TyFun a c -> Type) Source # | |
Defined in Data.Singletons.Prelude.Base suppressUnusedWarnings :: () Source # | |
type Apply (a6989586621679534187 .@#@$$$ a6989586621679534188 :: TyFun a c -> Type) (a6989586621679534189 :: a) Source # | |
data ($@#@$) a6989586621679534156 infixr 0 Source #
Instances
SingI (($@#@$) :: TyFun (a ~> b) (a ~> b) -> Type) Source # | |
SuppressUnusedWarnings (($@#@$) :: TyFun (a ~> b) (a ~> b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Base suppressUnusedWarnings :: () Source # | |
type Apply (($@#@$) :: TyFun (a ~> b) (a ~> b) -> Type) (a6989586621679534156 :: a ~> b) Source # | |
data a6989586621679534156 $@#@$$ a6989586621679534157 infixr 0 Source #
Instances
SingI d => SingI (($@#@$$) d :: TyFun a b -> Type) Source # | |
SuppressUnusedWarnings (($@#@$$) a6989586621679534156 :: TyFun a b -> Type) Source # | |
Defined in Data.Singletons.Prelude.Base suppressUnusedWarnings :: () Source # | |
type Apply (($@#@$$) a6989586621679534156 :: TyFun a b -> Type) (a6989586621679534157 :: a) Source # | |
type ($@#@$$$) (a6989586621679534156 :: (~>) a b) (a6989586621679534157 :: a) = ($) a6989586621679534156 a6989586621679534157 :: b infixr 0 Source #
data ($!@#@$) a6989586621679534147 infixr 0 Source #
Instances
SingI (($!@#@$) :: TyFun (a ~> b) (a ~> b) -> Type) Source # | |
SuppressUnusedWarnings (($!@#@$) :: TyFun (a ~> b) (a ~> b) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Base suppressUnusedWarnings :: () Source # | |
type Apply (($!@#@$) :: TyFun (a ~> b) (a ~> b) -> Type) (a6989586621679534147 :: a ~> b) Source # | |
data a6989586621679534147 $!@#@$$ a6989586621679534148 infixr 0 Source #
Instances
SingI d => SingI (($!@#@$$) d :: TyFun a b -> Type) Source # | |
SuppressUnusedWarnings (($!@#@$$) a6989586621679534147 :: TyFun a b -> Type) Source # | |
Defined in Data.Singletons.Prelude.Base suppressUnusedWarnings :: () Source # | |
type Apply (($!@#@$$) a6989586621679534147 :: TyFun a b -> Type) (a6989586621679534148 :: a) Source # | |
type ($!@#@$$$) (a6989586621679534147 :: (~>) a b) (a6989586621679534148 :: a) = ($!) a6989586621679534147 a6989586621679534148 :: b infixr 0 Source #
data FlipSym0 a6989586621679534175 Source #
Instances
SingI (FlipSym0 :: TyFun (a ~> (b ~> c)) (b ~> (a ~> c)) -> Type) Source # | |
SuppressUnusedWarnings (FlipSym0 :: TyFun (a ~> (b ~> c)) (b ~> (a ~> c)) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Base suppressUnusedWarnings :: () Source # | |
type Apply (FlipSym0 :: TyFun (a ~> (b ~> c)) (b ~> (a ~> c)) -> Type) (a6989586621679534175 :: a ~> (b ~> c)) Source # | |
data FlipSym1 a6989586621679534175 a6989586621679534176 Source #
Instances
SingI d => SingI (FlipSym1 d :: TyFun b (a ~> c) -> Type) Source # | |
SuppressUnusedWarnings (FlipSym1 a6989586621679534175 :: TyFun b (a ~> c) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Base suppressUnusedWarnings :: () Source # | |
type Apply (FlipSym1 a6989586621679534175 :: TyFun b (a ~> c) -> Type) (a6989586621679534176 :: b) Source # | |
data FlipSym2 a6989586621679534175 a6989586621679534176 a6989586621679534177 Source #
Instances
(SingI d1, SingI d2) => SingI (FlipSym2 d1 d2 :: TyFun a c -> Type) Source # | |
SuppressUnusedWarnings (FlipSym2 a6989586621679534175 a6989586621679534176 :: TyFun a c -> Type) Source # | |
Defined in Data.Singletons.Prelude.Base suppressUnusedWarnings :: () Source # | |
type Apply (FlipSym2 a6989586621679534175 a6989586621679534176 :: TyFun a c -> Type) (a6989586621679534177 :: a) Source # | |
data AsTypeOfSym0 a6989586621679534167 Source #
Instances
SingI (AsTypeOfSym0 :: TyFun a (a ~> a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Base sing :: Sing AsTypeOfSym0 Source # | |
SuppressUnusedWarnings (AsTypeOfSym0 :: TyFun a (a ~> a) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Base suppressUnusedWarnings :: () Source # | |
type Apply (AsTypeOfSym0 :: TyFun a (a ~> a) -> Type) (a6989586621679534167 :: a) Source # | |
Defined in Data.Singletons.Prelude.Base type Apply (AsTypeOfSym0 :: TyFun a (a ~> a) -> Type) (a6989586621679534167 :: a) = AsTypeOfSym1 a6989586621679534167 |
data AsTypeOfSym1 a6989586621679534167 a6989586621679534168 Source #
Instances
SingI d => SingI (AsTypeOfSym1 d :: TyFun a a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Base sing :: Sing (AsTypeOfSym1 d) Source # | |
SuppressUnusedWarnings (AsTypeOfSym1 a6989586621679534167 :: TyFun a a -> Type) Source # | |
Defined in Data.Singletons.Prelude.Base suppressUnusedWarnings :: () Source # | |
type Apply (AsTypeOfSym1 a6989586621679534167 :: TyFun a a -> Type) (a6989586621679534168 :: a) Source # | |
Defined in Data.Singletons.Prelude.Base type Apply (AsTypeOfSym1 a6989586621679534167 :: TyFun a a -> Type) (a6989586621679534168 :: a) = AsTypeOfSym2 a6989586621679534167 a6989586621679534168 |
type AsTypeOfSym2 (a6989586621679534167 :: a) (a6989586621679534168 :: a) = AsTypeOf a6989586621679534167 a6989586621679534168 :: a Source #
data SeqSym1 a6989586621679534120 a6989586621679534121 infixr 0 Source #
Instances
SingI d => SingI (SeqSym1 d :: TyFun b b -> Type) Source # | |
SuppressUnusedWarnings (SeqSym1 a6989586621679534120 :: TyFun b b -> Type) Source # | |
Defined in Data.Singletons.Prelude.Base suppressUnusedWarnings :: () Source # | |
type Apply (SeqSym1 a6989586621679534120 :: TyFun b b -> Type) (a6989586621679534121 :: b) Source # | |
type SeqSym2 (a6989586621679534120 :: a) (a6989586621679534121 :: b) = Seq a6989586621679534120 a6989586621679534121 :: b infixr 0 Source #
data (:@#@$) a6989586621679304138 infixr 5 Source #
Instances
SingI ((:@#@$) :: TyFun a ([a] ~> [a]) -> Type) Source # | |
SuppressUnusedWarnings ((:@#@$) :: TyFun a ([a] ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply ((:@#@$) :: TyFun a ([a] ~> [a]) -> Type) (a6989586621679304138 :: a) Source # | |
data a6989586621679304138 :@#@$$ a6989586621679304139 infixr 5 Source #
Instances
SingI d => SingI ((:@#@$$) d :: TyFun [a] [a] -> Type) Source # | |
SuppressUnusedWarnings ((:@#@$$) a6989586621679304138 :: TyFun [a] [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () Source # | |
type Apply ((:@#@$$) a6989586621679304138 :: TyFun [a] [a] -> Type) (a6989586621679304139 :: [a]) Source # | |
type (:@#@$$$) (a6989586621679304138 :: a) (a6989586621679304139 :: [a]) = '(:) a6989586621679304138 a6989586621679304139 :: [a :: Type] infixr 5 Source #
data MapSym0 a6989586621679534219 Source #
Instances
SingI (MapSym0 :: TyFun (a ~> b) ([a] ~> [b]) -> Type) Source # | |
SuppressUnusedWarnings (MapSym0 :: TyFun (a ~> b) ([a] ~> [b]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Base suppressUnusedWarnings :: () Source # | |
type Apply (MapSym0 :: TyFun (a ~> b) ([a] ~> [b]) -> Type) (a6989586621679534219 :: a ~> b) Source # | |
data MapSym1 a6989586621679534219 a6989586621679534220 Source #
Instances
SingI d => SingI (MapSym1 d :: TyFun [a] [b] -> Type) Source # | |
SuppressUnusedWarnings (MapSym1 a6989586621679534219 :: TyFun [a] [b] -> Type) Source # | |
Defined in Data.Singletons.Prelude.Base suppressUnusedWarnings :: () Source # | |
type Apply (MapSym1 a6989586621679534219 :: TyFun [a] [b] -> Type) (a6989586621679534220 :: [a]) Source # | |
type MapSym2 (a6989586621679534219 :: (~>) a b) (a6989586621679534220 :: [a]) = Map a6989586621679534219 a6989586621679534220 :: [b] Source #
data ReverseSym0 a6989586621679970000 Source #
Instances
SingI (ReverseSym0 :: TyFun [a] [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing ReverseSym0 Source # | |
SuppressUnusedWarnings (ReverseSym0 :: TyFun [a] [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (ReverseSym0 :: TyFun [a] [a] -> Type) (a6989586621679970000 :: [a]) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (ReverseSym0 :: TyFun [a] [a] -> Type) (a6989586621679970000 :: [a]) = ReverseSym1 a6989586621679970000 |
type ReverseSym1 (a6989586621679970000 :: [a]) = Reverse a6989586621679970000 :: [a] Source #
data a6989586621679534210 ++@#@$$ a6989586621679534211 infixr 5 Source #
Instances
SingI d => SingI ((++@#@$$) d :: TyFun [a] [a] -> Type) Source # | |
SuppressUnusedWarnings ((++@#@$$) a6989586621679534210 :: TyFun [a] [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.Base suppressUnusedWarnings :: () Source # | |
type Apply ((++@#@$$) a6989586621679534210 :: TyFun [a] [a] -> Type) (a6989586621679534211 :: [a]) Source # | |
data (++@#@$) a6989586621679534210 infixr 5 Source #
Instances
SingI ((++@#@$) :: TyFun [a] ([a] ~> [a]) -> Type) Source # | |
SuppressUnusedWarnings ((++@#@$) :: TyFun [a] ([a] ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Base suppressUnusedWarnings :: () Source # | |
type Apply ((++@#@$) :: TyFun [a] ([a] ~> [a]) -> Type) (a6989586621679534210 :: [a]) Source # | |
data FilterSym0 a6989586621679969267 Source #
Instances
SingI (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing FilterSym0 Source # | |
SuppressUnusedWarnings (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679969267 :: a ~> Bool) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679969267 :: a ~> Bool) = FilterSym1 a6989586621679969267 |
data FilterSym1 a6989586621679969267 a6989586621679969268 Source #
Instances
SingI d => SingI (FilterSym1 d :: TyFun [a] [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing (FilterSym1 d) Source # | |
SuppressUnusedWarnings (FilterSym1 a6989586621679969267 :: TyFun [a] [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (FilterSym1 a6989586621679969267 :: TyFun [a] [a] -> Type) (a6989586621679969268 :: [a]) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (FilterSym1 a6989586621679969267 :: TyFun [a] [a] -> Type) (a6989586621679969268 :: [a]) = FilterSym2 a6989586621679969267 a6989586621679969268 |
type FilterSym2 (a6989586621679969267 :: (~>) a Bool) (a6989586621679969268 :: [a]) = Filter a6989586621679969267 a6989586621679969268 :: [a] Source #
data TailSym0 a6989586621679970027 Source #
Instances
data InitSym0 a6989586621679970015 Source #
Instances
data NullSym0 a6989586621680492490 Source #
Instances
SFoldable t => SingI (NullSym0 :: TyFun (t a) Bool -> Type) Source # | |
SuppressUnusedWarnings (NullSym0 :: TyFun (t a) Bool -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (a6989586621680492490 :: t a) Source # | |
data ConcatSym0 a6989586621680492332 Source #
Instances
SFoldable t => SingI (ConcatSym0 :: TyFun (t [a]) [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable sing :: Sing ConcatSym0 Source # | |
SuppressUnusedWarnings (ConcatSym0 :: TyFun (t [a]) [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (ConcatSym0 :: TyFun (t [a]) [a] -> Type) (a6989586621680492332 :: t [a]) Source # | |
Defined in Data.Singletons.Prelude.Foldable type Apply (ConcatSym0 :: TyFun (t [a]) [a] -> Type) (a6989586621680492332 :: t [a]) = ConcatSym1 a6989586621680492332 |
type ConcatSym1 (a6989586621680492332 :: t [a]) = Concat a6989586621680492332 :: [a] Source #
data ConcatMapSym0 a6989586621680492321 Source #
Instances
SFoldable t => SingI (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable sing :: Sing ConcatMapSym0 Source # | |
SuppressUnusedWarnings (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) (a6989586621680492321 :: a ~> [b]) Source # | |
Defined in Data.Singletons.Prelude.Foldable type Apply (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) (a6989586621680492321 :: a ~> [b]) = ConcatMapSym1 a6989586621680492321 :: TyFun (t a) [b] -> Type |
data ConcatMapSym1 a6989586621680492321 a6989586621680492322 Source #
Instances
(SFoldable t, SingI d) => SingI (ConcatMapSym1 d :: TyFun (t a) [b] -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable sing :: Sing (ConcatMapSym1 d) Source # | |
SuppressUnusedWarnings (ConcatMapSym1 a6989586621680492321 :: TyFun (t a) [b] -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (ConcatMapSym1 a6989586621680492321 :: TyFun (t a) [b] -> Type) (a6989586621680492322 :: t a) Source # | |
Defined in Data.Singletons.Prelude.Foldable type Apply (ConcatMapSym1 a6989586621680492321 :: TyFun (t a) [b] -> Type) (a6989586621680492322 :: t a) = ConcatMapSym2 a6989586621680492321 a6989586621680492322 |
type ConcatMapSym2 (a6989586621680492321 :: (~>) a [b]) (a6989586621680492322 :: t a) = ConcatMap a6989586621680492321 a6989586621680492322 :: [b] Source #
data AndSym0 a6989586621680492316 Source #
Instances
SFoldable t => SingI (AndSym0 :: TyFun (t Bool) Bool -> Type) Source # | |
SuppressUnusedWarnings (AndSym0 :: TyFun (t Bool) Bool -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680492316 :: t Bool) Source # | |
data OrSym0 a6989586621680492310 Source #
Instances
SFoldable t => SingI (OrSym0 :: TyFun (t Bool) Bool -> Type) Source # | |
SuppressUnusedWarnings (OrSym0 :: TyFun (t Bool) Bool -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680492310 :: t Bool) Source # | |
data AnySym0 a6989586621680492302 Source #
Instances
SFoldable t => SingI (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source # | |
SuppressUnusedWarnings (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680492302 :: a ~> Bool) Source # | |
data AnySym1 a6989586621680492302 a6989586621680492303 Source #
Instances
(SFoldable t, SingI d) => SingI (AnySym1 d :: TyFun (t a) Bool -> Type) Source # | |
SuppressUnusedWarnings (AnySym1 a6989586621680492302 :: TyFun (t a) Bool -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (AnySym1 a6989586621680492302 :: TyFun (t a) Bool -> Type) (a6989586621680492303 :: t a) Source # | |
type AnySym2 (a6989586621680492302 :: (~>) a Bool) (a6989586621680492303 :: t a) = Any a6989586621680492302 a6989586621680492303 :: Bool Source #
data AllSym0 a6989586621680492293 Source #
Instances
SFoldable t => SingI (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source # | |
SuppressUnusedWarnings (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680492293 :: a ~> Bool) Source # | |
data AllSym1 a6989586621680492293 a6989586621680492294 Source #
Instances
(SFoldable t, SingI d) => SingI (AllSym1 d :: TyFun (t a) Bool -> Type) Source # | |
SuppressUnusedWarnings (AllSym1 a6989586621680492293 :: TyFun (t a) Bool -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (AllSym1 a6989586621680492293 :: TyFun (t a) Bool -> Type) (a6989586621680492294 :: t a) Source # | |
type AllSym2 (a6989586621680492293 :: (~>) a Bool) (a6989586621680492294 :: t a) = All a6989586621680492293 a6989586621680492294 :: Bool Source #
data ScanlSym0 a6989586621679969805 Source #
Instances
SingI (ScanlSym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> [b])) -> Type) Source # | |
SuppressUnusedWarnings (ScanlSym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> [b])) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (ScanlSym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> [b])) -> Type) (a6989586621679969805 :: b ~> (a ~> b)) Source # | |
data ScanlSym1 a6989586621679969805 a6989586621679969806 Source #
Instances
SingI d => SingI (ScanlSym1 d :: TyFun b ([a] ~> [b]) -> Type) Source # | |
SuppressUnusedWarnings (ScanlSym1 a6989586621679969805 :: TyFun b ([a] ~> [b]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (ScanlSym1 a6989586621679969805 :: TyFun b ([a] ~> [b]) -> Type) (a6989586621679969806 :: b) Source # | |
data ScanlSym2 a6989586621679969805 a6989586621679969806 a6989586621679969807 Source #
Instances
(SingI d1, SingI d2) => SingI (ScanlSym2 d1 d2 :: TyFun [a] [b] -> Type) Source # | |
SuppressUnusedWarnings (ScanlSym2 a6989586621679969805 a6989586621679969806 :: TyFun [a] [b] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (ScanlSym2 a6989586621679969805 a6989586621679969806 :: TyFun [a] [b] -> Type) (a6989586621679969807 :: [a]) Source # | |
type ScanlSym3 (a6989586621679969805 :: (~>) b ((~>) a b)) (a6989586621679969806 :: b) (a6989586621679969807 :: [a]) = Scanl a6989586621679969805 a6989586621679969806 a6989586621679969807 :: [b] Source #
data Scanl1Sym0 a6989586621679969796 Source #
Instances
SingI (Scanl1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing Scanl1Sym0 Source # | |
SuppressUnusedWarnings (Scanl1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (Scanl1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) (a6989586621679969796 :: a ~> (a ~> a)) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Scanl1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) (a6989586621679969796 :: a ~> (a ~> a)) = Scanl1Sym1 a6989586621679969796 |
data Scanl1Sym1 a6989586621679969796 a6989586621679969797 Source #
Instances
SingI d => SingI (Scanl1Sym1 d :: TyFun [a] [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing (Scanl1Sym1 d) Source # | |
SuppressUnusedWarnings (Scanl1Sym1 a6989586621679969796 :: TyFun [a] [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (Scanl1Sym1 a6989586621679969796 :: TyFun [a] [a] -> Type) (a6989586621679969797 :: [a]) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Scanl1Sym1 a6989586621679969796 :: TyFun [a] [a] -> Type) (a6989586621679969797 :: [a]) = Scanl1Sym2 a6989586621679969796 a6989586621679969797 |
type Scanl1Sym2 (a6989586621679969796 :: (~>) a ((~>) a a)) (a6989586621679969797 :: [a]) = Scanl1 a6989586621679969796 a6989586621679969797 :: [a] Source #
data ScanrSym0 a6989586621679969778 Source #
Instances
SingI (ScanrSym0 :: TyFun (a ~> (b ~> b)) (b ~> ([a] ~> [b])) -> Type) Source # | |
SuppressUnusedWarnings (ScanrSym0 :: TyFun (a ~> (b ~> b)) (b ~> ([a] ~> [b])) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (ScanrSym0 :: TyFun (a ~> (b ~> b)) (b ~> ([a] ~> [b])) -> Type) (a6989586621679969778 :: a ~> (b ~> b)) Source # | |
data ScanrSym1 a6989586621679969778 a6989586621679969779 Source #
Instances
SingI d => SingI (ScanrSym1 d :: TyFun b ([a] ~> [b]) -> Type) Source # | |
SuppressUnusedWarnings (ScanrSym1 a6989586621679969778 :: TyFun b ([a] ~> [b]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (ScanrSym1 a6989586621679969778 :: TyFun b ([a] ~> [b]) -> Type) (a6989586621679969779 :: b) Source # | |
data ScanrSym2 a6989586621679969778 a6989586621679969779 a6989586621679969780 Source #
Instances
(SingI d1, SingI d2) => SingI (ScanrSym2 d1 d2 :: TyFun [a] [b] -> Type) Source # | |
SuppressUnusedWarnings (ScanrSym2 a6989586621679969778 a6989586621679969779 :: TyFun [a] [b] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (ScanrSym2 a6989586621679969778 a6989586621679969779 :: TyFun [a] [b] -> Type) (a6989586621679969780 :: [a]) Source # | |
type ScanrSym3 (a6989586621679969778 :: (~>) a ((~>) b b)) (a6989586621679969779 :: b) (a6989586621679969780 :: [a]) = Scanr a6989586621679969778 a6989586621679969779 a6989586621679969780 :: [b] Source #
data Scanr1Sym0 a6989586621679969758 Source #
Instances
SingI (Scanr1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing Scanr1Sym0 Source # | |
SuppressUnusedWarnings (Scanr1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (Scanr1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) (a6989586621679969758 :: a ~> (a ~> a)) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Scanr1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) (a6989586621679969758 :: a ~> (a ~> a)) = Scanr1Sym1 a6989586621679969758 |
data Scanr1Sym1 a6989586621679969758 a6989586621679969759 Source #
Instances
SingI d => SingI (Scanr1Sym1 d :: TyFun [a] [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing (Scanr1Sym1 d) Source # | |
SuppressUnusedWarnings (Scanr1Sym1 a6989586621679969758 :: TyFun [a] [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (Scanr1Sym1 a6989586621679969758 :: TyFun [a] [a] -> Type) (a6989586621679969759 :: [a]) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Scanr1Sym1 a6989586621679969758 :: TyFun [a] [a] -> Type) (a6989586621679969759 :: [a]) = Scanr1Sym2 a6989586621679969758 a6989586621679969759 |
type Scanr1Sym2 (a6989586621679969758 :: (~>) a ((~>) a a)) (a6989586621679969759 :: [a]) = Scanr1 a6989586621679969758 a6989586621679969759 :: [a] Source #
data ReplicateSym0 a6989586621679968895 Source #
Instances
SingI (ReplicateSym0 :: TyFun Nat (a ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing ReplicateSym0 Source # | |
SuppressUnusedWarnings (ReplicateSym0 :: TyFun Nat (a ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (ReplicateSym0 :: TyFun Nat (a ~> [a]) -> Type) (a6989586621679968895 :: Nat) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (ReplicateSym0 :: TyFun Nat (a ~> [a]) -> Type) (a6989586621679968895 :: Nat) = ReplicateSym1 a6989586621679968895 :: TyFun a [a] -> Type |
data ReplicateSym1 a6989586621679968895 a6989586621679968896 Source #
Instances
SingI d => SingI (ReplicateSym1 d :: TyFun a [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing (ReplicateSym1 d) Source # | |
SuppressUnusedWarnings (ReplicateSym1 a6989586621679968895 :: TyFun a [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (ReplicateSym1 a6989586621679968895 :: TyFun a [a] -> Type) (a6989586621679968896 :: a) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (ReplicateSym1 a6989586621679968895 :: TyFun a [a] -> Type) (a6989586621679968896 :: a) = ReplicateSym2 a6989586621679968895 a6989586621679968896 |
type ReplicateSym2 (a6989586621679968895 :: Nat) (a6989586621679968896 :: a) = Replicate a6989586621679968895 a6989586621679968896 :: [a] Source #
data TakeSym0 a6989586621679969050 Source #
Instances
SingI (TakeSym0 :: TyFun Nat ([a] ~> [a]) -> Type) Source # | |
SuppressUnusedWarnings (TakeSym0 :: TyFun Nat ([a] ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (TakeSym0 :: TyFun Nat ([a] ~> [a]) -> Type) (a6989586621679969050 :: Nat) Source # | |
data TakeSym1 a6989586621679969050 a6989586621679969051 Source #
Instances
SingI d => SingI (TakeSym1 d :: TyFun [a] [a] -> Type) Source # | |
SuppressUnusedWarnings (TakeSym1 a6989586621679969050 :: TyFun [a] [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (TakeSym1 a6989586621679969050 :: TyFun [a] [a] -> Type) (a6989586621679969051 :: [a]) Source # | |
type TakeSym2 (a6989586621679969050 :: Nat) (a6989586621679969051 :: [a]) = Take a6989586621679969050 a6989586621679969051 :: [a] Source #
data DropSym0 a6989586621679969037 Source #
Instances
SingI (DropSym0 :: TyFun Nat ([a] ~> [a]) -> Type) Source # | |
SuppressUnusedWarnings (DropSym0 :: TyFun Nat ([a] ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (DropSym0 :: TyFun Nat ([a] ~> [a]) -> Type) (a6989586621679969037 :: Nat) Source # | |
data DropSym1 a6989586621679969037 a6989586621679969038 Source #
Instances
SingI d => SingI (DropSym1 d :: TyFun [a] [a] -> Type) Source # | |
SuppressUnusedWarnings (DropSym1 a6989586621679969037 :: TyFun [a] [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (DropSym1 a6989586621679969037 :: TyFun [a] [a] -> Type) (a6989586621679969038 :: [a]) Source # | |
type DropSym2 (a6989586621679969037 :: Nat) (a6989586621679969038 :: [a]) = Drop a6989586621679969037 a6989586621679969038 :: [a] Source #
data SplitAtSym0 a6989586621679969030 Source #
Instances
SingI (SplitAtSym0 :: TyFun Nat ([a] ~> ([a], [a])) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing SplitAtSym0 Source # | |
SuppressUnusedWarnings (SplitAtSym0 :: TyFun Nat ([a] ~> ([a], [a])) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (SplitAtSym0 :: TyFun Nat ([a] ~> ([a], [a])) -> Type) (a6989586621679969030 :: Nat) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (SplitAtSym0 :: TyFun Nat ([a] ~> ([a], [a])) -> Type) (a6989586621679969030 :: Nat) = SplitAtSym1 a6989586621679969030 :: TyFun [a] ([a], [a]) -> Type |
data SplitAtSym1 a6989586621679969030 a6989586621679969031 Source #
Instances
SingI d => SingI (SplitAtSym1 d :: TyFun [a] ([a], [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing (SplitAtSym1 d) Source # | |
SuppressUnusedWarnings (SplitAtSym1 a6989586621679969030 :: TyFun [a] ([a], [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (SplitAtSym1 a6989586621679969030 :: TyFun [a] ([a], [a]) -> Type) (a6989586621679969031 :: [a]) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (SplitAtSym1 a6989586621679969030 :: TyFun [a] ([a], [a]) -> Type) (a6989586621679969031 :: [a]) = SplitAtSym2 a6989586621679969030 a6989586621679969031 |
type SplitAtSym2 (a6989586621679969030 :: Nat) (a6989586621679969031 :: [a]) = SplitAt a6989586621679969030 a6989586621679969031 :: ([a], [a]) Source #
data TakeWhileSym0 a6989586621679969167 Source #
Instances
SingI (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing TakeWhileSym0 Source # | |
SuppressUnusedWarnings (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679969167 :: a ~> Bool) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679969167 :: a ~> Bool) = TakeWhileSym1 a6989586621679969167 |
data TakeWhileSym1 a6989586621679969167 a6989586621679969168 Source #
Instances
SingI d => SingI (TakeWhileSym1 d :: TyFun [a] [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing (TakeWhileSym1 d) Source # | |
SuppressUnusedWarnings (TakeWhileSym1 a6989586621679969167 :: TyFun [a] [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (TakeWhileSym1 a6989586621679969167 :: TyFun [a] [a] -> Type) (a6989586621679969168 :: [a]) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (TakeWhileSym1 a6989586621679969167 :: TyFun [a] [a] -> Type) (a6989586621679969168 :: [a]) = TakeWhileSym2 a6989586621679969167 a6989586621679969168 |
type TakeWhileSym2 (a6989586621679969167 :: (~>) a Bool) (a6989586621679969168 :: [a]) = TakeWhile a6989586621679969167 a6989586621679969168 :: [a] Source #
data DropWhileSym0 a6989586621679969152 Source #
Instances
SingI (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing DropWhileSym0 Source # | |
SuppressUnusedWarnings (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679969152 :: a ~> Bool) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679969152 :: a ~> Bool) = DropWhileSym1 a6989586621679969152 |
data DropWhileSym1 a6989586621679969152 a6989586621679969153 Source #
Instances
SingI d => SingI (DropWhileSym1 d :: TyFun [a] [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing (DropWhileSym1 d) Source # | |
SuppressUnusedWarnings (DropWhileSym1 a6989586621679969152 :: TyFun [a] [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (DropWhileSym1 a6989586621679969152 :: TyFun [a] [a] -> Type) (a6989586621679969153 :: [a]) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileSym1 a6989586621679969152 :: TyFun [a] [a] -> Type) (a6989586621679969153 :: [a]) = DropWhileSym2 a6989586621679969152 a6989586621679969153 |
type DropWhileSym2 (a6989586621679969152 :: (~>) a Bool) (a6989586621679969153 :: [a]) = DropWhile a6989586621679969152 a6989586621679969153 :: [a] Source #
data DropWhileEndSym0 a6989586621679969135 Source #
Instances
SingI (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal | |
SuppressUnusedWarnings (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679969135 :: a ~> Bool) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679969135 :: a ~> Bool) = DropWhileEndSym1 a6989586621679969135 |
data DropWhileEndSym1 a6989586621679969135 a6989586621679969136 Source #
Instances
SingI d => SingI (DropWhileEndSym1 d :: TyFun [a] [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing (DropWhileEndSym1 d) Source # | |
SuppressUnusedWarnings (DropWhileEndSym1 a6989586621679969135 :: TyFun [a] [a] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (DropWhileEndSym1 a6989586621679969135 :: TyFun [a] [a] -> Type) (a6989586621679969136 :: [a]) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileEndSym1 a6989586621679969135 :: TyFun [a] [a] -> Type) (a6989586621679969136 :: [a]) = DropWhileEndSym2 a6989586621679969135 a6989586621679969136 |
type DropWhileEndSym2 (a6989586621679969135 :: (~>) a Bool) (a6989586621679969136 :: [a]) = DropWhileEnd a6989586621679969135 a6989586621679969136 :: [a] Source #
data SpanSym0 a6989586621679969098 Source #
Instances
SingI (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) Source # | |
SuppressUnusedWarnings (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621679969098 :: a ~> Bool) Source # | |
data SpanSym1 a6989586621679969098 a6989586621679969099 Source #
Instances
SingI d => SingI (SpanSym1 d :: TyFun [a] ([a], [a]) -> Type) Source # | |
SuppressUnusedWarnings (SpanSym1 a6989586621679969098 :: TyFun [a] ([a], [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (SpanSym1 a6989586621679969098 :: TyFun [a] ([a], [a]) -> Type) (a6989586621679969099 :: [a]) Source # | |
type SpanSym2 (a6989586621679969098 :: (~>) a Bool) (a6989586621679969099 :: [a]) = Span a6989586621679969098 a6989586621679969099 :: ([a], [a]) Source #
data BreakSym0 a6989586621679969063 Source #
Instances
SingI (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) Source # | |
SuppressUnusedWarnings (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621679969063 :: a ~> Bool) Source # | |
data BreakSym1 a6989586621679969063 a6989586621679969064 Source #
Instances
SingI d => SingI (BreakSym1 d :: TyFun [a] ([a], [a]) -> Type) Source # | |
SuppressUnusedWarnings (BreakSym1 a6989586621679969063 :: TyFun [a] ([a], [a]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (BreakSym1 a6989586621679969063 :: TyFun [a] ([a], [a]) -> Type) (a6989586621679969064 :: [a]) Source # | |
type BreakSym2 (a6989586621679969063 :: (~>) a Bool) (a6989586621679969064 :: [a]) = Break a6989586621679969063 a6989586621679969064 :: ([a], [a]) Source #
data NotElemSym0 a6989586621680492244 Source #
Instances
(SFoldable t, SEq a) => SingI (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable sing :: Sing NotElemSym0 Source # | |
SuppressUnusedWarnings (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680492244 :: a) Source # | |
Defined in Data.Singletons.Prelude.Foldable type Apply (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680492244 :: a) = NotElemSym1 a6989586621680492244 :: TyFun (t a) Bool -> Type |
data NotElemSym1 a6989586621680492244 a6989586621680492245 Source #
Instances
(SFoldable t, SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun (t a) Bool -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable sing :: Sing (NotElemSym1 d) Source # | |
SuppressUnusedWarnings (NotElemSym1 a6989586621680492244 :: TyFun (t a) Bool -> Type) Source # | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () Source # | |
type Apply (NotElemSym1 a6989586621680492244 :: TyFun (t a) Bool -> Type) (a6989586621680492245 :: t a) Source # | |
Defined in Data.Singletons.Prelude.Foldable type Apply (NotElemSym1 a6989586621680492244 :: TyFun (t a) Bool -> Type) (a6989586621680492245 :: t a) = NotElemSym2 a6989586621680492244 a6989586621680492245 |
type NotElemSym2 (a6989586621680492244 :: a) (a6989586621680492245 :: t a) = NotElem a6989586621680492244 a6989586621680492245 :: Bool Source #
data ZipSym0 a6989586621679969585 Source #
Instances
SingI (ZipSym0 :: TyFun [a] ([b] ~> [(a, b)]) -> Type) Source # | |
SuppressUnusedWarnings (ZipSym0 :: TyFun [a] ([b] ~> [(a, b)]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (ZipSym0 :: TyFun [a] ([b] ~> [(a, b)]) -> Type) (a6989586621679969585 :: [a]) Source # | |
data ZipSym1 a6989586621679969585 a6989586621679969586 Source #
Instances
SingI d => SingI (ZipSym1 d :: TyFun [b] [(a, b)] -> Type) Source # | |
SuppressUnusedWarnings (ZipSym1 a6989586621679969585 :: TyFun [b] [(a, b)] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (ZipSym1 a6989586621679969585 :: TyFun [b] [(a, b)] -> Type) (a6989586621679969586 :: [b]) Source # | |
type ZipSym2 (a6989586621679969585 :: [a]) (a6989586621679969586 :: [b]) = Zip a6989586621679969585 a6989586621679969586 :: [(a, b)] Source #
data Zip3Sym0 a6989586621679969573 Source #
Instances
SingI (Zip3Sym0 :: TyFun [a] ([b] ~> ([c] ~> [(a, b, c)])) -> Type) Source # | |
SuppressUnusedWarnings (Zip3Sym0 :: TyFun [a] ([b] ~> ([c] ~> [(a, b, c)])) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (Zip3Sym0 :: TyFun [a] ([b] ~> ([c] ~> [(a, b, c)])) -> Type) (a6989586621679969573 :: [a]) Source # | |
data Zip3Sym1 a6989586621679969573 a6989586621679969574 Source #
Instances
SingI d => SingI (Zip3Sym1 d :: TyFun [b] ([c] ~> [(a, b, c)]) -> Type) Source # | |
SuppressUnusedWarnings (Zip3Sym1 a6989586621679969573 :: TyFun [b] ([c] ~> [(a, b, c)]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (Zip3Sym1 a6989586621679969573 :: TyFun [b] ([c] ~> [(a, b, c)]) -> Type) (a6989586621679969574 :: [b]) Source # | |
data Zip3Sym2 a6989586621679969573 a6989586621679969574 a6989586621679969575 Source #
Instances
(SingI d1, SingI d2) => SingI (Zip3Sym2 d1 d2 :: TyFun [c] [(a, b, c)] -> Type) Source # | |
SuppressUnusedWarnings (Zip3Sym2 a6989586621679969573 a6989586621679969574 :: TyFun [c] [(a, b, c)] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (Zip3Sym2 a6989586621679969573 a6989586621679969574 :: TyFun [c] [(a, b, c)] -> Type) (a6989586621679969575 :: [c]) Source # | |
type Zip3Sym3 (a6989586621679969573 :: [a]) (a6989586621679969574 :: [b]) (a6989586621679969575 :: [c]) = Zip3 a6989586621679969573 a6989586621679969574 a6989586621679969575 :: [(a, b, c)] Source #
data ZipWithSym0 a6989586621679969561 Source #
Instances
SingI (ZipWithSym0 :: TyFun (a ~> (b ~> c)) ([a] ~> ([b] ~> [c])) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing ZipWithSym0 Source # | |
SuppressUnusedWarnings (ZipWithSym0 :: TyFun (a ~> (b ~> c)) ([a] ~> ([b] ~> [c])) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (ZipWithSym0 :: TyFun (a ~> (b ~> c)) ([a] ~> ([b] ~> [c])) -> Type) (a6989586621679969561 :: a ~> (b ~> c)) Source # | |
Defined in Data.Singletons.Prelude.List.Internal |
data ZipWithSym1 a6989586621679969561 a6989586621679969562 Source #
Instances
SingI d => SingI (ZipWithSym1 d :: TyFun [a] ([b] ~> [c]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing (ZipWithSym1 d) Source # | |
SuppressUnusedWarnings (ZipWithSym1 a6989586621679969561 :: TyFun [a] ([b] ~> [c]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (ZipWithSym1 a6989586621679969561 :: TyFun [a] ([b] ~> [c]) -> Type) (a6989586621679969562 :: [a]) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (ZipWithSym1 a6989586621679969561 :: TyFun [a] ([b] ~> [c]) -> Type) (a6989586621679969562 :: [a]) = ZipWithSym2 a6989586621679969561 a6989586621679969562 |
data ZipWithSym2 a6989586621679969561 a6989586621679969562 a6989586621679969563 Source #
Instances
(SingI d1, SingI d2) => SingI (ZipWithSym2 d1 d2 :: TyFun [b] [c] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing (ZipWithSym2 d1 d2) Source # | |
SuppressUnusedWarnings (ZipWithSym2 a6989586621679969561 a6989586621679969562 :: TyFun [b] [c] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (ZipWithSym2 a6989586621679969561 a6989586621679969562 :: TyFun [b] [c] -> Type) (a6989586621679969563 :: [b]) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (ZipWithSym2 a6989586621679969561 a6989586621679969562 :: TyFun [b] [c] -> Type) (a6989586621679969563 :: [b]) = ZipWithSym3 a6989586621679969561 a6989586621679969562 a6989586621679969563 |
type ZipWithSym3 (a6989586621679969561 :: (~>) a ((~>) b c)) (a6989586621679969562 :: [a]) (a6989586621679969563 :: [b]) = ZipWith a6989586621679969561 a6989586621679969562 a6989586621679969563 :: [c] Source #
data ZipWith3Sym0 a6989586621679969546 Source #
Instances
SingI (ZipWith3Sym0 :: TyFun (a ~> (b ~> (c ~> d))) ([a] ~> ([b] ~> ([c] ~> [d]))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing ZipWith3Sym0 Source # | |
SuppressUnusedWarnings (ZipWith3Sym0 :: TyFun (a ~> (b ~> (c ~> d))) ([a] ~> ([b] ~> ([c] ~> [d]))) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (ZipWith3Sym0 :: TyFun (a ~> (b ~> (c ~> d))) ([a] ~> ([b] ~> ([c] ~> [d]))) -> Type) (a6989586621679969546 :: a ~> (b ~> (c ~> d))) Source # | |
Defined in Data.Singletons.Prelude.List.Internal |
data ZipWith3Sym1 a6989586621679969546 a6989586621679969547 Source #
Instances
SingI d2 => SingI (ZipWith3Sym1 d2 :: TyFun [a] ([b] ~> ([c] ~> [d1])) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing (ZipWith3Sym1 d2) Source # | |
SuppressUnusedWarnings (ZipWith3Sym1 a6989586621679969546 :: TyFun [a] ([b] ~> ([c] ~> [d])) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (ZipWith3Sym1 a6989586621679969546 :: TyFun [a] ([b] ~> ([c] ~> [d])) -> Type) (a6989586621679969547 :: [a]) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (ZipWith3Sym1 a6989586621679969546 :: TyFun [a] ([b] ~> ([c] ~> [d])) -> Type) (a6989586621679969547 :: [a]) = ZipWith3Sym2 a6989586621679969546 a6989586621679969547 |
data ZipWith3Sym2 a6989586621679969546 a6989586621679969547 a6989586621679969548 Source #
Instances
(SingI d2, SingI d3) => SingI (ZipWith3Sym2 d2 d3 :: TyFun [b] ([c] ~> [d1]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing (ZipWith3Sym2 d2 d3) Source # | |
SuppressUnusedWarnings (ZipWith3Sym2 a6989586621679969546 a6989586621679969547 :: TyFun [b] ([c] ~> [d]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (ZipWith3Sym2 a6989586621679969546 a6989586621679969547 :: TyFun [b] ([c] ~> [d]) -> Type) (a6989586621679969548 :: [b]) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (ZipWith3Sym2 a6989586621679969546 a6989586621679969547 :: TyFun [b] ([c] ~> [d]) -> Type) (a6989586621679969548 :: [b]) = ZipWith3Sym3 a6989586621679969546 a6989586621679969547 a6989586621679969548 |
data ZipWith3Sym3 a6989586621679969546 a6989586621679969547 a6989586621679969548 a6989586621679969549 Source #
Instances
(SingI d2, SingI d3, SingI d4) => SingI (ZipWith3Sym3 d2 d3 d4 :: TyFun [c] [d1] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing (ZipWith3Sym3 d2 d3 d4) Source # | |
SuppressUnusedWarnings (ZipWith3Sym3 a6989586621679969546 a6989586621679969547 a6989586621679969548 :: TyFun [c] [d] -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (ZipWith3Sym3 a6989586621679969546 a6989586621679969547 a6989586621679969548 :: TyFun [c] [d] -> Type) (a6989586621679969549 :: [c]) Source # | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (ZipWith3Sym3 a6989586621679969546 a6989586621679969547 a6989586621679969548 :: TyFun [c] [d] -> Type) (a6989586621679969549 :: [c]) = ZipWith3Sym4 a6989586621679969546 a6989586621679969547 a6989586621679969548 a6989586621679969549 |
data UnzipSym0 a6989586621679969527 Source #
Instances
SingI (UnzipSym0 :: TyFun [(a, b)] ([a], [b]) -> Type) Source # | |
SuppressUnusedWarnings (UnzipSym0 :: TyFun [(a, b)] ([a], [b]) -> Type) Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply (UnzipSym0 :: TyFun [(a, b)] ([a], [b]) -> Type) (a6989586621679969527 :: [(a, b)]) Source # | |
type UnzipSym1 (a6989586621679969527 :: [(a, b)]) = Unzip a6989586621679969527 :: ([a], [b]) Source #
data UnlinesSym0 a6989586621679969412 Source #
Instances
SingI UnlinesSym0 Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing UnlinesSym0 Source # | |
SuppressUnusedWarnings UnlinesSym0 Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply UnlinesSym0 (a6989586621679969412 :: [Symbol]) Source # | |
Defined in Data.Singletons.Prelude.List.Internal |
type UnlinesSym1 (a6989586621679969412 :: [Symbol]) = Unlines a6989586621679969412 :: Symbol Source #
data UnwordsSym0 a6989586621679969402 Source #
Instances
SingI UnwordsSym0 Source # | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing UnwordsSym0 Source # | |
SuppressUnusedWarnings UnwordsSym0 Source # | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () Source # | |
type Apply UnwordsSym0 (a6989586621679969402 :: [Symbol]) Source # | |
Defined in Data.Singletons.Prelude.List.Internal |