-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/
-- | singletons-base uses singletons-th to define
-- promoted and singled functions from the base library,
-- including the Prelude. This library was originally presented in
-- Dependently Typed Programming with Singletons, published at the
-- Haskell Symposium, 2012.
-- (https://richarde.dev/papers/2012/singletons/paper.pdf) See
-- also the paper published at Haskell Symposium, 2014, which describes
-- how promotion works in greater detail:
-- https://richarde.dev/papers/2014/promotion/promotion.pdf. .
-- WARNING: singletons-base defines orphan instances for
-- Sing, SingKind, etc. for common types such as
-- Bool, [], Maybe, etc. If you define
-- instances of these types in your code, you will likely not be able to
-- use that code with singletons-base. .
-- singletons-base uses code that relies on bleeding-edge GHC
-- language extensions. As such, singletons-base only supports
-- the latest major version of GHC (currently GHC 9.12). For more
-- information, consult the singletons README. .
-- You may also be interested in the following related libraries: . * The
-- singletons library is a small, foundational library that
-- defines basic singleton-related types and definitions. . * The
-- singletons-th library defines Template Haskell functionality
-- that allows promotion of term-level functions to type-level
-- equivalents and singling functions to dependently typed
-- equivalents.
@package singletons-base
@version 3.5
-- | Defines a replacement for the promoted Error function whose
-- argument is kind-polymorphic.
module Data.Singletons.Base.PolyError
-- | Like Error from GHC.TypeLits.Singletons, but with an
-- argument that is generalized to be kind-polymorphic. This allows
-- passing additional information to the error besides raw
-- Symbols.
type family PolyError (arg :: a) :: b
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Singletons.Base.PolyError.PolyErrorSym0
-- | Defines functions and datatypes relating to the singleton for
-- Bool, including singled versions of all the definitions in
-- Data.Bool.
--
-- Because many of these definitions are produced by Template Haskell, it
-- is not possible to create proper Haddock documentation. Please look up
-- the corresponding operation in Data.Bool. Also, please excuse
-- the apparent repeated variable names. This is due to an interaction
-- between Template Haskell and Haddock.
module Data.Bool.Singletons
type family Sing :: k -> Type
data SBool (a :: Bool)
[SFalse] :: SBool 'False
[STrue] :: SBool 'True
-- | Type-level If. If True a b ==> a; If
-- False a b ==> b
type family If (cond :: Bool) (tru :: k) (fls :: k) :: k
-- | Conditional over singletons
sIf :: forall {k} (a :: Bool) (b :: k) (c :: k). Sing a -> Sing b -> Sing c -> Sing (If a b c)
-- | Type-level "not". An injective type family since 4.10.0.0.
type family Not (a :: Bool) = (res :: Bool) | res -> a
-- | Negation of a singleton
sNot :: forall (a :: Bool). Sing a -> Sing (Not a)
-- | Type-level "and"
type family (a :: Bool) && (b :: Bool) :: Bool
infixr 3 &&
-- | Type-level "or"
type family (a :: Bool) || (b :: Bool) :: Bool
infixr 2 ||
-- | Conjunction of singletons
(%&&) :: forall (a :: Bool) (b :: Bool). Sing a -> Sing b -> Sing (a && b)
infixr 3 %&&
-- | Disjunction of singletons
(%||) :: forall (a :: Bool) (b :: Bool). Sing a -> Sing b -> Sing (a || b)
infixr 2 %||
bool_ :: a -> a -> Bool -> a
type family Bool_ (a1 :: a) (a2 :: a) (a3 :: Bool) :: a
sBool_ :: forall a (t1 :: a) (t2 :: a) (t3 :: Bool). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Bool_ t1 t2 t3)
type family Otherwise :: Bool
sOtherwise :: Sing Otherwise
type family TrueSym0 :: Bool
type family FalseSym0 :: Bool
data IfSym0 (a :: TyFun Bool k ~> k ~> k)
data IfSym1 (a6989586621679124436 :: Bool) (b :: TyFun k k ~> k)
data IfSym2 (a6989586621679124436 :: Bool) (a6989586621679124437 :: k) (c :: TyFun k k)
type family IfSym3 (a6989586621679124436 :: Bool) (a6989586621679124437 :: k) (a6989586621679124438 :: k) :: k
data NotSym0 (a :: TyFun Bool Bool)
type family NotSym1 (a6989586621679124212 :: Bool) :: Bool
data (a :: TyFun Bool Bool ~> Bool) &&@#@$
infixr 3 &&@#@$
data (a6989586621679123502 :: Bool) &&@#@$$ (b :: TyFun Bool Bool)
infixr 3 &&@#@$$
type family (a6989586621679123502 :: Bool) &&@#@$$$ (a6989586621679123503 :: Bool) :: Bool
infixr 3 &&@#@$$$
data (a :: TyFun Bool Bool ~> Bool) ||@#@$
infixr 2 ||@#@$
data (a6989586621679123865 :: Bool) ||@#@$$ (b :: TyFun Bool Bool)
infixr 2 ||@#@$$
type family (a6989586621679123865 :: Bool) ||@#@$$$ (a6989586621679123866 :: Bool) :: Bool
infixr 2 ||@#@$$$
data Bool_Sym0 (a1 :: TyFun a a ~> Bool ~> a)
data Bool_Sym1 (a6989586621679122246 :: a) (b :: TyFun a Bool ~> a)
data Bool_Sym2 (a6989586621679122246 :: a) (a6989586621679122247 :: a) (c :: TyFun Bool a)
type family Bool_Sym3 (a6989586621679122246 :: a) (a6989586621679122247 :: a) (a6989586621679122248 :: Bool) :: a
type family OtherwiseSym0 :: Bool
instance Data.Singletons.SingI1 Data.Bool.Singletons.IfSym1
instance Data.Singletons.SingI1 Data.Bool.Singletons.Bool_Sym1
instance forall a (d :: a). Data.Singletons.SingI d => Data.Singletons.SingI1 (Data.Bool.Singletons.Bool_Sym2 d)
instance Data.Singletons.SingI c => Data.Singletons.SingI1 (Data.Bool.Singletons.IfSym2 c)
instance Data.Singletons.SingI2 Data.Bool.Singletons.IfSym2
instance Data.Singletons.SingI2 Data.Bool.Singletons.Bool_Sym2
instance Data.Singletons.SingI (Data.Bool.Singletons.&&@#@$)
instance Data.Singletons.SingI x => Data.Singletons.SingI ((Data.Bool.Singletons.&&@#@$$) x)
instance Data.Singletons.SingI Data.Bool.Singletons.Bool_Sym0
instance forall a (d :: a). Data.Singletons.SingI d => Data.Singletons.SingI (Data.Bool.Singletons.Bool_Sym1 d)
instance forall a (d1 :: a) (d2 :: a). (Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.Bool.Singletons.Bool_Sym2 d1 d2)
instance Data.Singletons.SingI Data.Bool.Singletons.IfSym0
instance Data.Singletons.SingI c => Data.Singletons.SingI (Data.Bool.Singletons.IfSym1 c)
instance forall k (c :: GHC.Types.Bool) (t :: k). (Data.Singletons.SingI c, Data.Singletons.SingI t) => Data.Singletons.SingI (Data.Bool.Singletons.IfSym2 c t)
instance Data.Singletons.SingI Data.Bool.Singletons.NotSym0
instance Data.Singletons.SingI (Data.Bool.Singletons.||@#@$)
instance Data.Singletons.SingI x => Data.Singletons.SingI ((Data.Bool.Singletons.||@#@$$) x)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Bool.Singletons.&&@#@$)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings ((Data.Bool.Singletons.&&@#@$$) a6989586621679123502)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Bool.Singletons.Bool_Sym0
instance forall a (a6989586621679122246 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Bool.Singletons.Bool_Sym1 a6989586621679122246)
instance forall a (a6989586621679122246 :: a) (a6989586621679122247 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Bool.Singletons.Bool_Sym2 a6989586621679122246 a6989586621679122247)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Bool.Singletons.IfSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Bool.Singletons.IfSym1 a6989586621679124436)
instance forall k (a6989586621679124436 :: GHC.Types.Bool) (a6989586621679124437 :: k). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Bool.Singletons.IfSym2 a6989586621679124436 a6989586621679124437)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Bool.Singletons.NotSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Bool.Singletons.||@#@$)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings ((Data.Bool.Singletons.||@#@$$) a6989586621679123865)
-- | Defines the promoted version of Eq, PEq, and the
-- singleton version, SEq. Also defines the DefaultEq type
-- family, which is useful for implementing boolean equality for
-- non-inductively defined data types.
module Data.Eq.Singletons
class PEq a where {
type (arg :: a) == (arg1 :: a) :: Bool;
type (arg :: a) /= (arg1 :: a) :: Bool;
type arg :: a == arg1 :: a = TFHelper_6989586621679128045 arg arg1;
type arg :: a /= arg1 :: a = TFHelper_6989586621679128034 arg arg1;
}
infix 4 ==
infix 4 /=
class SEq a
(%==) :: forall (t1 :: a) (t2 :: a). SEq a => Sing t1 -> Sing t2 -> Sing (t1 == t2)
($dm%==) :: forall (t1 :: a) (t2 :: a). (SEq a, (t1 == t2) ~ TFHelper_6989586621679128045 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 == t2)
(%/=) :: forall (t1 :: a) (t2 :: a). SEq a => Sing t1 -> Sing t2 -> Sing (t1 /= t2)
($dm%/=) :: forall (t1 :: a) (t2 :: a). (SEq a, (t1 /= t2) ~ TFHelper_6989586621679128034 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 /= t2)
infix 4 %==
infix 4 %/=
-- | One way to compute Boolean equality for types of any kind. This will
-- return True if the two arguments are known to be the same type
-- and False if they are known to be apart. Examples:
--
--
-- >>> DefaultEq Nothing Nothing
-- True
-- >>> DefaultEq Nothing (Just a)
-- False
-- >>> DefaultEq a a
-- True
--
--
-- DefaultEq is most suited for data types that are not
-- inductively defined. Four concrete examples of this are
-- Natural, Symbol, Char, and Type. One
-- cannot implement boolean equality for these types by pattern matching
-- alone, so DefaultEq is a good fit instead.
--
-- The downside to DefaultEq is that it can fail to reduce if it
-- is unable to determine if two types are equal or apart. Here is one
-- such example:
--
--
-- DefaultEq (Just a) (Just b)
--
--
-- What should this reduce to? It depends on what a and
-- b are. DefaultEq has no way of knowing what these two
-- types are, and as a result, this type will be stuck. This is a pitfall
-- that you can run into if you use DefaultEq to implement boolean
-- equality for an inductive data type like Maybe. For this
-- reason, it is usually recommended to implement boolean equality for
-- inductive data types using pattern matching and recursion, not
-- DefaultEq.
--
-- Note that this definition is slightly different from the (==)
-- type family from Data.Type.Equality in base, as
-- (==) attempts to distinguish applications of type constructors
-- from other types. As a result, a == a does not reduce to
-- True for every a, but DefaultEq a a
-- does reduce to True for every a. The latter
-- behavior is more desirable for singletons' purposes, so we
-- use it instead of (==).
type family DefaultEq (a :: k) (b :: k) :: Bool
data (a1 :: TyFun a a ~> Bool) ==@#@$
infix 4 ==@#@$
data (a6989586621679128025 :: a) ==@#@$$ (b :: TyFun a Bool)
infix 4 ==@#@$$
type family (a6989586621679128025 :: a) ==@#@$$$ (a6989586621679128026 :: a) :: Bool
infix 4 ==@#@$$$
data (a1 :: TyFun a a ~> Bool) /=@#@$
infix 4 /=@#@$
data (a6989586621679128030 :: a) /=@#@$$ (b :: TyFun a Bool)
infix 4 /=@#@$$
type family (a6989586621679128030 :: a) /=@#@$$$ (a6989586621679128031 :: a) :: Bool
infix 4 /=@#@$$$
data DefaultEqSym0 (a :: TyFun k k ~> Bool)
data DefaultEqSym1 (a6989586621679129674 :: k) (b :: TyFun k Bool)
type family DefaultEqSym2 (a6989586621679129674 :: k) (a6989586621679129675 :: k) :: Bool
instance Data.Eq.Singletons.PEq GHC.Types.Bool
instance Data.Eq.Singletons.PEq (GHC.Internal.Data.Either.Either a b)
instance Data.Eq.Singletons.PEq (GHC.Internal.Data.Functor.Identity.Identity a)
instance Data.Eq.Singletons.PEq [a]
instance Data.Eq.Singletons.PEq (GHC.Internal.Maybe.Maybe a)
instance Data.Eq.Singletons.PEq (GHC.Internal.Base.NonEmpty a)
instance Data.Eq.Singletons.PEq GHC.Types.Ordering
instance Data.Eq.Singletons.PEq (a, b)
instance Data.Eq.Singletons.PEq (a, b, c)
instance Data.Eq.Singletons.PEq (a, b, c, d)
instance Data.Eq.Singletons.PEq (a, b, c, d, e)
instance Data.Eq.Singletons.PEq (a, b, c, d, e, f)
instance Data.Eq.Singletons.PEq (a, b, c, d, e, f, g)
instance Data.Eq.Singletons.PEq ()
instance Data.Eq.Singletons.PEq GHC.Internal.Base.Void
instance Data.Eq.Singletons.SEq GHC.Types.Bool
instance (Data.Eq.Singletons.SEq a, Data.Eq.Singletons.SEq b) => Data.Eq.Singletons.SEq (GHC.Internal.Data.Either.Either a b)
instance Data.Eq.Singletons.SEq a => Data.Eq.Singletons.SEq (GHC.Internal.Data.Functor.Identity.Identity a)
instance (Data.Eq.Singletons.SEq a, Data.Eq.Singletons.SEq [a]) => Data.Eq.Singletons.SEq [a]
instance Data.Eq.Singletons.SEq a => Data.Eq.Singletons.SEq (GHC.Internal.Maybe.Maybe a)
instance (Data.Eq.Singletons.SEq a, Data.Eq.Singletons.SEq [a]) => Data.Eq.Singletons.SEq (GHC.Internal.Base.NonEmpty a)
instance Data.Eq.Singletons.SEq GHC.Types.Ordering
instance (Data.Eq.Singletons.SEq a, Data.Eq.Singletons.SEq b) => Data.Eq.Singletons.SEq (a, b)
instance (Data.Eq.Singletons.SEq a, Data.Eq.Singletons.SEq b, Data.Eq.Singletons.SEq c) => Data.Eq.Singletons.SEq (a, b, c)
instance (Data.Eq.Singletons.SEq a, Data.Eq.Singletons.SEq b, Data.Eq.Singletons.SEq c, Data.Eq.Singletons.SEq d) => Data.Eq.Singletons.SEq (a, b, c, d)
instance (Data.Eq.Singletons.SEq a, Data.Eq.Singletons.SEq b, Data.Eq.Singletons.SEq c, Data.Eq.Singletons.SEq d, Data.Eq.Singletons.SEq e) => Data.Eq.Singletons.SEq (a, b, c, d, e)
instance (Data.Eq.Singletons.SEq a, Data.Eq.Singletons.SEq b, Data.Eq.Singletons.SEq c, Data.Eq.Singletons.SEq d, Data.Eq.Singletons.SEq e, Data.Eq.Singletons.SEq f) => Data.Eq.Singletons.SEq (a, b, c, d, e, f)
instance (Data.Eq.Singletons.SEq a, Data.Eq.Singletons.SEq b, Data.Eq.Singletons.SEq c, Data.Eq.Singletons.SEq d, Data.Eq.Singletons.SEq e, Data.Eq.Singletons.SEq f, Data.Eq.Singletons.SEq g) => Data.Eq.Singletons.SEq (a, b, c, d, e, f, g)
instance Data.Eq.Singletons.SEq ()
instance Data.Eq.Singletons.SEq GHC.Internal.Base.Void
instance Data.Eq.Singletons.SEq a => Data.Singletons.SingI1 (Data.Eq.Singletons./=@#@$$)
instance Data.Eq.Singletons.SEq a => Data.Singletons.SingI1 (Data.Eq.Singletons.==@#@$$)
instance Data.Eq.Singletons.SEq a => Data.Singletons.SingI (Data.Eq.Singletons./=@#@$)
instance forall a (d :: a). (Data.Eq.Singletons.SEq a, Data.Singletons.SingI d) => Data.Singletons.SingI ((Data.Eq.Singletons./=@#@$$) d)
instance Data.Eq.Singletons.SEq a => Data.Singletons.SingI (Data.Eq.Singletons.==@#@$)
instance forall a (d :: a). (Data.Eq.Singletons.SEq a, Data.Singletons.SingI d) => Data.Singletons.SingI ((Data.Eq.Singletons.==@#@$$) d)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Eq.Singletons./=@#@$)
instance forall a (a6989586621679128030 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings ((Data.Eq.Singletons./=@#@$$) a6989586621679128030)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Eq.Singletons.==@#@$)
instance forall a (a6989586621679128025 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings ((Data.Eq.Singletons.==@#@$$) a6989586621679128025)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Eq.Singletons.DefaultEqSym0
instance forall k (a6989586621679129674 :: k). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Eq.Singletons.DefaultEqSym1 a6989586621679129674)
-- | This module defines singleton instances making TypeRep the
-- singleton for the kind TYPE rep (for some
-- RuntimeRep rep), an instantiation of which is the
-- famous kind Type. The definitions don't fully line up with what
-- is expected within the singletons library, so expect unusual results!
module Data.Singletons.Base.TypeRepTYPE
type family Sing :: k -> Type
-- | A variant of SomeTypeRep whose underlying TypeRep is
-- restricted to kind TYPE rep (for some
-- RuntimeRep rep).
data SomeTypeRepTYPE (a :: RuntimeRep)
[SomeTypeRepTYPE] :: forall (a :: RuntimeRep) (a1 :: TYPE a). !TypeRep a1 -> SomeTypeRepTYPE a
instance GHC.Classes.Eq (Data.Singletons.Base.TypeRepTYPE.SomeTypeRepTYPE GHC.Types.LiftedRep)
instance GHC.Classes.Ord (Data.Singletons.Base.TypeRepTYPE.SomeTypeRepTYPE GHC.Types.LiftedRep)
instance Data.Eq.Singletons.PEq (*)
instance Data.Singletons.Decide.SDecide (*)
instance Data.Eq.Singletons.SEq (*)
instance GHC.Internal.Show.Show (Data.Singletons.Base.TypeRepTYPE.SomeTypeRepTYPE GHC.Types.LiftedRep)
instance GHC.Internal.Data.Typeable.Internal.Typeable a => Data.Singletons.SingI a
instance Data.Singletons.SingKind (*)
-- | Defines functions and datatypes relating to the singleton for tuples,
-- including singled versions of all the definitions in
-- Data.Tuple.
--
-- Because many of these definitions are produced by Template Haskell, it
-- is not possible to create proper Haddock documentation. Please look up
-- the corresponding operation in Data.Tuple. Also, please
-- excuse the apparent repeated variable names. This is due to an
-- interaction between Template Haskell and Haddock.
module Data.Tuple.Singletons
type family Sing :: k -> Type
data STuple0 (a :: ())
[STuple0] :: STuple0 '()
data STuple2 (a1 :: (a, b))
[STuple2] :: forall a b (n1 :: a) (n2 :: b). Sing n1 -> Sing n2 -> STuple2 '(n1, n2)
data STuple3 (a1 :: (a, b, c))
[STuple3] :: forall a b c (n1 :: a) (n2 :: b) (n3 :: c). Sing n1 -> Sing n2 -> Sing n3 -> STuple3 '(n1, n2, n3)
data STuple4 (a1 :: (a, b, c, d))
[STuple4] :: forall a b c d (n1 :: a) (n2 :: b) (n3 :: c) (n4 :: d). Sing n1 -> Sing n2 -> Sing n3 -> Sing n4 -> STuple4 '(n1, n2, n3, n4)
data STuple5 (a1 :: (a, b, c, d, e))
[STuple5] :: forall a b c d e (n1 :: a) (n2 :: b) (n3 :: c) (n4 :: d) (n5 :: e). Sing n1 -> Sing n2 -> Sing n3 -> Sing n4 -> Sing n5 -> STuple5 '(n1, n2, n3, n4, n5)
data STuple6 (a1 :: (a, b, c, d, e, f))
[STuple6] :: forall a b c d e f (n1 :: a) (n2 :: b) (n3 :: c) (n4 :: d) (n5 :: e) (n6 :: f). Sing n1 -> Sing n2 -> Sing n3 -> Sing n4 -> Sing n5 -> Sing n6 -> STuple6 '(n1, n2, n3, n4, n5, n6)
data STuple7 (a1 :: (a, b, c, d, e, f, g))
[STuple7] :: forall a b c d e f g (n1 :: a) (n2 :: b) (n3 :: c) (n4 :: d) (n5 :: e) (n6 :: f) (n7 :: g). Sing n1 -> Sing n2 -> Sing n3 -> Sing n4 -> Sing n5 -> Sing n6 -> Sing n7 -> STuple7 '(n1, n2, n3, n4, n5, n6, n7)
type family Fst (a1 :: (a, b)) :: a
sFst :: forall a b (t :: (a, b)). Sing t -> Sing (Fst t)
type family Snd (a1 :: (a, b)) :: b
sSnd :: forall a b (t :: (a, b)). Sing t -> Sing (Snd t)
type family Curry (a1 :: (a, b) ~> c) (a2 :: a) (a3 :: b) :: c
sCurry :: forall a b c (t1 :: (a, b) ~> c) (t2 :: a) (t3 :: b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Curry t1 t2 t3)
type family Uncurry (a1 :: a ~> b ~> c) (a2 :: (a, b)) :: c
sUncurry :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: (a, b)). Sing t1 -> Sing t2 -> Sing (Uncurry t1 t2)
type family Swap (a1 :: (a, b)) :: (b, a)
sSwap :: forall a b (t :: (a, b)). Sing t -> Sing (Swap t)
type family Tuple0Sym0 :: ()
data Tuple2Sym0 (a1 :: TyFun a b ~> (a, b))
data Tuple2Sym1 (a6989586621679050782 :: a) (b1 :: TyFun b (a, b))
type family Tuple2Sym2 (a6989586621679050782 :: a) (a6989586621679050783 :: b) :: (a, b)
data Tuple3Sym0 (a1 :: TyFun a b ~> c ~> (a, b, c))
data Tuple3Sym1 (a6989586621679050813 :: a) (b1 :: TyFun b c ~> (a, b, c))
data Tuple3Sym2 (a6989586621679050813 :: a) (a6989586621679050814 :: b) (c1 :: TyFun c (a, b, c))
type family Tuple3Sym3 (a6989586621679050813 :: a) (a6989586621679050814 :: b) (a6989586621679050815 :: c) :: (a, b, c)
data Tuple4Sym0 (a1 :: TyFun a b ~> c ~> d ~> (a, b, c, d))
data Tuple4Sym1 (a6989586621679050862 :: a) (b1 :: TyFun b c ~> d ~> (a, b, c, d))
data Tuple4Sym2 (a6989586621679050862 :: a) (a6989586621679050863 :: b) (c1 :: TyFun c d ~> (a, b, c, d))
data Tuple4Sym3 (a6989586621679050862 :: a) (a6989586621679050863 :: b) (a6989586621679050864 :: c) (d1 :: TyFun d (a, b, c, d))
type family Tuple4Sym4 (a6989586621679050862 :: a) (a6989586621679050863 :: b) (a6989586621679050864 :: c) (a6989586621679050865 :: d) :: (a, b, c, d)
data Tuple5Sym0 (a1 :: TyFun a b ~> c ~> d ~> e ~> (a, b, c, d, e))
data Tuple5Sym1 (a6989586621679050931 :: a) (b1 :: TyFun b c ~> d ~> e ~> (a, b, c, d, e))
data Tuple5Sym2 (a6989586621679050931 :: a) (a6989586621679050932 :: b) (c1 :: TyFun c d ~> e ~> (a, b, c, d, e))
data Tuple5Sym3 (a6989586621679050931 :: a) (a6989586621679050932 :: b) (a6989586621679050933 :: c) (d1 :: TyFun d e ~> (a, b, c, d, e))
data Tuple5Sym4 (a6989586621679050931 :: a) (a6989586621679050932 :: b) (a6989586621679050933 :: c) (a6989586621679050934 :: d) (e1 :: TyFun e (a, b, c, d, e))
type family Tuple5Sym5 (a6989586621679050931 :: a) (a6989586621679050932 :: b) (a6989586621679050933 :: c) (a6989586621679050934 :: d) (a6989586621679050935 :: e) :: (a, b, c, d, e)
data Tuple6Sym0 (a1 :: TyFun a b ~> c ~> d ~> e ~> f ~> (a, b, c, d, e, f))
data Tuple6Sym1 (a6989586621679051022 :: a) (b1 :: TyFun b c ~> d ~> e ~> f ~> (a, b, c, d, e, f))
data Tuple6Sym2 (a6989586621679051022 :: a) (a6989586621679051023 :: b) (c1 :: TyFun c d ~> e ~> f ~> (a, b, c, d, e, f))
data Tuple6Sym3 (a6989586621679051022 :: a) (a6989586621679051023 :: b) (a6989586621679051024 :: c) (d1 :: TyFun d e ~> f ~> (a, b, c, d, e, f))
data Tuple6Sym4 (a6989586621679051022 :: a) (a6989586621679051023 :: b) (a6989586621679051024 :: c) (a6989586621679051025 :: d) (e1 :: TyFun e f ~> (a, b, c, d, e, f))
data Tuple6Sym5 (a6989586621679051022 :: a) (a6989586621679051023 :: b) (a6989586621679051024 :: c) (a6989586621679051025 :: d) (a6989586621679051026 :: e) (f1 :: TyFun f (a, b, c, d, e, f))
type family Tuple6Sym6 (a6989586621679051022 :: a) (a6989586621679051023 :: b) (a6989586621679051024 :: c) (a6989586621679051025 :: d) (a6989586621679051026 :: e) (a6989586621679051027 :: f) :: (a, b, c, d, e, f)
data Tuple7Sym0 (a1 :: TyFun a b ~> c ~> d ~> e ~> f ~> g ~> (a, b, c, d, e, f, g))
data Tuple7Sym1 (a6989586621679051137 :: a) (b1 :: TyFun b c ~> d ~> e ~> f ~> g ~> (a, b, c, d, e, f, g))
data Tuple7Sym2 (a6989586621679051137 :: a) (a6989586621679051138 :: b) (c1 :: TyFun c d ~> e ~> f ~> g ~> (a, b, c, d, e, f, g))
data Tuple7Sym3 (a6989586621679051137 :: a) (a6989586621679051138 :: b) (a6989586621679051139 :: c) (d1 :: TyFun d e ~> f ~> g ~> (a, b, c, d, e, f, g))
data Tuple7Sym4 (a6989586621679051137 :: a) (a6989586621679051138 :: b) (a6989586621679051139 :: c) (a6989586621679051140 :: d) (e1 :: TyFun e f ~> g ~> (a, b, c, d, e, f, g))
data Tuple7Sym5 (a6989586621679051137 :: a) (a6989586621679051138 :: b) (a6989586621679051139 :: c) (a6989586621679051140 :: d) (a6989586621679051141 :: e) (f1 :: TyFun f g ~> (a, b, c, d, e, f, g))
data Tuple7Sym6 (a6989586621679051137 :: a) (a6989586621679051138 :: b) (a6989586621679051139 :: c) (a6989586621679051140 :: d) (a6989586621679051141 :: e) (a6989586621679051142 :: f) (g1 :: TyFun g (a, b, c, d, e, f, g))
type family Tuple7Sym7 (a6989586621679051137 :: a) (a6989586621679051138 :: b) (a6989586621679051139 :: c) (a6989586621679051140 :: d) (a6989586621679051141 :: e) (a6989586621679051142 :: f) (a6989586621679051143 :: g) :: (a, b, c, d, e, f, g)
data FstSym0 (a1 :: TyFun (a, b) a)
type family FstSym1 (a6989586621679147673 :: (a, b)) :: a
data SndSym0 (a1 :: TyFun (a, b) b)
type family SndSym1 (a6989586621679147669 :: (a, b)) :: b
data CurrySym0 (a1 :: TyFun (a, b) ~> c a ~> b ~> c)
data CurrySym1 (a6989586621679147661 :: (a, b) ~> c) (b1 :: TyFun a b ~> c)
data CurrySym2 (a6989586621679147661 :: (a, b) ~> c) (a6989586621679147662 :: a) (c1 :: TyFun b c)
type family CurrySym3 (a6989586621679147661 :: (a, b) ~> c) (a6989586621679147662 :: a) (a6989586621679147663 :: b) :: c
data UncurrySym0 (a1 :: TyFun a ~> b ~> c (a, b) ~> c)
data UncurrySym1 (a6989586621679147653 :: a ~> b ~> c) (b1 :: TyFun (a, b) c)
type family UncurrySym2 (a6989586621679147653 :: a ~> b ~> c) (a6989586621679147654 :: (a, b)) :: c
data SwapSym0 (a1 :: TyFun (a, b) (b, a))
type family SwapSym1 (a6989586621679147647 :: (a, b)) :: (b, a)
instance Data.Singletons.SingI1 Data.Tuple.Singletons.CurrySym1
instance Data.Singletons.SingI1 Data.Tuple.Singletons.UncurrySym1
instance forall a b c (d :: (a, b) Data.Singletons.~> c). Data.Singletons.SingI d => Data.Singletons.SingI1 (Data.Tuple.Singletons.CurrySym2 d)
instance Data.Singletons.SingI2 Data.Tuple.Singletons.CurrySym2
instance Data.Singletons.SingI Data.Tuple.Singletons.CurrySym0
instance forall a b c (d :: (a, b) Data.Singletons.~> c). Data.Singletons.SingI d => Data.Singletons.SingI (Data.Tuple.Singletons.CurrySym1 d)
instance forall a b c (d1 :: (a, b) Data.Singletons.~> c) (d2 :: a). (Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.Tuple.Singletons.CurrySym2 d1 d2)
instance Data.Singletons.SingI Data.Tuple.Singletons.FstSym0
instance Data.Singletons.SingI Data.Tuple.Singletons.SndSym0
instance Data.Singletons.SingI Data.Tuple.Singletons.SwapSym0
instance Data.Singletons.SingI Data.Tuple.Singletons.UncurrySym0
instance forall a b c (d :: a Data.Singletons.~> (b Data.Singletons.~> c)). Data.Singletons.SingI d => Data.Singletons.SingI (Data.Tuple.Singletons.UncurrySym1 d)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Tuple.Singletons.CurrySym0
instance forall a b c (a6989586621679147661 :: (a, b) Data.Singletons.~> c). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Tuple.Singletons.CurrySym1 a6989586621679147661)
instance forall a b c (a6989586621679147661 :: (a, b) Data.Singletons.~> c) (a6989586621679147662 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Tuple.Singletons.CurrySym2 a6989586621679147661 a6989586621679147662)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Tuple.Singletons.FstSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Tuple.Singletons.SndSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Tuple.Singletons.SwapSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Tuple.Singletons.UncurrySym0
instance forall a b c (a6989586621679147653 :: a Data.Singletons.~> (b Data.Singletons.~> c)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Tuple.Singletons.UncurrySym1 a6989586621679147653)
-- | Defines functions and datatypes relating to the singleton for
-- Void, including singled versions of all the definitions in
-- Data.Void.
--
-- Because many of these definitions are produced by Template Haskell, it
-- is not possible to create proper Haddock documentation. Please look up
-- the corresponding operation in Data.Void. Also, please excuse
-- the apparent repeated variable names. This is due to an interaction
-- between Template Haskell and Haddock.
module Data.Void.Singletons
type family Sing :: k -> Type
data SVoid (a :: Void)
type family Absurd (a1 :: Void) :: a
sAbsurd :: forall a (t :: Void). Sing t -> Sing (Absurd t :: a)
data AbsurdSym0 (a1 :: TyFun Void a)
type family AbsurdSym1 (a6989586621679152715 :: Void) :: a
instance Data.Singletons.SingI Data.Void.Singletons.AbsurdSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Void.Singletons.AbsurdSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Void.Singletons.LamCases_6989586621679152717Sym0 a6989586621679152716)
-- | Defines the promoted version of Ord, POrd, and the singleton
-- version, SOrd.
module Data.Ord.Singletons
class POrd a where {
type Compare (arg :: a) (arg1 :: a) :: Ordering;
type (arg :: a) < (arg1 :: a) :: Bool;
type (arg :: a) <= (arg1 :: a) :: Bool;
type (arg :: a) > (arg1 :: a) :: Bool;
type (arg :: a) >= (arg1 :: a) :: Bool;
type Max (arg :: a) (arg1 :: a) :: a;
type Min (arg :: a) (arg1 :: a) :: a;
type Compare arg :: a arg1 :: a = Compare_6989586621679190000 arg arg1;
type arg :: a < arg1 :: a = TFHelper_6989586621679190021 arg arg1;
type arg :: a <= arg1 :: a = TFHelper_6989586621679190037 arg arg1;
type arg :: a > arg1 :: a = TFHelper_6989586621679190053 arg arg1;
type arg :: a >= arg1 :: a = TFHelper_6989586621679190069 arg arg1;
type Max arg :: a arg1 :: a = Max_6989586621679190085 arg arg1;
type Min arg :: a arg1 :: a = Min_6989586621679190101 arg arg1;
}
infix 4 <
infix 4 <=
infix 4 >
infix 4 >=
class SEq a => SOrd a
sCompare :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (Compare t1 t2)
($dmsCompare) :: forall (t1 :: a) (t2 :: a). (SOrd a, Compare t1 t2 ~ Compare_6989586621679190000 t1 t2) => Sing t1 -> Sing t2 -> Sing (Compare t1 t2)
(%<) :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (t1 < t2)
($dm%<) :: forall (t1 :: a) (t2 :: a). (SOrd a, (t1 < t2) ~ TFHelper_6989586621679190021 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 < t2)
(%<=) :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (t1 <= t2)
($dm%<=) :: forall (t1 :: a) (t2 :: a). (SOrd a, (t1 <= t2) ~ TFHelper_6989586621679190037 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 <= t2)
(%>) :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (t1 > t2)
($dm%>) :: forall (t1 :: a) (t2 :: a). (SOrd a, (t1 > t2) ~ TFHelper_6989586621679190053 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 > t2)
(%>=) :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (t1 >= t2)
($dm%>=) :: forall (t1 :: a) (t2 :: a). (SOrd a, (t1 >= t2) ~ TFHelper_6989586621679190069 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 >= t2)
sMax :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (Max t1 t2)
($dmsMax) :: forall (t1 :: a) (t2 :: a). (SOrd a, Max t1 t2 ~ Max_6989586621679190085 t1 t2) => Sing t1 -> Sing t2 -> Sing (Max t1 t2)
sMin :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (Min t1 t2)
($dmsMin) :: forall (t1 :: a) (t2 :: a). (SOrd a, Min t1 t2 ~ Min_6989586621679190101 t1 t2) => Sing t1 -> Sing t2 -> Sing (Min t1 t2)
infix 4 %<
infix 4 %<=
infix 4 %>
infix 4 %>=
type family Comparing (a1 :: b ~> a) (a2 :: b) (a3 :: b) :: Ordering
sComparing :: forall b a (t1 :: b ~> a) (t2 :: b) (t3 :: b). SOrd a => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Comparing t1 t2 t3)
type family Sing :: k -> Type
data SOrdering (a :: Ordering)
[SLT] :: SOrdering 'LT
[SEQ] :: SOrdering 'EQ
[SGT] :: SOrdering 'GT
data SDown (a1 :: Down a)
[SDown] :: forall a (n :: a). Sing n -> SDown ('Down n)
type family GetDown (a1 :: Down a) :: a
sGetDown :: forall a (t :: Down a). Sing t -> Sing (GetDown t)
type family LTSym0 :: Ordering
type family EQSym0 :: Ordering
type family GTSym0 :: Ordering
data CompareSym0 (a1 :: TyFun a a ~> Ordering)
data CompareSym1 (a6989586621679189966 :: a) (b :: TyFun a Ordering)
type family CompareSym2 (a6989586621679189966 :: a) (a6989586621679189967 :: a) :: Ordering
data (a1 :: TyFun a a ~> Bool) <@#@$
infix 4 <@#@$
data (a6989586621679189971 :: a) <@#@$$ (b :: TyFun a Bool)
infix 4 <@#@$$
type family (a6989586621679189971 :: a) <@#@$$$ (a6989586621679189972 :: a) :: Bool
infix 4 <@#@$$$
data (a1 :: TyFun a a ~> Bool) <=@#@$
infix 4 <=@#@$
data (a6989586621679189976 :: a) <=@#@$$ (b :: TyFun a Bool)
infix 4 <=@#@$$
type family (a6989586621679189976 :: a) <=@#@$$$ (a6989586621679189977 :: a) :: Bool
infix 4 <=@#@$$$
data (a1 :: TyFun a a ~> Bool) >@#@$
infix 4 >@#@$
data (a6989586621679189981 :: a) >@#@$$ (b :: TyFun a Bool)
infix 4 >@#@$$
type family (a6989586621679189981 :: a) >@#@$$$ (a6989586621679189982 :: a) :: Bool
infix 4 >@#@$$$
data (a1 :: TyFun a a ~> Bool) >=@#@$
infix 4 >=@#@$
data (a6989586621679189986 :: a) >=@#@$$ (b :: TyFun a Bool)
infix 4 >=@#@$$
type family (a6989586621679189986 :: a) >=@#@$$$ (a6989586621679189987 :: a) :: Bool
infix 4 >=@#@$$$
data MaxSym0 (a1 :: TyFun a a ~> a)
data MaxSym1 (a6989586621679189991 :: a) (b :: TyFun a a)
type family MaxSym2 (a6989586621679189991 :: a) (a6989586621679189992 :: a) :: a
data MinSym0 (a1 :: TyFun a a ~> a)
data MinSym1 (a6989586621679189996 :: a) (b :: TyFun a a)
type family MinSym2 (a6989586621679189996 :: a) (a6989586621679189997 :: a) :: a
data ComparingSym0 (a1 :: TyFun b ~> a b ~> b ~> Ordering)
data ComparingSym1 (a6989586621679189957 :: b ~> a) (b1 :: TyFun b b ~> Ordering)
data ComparingSym2 (a6989586621679189957 :: b ~> a) (a6989586621679189958 :: b) (c :: TyFun b Ordering)
type family ComparingSym3 (a6989586621679189957 :: b ~> a) (a6989586621679189958 :: b) (a6989586621679189959 :: b) :: Ordering
data DownSym0 (a1 :: TyFun a Down a)
type family DownSym1 (a6989586621679198735 :: a) :: Down a
data GetDownSym0 (a1 :: TyFun Down a a)
type family GetDownSym1 (a6989586621679198738 :: Down a) :: a
instance forall a (z :: GHC.Internal.Data.Ord.Down a). GHC.Classes.Eq (Data.Ord.Singletons.SDown z)
instance Data.Eq.Singletons.PEq (GHC.Internal.Data.Ord.Down a)
instance Data.Ord.Singletons.POrd GHC.Types.Bool
instance Data.Ord.Singletons.POrd (GHC.Internal.Data.Ord.Down a)
instance Data.Ord.Singletons.POrd (GHC.Internal.Data.Either.Either a b)
instance Data.Ord.Singletons.POrd (GHC.Internal.Data.Functor.Identity.Identity a)
instance Data.Ord.Singletons.POrd [a]
instance Data.Ord.Singletons.POrd (GHC.Internal.Maybe.Maybe a)
instance Data.Ord.Singletons.POrd (GHC.Internal.Base.NonEmpty a)
instance Data.Ord.Singletons.POrd GHC.Types.Ordering
instance Data.Ord.Singletons.POrd (a, b)
instance Data.Ord.Singletons.POrd (a, b, c)
instance Data.Ord.Singletons.POrd (a, b, c, d)
instance Data.Ord.Singletons.POrd (a, b, c, d, e)
instance Data.Ord.Singletons.POrd (a, b, c, d, e, f)
instance Data.Ord.Singletons.POrd (a, b, c, d, e, f, g)
instance Data.Ord.Singletons.POrd ()
instance Data.Ord.Singletons.POrd GHC.Internal.Base.Void
instance Data.Semigroup.Singletons.Internal.Classes.PSemigroup (GHC.Internal.Data.Ord.Down a)
instance Data.Singletons.Decide.SDecide a => Data.Singletons.Decide.SDecide (GHC.Internal.Data.Ord.Down a)
instance Data.Eq.Singletons.SEq a => Data.Eq.Singletons.SEq (GHC.Internal.Data.Ord.Down a)
instance Data.Ord.Singletons.SOrd GHC.Types.Bool
instance Data.Ord.Singletons.SOrd a => Data.Ord.Singletons.SOrd (GHC.Internal.Data.Ord.Down a)
instance (Data.Ord.Singletons.SOrd a, Data.Ord.Singletons.SOrd b) => Data.Ord.Singletons.SOrd (GHC.Internal.Data.Either.Either a b)
instance Data.Ord.Singletons.SOrd a => Data.Ord.Singletons.SOrd (GHC.Internal.Data.Functor.Identity.Identity a)
instance (Data.Ord.Singletons.SOrd a, Data.Ord.Singletons.SOrd [a]) => Data.Ord.Singletons.SOrd [a]
instance Data.Ord.Singletons.SOrd a => Data.Ord.Singletons.SOrd (GHC.Internal.Maybe.Maybe a)
instance (Data.Ord.Singletons.SOrd a, Data.Ord.Singletons.SOrd [a]) => Data.Ord.Singletons.SOrd (GHC.Internal.Base.NonEmpty a)
instance Data.Ord.Singletons.SOrd GHC.Types.Ordering
instance (Data.Ord.Singletons.SOrd a, Data.Ord.Singletons.SOrd b) => Data.Ord.Singletons.SOrd (a, b)
instance (Data.Ord.Singletons.SOrd a, Data.Ord.Singletons.SOrd b, Data.Ord.Singletons.SOrd c) => Data.Ord.Singletons.SOrd (a, b, c)
instance (Data.Ord.Singletons.SOrd a, Data.Ord.Singletons.SOrd b, Data.Ord.Singletons.SOrd c, Data.Ord.Singletons.SOrd d) => Data.Ord.Singletons.SOrd (a, b, c, d)
instance (Data.Ord.Singletons.SOrd a, Data.Ord.Singletons.SOrd b, Data.Ord.Singletons.SOrd c, Data.Ord.Singletons.SOrd d, Data.Ord.Singletons.SOrd e) => Data.Ord.Singletons.SOrd (a, b, c, d, e)
instance (Data.Ord.Singletons.SOrd a, Data.Ord.Singletons.SOrd b, Data.Ord.Singletons.SOrd c, Data.Ord.Singletons.SOrd d, Data.Ord.Singletons.SOrd e, Data.Ord.Singletons.SOrd f) => Data.Ord.Singletons.SOrd (a, b, c, d, e, f)
instance (Data.Ord.Singletons.SOrd a, Data.Ord.Singletons.SOrd b, Data.Ord.Singletons.SOrd c, Data.Ord.Singletons.SOrd d, Data.Ord.Singletons.SOrd e, Data.Ord.Singletons.SOrd f, Data.Ord.Singletons.SOrd g) => Data.Ord.Singletons.SOrd (a, b, c, d, e, f, g)
instance Data.Ord.Singletons.SOrd ()
instance Data.Ord.Singletons.SOrd GHC.Internal.Base.Void
instance Data.Semigroup.Singletons.Internal.Classes.SSemigroup a => Data.Semigroup.Singletons.Internal.Classes.SSemigroup (GHC.Internal.Data.Ord.Down a)
instance Data.Ord.Singletons.SOrd a => Data.Singletons.SingI1 Data.Ord.Singletons.ComparingSym1
instance Data.Ord.Singletons.SOrd a => Data.Singletons.SingI1 (Data.Ord.Singletons.<=@#@$$)
instance Data.Ord.Singletons.SOrd a => Data.Singletons.SingI1 (Data.Ord.Singletons.<@#@$$)
instance Data.Ord.Singletons.SOrd a => Data.Singletons.SingI1 (Data.Ord.Singletons.>=@#@$$)
instance Data.Ord.Singletons.SOrd a => Data.Singletons.SingI1 (Data.Ord.Singletons.>@#@$$)
instance Data.Ord.Singletons.SOrd a => Data.Singletons.SingI1 Data.Ord.Singletons.CompareSym1
instance Data.Ord.Singletons.SOrd a => Data.Singletons.SingI1 Data.Ord.Singletons.MaxSym1
instance Data.Ord.Singletons.SOrd a => Data.Singletons.SingI1 Data.Ord.Singletons.MinSym1
instance forall a b (d :: b Data.Singletons.~> a). (Data.Ord.Singletons.SOrd a, Data.Singletons.SingI d) => Data.Singletons.SingI1 (Data.Ord.Singletons.ComparingSym2 d)
instance Data.Singletons.SingI1 'GHC.Internal.Data.Ord.Down
instance Data.Ord.Singletons.SOrd a => Data.Singletons.SingI2 Data.Ord.Singletons.ComparingSym2
instance forall a (n :: a). Data.Singletons.SingI n => Data.Singletons.SingI ('GHC.Internal.Data.Ord.Down n)
instance Data.Ord.Singletons.SOrd a => Data.Singletons.SingI (Data.Ord.Singletons.<=@#@$)
instance forall a (d :: a). (Data.Ord.Singletons.SOrd a, Data.Singletons.SingI d) => Data.Singletons.SingI ((Data.Ord.Singletons.<=@#@$$) d)
instance Data.Ord.Singletons.SOrd a => Data.Singletons.SingI (Data.Ord.Singletons.<@#@$)
instance forall a (d :: a). (Data.Ord.Singletons.SOrd a, Data.Singletons.SingI d) => Data.Singletons.SingI ((Data.Ord.Singletons.<@#@$$) d)
instance Data.Ord.Singletons.SOrd a => Data.Singletons.SingI (Data.Ord.Singletons.>=@#@$)
instance forall a (d :: a). (Data.Ord.Singletons.SOrd a, Data.Singletons.SingI d) => Data.Singletons.SingI ((Data.Ord.Singletons.>=@#@$$) d)
instance Data.Ord.Singletons.SOrd a => Data.Singletons.SingI (Data.Ord.Singletons.>@#@$)
instance forall a (d :: a). (Data.Ord.Singletons.SOrd a, Data.Singletons.SingI d) => Data.Singletons.SingI ((Data.Ord.Singletons.>@#@$$) d)
instance Data.Ord.Singletons.SOrd a => Data.Singletons.SingI Data.Ord.Singletons.CompareSym0
instance forall a (d :: a). (Data.Ord.Singletons.SOrd a, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Ord.Singletons.CompareSym1 d)
instance Data.Ord.Singletons.SOrd a => Data.Singletons.SingI Data.Ord.Singletons.ComparingSym0
instance forall a b (d :: b Data.Singletons.~> a). (Data.Ord.Singletons.SOrd a, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Ord.Singletons.ComparingSym1 d)
instance forall a b (d1 :: b Data.Singletons.~> a) (d2 :: b). (Data.Ord.Singletons.SOrd a, Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.Ord.Singletons.ComparingSym2 d1 d2)
instance Data.Singletons.SingI Data.Ord.Singletons.DownSym0
instance Data.Singletons.SingI Data.Ord.Singletons.GetDownSym0
instance Data.Ord.Singletons.SOrd a => Data.Singletons.SingI Data.Ord.Singletons.MaxSym0
instance forall a (d :: a). (Data.Ord.Singletons.SOrd a, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Ord.Singletons.MaxSym1 d)
instance Data.Ord.Singletons.SOrd a => Data.Singletons.SingI Data.Ord.Singletons.MinSym0
instance forall a (d :: a). (Data.Ord.Singletons.SOrd a, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Ord.Singletons.MinSym1 d)
instance Data.Singletons.SingKind a => Data.Singletons.SingKind (GHC.Internal.Data.Ord.Down a)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Ord.Singletons.<=@#@$)
instance forall a (a6989586621679189976 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings ((Data.Ord.Singletons.<=@#@$$) a6989586621679189976)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Ord.Singletons.<@#@$)
instance forall a (a6989586621679189971 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings ((Data.Ord.Singletons.<@#@$$) a6989586621679189971)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Ord.Singletons.>=@#@$)
instance forall a (a6989586621679189986 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings ((Data.Ord.Singletons.>=@#@$$) a6989586621679189986)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Ord.Singletons.>@#@$)
instance forall a (a6989586621679189981 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings ((Data.Ord.Singletons.>@#@$$) a6989586621679189981)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Ord.Singletons.CompareSym0
instance forall a (a6989586621679189966 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Ord.Singletons.CompareSym1 a6989586621679189966)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Ord.Singletons.ComparingSym0
instance forall b a (a6989586621679189957 :: b Data.Singletons.~> a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Ord.Singletons.ComparingSym1 a6989586621679189957)
instance forall b a (a6989586621679189957 :: b Data.Singletons.~> a) (a6989586621679189958 :: b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Ord.Singletons.ComparingSym2 a6989586621679189957 a6989586621679189958)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Ord.Singletons.DownSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Ord.Singletons.GetDownSym0
instance forall a6989586621679188363 (x6989586621679190007 :: a6989586621679188363) (y6989586621679190008 :: a6989586621679188363). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Ord.Singletons.LamCases_6989586621679190009Sym0 a6989586621679188363 x6989586621679190007 y6989586621679190008)
instance forall a6989586621679188363 (x6989586621679190007 :: a6989586621679188363) (y6989586621679190008 :: a6989586621679188363). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Ord.Singletons.LamCases_6989586621679190011Sym0 a6989586621679188363 x6989586621679190007 y6989586621679190008)
instance forall a6989586621679188363 (x6989586621679190028 :: a6989586621679188363) (y6989586621679190029 :: a6989586621679188363). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Ord.Singletons.LamCases_6989586621679190030Sym0 a6989586621679188363 x6989586621679190028 y6989586621679190029)
instance forall a6989586621679188363 (x6989586621679190044 :: a6989586621679188363) (y6989586621679190045 :: a6989586621679188363). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Ord.Singletons.LamCases_6989586621679190046Sym0 a6989586621679188363 x6989586621679190044 y6989586621679190045)
instance forall a6989586621679188363 (x6989586621679190060 :: a6989586621679188363) (y6989586621679190061 :: a6989586621679188363). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Ord.Singletons.LamCases_6989586621679190062Sym0 a6989586621679188363 x6989586621679190060 y6989586621679190061)
instance forall a6989586621679188363 (x6989586621679190076 :: a6989586621679188363) (y6989586621679190077 :: a6989586621679188363). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Ord.Singletons.LamCases_6989586621679190078Sym0 a6989586621679188363 x6989586621679190076 y6989586621679190077)
instance forall a6989586621679188363 (x6989586621679190092 :: a6989586621679188363) (y6989586621679190093 :: a6989586621679188363). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Ord.Singletons.LamCases_6989586621679190094Sym0 a6989586621679188363 x6989586621679190092 y6989586621679190093)
instance forall a6989586621679188363 (x6989586621679190108 :: a6989586621679188363) (y6989586621679190109 :: a6989586621679188363). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Ord.Singletons.LamCases_6989586621679190110Sym0 a6989586621679188363 x6989586621679190108 y6989586621679190109)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Ord.Singletons.MaxSym0
instance forall a (a6989586621679189991 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Ord.Singletons.MaxSym1 a6989586621679189991)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Ord.Singletons.MinSym0
instance forall a (a6989586621679189996 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Ord.Singletons.MinSym1 a6989586621679189996)
instance Data.Singletons.Decide.SDecide a => GHC.Internal.Data.Type.Coercion.TestCoercion Data.Ord.Singletons.SDown
instance Data.Singletons.Decide.SDecide a => GHC.Internal.Data.Type.Equality.TestEquality Data.Ord.Singletons.SDown
-- | Defines singleton versions of the definitions in
-- Data.Function.
--
-- Because many of these definitions are produced by Template Haskell, it
-- is not possible to create proper Haddock documentation. Please look up
-- the corresponding operation in Data.Function. Also, please
-- excuse the apparent repeated variable names. This is due to an
-- interaction between Template Haskell and Haddock.
module Data.Function.Singletons
type family Id (a1 :: a) :: a
sId :: forall a (t :: a). Sing t -> Sing (Id t)
type family Const (a1 :: a) (a2 :: b) :: a
sConst :: forall a b (t1 :: a) (t2 :: b). Sing t1 -> Sing t2 -> Sing (Const t1 t2)
type family ( (a1 :: b ~> c) . (a2 :: a ~> b) ) (a3 :: a) :: c
infixr 9 .
(%.) :: forall b c a (t1 :: b ~> c) (t2 :: a ~> b) (t3 :: a). Sing t1 -> Sing t2 -> Sing t3 -> Sing ((t1 . t2) t3)
infixr 9 %.
type family Flip (a1 :: a ~> b ~> c) (a2 :: b) (a3 :: a) :: c
sFlip :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: b) (t3 :: a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Flip t1 t2 t3)
type family (a1 :: a ~> b) $ (a2 :: a) :: b
infixr 0 $
(%$) :: forall a b (t1 :: a ~> b) (t2 :: a). Sing t1 -> Sing t2 -> Sing (t1 $ t2)
infixr 0 %$
type family (a1 :: a) & (a2 :: a ~> b) :: b
infixl 1 &
(%&) :: forall a b (t1 :: a) (t2 :: a ~> b). Sing t1 -> Sing t2 -> Sing (t1 & t2)
infixl 1 %&
type family On (a1 :: b ~> b ~> c) (a2 :: a ~> b) (a3 :: a) (a4 :: a) :: c
infixl 0 `On`
sOn :: forall b c a (t1 :: b ~> (b ~> c)) (t2 :: a ~> b) (t3 :: a) (t4 :: a). Sing t1 -> Sing t2 -> Sing t3 -> Sing t4 -> Sing (On t1 t2 t3 t4)
infixl 0 `sOn`
data IdSym0 (a1 :: TyFun a a)
type family IdSym1 (a6989586621679154359 :: a) :: a
data ConstSym0 (a1 :: TyFun a b ~> a)
data ConstSym1 (a6989586621679154354 :: a) (b1 :: TyFun b a)
type family ConstSym2 (a6989586621679154354 :: a) (a6989586621679154355 :: b) :: a
data (a1 :: TyFun b ~> c a ~> b ~> a ~> c) .@#@$
infixr 9 .@#@$
data (a6989586621679154339 :: b ~> c) .@#@$$ (b1 :: TyFun a ~> b a ~> c)
infixr 9 .@#@$$
data ( (a6989586621679154339 :: b ~> c) .@#@$$$ (a6989586621679154340 :: a ~> b) ) (c1 :: TyFun a c)
infixr 9 .@#@$$$
type family ( (a6989586621679154339 :: b ~> c) .@#@$$$$ (a6989586621679154340 :: a ~> b) ) (a6989586621679154341 :: a) :: c
infixr 9 .@#@$$$$
data FlipSym0 (a1 :: TyFun a ~> b ~> c b ~> a ~> c)
data FlipSym1 (a6989586621679154327 :: a ~> b ~> c) (b1 :: TyFun b a ~> c)
data FlipSym2 (a6989586621679154327 :: a ~> b ~> c) (a6989586621679154328 :: b) (c1 :: TyFun a c)
type family FlipSym3 (a6989586621679154327 :: a ~> b ~> c) (a6989586621679154328 :: b) (a6989586621679154329 :: a) :: c
data (a1 :: TyFun a ~> b a ~> b) $@#@$
infixr 0 $@#@$
data (a6989586621679154308 :: a ~> b) $@#@$$ (b1 :: TyFun a b)
infixr 0 $@#@$$
type family (a6989586621679154308 :: a ~> b) $@#@$$$ (a6989586621679154309 :: a) :: b
infixr 0 $@#@$$$
data (a1 :: TyFun a a ~> b ~> b) &@#@$
infixl 1 &@#@$
data (a6989586621679253960 :: a) &@#@$$ (b1 :: TyFun a ~> b b)
infixl 1 &@#@$$
type family (a6989586621679253960 :: a) &@#@$$$ (a6989586621679253961 :: a ~> b) :: b
infixl 1 &@#@$$$
data OnSym0 (a1 :: TyFun b ~> b ~> c a ~> b ~> a ~> a ~> c)
infixl 0 `OnSym0`
data OnSym1 (a6989586621679253973 :: b ~> b ~> c) (b1 :: TyFun a ~> b a ~> a ~> c)
infixl 0 `OnSym1`
data OnSym2 (a6989586621679253973 :: b ~> b ~> c) (a6989586621679253974 :: a ~> b) (c1 :: TyFun a a ~> c)
infixl 0 `OnSym2`
data OnSym3 (a6989586621679253973 :: b ~> b ~> c) (a6989586621679253974 :: a ~> b) (a6989586621679253975 :: a) (d :: TyFun a c)
infixl 0 `OnSym3`
type family OnSym4 (a6989586621679253973 :: b ~> b ~> c) (a6989586621679253974 :: a ~> b) (a6989586621679253975 :: a) (a6989586621679253976 :: a) :: c
infixl 0 `OnSym4`
instance Data.Singletons.SingI1 Data.Function.Singletons.OnSym1
instance forall b c (d :: b Data.Singletons.~> (b Data.Singletons.~> c)) a. Data.Singletons.SingI d => Data.Singletons.SingI1 (Data.Function.Singletons.OnSym2 d)
instance Data.Singletons.SingI1 (Data.Function.Singletons.&@#@$$)
instance forall b c (d1 :: b Data.Singletons.~> (b Data.Singletons.~> c)) a (d2 :: a Data.Singletons.~> b). (Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI1 (Data.Function.Singletons.OnSym3 d1 d2)
instance Data.Singletons.SingI2 Data.Function.Singletons.OnSym2
instance forall b c (d :: b Data.Singletons.~> (b Data.Singletons.~> c)) a. Data.Singletons.SingI d => Data.Singletons.SingI2 (Data.Function.Singletons.OnSym3 d)
instance Data.Singletons.SingI (Data.Function.Singletons.&@#@$)
instance forall a (d :: a) b. Data.Singletons.SingI d => Data.Singletons.SingI ((Data.Function.Singletons.&@#@$$) d)
instance Data.Singletons.SingI Data.Function.Singletons.OnSym0
instance forall b c (d :: b Data.Singletons.~> (b Data.Singletons.~> c)) a. Data.Singletons.SingI d => Data.Singletons.SingI (Data.Function.Singletons.OnSym1 d)
instance forall b c (d1 :: b Data.Singletons.~> (b Data.Singletons.~> c)) a (d2 :: a Data.Singletons.~> b). (Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.Function.Singletons.OnSym2 d1 d2)
instance forall b c (d1 :: b Data.Singletons.~> (b Data.Singletons.~> c)) a (d2 :: a Data.Singletons.~> b) (d3 :: a). (Data.Singletons.SingI d1, Data.Singletons.SingI d2, Data.Singletons.SingI d3) => Data.Singletons.SingI (Data.Function.Singletons.OnSym3 d1 d2 d3)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Function.Singletons.&@#@$)
instance forall a b (a6989586621679253960 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings ((Data.Function.Singletons.&@#@$$) a6989586621679253960)
instance forall b6989586621679253946 c6989586621679253947 a6989586621679253948 (ty6989586621679253977 :: b6989586621679253946 Data.Singletons.~> (b6989586621679253946 Data.Singletons.~> c6989586621679253947)) (f6989586621679253978 :: a6989586621679253948 Data.Singletons.~> b6989586621679253946) (a_69895866216792539646989586621679253979 :: a6989586621679253948) (a_69895866216792539666989586621679253980 :: a6989586621679253948). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Function.Singletons.LamCases_6989586621679253981Sym0 ty6989586621679253977 f6989586621679253978 a_69895866216792539646989586621679253979 a_69895866216792539666989586621679253980)
instance forall b6989586621679253946 c6989586621679253947 a6989586621679253948 (ty6989586621679253977 :: b6989586621679253946 Data.Singletons.~> (b6989586621679253946 Data.Singletons.~> c6989586621679253947)) (f6989586621679253978 :: a6989586621679253948 Data.Singletons.~> b6989586621679253946) (a_69895866216792539646989586621679253979 :: a6989586621679253948) (a_69895866216792539666989586621679253980 :: a6989586621679253948) (a_69895866216792539856989586621679253986 :: a6989586621679253948). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Function.Singletons.LamCases_6989586621679253981Sym1 ty6989586621679253977 f6989586621679253978 a_69895866216792539646989586621679253979 a_69895866216792539666989586621679253980 a_69895866216792539856989586621679253986)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Function.Singletons.OnSym0
instance forall b c a (a6989586621679253973 :: b Data.Singletons.~> (b Data.Singletons.~> c)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Function.Singletons.OnSym1 a6989586621679253973)
instance forall b c a (a6989586621679253973 :: b Data.Singletons.~> (b Data.Singletons.~> c)) (a6989586621679253974 :: a Data.Singletons.~> b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Function.Singletons.OnSym2 a6989586621679253973 a6989586621679253974)
instance forall b c a (a6989586621679253973 :: b Data.Singletons.~> (b Data.Singletons.~> c)) (a6989586621679253974 :: a Data.Singletons.~> b) (a6989586621679253975 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Function.Singletons.OnSym3 a6989586621679253973 a6989586621679253974 a6989586621679253975)
-- | Defines functions and datatypes relating to the singleton for
-- Either, including singled versions of all the definitions in
-- Data.Either.
--
-- Because many of these definitions are produced by Template Haskell, it
-- is not possible to create proper Haddock documentation. Please look up
-- the corresponding operation in Data.Either. Also, please
-- excuse the apparent repeated variable names. This is due to an
-- interaction between Template Haskell and Haddock.
module Data.Either.Singletons
type family Sing :: k -> Type
data SEither (a1 :: Either a b)
[SLeft] :: forall a b (n :: a). Sing n -> SEither ('Left n :: Either a b)
[SRight] :: forall a b (n :: b). Sing n -> SEither ('Right n :: Either a b)
either_ :: (a -> c) -> (b -> c) -> Either a b -> c
type family Either_ (a1 :: a ~> c) (a2 :: b ~> c) (a3 :: Either a b) :: c
sEither_ :: forall a c b (t1 :: a ~> c) (t2 :: b ~> c) (t3 :: Either a b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Either_ t1 t2 t3)
type family Lefts (a1 :: [Either a b]) :: [a]
sLefts :: forall a b (t :: [Either a b]). Sing t -> Sing (Lefts t)
type family Rights (a1 :: [Either a b]) :: [b]
sRights :: forall a b (t :: [Either a b]). Sing t -> Sing (Rights t)
type family PartitionEithers (a1 :: [Either a b]) :: ([a], [b])
sPartitionEithers :: forall a b (t :: [Either a b]). Sing t -> Sing (PartitionEithers t)
type family IsLeft (a1 :: Either a b) :: Bool
sIsLeft :: forall a b (t :: Either a b). Sing t -> Sing (IsLeft t)
type family IsRight (a1 :: Either a b) :: Bool
sIsRight :: forall a b (t :: Either a b). Sing t -> Sing (IsRight t)
data LeftSym0 (a1 :: TyFun a Either a b)
type family LeftSym1 (a6989586621679050337 :: a) :: Either a b
data RightSym0 (a1 :: TyFun b Either a b)
type family RightSym1 (a6989586621679050339 :: b) :: Either a b
data Either_Sym0 (a1 :: TyFun a ~> c b ~> c ~> Either a b ~> c)
data Either_Sym1 (a6989586621679259290 :: a ~> c) (b1 :: TyFun b ~> c Either a b ~> c)
data Either_Sym2 (a6989586621679259290 :: a ~> c) (a6989586621679259291 :: b ~> c) (c1 :: TyFun Either a b c)
type family Either_Sym3 (a6989586621679259290 :: a ~> c) (a6989586621679259291 :: b ~> c) (a6989586621679259292 :: Either a b) :: c
data LeftsSym0 (a1 :: TyFun [Either a b] [a])
type family LeftsSym1 (a6989586621679261623 :: [Either a b]) :: [a]
data RightsSym0 (a1 :: TyFun [Either a b] [b])
type family RightsSym1 (a6989586621679261617 :: [Either a b]) :: [b]
data IsLeftSym0 (a1 :: TyFun Either a b Bool)
type family IsLeftSym1 (a6989586621679261595 :: Either a b) :: Bool
data IsRightSym0 (a1 :: TyFun Either a b Bool)
type family IsRightSym1 (a6989586621679261592 :: Either a b) :: Bool
instance Data.Singletons.SingI1 Data.Either.Singletons.Either_Sym1
instance forall a c (d :: a Data.Singletons.~> c) b. Data.Singletons.SingI d => Data.Singletons.SingI1 (Data.Either.Singletons.Either_Sym2 d)
instance Data.Singletons.SingI2 Data.Either.Singletons.Either_Sym2
instance Data.Singletons.SingI Data.Either.Singletons.Either_Sym0
instance forall a c (d :: a Data.Singletons.~> c) b. Data.Singletons.SingI d => Data.Singletons.SingI (Data.Either.Singletons.Either_Sym1 d)
instance forall a c (d1 :: a Data.Singletons.~> c) b (d2 :: b Data.Singletons.~> c). (Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.Either.Singletons.Either_Sym2 d1 d2)
instance Data.Singletons.SingI Data.Either.Singletons.IsLeftSym0
instance Data.Singletons.SingI Data.Either.Singletons.IsRightSym0
instance Data.Singletons.SingI Data.Either.Singletons.LeftsSym0
instance Data.Singletons.SingI Data.Either.Singletons.PartitionEithersSym0
instance Data.Singletons.SingI Data.Either.Singletons.RightsSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Either.Singletons.Either_Sym0
instance forall a c b (a6989586621679259290 :: a Data.Singletons.~> c). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Either.Singletons.Either_Sym1 a6989586621679259290)
instance forall a c b (a6989586621679259290 :: a Data.Singletons.~> c) (a6989586621679259291 :: b Data.Singletons.~> c). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Either.Singletons.Either_Sym2 a6989586621679259290 a6989586621679259291)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Either.Singletons.IsLeftSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Either.Singletons.IsRightSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Either.Singletons.LeftsSym0
instance forall a6989586621679261391 b6989586621679261392 k2 k3 (a_69895866216792615966989586621679261601 :: [GHC.Internal.Data.Either.Either a6989586621679261391 b6989586621679261392]). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Either.Singletons.Let6989586621679261602LeftSym0 a_69895866216792615966989586621679261601)
instance forall a6989586621679261391 b6989586621679261392 k2 k3 (a_69895866216792615966989586621679261601 :: [GHC.Internal.Data.Either.Either a6989586621679261391 b6989586621679261392]) (a6989586621679261609 :: k2). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Either.Singletons.Let6989586621679261602LeftSym1 a_69895866216792615966989586621679261601 a6989586621679261609)
instance forall a6989586621679261391 b6989586621679261392 k2 k3 (a_69895866216792615966989586621679261601 :: [GHC.Internal.Data.Either.Either a6989586621679261391 b6989586621679261392]). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Either.Singletons.Let6989586621679261602RightSym0 a_69895866216792615966989586621679261601)
instance forall a6989586621679261391 b6989586621679261392 k2 k3 (a_69895866216792615966989586621679261601 :: [GHC.Internal.Data.Either.Either a6989586621679261391 b6989586621679261392]) (a6989586621679261603 :: k2). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Either.Singletons.Let6989586621679261602RightSym1 a_69895866216792615966989586621679261601 a6989586621679261603)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Either.Singletons.PartitionEithersSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Either.Singletons.RightsSym0
-- | Defines the promoted and singled versions of the Functor type
-- class.
module Data.Functor.Singletons
class PFunctor (f :: Type -> Type) where {
type Fmap (arg :: a ~> b) (arg1 :: f a) :: f b;
type (arg :: a) <$ (arg1 :: f b) :: f a;
type arg :: a <$ arg1 :: f b = TFHelper_6989586621679271236 arg arg1;
}
infixl 4 <$
class SFunctor (f :: Type -> Type)
sFmap :: forall a b (t1 :: a ~> b) (t2 :: f a). SFunctor f => Sing t1 -> Sing t2 -> Sing (Fmap t1 t2)
(%<$) :: forall a b (t1 :: a) (t2 :: f b). SFunctor f => Sing t1 -> Sing t2 -> Sing (t1 <$ t2)
($dm%<$) :: forall a b (t1 :: a) (t2 :: f b). (SFunctor f, (t1 <$ t2) ~ TFHelper_6989586621679271236 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 <$ t2)
infixl 4 %<$
type family (a1 :: f a) $> (a2 :: b) :: f b
infixl 4 $>
(%$>) :: forall (f :: Type -> Type) a b (t1 :: f a) (t2 :: b). SFunctor f => Sing t1 -> Sing t2 -> Sing (t1 $> t2)
infixl 4 %$>
type family (a1 :: a ~> b) <$> (a2 :: f a) :: f b
infixl 4 <$>
(%<$>) :: forall a b (f :: Type -> Type) (t1 :: a ~> b) (t2 :: f a). SFunctor f => Sing t1 -> Sing t2 -> Sing (t1 <$> t2)
infixl 4 %<$>
type family (a1 :: f a) <&> (a2 :: a ~> b) :: f b
infixl 1 <&>
(%<&>) :: forall (f :: Type -> Type) a b (t1 :: f a) (t2 :: a ~> b). SFunctor f => Sing t1 -> Sing t2 -> Sing (t1 <&> t2)
infixl 1 %<&>
type family Void (a1 :: f a) :: f ()
sVoid :: forall (f :: Type -> Type) a (t :: f a). SFunctor f => Sing t -> Sing (Void t)
data FmapSym0 (a1 :: TyFun a ~> b f a ~> f b)
data FmapSym1 (a6989586621679271227 :: a ~> b) (b1 :: TyFun f a f b)
type family FmapSym2 (a6989586621679271227 :: a ~> b) (a6989586621679271228 :: f a) :: f b
data (a1 :: TyFun a f b ~> f a) <$@#@$
infixl 4 <$@#@$
data (a6989586621679271232 :: a) <$@#@$$ (b1 :: TyFun f b f a)
infixl 4 <$@#@$$
type family (a6989586621679271232 :: a) <$@#@$$$ (a6989586621679271233 :: f b) :: f a
infixl 4 <$@#@$$$
data (a1 :: TyFun f a b ~> f b) $>@#@$
infixl 4 $>@#@$
data (a6989586621679357502 :: f a) $>@#@$$ (b1 :: TyFun b f b)
infixl 4 $>@#@$$
type family (a6989586621679357502 :: f a) $>@#@$$$ (a6989586621679357503 :: b) :: f b
infixl 4 $>@#@$$$
data (a1 :: TyFun a ~> b f a ~> f b) <$>@#@$
infixl 4 <$>@#@$
data (a6989586621679357520 :: a ~> b) <$>@#@$$ (b1 :: TyFun f a f b)
infixl 4 <$>@#@$$
type family (a6989586621679357520 :: a ~> b) <$>@#@$$$ (a6989586621679357521 :: f a) :: f b
infixl 4 <$>@#@$$$
data (a1 :: TyFun f a a ~> b ~> f b) <&>@#@$
infixl 1 <&>@#@$
data (a6989586621679357509 :: f a) <&>@#@$$ (b1 :: TyFun a ~> b f b)
infixl 1 <&>@#@$$
type family (a6989586621679357509 :: f a) <&>@#@$$$ (a6989586621679357510 :: a ~> b) :: f b
infixl 1 <&>@#@$$$
data VoidSym0 (a1 :: TyFun f a f ())
type family VoidSym1 (a6989586621679357493 :: f a) :: f ()
instance Control.Monad.Singletons.Internal.PFunctor GHC.Internal.Data.Ord.Down
instance Control.Monad.Singletons.Internal.PFunctor ((,) a)
instance Control.Monad.Singletons.Internal.SFunctor GHC.Internal.Data.Ord.Down
instance Control.Monad.Singletons.Internal.SFunctor ((,) a)
instance Control.Monad.Singletons.Internal.SFunctor f => Data.Singletons.SingI1 (Data.Functor.Singletons.<$>@#@$$)
instance Control.Monad.Singletons.Internal.SFunctor f => Data.Singletons.SingI1 (Data.Functor.Singletons.$>@#@$$)
instance Control.Monad.Singletons.Internal.SFunctor f => Data.Singletons.SingI1 (Data.Functor.Singletons.<&>@#@$$)
instance Control.Monad.Singletons.Internal.SFunctor f => Data.Singletons.SingI (Data.Functor.Singletons.$>@#@$)
instance forall (f :: * -> *) a (d :: f a) b. (Control.Monad.Singletons.Internal.SFunctor f, Data.Singletons.SingI d) => Data.Singletons.SingI ((Data.Functor.Singletons.$>@#@$$) d)
instance Control.Monad.Singletons.Internal.SFunctor f => Data.Singletons.SingI (Data.Functor.Singletons.<$>@#@$)
instance forall (f :: * -> *) a b (d :: a Data.Singletons.~> b). (Control.Monad.Singletons.Internal.SFunctor f, Data.Singletons.SingI d) => Data.Singletons.SingI ((Data.Functor.Singletons.<$>@#@$$) d)
instance Control.Monad.Singletons.Internal.SFunctor f => Data.Singletons.SingI (Data.Functor.Singletons.<&>@#@$)
instance forall (f :: * -> *) a (d :: f a) b. (Control.Monad.Singletons.Internal.SFunctor f, Data.Singletons.SingI d) => Data.Singletons.SingI ((Data.Functor.Singletons.<&>@#@$$) d)
instance Control.Monad.Singletons.Internal.SFunctor f => Data.Singletons.SingI Data.Functor.Singletons.VoidSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Functor.Singletons.$>@#@$)
instance forall (f :: * -> *) a b (a6989586621679357502 :: f a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings ((Data.Functor.Singletons.$>@#@$$) a6989586621679357502)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Functor.Singletons.<$>@#@$)
instance forall a b (f :: * -> *) (a6989586621679357520 :: a Data.Singletons.~> b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings ((Data.Functor.Singletons.<$>@#@$$) a6989586621679357520)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Functor.Singletons.<&>@#@$)
instance forall (f :: * -> *) a b (a6989586621679357509 :: f a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings ((Data.Functor.Singletons.<&>@#@$$) a6989586621679357509)
instance forall k1 a7566047373982778550 b7566047373982778551 k2 k3 k4 (a6989586621679357455 :: k1) (_f_69895866216793574666989586621679357607 :: a7566047373982778550 Data.Singletons.~> b7566047373982778551) (a_69895866216793574726989586621679357608 :: k2) (a_69895866216793574746989586621679357609 :: k3). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Functor.Singletons.LamCases_6989586621679357610Sym0 a6989586621679357455 _f_69895866216793574666989586621679357607 a_69895866216793574726989586621679357608 a_69895866216793574746989586621679357609)
instance forall k1 a7566047373982778554 k2 k3 k4 (a6989586621679357455 :: k1) (_z_69895866216793574686989586621679357625 :: a7566047373982778554) (a_69895866216793574786989586621679357626 :: k2) (a_69895866216793574806989586621679357627 :: k3). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Functor.Singletons.LamCases_6989586621679357628Sym0 a6989586621679357455 _z_69895866216793574686989586621679357625 a_69895866216793574786989586621679357626 a_69895866216793574806989586621679357627)
instance forall k1 a7566047373982778554 k2 k3 k4 (a6989586621679357455 :: k1) (_z_69895866216793574686989586621679357625 :: a7566047373982778554) (a_69895866216793574786989586621679357626 :: k2) (a_69895866216793574806989586621679357627 :: k3). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Functor.Singletons.LamCases_6989586621679357634Sym0 a6989586621679357455 _z_69895866216793574686989586621679357625 a_69895866216793574786989586621679357626 a_69895866216793574806989586621679357627)
instance forall a7566047373982778554 k1 k2 (_z_69895866216793574856989586621679357659 :: a7566047373982778554) (a_69895866216793574896989586621679357660 :: k1). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Functor.Singletons.LamCases_6989586621679357661Sym0 _z_69895866216793574856989586621679357659 a_69895866216793574896989586621679357660)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Functor.Singletons.VoidSym0
-- | Defines the promoted and singled versions of the MonadFail type
-- class.
module Control.Monad.Fail.Singletons
class PMonadFail (m :: Type -> Type) where {
type Fail (arg :: [Char]) :: m a;
}
class SMonad m => SMonadFail (m :: Type -> Type)
sFail :: forall a (t :: [Char]). SMonadFail m => Sing t -> Sing (Fail t :: m a)
data FailSym0 (a1 :: TyFun [Char] m a)
type family FailSym1 (a6989586621679365940 :: [Char]) :: m a
instance Control.Monad.Fail.Singletons.PMonadFail []
instance Control.Monad.Fail.Singletons.PMonadFail GHC.Internal.Maybe.Maybe
instance Control.Monad.Fail.Singletons.SMonadFail []
instance Control.Monad.Fail.Singletons.SMonadFail GHC.Internal.Maybe.Maybe
instance Control.Monad.Fail.Singletons.SMonadFail m => Data.Singletons.SingI Control.Monad.Fail.Singletons.FailSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Control.Monad.Fail.Singletons.FailSym0
-- | Defines and exports singletons useful for the Natural, Symbol, and
-- Char kinds.
module GHC.TypeLits.Singletons
-- | Natural number
--
-- Invariant: numbers <= 0xffffffffffffffff use the NS
-- constructor
data Natural
-- | (Kind) This is the kind of type-level symbols.
data Symbol
-- | The character type Char represents Unicode codespace and its
-- elements are code points as in definitions D9 and D10 of the
-- Unicode Standard.
--
-- Character literals in Haskell are single-quoted: 'Q',
-- 'Я' or 'Ω'. To represent a single quote itself use
-- '\'', and to represent a backslash use '\\'. The
-- full grammar can be found in the section 2.6 of the Haskell 2010
-- Language Report.
--
-- To specify a character by its code point one can use decimal,
-- hexadecimal or octal notation: '\65', '\x41' and
-- '\o101' are all alternative forms of 'A'. The
-- largest code point is '\x10ffff'.
--
-- There is a special escape syntax for ASCII control characters:
--
-- TODO: table
--
-- Data.Char provides utilities to work with Char.
data Char
type family Sing :: k -> Type
-- | A value-level witness for a type-level natural number. This is
-- commonly referred to as a singleton type, as for each
-- n, there is a single value that inhabits the type
-- SNat n (aside from bottom).
--
-- The definition of SNat is intentionally left abstract. To
-- obtain an SNat value, use one of the following:
--
--
-- - The natSing method of KnownNat.
-- - The SNat pattern synonym.
-- - The withSomeSNat function, which creates an SNat
-- from a Natural number.
--
data SNat (n :: Nat)
-- | A explicitly bidirectional pattern synonym relating an SNat to
-- a KnownNat constraint.
--
-- As an expression: Constructs an explicit SNat n
-- value from an implicit KnownNat n constraint:
--
--
-- SNat @n :: KnownNat n => SNat n
--
--
-- As a pattern: Matches on an explicit SNat n
-- value bringing an implicit KnownNat n constraint into
-- scope:
--
--
-- f :: SNat n -> ..
-- f SNat = {- KnownNat n in scope -}
--
pattern SNat :: () => KnownNat n => SNat n
-- | A value-level witness for a type-level symbol. This is commonly
-- referred to as a singleton type, as for each s, there
-- is a single value that inhabits the type SSymbol s
-- (aside from bottom).
--
-- The definition of SSymbol is intentionally left abstract. To
-- obtain an SSymbol value, use one of the following:
--
--
-- - The symbolSing method of KnownSymbol.
-- - The SSymbol pattern synonym.
-- - The withSomeSSymbol function, which creates an
-- SSymbol from a String.
--
data SSymbol (s :: Symbol)
-- | A explicitly bidirectional pattern synonym relating an SSymbol
-- to a KnownSymbol constraint.
--
-- As an expression: Constructs an explicit SSymbol
-- s value from an implicit KnownSymbol s
-- constraint:
--
--
-- SSymbol @s :: KnownSymbol s => SSymbol s
--
--
-- As a pattern: Matches on an explicit SSymbol s
-- value bringing an implicit KnownSymbol s constraint
-- into scope:
--
--
-- f :: SSymbol s -> ..
-- f SSymbol = {- KnownSymbol s in scope -}
--
pattern SSymbol :: () => KnownSymbol s => SSymbol s
-- | An alias for the SSymbol pattern synonym.
pattern SSym :: () => KnownSymbol s => SSymbol s
-- | A value-level witness for a type-level character. This is commonly
-- referred to as a singleton type, as for each c, there
-- is a single value that inhabits the type SChar c
-- (aside from bottom).
--
-- The definition of SChar is intentionally left abstract. To
-- obtain an SChar value, use one of the following:
--
--
-- - The charSing method of KnownChar.
-- - The SChar pattern synonym.
-- - The withSomeSChar function, which creates an SChar
-- from a Char.
--
data SChar (s :: Char)
-- | A explicitly bidirectional pattern synonym relating an SChar to
-- a KnownChar constraint.
--
-- As an expression: Constructs an explicit SChar
-- c value from an implicit KnownChar c constraint:
--
--
-- SChar @c :: KnownChar c => SChar c
--
--
-- As a pattern: Matches on an explicit SChar c
-- value bringing an implicit KnownChar c constraint into
-- scope:
--
--
-- f :: SChar c -> ..
-- f SChar = {- KnownChar c in scope -}
--
pattern SChar :: () => KnownChar c => SChar c
-- | Convert an explicit SNat n value into an implicit
-- KnownNat n constraint.
withKnownNat :: forall (n :: Nat) r. SNat n -> (KnownNat n => r) -> r
-- | Convert an explicit SSymbol s value into an implicit
-- KnownSymbol s constraint.
withKnownSymbol :: forall (s :: Symbol) r. SSymbol s -> (KnownSymbol s => r) -> r
-- | Convert an explicit SChar c value into an implicit
-- KnownChar c constraint.
withKnownChar :: forall (c :: Char) r. SChar c -> (KnownChar c => r) -> r
-- | A promoted version of error. This implements Error as a
-- stuck type family with a Symbol argument. Depending on your
-- needs, you might also consider the following alternatives:
--
--
-- - Data.Singletons.Base.PolyError provides PolyError,
-- which generalizes the argument to be kind-polymorphic. This allows
-- passing additional information to the error besides raw
-- Symbols.
-- - Data.Singletons.Base.TypeError provides TypeError,
-- a slightly modified version of the custom type error machinery found
-- in GHC.TypeLits. This allows emitting error messages as
-- compiler errors rather than as stuck type families.
--
type family Error (str :: Symbol) :: a
-- | The singleton for error.
sError :: forall a (str :: Symbol). HasCallStack => Sing str -> Sing (Error str :: a)
-- | The promotion of errorWithoutStackTrace.
type family ErrorWithoutStackTrace (str :: Symbol) :: a
-- | The singleton for errorWithoutStackTrace.
sErrorWithoutStackTrace :: forall a (str :: Symbol). Sing str -> Sing (ErrorWithoutStackTrace str :: a)
-- | The promotion of undefined.
type family Undefined :: forall a. () => a
-- | The singleton for undefined.
sUndefined :: HasCallStack => Sing Undefined
-- | This class gives the integer associated with a type-level natural.
-- There are instances of the class for every concrete literal: 0, 1, 2,
-- etc.
class KnownNat (n :: Nat)
natVal :: forall (n :: Nat) proxy. KnownNat n => proxy n -> Natural
-- | This class gives the string associated with a type-level symbol. There
-- are instances of the class for every concrete literal: "hello", etc.
class KnownSymbol (n :: Symbol)
symbolVal :: forall (n :: Symbol) proxy. KnownSymbol n => proxy n -> String
class KnownChar (n :: Char)
charVal :: forall (n :: Char) proxy. KnownChar n => proxy n -> Char
-- | Exponentiation of type-level naturals.
type family (a :: Natural) ^ (b :: Natural) :: Natural
infixr 8 ^
-- | The singleton analogue of (^) for Naturals.
(%^) :: forall (a :: Natural) (b :: Natural). Sing a -> Sing b -> Sing (a ^ b)
infixr 8 %^
-- | Comparison (<=) of comparable types, as a function.
type (m :: k) <=? (n :: k) = OrdCond Compare m n 'True 'True 'False
infix 4 <=?
-- | The singleton analogue of <=?
--
-- Note that, because of historical reasons in GHC's Natural API,
-- <=? is incompatible (unification-wise) with <= and
-- the PEq, SEq, POrd, and SOrd instances for
-- Natural. (a <=? b) ~ 'True does not imply
-- anything about a <= b or any other PEq /
-- POrd relationships.
--
-- (Be aware that <= in the paragraph above refers to
-- <= from the POrd typeclass, exported from
-- Data.Ord.Singletons, and not the <= from
-- GHC.TypeNats. The latter is simply a type alias for (a
-- <=? b) ~ 'True.)
--
-- This is provided here for the sake of completeness and for
-- compatibility with libraries with APIs built around <=?.
-- New code should use CmpNat, exposed through this library
-- through the POrd and SOrd instances for Natural.
(%<=?) :: forall (a :: Natural) (b :: Natural). Sing a -> Sing b -> Sing (a <=? b)
infix 4 %<=?
-- | Log base 2 (round down) of natural numbers. Log 0 is
-- undefined (i.e., it cannot be reduced).
type family Log2 (a :: Natural) :: Natural
sLog2 :: forall (x :: Natural). Sing x -> Sing (Log2 x)
-- | Division (round down) of natural numbers. Div x 0 is
-- undefined (i.e., it cannot be reduced).
type family Div (a :: Natural) (b :: Natural) :: Natural
infixl 7 `Div`
sDiv :: forall (x :: Natural) (y :: Natural). Sing x -> Sing y -> Sing (Div x y)
infixl 7 `sDiv`
-- | Modulus of natural numbers. Mod x 0 is undefined (i.e., it
-- cannot be reduced).
type family Mod (a :: Natural) (b :: Natural) :: Natural
infixl 7 `Mod`
sMod :: forall (x :: Natural) (y :: Natural). Sing x -> Sing y -> Sing (Mod x y)
infixl 7 `sMod`
type family DivMod (a :: Natural) (a1 :: Natural) :: (Natural, Natural)
sDivMod :: forall (x :: Natural) (y :: Natural). Sing x -> Sing y -> Sing (DivMod x y)
type family Quot (a :: Natural) (a1 :: Natural) :: Natural
infixl 7 `Quot`
sQuot :: forall (x :: Natural) (y :: Natural). Sing x -> Sing y -> Sing (Quot x y)
infixl 7 `sQuot`
type family Rem (a :: Natural) (a1 :: Natural) :: Natural
infixl 7 `Rem`
sRem :: forall (x :: Natural) (y :: Natural). Sing x -> Sing y -> Sing (Rem x y)
infixl 7 `sRem`
type family QuotRem (a :: Natural) (a1 :: Natural) :: (Natural, Natural)
sQuotRem :: forall (x :: Natural) (y :: Natural). Sing x -> Sing y -> Sing (QuotRem x y)
consSymbol :: Char -> String -> String
-- | Extending a type-level symbol with a type-level character
type family ConsSymbol (a :: Char) (b :: Symbol) :: Symbol
sConsSymbol :: forall (x :: Char) (y :: Symbol). Sing x -> Sing y -> Sing (ConsSymbol x y)
unconsSymbol :: String -> Maybe (Char, String)
-- | This type family yields type-level Just storing the first
-- character of a symbol and its tail if it is defined and Nothing
-- otherwise.
type family UnconsSymbol (a :: Symbol) :: Maybe (Char, Symbol)
sUnconsSymbol :: forall (x :: Symbol). Sing x -> Sing (UnconsSymbol x)
charToNat :: Char -> Natural
-- | Convert a character to its Unicode code point (cf. ord)
type family CharToNat (a :: Char) :: Natural
sCharToNat :: forall (x :: Char). Sing x -> Sing (CharToNat x)
natToChar :: Natural -> Char
-- | Convert a Unicode code point to a character (cf. chr)
type family NatToChar (a :: Natural) :: Char
sNatToChar :: forall (x :: Natural). Sing x -> Sing (NatToChar x)
data ErrorSym0 (a1 :: TyFun Symbol a)
type family ErrorSym1 (a6989586621679368947 :: Symbol) :: a
data ErrorWithoutStackTraceSym0 (a1 :: TyFun Symbol a)
type family ErrorWithoutStackTraceSym1 (a6989586621679369227 :: Symbol) :: a
type family UndefinedSym0 :: a
data KnownNatSym0 (a :: TyFun Nat Constraint)
type family KnownNatSym1 (a6989586621679377837 :: Nat)
data KnownSymbolSym0 (a :: TyFun Symbol Constraint)
type family KnownSymbolSym1 (a6989586621679377839 :: Symbol)
data KnownCharSym0 (a :: TyFun Char Constraint)
type family KnownCharSym1 (a6989586621679377841 :: Char)
data (a :: TyFun Natural Natural ~> Natural) ^@#@$
infixr 8 ^@#@$
data (a6989586621679369666 :: Natural) ^@#@$$ (b :: TyFun Natural Natural)
infixr 8 ^@#@$$
type family (a6989586621679369666 :: Natural) ^@#@$$$ (a6989586621679369667 :: Natural) :: Natural
infixr 8 ^@#@$$$
data (a :: TyFun k k ~> Bool) <=?@#@$
infix 4 <=?@#@$
data (a6989586621679370104 :: k) <=?@#@$$ (b :: TyFun k Bool)
infix 4 <=?@#@$$
type family (a6989586621679370104 :: k) <=?@#@$$$ (a6989586621679370105 :: k) :: Bool
infix 4 <=?@#@$$$
data Log2Sym0 (a :: TyFun Natural Natural)
type family Log2Sym1 (a6989586621679378480 :: Natural) :: Natural
data DivSym0 (a :: TyFun Natural Natural ~> Natural)
infixl 7 `DivSym0`
data DivSym1 (a6989586621679378709 :: Natural) (b :: TyFun Natural Natural)
infixl 7 `DivSym1`
type family DivSym2 (a6989586621679378709 :: Natural) (a6989586621679378710 :: Natural) :: Natural
infixl 7 `DivSym2`
data ModSym0 (a :: TyFun Natural Natural ~> Natural)
infixl 7 `ModSym0`
data ModSym1 (a6989586621679379154 :: Natural) (b :: TyFun Natural Natural)
infixl 7 `ModSym1`
type family ModSym2 (a6989586621679379154 :: Natural) (a6989586621679379155 :: Natural) :: Natural
infixl 7 `ModSym2`
data DivModSym0 (a :: TyFun Natural Natural ~> (Natural, Natural))
data DivModSym1 (a6989586621679379842 :: Natural) (b :: TyFun Natural (Natural, Natural))
type family DivModSym2 (a6989586621679379842 :: Natural) (a6989586621679379843 :: Natural) :: (Natural, Natural)
data QuotSym0 (a :: TyFun Natural Natural ~> Natural)
infixl 7 `QuotSym0`
data QuotSym1 (a6989586621679379824 :: Natural) (b :: TyFun Natural Natural)
infixl 7 `QuotSym1`
type family QuotSym2 (a6989586621679379824 :: Natural) (a6989586621679379825 :: Natural) :: Natural
infixl 7 `QuotSym2`
data RemSym0 (a :: TyFun Natural Natural ~> Natural)
infixl 7 `RemSym0`
data RemSym1 (a6989586621679379813 :: Natural) (b :: TyFun Natural Natural)
infixl 7 `RemSym1`
type family RemSym2 (a6989586621679379813 :: Natural) (a6989586621679379814 :: Natural) :: Natural
infixl 7 `RemSym2`
data QuotRemSym0 (a :: TyFun Natural Natural ~> (Natural, Natural))
data QuotRemSym1 (a6989586621679379835 :: Natural) (b :: TyFun Natural (Natural, Natural))
type family QuotRemSym2 (a6989586621679379835 :: Natural) (a6989586621679379836 :: Natural) :: (Natural, Natural)
data ConsSymbolSym0 (a :: TyFun Char Symbol ~> Symbol)
data ConsSymbolSym1 (a6989586621679381116 :: Char) (b :: TyFun Symbol Symbol)
type family ConsSymbolSym2 (a6989586621679381116 :: Char) (a6989586621679381117 :: Symbol) :: Symbol
data UnconsSymbolSym0 (a :: TyFun Symbol Maybe (Char, Symbol))
type family UnconsSymbolSym1 (a6989586621679381627 :: Symbol) :: Maybe (Char, Symbol)
data CharToNatSym0 (a :: TyFun Char Natural)
type family CharToNatSym1 (a6989586621679381852 :: Char) :: Natural
data NatToCharSym0 (a :: TyFun Natural Char)
type family NatToCharSym1 (a6989586621679382082 :: Natural) :: Char
instance GHC.Classes.Eq GHC.Types.Symbol
instance GHC.Internal.Data.String.IsString GHC.Types.Symbol
instance GHC.Internal.Base.Monoid GHC.Types.Symbol
instance GHC.Classes.Ord GHC.Types.Symbol
instance GHC.Internal.Base.Semigroup GHC.Types.Symbol
instance GHC.Internal.Show.Show GHC.Types.Symbol
instance Data.Singletons.SingI1 GHC.TypeLits.Singletons.ConsSymbolSym1
instance Data.Singletons.SingI1 GHC.TypeLits.Singletons.DivSym1
instance Data.Singletons.SingI1 GHC.TypeLits.Singletons.ModSym1
instance Data.Singletons.SingI GHC.TypeLits.Singletons.CharToNatSym0
instance Data.Singletons.SingI GHC.TypeLits.Singletons.ConsSymbolSym0
instance Data.Singletons.SingI x => Data.Singletons.SingI (GHC.TypeLits.Singletons.ConsSymbolSym1 x)
instance Data.Singletons.SingI GHC.TypeLits.Singletons.DivSym0
instance Data.Singletons.SingI x => Data.Singletons.SingI (GHC.TypeLits.Singletons.DivSym1 x)
instance Data.Singletons.SingI GHC.TypeLits.Singletons.Log2Sym0
instance Data.Singletons.SingI GHC.TypeLits.Singletons.ModSym0
instance Data.Singletons.SingI x => Data.Singletons.SingI (GHC.TypeLits.Singletons.ModSym1 x)
instance Data.Singletons.SingI GHC.TypeLits.Singletons.NatToCharSym0
instance Data.Singletons.SingI GHC.TypeLits.Singletons.UnconsSymbolSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings GHC.TypeLits.Singletons.CharToNatSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings GHC.TypeLits.Singletons.ConsSymbolSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (GHC.TypeLits.Singletons.ConsSymbolSym1 a6989586621679381116)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings GHC.TypeLits.Singletons.DivModSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (GHC.TypeLits.Singletons.DivModSym1 a6989586621679379842)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings GHC.TypeLits.Singletons.DivSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (GHC.TypeLits.Singletons.DivSym1 a6989586621679378709)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings GHC.TypeLits.Singletons.KnownCharSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings GHC.TypeLits.Singletons.KnownNatSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings GHC.TypeLits.Singletons.KnownSymbolSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings GHC.TypeLits.Singletons.Log2Sym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings GHC.TypeLits.Singletons.ModSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (GHC.TypeLits.Singletons.ModSym1 a6989586621679379154)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings GHC.TypeLits.Singletons.NatToCharSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings GHC.TypeLits.Singletons.QuotRemSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (GHC.TypeLits.Singletons.QuotRemSym1 a6989586621679379835)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings GHC.TypeLits.Singletons.QuotSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (GHC.TypeLits.Singletons.QuotSym1 a6989586621679379824)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings GHC.TypeLits.Singletons.RemSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (GHC.TypeLits.Singletons.RemSym1 a6989586621679379813)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings GHC.TypeLits.Singletons.UnconsSymbolSym0
-- | Defines functions and datatypes relating to the singleton for
-- Maybe, including singled versions of all the definitions in
-- Data.Maybe.
--
-- Because many of these definitions are produced by Template Haskell, it
-- is not possible to create proper Haddock documentation. Please look up
-- the corresponding operation in Data.Maybe. Also, please
-- excuse the apparent repeated variable names. This is due to an
-- interaction between Template Haskell and Haddock.
module Data.Maybe.Singletons
type family Sing :: k -> Type
data SMaybe (a1 :: Maybe a)
[SNothing] :: forall a. SMaybe ('Nothing :: Maybe a)
[SJust] :: forall a (n :: a). Sing n -> SMaybe ('Just n)
maybe_ :: b -> (a -> b) -> Maybe a -> b
type family Maybe_ (a1 :: b) (a2 :: a ~> b) (a3 :: Maybe a) :: b
sMaybe_ :: forall b a (t1 :: b) (t2 :: a ~> b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Maybe_ t1 t2 t3)
type family IsJust (a1 :: Maybe a) :: Bool
sIsJust :: forall a (t :: Maybe a). Sing t -> Sing (IsJust t)
type family IsNothing (a1 :: Maybe a) :: Bool
sIsNothing :: forall a (t :: Maybe a). Sing t -> Sing (IsNothing t)
type family FromJust (a1 :: Maybe a) :: a
sFromJust :: forall a (t :: Maybe a). Sing t -> Sing (FromJust t)
type family FromMaybe (a1 :: a) (a2 :: Maybe a) :: a
sFromMaybe :: forall a (t1 :: a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (FromMaybe t1 t2)
type family ListToMaybe (a1 :: [a]) :: Maybe a
sListToMaybe :: forall a (t :: [a]). Sing t -> Sing (ListToMaybe t)
type family MaybeToList (a1 :: Maybe a) :: [a]
sMaybeToList :: forall a (t :: Maybe a). Sing t -> Sing (MaybeToList t)
type family CatMaybes (a1 :: [Maybe a]) :: [a]
sCatMaybes :: forall a (t :: [Maybe a]). Sing t -> Sing (CatMaybes t)
type family MapMaybe (a1 :: a ~> Maybe b) (a2 :: [a]) :: [b]
sMapMaybe :: forall a b (t1 :: a ~> Maybe b) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (MapMaybe t1 t2)
type family NothingSym0 :: Maybe a
data JustSym0 (a1 :: TyFun a Maybe a)
type family JustSym1 (a6989586621679050265 :: a) :: Maybe a
data Maybe_Sym0 (a1 :: TyFun b a ~> b ~> Maybe a ~> b)
data Maybe_Sym1 (a6989586621679387993 :: b) (b1 :: TyFun a ~> b Maybe a ~> b)
data Maybe_Sym2 (a6989586621679387993 :: b) (a6989586621679387994 :: a ~> b) (c :: TyFun Maybe a b)
type family Maybe_Sym3 (a6989586621679387993 :: b) (a6989586621679387994 :: a ~> b) (a6989586621679387995 :: Maybe a) :: b
data IsJustSym0 (a1 :: TyFun Maybe a Bool)
type family IsJustSym1 (a6989586621679390233 :: Maybe a) :: Bool
data IsNothingSym0 (a1 :: TyFun Maybe a Bool)
type family IsNothingSym1 (a6989586621679390230 :: Maybe a) :: Bool
data FromJustSym0 (a1 :: TyFun Maybe a a)
type family FromJustSym1 (a6989586621679390226 :: Maybe a) :: a
data FromMaybeSym0 (a1 :: TyFun a Maybe a ~> a)
data FromMaybeSym1 (a6989586621679390214 :: a) (b :: TyFun Maybe a a)
type family FromMaybeSym2 (a6989586621679390214 :: a) (a6989586621679390215 :: Maybe a) :: a
data ListToMaybeSym0 (a1 :: TyFun [a] Maybe a)
type family ListToMaybeSym1 (a6989586621679390205 :: [a]) :: Maybe a
data MaybeToListSym0 (a1 :: TyFun Maybe a [a])
type family MaybeToListSym1 (a6989586621679390209 :: Maybe a) :: [a]
data CatMaybesSym0 (a1 :: TyFun [Maybe a] [a])
type family CatMaybesSym1 (a6989586621679390199 :: [Maybe a]) :: [a]
data MapMaybeSym0 (a1 :: TyFun a ~> Maybe b [a] ~> [b])
data MapMaybeSym1 (a6989586621679390184 :: a ~> Maybe b) (b1 :: TyFun [a] [b])
type family MapMaybeSym2 (a6989586621679390184 :: a ~> Maybe b) (a6989586621679390185 :: [a]) :: [b]
instance Data.Singletons.SingI1 Data.Maybe.Singletons.MapMaybeSym1
instance forall b (d :: b) a. Data.Singletons.SingI d => Data.Singletons.SingI1 (Data.Maybe.Singletons.Maybe_Sym2 d)
instance Data.Singletons.SingI1 Data.Maybe.Singletons.FromMaybeSym1
instance Data.Singletons.SingI1 Data.Maybe.Singletons.Maybe_Sym1
instance Data.Singletons.SingI2 Data.Maybe.Singletons.Maybe_Sym2
instance Data.Singletons.SingI Data.Maybe.Singletons.CatMaybesSym0
instance Data.Singletons.SingI Data.Maybe.Singletons.FromJustSym0
instance Data.Singletons.SingI Data.Maybe.Singletons.FromMaybeSym0
instance forall a (d :: a). Data.Singletons.SingI d => Data.Singletons.SingI (Data.Maybe.Singletons.FromMaybeSym1 d)
instance Data.Singletons.SingI Data.Maybe.Singletons.IsJustSym0
instance Data.Singletons.SingI Data.Maybe.Singletons.IsNothingSym0
instance Data.Singletons.SingI Data.Maybe.Singletons.ListToMaybeSym0
instance Data.Singletons.SingI Data.Maybe.Singletons.MapMaybeSym0
instance forall a b (d :: a Data.Singletons.~> GHC.Internal.Maybe.Maybe b). Data.Singletons.SingI d => Data.Singletons.SingI (Data.Maybe.Singletons.MapMaybeSym1 d)
instance Data.Singletons.SingI Data.Maybe.Singletons.MaybeToListSym0
instance Data.Singletons.SingI Data.Maybe.Singletons.Maybe_Sym0
instance forall b (d :: b) a. Data.Singletons.SingI d => Data.Singletons.SingI (Data.Maybe.Singletons.Maybe_Sym1 d)
instance forall b (d1 :: b) a (d2 :: a Data.Singletons.~> b). (Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.Maybe.Singletons.Maybe_Sym2 d1 d2)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Maybe.Singletons.CatMaybesSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Maybe.Singletons.FromJustSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Maybe.Singletons.FromMaybeSym0
instance forall a (a6989586621679390214 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Maybe.Singletons.FromMaybeSym1 a6989586621679390214)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Maybe.Singletons.IsJustSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Maybe.Singletons.IsNothingSym0
instance forall a6989586621679390036 b6989586621679390037 k (f6989586621679390186 :: a6989586621679390036 Data.Singletons.~> GHC.Internal.Maybe.Maybe b6989586621679390037) (x6989586621679390187 :: k) (xs6989586621679390188 :: [a6989586621679390036]). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Maybe.Singletons.LamCases_6989586621679390191Sym0 f6989586621679390186 x6989586621679390187 xs6989586621679390188)
instance forall a6989586621679390041 (d6989586621679390216 :: a6989586621679390041) (x6989586621679390217 :: GHC.Internal.Maybe.Maybe a6989586621679390041). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Maybe.Singletons.LamCases_6989586621679390218Sym0 d6989586621679390216 x6989586621679390217)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Maybe.Singletons.ListToMaybeSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Maybe.Singletons.MapMaybeSym0
instance forall a b (a6989586621679390184 :: a Data.Singletons.~> GHC.Internal.Maybe.Maybe b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Maybe.Singletons.MapMaybeSym1 a6989586621679390184)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Maybe.Singletons.MaybeToListSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Maybe.Singletons.Maybe_Sym0
instance forall b a (a6989586621679387993 :: b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Maybe.Singletons.Maybe_Sym1 a6989586621679387993)
instance forall b a (a6989586621679387993 :: b) (a6989586621679387994 :: a Data.Singletons.~> b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Maybe.Singletons.Maybe_Sym2 a6989586621679387993 a6989586621679387994)
-- | Defines the promoted and singleton version of the Bounded and
-- Enum type classes.
--
-- While Prelude.Singletons re-exports the promoted and singled
-- versions of Enum, it deliberately avoids re-exporting
-- Succ and Pred, as these are names are likely to clash
-- with code that deals with unary natural numbers. As a result, this
-- module exists to provide Succ and Pred for those who
-- want them.
module Data.Singletons.Base.Enum
class PBounded a where {
type MinBound :: a;
type MaxBound :: a;
}
class SBounded a
sMinBound :: SBounded a => Sing (MinBound :: a)
sMaxBound :: SBounded a => Sing (MaxBound :: a)
class PEnum a where {
type Succ (arg :: a) :: a;
type Pred (arg :: a) :: a;
type ToEnum (arg :: Natural) :: a;
type FromEnum (arg :: a) :: Natural;
type EnumFromTo (arg :: a) (arg1 :: a) :: [a];
type EnumFromThenTo (arg :: a) (arg1 :: a) (arg2 :: a) :: [a];
type Succ arg :: a = Succ_6989586621679414077 arg;
type Pred arg :: a = Pred_6989586621679414092 arg;
type EnumFromTo arg :: a arg1 :: a = EnumFromTo_6989586621679414102 arg arg1;
type EnumFromThenTo arg :: a arg1 :: a arg2 :: a = EnumFromThenTo_6989586621679414114 arg arg1 arg2;
}
class SEnum a
sSucc :: forall (t :: a). SEnum a => Sing t -> Sing (Succ t)
($dmsSucc) :: forall (t :: a). (SEnum a, Succ t ~ Succ_6989586621679414077 t) => Sing t -> Sing (Succ t)
sPred :: forall (t :: a). SEnum a => Sing t -> Sing (Pred t)
($dmsPred) :: forall (t :: a). (SEnum a, Pred t ~ Pred_6989586621679414092 t) => Sing t -> Sing (Pred t)
sToEnum :: forall (t :: Natural). SEnum a => Sing t -> Sing (ToEnum t :: a)
sFromEnum :: forall (t :: a). SEnum a => Sing t -> Sing (FromEnum t)
sEnumFromTo :: forall (t1 :: a) (t2 :: a). SEnum a => Sing t1 -> Sing t2 -> Sing (EnumFromTo t1 t2)
($dmsEnumFromTo) :: forall (t1 :: a) (t2 :: a). (SEnum a, EnumFromTo t1 t2 ~ EnumFromTo_6989586621679414102 t1 t2) => Sing t1 -> Sing t2 -> Sing (EnumFromTo t1 t2)
sEnumFromThenTo :: forall (t1 :: a) (t2 :: a) (t3 :: a). SEnum a => Sing t1 -> Sing t2 -> Sing t3 -> Sing (EnumFromThenTo t1 t2 t3)
($dmsEnumFromThenTo) :: forall (t1 :: a) (t2 :: a) (t3 :: a). (SEnum a, EnumFromThenTo t1 t2 t3 ~ EnumFromThenTo_6989586621679414114 t1 t2 t3) => Sing t1 -> Sing t2 -> Sing t3 -> Sing (EnumFromThenTo t1 t2 t3)
type family MinBoundSym0 :: a
type family MaxBoundSym0 :: a
data SuccSym0 (a1 :: TyFun a a)
type family SuccSym1 (a6989586621679414054 :: a) :: a
data PredSym0 (a1 :: TyFun a a)
type family PredSym1 (a6989586621679414057 :: a) :: a
data ToEnumSym0 (a1 :: TyFun Natural a)
type family ToEnumSym1 (a6989586621679414060 :: Natural) :: a
data FromEnumSym0 (a1 :: TyFun a Natural)
type family FromEnumSym1 (a6989586621679414063 :: a) :: Natural
data EnumFromToSym0 (a1 :: TyFun a a ~> [a])
data EnumFromToSym1 (a6989586621679414067 :: a) (b :: TyFun a [a])
type family EnumFromToSym2 (a6989586621679414067 :: a) (a6989586621679414068 :: a) :: [a]
data EnumFromThenToSym0 (a1 :: TyFun a a ~> a ~> [a])
data EnumFromThenToSym1 (a6989586621679414073 :: a) (b :: TyFun a a ~> [a])
data EnumFromThenToSym2 (a6989586621679414073 :: a) (a6989586621679414074 :: a) (c :: TyFun a [a])
type family EnumFromThenToSym3 (a6989586621679414073 :: a) (a6989586621679414074 :: a) (a6989586621679414075 :: a) :: [a]
instance Data.Singletons.Base.Enum.PBounded GHC.Types.Bool
instance Data.Singletons.Base.Enum.PBounded GHC.Types.Char
instance Data.Singletons.Base.Enum.PBounded (GHC.Internal.Data.Functor.Identity.Identity a)
instance Data.Singletons.Base.Enum.PBounded GHC.Types.Ordering
instance Data.Singletons.Base.Enum.PBounded (a, b)
instance Data.Singletons.Base.Enum.PBounded (a, b, c)
instance Data.Singletons.Base.Enum.PBounded (a, b, c, d)
instance Data.Singletons.Base.Enum.PBounded (a, b, c, d, e)
instance Data.Singletons.Base.Enum.PBounded (a, b, c, d, e, f)
instance Data.Singletons.Base.Enum.PBounded (a, b, c, d, e, f, g)
instance Data.Singletons.Base.Enum.PBounded ()
instance Data.Singletons.Base.Enum.PEnum GHC.Types.Bool
instance Data.Singletons.Base.Enum.PEnum GHC.Types.Char
instance Data.Singletons.Base.Enum.PEnum GHC.Num.Natural.Natural
instance Data.Singletons.Base.Enum.PEnum GHC.Types.Ordering
instance Data.Singletons.Base.Enum.PEnum ()
instance Data.Singletons.Base.Enum.SBounded GHC.Types.Bool
instance Data.Singletons.Base.Enum.SBounded GHC.Types.Char
instance Data.Singletons.Base.Enum.SBounded a => Data.Singletons.Base.Enum.SBounded (GHC.Internal.Data.Functor.Identity.Identity a)
instance Data.Singletons.Base.Enum.SBounded GHC.Types.Ordering
instance (Data.Singletons.Base.Enum.SBounded a, Data.Singletons.Base.Enum.SBounded b) => Data.Singletons.Base.Enum.SBounded (a, b)
instance (Data.Singletons.Base.Enum.SBounded a, Data.Singletons.Base.Enum.SBounded b, Data.Singletons.Base.Enum.SBounded c) => Data.Singletons.Base.Enum.SBounded (a, b, c)
instance (Data.Singletons.Base.Enum.SBounded a, Data.Singletons.Base.Enum.SBounded b, Data.Singletons.Base.Enum.SBounded c, Data.Singletons.Base.Enum.SBounded d) => Data.Singletons.Base.Enum.SBounded (a, b, c, d)
instance (Data.Singletons.Base.Enum.SBounded a, Data.Singletons.Base.Enum.SBounded b, Data.Singletons.Base.Enum.SBounded c, Data.Singletons.Base.Enum.SBounded d, Data.Singletons.Base.Enum.SBounded e) => Data.Singletons.Base.Enum.SBounded (a, b, c, d, e)
instance (Data.Singletons.Base.Enum.SBounded a, Data.Singletons.Base.Enum.SBounded b, Data.Singletons.Base.Enum.SBounded c, Data.Singletons.Base.Enum.SBounded d, Data.Singletons.Base.Enum.SBounded e, Data.Singletons.Base.Enum.SBounded f) => Data.Singletons.Base.Enum.SBounded (a, b, c, d, e, f)
instance (Data.Singletons.Base.Enum.SBounded a, Data.Singletons.Base.Enum.SBounded b, Data.Singletons.Base.Enum.SBounded c, Data.Singletons.Base.Enum.SBounded d, Data.Singletons.Base.Enum.SBounded e, Data.Singletons.Base.Enum.SBounded f, Data.Singletons.Base.Enum.SBounded g) => Data.Singletons.Base.Enum.SBounded (a, b, c, d, e, f, g)
instance Data.Singletons.Base.Enum.SBounded ()
instance Data.Singletons.Base.Enum.SEnum GHC.Types.Bool
instance Data.Singletons.Base.Enum.SEnum GHC.Types.Char
instance Data.Singletons.Base.Enum.SEnum GHC.Num.Natural.Natural
instance Data.Singletons.Base.Enum.SEnum GHC.Types.Ordering
instance Data.Singletons.Base.Enum.SEnum ()
instance Data.Singletons.SingI1 Data.Singletons.Base.Enum.EfdtNatDnSym1
instance Data.Singletons.SingI d => Data.Singletons.SingI1 (Data.Singletons.Base.Enum.EfdtNatDnSym2 d)
instance Data.Singletons.SingI1 Data.Singletons.Base.Enum.EfdtNatSym1
instance Data.Singletons.SingI d => Data.Singletons.SingI1 (Data.Singletons.Base.Enum.EfdtNatSym2 d)
instance Data.Singletons.SingI1 Data.Singletons.Base.Enum.EfdtNatUpSym1
instance Data.Singletons.SingI d => Data.Singletons.SingI1 (Data.Singletons.Base.Enum.EfdtNatUpSym2 d)
instance Data.Singletons.SingI1 Data.Singletons.Base.Enum.EftNatSym1
instance Data.Singletons.Base.Enum.SEnum a => Data.Singletons.SingI1 Data.Singletons.Base.Enum.EnumFromThenToSym1
instance forall a (d :: a). (Data.Singletons.Base.Enum.SEnum a, Data.Singletons.SingI d) => Data.Singletons.SingI1 (Data.Singletons.Base.Enum.EnumFromThenToSym2 d)
instance Data.Singletons.Base.Enum.SEnum a => Data.Singletons.SingI1 Data.Singletons.Base.Enum.EnumFromToSym1
instance Data.Singletons.SingI2 Data.Singletons.Base.Enum.EfdtNatDnSym2
instance Data.Singletons.SingI2 Data.Singletons.Base.Enum.EfdtNatSym2
instance Data.Singletons.SingI2 Data.Singletons.Base.Enum.EfdtNatUpSym2
instance Data.Singletons.Base.Enum.SEnum a => Data.Singletons.SingI2 Data.Singletons.Base.Enum.EnumFromThenToSym2
instance Data.Singletons.SingI Data.Singletons.Base.Enum.EfdtNatDnSym0
instance Data.Singletons.SingI d => Data.Singletons.SingI (Data.Singletons.Base.Enum.EfdtNatDnSym1 d)
instance (Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.Singletons.Base.Enum.EfdtNatDnSym2 d1 d2)
instance Data.Singletons.SingI Data.Singletons.Base.Enum.EfdtNatSym0
instance Data.Singletons.SingI d => Data.Singletons.SingI (Data.Singletons.Base.Enum.EfdtNatSym1 d)
instance (Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.Singletons.Base.Enum.EfdtNatSym2 d1 d2)
instance Data.Singletons.SingI Data.Singletons.Base.Enum.EfdtNatUpSym0
instance Data.Singletons.SingI d => Data.Singletons.SingI (Data.Singletons.Base.Enum.EfdtNatUpSym1 d)
instance (Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.Singletons.Base.Enum.EfdtNatUpSym2 d1 d2)
instance Data.Singletons.SingI Data.Singletons.Base.Enum.EftNatSym0
instance Data.Singletons.SingI d => Data.Singletons.SingI (Data.Singletons.Base.Enum.EftNatSym1 d)
instance Data.Singletons.Base.Enum.SEnum a => Data.Singletons.SingI Data.Singletons.Base.Enum.EnumFromThenToSym0
instance forall a (d :: a). (Data.Singletons.Base.Enum.SEnum a, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Singletons.Base.Enum.EnumFromThenToSym1 d)
instance forall a (d1 :: a) (d2 :: a). (Data.Singletons.Base.Enum.SEnum a, Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.Singletons.Base.Enum.EnumFromThenToSym2 d1 d2)
instance Data.Singletons.Base.Enum.SEnum a => Data.Singletons.SingI Data.Singletons.Base.Enum.EnumFromToSym0
instance forall a (d :: a). (Data.Singletons.Base.Enum.SEnum a, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Singletons.Base.Enum.EnumFromToSym1 d)
instance Data.Singletons.Base.Enum.SEnum a => Data.Singletons.SingI Data.Singletons.Base.Enum.FromEnumSym0
instance Data.Singletons.Base.Enum.SEnum a => Data.Singletons.SingI Data.Singletons.Base.Enum.PredSym0
instance Data.Singletons.Base.Enum.SEnum a => Data.Singletons.SingI Data.Singletons.Base.Enum.SuccSym0
instance Data.Singletons.Base.Enum.SEnum a => Data.Singletons.SingI Data.Singletons.Base.Enum.ToEnumSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Singletons.Base.Enum.EfdtNatDnSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.EfdtNatDnSym1 a6989586621679413901)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.EfdtNatDnSym2 a6989586621679413901 a6989586621679413902)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Singletons.Base.Enum.EfdtNatSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.EfdtNatSym1 a6989586621679413999)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.EfdtNatSym2 a6989586621679413999 a6989586621679414000)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Singletons.Base.Enum.EfdtNatUpSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.EfdtNatUpSym1 a6989586621679413950)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.EfdtNatUpSym2 a6989586621679413950 a6989586621679413951)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Singletons.Base.Enum.EftNatSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.EftNatSym1 a6989586621679414025)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Singletons.Base.Enum.EnumFromThenToSym0
instance forall a (a6989586621679414073 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.EnumFromThenToSym1 a6989586621679414073)
instance forall a (a6989586621679414073 :: a) (a6989586621679414074 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.EnumFromThenToSym2 a6989586621679414073 a6989586621679414074)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Singletons.Base.Enum.EnumFromToSym0
instance forall a (a6989586621679414067 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.EnumFromToSym1 a6989586621679414067)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Singletons.Base.Enum.FromEnumSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679413907Sym0 arg_69895866216794138336989586621679413904 arg_69895866216794138356989586621679413905 arg_69895866216794138376989586621679413906)
instance forall k1 (arg_69895866216794138336989586621679413904 :: GHC.Num.Natural.Natural) (arg_69895866216794138356989586621679413905 :: GHC.Num.Natural.Natural) (arg_69895866216794138376989586621679413906 :: GHC.Num.Natural.Natural) (a_69895866216794139396989586621679413940 :: k1). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679413907Sym1 arg_69895866216794138336989586621679413904 arg_69895866216794138356989586621679413905 arg_69895866216794138376989586621679413906 a_69895866216794139396989586621679413940)
instance forall k1 (arg_69895866216794138336989586621679413904 :: GHC.Num.Natural.Natural) (arg_69895866216794138356989586621679413905 :: GHC.Num.Natural.Natural) (arg_69895866216794138376989586621679413906 :: GHC.Num.Natural.Natural) (a_69895866216794139396989586621679413940 :: k1) (a_69895866216794139416989586621679413942 :: k1). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679413907Sym2 arg_69895866216794138336989586621679413904 arg_69895866216794138356989586621679413905 arg_69895866216794138376989586621679413906 a_69895866216794139396989586621679413940 a_69895866216794139416989586621679413942)
instance forall k1 (x16989586621679413909 :: k1) (x26989586621679413910 :: k1) (y6989586621679413911 :: k1) (arg_69895866216794138336989586621679413904 :: GHC.Num.Natural.Natural) (arg_69895866216794138356989586621679413905 :: GHC.Num.Natural.Natural) (arg_69895866216794138376989586621679413906 :: GHC.Num.Natural.Natural). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679413912Sym0 x16989586621679413909 x26989586621679413910 y6989586621679413911 arg_69895866216794138336989586621679413904 arg_69895866216794138356989586621679413905 arg_69895866216794138376989586621679413906)
instance forall a k1 k2 (x16989586621679413909 :: a) (x26989586621679413910 :: k1) (y6989586621679413911 :: k2) (arg_69895866216794138336989586621679413904 :: GHC.Num.Natural.Natural) (arg_69895866216794138356989586621679413905 :: GHC.Num.Natural.Natural) (arg_69895866216794138376989586621679413906 :: GHC.Num.Natural.Natural). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679413914Sym0 x16989586621679413909 x26989586621679413910 y6989586621679413911 arg_69895866216794138336989586621679413904 arg_69895866216794138356989586621679413905 arg_69895866216794138376989586621679413906)
instance forall k (arg_69895866216794138396989586621679413922 :: k) (x16989586621679413909 :: k) (x26989586621679413910 :: k) (y6989586621679413911 :: k) (arg_69895866216794138336989586621679413904 :: GHC.Num.Natural.Natural) (arg_69895866216794138356989586621679413905 :: GHC.Num.Natural.Natural) (arg_69895866216794138376989586621679413906 :: GHC.Num.Natural.Natural). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679413923Sym0 arg_69895866216794138396989586621679413922 x16989586621679413909 x26989586621679413910 y6989586621679413911 arg_69895866216794138336989586621679413904 arg_69895866216794138356989586621679413905 arg_69895866216794138376989586621679413906)
instance forall k (x6989586621679413925 :: k) (arg_69895866216794138396989586621679413922 :: k) (x16989586621679413909 :: k) (x26989586621679413910 :: k) (y6989586621679413911 :: k) (arg_69895866216794138336989586621679413904 :: GHC.Num.Natural.Natural) (arg_69895866216794138356989586621679413905 :: GHC.Num.Natural.Natural) (arg_69895866216794138376989586621679413906 :: GHC.Num.Natural.Natural). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679413926Sym0 x6989586621679413925 arg_69895866216794138396989586621679413922 x16989586621679413909 x26989586621679413910 y6989586621679413911 arg_69895866216794138336989586621679413904 arg_69895866216794138356989586621679413905 arg_69895866216794138376989586621679413906)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679413956Sym0 arg_69895866216794138256989586621679413953 arg_69895866216794138276989586621679413954 arg_69895866216794138296989586621679413955)
instance forall k1 (arg_69895866216794138256989586621679413953 :: GHC.Num.Natural.Natural) (arg_69895866216794138276989586621679413954 :: GHC.Num.Natural.Natural) (arg_69895866216794138296989586621679413955 :: GHC.Num.Natural.Natural) (a_69895866216794139886989586621679413989 :: k1). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679413956Sym1 arg_69895866216794138256989586621679413953 arg_69895866216794138276989586621679413954 arg_69895866216794138296989586621679413955 a_69895866216794139886989586621679413989)
instance forall k1 (arg_69895866216794138256989586621679413953 :: GHC.Num.Natural.Natural) (arg_69895866216794138276989586621679413954 :: GHC.Num.Natural.Natural) (arg_69895866216794138296989586621679413955 :: GHC.Num.Natural.Natural) (a_69895866216794139886989586621679413989 :: k1) (a_69895866216794139906989586621679413991 :: k1). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679413956Sym2 arg_69895866216794138256989586621679413953 arg_69895866216794138276989586621679413954 arg_69895866216794138296989586621679413955 a_69895866216794139886989586621679413989 a_69895866216794139906989586621679413991)
instance forall k1 (x16989586621679413958 :: k1) (x26989586621679413959 :: k1) (y6989586621679413960 :: k1) (arg_69895866216794138256989586621679413953 :: GHC.Num.Natural.Natural) (arg_69895866216794138276989586621679413954 :: GHC.Num.Natural.Natural) (arg_69895866216794138296989586621679413955 :: GHC.Num.Natural.Natural). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679413961Sym0 x16989586621679413958 x26989586621679413959 y6989586621679413960 arg_69895866216794138256989586621679413953 arg_69895866216794138276989586621679413954 arg_69895866216794138296989586621679413955)
instance forall a k1 k2 (x16989586621679413958 :: a) (x26989586621679413959 :: k1) (y6989586621679413960 :: k2) (arg_69895866216794138256989586621679413953 :: GHC.Num.Natural.Natural) (arg_69895866216794138276989586621679413954 :: GHC.Num.Natural.Natural) (arg_69895866216794138296989586621679413955 :: GHC.Num.Natural.Natural). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679413963Sym0 x16989586621679413958 x26989586621679413959 y6989586621679413960 arg_69895866216794138256989586621679413953 arg_69895866216794138276989586621679413954 arg_69895866216794138296989586621679413955)
instance forall k (arg_69895866216794138316989586621679413971 :: k) (x16989586621679413958 :: k) (x26989586621679413959 :: k) (y6989586621679413960 :: k) (arg_69895866216794138256989586621679413953 :: GHC.Num.Natural.Natural) (arg_69895866216794138276989586621679413954 :: GHC.Num.Natural.Natural) (arg_69895866216794138296989586621679413955 :: GHC.Num.Natural.Natural). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679413972Sym0 arg_69895866216794138316989586621679413971 x16989586621679413958 x26989586621679413959 y6989586621679413960 arg_69895866216794138256989586621679413953 arg_69895866216794138276989586621679413954 arg_69895866216794138296989586621679413955)
instance forall k (x6989586621679413974 :: k) (arg_69895866216794138316989586621679413971 :: k) (x16989586621679413958 :: k) (x26989586621679413959 :: k) (y6989586621679413960 :: k) (arg_69895866216794138256989586621679413953 :: GHC.Num.Natural.Natural) (arg_69895866216794138276989586621679413954 :: GHC.Num.Natural.Natural) (arg_69895866216794138296989586621679413955 :: GHC.Num.Natural.Natural). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679413975Sym0 x6989586621679413974 arg_69895866216794138316989586621679413971 x16989586621679413958 x26989586621679413959 y6989586621679413960 arg_69895866216794138256989586621679413953 arg_69895866216794138276989586621679413954 arg_69895866216794138296989586621679413955)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679414005Sym0 arg_69895866216794138196989586621679414002 arg_69895866216794138216989586621679414003 arg_69895866216794138236989586621679414004)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679414005Sym1 arg_69895866216794138196989586621679414002 arg_69895866216794138216989586621679414003 arg_69895866216794138236989586621679414004 a_69895866216794140156989586621679414016)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679414005Sym2 arg_69895866216794138196989586621679414002 arg_69895866216794138216989586621679414003 arg_69895866216794138236989586621679414004 a_69895866216794140156989586621679414016 a_69895866216794140176989586621679414018)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679414010Sym0 x16989586621679414007 x26989586621679414008 y6989586621679414009 arg_69895866216794138196989586621679414002 arg_69895866216794138216989586621679414003 arg_69895866216794138236989586621679414004)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679414029Sym0 arg_69895866216794138156989586621679414027 arg_69895866216794138176989586621679414028)
instance forall k1 (arg_69895866216794138156989586621679414027 :: GHC.Num.Natural.Natural) (arg_69895866216794138176989586621679414028 :: GHC.Num.Natural.Natural) (a_69895866216794140476989586621679414048 :: k1). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679414029Sym1 arg_69895866216794138156989586621679414027 arg_69895866216794138176989586621679414028 a_69895866216794140476989586621679414048)
instance forall k1 k2 (x6989586621679414036 :: k1) (x06989586621679414031 :: k2) (y6989586621679414032 :: k1) (arg_69895866216794138156989586621679414027 :: GHC.Num.Natural.Natural) (arg_69895866216794138176989586621679414028 :: GHC.Num.Natural.Natural). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679414037Sym0 x6989586621679414036 x06989586621679414031 y6989586621679414032 arg_69895866216794138156989586621679414027 arg_69895866216794138176989586621679414028)
instance forall a (x06989586621679414031 :: a) (y6989586621679414032 :: a) (arg_69895866216794138156989586621679414027 :: GHC.Num.Natural.Natural) (arg_69895866216794138176989586621679414028 :: GHC.Num.Natural.Natural). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679414042Sym0 x06989586621679414031 y6989586621679414032 arg_69895866216794138156989586621679414027 arg_69895866216794138176989586621679414028)
instance forall k a6989586621679413782 (a_69895866216794140796989586621679414084 :: a6989586621679413782). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679414085Sym0 a6989586621679413782 a_69895866216794140796989586621679414084)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679432427Sym0 n6989586621679432426)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679432429Sym0 n6989586621679432426)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679432451Sym0 n6989586621679432450)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679432453Sym0 n6989586621679432450)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679432455Sym0 n6989586621679432450)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.LamCases_6989586621679432480Sym0 n6989586621679432479)
instance forall k (x16989586621679413909 :: k) (x26989586621679413910 :: k) (y6989586621679413911 :: k) (arg_69895866216794138336989586621679413904 :: GHC.Num.Natural.Natural) (arg_69895866216794138356989586621679413905 :: GHC.Num.Natural.Natural) (arg_69895866216794138376989586621679413906 :: GHC.Num.Natural.Natural). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.Let6989586621679413919Go_dnSym0 x16989586621679413909 x26989586621679413910 y6989586621679413911 arg_69895866216794138336989586621679413904 arg_69895866216794138356989586621679413905 arg_69895866216794138376989586621679413906)
instance forall k (x16989586621679413958 :: k) (x26989586621679413959 :: k) (y6989586621679413960 :: k) (arg_69895866216794138256989586621679413953 :: GHC.Num.Natural.Natural) (arg_69895866216794138276989586621679413954 :: GHC.Num.Natural.Natural) (arg_69895866216794138296989586621679413955 :: GHC.Num.Natural.Natural). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.Let6989586621679413968Go_upSym0 x16989586621679413958 x26989586621679413959 y6989586621679413960 arg_69895866216794138256989586621679413953 arg_69895866216794138276989586621679413954 arg_69895866216794138296989586621679413955)
instance forall k1 k2 (x06989586621679414031 :: k1) (y6989586621679414032 :: k2) (arg_69895866216794138156989586621679414027 :: GHC.Num.Natural.Natural) (arg_69895866216794138176989586621679414028 :: GHC.Num.Natural.Natural). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.Enum.Let6989586621679414033GoSym0 x06989586621679414031 y6989586621679414032 arg_69895866216794138156989586621679414027 arg_69895866216794138176989586621679414028)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Singletons.Base.Enum.PredSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Singletons.Base.Enum.SuccSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Singletons.Base.Enum.ToEnumSym0
-- | Defines a drop-in replacement for TypeError (from
-- GHC.TypeLits) that can be used at the value level as well.
-- Since this is a drop-in replacement, it is not recommended to import
-- all of GHC.TypeLits and Data.Singletons.Base.TypeError
-- at the same time, as many of the definitions in the latter
-- deliberately clash with the former.
module Data.Singletons.Base.TypeError
-- | A drop-in replacement for TypeError. This also exists at the
-- value-level as typeError.
type family TypeError (x :: PErrorMessage) :: a
-- | The singleton for typeError.
--
-- Note that this is not quite as expressive as TypeError, as it
-- is unable to handle ShowType constructors at all.
sTypeError :: forall {k} (err :: PErrorMessage). HasCallStack => Sing err -> Sing (TypeError err :: k)
-- | The value-level counterpart to TypeError.
--
-- Note that this is not quite as expressive as TypeError, as it
-- is unable to print the contents of ShowType constructors (it
-- will simply print "<type>" in their place).
typeError :: HasCallStack => ErrorMessage -> a
-- | A description of a custom type error.
--
-- This is a variation on ErrorMessage that is parameterized over
-- what text type is used in the Text constructor. Instantiating
-- it with Text gives you ErrorMessage, and instantiating
-- it with Symbol gives you PErrorMessage.
data ErrorMessage' s
-- | Show the text as is.
Text :: s -> ErrorMessage' s
-- | Pretty print the type. ShowType :: k -> ErrorMessage
ShowType :: t -> ErrorMessage' s
-- | Put two pieces of error message next to each other.
(:<>:) :: ErrorMessage' s -> ErrorMessage' s -> ErrorMessage' s
-- | Stack two pieces of error message on top of each other.
(:$$:) :: ErrorMessage' s -> ErrorMessage' s -> ErrorMessage' s
infixl 5 :$$:
infixl 6 :<>:
-- | A value-level ErrorMessage' which uses Text as its text
-- type.
type ErrorMessage = ErrorMessage' Text
-- | A type-level ErrorMessage' which uses Symbol as its text
-- kind.
type PErrorMessage = ErrorMessage' Symbol
type family Sing :: k -> Type
data SErrorMessage (a :: PErrorMessage)
[SText] :: forall (t :: Symbol). Sing t -> SErrorMessage ('Text t)
[SShowType] :: forall {k} (ty :: k). Sing ty -> SErrorMessage ('ShowType ty :: ErrorMessage' Symbol)
[:%<>:] :: forall (e1 :: ErrorMessage' Symbol) (e2 :: ErrorMessage' Symbol). Sing e1 -> Sing e2 -> SErrorMessage (e1 ':<>: e2)
[:%$$:] :: forall (e1 :: ErrorMessage' Symbol) (e2 :: ErrorMessage' Symbol). Sing e1 -> Sing e2 -> SErrorMessage (e1 ':$$: e2)
infixl 5 :%$$:
infixl 6 :%<>:
-- | Convert a PErrorMessage to a ErrorMessage from
-- GHC.TypeLits.
type family ConvertPErrorMessage (a :: PErrorMessage) :: ErrorMessage
-- | Convert an ErrorMessage into a human-readable String.
showErrorMessage :: ErrorMessage -> String
data TextSym0 (a :: TyFun s ErrorMessage' s)
type family TextSym1 (a6989586621679803706 :: s) :: ErrorMessage' s
data ShowTypeSym0 (a :: TyFun t ErrorMessage' s)
type family ShowTypeSym1 (a6989586621679803708 :: t) :: ErrorMessage' s
data (a :: TyFun ErrorMessage' s ErrorMessage' s ~> ErrorMessage' s) :<>:@#@$
infixl 6 :<>:@#@$
data (a6989586621679803710 :: ErrorMessage' s) :<>:@#@$$ (b :: TyFun ErrorMessage' s ErrorMessage' s)
infixl 6 :<>:@#@$$
type family (a6989586621679803710 :: ErrorMessage' s) :<>:@#@$$$ (a6989586621679803711 :: ErrorMessage' s) :: ErrorMessage' s
infixl 6 :<>:@#@$$$
data (a :: TyFun ErrorMessage' s ErrorMessage' s ~> ErrorMessage' s) :$$:@#@$
infixl 5 :$$:@#@$
data (a6989586621679803713 :: ErrorMessage' s) :$$:@#@$$ (b :: TyFun ErrorMessage' s ErrorMessage' s)
infixl 5 :$$:@#@$$
type family (a6989586621679803713 :: ErrorMessage' s) :$$:@#@$$$ (a6989586621679803714 :: ErrorMessage' s) :: ErrorMessage' s
infixl 5 :$$:@#@$$$
data TypeErrorSym0 (a1 :: TyFun PErrorMessage a)
type family TypeErrorSym1 (a6989586621679803716 :: PErrorMessage) :: a
instance Data.Singletons.SingI e1 => Data.Singletons.SingI1 ('(Data.Singletons.Base.TypeError.:$$:) e1)
instance Data.Singletons.SingI e1 => Data.Singletons.SingI1 ('(Data.Singletons.Base.TypeError.:<>:) e1)
instance Data.Singletons.SingI1 (Data.Singletons.Base.TypeError.:$$:@#@$$)
instance Data.Singletons.SingI1 (Data.Singletons.Base.TypeError.:<>:@#@$$)
instance Data.Singletons.SingI1 'Data.Singletons.Base.TypeError.Text
instance Data.Singletons.SingI1 'Data.Singletons.Base.TypeError.ShowType
instance Data.Singletons.SingI2 '(Data.Singletons.Base.TypeError.:$$:)
instance Data.Singletons.SingI2 '(Data.Singletons.Base.TypeError.:<>:)
instance (Data.Singletons.SingI e1, Data.Singletons.SingI e2) => Data.Singletons.SingI (e1 'Data.Singletons.Base.TypeError.:$$: e2)
instance (Data.Singletons.SingI e1, Data.Singletons.SingI e2) => Data.Singletons.SingI (e1 'Data.Singletons.Base.TypeError.:<>: e2)
instance forall t (ty :: t). Data.Singletons.SingI ty => Data.Singletons.SingI ('Data.Singletons.Base.TypeError.ShowType ty)
instance Data.Singletons.SingI t => Data.Singletons.SingI ('Data.Singletons.Base.TypeError.Text t)
instance Data.Singletons.SingI (Data.Singletons.Base.TypeError.:$$:@#@$)
instance Data.Singletons.SingI x => Data.Singletons.SingI ((Data.Singletons.Base.TypeError.:$$:@#@$$) x)
instance Data.Singletons.SingI (Data.Singletons.Base.TypeError.:<>:@#@$)
instance Data.Singletons.SingI x => Data.Singletons.SingI ((Data.Singletons.Base.TypeError.:<>:@#@$$) x)
instance Data.Singletons.SingI Data.Singletons.Base.TypeError.ShowTypeSym0
instance Data.Singletons.SingI Data.Singletons.Base.TypeError.TextSym0
instance Data.Singletons.SingI Data.Singletons.Base.TypeError.TypeErrorSym0
instance Data.Singletons.SingKind Data.Singletons.Base.TypeError.PErrorMessage
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.TypeError.:$$:@#@$)
instance forall s (a6989586621679803713 :: Data.Singletons.Base.TypeError.ErrorMessage' s). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings ((Data.Singletons.Base.TypeError.:$$:@#@$$) a6989586621679803713)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Singletons.Base.TypeError.:<>:@#@$)
instance forall s (a6989586621679803710 :: Data.Singletons.Base.TypeError.ErrorMessage' s). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings ((Data.Singletons.Base.TypeError.:<>:@#@$$) a6989586621679803710)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Singletons.Base.TypeError.ShowTypeSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Singletons.Base.TypeError.TextSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Singletons.Base.TypeError.TypeErrorSym0
-- | Defines the SShow singleton version of the Show type class.
module Text.Show.Singletons
class PShow a where {
type ShowsPrec (arg :: Natural) (arg1 :: a) (arg2 :: Symbol) :: Symbol;
type Show_ (arg :: a) :: Symbol;
type ShowList (arg :: [a]) (arg1 :: Symbol) :: Symbol;
type ShowsPrec arg :: Natural arg1 :: a arg2 :: Symbol = ShowsPrec_6989586621679807423 arg arg1 arg2;
type Show_ arg :: a = Show__6989586621679807435 arg;
type ShowList arg :: [a] arg1 :: Symbol = ShowList_6989586621679807443 arg arg1;
}
class SShow a
sShowsPrec :: forall (t1 :: Natural) (t2 :: a) (t3 :: Symbol). SShow a => Sing t1 -> Sing t2 -> Sing t3 -> Sing (ShowsPrec t1 t2 t3)
($dmsShowsPrec) :: forall (t1 :: Natural) (t2 :: a) (t3 :: Symbol). (SShow a, ShowsPrec t1 t2 t3 ~ ShowsPrec_6989586621679807423 t1 t2 t3) => Sing t1 -> Sing t2 -> Sing t3 -> Sing (ShowsPrec t1 t2 t3)
sShow_ :: forall (t :: a). SShow a => Sing t -> Sing (Show_ t)
($dmsShow_) :: forall (t :: a). (SShow a, Show_ t ~ Show__6989586621679807435 t) => Sing t -> Sing (Show_ t)
sShowList :: forall (t1 :: [a]) (t2 :: Symbol). SShow a => Sing t1 -> Sing t2 -> Sing (ShowList t1 t2)
($dmsShowList) :: forall (t1 :: [a]) (t2 :: Symbol). (SShow a, ShowList t1 t2 ~ ShowList_6989586621679807443 t1 t2) => Sing t1 -> Sing t2 -> Sing (ShowList t1 t2)
-- | The shows functions return a function that prepends the
-- output Symbol to an existing Symbol. This allows
-- constant-time concatenation of results using function composition.
type SymbolS = Symbol -> Symbol
-- | show, but with an extra underscore so that its promoted
-- counterpart (Show_) will not clash with the Show
-- class.
show_ :: Show a => a -> String
type family Shows (a1 :: a) (a2 :: Symbol) :: Symbol
sShows :: forall a (t1 :: a) (t2 :: Symbol). SShow a => Sing t1 -> Sing t2 -> Sing (Shows t1 t2)
type family ShowListWith (a1 :: a ~> Symbol ~> Symbol) (a2 :: [a]) (a3 :: Symbol) :: Symbol
sShowListWith :: forall a (t1 :: a ~> (Symbol ~> Symbol)) (t2 :: [a]) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (ShowListWith t1 t2 t3)
type family ShowChar (a :: Char) (a1 :: Symbol) :: Symbol
sShowChar :: forall (t1 :: Char) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (ShowChar t1 t2)
type family ShowString (a :: Symbol) (a1 :: Symbol) :: Symbol
sShowString :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (ShowString t1 t2)
type family ShowParen (a :: Bool) (a1 :: Symbol ~> Symbol) (a2 :: Symbol) :: Symbol
sShowParen :: forall (t1 :: Bool) (t2 :: Symbol ~> Symbol) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (ShowParen t1 t2 t3)
type family ShowSpace (a :: Symbol) :: Symbol
sShowSpace :: forall (t :: Symbol). Sing t -> Sing (ShowSpace t)
type family ShowCommaSpace (a :: Symbol) :: Symbol
sShowCommaSpace :: forall (t :: Symbol). Sing t -> Sing (ShowCommaSpace t)
type family AppPrec :: Natural
sAppPrec :: Sing AppPrec
type family AppPrec1 :: Natural
sAppPrec1 :: Sing AppPrec1
data ShowsPrecSym0 (a1 :: TyFun Natural a ~> Symbol ~> Symbol)
data ShowsPrecSym1 (a6989586621679807409 :: Natural) (b :: TyFun a Symbol ~> Symbol)
data ShowsPrecSym2 (a6989586621679807409 :: Natural) (a6989586621679807410 :: a) (c :: TyFun Symbol Symbol)
type family ShowsPrecSym3 (a6989586621679807409 :: Natural) (a6989586621679807410 :: a) (a6989586621679807411 :: Symbol) :: Symbol
data Show_Sym0 (a1 :: TyFun a Symbol)
type family Show_Sym1 (a6989586621679807414 :: a) :: Symbol
data ShowListSym0 (a1 :: TyFun [a] Symbol ~> Symbol)
data ShowListSym1 (a6989586621679807418 :: [a]) (b :: TyFun Symbol Symbol)
type family ShowListSym2 (a6989586621679807418 :: [a]) (a6989586621679807419 :: Symbol) :: Symbol
data ShowsSym0 (a1 :: TyFun a Symbol ~> Symbol)
data ShowsSym1 (a6989586621679807401 :: a) (b :: TyFun Symbol Symbol)
type family ShowsSym2 (a6989586621679807401 :: a) (a6989586621679807402 :: Symbol) :: Symbol
data ShowListWithSym0 (a1 :: TyFun a ~> Symbol ~> Symbol [a] ~> Symbol ~> Symbol)
data ShowListWithSym1 (a6989586621679807383 :: a ~> Symbol ~> Symbol) (b :: TyFun [a] Symbol ~> Symbol)
data ShowListWithSym2 (a6989586621679807383 :: a ~> Symbol ~> Symbol) (a6989586621679807384 :: [a]) (c :: TyFun Symbol Symbol)
type family ShowListWithSym3 (a6989586621679807383 :: a ~> Symbol ~> Symbol) (a6989586621679807384 :: [a]) (a6989586621679807385 :: Symbol) :: Symbol
data ShowCharSym0 (a :: TyFun Char Symbol ~> Symbol)
data ShowCharSym1 (a6989586621679807375 :: Char) (b :: TyFun Symbol Symbol)
type family ShowCharSym2 (a6989586621679807375 :: Char) (a6989586621679807376 :: Symbol) :: Symbol
data ShowStringSym0 (a :: TyFun Symbol Symbol ~> Symbol)
data ShowStringSym1 (a6989586621679807364 :: Symbol) (b :: TyFun Symbol Symbol)
type family ShowStringSym2 (a6989586621679807364 :: Symbol) (a6989586621679807365 :: Symbol) :: Symbol
data ShowParenSym0 (a :: TyFun Bool Symbol ~> Symbol ~> Symbol ~> Symbol)
data ShowParenSym1 (a6989586621679807346 :: Bool) (b :: TyFun Symbol ~> Symbol Symbol ~> Symbol)
data ShowParenSym2 (a6989586621679807346 :: Bool) (a6989586621679807347 :: Symbol ~> Symbol) (c :: TyFun Symbol Symbol)
data ShowSpaceSym0 (a :: TyFun Symbol Symbol)
type family ShowSpaceSym1 (a6989586621679807332 :: Symbol) :: Symbol
data ShowCommaSpaceSym0 (a :: TyFun Symbol Symbol)
type family ShowCommaSpaceSym1 (a6989586621679807326 :: Symbol) :: Symbol
type family AppPrecSym0 :: Natural
type family AppPrec1Sym0 :: Natural
instance Text.Show.Singletons.PShow GHC.Types.Bool
instance Text.Show.Singletons.PShow GHC.Types.Char
instance Text.Show.Singletons.PShow (GHC.Internal.Data.Either.Either a b)
instance Text.Show.Singletons.PShow [a]
instance Text.Show.Singletons.PShow (GHC.Internal.Maybe.Maybe a)
instance Text.Show.Singletons.PShow GHC.Num.Natural.Natural
instance Text.Show.Singletons.PShow (GHC.Internal.Base.NonEmpty a)
instance Text.Show.Singletons.PShow GHC.Types.Ordering
instance Text.Show.Singletons.PShow GHC.Types.Symbol
instance Text.Show.Singletons.PShow (a, b)
instance Text.Show.Singletons.PShow (a, b, c)
instance Text.Show.Singletons.PShow (a, b, c, d)
instance Text.Show.Singletons.PShow (a, b, c, d, e)
instance Text.Show.Singletons.PShow (a, b, c, d, e, f)
instance Text.Show.Singletons.PShow (a, b, c, d, e, f, g)
instance Text.Show.Singletons.PShow ()
instance Text.Show.Singletons.PShow GHC.Internal.Base.Void
instance Text.Show.Singletons.SShow GHC.Types.Bool
instance Text.Show.Singletons.SShow GHC.Types.Char
instance (Text.Show.Singletons.SShow a, Text.Show.Singletons.SShow b) => Text.Show.Singletons.SShow (GHC.Internal.Data.Either.Either a b)
instance Text.Show.Singletons.SShow a => Text.Show.Singletons.SShow [a]
instance Text.Show.Singletons.SShow a => Text.Show.Singletons.SShow (GHC.Internal.Maybe.Maybe a)
instance Text.Show.Singletons.SShow GHC.Num.Natural.Natural
instance (Text.Show.Singletons.SShow a, Text.Show.Singletons.SShow [a]) => Text.Show.Singletons.SShow (GHC.Internal.Base.NonEmpty a)
instance Text.Show.Singletons.SShow GHC.Types.Ordering
instance Text.Show.Singletons.SShow GHC.Types.Symbol
instance (Text.Show.Singletons.SShow a, Text.Show.Singletons.SShow b) => Text.Show.Singletons.SShow (a, b)
instance (Text.Show.Singletons.SShow a, Text.Show.Singletons.SShow b, Text.Show.Singletons.SShow c) => Text.Show.Singletons.SShow (a, b, c)
instance (Text.Show.Singletons.SShow a, Text.Show.Singletons.SShow b, Text.Show.Singletons.SShow c, Text.Show.Singletons.SShow d) => Text.Show.Singletons.SShow (a, b, c, d)
instance (Text.Show.Singletons.SShow a, Text.Show.Singletons.SShow b, Text.Show.Singletons.SShow c, Text.Show.Singletons.SShow d, Text.Show.Singletons.SShow e) => Text.Show.Singletons.SShow (a, b, c, d, e)
instance (Text.Show.Singletons.SShow a, Text.Show.Singletons.SShow b, Text.Show.Singletons.SShow c, Text.Show.Singletons.SShow d, Text.Show.Singletons.SShow e, Text.Show.Singletons.SShow f) => Text.Show.Singletons.SShow (a, b, c, d, e, f)
instance (Text.Show.Singletons.SShow a, Text.Show.Singletons.SShow b, Text.Show.Singletons.SShow c, Text.Show.Singletons.SShow d, Text.Show.Singletons.SShow e, Text.Show.Singletons.SShow f, Text.Show.Singletons.SShow g) => Text.Show.Singletons.SShow (a, b, c, d, e, f, g)
instance Text.Show.Singletons.SShow ()
instance Text.Show.Singletons.SShow GHC.Internal.Base.Void
instance Data.Singletons.SingI1 Text.Show.Singletons.ShowParenSym1
instance Data.Singletons.SingI1 Text.Show.Singletons.ShowCharSym1
instance Data.Singletons.SingI1 Text.Show.Singletons.ShowListWithSym1
instance Data.Singletons.SingI d => Data.Singletons.SingI1 (Text.Show.Singletons.ShowParenSym2 d)
instance Text.Show.Singletons.SShow a => Data.Singletons.SingI1 Text.Show.Singletons.ShowListSym1
instance forall a (d :: a Data.Singletons.~> (GHC.Types.Symbol Data.Singletons.~> GHC.Types.Symbol)). Data.Singletons.SingI d => Data.Singletons.SingI1 (Text.Show.Singletons.ShowListWithSym2 d)
instance Data.Singletons.SingI1 Text.Show.Singletons.Show_tupleSym1
instance Text.Show.Singletons.SShow a => Data.Singletons.SingI1 Text.Show.Singletons.ShowsPrecSym1
instance Data.Singletons.SingI1 Text.Show.Singletons.ShowStringSym1
instance (Text.Show.Singletons.SShow a, Data.Singletons.SingI d) => Data.Singletons.SingI1 (Text.Show.Singletons.ShowsPrecSym2 d)
instance Text.Show.Singletons.SShow a => Data.Singletons.SingI1 Text.Show.Singletons.ShowsSym1
instance Data.Singletons.SingI2 Text.Show.Singletons.ShowParenSym2
instance Data.Singletons.SingI2 Text.Show.Singletons.ShowListWithSym2
instance Text.Show.Singletons.SShow a => Data.Singletons.SingI2 Text.Show.Singletons.ShowsPrecSym2
instance Data.Singletons.SingI Text.Show.Singletons.ShowCharSym0
instance Data.Singletons.SingI d => Data.Singletons.SingI (Text.Show.Singletons.ShowCharSym1 d)
instance Data.Singletons.SingI Text.Show.Singletons.ShowCommaSpaceSym0
instance Text.Show.Singletons.SShow a => Data.Singletons.SingI Text.Show.Singletons.ShowListSym0
instance forall a (d :: [a]). (Text.Show.Singletons.SShow a, Data.Singletons.SingI d) => Data.Singletons.SingI (Text.Show.Singletons.ShowListSym1 d)
instance Data.Singletons.SingI Text.Show.Singletons.ShowListWithSym0
instance forall a (d :: a Data.Singletons.~> (GHC.Types.Symbol Data.Singletons.~> GHC.Types.Symbol)). Data.Singletons.SingI d => Data.Singletons.SingI (Text.Show.Singletons.ShowListWithSym1 d)
instance forall a (d1 :: a Data.Singletons.~> (GHC.Types.Symbol Data.Singletons.~> GHC.Types.Symbol)) (d2 :: [a]). (Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Text.Show.Singletons.ShowListWithSym2 d1 d2)
instance Data.Singletons.SingI Text.Show.Singletons.ShowParenSym0
instance Data.Singletons.SingI d => Data.Singletons.SingI (Text.Show.Singletons.ShowParenSym1 d)
instance (Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Text.Show.Singletons.ShowParenSym2 d1 d2)
instance Data.Singletons.SingI Text.Show.Singletons.ShowSpaceSym0
instance Data.Singletons.SingI Text.Show.Singletons.ShowStringSym0
instance Data.Singletons.SingI d => Data.Singletons.SingI (Text.Show.Singletons.ShowStringSym1 d)
instance Text.Show.Singletons.SShow a => Data.Singletons.SingI Text.Show.Singletons.Show_Sym0
instance Data.Singletons.SingI Text.Show.Singletons.Show_tupleSym0
instance Data.Singletons.SingI d => Data.Singletons.SingI (Text.Show.Singletons.Show_tupleSym1 d)
instance Text.Show.Singletons.SShow a => Data.Singletons.SingI Text.Show.Singletons.ShowsPrecSym0
instance (Text.Show.Singletons.SShow a, Data.Singletons.SingI d) => Data.Singletons.SingI (Text.Show.Singletons.ShowsPrecSym1 d)
instance forall a (d1 :: GHC.Num.Natural.Natural) (d2 :: a). (Text.Show.Singletons.SShow a, Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Text.Show.Singletons.ShowsPrecSym2 d1 d2)
instance Text.Show.Singletons.SShow a => Data.Singletons.SingI Text.Show.Singletons.ShowsSym0
instance forall a (d :: a). (Text.Show.Singletons.SShow a, Data.Singletons.SingI d) => Data.Singletons.SingI (Text.Show.Singletons.ShowsSym1 d)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Text.Show.Singletons.IsDecSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.LamCases_6989586621679807311Sym0 ss6989586621679807309 a_69895866216798073026989586621679807310)
instance forall c a (ss6989586621679807309 :: [GHC.Types.Symbol Data.Singletons.~> GHC.Types.Symbol]) (a_69895866216798073026989586621679807310 :: GHC.Types.Symbol) (a_69895866216798073156989586621679807316 :: GHC.Types.Symbol Data.Singletons.~> c). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.LamCases_6989586621679807311Sym1 ss6989586621679807309 a_69895866216798073026989586621679807310 a_69895866216798073156989586621679807316)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.LamCases_6989586621679807334Sym0 a_69895866216798073286989586621679807333)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.LamCases_6989586621679807352Sym0 b6989586621679807349 p6989586621679807350 a_69895866216798073406989586621679807351)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.LamCases_6989586621679824501Sym0 s6989586621679824500 p6989586621679824494 f6989586621679824495 a_69895866216798244856989586621679824496)
instance forall a k (scrutinee_69895866216798244606989586621679824503 :: GHC.Internal.Maybe.Maybe a) (s6989586621679824500 :: GHC.Types.Symbol) (p6989586621679824494 :: GHC.Types.Char Data.Singletons.~> GHC.Types.Bool) (f6989586621679824495 :: GHC.Types.Symbol Data.Singletons.~> GHC.Types.Symbol) (a_69895866216798244856989586621679824496 :: GHC.Types.Symbol). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.LamCases_6989586621679824504Sym0 scrutinee_69895866216798244606989586621679824503 s6989586621679824500 p6989586621679824494 f6989586621679824495 a_69895866216798244856989586621679824496)
instance forall k a (c6989586621679824506 :: k) (scrutinee_69895866216798244606989586621679824503 :: GHC.Internal.Maybe.Maybe a) (s6989586621679824500 :: GHC.Types.Symbol) (p6989586621679824494 :: GHC.Types.Char Data.Singletons.~> GHC.Types.Bool) (f6989586621679824495 :: GHC.Types.Symbol Data.Singletons.~> GHC.Types.Symbol) (a_69895866216798244856989586621679824496 :: GHC.Types.Symbol). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.LamCases_6989586621679824507Sym0 c6989586621679824506 scrutinee_69895866216798244606989586621679824503 s6989586621679824500 p6989586621679824494 f6989586621679824495 a_69895866216798244856989586621679824496)
instance forall k1 k2 k3 a (c6989586621679824506 :: k1) (scrutinee_69895866216798244606989586621679824503 :: k2) (s6989586621679824500 :: k3) (p6989586621679824494 :: GHC.Types.Char Data.Singletons.~> GHC.Types.Bool) (f6989586621679824495 :: GHC.Types.Symbol Data.Singletons.~> GHC.Types.Symbol) (a_69895866216798244856989586621679824496 :: GHC.Types.Symbol). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.LamCases_6989586621679824509Sym0 c6989586621679824506 scrutinee_69895866216798244606989586621679824503 s6989586621679824500 p6989586621679824494 f6989586621679824495 a_69895866216798244856989586621679824496)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.LamCases_6989586621679824534Sym0 sym6989586621679824532 s6989586621679824533)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.LamCases_6989586621679824560Sym0 arg_69895866216798244546989586621679824558 arg_69895866216798244566989586621679824559)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.LamCases_6989586621679824560Sym1 arg_69895866216798244546989586621679824558 arg_69895866216798244566989586621679824559 a_69895866216798246086989586621679824609)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.LamCases_6989586621679824564Sym0 c6989586621679824562 s6989586621679824563 arg_69895866216798244546989586621679824558 arg_69895866216798244566989586621679824559)
instance forall k1 k2 (c6989586621679824562 :: k1) (s6989586621679824563 :: k2) (arg_69895866216798244546989586621679824558 :: GHC.Types.Char) (arg_69895866216798244566989586621679824559 :: GHC.Types.Symbol). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.LamCases_6989586621679824566Sym0 c6989586621679824562 s6989586621679824563 arg_69895866216798244546989586621679824558 arg_69895866216798244566989586621679824559)
instance forall k1 k2 (c6989586621679824562 :: k1) (s6989586621679824563 :: k2) (arg_69895866216798244546989586621679824558 :: GHC.Types.Char) (arg_69895866216798244566989586621679824559 :: GHC.Types.Symbol) (a_69895866216798246006989586621679824601 :: GHC.Types.Char). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.LamCases_6989586621679824566Sym1 c6989586621679824562 s6989586621679824563 arg_69895866216798244546989586621679824558 arg_69895866216798244566989586621679824559 a_69895866216798246006989586621679824601)
instance forall k1 k2 (c6989586621679824570 :: GHC.Types.Char) (s6989586621679824571 :: GHC.Types.Symbol) (c6989586621679824562 :: k1) (s6989586621679824563 :: k2) (arg_69895866216798244546989586621679824558 :: GHC.Types.Char) (arg_69895866216798244566989586621679824559 :: GHC.Types.Symbol). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.LamCases_6989586621679824572Sym0 c6989586621679824570 s6989586621679824571 c6989586621679824562 s6989586621679824563 arg_69895866216798244546989586621679824558 arg_69895866216798244566989586621679824559)
instance forall k1 k2 k3 k4 (c6989586621679824570 :: k1) (s6989586621679824571 :: k2) (c6989586621679824562 :: k3) (s6989586621679824563 :: k4) (arg_69895866216798244546989586621679824558 :: GHC.Types.Char) (arg_69895866216798244566989586621679824559 :: GHC.Types.Symbol). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.LamCases_6989586621679824574Sym0 c6989586621679824570 s6989586621679824571 c6989586621679824562 s6989586621679824563 arg_69895866216798244546989586621679824558 arg_69895866216798244566989586621679824559)
instance forall k1 k2 k3 k4 (c6989586621679824570 :: k1) (s6989586621679824571 :: k2) (c6989586621679824562 :: k3) (s6989586621679824563 :: k4) (arg_69895866216798244546989586621679824558 :: GHC.Types.Char) (arg_69895866216798244566989586621679824559 :: GHC.Types.Symbol) (a_69895866216798245926989586621679824593 :: GHC.Types.Char). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.LamCases_6989586621679824574Sym1 c6989586621679824570 s6989586621679824571 c6989586621679824562 s6989586621679824563 arg_69895866216798244546989586621679824558 arg_69895866216798244566989586621679824559 a_69895866216798245926989586621679824593)
instance forall k1 k2 k3 k4 k5 (s6989586621679824583 :: k1) (c6989586621679824570 :: k2) (s6989586621679824571 :: k3) (c6989586621679824562 :: k4) (s6989586621679824563 :: k5) (arg_69895866216798244546989586621679824558 :: GHC.Types.Char) (arg_69895866216798244566989586621679824559 :: GHC.Types.Symbol). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.LamCases_6989586621679824584Sym0 s6989586621679824583 c6989586621679824570 s6989586621679824571 c6989586621679824562 s6989586621679824563 arg_69895866216798244546989586621679824558 arg_69895866216798244566989586621679824559)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.LamCases_6989586621679832070Sym0 v_69895866216798320526989586621679832068 a_69895866216798320596989586621679832069)
instance forall a6989586621679806974 k1 k2 (showx6989586621679807387 :: a6989586621679806974 Data.Singletons.~> (GHC.Types.Symbol Data.Singletons.~> GHC.Types.Symbol)) (x6989586621679807388 :: k1) (xs6989586621679807389 :: k2) (s6989586621679807390 :: GHC.Types.Symbol). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.Let6989586621679807391ShowlSym0 showx6989586621679807387 x6989586621679807388 xs6989586621679807389 s6989586621679807390)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.Let6989586621679824497ContSym0 p6989586621679824494 f6989586621679824495 a_69895866216798244856989586621679824496)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Text.Show.Singletons.ProtectEscSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.ProtectEscSym1 a6989586621679824491)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.ProtectEscSym2 a6989586621679824491 a6989586621679824492)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Text.Show.Singletons.ShowCharListSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.ShowCharListSym1 a6989586621679824627)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Text.Show.Singletons.ShowCharSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.ShowCharSym1 a6989586621679807375)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Text.Show.Singletons.ShowCommaSpaceSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Text.Show.Singletons.ShowListSym0
instance forall a (a6989586621679807418 :: [a]). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.ShowListSym1 a6989586621679807418)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Text.Show.Singletons.ShowListWithSym0
instance forall a (a6989586621679807383 :: a Data.Singletons.~> (GHC.Types.Symbol Data.Singletons.~> GHC.Types.Symbol)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.ShowListWithSym1 a6989586621679807383)
instance forall a (a6989586621679807383 :: a Data.Singletons.~> (GHC.Types.Symbol Data.Singletons.~> GHC.Types.Symbol)) (a6989586621679807384 :: [a]). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.ShowListWithSym2 a6989586621679807383 a6989586621679807384)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Text.Show.Singletons.ShowLitCharSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.ShowLitCharSym1 a6989586621679824556)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Text.Show.Singletons.ShowLitStringSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.ShowLitStringSym1 a6989586621679824545)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Text.Show.Singletons.ShowLitSymbolSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.ShowLitSymbolSym1 a6989586621679824530)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Text.Show.Singletons.ShowParenSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.ShowParenSym1 a6989586621679807346)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.ShowParenSym2 a6989586621679807346 a6989586621679807347)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Text.Show.Singletons.ShowSpaceSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Text.Show.Singletons.ShowStringSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.ShowStringSym1 a6989586621679807364)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Text.Show.Singletons.ShowSymbolSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.ShowSymbolSym1 a6989586621679824618)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Text.Show.Singletons.Show_Sym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Text.Show.Singletons.Show_tupleSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.Show_tupleSym1 a6989586621679807307)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Text.Show.Singletons.ShowsCharPrecSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.ShowsCharPrecSym1 a6989586621679824639)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.ShowsCharPrecSym2 a6989586621679824639 a6989586621679824640)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Text.Show.Singletons.ShowsNatSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.ShowsNatSym1 a6989586621679822353)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Text.Show.Singletons.ShowsPrecSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.ShowsPrecSym1 a6989586621679807409)
instance forall a (a6989586621679807409 :: GHC.Num.Natural.Natural) (a6989586621679807410 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.ShowsPrecSym2 a6989586621679807409 a6989586621679807410)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Text.Show.Singletons.ShowsSym0
instance forall a (a6989586621679807401 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Text.Show.Singletons.ShowsSym1 a6989586621679807401)
-- | Defines the promoted version of Monoid, PMonoid, and the
-- singleton version, SMonoid.
module Data.Monoid.Singletons
class PMonoid a where {
type Mempty :: a;
type Mappend (arg :: a) (arg1 :: a) :: a;
type Mconcat (arg :: [a]) :: a;
type Mappend arg :: a arg1 :: a = Mappend_6989586621679860753 arg arg1;
type Mconcat arg :: [a] = Mconcat_6989586621679860767 arg;
}
class SSemigroup a => SMonoid a
sMempty :: SMonoid a => Sing (Mempty :: a)
sMappend :: forall (t1 :: a) (t2 :: a). SMonoid a => Sing t1 -> Sing t2 -> Sing (Mappend t1 t2)
($dmsMappend) :: forall (t1 :: a) (t2 :: a). (SMonoid a, Mappend t1 t2 ~ Mappend_6989586621679860753 t1 t2) => Sing t1 -> Sing t2 -> Sing (Mappend t1 t2)
sMconcat :: forall (t :: [a]). SMonoid a => Sing t -> Sing (Mconcat t)
($dmsMconcat) :: forall (t :: [a]). (SMonoid a, Mconcat t ~ Mconcat_6989586621679860767 t) => Sing t -> Sing (Mconcat t)
type family Sing :: k -> Type
data SDual (a1 :: Dual a)
[SDual] :: forall a (n :: a). Sing n -> SDual ('Dual n)
data SAll (a :: All)
[SAll] :: forall (n :: Bool). Sing n -> SAll ('All n)
data SAny (a :: Any)
[SAny] :: forall (n :: Bool). Sing n -> SAny ('Any n)
data SSum (a1 :: Sum a)
[SSum] :: forall a (n :: a). Sing n -> SSum ('Sum n)
data SProduct (a1 :: Product a)
[SProduct] :: forall a (n :: a). Sing n -> SProduct ('Product n)
data SFirst (a1 :: First a)
[SFirst] :: forall a (n :: Maybe a). Sing n -> SFirst ('First n)
data SLast (a1 :: Last a)
[SLast] :: forall a (n :: Maybe a). Sing n -> SLast ('Last n)
type family GetDual (a1 :: Dual a) :: a
type family GetAll (a :: All) :: Bool
type family GetAny (a :: Any) :: Bool
type family GetSum (a1 :: Sum a) :: a
type family GetProduct (a1 :: Product a) :: a
type family GetFirst (a1 :: First a) :: Maybe a
type family GetLast (a1 :: Last a) :: Maybe a
sGetDual :: forall a (t :: Dual a). Sing t -> Sing (GetDual t)
sGetAll :: forall (t :: All). Sing t -> Sing (GetAll t)
sGetAny :: forall (t :: Any). Sing t -> Sing (GetAny t)
sGetSum :: forall a (t :: Sum a). Sing t -> Sing (GetSum t)
sGetProduct :: forall a (t :: Product a). Sing t -> Sing (GetProduct t)
sGetFirst :: forall a (t :: First a). Sing t -> Sing (GetFirst t)
sGetLast :: forall a (t :: Last a). Sing t -> Sing (GetLast t)
type family MemptySym0 :: a
data MappendSym0 (a1 :: TyFun a a ~> a)
data MappendSym1 (a6989586621679860746 :: a) (b :: TyFun a a)
type family MappendSym2 (a6989586621679860746 :: a) (a6989586621679860747 :: a) :: a
data MconcatSym0 (a1 :: TyFun [a] a)
type family MconcatSym1 (a6989586621679860750 :: [a]) :: a
data DualSym0 (a1 :: TyFun a Dual a)
type family DualSym1 (a6989586621679458575 :: a) :: Dual a
data GetDualSym0 (a1 :: TyFun Dual a a)
type family GetDualSym1 (a6989586621679458578 :: Dual a) :: a
data AllSym0 (a :: TyFun Bool All)
type family AllSym1 (a6989586621679458591 :: Bool) :: All
data GetAllSym0 (a :: TyFun All Bool)
type family GetAllSym1 (a6989586621679458594 :: All) :: Bool
data AnySym0 (a :: TyFun Bool Any)
type family AnySym1 (a6989586621679458607 :: Bool) :: Any
data GetAnySym0 (a :: TyFun Any Bool)
type family GetAnySym1 (a6989586621679458610 :: Any) :: Bool
data SumSym0 (a1 :: TyFun a Sum a)
type family SumSym1 (a6989586621679458626 :: a) :: Sum a
data GetSumSym0 (a1 :: TyFun Sum a a)
type family GetSumSym1 (a6989586621679458629 :: Sum a) :: a
data ProductSym0 (a1 :: TyFun a Product a)
type family ProductSym1 (a6989586621679458645 :: a) :: Product a
data GetProductSym0 (a1 :: TyFun Product a a)
type family GetProductSym1 (a6989586621679458648 :: Product a) :: a
data FirstSym0 (a1 :: TyFun Maybe a First a)
type family FirstSym1 (a6989586621679864297 :: Maybe a) :: First a
data GetFirstSym0 (a1 :: TyFun First a Maybe a)
type family GetFirstSym1 (a6989586621679864300 :: First a) :: Maybe a
data LastSym0 (a1 :: TyFun Maybe a Last a)
type family LastSym1 (a6989586621679864320 :: Maybe a) :: Last a
data GetLastSym0 (a1 :: TyFun Last a Maybe a)
type family GetLastSym1 (a6989586621679864323 :: Last a) :: Maybe a
instance forall a (z :: GHC.Internal.Data.Monoid.First a). GHC.Classes.Eq (Data.Monoid.Singletons.SFirst z)
instance forall a (z :: GHC.Internal.Data.Monoid.Last a). GHC.Classes.Eq (Data.Monoid.Singletons.SLast z)
instance Control.Monad.Singletons.Internal.PApplicative GHC.Internal.Data.Monoid.First
instance Control.Monad.Singletons.Internal.PApplicative GHC.Internal.Data.Monoid.Last
instance Data.Eq.Singletons.PEq (GHC.Internal.Data.Monoid.First a)
instance Data.Eq.Singletons.PEq (GHC.Internal.Data.Monoid.Last a)
instance Control.Monad.Singletons.Internal.PFunctor GHC.Internal.Data.Monoid.First
instance Control.Monad.Singletons.Internal.PFunctor GHC.Internal.Data.Monoid.Last
instance Control.Monad.Singletons.Internal.PMonad GHC.Internal.Data.Monoid.First
instance Control.Monad.Singletons.Internal.PMonad GHC.Internal.Data.Monoid.Last
instance Data.Monoid.Singletons.PMonoid GHC.Internal.Data.Semigroup.Internal.All
instance Data.Monoid.Singletons.PMonoid GHC.Internal.Data.Semigroup.Internal.Any
instance Data.Monoid.Singletons.PMonoid (GHC.Internal.Data.Ord.Down a)
instance Data.Monoid.Singletons.PMonoid (GHC.Internal.Data.Semigroup.Internal.Dual a)
instance Data.Monoid.Singletons.PMonoid (a Data.Singletons.~> b)
instance Data.Monoid.Singletons.PMonoid (GHC.Internal.Data.Monoid.First a)
instance Data.Monoid.Singletons.PMonoid (GHC.Internal.Data.Monoid.Last a)
instance Data.Monoid.Singletons.PMonoid [a]
instance Data.Monoid.Singletons.PMonoid (GHC.Internal.Maybe.Maybe a)
instance Data.Monoid.Singletons.PMonoid GHC.Types.Ordering
instance Data.Monoid.Singletons.PMonoid (GHC.Internal.Data.Semigroup.Internal.Product a)
instance Data.Monoid.Singletons.PMonoid (GHC.Internal.Data.Semigroup.Internal.Sum a)
instance Data.Monoid.Singletons.PMonoid GHC.Types.Symbol
instance Data.Monoid.Singletons.PMonoid (a, b)
instance Data.Monoid.Singletons.PMonoid (a, b, c)
instance Data.Monoid.Singletons.PMonoid (a, b, c, d)
instance Data.Monoid.Singletons.PMonoid (a, b, c, d, e)
instance Data.Monoid.Singletons.PMonoid ()
instance Data.Ord.Singletons.POrd (GHC.Internal.Data.Monoid.First a)
instance Data.Ord.Singletons.POrd (GHC.Internal.Data.Monoid.Last a)
instance Data.Semigroup.Singletons.Internal.Classes.PSemigroup (GHC.Internal.Data.Monoid.First a)
instance Data.Semigroup.Singletons.Internal.Classes.PSemigroup (GHC.Internal.Data.Monoid.Last a)
instance Text.Show.Singletons.PShow (GHC.Internal.Data.Monoid.First a)
instance Text.Show.Singletons.PShow (GHC.Internal.Data.Monoid.Last a)
instance Control.Monad.Singletons.Internal.SApplicative GHC.Internal.Data.Monoid.First
instance Control.Monad.Singletons.Internal.SApplicative GHC.Internal.Data.Monoid.Last
instance Data.Singletons.Decide.SDecide (GHC.Internal.Maybe.Maybe a) => Data.Singletons.Decide.SDecide (GHC.Internal.Data.Monoid.First a)
instance Data.Singletons.Decide.SDecide (GHC.Internal.Maybe.Maybe a) => Data.Singletons.Decide.SDecide (GHC.Internal.Data.Monoid.Last a)
instance Data.Eq.Singletons.SEq (GHC.Internal.Maybe.Maybe a) => Data.Eq.Singletons.SEq (GHC.Internal.Data.Monoid.First a)
instance Data.Eq.Singletons.SEq (GHC.Internal.Maybe.Maybe a) => Data.Eq.Singletons.SEq (GHC.Internal.Data.Monoid.Last a)
instance Control.Monad.Singletons.Internal.SFunctor GHC.Internal.Data.Monoid.First
instance Control.Monad.Singletons.Internal.SFunctor GHC.Internal.Data.Monoid.Last
instance Control.Monad.Singletons.Internal.SMonad GHC.Internal.Data.Monoid.First
instance Control.Monad.Singletons.Internal.SMonad GHC.Internal.Data.Monoid.Last
instance Data.Monoid.Singletons.SMonoid GHC.Internal.Data.Semigroup.Internal.All
instance Data.Monoid.Singletons.SMonoid GHC.Internal.Data.Semigroup.Internal.Any
instance Data.Monoid.Singletons.SMonoid a => Data.Monoid.Singletons.SMonoid (GHC.Internal.Data.Ord.Down a)
instance Data.Monoid.Singletons.SMonoid a => Data.Monoid.Singletons.SMonoid (GHC.Internal.Data.Semigroup.Internal.Dual a)
instance Data.Monoid.Singletons.SMonoid b => Data.Monoid.Singletons.SMonoid (a Data.Singletons.~> b)
instance Data.Monoid.Singletons.SMonoid (GHC.Internal.Data.Monoid.First a)
instance Data.Monoid.Singletons.SMonoid (GHC.Internal.Data.Monoid.Last a)
instance Data.Monoid.Singletons.SMonoid [a]
instance Data.Semigroup.Singletons.Internal.Classes.SSemigroup a => Data.Monoid.Singletons.SMonoid (GHC.Internal.Maybe.Maybe a)
instance Data.Monoid.Singletons.SMonoid GHC.Types.Ordering
instance GHC.Num.Singletons.SNum a => Data.Monoid.Singletons.SMonoid (GHC.Internal.Data.Semigroup.Internal.Product a)
instance GHC.Num.Singletons.SNum a => Data.Monoid.Singletons.SMonoid (GHC.Internal.Data.Semigroup.Internal.Sum a)
instance Data.Monoid.Singletons.SMonoid GHC.Types.Symbol
instance (Data.Monoid.Singletons.SMonoid a, Data.Monoid.Singletons.SMonoid b) => Data.Monoid.Singletons.SMonoid (a, b)
instance (Data.Monoid.Singletons.SMonoid a, Data.Monoid.Singletons.SMonoid b, Data.Monoid.Singletons.SMonoid c) => Data.Monoid.Singletons.SMonoid (a, b, c)
instance (Data.Monoid.Singletons.SMonoid a, Data.Monoid.Singletons.SMonoid b, Data.Monoid.Singletons.SMonoid c, Data.Monoid.Singletons.SMonoid d) => Data.Monoid.Singletons.SMonoid (a, b, c, d)
instance (Data.Monoid.Singletons.SMonoid a, Data.Monoid.Singletons.SMonoid b, Data.Monoid.Singletons.SMonoid c, Data.Monoid.Singletons.SMonoid d, Data.Monoid.Singletons.SMonoid e) => Data.Monoid.Singletons.SMonoid (a, b, c, d, e)
instance Data.Monoid.Singletons.SMonoid ()
instance Data.Ord.Singletons.SOrd (GHC.Internal.Maybe.Maybe a) => Data.Ord.Singletons.SOrd (GHC.Internal.Data.Monoid.First a)
instance Data.Ord.Singletons.SOrd (GHC.Internal.Maybe.Maybe a) => Data.Ord.Singletons.SOrd (GHC.Internal.Data.Monoid.Last a)
instance Data.Semigroup.Singletons.Internal.Classes.SSemigroup (GHC.Internal.Data.Monoid.First a)
instance Data.Semigroup.Singletons.Internal.Classes.SSemigroup (GHC.Internal.Data.Monoid.Last a)
instance Text.Show.Singletons.SShow (GHC.Internal.Maybe.Maybe a) => Text.Show.Singletons.SShow (GHC.Internal.Data.Monoid.First a)
instance Text.Show.Singletons.SShow (GHC.Internal.Maybe.Maybe a) => Text.Show.Singletons.SShow (GHC.Internal.Data.Monoid.Last a)
instance forall a (z :: GHC.Internal.Data.Monoid.First a). Data.Singletons.ShowSing.ShowSing (GHC.Internal.Maybe.Maybe a) => GHC.Internal.Show.Show (Data.Monoid.Singletons.SFirst z)
instance forall a (z :: GHC.Internal.Data.Monoid.Last a). Data.Singletons.ShowSing.ShowSing (GHC.Internal.Maybe.Maybe a) => GHC.Internal.Show.Show (Data.Monoid.Singletons.SLast z)
instance Data.Singletons.SingI1 'GHC.Internal.Data.Monoid.First
instance Data.Singletons.SingI1 'GHC.Internal.Data.Monoid.Last
instance Data.Monoid.Singletons.SMonoid a => Data.Singletons.SingI1 Data.Monoid.Singletons.MappendSym1
instance Data.Singletons.SingI Data.Monoid.Singletons.FirstSym0
instance Data.Singletons.SingI Data.Monoid.Singletons.GetFirstSym0
instance Data.Singletons.SingI Data.Monoid.Singletons.GetLastSym0
instance Data.Singletons.SingI Data.Monoid.Singletons.LastSym0
instance Data.Monoid.Singletons.SMonoid a => Data.Singletons.SingI Data.Monoid.Singletons.MappendSym0
instance forall a (d :: a). (Data.Monoid.Singletons.SMonoid a, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Monoid.Singletons.MappendSym1 d)
instance Data.Monoid.Singletons.SMonoid a => Data.Singletons.SingI Data.Monoid.Singletons.MconcatSym0
instance forall a (n :: GHC.Internal.Maybe.Maybe a). Data.Singletons.SingI n => Data.Singletons.SingI ('GHC.Internal.Data.Monoid.First n)
instance forall a (n :: GHC.Internal.Maybe.Maybe a). Data.Singletons.SingI n => Data.Singletons.SingI ('GHC.Internal.Data.Monoid.Last n)
instance Data.Singletons.SingKind a => Data.Singletons.SingKind (GHC.Internal.Data.Monoid.First a)
instance Data.Singletons.SingKind a => Data.Singletons.SingKind (GHC.Internal.Data.Monoid.Last a)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Monoid.Singletons.FirstSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Monoid.Singletons.GetFirstSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Monoid.Singletons.GetLastSym0
instance forall k1 k2 k3 k4 (a6989586621679860624 :: k1) (b6989586621679860623 :: k2). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Monoid.Singletons.LamCases_6989586621679860781Sym0 a6989586621679860624 b6989586621679860623)
instance forall k a7566047373982778566 b7566047373982778567 (a6989586621679872282 :: k) (k6989586621679872283 :: a7566047373982778566 Data.Singletons.~> GHC.Internal.Data.Monoid.First b7566047373982778567). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Monoid.Singletons.LamCases_6989586621679872284Sym0 a6989586621679872282 k6989586621679872283)
instance forall k1 k2 a7566047373982778566 b7566047373982778567 a (x6989586621679872286 :: k1) (a6989586621679872282 :: k2) (k6989586621679872283 :: a7566047373982778566 Data.Singletons.~> GHC.Internal.Data.Monoid.First b7566047373982778567). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Monoid.Singletons.LamCases_6989586621679872287Sym0 x6989586621679872286 a6989586621679872282 k6989586621679872283)
instance forall k a7566047373982778566 b7566047373982778567 (a6989586621679872400 :: k) (k6989586621679872401 :: a7566047373982778566 Data.Singletons.~> GHC.Internal.Data.Monoid.Last b7566047373982778567). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Monoid.Singletons.LamCases_6989586621679872402Sym0 a6989586621679872400 k6989586621679872401)
instance forall k1 k2 a7566047373982778566 b7566047373982778567 a (x6989586621679872404 :: k1) (a6989586621679872400 :: k2) (k6989586621679872401 :: a7566047373982778566 Data.Singletons.~> GHC.Internal.Data.Monoid.Last b7566047373982778567). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Monoid.Singletons.LamCases_6989586621679872405Sym0 x6989586621679872404 a6989586621679872400 k6989586621679872401)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Monoid.Singletons.LastSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Monoid.Singletons.MappendSym0
instance forall a (a6989586621679860746 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Monoid.Singletons.MappendSym1 a6989586621679860746)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Monoid.Singletons.MconcatSym0
instance Data.Singletons.Decide.SDecide (GHC.Internal.Maybe.Maybe a) => GHC.Internal.Data.Type.Coercion.TestCoercion Data.Monoid.Singletons.SFirst
instance Data.Singletons.Decide.SDecide (GHC.Internal.Maybe.Maybe a) => GHC.Internal.Data.Type.Coercion.TestCoercion Data.Monoid.Singletons.SLast
instance Data.Singletons.Decide.SDecide (GHC.Internal.Maybe.Maybe a) => GHC.Internal.Data.Type.Equality.TestEquality Data.Monoid.Singletons.SFirst
instance Data.Singletons.Decide.SDecide (GHC.Internal.Maybe.Maybe a) => GHC.Internal.Data.Type.Equality.TestEquality Data.Monoid.Singletons.SLast
-- | Exports promoted and singled versions of the definitions in
-- Data.Proxy.
module Data.Proxy.Singletons
type family Sing :: k -> Type
data SProxy (a :: Proxy t)
[SProxy] :: forall {k} (t :: k). SProxy ('Proxy :: Proxy t)
type family AsProxyTypeOf (a1 :: a) (a2 :: proxy a) :: a
sAsProxyTypeOf :: forall a (proxy :: Type -> Type) (t1 :: a) (t2 :: proxy a). Sing t1 -> Sing t2 -> Sing (AsProxyTypeOf t1 t2)
type family ProxySym0 :: Proxy t
data AsProxyTypeOfSym0 (a1 :: TyFun a proxy a ~> a)
data AsProxyTypeOfSym1 (a6989586621679900552 :: a) (b :: TyFun proxy a a)
type family AsProxyTypeOfSym2 (a6989586621679900552 :: a) (a6989586621679900553 :: proxy a) :: a
instance forall k (t :: k) (z :: GHC.Internal.Data.Proxy.Proxy t). GHC.Classes.Eq (Data.Proxy.Singletons.SProxy z)
instance forall k (t :: k) (z :: GHC.Internal.Data.Proxy.Proxy t). GHC.Classes.Ord (Data.Proxy.Singletons.SProxy z)
instance Control.Monad.Singletons.Internal.PAlternative GHC.Internal.Data.Proxy.Proxy
instance Control.Monad.Singletons.Internal.PApplicative GHC.Internal.Data.Proxy.Proxy
instance forall k (s :: k). Data.Singletons.Base.Enum.PBounded (GHC.Internal.Data.Proxy.Proxy s)
instance forall k (s :: k). Data.Singletons.Base.Enum.PEnum (GHC.Internal.Data.Proxy.Proxy s)
instance forall k (s :: k). Data.Eq.Singletons.PEq (GHC.Internal.Data.Proxy.Proxy s)
instance Control.Monad.Singletons.Internal.PFunctor GHC.Internal.Data.Proxy.Proxy
instance Control.Monad.Singletons.Internal.PMonadPlus GHC.Internal.Data.Proxy.Proxy
instance Control.Monad.Singletons.Internal.PMonad GHC.Internal.Data.Proxy.Proxy
instance forall k (s :: k). Data.Monoid.Singletons.PMonoid (GHC.Internal.Data.Proxy.Proxy s)
instance forall k (s :: k). Data.Ord.Singletons.POrd (GHC.Internal.Data.Proxy.Proxy s)
instance forall k (s :: k). Data.Semigroup.Singletons.Internal.Classes.PSemigroup (GHC.Internal.Data.Proxy.Proxy s)
instance forall k (s :: k). Text.Show.Singletons.PShow (GHC.Internal.Data.Proxy.Proxy s)
instance Control.Monad.Singletons.Internal.SAlternative GHC.Internal.Data.Proxy.Proxy
instance Control.Monad.Singletons.Internal.SApplicative GHC.Internal.Data.Proxy.Proxy
instance forall k (s :: k). Data.Singletons.Base.Enum.SBounded (GHC.Internal.Data.Proxy.Proxy s)
instance forall k (t :: k). Data.Singletons.Decide.SDecide (GHC.Internal.Data.Proxy.Proxy t)
instance forall k (s :: k). Data.Singletons.Base.Enum.SEnum (GHC.Internal.Data.Proxy.Proxy s)
instance forall k (s :: k). Data.Eq.Singletons.SEq (GHC.Internal.Data.Proxy.Proxy s)
instance Control.Monad.Singletons.Internal.SFunctor GHC.Internal.Data.Proxy.Proxy
instance Control.Monad.Singletons.Internal.SMonadPlus GHC.Internal.Data.Proxy.Proxy
instance Control.Monad.Singletons.Internal.SMonad GHC.Internal.Data.Proxy.Proxy
instance forall k (s :: k). Data.Monoid.Singletons.SMonoid (GHC.Internal.Data.Proxy.Proxy s)
instance forall k (s :: k). Data.Ord.Singletons.SOrd (GHC.Internal.Data.Proxy.Proxy s)
instance forall k (s :: k). Data.Semigroup.Singletons.Internal.Classes.SSemigroup (GHC.Internal.Data.Proxy.Proxy s)
instance forall k (s :: k). Text.Show.Singletons.SShow (GHC.Internal.Data.Proxy.Proxy s)
instance forall k (t :: k) (z :: GHC.Internal.Data.Proxy.Proxy t). GHC.Internal.Show.Show (Data.Proxy.Singletons.SProxy z)
instance Data.Singletons.SingI1 Data.Proxy.Singletons.AsProxyTypeOfSym1
instance Data.Singletons.SingI Data.Proxy.Singletons.AsProxyTypeOfSym0
instance forall a (d :: a) (proxy :: * -> *). Data.Singletons.SingI d => Data.Singletons.SingI (Data.Proxy.Singletons.AsProxyTypeOfSym1 d)
instance forall k (t :: k). Data.Singletons.SingI 'GHC.Internal.Data.Proxy.Proxy
instance forall k (t :: k). Data.Singletons.SingKind (GHC.Internal.Data.Proxy.Proxy t)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Proxy.Singletons.AsProxyTypeOfSym0
instance forall a (proxy :: * -> *) (a6989586621679900552 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Proxy.Singletons.AsProxyTypeOfSym1 a6989586621679900552)
instance forall k1 k2 (t :: k2) (s6989586621679899916 :: k1) (n6989586621679900830 :: GHC.Num.Natural.Natural). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Proxy.Singletons.LamCases_6989586621679900831Sym0 s6989586621679899916 n6989586621679900830)
instance forall k (t :: k). GHC.Internal.Data.Type.Coercion.TestCoercion Data.Proxy.Singletons.SProxy
instance forall k (t :: k). GHC.Internal.Data.Type.Equality.TestEquality Data.Proxy.Singletons.SProxy
-- | Defines the promoted and singled versions of the Foldable type
-- class.
module Data.Foldable.Singletons
class PFoldable (t :: Type -> Type) where {
type Fold (arg :: t m) :: m;
type FoldMap (arg :: a ~> m) (arg1 :: t a) :: m;
type Foldr (arg :: a ~> b ~> b) (arg1 :: b) (arg2 :: t a) :: b;
type Foldr' (arg :: a ~> b ~> b) (arg1 :: b) (arg2 :: t a) :: b;
type Foldl (arg :: b ~> a ~> b) (arg1 :: b) (arg2 :: t a) :: b;
type Foldl' (arg :: b ~> a ~> b) (arg1 :: b) (arg2 :: t a) :: b;
type Foldr1 (arg :: a ~> a ~> a) (arg1 :: t a) :: a;
type Foldl1 (arg :: a ~> a ~> a) (arg1 :: t a) :: a;
type ToList (arg :: t a) :: [a];
type Null (arg :: t a) :: Bool;
type Length (arg :: t a) :: Natural;
type Elem (arg :: a) (arg1 :: 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;
type Fold arg :: t m = Fold_6989586621679922582 arg;
type FoldMap arg :: a ~> m arg1 :: t a = FoldMap_6989586621679922592 arg arg1;
type Foldr arg :: a ~> b ~> b arg1 :: b arg2 :: t a = Foldr_6989586621679922606 arg arg1 arg2;
type Foldr' arg :: a ~> b ~> b arg1 :: b arg2 :: t a = Foldr'_6989586621679922621 arg arg1 arg2;
type Foldl arg :: b ~> a ~> b arg1 :: b arg2 :: t a = Foldl_6989586621679922644 arg arg1 arg2;
type Foldl' arg :: b ~> a ~> b arg1 :: b arg2 :: t a = Foldl'_6989586621679922659 arg arg1 arg2;
type Foldr1 arg :: a ~> a ~> a arg1 :: t a = Foldr1_6989586621679922681 arg arg1;
type Foldl1 arg :: a ~> a ~> a arg1 :: t a = Foldl1_6989586621679922704 arg arg1;
type ToList arg :: t a = ToList_6989586621679922726 arg;
type Null arg :: t a = Null_6989586621679922735 arg;
type Length arg :: t a = Length_6989586621679922751 arg;
type Elem arg :: a arg1 :: t a = Elem_6989586621679922769 arg arg1;
type Maximum arg :: t a = Maximum_6989586621679922783 arg;
type Minimum arg :: t a = Minimum_6989586621679922798 arg;
type Sum arg :: t a = Sum_6989586621679922813 arg;
type Product arg :: t a = Product_6989586621679922822 arg;
}
class SFoldable (t :: Type -> Type)
sFold :: forall m (t1 :: t m). (SFoldable t, SMonoid m) => Sing t1 -> Sing (Fold t1)
($dmsFold) :: forall m (t1 :: t m). (SFoldable t, Fold t1 ~ Fold_6989586621679922582 t1, SMonoid m) => Sing t1 -> Sing (Fold t1)
sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: t a). (SFoldable t, SMonoid m) => Sing t1 -> Sing t2 -> Sing (FoldMap t1 t2)
($dmsFoldMap) :: forall a m (t1 :: a ~> m) (t2 :: t a). (SFoldable t, FoldMap t1 t2 ~ FoldMap_6989586621679922592 t1 t2, SMonoid m) => Sing t1 -> Sing t2 -> Sing (FoldMap t1 t2)
sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldr t1 t2 t3)
($dmsFoldr) :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: t a). (SFoldable t, Foldr t1 t2 t3 ~ Foldr_6989586621679922606 t1 t2 t3) => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldr t1 t2 t3)
sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldr' t1 t2 t3)
($dmsFoldr') :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: t a). (SFoldable t, Foldr' t1 t2 t3 ~ Foldr'_6989586621679922621 t1 t2 t3) => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldr' t1 t2 t3)
sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldl t1 t2 t3)
($dmsFoldl) :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a). (SFoldable t, Foldl t1 t2 t3 ~ Foldl_6989586621679922644 t1 t2 t3) => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldl t1 t2 t3)
sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldl' t1 t2 t3)
($dmsFoldl') :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a). (SFoldable t, Foldl' t1 t2 t3 ~ Foldl'_6989586621679922659 t1 t2 t3) => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldl' t1 t2 t3)
sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing (Foldr1 t1 t2)
($dmsFoldr1) :: forall a (t1 :: a ~> (a ~> a)) (t2 :: t a). (SFoldable t, Foldr1 t1 t2 ~ Foldr1_6989586621679922681 t1 t2) => Sing t1 -> Sing t2 -> Sing (Foldr1 t1 t2)
sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing (Foldl1 t1 t2)
($dmsFoldl1) :: forall a (t1 :: a ~> (a ~> a)) (t2 :: t a). (SFoldable t, Foldl1 t1 t2 ~ Foldl1_6989586621679922704 t1 t2) => Sing t1 -> Sing t2 -> Sing (Foldl1 t1 t2)
sToList :: forall a (t1 :: t a). SFoldable t => Sing t1 -> Sing (ToList t1)
($dmsToList) :: forall a (t1 :: t a). (SFoldable t, ToList t1 ~ ToList_6989586621679922726 t1) => Sing t1 -> Sing (ToList t1)
sNull :: forall a (t1 :: t a). SFoldable t => Sing t1 -> Sing (Null t1)
($dmsNull) :: forall a (t1 :: t a). (SFoldable t, Null t1 ~ Null_6989586621679922735 t1) => Sing t1 -> Sing (Null t1)
sLength :: forall a (t1 :: t a). SFoldable t => Sing t1 -> Sing (Length t1)
($dmsLength) :: forall a (t1 :: t a). (SFoldable t, Length t1 ~ Length_6989586621679922751 t1) => Sing t1 -> Sing (Length t1)
sElem :: forall a (t1 :: a) (t2 :: t a). (SFoldable t, SEq a) => Sing t1 -> Sing t2 -> Sing (Elem t1 t2)
($dmsElem) :: forall a (t1 :: a) (t2 :: t a). (SFoldable t, Elem t1 t2 ~ Elem_6989586621679922769 t1 t2, SEq a) => Sing t1 -> Sing t2 -> Sing (Elem t1 t2)
sMaximum :: forall a (t1 :: t a). (SFoldable t, SOrd a) => Sing t1 -> Sing (Maximum t1)
($dmsMaximum) :: forall a (t1 :: t a). (SFoldable t, Maximum t1 ~ Maximum_6989586621679922783 t1, SOrd a) => Sing t1 -> Sing (Maximum t1)
sMinimum :: forall a (t1 :: t a). (SFoldable t, SOrd a) => Sing t1 -> Sing (Minimum t1)
($dmsMinimum) :: forall a (t1 :: t a). (SFoldable t, Minimum t1 ~ Minimum_6989586621679922798 t1, SOrd a) => Sing t1 -> Sing (Minimum t1)
sSum :: forall a (t1 :: t a). (SFoldable t, SNum a) => Sing t1 -> Sing (Sum t1)
($dmsSum) :: forall a (t1 :: t a). (SFoldable t, Sum t1 ~ Sum_6989586621679922813 t1, SNum a) => Sing t1 -> Sing (Sum t1)
sProduct :: forall a (t1 :: t a). (SFoldable t, SNum a) => Sing t1 -> Sing (Product t1)
($dmsProduct) :: forall a (t1 :: t a). (SFoldable t, Product t1 ~ Product_6989586621679922822 t1, SNum a) => Sing t1 -> Sing (Product t1)
type family FoldrM (a1 :: a ~> b ~> m b) (a2 :: b) (a3 :: t a) :: m b
sFoldrM :: forall a b (m :: Type -> Type) (t1 :: Type -> Type) (t2 :: a ~> (b ~> m b)) (t3 :: b) (t4 :: t1 a). (SFoldable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing t4 -> Sing (FoldrM t2 t3 t4)
type family FoldlM (a1 :: b ~> a ~> m b) (a2 :: b) (a3 :: t a) :: m b
sFoldlM :: forall b a (m :: Type -> Type) (t1 :: Type -> Type) (t2 :: b ~> (a ~> m b)) (t3 :: b) (t4 :: t1 a). (SFoldable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing t4 -> Sing (FoldlM t2 t3 t4)
type family Traverse_ (a1 :: a ~> f b) (a2 :: t a) :: f ()
sTraverse_ :: forall a (f :: Type -> Type) b (t1 :: Type -> Type) (t2 :: a ~> f b) (t3 :: t1 a). (SFoldable t1, SApplicative f) => Sing t2 -> Sing t3 -> Sing (Traverse_ t2 t3)
type family For_ (a1 :: t a) (a2 :: a ~> f b) :: f ()
sFor_ :: forall (t1 :: Type -> Type) a (f :: Type -> Type) b (t2 :: t1 a) (t3 :: a ~> f b). (SFoldable t1, SApplicative f) => Sing t2 -> Sing t3 -> Sing (For_ t2 t3)
type family SequenceA_ (a1 :: t f a) :: f ()
sSequenceA_ :: forall (t1 :: Type -> Type) (f :: Type -> Type) a (t2 :: t1 (f a)). (SFoldable t1, SApplicative f) => Sing t2 -> Sing (SequenceA_ t2)
type family Asum (a1 :: t f a) :: f a
sAsum :: forall (t1 :: Type -> Type) (f :: Type -> Type) a (t2 :: t1 (f a)). (SFoldable t1, SAlternative f) => Sing t2 -> Sing (Asum t2)
type family MapM_ (a1 :: a ~> m b) (a2 :: t a) :: m ()
sMapM_ :: forall a (m :: Type -> Type) b (t1 :: Type -> Type) (t2 :: a ~> m b) (t3 :: t1 a). (SFoldable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing (MapM_ t2 t3)
type family ForM_ (a1 :: t a) (a2 :: a ~> m b) :: m ()
sForM_ :: forall (t1 :: Type -> Type) a (m :: Type -> Type) b (t2 :: t1 a) (t3 :: a ~> m b). (SFoldable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing (ForM_ t2 t3)
type family Sequence_ (a1 :: t m a) :: m ()
sSequence_ :: forall (t1 :: Type -> Type) (m :: Type -> Type) a (t2 :: t1 (m a)). (SFoldable t1, SMonad m) => Sing t2 -> Sing (Sequence_ t2)
type family Msum (a1 :: t m a) :: m a
sMsum :: forall (t1 :: Type -> Type) (m :: Type -> Type) a (t2 :: t1 (m a)). (SFoldable t1, SMonadPlus m) => Sing t2 -> Sing (Msum t2)
type family Concat (a1 :: t [a]) :: [a]
sConcat :: forall (t1 :: Type -> Type) a (t2 :: t1 [a]). SFoldable t1 => Sing t2 -> Sing (Concat t2)
type family ConcatMap (a1 :: a ~> [b]) (a2 :: t a) :: [b]
sConcatMap :: forall a b (t1 :: Type -> Type) (t2 :: a ~> [b]) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (ConcatMap t2 t3)
type family And (a :: t Bool) :: Bool
sAnd :: forall (t1 :: Type -> Type) (t2 :: t1 Bool). SFoldable t1 => Sing t2 -> Sing (And t2)
type family Or (a :: t Bool) :: Bool
sOr :: forall (t1 :: Type -> Type) (t2 :: t1 Bool). SFoldable t1 => Sing t2 -> Sing (Or t2)
type family Any (a1 :: a ~> Bool) (a2 :: t a) :: Bool
sAny :: forall a (t1 :: Type -> Type) (t2 :: a ~> Bool) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (Any t2 t3)
type family All (a1 :: a ~> Bool) (a2 :: t a) :: Bool
sAll :: forall a (t1 :: Type -> Type) (t2 :: a ~> Bool) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (All t2 t3)
type family MaximumBy (a1 :: a ~> a ~> Ordering) (a2 :: t a) :: a
sMaximumBy :: forall a (t1 :: Type -> Type) (t2 :: a ~> (a ~> Ordering)) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (MaximumBy t2 t3)
type family MinimumBy (a1 :: a ~> a ~> Ordering) (a2 :: t a) :: a
sMinimumBy :: forall a (t1 :: Type -> Type) (t2 :: a ~> (a ~> Ordering)) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (MinimumBy t2 t3)
type family NotElem (a1 :: a) (a2 :: t a) :: Bool
sNotElem :: forall a (t1 :: Type -> Type) (t2 :: a) (t3 :: t1 a). (SFoldable t1, SEq a) => Sing t2 -> Sing t3 -> Sing (NotElem t2 t3)
type family Find (a1 :: a ~> Bool) (a2 :: t a) :: Maybe a
sFind :: forall a (t1 :: Type -> Type) (t2 :: a ~> Bool) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (Find t2 t3)
data FoldSym0 (a :: TyFun t m m)
type family FoldSym1 (a6989586621679922511 :: t m) :: m
data FoldMapSym0 (a1 :: TyFun a ~> m t a ~> m)
data FoldMapSym1 (a6989586621679922515 :: a ~> m) (b :: TyFun t a m)
type family FoldMapSym2 (a6989586621679922515 :: a ~> m) (a6989586621679922516 :: t a) :: m
data FoldrSym0 (a1 :: TyFun a ~> b ~> b b ~> t a ~> b)
data FoldrSym1 (a6989586621679922521 :: a ~> b ~> b) (b1 :: TyFun b t a ~> b)
data FoldrSym2 (a6989586621679922521 :: a ~> b ~> b) (a6989586621679922522 :: b) (c :: TyFun t a b)
type family FoldrSym3 (a6989586621679922521 :: a ~> b ~> b) (a6989586621679922522 :: b) (a6989586621679922523 :: t a) :: b
data Foldr'Sym0 (a1 :: TyFun a ~> b ~> b b ~> t a ~> b)
data Foldr'Sym1 (a6989586621679922528 :: a ~> b ~> b) (b1 :: TyFun b t a ~> b)
data Foldr'Sym2 (a6989586621679922528 :: a ~> b ~> b) (a6989586621679922529 :: b) (c :: TyFun t a b)
type family Foldr'Sym3 (a6989586621679922528 :: a ~> b ~> b) (a6989586621679922529 :: b) (a6989586621679922530 :: t a) :: b
data FoldlSym0 (a1 :: TyFun b ~> a ~> b b ~> t a ~> b)
data FoldlSym1 (a6989586621679922535 :: b ~> a ~> b) (b1 :: TyFun b t a ~> b)
data FoldlSym2 (a6989586621679922535 :: b ~> a ~> b) (a6989586621679922536 :: b) (c :: TyFun t a b)
type family FoldlSym3 (a6989586621679922535 :: b ~> a ~> b) (a6989586621679922536 :: b) (a6989586621679922537 :: t a) :: b
data Foldl'Sym0 (a1 :: TyFun b ~> a ~> b b ~> t a ~> b)
data Foldl'Sym1 (a6989586621679922542 :: b ~> a ~> b) (b1 :: TyFun b t a ~> b)
data Foldl'Sym2 (a6989586621679922542 :: b ~> a ~> b) (a6989586621679922543 :: b) (c :: TyFun t a b)
type family Foldl'Sym3 (a6989586621679922542 :: b ~> a ~> b) (a6989586621679922543 :: b) (a6989586621679922544 :: t a) :: b
data Foldr1Sym0 (a1 :: TyFun a ~> a ~> a t a ~> a)
data Foldr1Sym1 (a6989586621679922548 :: a ~> a ~> a) (b :: TyFun t a a)
type family Foldr1Sym2 (a6989586621679922548 :: a ~> a ~> a) (a6989586621679922549 :: t a) :: a
data Foldl1Sym0 (a1 :: TyFun a ~> a ~> a t a ~> a)
data Foldl1Sym1 (a6989586621679922553 :: a ~> a ~> a) (b :: TyFun t a a)
type family Foldl1Sym2 (a6989586621679922553 :: a ~> a ~> a) (a6989586621679922554 :: t a) :: a
data ToListSym0 (a1 :: TyFun t a [a])
type family ToListSym1 (a6989586621679922557 :: t a) :: [a]
data NullSym0 (a1 :: TyFun t a Bool)
type family NullSym1 (a6989586621679922560 :: t a) :: Bool
data LengthSym0 (a1 :: TyFun t a Natural)
type family LengthSym1 (a6989586621679922563 :: t a) :: Natural
data ElemSym0 (a1 :: TyFun a t a ~> Bool)
data ElemSym1 (a6989586621679922567 :: a) (b :: TyFun t a Bool)
type family ElemSym2 (a6989586621679922567 :: a) (a6989586621679922568 :: t a) :: Bool
data MaximumSym0 (a1 :: TyFun t a a)
type family MaximumSym1 (a6989586621679922571 :: t a) :: a
data MinimumSym0 (a1 :: TyFun t a a)
type family MinimumSym1 (a6989586621679922574 :: t a) :: a
data SumSym0 (a1 :: TyFun t a a)
type family SumSym1 (a6989586621679922577 :: t a) :: a
data ProductSym0 (a1 :: TyFun t a a)
type family ProductSym1 (a6989586621679922580 :: t a) :: a
data FoldrMSym0 (a1 :: TyFun a ~> b ~> m b b ~> t a ~> m b)
data FoldrMSym1 (a6989586621679922495 :: a ~> b ~> m b) (b1 :: TyFun b t a ~> m b)
data FoldrMSym2 (a6989586621679922495 :: a ~> b ~> m b) (a6989586621679922496 :: b) (c :: TyFun t a m b)
type family FoldrMSym3 (a6989586621679922495 :: a ~> b ~> m b) (a6989586621679922496 :: b) (a6989586621679922497 :: t a) :: m b
data FoldlMSym0 (a1 :: TyFun b ~> a ~> m b b ~> t a ~> m b)
data FoldlMSym1 (a6989586621679922477 :: b ~> a ~> m b) (b1 :: TyFun b t a ~> m b)
data FoldlMSym2 (a6989586621679922477 :: b ~> a ~> m b) (a6989586621679922478 :: b) (c :: TyFun t a m b)
type family FoldlMSym3 (a6989586621679922477 :: b ~> a ~> m b) (a6989586621679922478 :: b) (a6989586621679922479 :: t a) :: m b
data Traverse_Sym0 (a1 :: TyFun a ~> f b t a ~> f ())
data Traverse_Sym1 (a6989586621679922469 :: a ~> f b) (b1 :: TyFun t a f ())
type family Traverse_Sym2 (a6989586621679922469 :: a ~> f b) (a6989586621679922470 :: t a) :: f ()
data For_Sym0 (a1 :: TyFun t a a ~> f b ~> f ())
data For_Sym1 (a6989586621679922460 :: t a) (b1 :: TyFun a ~> f b f ())
type family For_Sym2 (a6989586621679922460 :: t a) (a6989586621679922461 :: a ~> f b) :: f ()
data SequenceA_Sym0 (a1 :: TyFun t f a f ())
type family SequenceA_Sym1 (a6989586621679922431 :: t f a) :: f ()
data AsumSym0 (a1 :: TyFun t f a f a)
type family AsumSym1 (a6989586621679922419 :: t f a) :: f a
data MapM_Sym0 (a1 :: TyFun a ~> m b t a ~> m ())
data MapM_Sym1 (a6989586621679922449 :: a ~> m b) (b1 :: TyFun t a m ())
type family MapM_Sym2 (a6989586621679922449 :: a ~> m b) (a6989586621679922450 :: t a) :: m ()
data ForM_Sym0 (a1 :: TyFun t a a ~> m b ~> m ())
data ForM_Sym1 (a6989586621679922440 :: t a) (b1 :: TyFun a ~> m b m ())
type family ForM_Sym2 (a6989586621679922440 :: t a) (a6989586621679922441 :: a ~> m b) :: m ()
data Sequence_Sym0 (a1 :: TyFun t m a m ())
type family Sequence_Sym1 (a6989586621679922425 :: t m a) :: m ()
data MsumSym0 (a1 :: TyFun t m a m a)
type family MsumSym1 (a6989586621679922413 :: t m a) :: m a
data ConcatSym0 (a1 :: TyFun t [a] [a])
type family ConcatSym1 (a6989586621679922398 :: t [a]) :: [a]
data ConcatMapSym0 (a1 :: TyFun a ~> [b] t a ~> [b])
data ConcatMapSym1 (a6989586621679922383 :: a ~> [b]) (b1 :: TyFun t a [b])
type family ConcatMapSym2 (a6989586621679922383 :: a ~> [b]) (a6989586621679922384 :: t a) :: [b]
data AndSym0 (a :: TyFun t Bool Bool)
type family AndSym1 (a6989586621679922378 :: t Bool) :: Bool
data OrSym0 (a :: TyFun t Bool Bool)
type family OrSym1 (a6989586621679922372 :: t Bool) :: Bool
data AnySym0 (a1 :: TyFun a ~> Bool t a ~> Bool)
data AnySym1 (a6989586621679922364 :: a ~> Bool) (b :: TyFun t a Bool)
type family AnySym2 (a6989586621679922364 :: a ~> Bool) (a6989586621679922365 :: t a) :: Bool
data AllSym0 (a1 :: TyFun a ~> Bool t a ~> Bool)
data AllSym1 (a6989586621679922355 :: a ~> Bool) (b :: TyFun t a Bool)
type family AllSym2 (a6989586621679922355 :: a ~> Bool) (a6989586621679922356 :: t a) :: Bool
data MaximumBySym0 (a1 :: TyFun a ~> a ~> Ordering t a ~> a)
data MaximumBySym1 (a6989586621679922335 :: a ~> a ~> Ordering) (b :: TyFun t a a)
type family MaximumBySym2 (a6989586621679922335 :: a ~> a ~> Ordering) (a6989586621679922336 :: t a) :: a
data MinimumBySym0 (a1 :: TyFun a ~> a ~> Ordering t a ~> a)
data MinimumBySym1 (a6989586621679922315 :: a ~> a ~> Ordering) (b :: TyFun t a a)
type family MinimumBySym2 (a6989586621679922315 :: a ~> a ~> Ordering) (a6989586621679922316 :: t a) :: a
data NotElemSym0 (a1 :: TyFun a t a ~> Bool)
data NotElemSym1 (a6989586621679922306 :: a) (b :: TyFun t a Bool)
type family NotElemSym2 (a6989586621679922306 :: a) (a6989586621679922307 :: t a) :: Bool
data FindSym0 (a1 :: TyFun a ~> Bool t a ~> Maybe a)
data FindSym1 (a6989586621679922286 :: a ~> Bool) (b :: TyFun t a Maybe a)
type family FindSym2 (a6989586621679922286 :: a ~> Bool) (a6989586621679922287 :: t a) :: Maybe a
instance Data.Foldable.Singletons.PFoldable GHC.Internal.Data.Semigroup.Internal.Dual
instance Data.Foldable.Singletons.PFoldable (GHC.Internal.Data.Either.Either a)
instance Data.Foldable.Singletons.PFoldable GHC.Internal.Data.Monoid.First
instance Data.Foldable.Singletons.PFoldable GHC.Internal.Data.Monoid.Last
instance Data.Foldable.Singletons.PFoldable []
instance Data.Foldable.Singletons.PFoldable GHC.Internal.Maybe.Maybe
instance Data.Foldable.Singletons.PFoldable GHC.Internal.Base.NonEmpty
instance Data.Foldable.Singletons.PFoldable GHC.Internal.Data.Semigroup.Internal.Product
instance Data.Foldable.Singletons.PFoldable GHC.Internal.Data.Proxy.Proxy
instance Data.Foldable.Singletons.PFoldable GHC.Internal.Data.Semigroup.Internal.Sum
instance Data.Foldable.Singletons.PFoldable ((,) a)
instance Data.Monoid.Singletons.PMonoid (Data.Foldable.Singletons.Endo a)
instance Data.Monoid.Singletons.PMonoid (Data.Foldable.Singletons.MaxInternal a)
instance Data.Monoid.Singletons.PMonoid (Data.Foldable.Singletons.MinInternal a)
instance Data.Semigroup.Singletons.Internal.Classes.PSemigroup (Data.Foldable.Singletons.Endo a)
instance Data.Semigroup.Singletons.Internal.Classes.PSemigroup (Data.Foldable.Singletons.MaxInternal a)
instance Data.Semigroup.Singletons.Internal.Classes.PSemigroup (Data.Foldable.Singletons.MinInternal a)
instance Data.Foldable.Singletons.SFoldable GHC.Internal.Data.Semigroup.Internal.Dual
instance Data.Foldable.Singletons.SFoldable (GHC.Internal.Data.Either.Either a)
instance Data.Foldable.Singletons.SFoldable GHC.Internal.Data.Monoid.First
instance Data.Foldable.Singletons.SFoldable GHC.Internal.Data.Monoid.Last
instance Data.Foldable.Singletons.SFoldable []
instance Data.Foldable.Singletons.SFoldable GHC.Internal.Maybe.Maybe
instance Data.Foldable.Singletons.SFoldable GHC.Internal.Base.NonEmpty
instance Data.Foldable.Singletons.SFoldable GHC.Internal.Data.Semigroup.Internal.Product
instance Data.Foldable.Singletons.SFoldable GHC.Internal.Data.Proxy.Proxy
instance Data.Foldable.Singletons.SFoldable GHC.Internal.Data.Semigroup.Internal.Sum
instance Data.Foldable.Singletons.SFoldable ((,) a)
instance Data.Monoid.Singletons.SMonoid (Data.Foldable.Singletons.Endo a)
instance Data.Ord.Singletons.SOrd a => Data.Monoid.Singletons.SMonoid (Data.Foldable.Singletons.MaxInternal a)
instance Data.Ord.Singletons.SOrd a => Data.Monoid.Singletons.SMonoid (Data.Foldable.Singletons.MinInternal a)
instance Data.Semigroup.Singletons.Internal.Classes.SSemigroup (Data.Foldable.Singletons.Endo a)
instance Data.Ord.Singletons.SOrd a => Data.Semigroup.Singletons.Internal.Classes.SSemigroup (Data.Foldable.Singletons.MaxInternal a)
instance Data.Ord.Singletons.SOrd a => Data.Semigroup.Singletons.Internal.Classes.SSemigroup (Data.Foldable.Singletons.MinInternal a)
instance Data.Singletons.SingI1 Data.Foldable.Singletons.AppEndoSym1
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI1 Data.Foldable.Singletons.AllSym1
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI1 Data.Foldable.Singletons.AnySym1
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI1 Data.Foldable.Singletons.ConcatMapSym1
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI1 Data.Foldable.Singletons.FindSym1
instance (Data.Foldable.Singletons.SFoldable t, Data.Monoid.Singletons.SMonoid m) => Data.Singletons.SingI1 Data.Foldable.Singletons.FoldMapSym1
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI1 Data.Foldable.Singletons.Foldl'Sym1
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI1 Data.Foldable.Singletons.Foldl1Sym1
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI1 Data.Foldable.Singletons.FoldlMSym1
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI1 Data.Foldable.Singletons.FoldlSym1
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI1 Data.Foldable.Singletons.Foldr'Sym1
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI1 Data.Foldable.Singletons.Foldr1Sym1
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI1 Data.Foldable.Singletons.FoldrMSym1
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI1 Data.Foldable.Singletons.FoldrSym1
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI1 Data.Foldable.Singletons.MapM_Sym1
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI1 Data.Foldable.Singletons.MaximumBySym1
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI1 Data.Foldable.Singletons.MinimumBySym1
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SApplicative f) => Data.Singletons.SingI1 Data.Foldable.Singletons.Traverse_Sym1
instance Data.Singletons.SingI1 'Data.Foldable.Singletons.MaxInternal
instance Data.Singletons.SingI1 'Data.Foldable.Singletons.MinInternal
instance (Data.Foldable.Singletons.SFoldable t, Data.Eq.Singletons.SEq a) => Data.Singletons.SingI1 Data.Foldable.Singletons.ElemSym1
instance (Data.Foldable.Singletons.SFoldable t, Data.Eq.Singletons.SEq a) => Data.Singletons.SingI1 Data.Foldable.Singletons.NotElemSym1
instance forall (t :: * -> *) b a (d :: b Data.Singletons.~> (a Data.Singletons.~> b)). (Data.Foldable.Singletons.SFoldable t, Data.Singletons.SingI d) => Data.Singletons.SingI1 (Data.Foldable.Singletons.Foldl'Sym2 d)
instance forall (t :: * -> *) (m :: * -> *) b a (d :: b Data.Singletons.~> (a Data.Singletons.~> m b)). (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d) => Data.Singletons.SingI1 (Data.Foldable.Singletons.FoldlMSym2 d)
instance forall (t :: * -> *) b a (d :: b Data.Singletons.~> (a Data.Singletons.~> b)). (Data.Foldable.Singletons.SFoldable t, Data.Singletons.SingI d) => Data.Singletons.SingI1 (Data.Foldable.Singletons.FoldlSym2 d)
instance forall (t :: * -> *) a b (d :: a Data.Singletons.~> (b Data.Singletons.~> b)). (Data.Foldable.Singletons.SFoldable t, Data.Singletons.SingI d) => Data.Singletons.SingI1 (Data.Foldable.Singletons.Foldr'Sym2 d)
instance forall (t :: * -> *) (m :: * -> *) a b (d :: a Data.Singletons.~> (b Data.Singletons.~> m b)). (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d) => Data.Singletons.SingI1 (Data.Foldable.Singletons.FoldrMSym2 d)
instance forall (t :: * -> *) a b (d :: a Data.Singletons.~> (b Data.Singletons.~> b)). (Data.Foldable.Singletons.SFoldable t, Data.Singletons.SingI d) => Data.Singletons.SingI1 (Data.Foldable.Singletons.FoldrSym2 d)
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI1 Data.Foldable.Singletons.ForM_Sym1
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SApplicative f) => Data.Singletons.SingI1 Data.Foldable.Singletons.For_Sym1
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI2 Data.Foldable.Singletons.Foldl'Sym2
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI2 Data.Foldable.Singletons.FoldlMSym2
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI2 Data.Foldable.Singletons.FoldlSym2
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI2 Data.Foldable.Singletons.Foldr'Sym2
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI2 Data.Foldable.Singletons.FoldrMSym2
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI2 Data.Foldable.Singletons.FoldrSym2
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI Data.Foldable.Singletons.AllSym0
instance forall (t :: * -> *) a (d :: a Data.Singletons.~> GHC.Types.Bool). (Data.Foldable.Singletons.SFoldable t, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.AllSym1 d)
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI Data.Foldable.Singletons.AndSym0
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI Data.Foldable.Singletons.AnySym0
instance forall (t :: * -> *) a (d :: a Data.Singletons.~> GHC.Types.Bool). (Data.Foldable.Singletons.SFoldable t, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.AnySym1 d)
instance Data.Singletons.SingI Data.Foldable.Singletons.AppEndoSym0
instance forall a (d :: Data.Foldable.Singletons.Endo a). Data.Singletons.SingI d => Data.Singletons.SingI (Data.Foldable.Singletons.AppEndoSym1 d)
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SAlternative f) => Data.Singletons.SingI Data.Foldable.Singletons.AsumSym0
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI Data.Foldable.Singletons.ConcatMapSym0
instance forall (t :: * -> *) a b (d :: a Data.Singletons.~> [b]). (Data.Foldable.Singletons.SFoldable t, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.ConcatMapSym1 d)
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI Data.Foldable.Singletons.ConcatSym0
instance (Data.Foldable.Singletons.SFoldable t, Data.Eq.Singletons.SEq a) => Data.Singletons.SingI Data.Foldable.Singletons.ElemSym0
instance forall (t :: * -> *) a (d :: a). (Data.Foldable.Singletons.SFoldable t, Data.Eq.Singletons.SEq a, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.ElemSym1 d)
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI Data.Foldable.Singletons.FindSym0
instance forall (t :: * -> *) a (d :: a Data.Singletons.~> GHC.Types.Bool). (Data.Foldable.Singletons.SFoldable t, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.FindSym1 d)
instance (Data.Foldable.Singletons.SFoldable t, Data.Monoid.Singletons.SMonoid m) => Data.Singletons.SingI Data.Foldable.Singletons.FoldMapSym0
instance forall (t :: * -> *) m a (d :: a Data.Singletons.~> m). (Data.Foldable.Singletons.SFoldable t, Data.Monoid.Singletons.SMonoid m, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.FoldMapSym1 d)
instance (Data.Foldable.Singletons.SFoldable t, Data.Monoid.Singletons.SMonoid m) => Data.Singletons.SingI Data.Foldable.Singletons.FoldSym0
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI Data.Foldable.Singletons.Foldl'Sym0
instance forall (t :: * -> *) b a (d :: b Data.Singletons.~> (a Data.Singletons.~> b)). (Data.Foldable.Singletons.SFoldable t, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.Foldl'Sym1 d)
instance forall (t :: * -> *) b a (d1 :: b Data.Singletons.~> (a Data.Singletons.~> b)) (d2 :: b). (Data.Foldable.Singletons.SFoldable t, Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.Foldable.Singletons.Foldl'Sym2 d1 d2)
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI Data.Foldable.Singletons.Foldl1Sym0
instance forall (t :: * -> *) a (d :: a Data.Singletons.~> (a Data.Singletons.~> a)). (Data.Foldable.Singletons.SFoldable t, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.Foldl1Sym1 d)
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI Data.Foldable.Singletons.FoldlMSym0
instance forall (t :: * -> *) (m :: * -> *) b a (d :: b Data.Singletons.~> (a Data.Singletons.~> m b)). (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.FoldlMSym1 d)
instance forall (t :: * -> *) (m :: * -> *) b a (d1 :: b Data.Singletons.~> (a Data.Singletons.~> m b)) (d2 :: b). (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.Foldable.Singletons.FoldlMSym2 d1 d2)
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI Data.Foldable.Singletons.FoldlSym0
instance forall (t :: * -> *) b a (d :: b Data.Singletons.~> (a Data.Singletons.~> b)). (Data.Foldable.Singletons.SFoldable t, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.FoldlSym1 d)
instance forall (t :: * -> *) b a (d1 :: b Data.Singletons.~> (a Data.Singletons.~> b)) (d2 :: b). (Data.Foldable.Singletons.SFoldable t, Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.Foldable.Singletons.FoldlSym2 d1 d2)
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI Data.Foldable.Singletons.Foldr'Sym0
instance forall (t :: * -> *) a b (d :: a Data.Singletons.~> (b Data.Singletons.~> b)). (Data.Foldable.Singletons.SFoldable t, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.Foldr'Sym1 d)
instance forall (t :: * -> *) a b (d1 :: a Data.Singletons.~> (b Data.Singletons.~> b)) (d2 :: b). (Data.Foldable.Singletons.SFoldable t, Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.Foldable.Singletons.Foldr'Sym2 d1 d2)
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI Data.Foldable.Singletons.Foldr1Sym0
instance forall (t :: * -> *) a (d :: a Data.Singletons.~> (a Data.Singletons.~> a)). (Data.Foldable.Singletons.SFoldable t, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.Foldr1Sym1 d)
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI Data.Foldable.Singletons.FoldrMSym0
instance forall (t :: * -> *) (m :: * -> *) a b (d :: a Data.Singletons.~> (b Data.Singletons.~> m b)). (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.FoldrMSym1 d)
instance forall (t :: * -> *) (m :: * -> *) a b (d1 :: a Data.Singletons.~> (b Data.Singletons.~> m b)) (d2 :: b). (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.Foldable.Singletons.FoldrMSym2 d1 d2)
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI Data.Foldable.Singletons.FoldrSym0
instance forall (t :: * -> *) a b (d :: a Data.Singletons.~> (b Data.Singletons.~> b)). (Data.Foldable.Singletons.SFoldable t, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.FoldrSym1 d)
instance forall (t :: * -> *) a b (d1 :: a Data.Singletons.~> (b Data.Singletons.~> b)) (d2 :: b). (Data.Foldable.Singletons.SFoldable t, Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.Foldable.Singletons.FoldrSym2 d1 d2)
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI Data.Foldable.Singletons.ForM_Sym0
instance forall (t :: * -> *) (m :: * -> *) a (d :: t a) b. (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.ForM_Sym1 d)
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SApplicative f) => Data.Singletons.SingI Data.Foldable.Singletons.For_Sym0
instance forall (t :: * -> *) (f :: * -> *) a (d :: t a) b. (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SApplicative f, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.For_Sym1 d)
instance Data.Singletons.SingI Data.Foldable.Singletons.GetMaxInternalSym0
instance Data.Singletons.SingI Data.Foldable.Singletons.GetMinInternalSym0
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI Data.Foldable.Singletons.LengthSym0
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI Data.Foldable.Singletons.MapM_Sym0
instance forall (t :: * -> *) (m :: * -> *) a b (d :: a Data.Singletons.~> m b). (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.MapM_Sym1 d)
instance Data.Singletons.SingI Data.Foldable.Singletons.MaxInternalSym0
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI Data.Foldable.Singletons.MaximumBySym0
instance forall (t :: * -> *) a (d :: a Data.Singletons.~> (a Data.Singletons.~> GHC.Types.Ordering)). (Data.Foldable.Singletons.SFoldable t, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.MaximumBySym1 d)
instance (Data.Foldable.Singletons.SFoldable t, Data.Ord.Singletons.SOrd a) => Data.Singletons.SingI Data.Foldable.Singletons.MaximumSym0
instance Data.Singletons.SingI Data.Foldable.Singletons.MinInternalSym0
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI Data.Foldable.Singletons.MinimumBySym0
instance forall (t :: * -> *) a (d :: a Data.Singletons.~> (a Data.Singletons.~> GHC.Types.Ordering)). (Data.Foldable.Singletons.SFoldable t, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.MinimumBySym1 d)
instance (Data.Foldable.Singletons.SFoldable t, Data.Ord.Singletons.SOrd a) => Data.Singletons.SingI Data.Foldable.Singletons.MinimumSym0
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonadPlus m) => Data.Singletons.SingI Data.Foldable.Singletons.MsumSym0
instance (Data.Foldable.Singletons.SFoldable t, Data.Eq.Singletons.SEq a) => Data.Singletons.SingI Data.Foldable.Singletons.NotElemSym0
instance forall (t :: * -> *) a (d :: a). (Data.Foldable.Singletons.SFoldable t, Data.Eq.Singletons.SEq a, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.NotElemSym1 d)
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI Data.Foldable.Singletons.NullSym0
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI Data.Foldable.Singletons.OrSym0
instance (Data.Foldable.Singletons.SFoldable t, GHC.Num.Singletons.SNum a) => Data.Singletons.SingI Data.Foldable.Singletons.ProductSym0
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SApplicative f) => Data.Singletons.SingI Data.Foldable.Singletons.SequenceA_Sym0
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI Data.Foldable.Singletons.Sequence_Sym0
instance (Data.Foldable.Singletons.SFoldable t, GHC.Num.Singletons.SNum a) => Data.Singletons.SingI Data.Foldable.Singletons.SumSym0
instance Data.Foldable.Singletons.SFoldable t => Data.Singletons.SingI Data.Foldable.Singletons.ToListSym0
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SApplicative f) => Data.Singletons.SingI Data.Foldable.Singletons.Traverse_Sym0
instance forall (t :: * -> *) (f :: * -> *) a b (d :: a Data.Singletons.~> f b). (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SApplicative f, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Foldable.Singletons.Traverse_Sym1 d)
instance forall a (n :: GHC.Internal.Maybe.Maybe a). Data.Singletons.SingI n => Data.Singletons.SingI ('Data.Foldable.Singletons.MaxInternal n)
instance forall a (n :: GHC.Internal.Maybe.Maybe a). Data.Singletons.SingI n => Data.Singletons.SingI ('Data.Foldable.Singletons.MinInternal n)
instance Data.Singletons.SingKind a => Data.Singletons.SingKind (Data.Foldable.Singletons.MaxInternal a)
instance Data.Singletons.SingKind a => Data.Singletons.SingKind (Data.Foldable.Singletons.MinInternal a)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.AllSym0
instance forall a (t :: * -> *) (a6989586621679922355 :: a Data.Singletons.~> GHC.Types.Bool). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.AllSym1 a6989586621679922355)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.AndSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.AnySym0
instance forall a (t :: * -> *) (a6989586621679922364 :: a Data.Singletons.~> GHC.Types.Bool). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.AnySym1 a6989586621679922364)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.AppEndoSym0
instance forall a (a6989586621679910307 :: Data.Foldable.Singletons.Endo a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.AppEndoSym1 a6989586621679910307)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.AsumSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.ConcatMapSym0
instance forall a b (t :: * -> *) (a6989586621679922383 :: a Data.Singletons.~> [b]). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.ConcatMapSym1 a6989586621679922383)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.ConcatSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.ElemSym0
instance forall a (t :: * -> *) (a6989586621679922567 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.ElemSym1 a6989586621679922567)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.FindSym0
instance forall a (t :: * -> *) (a6989586621679922286 :: a Data.Singletons.~> GHC.Types.Bool). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.FindSym1 a6989586621679922286)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.FoldMapSym0
instance forall a m (t :: * -> *) (a6989586621679922515 :: a Data.Singletons.~> m). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.FoldMapSym1 a6989586621679922515)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.FoldSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.Foldl'Sym0
instance forall b a (t :: * -> *) (a6989586621679922542 :: b Data.Singletons.~> (a Data.Singletons.~> b)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Foldl'Sym1 a6989586621679922542)
instance forall b a (t :: * -> *) (a6989586621679922542 :: b Data.Singletons.~> (a Data.Singletons.~> b)) (a6989586621679922543 :: b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Foldl'Sym2 a6989586621679922542 a6989586621679922543)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.Foldl1Sym0
instance forall a (t :: * -> *) (a6989586621679922553 :: a Data.Singletons.~> (a Data.Singletons.~> a)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Foldl1Sym1 a6989586621679922553)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.FoldlMSym0
instance forall b a (m :: * -> *) (t :: * -> *) (a6989586621679922477 :: b Data.Singletons.~> (a Data.Singletons.~> m b)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.FoldlMSym1 a6989586621679922477)
instance forall b a (m :: * -> *) (t :: * -> *) (a6989586621679922477 :: b Data.Singletons.~> (a Data.Singletons.~> m b)) (a6989586621679922478 :: b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.FoldlMSym2 a6989586621679922477 a6989586621679922478)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.FoldlSym0
instance forall b a (t :: * -> *) (a6989586621679922535 :: b Data.Singletons.~> (a Data.Singletons.~> b)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.FoldlSym1 a6989586621679922535)
instance forall b a (t :: * -> *) (a6989586621679922535 :: b Data.Singletons.~> (a Data.Singletons.~> b)) (a6989586621679922536 :: b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.FoldlSym2 a6989586621679922535 a6989586621679922536)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.Foldr'Sym0
instance forall a b (t :: * -> *) (a6989586621679922528 :: a Data.Singletons.~> (b Data.Singletons.~> b)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Foldr'Sym1 a6989586621679922528)
instance forall a b (t :: * -> *) (a6989586621679922528 :: a Data.Singletons.~> (b Data.Singletons.~> b)) (a6989586621679922529 :: b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Foldr'Sym2 a6989586621679922528 a6989586621679922529)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.Foldr1Sym0
instance forall a (t :: * -> *) (a6989586621679922548 :: a Data.Singletons.~> (a Data.Singletons.~> a)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Foldr1Sym1 a6989586621679922548)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.FoldrMSym0
instance forall a b (m :: * -> *) (t :: * -> *) (a6989586621679922495 :: a Data.Singletons.~> (b Data.Singletons.~> m b)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.FoldrMSym1 a6989586621679922495)
instance forall a b (m :: * -> *) (t :: * -> *) (a6989586621679922495 :: a Data.Singletons.~> (b Data.Singletons.~> m b)) (a6989586621679922496 :: b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.FoldrMSym2 a6989586621679922495 a6989586621679922496)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.FoldrSym0
instance forall a b (t :: * -> *) (a6989586621679922521 :: a Data.Singletons.~> (b Data.Singletons.~> b)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.FoldrSym1 a6989586621679922521)
instance forall a b (t :: * -> *) (a6989586621679922521 :: a Data.Singletons.~> (b Data.Singletons.~> b)) (a6989586621679922522 :: b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.FoldrSym2 a6989586621679922521 a6989586621679922522)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.ForM_Sym0
instance forall (t :: * -> *) a (m :: * -> *) b (a6989586621679922440 :: t a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.ForM_Sym1 a6989586621679922440)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.For_Sym0
instance forall (t :: * -> *) a (f :: * -> *) b (a6989586621679922460 :: t a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.For_Sym1 a6989586621679922460)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.GetMaxInternalSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.GetMinInternalSym0
instance forall k1 k2 (a6989586621679913488 :: k1) (x6989586621679913527 :: k2) (y6989586621679913528 :: k2). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679913532Sym0 a6989586621679913488 x6989586621679913527 y6989586621679913528)
instance forall k1 k2 (a6989586621679913496 :: k1) (x6989586621679913551 :: k2) (y6989586621679913552 :: k2). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679913556Sym0 a6989586621679913496 x6989586621679913551 y6989586621679913552)
instance forall a6989586621679921878 (t6989586621679921877 :: * -> *) (p6989586621679922288 :: a6989586621679921878 Data.Singletons.~> GHC.Types.Bool) (a_69895866216799222816989586621679922289 :: t6989586621679921877 a6989586621679921878). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679922290Sym0 p6989586621679922288 a_69895866216799222816989586621679922289)
instance forall k1 a6989586621679921878 (t6989586621679921877 :: * -> *) (x6989586621679922292 :: k1) (p6989586621679922288 :: a6989586621679921878 Data.Singletons.~> GHC.Types.Bool) (a_69895866216799222816989586621679922289 :: t6989586621679921877 a6989586621679921878). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679922293Sym0 x6989586621679922292 p6989586621679922288 a_69895866216799222816989586621679922289)
instance forall k a6989586621679921882 (t6989586621679921881 :: * -> *) (x6989586621679922323 :: k) (y6989586621679922324 :: k) (cmp6989586621679922317 :: a6989586621679921882 Data.Singletons.~> (a6989586621679921882 Data.Singletons.~> GHC.Types.Ordering)) (a_69895866216799223106989586621679922318 :: t6989586621679921881 a6989586621679921882). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679922325Sym0 x6989586621679922323 y6989586621679922324 cmp6989586621679922317 a_69895866216799223106989586621679922318)
instance forall k a6989586621679921884 (t6989586621679921883 :: * -> *) (x6989586621679922343 :: k) (y6989586621679922344 :: k) (cmp6989586621679922337 :: a6989586621679921884 Data.Singletons.~> (a6989586621679921884 Data.Singletons.~> GHC.Types.Ordering)) (a_69895866216799223306989586621679922338 :: t6989586621679921883 a6989586621679921884). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679922345Sym0 x6989586621679922343 y6989586621679922344 cmp6989586621679922337 a_69895866216799223306989586621679922338)
instance forall a6989586621679921892 b6989586621679921893 (t6989586621679921891 :: * -> *) (f6989586621679922385 :: a6989586621679921892 Data.Singletons.~> [b6989586621679921893]) (xs6989586621679922386 :: t6989586621679921891 a6989586621679921892). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679922387Sym0 f6989586621679922385 xs6989586621679922386)
instance forall a6989586621679921892 b6989586621679921893 (t6989586621679921891 :: * -> *) (f6989586621679922385 :: a6989586621679921892 Data.Singletons.~> [b6989586621679921893]) (xs6989586621679922386 :: t6989586621679921891 a6989586621679921892) (a_69895866216799223916989586621679922392 :: a6989586621679921892). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679922387Sym1 f6989586621679922385 xs6989586621679922386 a_69895866216799223916989586621679922392)
instance forall (t6989586621679921894 :: * -> *) a6989586621679921895 (t :: * -> *) a (xs6989586621679922399 :: t6989586621679921894 [a6989586621679921895]). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679922400Sym0 xs6989586621679922399)
instance forall (t6989586621679921894 :: * -> *) a6989586621679921895 (t :: * -> *) a (xs6989586621679922399 :: t6989586621679921894 [a6989586621679921895]) (a_69895866216799224046989586621679922405 :: t a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679922400Sym1 xs6989586621679922399 a_69895866216799224046989586621679922405)
instance forall a6989586621679921981 k (t6989586621679921969 :: * -> *) (x6989586621679922694 :: a6989586621679921981) (m6989586621679922695 :: k) (f6989586621679922688 :: a6989586621679921981 Data.Singletons.~> (a6989586621679921981 Data.Singletons.~> a6989586621679921981)) (xs6989586621679922689 :: t6989586621679921969 a6989586621679921981). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679922696Sym0 t6989586621679921969 x6989586621679922694 m6989586621679922695 f6989586621679922688 xs6989586621679922689)
instance forall k a6989586621679921982 (t6989586621679921969 :: * -> *) (m6989586621679922717 :: k) (y6989586621679922718 :: a6989586621679921982) (f6989586621679922711 :: a6989586621679921982 Data.Singletons.~> (a6989586621679921982 Data.Singletons.~> a6989586621679921982)) (xs6989586621679922712 :: t6989586621679921969 a6989586621679921982). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679922719Sym0 t6989586621679921969 m6989586621679922717 y6989586621679922718 f6989586621679922711 xs6989586621679922712)
instance forall a6989586621679921984 k1 k2 (t6989586621679921969 :: * -> *) (a_69895866216799227376989586621679922742 :: t6989586621679921969 a6989586621679921984). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679922743Sym0 t6989586621679921969 a_69895866216799227376989586621679922742)
instance forall a6989586621679921984 k1 k2 (t6989586621679921969 :: * -> *) (a_69895866216799227376989586621679922742 :: t6989586621679921969 a6989586621679921984) (a_69895866216799227456989586621679922746 :: k1). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679922743Sym1 t6989586621679921969 a_69895866216799227376989586621679922742 a_69895866216799227456989586621679922746)
instance forall a6989586621679921985 k1 k2 (t6989586621679921969 :: * -> *) (a_69895866216799227536989586621679922758 :: t6989586621679921969 a6989586621679921985). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679922759Sym0 t6989586621679921969 a_69895866216799227536989586621679922758)
instance forall a6989586621679921985 k1 k2 (t6989586621679921969 :: * -> *) (a_69895866216799227536989586621679922758 :: t6989586621679921969 a6989586621679921985) (a_69895866216799227626989586621679922763 :: k1). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679922759Sym1 t6989586621679921969 a_69895866216799227536989586621679922758 a_69895866216799227626989586621679922763)
instance forall a6989586621679921986 b c (a_69895866216799232896989586621679923298 :: a6989586621679921986) (a_69895866216799232916989586621679923299 :: GHC.Internal.Data.Semigroup.Internal.Dual a6989586621679921986). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679923300Sym0 a_69895866216799232896989586621679923298 a_69895866216799232916989586621679923299)
instance forall a6989586621679921986 b c (a_69895866216799234666989586621679923475 :: a6989586621679921986) (a_69895866216799234686989586621679923476 :: GHC.Internal.Data.Semigroup.Internal.Sum a6989586621679921986). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679923477Sym0 a_69895866216799234666989586621679923475 a_69895866216799234686989586621679923476)
instance forall a6989586621679921986 b c (a_69895866216799236436989586621679923652 :: a6989586621679921986) (a_69895866216799236456989586621679923653 :: GHC.Internal.Data.Semigroup.Internal.Product a6989586621679921986). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679923654Sym0 a_69895866216799236436989586621679923652 a_69895866216799236456989586621679923653)
instance forall k1 a6989586621679921972 m6989586621679921971 k2 k3 k4 k5 (a6989586621679979705 :: k1) (_f_69895866216799798256989586621679979910 :: a6989586621679921972 Data.Singletons.~> m6989586621679921971) (a_69895866216799798296989586621679979911 :: k2) (a_69895866216799798316989586621679979912 :: k3). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679979913Sym0 a6989586621679979705 _f_69895866216799798256989586621679979910 a_69895866216799798296989586621679979911 a_69895866216799798316989586621679979912)
instance forall k1 a6989586621679921973 b6989586621679921974 k2 k3 k4 k5 (a6989586621679979705 :: k1) (_f_69895866216799798256989586621679979930 :: a6989586621679921973 Data.Singletons.~> (b6989586621679921974 Data.Singletons.~> b6989586621679921974)) (_z_69895866216799798276989586621679979931 :: b6989586621679921974) (a_69895866216799798356989586621679979932 :: k2) (a_69895866216799798376989586621679979933 :: k3). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679979934Sym0 a6989586621679979705 _f_69895866216799798256989586621679979930 _z_69895866216799798276989586621679979931 a_69895866216799798356989586621679979932 a_69895866216799798376989586621679979933)
instance forall k1 a6989586621679921973 b6989586621679921974 k2 k3 k4 k5 (a6989586621679979705 :: k1) (_f_69895866216799798256989586621679979930 :: a6989586621679921973 Data.Singletons.~> (b6989586621679921974 Data.Singletons.~> b6989586621679921974)) (_z_69895866216799798276989586621679979931 :: b6989586621679921974) (a_69895866216799798356989586621679979932 :: k2) (a_69895866216799798376989586621679979933 :: k3) (a_69895866216799799376989586621679979938 :: k4). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679979934Sym1 a6989586621679979705 _f_69895866216799798256989586621679979930 _z_69895866216799798276989586621679979931 a_69895866216799798356989586621679979932 a_69895866216799798376989586621679979933 a_69895866216799799376989586621679979938)
instance forall a6989586621679921973 b6989586621679921974 k (t :: * -> *) (_f_69895866216799798466989586621679979965 :: a6989586621679921973 Data.Singletons.~> (b6989586621679921974 Data.Singletons.~> b6989586621679921974)) (_z_69895866216799798486989586621679979966 :: b6989586621679921974) (a_69895866216799798686989586621679979967 :: k). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679979968Sym0 _f_69895866216799798466989586621679979965 _z_69895866216799798486989586621679979966 a_69895866216799798686989586621679979967)
instance forall a6989586621679921973 b6989586621679921974 k (t :: * -> *) (_f_69895866216799798466989586621679979965 :: a6989586621679921973 Data.Singletons.~> (b6989586621679921974 Data.Singletons.~> b6989586621679921974)) (_z_69895866216799798486989586621679979966 :: b6989586621679921974) (a_69895866216799798686989586621679979967 :: k) (a_69895866216799799726989586621679979973 :: t a6989586621679921973). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679979968Sym1 _f_69895866216799798466989586621679979965 _z_69895866216799798486989586621679979966 a_69895866216799798686989586621679979967 a_69895866216799799726989586621679979973)
instance forall a6989586621679921973 b6989586621679921974 k (t :: * -> *) (_f_69895866216799798776989586621679980000 :: a6989586621679921973 Data.Singletons.~> (b6989586621679921974 Data.Singletons.~> b6989586621679921974)) (_z_69895866216799798796989586621679980001 :: b6989586621679921974) (a_69895866216799798996989586621679980002 :: k). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679980003Sym0 _f_69895866216799798776989586621679980000 _z_69895866216799798796989586621679980001 a_69895866216799798996989586621679980002)
instance forall a6989586621679921973 b6989586621679921974 k (t :: * -> *) (_f_69895866216799798776989586621679980000 :: a6989586621679921973 Data.Singletons.~> (b6989586621679921974 Data.Singletons.~> b6989586621679921974)) (_z_69895866216799798796989586621679980001 :: b6989586621679921974) (a_69895866216799798996989586621679980002 :: k) (a_69895866216799800076989586621679980008 :: t a6989586621679921973). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.LamCases_6989586621679980003Sym1 _f_69895866216799798776989586621679980000 _z_69895866216799798796989586621679980001 a_69895866216799798996989586621679980002 a_69895866216799800076989586621679980008)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.LengthSym0
instance forall a6989586621679921882 (t6989586621679921881 :: * -> *) (cmp6989586621679922317 :: a6989586621679921882 Data.Singletons.~> (a6989586621679921882 Data.Singletons.~> GHC.Types.Ordering)) (a_69895866216799223106989586621679922318 :: t6989586621679921881 a6989586621679921882). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922319Min'Sym0 cmp6989586621679922317 a_69895866216799223106989586621679922318)
instance forall a6989586621679921882 (t6989586621679921881 :: * -> *) (cmp6989586621679922317 :: a6989586621679921882 Data.Singletons.~> (a6989586621679921882 Data.Singletons.~> GHC.Types.Ordering)) (a_69895866216799223106989586621679922318 :: t6989586621679921881 a6989586621679921882) (a6989586621679922320 :: a6989586621679921882). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922319Min'Sym1 cmp6989586621679922317 a_69895866216799223106989586621679922318 a6989586621679922320)
instance forall a6989586621679921884 (t6989586621679921883 :: * -> *) (cmp6989586621679922337 :: a6989586621679921884 Data.Singletons.~> (a6989586621679921884 Data.Singletons.~> GHC.Types.Ordering)) (a_69895866216799223306989586621679922338 :: t6989586621679921883 a6989586621679921884). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922339Max'Sym0 cmp6989586621679922337 a_69895866216799223306989586621679922338)
instance forall a6989586621679921884 (t6989586621679921883 :: * -> *) (cmp6989586621679922337 :: a6989586621679921884 Data.Singletons.~> (a6989586621679921884 Data.Singletons.~> GHC.Types.Ordering)) (a_69895866216799223306989586621679922338 :: t6989586621679921883 a6989586621679921884) (a6989586621679922340 :: a6989586621679921884). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922339Max'Sym1 cmp6989586621679922337 a_69895866216799223306989586621679922338 a6989586621679922340)
instance forall b6989586621679921926 a6989586621679921927 (m6989586621679921925 :: * -> *) (t6989586621679921924 :: * -> *) b (f6989586621679922480 :: b6989586621679921926 Data.Singletons.~> (a6989586621679921927 Data.Singletons.~> m6989586621679921925 b6989586621679921926)) (z06989586621679922481 :: b6989586621679921926) (xs6989586621679922482 :: t6989586621679921924 a6989586621679921927). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922483F'Sym0 f6989586621679922480 z06989586621679922481 xs6989586621679922482)
instance forall b6989586621679921926 a6989586621679921927 (m6989586621679921925 :: * -> *) (t6989586621679921924 :: * -> *) b (f6989586621679922480 :: b6989586621679921926 Data.Singletons.~> (a6989586621679921927 Data.Singletons.~> m6989586621679921925 b6989586621679921926)) (z06989586621679922481 :: b6989586621679921926) (xs6989586621679922482 :: t6989586621679921924 a6989586621679921927) (a6989586621679922484 :: a6989586621679921927). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922483F'Sym1 f6989586621679922480 z06989586621679922481 xs6989586621679922482 a6989586621679922484)
instance forall b6989586621679921926 a6989586621679921927 (m6989586621679921925 :: * -> *) (t6989586621679921924 :: * -> *) b (f6989586621679922480 :: b6989586621679921926 Data.Singletons.~> (a6989586621679921927 Data.Singletons.~> m6989586621679921925 b6989586621679921926)) (z06989586621679922481 :: b6989586621679921926) (xs6989586621679922482 :: t6989586621679921924 a6989586621679921927) (a6989586621679922484 :: a6989586621679921927) (a6989586621679922485 :: b6989586621679921926 Data.Singletons.~> m6989586621679921925 b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922483F'Sym2 f6989586621679922480 z06989586621679922481 xs6989586621679922482 a6989586621679922484 a6989586621679922485)
instance forall a6989586621679921930 b6989586621679921931 (m6989586621679921929 :: * -> *) (t6989586621679921928 :: * -> *) b (f6989586621679922498 :: a6989586621679921930 Data.Singletons.~> (b6989586621679921931 Data.Singletons.~> m6989586621679921929 b6989586621679921931)) (z06989586621679922499 :: b6989586621679921931) (xs6989586621679922500 :: t6989586621679921928 a6989586621679921930). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922501F'Sym0 f6989586621679922498 z06989586621679922499 xs6989586621679922500)
instance forall a6989586621679921930 b6989586621679921931 (m6989586621679921929 :: * -> *) (t6989586621679921928 :: * -> *) b (f6989586621679922498 :: a6989586621679921930 Data.Singletons.~> (b6989586621679921931 Data.Singletons.~> m6989586621679921929 b6989586621679921931)) (z06989586621679922499 :: b6989586621679921931) (xs6989586621679922500 :: t6989586621679921928 a6989586621679921930) (a6989586621679922502 :: b6989586621679921931 Data.Singletons.~> m6989586621679921929 b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922501F'Sym1 f6989586621679922498 z06989586621679922499 xs6989586621679922500 a6989586621679922502)
instance forall a6989586621679921930 b6989586621679921931 (m6989586621679921929 :: * -> *) (t6989586621679921928 :: * -> *) b (f6989586621679922498 :: a6989586621679921930 Data.Singletons.~> (b6989586621679921931 Data.Singletons.~> m6989586621679921929 b6989586621679921931)) (z06989586621679922499 :: b6989586621679921931) (xs6989586621679922500 :: t6989586621679921928 a6989586621679921930) (a6989586621679922502 :: b6989586621679921931 Data.Singletons.~> m6989586621679921929 b) (a6989586621679922503 :: a6989586621679921930). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922501F'Sym2 f6989586621679922498 z06989586621679922499 xs6989586621679922500 a6989586621679922502 a6989586621679922503)
instance forall a6989586621679921975 b6989586621679921976 k (t6989586621679921969 :: * -> *) (f6989586621679922630 :: a6989586621679921975 Data.Singletons.~> (b6989586621679921976 Data.Singletons.~> b6989586621679921976)) (z06989586621679922631 :: b6989586621679921976) (xs6989586621679922632 :: t6989586621679921969 a6989586621679921975). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922633F'Sym0 t6989586621679921969 f6989586621679922630 z06989586621679922631 xs6989586621679922632)
instance forall a6989586621679921975 b6989586621679921976 k (t6989586621679921969 :: * -> *) (f6989586621679922630 :: a6989586621679921975 Data.Singletons.~> (b6989586621679921976 Data.Singletons.~> b6989586621679921976)) (z06989586621679922631 :: b6989586621679921976) (xs6989586621679922632 :: t6989586621679921969 a6989586621679921975) (a6989586621679922634 :: b6989586621679921976 Data.Singletons.~> k). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922633F'Sym1 t6989586621679921969 f6989586621679922630 z06989586621679922631 xs6989586621679922632 a6989586621679922634)
instance forall a6989586621679921975 b6989586621679921976 k (t6989586621679921969 :: * -> *) (f6989586621679922630 :: a6989586621679921975 Data.Singletons.~> (b6989586621679921976 Data.Singletons.~> b6989586621679921976)) (z06989586621679922631 :: b6989586621679921976) (xs6989586621679922632 :: t6989586621679921969 a6989586621679921975) (a6989586621679922634 :: b6989586621679921976 Data.Singletons.~> k) (a6989586621679922635 :: a6989586621679921975). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922633F'Sym2 t6989586621679921969 f6989586621679922630 z06989586621679922631 xs6989586621679922632 a6989586621679922634 a6989586621679922635)
instance forall b6989586621679921979 a6989586621679921980 k (t6989586621679921969 :: * -> *) (f6989586621679922668 :: b6989586621679921979 Data.Singletons.~> (a6989586621679921980 Data.Singletons.~> b6989586621679921979)) (z06989586621679922669 :: b6989586621679921979) (xs6989586621679922670 :: t6989586621679921969 a6989586621679921980). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922671F'Sym0 t6989586621679921969 f6989586621679922668 z06989586621679922669 xs6989586621679922670)
instance forall b6989586621679921979 a6989586621679921980 k (t6989586621679921969 :: * -> *) (f6989586621679922668 :: b6989586621679921979 Data.Singletons.~> (a6989586621679921980 Data.Singletons.~> b6989586621679921979)) (z06989586621679922669 :: b6989586621679921979) (xs6989586621679922670 :: t6989586621679921969 a6989586621679921980) (a6989586621679922672 :: a6989586621679921980). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922671F'Sym1 t6989586621679921969 f6989586621679922668 z06989586621679922669 xs6989586621679922670 a6989586621679922672)
instance forall b6989586621679921979 a6989586621679921980 k (t6989586621679921969 :: * -> *) (f6989586621679922668 :: b6989586621679921979 Data.Singletons.~> (a6989586621679921980 Data.Singletons.~> b6989586621679921979)) (z06989586621679922669 :: b6989586621679921979) (xs6989586621679922670 :: t6989586621679921969 a6989586621679921980) (a6989586621679922672 :: a6989586621679921980) (a6989586621679922673 :: b6989586621679921979 Data.Singletons.~> k). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922671F'Sym2 t6989586621679921969 f6989586621679922668 z06989586621679922669 xs6989586621679922670 a6989586621679922672 a6989586621679922673)
instance forall a6989586621679921981 (t6989586621679921969 :: * -> *) (f6989586621679922688 :: a6989586621679921981 Data.Singletons.~> (a6989586621679921981 Data.Singletons.~> a6989586621679921981)) (xs6989586621679922689 :: t6989586621679921969 a6989586621679921981). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922690MfSym0 t6989586621679921969 f6989586621679922688 xs6989586621679922689)
instance forall a6989586621679921981 (t6989586621679921969 :: * -> *) (f6989586621679922688 :: a6989586621679921981 Data.Singletons.~> (a6989586621679921981 Data.Singletons.~> a6989586621679921981)) (xs6989586621679922689 :: t6989586621679921969 a6989586621679921981) (a6989586621679922691 :: a6989586621679921981). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922690MfSym1 t6989586621679921969 f6989586621679922688 xs6989586621679922689 a6989586621679922691)
instance forall a6989586621679921982 (t6989586621679921969 :: * -> *) (f6989586621679922711 :: a6989586621679921982 Data.Singletons.~> (a6989586621679921982 Data.Singletons.~> a6989586621679921982)) (xs6989586621679922712 :: t6989586621679921969 a6989586621679921982). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922713MfSym0 t6989586621679921969 f6989586621679922711 xs6989586621679922712)
instance forall a6989586621679921982 (t6989586621679921969 :: * -> *) (f6989586621679922711 :: a6989586621679921982 Data.Singletons.~> (a6989586621679921982 Data.Singletons.~> a6989586621679921982)) (xs6989586621679922712 :: t6989586621679921969 a6989586621679921982) (a6989586621679922714 :: GHC.Internal.Maybe.Maybe a6989586621679921982). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922713MfSym1 t6989586621679921969 f6989586621679922711 xs6989586621679922712 a6989586621679922714)
instance forall (t6989586621679921969 :: * -> *) a6989586621679921987 (a_69895866216799227856989586621679922790 :: t6989586621679921969 a6989586621679921987). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922791MkJustSym0 t6989586621679921969 a6989586621679921987 a_69895866216799227856989586621679922790)
instance forall (t6989586621679921969 :: * -> *) a6989586621679921988 (a_69895866216799228006989586621679922805 :: t6989586621679921969 a6989586621679921988). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679922806MkJustSym0 t6989586621679921969 a6989586621679921988 a_69895866216799228006989586621679922805)
instance forall a6989586621679921981 k1 k2 k3 (f6989586621679923101 :: a6989586621679921981 Data.Singletons.~> (a6989586621679921981 Data.Singletons.~> a6989586621679921981)) (p6989586621679923102 :: k1) (ps6989586621679923103 :: k2). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679923104GoSym0 f6989586621679923101 p6989586621679923102 ps6989586621679923103)
instance forall a6989586621679921981 k1 k2 k3 (f6989586621679923101 :: a6989586621679921981 Data.Singletons.~> (a6989586621679921981 Data.Singletons.~> a6989586621679921981)) (p6989586621679923102 :: k1) (ps6989586621679923103 :: k2) (a6989586621679923105 :: k3). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679923104GoSym1 f6989586621679923101 p6989586621679923102 ps6989586621679923103 a6989586621679923105)
instance forall a6989586621679921981 k1 k2 k3 (f6989586621679923101 :: a6989586621679921981 Data.Singletons.~> (a6989586621679921981 Data.Singletons.~> a6989586621679921981)) (p6989586621679923102 :: k1) (ps6989586621679923103 :: k2) (a6989586621679923105 :: k3) (a6989586621679923106 :: k3 Data.Singletons.~> a6989586621679921981). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Let6989586621679923104GoSym2 f6989586621679923101 p6989586621679923102 ps6989586621679923103 a6989586621679923105 a6989586621679923106)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.MapM_Sym0
instance forall a (m :: * -> *) b (t :: * -> *) (a6989586621679922449 :: a Data.Singletons.~> m b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.MapM_Sym1 a6989586621679922449)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.MaxInternalSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.MaximumBySym0
instance forall a (t :: * -> *) (a6989586621679922335 :: a Data.Singletons.~> (a Data.Singletons.~> GHC.Types.Ordering)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.MaximumBySym1 a6989586621679922335)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.MaximumSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.MinInternalSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.MinimumBySym0
instance forall a (t :: * -> *) (a6989586621679922315 :: a Data.Singletons.~> (a Data.Singletons.~> GHC.Types.Ordering)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.MinimumBySym1 a6989586621679922315)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.MinimumSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.MsumSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.NotElemSym0
instance forall a (t :: * -> *) (a6989586621679922306 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.NotElemSym1 a6989586621679922306)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.NullSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.OrSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.ProductSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.SequenceA_Sym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.Sequence_Sym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.SumSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.ToListSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Foldable.Singletons.Traverse_Sym0
instance forall a (f :: * -> *) b (t :: * -> *) (a6989586621679922469 :: a Data.Singletons.~> f b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Foldable.Singletons.Traverse_Sym1 a6989586621679922469)
-- | Exports the promoted and singled versions of the Identity data
-- type.
module Data.Functor.Identity.Singletons
type family Sing :: k -> Type
data SIdentity (a1 :: Identity a)
[SIdentity] :: forall a (n :: a). Sing n -> SIdentity ('Identity n)
type family RunIdentity (a1 :: Identity a) :: a
sRunIdentity :: forall a (t :: Identity a). Sing t -> Sing (RunIdentity t)
data IdentitySym0 (a1 :: TyFun a Identity a)
type family IdentitySym1 (a6989586621679051204 :: a) :: Identity a
data RunIdentitySym0 (a1 :: TyFun Identity a a)
type family RunIdentitySym1 (a6989586621679051207 :: Identity a) :: a
instance Control.Monad.Singletons.Internal.PApplicative GHC.Internal.Data.Functor.Identity.Identity
instance Data.Singletons.Base.Enum.PEnum (GHC.Internal.Data.Functor.Identity.Identity a)
instance Data.Foldable.Singletons.PFoldable GHC.Internal.Data.Functor.Identity.Identity
instance Control.Monad.Singletons.Internal.PFunctor GHC.Internal.Data.Functor.Identity.Identity
instance Control.Monad.Singletons.Internal.PMonad GHC.Internal.Data.Functor.Identity.Identity
instance Data.Monoid.Singletons.PMonoid (GHC.Internal.Data.Functor.Identity.Identity a)
instance GHC.Num.Singletons.PNum (GHC.Internal.Data.Functor.Identity.Identity a)
instance Data.Semigroup.Singletons.Internal.Classes.PSemigroup (GHC.Internal.Data.Functor.Identity.Identity a)
instance Text.Show.Singletons.PShow (GHC.Internal.Data.Functor.Identity.Identity a)
instance Control.Monad.Singletons.Internal.SApplicative GHC.Internal.Data.Functor.Identity.Identity
instance Data.Singletons.Base.Enum.SEnum a => Data.Singletons.Base.Enum.SEnum (GHC.Internal.Data.Functor.Identity.Identity a)
instance Data.Foldable.Singletons.SFoldable GHC.Internal.Data.Functor.Identity.Identity
instance Control.Monad.Singletons.Internal.SFunctor GHC.Internal.Data.Functor.Identity.Identity
instance Control.Monad.Singletons.Internal.SMonad GHC.Internal.Data.Functor.Identity.Identity
instance Data.Monoid.Singletons.SMonoid a => Data.Monoid.Singletons.SMonoid (GHC.Internal.Data.Functor.Identity.Identity a)
instance GHC.Num.Singletons.SNum a => GHC.Num.Singletons.SNum (GHC.Internal.Data.Functor.Identity.Identity a)
instance Data.Semigroup.Singletons.Internal.Classes.SSemigroup a => Data.Semigroup.Singletons.Internal.Classes.SSemigroup (GHC.Internal.Data.Functor.Identity.Identity a)
instance Text.Show.Singletons.SShow a => Text.Show.Singletons.SShow (GHC.Internal.Data.Functor.Identity.Identity a)
instance forall a7566047373982778554 k1 k2 (_z_69895866216800542426989586621680054538 :: a7566047373982778554) (a_69895866216800542466989586621680054539 :: k1). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Functor.Identity.Singletons.LamCases_6989586621680054540Sym0 _z_69895866216800542426989586621680054538 a_69895866216800542466989586621680054539)
-- | Exports the promoted and singled versions of the Const data
-- type.
module Data.Functor.Const.Singletons
type family Sing :: k -> Type
data SConst (a1 :: Const a b)
[SConst] :: forall {k} a (b :: k) (n :: a). Sing n -> SConst ('Const n :: Const a b)
type family GetConst (a1 :: Const a b) :: a
sGetConst :: forall {k} a (b :: k) (t :: Const a b). Sing t -> Sing (GetConst t)
data ConstSym0 (a1 :: TyFun a Const a b)
type family ConstSym1 (a6989586621680067841 :: a) :: Const a b
data GetConstSym0 (a1 :: TyFun Const a b a)
type family GetConstSym1 (a6989586621680067844 :: Const a b) :: a
instance forall k a (b :: k) (z :: GHC.Internal.Data.Functor.Const.Const a b). GHC.Classes.Eq (Data.Functor.Const.Singletons.SConst z)
instance forall k a (b :: k) (z :: GHC.Internal.Data.Functor.Const.Const a b). GHC.Classes.Ord (Data.Functor.Const.Singletons.SConst z)
instance Control.Monad.Singletons.Internal.PApplicative (GHC.Internal.Data.Functor.Const.Const m)
instance forall k a (b :: k). Data.Singletons.Base.Enum.PBounded (GHC.Internal.Data.Functor.Const.Const a b)
instance forall k a (b :: k). Data.Singletons.Base.Enum.PEnum (GHC.Internal.Data.Functor.Const.Const a b)
instance forall k a (b :: k). Data.Eq.Singletons.PEq (GHC.Internal.Data.Functor.Const.Const a b)
instance Data.Foldable.Singletons.PFoldable (GHC.Internal.Data.Functor.Const.Const m)
instance Control.Monad.Singletons.Internal.PFunctor (GHC.Internal.Data.Functor.Const.Const m)
instance forall k a (b :: k). Data.Monoid.Singletons.PMonoid (GHC.Internal.Data.Functor.Const.Const a b)
instance forall k a (b :: k). GHC.Num.Singletons.PNum (GHC.Internal.Data.Functor.Const.Const a b)
instance forall k a (b :: k). Data.Ord.Singletons.POrd (GHC.Internal.Data.Functor.Const.Const a b)
instance forall k a (b :: k). Data.Semigroup.Singletons.Internal.Classes.PSemigroup (GHC.Internal.Data.Functor.Const.Const a b)
instance forall k a (b :: k). Text.Show.Singletons.PShow (GHC.Internal.Data.Functor.Const.Const a b)
instance Data.Monoid.Singletons.SMonoid m => Control.Monad.Singletons.Internal.SApplicative (GHC.Internal.Data.Functor.Const.Const m)
instance forall k a (b :: k). Data.Singletons.Base.Enum.SBounded a => Data.Singletons.Base.Enum.SBounded (GHC.Internal.Data.Functor.Const.Const a b)
instance forall k a (b :: k). Data.Singletons.Decide.SDecide a => Data.Singletons.Decide.SDecide (GHC.Internal.Data.Functor.Const.Const a b)
instance forall k a (b :: k). Data.Singletons.Base.Enum.SEnum a => Data.Singletons.Base.Enum.SEnum (GHC.Internal.Data.Functor.Const.Const a b)
instance forall k a (b :: k). Data.Eq.Singletons.SEq a => Data.Eq.Singletons.SEq (GHC.Internal.Data.Functor.Const.Const a b)
instance Data.Foldable.Singletons.SFoldable (GHC.Internal.Data.Functor.Const.Const m)
instance Control.Monad.Singletons.Internal.SFunctor (GHC.Internal.Data.Functor.Const.Const m)
instance forall k a (b :: k). Data.Monoid.Singletons.SMonoid a => Data.Monoid.Singletons.SMonoid (GHC.Internal.Data.Functor.Const.Const a b)
instance forall k a (b :: k). GHC.Num.Singletons.SNum a => GHC.Num.Singletons.SNum (GHC.Internal.Data.Functor.Const.Const a b)
instance forall k a (b :: k). Data.Ord.Singletons.SOrd a => Data.Ord.Singletons.SOrd (GHC.Internal.Data.Functor.Const.Const a b)
instance forall k a (b :: k). Data.Semigroup.Singletons.Internal.Classes.SSemigroup a => Data.Semigroup.Singletons.Internal.Classes.SSemigroup (GHC.Internal.Data.Functor.Const.Const a b)
instance forall k a (b :: k). Text.Show.Singletons.SShow a => Text.Show.Singletons.SShow (GHC.Internal.Data.Functor.Const.Const a b)
instance forall k1 k (b :: k). Data.Singletons.SingI1 'GHC.Internal.Data.Functor.Const.Const
instance forall k (b :: k) a (n :: a). Data.Singletons.SingI n => Data.Singletons.SingI ('GHC.Internal.Data.Functor.Const.Const n)
instance forall k a (b :: k). Data.Singletons.SingI Data.Functor.Const.Singletons.ConstSym0
instance forall k a (b :: k). Data.Singletons.SingI Data.Functor.Const.Singletons.GetConstSym0
instance forall k a (b :: k). Data.Singletons.SingKind a => Data.Singletons.SingKind (GHC.Internal.Data.Functor.Const.Const a b)
instance forall a k (b :: k). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Functor.Const.Singletons.ConstSym0
instance forall k a (b :: k). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Functor.Const.Singletons.GetConstSym0
instance forall k1 a7566047373982778550 b7566047373982778551 k2 k3 (m6989586621680070503 :: k1) (_f_69895866216800706636989586621680070871 :: a7566047373982778550 Data.Singletons.~> b7566047373982778551) (a_69895866216800706696989586621680070872 :: k2). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Functor.Const.Singletons.LamCases_6989586621680070873Sym0 m6989586621680070503 _f_69895866216800706636989586621680070871 a_69895866216800706696989586621680070872)
instance forall k1 a7566047373982778554 k2 k3 (m6989586621680070503 :: k1) (_z_69895866216800706656989586621680070888 :: a7566047373982778554) (a_69895866216800706736989586621680070889 :: k2). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Functor.Const.Singletons.LamCases_6989586621680070890Sym0 m6989586621680070503 _z_69895866216800706656989586621680070888 a_69895866216800706736989586621680070889)
instance forall k1 a7566047373983478036 m7566047373983478037 k2 k3 k4 (m6989586621680070504 :: k1) (_f_69895866216800706786989586621680070905 :: a7566047373983478036 Data.Singletons.~> m7566047373983478037) (a_69895866216800706826989586621680070906 :: k2). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Functor.Const.Singletons.LamCases_6989586621680070907Sym0 m6989586621680070504 _f_69895866216800706786989586621680070905 a_69895866216800706826989586621680070906)
instance forall k1 a7566047373983478040 b7566047373983478041 k2 k3 k4 (m6989586621680070504 :: k1) (_f_69895866216800706786989586621680070924 :: a7566047373983478040 Data.Singletons.~> (b7566047373983478041 Data.Singletons.~> b7566047373983478041)) (_z_69895866216800706806989586621680070925 :: b7566047373983478041) (a_69895866216800706866989586621680070926 :: k2). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Functor.Const.Singletons.LamCases_6989586621680070927Sym0 m6989586621680070504 _f_69895866216800706786989586621680070924 _z_69895866216800706806989586621680070925 a_69895866216800706866989586621680070926)
instance forall k1 a7566047373983478040 b7566047373983478041 k2 k3 k4 (m6989586621680070504 :: k1) (_f_69895866216800706786989586621680070924 :: a7566047373983478040 Data.Singletons.~> (b7566047373983478041 Data.Singletons.~> b7566047373983478041)) (_z_69895866216800706806989586621680070925 :: b7566047373983478041) (a_69895866216800706866989586621680070926 :: k2) (a_69895866216800709306989586621680070931 :: k3). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Functor.Const.Singletons.LamCases_6989586621680070927Sym1 m6989586621680070504 _f_69895866216800706786989586621680070924 _z_69895866216800706806989586621680070925 a_69895866216800706866989586621680070926 a_69895866216800709306989586621680070931)
instance forall k a (b :: k). Data.Singletons.Decide.SDecide a => GHC.Internal.Data.Type.Coercion.TestCoercion Data.Functor.Const.Singletons.SConst
instance forall k a (b :: k). Data.Singletons.Decide.SDecide a => GHC.Internal.Data.Type.Equality.TestEquality Data.Functor.Const.Singletons.SConst
-- | Defines the promoted and singled versions of the Traversable
-- type class.
module Data.Traversable.Singletons
class PTraversable (t :: Type -> Type) where {
type Traverse (arg :: a ~> f b) (arg1 :: t a) :: f t b;
type SequenceA (arg :: t f a) :: f t a;
type MapM (arg :: a ~> m b) (arg1 :: t a) :: m t b;
type Sequence (arg :: t m a) :: m t a;
type Traverse arg :: a ~> f b arg1 :: t a = Traverse_6989586621680096875 arg arg1;
type SequenceA arg :: t f a = SequenceA_6989586621680096887 arg;
type MapM arg :: a ~> m b arg1 :: t a = MapM_6989586621680096897 arg arg1;
type Sequence arg :: t m a = Sequence_6989586621680096911 arg;
}
class (SFunctor t, SFoldable t) => STraversable (t :: Type -> Type)
sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: t a). (STraversable t, SApplicative f) => Sing t1 -> Sing t2 -> Sing (Traverse t1 t2)
($dmsTraverse) :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: t a). (STraversable t, Traverse t1 t2 ~ Traverse_6989586621680096875 t1 t2, SApplicative f) => Sing t1 -> Sing t2 -> Sing (Traverse t1 t2)
sSequenceA :: forall (f :: Type -> Type) a (t1 :: t (f a)). (STraversable t, SApplicative f) => Sing t1 -> Sing (SequenceA t1)
($dmsSequenceA) :: forall (f :: Type -> Type) a (t1 :: t (f a)). (STraversable t, SequenceA t1 ~ SequenceA_6989586621680096887 t1, SApplicative f) => Sing t1 -> Sing (SequenceA t1)
sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: t a). (STraversable t, SMonad m) => Sing t1 -> Sing t2 -> Sing (MapM t1 t2)
($dmsMapM) :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: t a). (STraversable t, MapM t1 t2 ~ MapM_6989586621680096897 t1 t2, SMonad m) => Sing t1 -> Sing t2 -> Sing (MapM t1 t2)
sSequence :: forall (m :: Type -> Type) a (t1 :: t (m a)). (STraversable t, SMonad m) => Sing t1 -> Sing (Sequence t1)
($dmsSequence) :: forall (m :: Type -> Type) a (t1 :: t (m a)). (STraversable t, Sequence t1 ~ Sequence_6989586621680096911 t1, SMonad m) => Sing t1 -> Sing (Sequence t1)
type family For (a1 :: t a) (a2 :: a ~> f b) :: f t b
sFor :: forall (t1 :: Type -> Type) a (f :: Type -> Type) b (t2 :: t1 a) (t3 :: a ~> f b). (STraversable t1, SApplicative f) => Sing t2 -> Sing t3 -> Sing (For t2 t3)
type family ForM (a1 :: t a) (a2 :: a ~> m b) :: m t b
sForM :: forall (t1 :: Type -> Type) a (m :: Type -> Type) b (t2 :: t1 a) (t3 :: a ~> m b). (STraversable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing (ForM t2 t3)
type family MapAccumL (a1 :: a ~> b ~> (a, c)) (a2 :: a) (a3 :: t b) :: (a, t c)
sMapAccumL :: forall (t1 :: Type -> Type) a b c (t2 :: a ~> (b ~> (a, c))) (t3 :: a) (t4 :: t1 b). STraversable t1 => Sing t2 -> Sing t3 -> Sing t4 -> Sing (MapAccumL t2 t3 t4)
type family MapAccumR (a1 :: a ~> b ~> (a, c)) (a2 :: a) (a3 :: t b) :: (a, t c)
sMapAccumR :: forall a b c (t1 :: Type -> Type) (t2 :: a ~> (b ~> (a, c))) (t3 :: a) (t4 :: t1 b). STraversable t1 => Sing t2 -> Sing t3 -> Sing t4 -> Sing (MapAccumR t2 t3 t4)
type family FmapDefault (a1 :: a ~> b) (a2 :: t a) :: t b
sFmapDefault :: forall (t1 :: Type -> Type) a b (t2 :: a ~> b) (t3 :: t1 a). STraversable t1 => Sing t2 -> Sing t3 -> Sing (FmapDefault t2 t3)
type family FoldMapDefault (a1 :: a ~> m) (a2 :: t a) :: m
sFoldMapDefault :: forall (t1 :: Type -> Type) m a (t2 :: a ~> m) (t3 :: t1 a). (STraversable t1, SMonoid m) => Sing t2 -> Sing t3 -> Sing (FoldMapDefault t2 t3)
data TraverseSym0 (a1 :: TyFun a ~> f b t a ~> f t b)
data TraverseSym1 (a6989586621680096860 :: a ~> f b) (b1 :: TyFun t a f t b)
type family TraverseSym2 (a6989586621680096860 :: a ~> f b) (a6989586621680096861 :: t a) :: f t b
data SequenceASym0 (a1 :: TyFun t f a f t a)
type family SequenceASym1 (a6989586621680096864 :: t f a) :: f t a
data MapMSym0 (a1 :: TyFun a ~> m b t a ~> m t b)
data MapMSym1 (a6989586621680096868 :: a ~> m b) (b1 :: TyFun t a m t b)
type family MapMSym2 (a6989586621680096868 :: a ~> m b) (a6989586621680096869 :: t a) :: m t b
data SequenceSym0 (a1 :: TyFun t m a m t a)
type family SequenceSym1 (a6989586621680096872 :: t m a) :: m t a
data ForSym0 (a1 :: TyFun t a a ~> f b ~> f t b)
data ForSym1 (a6989586621680103106 :: t a) (b1 :: TyFun a ~> f b f t b)
type family ForSym2 (a6989586621680103106 :: t a) (a6989586621680103107 :: a ~> f b) :: f t b
data ForMSym0 (a1 :: TyFun t a a ~> m b ~> m t b)
data ForMSym1 (a6989586621680103095 :: t a) (b1 :: TyFun a ~> m b m t b)
type family ForMSym2 (a6989586621680103095 :: t a) (a6989586621680103096 :: a ~> m b) :: m t b
data MapAccumLSym0 (a1 :: TyFun a ~> b ~> (a, c) a ~> t b ~> (a, t c))
data MapAccumLSym1 (a6989586621680103082 :: a ~> b ~> (a, c)) (b1 :: TyFun a t b ~> (a, t c))
data MapAccumLSym2 (a6989586621680103082 :: a ~> b ~> (a, c)) (a6989586621680103083 :: a) (c1 :: TyFun t b (a, t c))
type family MapAccumLSym3 (a6989586621680103082 :: a ~> b ~> (a, c)) (a6989586621680103083 :: a) (a6989586621680103084 :: t b) :: (a, t c)
data MapAccumRSym0 (a1 :: TyFun a ~> b ~> (a, c) a ~> t b ~> (a, t c))
data MapAccumRSym1 (a6989586621680103072 :: a ~> b ~> (a, c)) (b1 :: TyFun a t b ~> (a, t c))
data MapAccumRSym2 (a6989586621680103072 :: a ~> b ~> (a, c)) (a6989586621680103073 :: a) (c1 :: TyFun t b (a, t c))
type family MapAccumRSym3 (a6989586621680103072 :: a ~> b ~> (a, c)) (a6989586621680103073 :: a) (a6989586621680103074 :: t b) :: (a, t c)
data FmapDefaultSym0 (a1 :: TyFun a ~> b t a ~> t b)
data FmapDefaultSym1 (a6989586621680103058 :: a ~> b) (b1 :: TyFun t a t b)
type family FmapDefaultSym2 (a6989586621680103058 :: a ~> b) (a6989586621680103059 :: t a) :: t b
data FoldMapDefaultSym0 (a1 :: TyFun a ~> m t a ~> m)
data FoldMapDefaultSym1 (a6989586621680103039 :: a ~> m) (b :: TyFun t a m)
type family FoldMapDefaultSym2 (a6989586621680103039 :: a ~> m) (a6989586621680103040 :: t a) :: m
instance Control.Monad.Singletons.Internal.PApplicative (Data.Traversable.Singletons.StateL s)
instance Control.Monad.Singletons.Internal.PApplicative (Data.Traversable.Singletons.StateR s)
instance Control.Monad.Singletons.Internal.PFunctor (Data.Traversable.Singletons.StateL s)
instance Control.Monad.Singletons.Internal.PFunctor (Data.Traversable.Singletons.StateR s)
instance Data.Traversable.Singletons.PTraversable (GHC.Internal.Data.Functor.Const.Const m)
instance Data.Traversable.Singletons.PTraversable GHC.Internal.Data.Semigroup.Internal.Dual
instance Data.Traversable.Singletons.PTraversable (GHC.Internal.Data.Either.Either a)
instance Data.Traversable.Singletons.PTraversable GHC.Internal.Data.Monoid.First
instance Data.Traversable.Singletons.PTraversable GHC.Internal.Data.Functor.Identity.Identity
instance Data.Traversable.Singletons.PTraversable GHC.Internal.Data.Monoid.Last
instance Data.Traversable.Singletons.PTraversable []
instance Data.Traversable.Singletons.PTraversable GHC.Internal.Maybe.Maybe
instance Data.Traversable.Singletons.PTraversable GHC.Internal.Base.NonEmpty
instance Data.Traversable.Singletons.PTraversable GHC.Internal.Data.Semigroup.Internal.Product
instance Data.Traversable.Singletons.PTraversable GHC.Internal.Data.Proxy.Proxy
instance Data.Traversable.Singletons.PTraversable GHC.Internal.Data.Semigroup.Internal.Sum
instance Data.Traversable.Singletons.PTraversable ((,) a)
instance Control.Monad.Singletons.Internal.SApplicative (Data.Traversable.Singletons.StateL s)
instance Control.Monad.Singletons.Internal.SApplicative (Data.Traversable.Singletons.StateR s)
instance Control.Monad.Singletons.Internal.SFunctor (Data.Traversable.Singletons.StateL s)
instance Control.Monad.Singletons.Internal.SFunctor (Data.Traversable.Singletons.StateR s)
instance Data.Traversable.Singletons.STraversable (GHC.Internal.Data.Functor.Const.Const m)
instance Data.Traversable.Singletons.STraversable GHC.Internal.Data.Semigroup.Internal.Dual
instance Data.Traversable.Singletons.STraversable (GHC.Internal.Data.Either.Either a)
instance Data.Traversable.Singletons.STraversable GHC.Internal.Data.Monoid.First
instance Data.Traversable.Singletons.STraversable GHC.Internal.Data.Functor.Identity.Identity
instance Data.Traversable.Singletons.STraversable GHC.Internal.Data.Monoid.Last
instance Data.Traversable.Singletons.STraversable []
instance Data.Traversable.Singletons.STraversable GHC.Internal.Maybe.Maybe
instance Data.Traversable.Singletons.STraversable GHC.Internal.Base.NonEmpty
instance Data.Traversable.Singletons.STraversable GHC.Internal.Data.Semigroup.Internal.Product
instance Data.Traversable.Singletons.STraversable GHC.Internal.Data.Proxy.Proxy
instance Data.Traversable.Singletons.STraversable GHC.Internal.Data.Semigroup.Internal.Sum
instance Data.Traversable.Singletons.STraversable ((,) a)
instance Data.Traversable.Singletons.STraversable t => Data.Singletons.SingI1 Data.Traversable.Singletons.FmapDefaultSym1
instance (Data.Traversable.Singletons.STraversable t, Data.Monoid.Singletons.SMonoid m) => Data.Singletons.SingI1 Data.Traversable.Singletons.FoldMapDefaultSym1
instance Data.Traversable.Singletons.STraversable t => Data.Singletons.SingI1 Data.Traversable.Singletons.MapAccumLSym1
instance Data.Traversable.Singletons.STraversable t => Data.Singletons.SingI1 Data.Traversable.Singletons.MapAccumRSym1
instance (Data.Traversable.Singletons.STraversable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI1 Data.Traversable.Singletons.MapMSym1
instance (Data.Traversable.Singletons.STraversable t, Control.Monad.Singletons.Internal.SApplicative f) => Data.Singletons.SingI1 Data.Traversable.Singletons.TraverseSym1
instance Data.Singletons.SingI1 Data.Traversable.Singletons.RunStateLSym1
instance Data.Singletons.SingI1 Data.Traversable.Singletons.RunStateRSym1
instance forall (t :: * -> *) a b c (d :: a Data.Singletons.~> (b Data.Singletons.~> (a, c))). (Data.Traversable.Singletons.STraversable t, Data.Singletons.SingI d) => Data.Singletons.SingI1 (Data.Traversable.Singletons.MapAccumLSym2 d)
instance forall (t :: * -> *) a b c (d :: a Data.Singletons.~> (b Data.Singletons.~> (a, c))). (Data.Traversable.Singletons.STraversable t, Data.Singletons.SingI d) => Data.Singletons.SingI1 (Data.Traversable.Singletons.MapAccumRSym2 d)
instance (Data.Traversable.Singletons.STraversable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI1 Data.Traversable.Singletons.ForMSym1
instance (Data.Traversable.Singletons.STraversable t, Control.Monad.Singletons.Internal.SApplicative f) => Data.Singletons.SingI1 Data.Traversable.Singletons.ForSym1
instance Data.Traversable.Singletons.STraversable t => Data.Singletons.SingI2 Data.Traversable.Singletons.MapAccumLSym2
instance Data.Traversable.Singletons.STraversable t => Data.Singletons.SingI2 Data.Traversable.Singletons.MapAccumRSym2
instance Data.Traversable.Singletons.STraversable t => Data.Singletons.SingI Data.Traversable.Singletons.FmapDefaultSym0
instance forall (t :: * -> *) a b (d :: a Data.Singletons.~> b). (Data.Traversable.Singletons.STraversable t, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Traversable.Singletons.FmapDefaultSym1 d)
instance (Data.Traversable.Singletons.STraversable t, Data.Monoid.Singletons.SMonoid m) => Data.Singletons.SingI Data.Traversable.Singletons.FoldMapDefaultSym0
instance forall (t :: * -> *) m a (d :: a Data.Singletons.~> m). (Data.Traversable.Singletons.STraversable t, Data.Monoid.Singletons.SMonoid m, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Traversable.Singletons.FoldMapDefaultSym1 d)
instance (Data.Traversable.Singletons.STraversable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI Data.Traversable.Singletons.ForMSym0
instance forall (t :: * -> *) (m :: * -> *) a (d :: t a) b. (Data.Traversable.Singletons.STraversable t, Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Traversable.Singletons.ForMSym1 d)
instance (Data.Traversable.Singletons.STraversable t, Control.Monad.Singletons.Internal.SApplicative f) => Data.Singletons.SingI Data.Traversable.Singletons.ForSym0
instance forall (t :: * -> *) (f :: * -> *) a (d :: t a) b. (Data.Traversable.Singletons.STraversable t, Control.Monad.Singletons.Internal.SApplicative f, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Traversable.Singletons.ForSym1 d)
instance Data.Traversable.Singletons.STraversable t => Data.Singletons.SingI Data.Traversable.Singletons.MapAccumLSym0
instance forall (t :: * -> *) a b c (d :: a Data.Singletons.~> (b Data.Singletons.~> (a, c))). (Data.Traversable.Singletons.STraversable t, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Traversable.Singletons.MapAccumLSym1 d)
instance forall (t :: * -> *) a b c (d1 :: a Data.Singletons.~> (b Data.Singletons.~> (a, c))) (d2 :: a). (Data.Traversable.Singletons.STraversable t, Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.Traversable.Singletons.MapAccumLSym2 d1 d2)
instance Data.Traversable.Singletons.STraversable t => Data.Singletons.SingI Data.Traversable.Singletons.MapAccumRSym0
instance forall (t :: * -> *) a b c (d :: a Data.Singletons.~> (b Data.Singletons.~> (a, c))). (Data.Traversable.Singletons.STraversable t, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Traversable.Singletons.MapAccumRSym1 d)
instance forall (t :: * -> *) a b c (d1 :: a Data.Singletons.~> (b Data.Singletons.~> (a, c))) (d2 :: a). (Data.Traversable.Singletons.STraversable t, Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.Traversable.Singletons.MapAccumRSym2 d1 d2)
instance (Data.Traversable.Singletons.STraversable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI Data.Traversable.Singletons.MapMSym0
instance forall (t :: * -> *) (m :: * -> *) a b (d :: a Data.Singletons.~> m b). (Data.Traversable.Singletons.STraversable t, Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Traversable.Singletons.MapMSym1 d)
instance Data.Singletons.SingI Data.Traversable.Singletons.RunStateLSym0
instance forall s a (d :: Data.Traversable.Singletons.StateL s a). Data.Singletons.SingI d => Data.Singletons.SingI (Data.Traversable.Singletons.RunStateLSym1 d)
instance Data.Singletons.SingI Data.Traversable.Singletons.RunStateRSym0
instance forall s a (d :: Data.Traversable.Singletons.StateR s a). Data.Singletons.SingI d => Data.Singletons.SingI (Data.Traversable.Singletons.RunStateRSym1 d)
instance (Data.Traversable.Singletons.STraversable t, Control.Monad.Singletons.Internal.SApplicative f) => Data.Singletons.SingI Data.Traversable.Singletons.SequenceASym0
instance (Data.Traversable.Singletons.STraversable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI Data.Traversable.Singletons.SequenceSym0
instance (Data.Traversable.Singletons.STraversable t, Control.Monad.Singletons.Internal.SApplicative f) => Data.Singletons.SingI Data.Traversable.Singletons.TraverseSym0
instance forall (t :: * -> *) (f :: * -> *) a b (d :: a Data.Singletons.~> f b). (Data.Traversable.Singletons.STraversable t, Control.Monad.Singletons.Internal.SApplicative f, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.Traversable.Singletons.TraverseSym1 d)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Traversable.Singletons.FmapDefaultSym0
instance forall a b (t :: * -> *) (a6989586621680103058 :: a Data.Singletons.~> b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.FmapDefaultSym1 a6989586621680103058)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Traversable.Singletons.FoldMapDefaultSym0
instance forall a m (t :: * -> *) (a6989586621680103039 :: a Data.Singletons.~> m). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.FoldMapDefaultSym1 a6989586621680103039)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Traversable.Singletons.ForMSym0
instance forall (t :: * -> *) a (m :: * -> *) b (a6989586621680103095 :: t a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.ForMSym1 a6989586621680103095)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Traversable.Singletons.ForSym0
instance forall (t :: * -> *) a (f :: * -> *) b (a6989586621680103106 :: t a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.ForSym1 a6989586621680103106)
instance forall k1 k2 (b :: k1) (t6989586621680102613 :: * -> *) m6989586621680102614 a6989586621680102615 (f6989586621680103041 :: a6989586621680102615 Data.Singletons.~> m6989586621680102614) (x6989586621680103042 :: t6989586621680102613 a6989586621680102615). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103049Sym0 t6989586621680102613 m6989586621680102614 a6989586621680102615 f6989586621680103041 x6989586621680103042)
instance forall k (t6989586621680102616 :: * -> *) a6989586621680102617 b6989586621680102618 (f6989586621680103060 :: a6989586621680102617 Data.Singletons.~> b6989586621680102618) (x6989586621680103061 :: t6989586621680102616 a6989586621680102617). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103062Sym0 t6989586621680102616 a6989586621680102617 b6989586621680102618 f6989586621680103060 x6989586621680103061)
instance forall k1 a7566047373982778550 b7566047373982778551 k2 k3 (s6989586621680102644 :: k1) (f6989586621680103311 :: a7566047373982778550 Data.Singletons.~> b7566047373982778551) (k6989586621680103312 :: k2 Data.Singletons.~> (k3, a7566047373982778550)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103313Sym0 s6989586621680102644 f6989586621680103311 k6989586621680103312)
instance forall k1 k2 a7566047373982778550 b7566047373982778551 k3 k4 k5 (s6989586621680102644 :: k1) (s6989586621680103315 :: k2) (f6989586621680103311 :: a7566047373982778550 Data.Singletons.~> b7566047373982778551) (k6989586621680103312 :: k3). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103324Sym0 s6989586621680102644 s6989586621680103315 f6989586621680103311 k6989586621680103312)
instance forall k1 k2 a7566047373982778550 b7566047373982778551 k3 k4 k5 (s6989586621680102644 :: k1) (s6989586621680103315 :: k2) (f6989586621680103311 :: a7566047373982778550 Data.Singletons.~> b7566047373982778551) (k6989586621680103312 :: k3). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103331Sym0 s6989586621680102644 s6989586621680103315 f6989586621680103311 k6989586621680103312)
instance forall k a7566047373982778528 k1 (s6989586621680102650 :: k) (x6989586621680103388 :: a7566047373982778528). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103389Sym0 s6989586621680102650 x6989586621680103388)
instance forall k2 k3 k4 k5 k6 k7 (s6989586621680102650 :: k2) (kf6989586621680103404 :: k3 Data.Singletons.~> (k4, k5 Data.Singletons.~> k6)) (kv6989586621680103405 :: k4 Data.Singletons.~> (k7, k5)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103406Sym0 s6989586621680102650 kf6989586621680103404 kv6989586621680103405)
instance forall k1 k2 k3 k4 k5 k6 (s6989586621680102650 :: k1) (s6989586621680103408 :: k2) (kf6989586621680103404 :: k3) (kv6989586621680103405 :: k4). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103423Sym0 s6989586621680102650 s6989586621680103408 kf6989586621680103404 kv6989586621680103405)
instance forall k1 k2 k3 k4 k5 k6 (s6989586621680102650 :: k1) (s6989586621680103408 :: k2) (kf6989586621680103404 :: k3) (kv6989586621680103405 :: k4). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103430Sym0 s6989586621680102650 s6989586621680103408 kf6989586621680103404 kv6989586621680103405)
instance forall k1 k2 k3 k4 k5 k6 (s6989586621680102650 :: k1) (s6989586621680103408 :: k2) (kf6989586621680103404 :: k3) (kv6989586621680103405 :: k4). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103438Sym0 s6989586621680102650 s6989586621680103408 kf6989586621680103404 kv6989586621680103405)
instance forall k1 k2 k3 k4 k5 k6 (s6989586621680102650 :: k1) (s6989586621680103408 :: k2) (kf6989586621680103404 :: k3) (kv6989586621680103405 :: k4). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103445Sym0 s6989586621680102650 s6989586621680103408 kf6989586621680103404 kv6989586621680103405)
instance forall k2 a7566047373982778534 b7566047373982778535 c7566047373982778536 k3 k4 k5 (s6989586621680102650 :: k2) (f6989586621680103467 :: a7566047373982778534 Data.Singletons.~> (b7566047373982778535 Data.Singletons.~> c7566047373982778536)) (kx6989586621680103468 :: k3 Data.Singletons.~> (k4, a7566047373982778534)) (ky6989586621680103469 :: k4 Data.Singletons.~> (k5, b7566047373982778535)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103470Sym0 s6989586621680102650 f6989586621680103467 kx6989586621680103468 ky6989586621680103469)
instance forall k1 k2 a7566047373982778534 b7566047373982778535 c7566047373982778536 k3 k4 k5 k6 (s6989586621680102650 :: k1) (s6989586621680103472 :: k2) (f6989586621680103467 :: a7566047373982778534 Data.Singletons.~> (b7566047373982778535 Data.Singletons.~> c7566047373982778536)) (kx6989586621680103468 :: k3) (ky6989586621680103469 :: k4). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103487Sym0 s6989586621680102650 s6989586621680103472 f6989586621680103467 kx6989586621680103468 ky6989586621680103469)
instance forall k1 k2 a7566047373982778534 b7566047373982778535 c7566047373982778536 k3 k4 k5 k6 (s6989586621680102650 :: k1) (s6989586621680103472 :: k2) (f6989586621680103467 :: a7566047373982778534 Data.Singletons.~> (b7566047373982778535 Data.Singletons.~> c7566047373982778536)) (kx6989586621680103468 :: k3) (ky6989586621680103469 :: k4). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103494Sym0 s6989586621680102650 s6989586621680103472 f6989586621680103467 kx6989586621680103468 ky6989586621680103469)
instance forall k1 k2 a7566047373982778534 b7566047373982778535 c7566047373982778536 k3 k4 k5 k6 (s6989586621680102650 :: k1) (s6989586621680103472 :: k2) (f6989586621680103467 :: a7566047373982778534 Data.Singletons.~> (b7566047373982778535 Data.Singletons.~> c7566047373982778536)) (kx6989586621680103468 :: k3) (ky6989586621680103469 :: k4). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103502Sym0 s6989586621680102650 s6989586621680103472 f6989586621680103467 kx6989586621680103468 ky6989586621680103469)
instance forall k1 k2 a7566047373982778534 b7566047373982778535 c7566047373982778536 k3 k4 k5 k6 (s6989586621680102650 :: k1) (s6989586621680103472 :: k2) (f6989586621680103467 :: a7566047373982778534 Data.Singletons.~> (b7566047373982778535 Data.Singletons.~> c7566047373982778536)) (kx6989586621680103468 :: k3) (ky6989586621680103469 :: k4). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103509Sym0 s6989586621680102650 s6989586621680103472 f6989586621680103467 kx6989586621680103468 ky6989586621680103469)
instance forall k1 a7566047373982778550 b7566047373982778551 k2 k3 (s6989586621680102668 :: k1) (f6989586621680103528 :: a7566047373982778550 Data.Singletons.~> b7566047373982778551) (k6989586621680103529 :: k2 Data.Singletons.~> (k3, a7566047373982778550)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103530Sym0 s6989586621680102668 f6989586621680103528 k6989586621680103529)
instance forall k1 k2 a7566047373982778550 b7566047373982778551 k3 k4 k5 (s6989586621680102668 :: k1) (s6989586621680103532 :: k2) (f6989586621680103528 :: a7566047373982778550 Data.Singletons.~> b7566047373982778551) (k6989586621680103529 :: k3). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103541Sym0 s6989586621680102668 s6989586621680103532 f6989586621680103528 k6989586621680103529)
instance forall k1 k2 a7566047373982778550 b7566047373982778551 k3 k4 k5 (s6989586621680102668 :: k1) (s6989586621680103532 :: k2) (f6989586621680103528 :: a7566047373982778550 Data.Singletons.~> b7566047373982778551) (k6989586621680103529 :: k3). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103548Sym0 s6989586621680102668 s6989586621680103532 f6989586621680103528 k6989586621680103529)
instance forall k a7566047373982778528 k1 (s6989586621680102674 :: k) (x6989586621680103564 :: a7566047373982778528). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103565Sym0 s6989586621680102674 x6989586621680103564)
instance forall k2 k3 k4 k5 k6 k7 (s6989586621680102674 :: k2) (kf6989586621680103580 :: k3 Data.Singletons.~> (k4, k5 Data.Singletons.~> k6)) (kv6989586621680103581 :: k7 Data.Singletons.~> (k3, k5)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103582Sym0 s6989586621680102674 kf6989586621680103580 kv6989586621680103581)
instance forall k1 k2 k3 k4 k5 k6 (s6989586621680102674 :: k1) (s6989586621680103584 :: k2) (kf6989586621680103580 :: k3) (kv6989586621680103581 :: k4). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103599Sym0 s6989586621680102674 s6989586621680103584 kf6989586621680103580 kv6989586621680103581)
instance forall k1 k2 k3 k4 k5 k6 (s6989586621680102674 :: k1) (s6989586621680103584 :: k2) (kf6989586621680103580 :: k3) (kv6989586621680103581 :: k4). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103606Sym0 s6989586621680102674 s6989586621680103584 kf6989586621680103580 kv6989586621680103581)
instance forall k1 k2 k3 k4 k5 k6 (s6989586621680102674 :: k1) (s6989586621680103584 :: k2) (kf6989586621680103580 :: k3) (kv6989586621680103581 :: k4). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103614Sym0 s6989586621680102674 s6989586621680103584 kf6989586621680103580 kv6989586621680103581)
instance forall k1 k2 k3 k4 k5 k6 (s6989586621680102674 :: k1) (s6989586621680103584 :: k2) (kf6989586621680103580 :: k3) (kv6989586621680103581 :: k4). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103621Sym0 s6989586621680102674 s6989586621680103584 kf6989586621680103580 kv6989586621680103581)
instance forall k1 a7566047373982778534 b7566047373982778535 c7566047373982778536 k2 k3 k4 (s6989586621680102674 :: k1) (f6989586621680103643 :: a7566047373982778534 Data.Singletons.~> (b7566047373982778535 Data.Singletons.~> c7566047373982778536)) (kx6989586621680103644 :: k2 Data.Singletons.~> (k3, a7566047373982778534)) (ky6989586621680103645 :: k4 Data.Singletons.~> (k2, b7566047373982778535)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103646Sym0 s6989586621680102674 f6989586621680103643 kx6989586621680103644 ky6989586621680103645)
instance forall k1 k2 a7566047373982778534 b7566047373982778535 c7566047373982778536 k3 k4 k5 k6 (s6989586621680102674 :: k1) (s6989586621680103648 :: k2) (f6989586621680103643 :: a7566047373982778534 Data.Singletons.~> (b7566047373982778535 Data.Singletons.~> c7566047373982778536)) (kx6989586621680103644 :: k3) (ky6989586621680103645 :: k4). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103663Sym0 s6989586621680102674 s6989586621680103648 f6989586621680103643 kx6989586621680103644 ky6989586621680103645)
instance forall k1 k2 a7566047373982778534 b7566047373982778535 c7566047373982778536 k3 k4 k5 k6 (s6989586621680102674 :: k1) (s6989586621680103648 :: k2) (f6989586621680103643 :: a7566047373982778534 Data.Singletons.~> (b7566047373982778535 Data.Singletons.~> c7566047373982778536)) (kx6989586621680103644 :: k3) (ky6989586621680103645 :: k4). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103670Sym0 s6989586621680102674 s6989586621680103648 f6989586621680103643 kx6989586621680103644 ky6989586621680103645)
instance forall k1 k2 a7566047373982778534 b7566047373982778535 c7566047373982778536 k3 k4 k5 k6 (s6989586621680102674 :: k1) (s6989586621680103648 :: k2) (f6989586621680103643 :: a7566047373982778534 Data.Singletons.~> (b7566047373982778535 Data.Singletons.~> c7566047373982778536)) (kx6989586621680103644 :: k3) (ky6989586621680103645 :: k4). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103678Sym0 s6989586621680102674 s6989586621680103648 f6989586621680103643 kx6989586621680103644 ky6989586621680103645)
instance forall k1 k2 a7566047373982778534 b7566047373982778535 c7566047373982778536 k3 k4 k5 k6 (s6989586621680102674 :: k1) (s6989586621680103648 :: k2) (f6989586621680103643 :: a7566047373982778534 Data.Singletons.~> (b7566047373982778535 Data.Singletons.~> c7566047373982778536)) (kx6989586621680103644 :: k3) (ky6989586621680103645 :: k4). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.LamCases_6989586621680103685Sym0 s6989586621680102674 s6989586621680103648 f6989586621680103643 kx6989586621680103644 ky6989586621680103645)
instance forall (t6989586621680102613 :: * -> *) m6989586621680102614 a6989586621680102615 (f6989586621680103041 :: a6989586621680102615 Data.Singletons.~> m6989586621680102614) (x6989586621680103042 :: t6989586621680102613 a6989586621680102615). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.Let6989586621680103043MkConstSym0 t6989586621680102613 m6989586621680102614 a6989586621680102615 f6989586621680103041 x6989586621680103042)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Traversable.Singletons.MapAccumLSym0
instance forall a b c (t :: * -> *) (a6989586621680103082 :: a Data.Singletons.~> (b Data.Singletons.~> (a, c))). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.MapAccumLSym1 a6989586621680103082)
instance forall a b c (t :: * -> *) (a6989586621680103082 :: a Data.Singletons.~> (b Data.Singletons.~> (a, c))) (a6989586621680103083 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.MapAccumLSym2 a6989586621680103082 a6989586621680103083)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Traversable.Singletons.MapAccumRSym0
instance forall a b c (t :: * -> *) (a6989586621680103072 :: a Data.Singletons.~> (b Data.Singletons.~> (a, c))). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.MapAccumRSym1 a6989586621680103072)
instance forall a b c (t :: * -> *) (a6989586621680103072 :: a Data.Singletons.~> (b Data.Singletons.~> (a, c))) (a6989586621680103073 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.MapAccumRSym2 a6989586621680103072 a6989586621680103073)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Traversable.Singletons.MapMSym0
instance forall a (m :: * -> *) b (t :: * -> *) (a6989586621680096868 :: a Data.Singletons.~> m b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.MapMSym1 a6989586621680096868)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Traversable.Singletons.RunStateLSym0
instance forall s a (a6989586621680095199 :: Data.Traversable.Singletons.StateL s a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.RunStateLSym1 a6989586621680095199)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Traversable.Singletons.RunStateRSym0
instance forall s a (a6989586621680095190 :: Data.Traversable.Singletons.StateR s a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.RunStateRSym1 a6989586621680095190)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Traversable.Singletons.SequenceASym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Traversable.Singletons.SequenceSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Traversable.Singletons.TraverseSym0
instance forall a (f :: * -> *) b (t :: * -> *) (a6989586621680096860 :: a Data.Singletons.~> f b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Traversable.Singletons.TraverseSym1 a6989586621680096860)
-- | Defines the promoted version of Semigroup, PSemigroup,
-- and the singleton version, SSemigroup.
module Data.Semigroup.Singletons
class PSemigroup a where {
type (arg :: a) <> (arg1 :: a) :: a;
type Sconcat (arg :: NonEmpty a) :: a;
type Sconcat arg :: NonEmpty a = Sconcat_6989586621679173985 arg;
}
infixr 6 <>
class SSemigroup a
(%<>) :: forall (t1 :: a) (t2 :: a). SSemigroup a => Sing t1 -> Sing t2 -> Sing (t1 <> t2)
sSconcat :: forall (t :: NonEmpty a). SSemigroup a => Sing t -> Sing (Sconcat t)
($dmsSconcat) :: forall (t :: NonEmpty a). (SSemigroup a, Sconcat t ~ Sconcat_6989586621679173985 t) => Sing t -> Sing (Sconcat t)
infixr 6 %<>
type family Sing :: k -> Type
data SMin (a1 :: Min a)
[SMin] :: forall a (n :: a). Sing n -> SMin ('Min n)
data SMax (a1 :: Max a)
[SMax] :: forall a (n :: a). Sing n -> SMax ('Max n)
data SFirst (a1 :: First a)
[SFirst] :: forall a (n :: a). Sing n -> SFirst ('First n)
data SLast (a1 :: Last a)
[SLast] :: forall a (n :: a). Sing n -> SLast ('Last n)
data SWrappedMonoid (a :: WrappedMonoid m)
[SWrapMonoid] :: forall m (n :: m). Sing n -> SWrappedMonoid ('WrapMonoid n)
data SDual (a1 :: Dual a)
[SDual] :: forall a (n :: a). Sing n -> SDual ('Dual n)
data SAll (a :: All)
[SAll] :: forall (n :: Bool). Sing n -> SAll ('All n)
data SAny (a :: Any)
[SAny] :: forall (n :: Bool). Sing n -> SAny ('Any n)
data SSum (a1 :: Sum a)
[SSum] :: forall a (n :: a). Sing n -> SSum ('Sum n)
data SProduct (a1 :: Product a)
[SProduct] :: forall a (n :: a). Sing n -> SProduct ('Product n)
data SArg (a1 :: Arg a b)
[SArg] :: forall a b (n1 :: a) (n2 :: b). Sing n1 -> Sing n2 -> SArg ('Arg n1 n2)
type family GetMin (a1 :: Min a) :: a
type family GetMax (a1 :: Max a) :: a
type family GetFirst (a1 :: First a) :: a
type family GetLast (a1 :: Last a) :: a
type family UnwrapMonoid (a :: WrappedMonoid m) :: m
type family GetDual (a1 :: Dual a) :: a
type family GetAll (a :: All) :: Bool
type family GetAny (a :: Any) :: Bool
type family GetSum (a1 :: Sum a) :: a
type family GetProduct (a1 :: Product a) :: a
sGetMin :: forall a (t :: Min a). Sing t -> Sing (GetMin t)
sGetMax :: forall a (t :: Max a). Sing t -> Sing (GetMax t)
sGetFirst :: forall a (t :: First a). Sing t -> Sing (GetFirst t)
sGetLast :: forall a (t :: Last a). Sing t -> Sing (GetLast t)
sUnwrapMonoid :: forall m (t :: WrappedMonoid m). Sing t -> Sing (UnwrapMonoid t)
sGetDual :: forall a (t :: Dual a). Sing t -> Sing (GetDual t)
sGetAll :: forall (t :: All). Sing t -> Sing (GetAll t)
sGetAny :: forall (t :: Any). Sing t -> Sing (GetAny t)
sGetSum :: forall a (t :: Sum a). Sing t -> Sing (GetSum t)
sGetProduct :: forall a (t :: Product a). Sing t -> Sing (GetProduct t)
data (a1 :: TyFun a a ~> a) <>@#@$
infixr 6 <>@#@$
data (a6989586621679173979 :: a) <>@#@$$ (b :: TyFun a a)
infixr 6 <>@#@$$
type family (a6989586621679173979 :: a) <>@#@$$$ (a6989586621679173980 :: a) :: a
infixr 6 <>@#@$$$
data SconcatSym0 (a1 :: TyFun NonEmpty a a)
type family SconcatSym1 (a6989586621679173983 :: NonEmpty a) :: a
data MinSym0 (a1 :: TyFun a Min a)
type family MinSym1 (a6989586621679458664 :: a) :: Min a
data GetMinSym0 (a1 :: TyFun Min a a)
type family GetMinSym1 (a6989586621679458667 :: Min a) :: a
data MaxSym0 (a1 :: TyFun a Max a)
type family MaxSym1 (a6989586621679458683 :: a) :: Max a
data GetMaxSym0 (a1 :: TyFun Max a a)
type family GetMaxSym1 (a6989586621679458686 :: Max a) :: a
data FirstSym0 (a1 :: TyFun a First a)
type family FirstSym1 (a6989586621679458702 :: a) :: First a
data GetFirstSym0 (a1 :: TyFun First a a)
type family GetFirstSym1 (a6989586621679458705 :: First a) :: a
data LastSym0 (a1 :: TyFun a Last a)
type family LastSym1 (a6989586621679458721 :: a) :: Last a
data GetLastSym0 (a1 :: TyFun Last a a)
type family GetLastSym1 (a6989586621679458724 :: Last a) :: a
data WrapMonoidSym0 (a :: TyFun m WrappedMonoid m)
type family WrapMonoidSym1 (a6989586621679458740 :: m) :: WrappedMonoid m
data UnwrapMonoidSym0 (a :: TyFun WrappedMonoid m m)
type family UnwrapMonoidSym1 (a6989586621679458743 :: WrappedMonoid m) :: m
data DualSym0 (a1 :: TyFun a Dual a)
type family DualSym1 (a6989586621679458575 :: a) :: Dual a
data GetDualSym0 (a1 :: TyFun Dual a a)
type family GetDualSym1 (a6989586621679458578 :: Dual a) :: a
data AllSym0 (a :: TyFun Bool All)
type family AllSym1 (a6989586621679458591 :: Bool) :: All
data GetAllSym0 (a :: TyFun All Bool)
type family GetAllSym1 (a6989586621679458594 :: All) :: Bool
data AnySym0 (a :: TyFun Bool Any)
type family AnySym1 (a6989586621679458607 :: Bool) :: Any
data GetAnySym0 (a :: TyFun Any Bool)
type family GetAnySym1 (a6989586621679458610 :: Any) :: Bool
data SumSym0 (a1 :: TyFun a Sum a)
type family SumSym1 (a6989586621679458626 :: a) :: Sum a
data GetSumSym0 (a1 :: TyFun Sum a a)
type family GetSumSym1 (a6989586621679458629 :: Sum a) :: a
data ProductSym0 (a1 :: TyFun a Product a)
type family ProductSym1 (a6989586621679458645 :: a) :: Product a
data GetProductSym0 (a1 :: TyFun Product a a)
type family GetProductSym1 (a6989586621679458648 :: Product a) :: a
data ArgSym0 (a1 :: TyFun a b ~> Arg a b)
data ArgSym1 (a6989586621680159057 :: a) (b1 :: TyFun b Arg a b)
type family ArgSym2 (a6989586621680159057 :: a) (a6989586621680159058 :: b) :: Arg a b
instance forall a b (z :: Data.Semigroup.Arg a b). GHC.Classes.Eq (Data.Semigroup.Singletons.SArg z)
instance forall a b (z :: Data.Semigroup.Arg a b). GHC.Classes.Ord (Data.Semigroup.Singletons.SArg z)
instance Control.Monad.Singletons.Internal.PApplicative Data.Semigroup.First
instance Control.Monad.Singletons.Internal.PApplicative Data.Semigroup.Last
instance Control.Monad.Singletons.Internal.PApplicative Data.Semigroup.Max
instance Control.Monad.Singletons.Internal.PApplicative Data.Semigroup.Min
instance Data.Singletons.Base.Enum.PEnum (Data.Semigroup.First a)
instance Data.Singletons.Base.Enum.PEnum (Data.Semigroup.Last a)
instance Data.Singletons.Base.Enum.PEnum (Data.Semigroup.Max a)
instance Data.Singletons.Base.Enum.PEnum (Data.Semigroup.Min a)
instance Data.Singletons.Base.Enum.PEnum (Data.Semigroup.WrappedMonoid a)
instance Data.Eq.Singletons.PEq (Data.Semigroup.Arg a b)
instance Data.Foldable.Singletons.PFoldable (Data.Semigroup.Arg a)
instance Data.Foldable.Singletons.PFoldable Data.Semigroup.First
instance Data.Foldable.Singletons.PFoldable Data.Semigroup.Last
instance Data.Foldable.Singletons.PFoldable Data.Semigroup.Max
instance Data.Foldable.Singletons.PFoldable Data.Semigroup.Min
instance Control.Monad.Singletons.Internal.PFunctor (Data.Semigroup.Arg a)
instance Control.Monad.Singletons.Internal.PFunctor Data.Semigroup.First
instance Control.Monad.Singletons.Internal.PFunctor Data.Semigroup.Last
instance Control.Monad.Singletons.Internal.PFunctor Data.Semigroup.Max
instance Control.Monad.Singletons.Internal.PFunctor Data.Semigroup.Min
instance Control.Monad.Singletons.Internal.PMonad Data.Semigroup.First
instance Control.Monad.Singletons.Internal.PMonad Data.Semigroup.Last
instance Control.Monad.Singletons.Internal.PMonad Data.Semigroup.Max
instance Control.Monad.Singletons.Internal.PMonad Data.Semigroup.Min
instance Data.Monoid.Singletons.PMonoid (Data.Semigroup.Max a)
instance Data.Monoid.Singletons.PMonoid (Data.Semigroup.Min a)
instance Data.Monoid.Singletons.PMonoid (Data.Semigroup.WrappedMonoid m)
instance GHC.Num.Singletons.PNum (Data.Semigroup.Max a)
instance GHC.Num.Singletons.PNum (Data.Semigroup.Min a)
instance Data.Ord.Singletons.POrd (Data.Semigroup.Arg a b)
instance Data.Semigroup.Singletons.Internal.Classes.PSemigroup (Data.Semigroup.First a)
instance Data.Semigroup.Singletons.Internal.Classes.PSemigroup (Data.Semigroup.Last a)
instance Data.Semigroup.Singletons.Internal.Classes.PSemigroup (Data.Semigroup.Max a)
instance Data.Semigroup.Singletons.Internal.Classes.PSemigroup (Data.Semigroup.Min a)
instance Data.Semigroup.Singletons.Internal.Classes.PSemigroup (Data.Semigroup.WrappedMonoid m)
instance Text.Show.Singletons.PShow GHC.Internal.Data.Semigroup.Internal.All
instance Text.Show.Singletons.PShow GHC.Internal.Data.Semigroup.Internal.Any
instance Text.Show.Singletons.PShow (Data.Semigroup.Arg a b)
instance Text.Show.Singletons.PShow (GHC.Internal.Data.Semigroup.Internal.Dual a)
instance Text.Show.Singletons.PShow (Data.Semigroup.First a)
instance Text.Show.Singletons.PShow (Data.Semigroup.Last a)
instance Text.Show.Singletons.PShow (Data.Semigroup.Max a)
instance Text.Show.Singletons.PShow (Data.Semigroup.Min a)
instance Text.Show.Singletons.PShow (GHC.Internal.Data.Semigroup.Internal.Product a)
instance Text.Show.Singletons.PShow (GHC.Internal.Data.Semigroup.Internal.Sum a)
instance Text.Show.Singletons.PShow (Data.Semigroup.WrappedMonoid m)
instance Data.Traversable.Singletons.PTraversable (Data.Semigroup.Arg a)
instance Data.Traversable.Singletons.PTraversable Data.Semigroup.First
instance Data.Traversable.Singletons.PTraversable Data.Semigroup.Last
instance Data.Traversable.Singletons.PTraversable Data.Semigroup.Max
instance Data.Traversable.Singletons.PTraversable Data.Semigroup.Min
instance Control.Monad.Singletons.Internal.SApplicative Data.Semigroup.First
instance Control.Monad.Singletons.Internal.SApplicative Data.Semigroup.Last
instance Control.Monad.Singletons.Internal.SApplicative Data.Semigroup.Max
instance Control.Monad.Singletons.Internal.SApplicative Data.Semigroup.Min
instance Data.Singletons.Base.Enum.SEnum a => Data.Singletons.Base.Enum.SEnum (Data.Semigroup.First a)
instance Data.Singletons.Base.Enum.SEnum a => Data.Singletons.Base.Enum.SEnum (Data.Semigroup.Last a)
instance Data.Singletons.Base.Enum.SEnum a => Data.Singletons.Base.Enum.SEnum (Data.Semigroup.Max a)
instance Data.Singletons.Base.Enum.SEnum a => Data.Singletons.Base.Enum.SEnum (Data.Semigroup.Min a)
instance Data.Singletons.Base.Enum.SEnum a => Data.Singletons.Base.Enum.SEnum (Data.Semigroup.WrappedMonoid a)
instance Data.Eq.Singletons.SEq a => Data.Eq.Singletons.SEq (Data.Semigroup.Arg a b)
instance Data.Foldable.Singletons.SFoldable (Data.Semigroup.Arg a)
instance Data.Foldable.Singletons.SFoldable Data.Semigroup.First
instance Data.Foldable.Singletons.SFoldable Data.Semigroup.Last
instance Data.Foldable.Singletons.SFoldable Data.Semigroup.Max
instance Data.Foldable.Singletons.SFoldable Data.Semigroup.Min
instance Control.Monad.Singletons.Internal.SFunctor (Data.Semigroup.Arg a)
instance Control.Monad.Singletons.Internal.SFunctor Data.Semigroup.First
instance Control.Monad.Singletons.Internal.SFunctor Data.Semigroup.Last
instance Control.Monad.Singletons.Internal.SFunctor Data.Semigroup.Max
instance Control.Monad.Singletons.Internal.SFunctor Data.Semigroup.Min
instance Control.Monad.Singletons.Internal.SMonad Data.Semigroup.First
instance Control.Monad.Singletons.Internal.SMonad Data.Semigroup.Last
instance Control.Monad.Singletons.Internal.SMonad Data.Semigroup.Max
instance Control.Monad.Singletons.Internal.SMonad Data.Semigroup.Min
instance (Data.Ord.Singletons.SOrd a, Data.Singletons.Base.Enum.SBounded a) => Data.Monoid.Singletons.SMonoid (Data.Semigroup.Max a)
instance (Data.Ord.Singletons.SOrd a, Data.Singletons.Base.Enum.SBounded a) => Data.Monoid.Singletons.SMonoid (Data.Semigroup.Min a)
instance Data.Monoid.Singletons.SMonoid m => Data.Monoid.Singletons.SMonoid (Data.Semigroup.WrappedMonoid m)
instance GHC.Num.Singletons.SNum a => GHC.Num.Singletons.SNum (Data.Semigroup.Max a)
instance GHC.Num.Singletons.SNum a => GHC.Num.Singletons.SNum (Data.Semigroup.Min a)
instance Data.Ord.Singletons.SOrd a => Data.Ord.Singletons.SOrd (Data.Semigroup.Arg a b)
instance Data.Semigroup.Singletons.Internal.Classes.SSemigroup (Data.Semigroup.First a)
instance Data.Semigroup.Singletons.Internal.Classes.SSemigroup (Data.Semigroup.Last a)
instance Data.Ord.Singletons.SOrd a => Data.Semigroup.Singletons.Internal.Classes.SSemigroup (Data.Semigroup.Max a)
instance Data.Ord.Singletons.SOrd a => Data.Semigroup.Singletons.Internal.Classes.SSemigroup (Data.Semigroup.Min a)
instance Data.Monoid.Singletons.SMonoid m => Data.Semigroup.Singletons.Internal.Classes.SSemigroup (Data.Semigroup.WrappedMonoid m)
instance Text.Show.Singletons.SShow GHC.Types.Bool => Text.Show.Singletons.SShow GHC.Internal.Data.Semigroup.Internal.All
instance Text.Show.Singletons.SShow GHC.Types.Bool => Text.Show.Singletons.SShow GHC.Internal.Data.Semigroup.Internal.Any
instance (Text.Show.Singletons.SShow a, Text.Show.Singletons.SShow b) => Text.Show.Singletons.SShow (Data.Semigroup.Arg a b)
instance Text.Show.Singletons.SShow a => Text.Show.Singletons.SShow (GHC.Internal.Data.Semigroup.Internal.Dual a)
instance Text.Show.Singletons.SShow a => Text.Show.Singletons.SShow (Data.Semigroup.First a)
instance Text.Show.Singletons.SShow a => Text.Show.Singletons.SShow (Data.Semigroup.Last a)
instance Text.Show.Singletons.SShow a => Text.Show.Singletons.SShow (Data.Semigroup.Max a)
instance Text.Show.Singletons.SShow a => Text.Show.Singletons.SShow (Data.Semigroup.Min a)
instance Text.Show.Singletons.SShow a => Text.Show.Singletons.SShow (GHC.Internal.Data.Semigroup.Internal.Product a)
instance Text.Show.Singletons.SShow a => Text.Show.Singletons.SShow (GHC.Internal.Data.Semigroup.Internal.Sum a)
instance Text.Show.Singletons.SShow m => Text.Show.Singletons.SShow (Data.Semigroup.WrappedMonoid m)
instance Data.Traversable.Singletons.STraversable (Data.Semigroup.Arg a)
instance Data.Traversable.Singletons.STraversable Data.Semigroup.First
instance Data.Traversable.Singletons.STraversable Data.Semigroup.Last
instance Data.Traversable.Singletons.STraversable Data.Semigroup.Max
instance Data.Traversable.Singletons.STraversable Data.Semigroup.Min
instance Data.Singletons.ShowSing.ShowSing GHC.Types.Bool => GHC.Internal.Show.Show (Data.Semigroup.Singletons.Internal.Wrappers.SAll z)
instance Data.Singletons.ShowSing.ShowSing GHC.Types.Bool => GHC.Internal.Show.Show (Data.Semigroup.Singletons.Internal.Wrappers.SAny z)
instance forall a b (z :: Data.Semigroup.Arg a b). (Data.Singletons.ShowSing.ShowSing a, Data.Singletons.ShowSing.ShowSing b) => GHC.Internal.Show.Show (Data.Semigroup.Singletons.SArg z)
instance forall a (z :: GHC.Internal.Data.Semigroup.Internal.Dual a). Data.Singletons.ShowSing.ShowSing a => GHC.Internal.Show.Show (Data.Semigroup.Singletons.Internal.Wrappers.SDual z)
instance forall a (z :: Data.Semigroup.First a). Data.Singletons.ShowSing.ShowSing a => GHC.Internal.Show.Show (Data.Semigroup.Singletons.Internal.Wrappers.SFirst z)
instance forall a (z :: Data.Semigroup.Last a). Data.Singletons.ShowSing.ShowSing a => GHC.Internal.Show.Show (Data.Semigroup.Singletons.Internal.Wrappers.SLast z)
instance forall a (z :: Data.Semigroup.Max a). Data.Singletons.ShowSing.ShowSing a => GHC.Internal.Show.Show (Data.Semigroup.Singletons.Internal.Wrappers.SMax z)
instance forall a (z :: Data.Semigroup.Min a). Data.Singletons.ShowSing.ShowSing a => GHC.Internal.Show.Show (Data.Semigroup.Singletons.Internal.Wrappers.SMin z)
instance forall a (z :: GHC.Internal.Data.Semigroup.Internal.Product a). Data.Singletons.ShowSing.ShowSing a => GHC.Internal.Show.Show (Data.Semigroup.Singletons.Internal.Wrappers.SProduct z)
instance forall a (z :: GHC.Internal.Data.Semigroup.Internal.Sum a). Data.Singletons.ShowSing.ShowSing a => GHC.Internal.Show.Show (Data.Semigroup.Singletons.Internal.Wrappers.SSum z)
instance forall m (z :: Data.Semigroup.WrappedMonoid m). Data.Singletons.ShowSing.ShowSing m => GHC.Internal.Show.Show (Data.Semigroup.Singletons.Internal.Wrappers.SWrappedMonoid z)
instance Data.Singletons.SingI1 Data.Semigroup.Singletons.ArgSym1
instance forall k1 a (n :: a). Data.Singletons.SingI n => Data.Singletons.SingI1 ('Data.Semigroup.Arg n)
instance Data.Singletons.SingI2 'Data.Semigroup.Arg
instance forall a (n1 :: a) b (n2 :: b). (Data.Singletons.SingI n1, Data.Singletons.SingI n2) => Data.Singletons.SingI ('Data.Semigroup.Arg n1 n2)
instance Data.Singletons.SingI Data.Semigroup.Singletons.ArgSym0
instance forall a (d :: a) b. Data.Singletons.SingI d => Data.Singletons.SingI (Data.Semigroup.Singletons.ArgSym1 d)
instance (Data.Singletons.SingKind a, Data.Singletons.SingKind b) => Data.Singletons.SingKind (Data.Semigroup.Arg a b)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Semigroup.Singletons.ArgSym0
instance forall a b (a6989586621680159057 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Semigroup.Singletons.ArgSym1 a6989586621680159057)
instance forall a7566047373982778554 k1 k2 (_z_69895866216801757056989586621680176153 :: a7566047373982778554) (a_69895866216801757096989586621680176154 :: k1). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Semigroup.Singletons.LamCases_6989586621680176155Sym0 _z_69895866216801757056989586621680176153 a_69895866216801757096989586621680176154)
instance forall a7566047373982778554 k1 k2 (_z_69895866216801757286989586621680176969 :: a7566047373982778554) (a_69895866216801757326989586621680176970 :: k1). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Semigroup.Singletons.LamCases_6989586621680176971Sym0 _z_69895866216801757286989586621680176969 a_69895866216801757326989586621680176970)
instance forall k1 a7566047373982778550 b7566047373982778551 k2 k3 k4 (a6989586621680175462 :: k1) (_f_69895866216801757506989586621680177156 :: a7566047373982778550 Data.Singletons.~> b7566047373982778551) (a_69895866216801757566989586621680177157 :: k2) (a_69895866216801757586989586621680177158 :: k3). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Semigroup.Singletons.LamCases_6989586621680177159Sym0 a6989586621680175462 _f_69895866216801757506989586621680177156 a_69895866216801757566989586621680177157 a_69895866216801757586989586621680177158)
instance forall k1 a7566047373982778554 k2 k3 k4 (a6989586621680175462 :: k1) (_z_69895866216801757526989586621680177174 :: a7566047373982778554) (a_69895866216801757626989586621680177175 :: k2) (a_69895866216801757646989586621680177176 :: k3). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Semigroup.Singletons.LamCases_6989586621680177177Sym0 a6989586621680175462 _z_69895866216801757526989586621680177174 a_69895866216801757626989586621680177175 a_69895866216801757646989586621680177176)
instance forall k1 a7566047373982778554 k2 k3 k4 (a6989586621680175462 :: k1) (_z_69895866216801757526989586621680177174 :: a7566047373982778554) (a_69895866216801757626989586621680177175 :: k2) (a_69895866216801757646989586621680177176 :: k3). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Semigroup.Singletons.LamCases_6989586621680177183Sym0 a6989586621680175462 _z_69895866216801757526989586621680177174 a_69895866216801757626989586621680177175 a_69895866216801757646989586621680177176)
instance forall k1 k a6989586621680175463 b6989586621680175464 (arg_69895866216801755346989586621680177253 :: Data.Semigroup.Arg a6989586621680175463 b6989586621680175464) (arg_69895866216801755366989586621680177254 :: Data.Semigroup.Arg a6989586621680175463 b6989586621680175464). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Semigroup.Singletons.LamCases_6989586621680177255Sym0 a6989586621680175463 b6989586621680175464 arg_69895866216801755346989586621680177253 arg_69895866216801755366989586621680177254)
instance forall k1 k a6989586621680175463 b6989586621680175464 (arg_69895866216801755346989586621680177253 :: Data.Semigroup.Arg a6989586621680175463 b6989586621680175464) (arg_69895866216801755366989586621680177254 :: Data.Semigroup.Arg a6989586621680175463 b6989586621680175464) (a_69895866216801772696989586621680177270 :: Data.Semigroup.Arg k1 k). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Semigroup.Singletons.LamCases_6989586621680177255Sym1 a6989586621680175463 b6989586621680175464 arg_69895866216801755346989586621680177253 arg_69895866216801755366989586621680177254 a_69895866216801772696989586621680177270)
instance forall k1 k2 a6989586621680175463 b6989586621680175464 (a6989586621680177257 :: k1) (wild_69895866216801755386989586621680177258 :: k2) (b6989586621680177259 :: k1) (wild_69895866216801755406989586621680177260 :: k2) (arg_69895866216801755346989586621680177253 :: Data.Semigroup.Arg a6989586621680175463 b6989586621680175464) (arg_69895866216801755366989586621680177254 :: Data.Semigroup.Arg a6989586621680175463 b6989586621680175464). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Semigroup.Singletons.LamCases_6989586621680177264Sym0 a6989586621680175463 b6989586621680175464 a6989586621680177257 wild_69895866216801755386989586621680177258 b6989586621680177259 wild_69895866216801755406989586621680177260 arg_69895866216801755346989586621680177253 arg_69895866216801755366989586621680177254)
instance forall k1 k a6989586621680175463 b6989586621680175464 (arg_69895866216801755466989586621680177283 :: Data.Semigroup.Arg a6989586621680175463 b6989586621680175464) (arg_69895866216801755486989586621680177284 :: Data.Semigroup.Arg a6989586621680175463 b6989586621680175464). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Semigroup.Singletons.LamCases_6989586621680177285Sym0 a6989586621680175463 b6989586621680175464 arg_69895866216801755466989586621680177283 arg_69895866216801755486989586621680177284)
instance forall k1 k a6989586621680175463 b6989586621680175464 (arg_69895866216801755466989586621680177283 :: Data.Semigroup.Arg a6989586621680175463 b6989586621680175464) (arg_69895866216801755486989586621680177284 :: Data.Semigroup.Arg a6989586621680175463 b6989586621680175464) (a_69895866216801772996989586621680177300 :: Data.Semigroup.Arg k1 k). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Semigroup.Singletons.LamCases_6989586621680177285Sym1 a6989586621680175463 b6989586621680175464 arg_69895866216801755466989586621680177283 arg_69895866216801755486989586621680177284 a_69895866216801772996989586621680177300)
instance forall k1 k2 a6989586621680175463 b6989586621680175464 (a6989586621680177287 :: k1) (wild_69895866216801755506989586621680177288 :: k2) (b6989586621680177289 :: k1) (wild_69895866216801755526989586621680177290 :: k2) (arg_69895866216801755466989586621680177283 :: Data.Semigroup.Arg a6989586621680175463 b6989586621680175464) (arg_69895866216801755486989586621680177284 :: Data.Semigroup.Arg a6989586621680175463 b6989586621680175464). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Semigroup.Singletons.LamCases_6989586621680177294Sym0 a6989586621680175463 b6989586621680175464 a6989586621680177287 wild_69895866216801755506989586621680177288 b6989586621680177289 wild_69895866216801755526989586621680177290 arg_69895866216801755466989586621680177283 arg_69895866216801755486989586621680177284)
instance forall k1 a7566047373983478036 m7566047373983478037 k2 k3 k4 k5 (a6989586621680175477 :: k1) (_f_69895866216801757766989586621680177331 :: a7566047373983478036 Data.Singletons.~> m7566047373983478037) (a_69895866216801757806989586621680177332 :: k2) (a_69895866216801757826989586621680177333 :: k3). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Semigroup.Singletons.LamCases_6989586621680177334Sym0 a6989586621680175477 _f_69895866216801757766989586621680177331 a_69895866216801757806989586621680177332 a_69895866216801757826989586621680177333)
instance forall k1 a7566047373983478040 b7566047373983478041 k2 k3 k4 k5 (a6989586621680175477 :: k1) (_f_69895866216801757766989586621680177351 :: a7566047373983478040 Data.Singletons.~> (b7566047373983478041 Data.Singletons.~> b7566047373983478041)) (_z_69895866216801757786989586621680177352 :: b7566047373983478041) (a_69895866216801757866989586621680177353 :: k2) (a_69895866216801757886989586621680177354 :: k3). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Semigroup.Singletons.LamCases_6989586621680177355Sym0 a6989586621680175477 _f_69895866216801757766989586621680177351 _z_69895866216801757786989586621680177352 a_69895866216801757866989586621680177353 a_69895866216801757886989586621680177354)
instance forall k1 a7566047373983478040 b7566047373983478041 k2 k3 k4 k5 (a6989586621680175477 :: k1) (_f_69895866216801757766989586621680177351 :: a7566047373983478040 Data.Singletons.~> (b7566047373983478041 Data.Singletons.~> b7566047373983478041)) (_z_69895866216801757786989586621680177352 :: b7566047373983478041) (a_69895866216801757866989586621680177353 :: k2) (a_69895866216801757886989586621680177354 :: k3) (a_69895866216801773586989586621680177359 :: k4). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Semigroup.Singletons.LamCases_6989586621680177355Sym1 a6989586621680175477 _f_69895866216801757766989586621680177351 _z_69895866216801757786989586621680177352 a_69895866216801757866989586621680177353 a_69895866216801757886989586621680177354 a_69895866216801773586989586621680177359)
instance forall a7566047373982778554 k1 k2 (_z_69895866216801758016989586621680177504 :: a7566047373982778554) (a_69895866216801758056989586621680177505 :: k1). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Semigroup.Singletons.LamCases_6989586621680177506Sym0 _z_69895866216801758016989586621680177504 a_69895866216801758056989586621680177505)
instance forall a7566047373982778554 k1 k2 (_z_69895866216801758246989586621680177713 :: a7566047373982778554) (a_69895866216801758286989586621680177714 :: k1). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Semigroup.Singletons.LamCases_6989586621680177715Sym0 _z_69895866216801758246989586621680177713 a_69895866216801758286989586621680177714)
-- | Defines functions and datatypes relating to the singleton for '[]',
-- including singled versions of a few of the definitions in
-- Data.List.
--
-- Because many of these definitions are produced by Template Haskell, it
-- is not possible to create proper Haddock documentation. Please look up
-- the corresponding operation in Data.List. Also, please excuse
-- the apparent repeated variable names. This is due to an interaction
-- between Template Haskell and Haddock.
module Data.List.Singletons
type family Sing :: k -> Type
data SList (a1 :: [a])
[SNil] :: forall a. SList ('[] :: [a])
[SCons] :: forall a (n1 :: a) (n2 :: [a]). Sing n1 -> Sing n2 -> SList (n1 ': n2)
infixr 5 `SCons`
type family (a1 :: [a]) ++ (a2 :: [a]) :: [a]
infixr 5 ++
(%++) :: forall a (t1 :: [a]) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (t1 ++ t2)
infixr 5 %++
type family Head (a1 :: [a]) :: a
sHead :: forall a (t :: [a]). Sing t -> Sing (Head t)
type family Last (a1 :: [a]) :: a
sLast :: forall a (t :: [a]). Sing t -> Sing (Last t)
type family Tail (a1 :: [a]) :: [a]
sTail :: forall a (t :: [a]). Sing t -> Sing (Tail t)
type family Init (a1 :: [a]) :: [a]
sInit :: forall a (t :: [a]). Sing t -> Sing (Init t)
type family Null (arg :: t a) :: Bool
sNull :: forall a (t1 :: t a). SFoldable t => Sing t1 -> Sing (Null t1)
type family Length (arg :: t a) :: Natural
sLength :: forall a (t1 :: t a). SFoldable t => Sing t1 -> Sing (Length t1)
type family Map (a1 :: a ~> b) (a2 :: [a]) :: [b]
sMap :: forall a b (t1 :: a ~> b) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Map t1 t2)
type family Reverse (a1 :: [a]) :: [a]
sReverse :: forall a (t :: [a]). Sing t -> Sing (Reverse t)
type family Intersperse (a1 :: a) (a2 :: [a]) :: [a]
sIntersperse :: forall a (t1 :: a) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Intersperse t1 t2)
type family Intercalate (a1 :: [a]) (a2 :: [[a]]) :: [a]
sIntercalate :: forall a (t1 :: [a]) (t2 :: [[a]]). Sing t1 -> Sing t2 -> Sing (Intercalate t1 t2)
type family Transpose (a1 :: [[a]]) :: [[a]]
sTranspose :: forall a (t :: [[a]]). Sing t -> Sing (Transpose t)
type family Subsequences (a1 :: [a]) :: [[a]]
sSubsequences :: forall a (t :: [a]). Sing t -> Sing (Subsequences t)
type family Permutations (a1 :: [a]) :: [[a]]
sPermutations :: forall a (t :: [a]). Sing t -> Sing (Permutations t)
type family Foldl (arg :: b ~> a ~> b) (arg1 :: b) (arg2 :: t a) :: b
sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldl t1 t2 t3)
type family Foldl' (arg :: b ~> a ~> b) (arg1 :: b) (arg2 :: t a) :: b
sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldl' t1 t2 t3)
type family Foldl1 (arg :: a ~> a ~> a) (arg1 :: t a) :: a
sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing (Foldl1 t1 t2)
type family Foldl1' (a1 :: a ~> a ~> a) (a2 :: [a]) :: a
sFoldl1' :: forall a (t1 :: a ~> (a ~> a)) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Foldl1' t1 t2)
type family Foldr (arg :: a ~> b ~> b) (arg1 :: b) (arg2 :: t a) :: b
sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldr t1 t2 t3)
type family Foldr1 (arg :: a ~> a ~> a) (arg1 :: t a) :: a
sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing (Foldr1 t1 t2)
type family Concat (a1 :: t [a]) :: [a]
sConcat :: forall (t1 :: Type -> Type) a (t2 :: t1 [a]). SFoldable t1 => Sing t2 -> Sing (Concat t2)
type family ConcatMap (a1 :: a ~> [b]) (a2 :: t a) :: [b]
sConcatMap :: forall a b (t1 :: Type -> Type) (t2 :: a ~> [b]) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (ConcatMap t2 t3)
type family And (a :: t Bool) :: Bool
sAnd :: forall (t1 :: Type -> Type) (t2 :: t1 Bool). SFoldable t1 => Sing t2 -> Sing (And t2)
type family Or (a :: t Bool) :: Bool
sOr :: forall (t1 :: Type -> Type) (t2 :: t1 Bool). SFoldable t1 => Sing t2 -> Sing (Or t2)
type family Any (a1 :: a ~> Bool) (a2 :: t a) :: Bool
sAny :: forall a (t1 :: Type -> Type) (t2 :: a ~> Bool) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (Any t2 t3)
type family All (a1 :: a ~> Bool) (a2 :: t a) :: Bool
sAll :: forall a (t1 :: Type -> Type) (t2 :: a ~> Bool) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (All t2 t3)
type family Sum (arg :: t a) :: a
sSum :: forall a (t1 :: t a). (SFoldable t, SNum a) => Sing t1 -> Sing (Sum t1)
type family Product (arg :: t a) :: a
sProduct :: forall a (t1 :: t a). (SFoldable t, SNum a) => Sing t1 -> Sing (Product t1)
type family Maximum (arg :: t a) :: a
sMaximum :: forall a (t1 :: t a). (SFoldable t, SOrd a) => Sing t1 -> Sing (Maximum t1)
type family Minimum (arg :: t a) :: a
sMinimum :: forall a (t1 :: t a). (SFoldable t, SOrd a) => Sing t1 -> Sing (Minimum t1)
type family Scanl (a1 :: b ~> a ~> b) (a2 :: b) (a3 :: [a]) :: [b]
sScanl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: [a]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Scanl t1 t2 t3)
type family Scanl1 (a1 :: a ~> a ~> a) (a2 :: [a]) :: [a]
sScanl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Scanl1 t1 t2)
type family Scanr (a1 :: a ~> b ~> b) (a2 :: b) (a3 :: [a]) :: [b]
sScanr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: [a]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Scanr t1 t2 t3)
type family Scanr1 (a1 :: a ~> a ~> a) (a2 :: [a]) :: [a]
sScanr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Scanr1 t1 t2)
type family MapAccumL (a1 :: a ~> b ~> (a, c)) (a2 :: a) (a3 :: t b) :: (a, t c)
sMapAccumL :: forall (t1 :: Type -> Type) a b c (t2 :: a ~> (b ~> (a, c))) (t3 :: a) (t4 :: t1 b). STraversable t1 => Sing t2 -> Sing t3 -> Sing t4 -> Sing (MapAccumL t2 t3 t4)
type family MapAccumR (a1 :: a ~> b ~> (a, c)) (a2 :: a) (a3 :: t b) :: (a, t c)
sMapAccumR :: forall a b c (t1 :: Type -> Type) (t2 :: a ~> (b ~> (a, c))) (t3 :: a) (t4 :: t1 b). STraversable t1 => Sing t2 -> Sing t3 -> Sing t4 -> Sing (MapAccumR t2 t3 t4)
type family Replicate (a1 :: Natural) (a2 :: a) :: [a]
sReplicate :: forall a (t1 :: Natural) (t2 :: a). Sing t1 -> Sing t2 -> Sing (Replicate t1 t2)
type family Unfoldr (a1 :: b ~> Maybe (a, b)) (a2 :: b) :: [a]
sUnfoldr :: forall b a (t1 :: b ~> Maybe (a, b)) (t2 :: b). Sing t1 -> Sing t2 -> Sing (Unfoldr t1 t2)
type family Take (a1 :: Natural) (a2 :: [a]) :: [a]
sTake :: forall a (t1 :: Natural) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Take t1 t2)
type family Drop (a1 :: Natural) (a2 :: [a]) :: [a]
sDrop :: forall a (t1 :: Natural) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Drop t1 t2)
type family SplitAt (a1 :: Natural) (a2 :: [a]) :: ([a], [a])
sSplitAt :: forall a (t1 :: Natural) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (SplitAt t1 t2)
type family TakeWhile (a1 :: a ~> Bool) (a2 :: [a]) :: [a]
sTakeWhile :: forall a (t1 :: a ~> Bool) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (TakeWhile t1 t2)
type family DropWhile (a1 :: a ~> Bool) (a2 :: [a]) :: [a]
sDropWhile :: forall a (t1 :: a ~> Bool) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (DropWhile t1 t2)
type family DropWhileEnd (a1 :: a ~> Bool) (a2 :: [a]) :: [a]
sDropWhileEnd :: forall a (t1 :: a ~> Bool) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (DropWhileEnd t1 t2)
type family Span (a1 :: a ~> Bool) (a2 :: [a]) :: ([a], [a])
sSpan :: forall a (t1 :: a ~> Bool) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Span t1 t2)
type family Break (a1 :: a ~> Bool) (a2 :: [a]) :: ([a], [a])
sBreak :: forall a (t1 :: a ~> Bool) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Break t1 t2)
type family StripPrefix (a1 :: [a]) (a2 :: [a]) :: Maybe [a]
type family Group (a1 :: [a]) :: [[a]]
sGroup :: forall a (t :: [a]). SEq a => Sing t -> Sing (Group t)
type family Inits (a1 :: [a]) :: [[a]]
sInits :: forall a (t :: [a]). Sing t -> Sing (Inits t)
type family Tails (a1 :: [a]) :: [[a]]
sTails :: forall a (t :: [a]). Sing t -> Sing (Tails t)
type family IsPrefixOf (a1 :: [a]) (a2 :: [a]) :: Bool
sIsPrefixOf :: forall a (t1 :: [a]) (t2 :: [a]). SEq a => Sing t1 -> Sing t2 -> Sing (IsPrefixOf t1 t2)
type family IsSuffixOf (a1 :: [a]) (a2 :: [a]) :: Bool
sIsSuffixOf :: forall a (t1 :: [a]) (t2 :: [a]). SEq a => Sing t1 -> Sing t2 -> Sing (IsSuffixOf t1 t2)
type family IsInfixOf (a1 :: [a]) (a2 :: [a]) :: Bool
sIsInfixOf :: forall a (t1 :: [a]) (t2 :: [a]). SEq a => Sing t1 -> Sing t2 -> Sing (IsInfixOf t1 t2)
type family Elem (arg :: a) (arg1 :: t a) :: Bool
sElem :: forall a (t1 :: a) (t2 :: t a). (SFoldable t, SEq a) => Sing t1 -> Sing t2 -> Sing (Elem t1 t2)
type family NotElem (a1 :: a) (a2 :: t a) :: Bool
sNotElem :: forall a (t1 :: Type -> Type) (t2 :: a) (t3 :: t1 a). (SFoldable t1, SEq a) => Sing t2 -> Sing t3 -> Sing (NotElem t2 t3)
type family Lookup (a1 :: a) (a2 :: [(a, b)]) :: Maybe b
sLookup :: forall a b (t1 :: a) (t2 :: [(a, b)]). SEq a => Sing t1 -> Sing t2 -> Sing (Lookup t1 t2)
type family Find (a1 :: a ~> Bool) (a2 :: t a) :: Maybe a
sFind :: forall a (t1 :: Type -> Type) (t2 :: a ~> Bool) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (Find t2 t3)
type family Filter (a1 :: a ~> Bool) (a2 :: [a]) :: [a]
sFilter :: forall a (t1 :: a ~> Bool) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Filter t1 t2)
type family Partition (a1 :: a ~> Bool) (a2 :: [a]) :: ([a], [a])
sPartition :: forall a (t1 :: a ~> Bool) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Partition t1 t2)
type family (a1 :: [a]) !! (a2 :: Natural) :: a
infixl 9 !!
(%!!) :: forall a (t1 :: [a]) (t2 :: Natural). Sing t1 -> Sing t2 -> Sing (t1 !! t2)
infixl 9 %!!
type family ElemIndex (a1 :: a) (a2 :: [a]) :: Maybe Natural
sElemIndex :: forall a (t1 :: a) (t2 :: [a]). SEq a => Sing t1 -> Sing t2 -> Sing (ElemIndex t1 t2)
type family ElemIndices (a1 :: a) (a2 :: [a]) :: [Natural]
sElemIndices :: forall a (t1 :: a) (t2 :: [a]). SEq a => Sing t1 -> Sing t2 -> Sing (ElemIndices t1 t2)
type family FindIndex (a1 :: a ~> Bool) (a2 :: [a]) :: Maybe Natural
sFindIndex :: forall a (t1 :: a ~> Bool) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (FindIndex t1 t2)
type family FindIndices (a1 :: a ~> Bool) (a2 :: [a]) :: [Natural]
sFindIndices :: forall a (t1 :: a ~> Bool) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (FindIndices t1 t2)
type family Zip (a1 :: [a]) (a2 :: [b]) :: [(a, b)]
sZip :: forall a b (t1 :: [a]) (t2 :: [b]). Sing t1 -> Sing t2 -> Sing (Zip t1 t2)
type family Zip3 (a1 :: [a]) (a2 :: [b]) (a3 :: [c]) :: [(a, b, c)]
sZip3 :: forall a b c (t1 :: [a]) (t2 :: [b]) (t3 :: [c]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Zip3 t1 t2 t3)
type family Zip4 (a1 :: [a]) (a2 :: [b]) (a3 :: [c]) (a4 :: [d]) :: [(a, b, c, d)]
type family Zip5 (a1 :: [a]) (a2 :: [b]) (a3 :: [c]) (a4 :: [d]) (a5 :: [e]) :: [(a, b, c, d, e)]
type family Zip6 (a1 :: [a]) (a2 :: [b]) (a3 :: [c]) (a4 :: [d]) (a5 :: [e]) (a6 :: [f]) :: [(a, b, c, d, e, f)]
type family Zip7 (a1 :: [a]) (a2 :: [b]) (a3 :: [c]) (a4 :: [d]) (a5 :: [e]) (a6 :: [f]) (a7 :: [g]) :: [(a, b, c, d, e, f, g)]
type family ZipWith (a1 :: a ~> b ~> c) (a2 :: [a]) (a3 :: [b]) :: [c]
sZipWith :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: [a]) (t3 :: [b]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (ZipWith t1 t2 t3)
type family ZipWith3 (a1 :: a ~> b ~> c ~> d) (a2 :: [a]) (a3 :: [b]) (a4 :: [c]) :: [d]
sZipWith3 :: forall a b c d (t1 :: a ~> (b ~> (c ~> d))) (t2 :: [a]) (t3 :: [b]) (t4 :: [c]). Sing t1 -> Sing t2 -> Sing t3 -> Sing t4 -> Sing (ZipWith3 t1 t2 t3 t4)
type family ZipWith4 (a1 :: a ~> b ~> c ~> d ~> e) (a2 :: [a]) (a3 :: [b]) (a4 :: [c]) (a5 :: [d]) :: [e]
type family ZipWith5 (a1 :: a ~> b ~> c ~> d ~> e ~> f) (a2 :: [a]) (a3 :: [b]) (a4 :: [c]) (a5 :: [d]) (a6 :: [e]) :: [f]
type family ZipWith6 (a1 :: a ~> b ~> c ~> d ~> e ~> f ~> g) (a2 :: [a]) (a3 :: [b]) (a4 :: [c]) (a5 :: [d]) (a6 :: [e]) (a7 :: [f]) :: [g]
type family ZipWith7 (a1 :: a ~> b ~> c ~> d ~> e ~> f ~> g ~> h) (a2 :: [a]) (a3 :: [b]) (a4 :: [c]) (a5 :: [d]) (a6 :: [e]) (a7 :: [f]) (a8 :: [g]) :: [h]
type family Unzip (a1 :: [(a, b)]) :: ([a], [b])
sUnzip :: forall a b (t :: [(a, b)]). Sing t -> Sing (Unzip t)
type family Unzip3 (a1 :: [(a, b, c)]) :: ([a], [b], [c])
sUnzip3 :: forall a b c (t :: [(a, b, c)]). Sing t -> Sing (Unzip3 t)
type family Unzip4 (a1 :: [(a, b, c, d)]) :: ([a], [b], [c], [d])
sUnzip4 :: forall a b c d (t :: [(a, b, c, d)]). Sing t -> Sing (Unzip4 t)
type family Unzip5 (a1 :: [(a, b, c, d, e)]) :: ([a], [b], [c], [d], [e])
sUnzip5 :: forall a b c d e (t :: [(a, b, c, d, e)]). Sing t -> Sing (Unzip5 t)
type family Unzip6 (a1 :: [(a, b, c, d, e, f)]) :: ([a], [b], [c], [d], [e], [f])
sUnzip6 :: forall a b c d e f (t :: [(a, b, c, d, e, f)]). Sing t -> Sing (Unzip6 t)
type family Unzip7 (a1 :: [(a, b, c, d, e, f, g)]) :: ([a], [b], [c], [d], [e], [f], [g])
sUnzip7 :: forall a b c d e f g (t :: [(a, b, c, d, e, f, g)]). Sing t -> Sing (Unzip7 t)
type family Unlines (a :: [Symbol]) :: Symbol
sUnlines :: forall (t :: [Symbol]). Sing t -> Sing (Unlines t)
type family Unwords (a :: [Symbol]) :: Symbol
sUnwords :: forall (t :: [Symbol]). Sing t -> Sing (Unwords t)
type family Nub (a1 :: [a]) :: [a]
sNub :: forall a (t :: [a]). SEq a => Sing t -> Sing (Nub t)
type family Delete (a1 :: a) (a2 :: [a]) :: [a]
sDelete :: forall a (t1 :: a) (t2 :: [a]). SEq a => Sing t1 -> Sing t2 -> Sing (Delete t1 t2)
type family (a1 :: [a]) \\ (a2 :: [a]) :: [a]
infix 5 \\
(%\\) :: forall a (t1 :: [a]) (t2 :: [a]). SEq a => Sing t1 -> Sing t2 -> Sing (t1 \\ t2)
infix 5 %\\
type family Union (a1 :: [a]) (a2 :: [a]) :: [a]
sUnion :: forall a (t1 :: [a]) (t2 :: [a]). SEq a => Sing t1 -> Sing t2 -> Sing (Union t1 t2)
type family Intersect (a1 :: [a]) (a2 :: [a]) :: [a]
sIntersect :: forall a (t1 :: [a]) (t2 :: [a]). SEq a => Sing t1 -> Sing t2 -> Sing (Intersect t1 t2)
type family Insert (a1 :: a) (a2 :: [a]) :: [a]
sInsert :: forall a (t1 :: a) (t2 :: [a]). SOrd a => Sing t1 -> Sing t2 -> Sing (Insert t1 t2)
type family Sort (a1 :: [a]) :: [a]
sSort :: forall a (t :: [a]). SOrd a => Sing t -> Sing (Sort t)
type family NubBy (a1 :: a ~> a ~> Bool) (a2 :: [a]) :: [a]
sNubBy :: forall a (t1 :: a ~> (a ~> Bool)) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (NubBy t1 t2)
type family DeleteBy (a1 :: a ~> a ~> Bool) (a2 :: a) (a3 :: [a]) :: [a]
sDeleteBy :: forall a (t1 :: a ~> (a ~> Bool)) (t2 :: a) (t3 :: [a]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (DeleteBy t1 t2 t3)
type family DeleteFirstsBy (a1 :: a ~> a ~> Bool) (a2 :: [a]) (a3 :: [a]) :: [a]
sDeleteFirstsBy :: forall a (t1 :: a ~> (a ~> Bool)) (t2 :: [a]) (t3 :: [a]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (DeleteFirstsBy t1 t2 t3)
type family UnionBy (a1 :: a ~> a ~> Bool) (a2 :: [a]) (a3 :: [a]) :: [a]
sUnionBy :: forall a (t1 :: a ~> (a ~> Bool)) (t2 :: [a]) (t3 :: [a]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (UnionBy t1 t2 t3)
type family IntersectBy (a1 :: a ~> a ~> Bool) (a2 :: [a]) (a3 :: [a]) :: [a]
sIntersectBy :: forall a (t1 :: a ~> (a ~> Bool)) (t2 :: [a]) (t3 :: [a]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (IntersectBy t1 t2 t3)
type family GroupBy (a1 :: a ~> a ~> Bool) (a2 :: [a]) :: [[a]]
sGroupBy :: forall a (t1 :: a ~> (a ~> Bool)) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (GroupBy t1 t2)
type family SortBy (a1 :: a ~> a ~> Ordering) (a2 :: [a]) :: [a]
sSortBy :: forall a (t1 :: a ~> (a ~> Ordering)) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (SortBy t1 t2)
type family InsertBy (a1 :: a ~> a ~> Ordering) (a2 :: a) (a3 :: [a]) :: [a]
sInsertBy :: forall a (t1 :: a ~> (a ~> Ordering)) (t2 :: a) (t3 :: [a]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (InsertBy t1 t2 t3)
type family MaximumBy (a1 :: a ~> a ~> Ordering) (a2 :: t a) :: a
sMaximumBy :: forall a (t1 :: Type -> Type) (t2 :: a ~> (a ~> Ordering)) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (MaximumBy t2 t3)
type family MinimumBy (a1 :: a ~> a ~> Ordering) (a2 :: t a) :: a
sMinimumBy :: forall a (t1 :: Type -> Type) (t2 :: a ~> (a ~> Ordering)) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (MinimumBy t2 t3)
type family GenericLength (a1 :: [a]) :: i
sGenericLength :: forall a i (t :: [a]). SNum i => Sing t -> Sing (GenericLength t :: i)
type family NilSym0 :: [a]
data (a1 :: TyFun a [a] ~> [a]) :@#@$
infixr 5 :@#@$
data (a6989586621679050289 :: a) :@#@$$ (b :: TyFun [a] [a])
infixr 5 :@#@$$
type family (a6989586621679050289 :: a) :@#@$$$ (a6989586621679050290 :: [a]) :: [a]
infixr 5 :@#@$$$
type family (a6989586621679154364 :: [a]) ++@#@$$$ (a6989586621679154365 :: [a]) :: [a]
infixr 5 ++@#@$$$
data (a6989586621679154364 :: [a]) ++@#@$$ (b :: TyFun [a] [a])
infixr 5 ++@#@$$
data (a1 :: TyFun [a] [a] ~> [a]) ++@#@$
infixr 5 ++@#@$
data HeadSym0 (a1 :: TyFun [a] a)
type family HeadSym1 (a6989586621679545466 :: [a]) :: a
data LastSym0 (a1 :: TyFun [a] a)
type family LastSym1 (a6989586621679545460 :: [a]) :: a
data TailSym0 (a1 :: TyFun [a] [a])
type family TailSym1 (a6989586621679545456 :: [a]) :: [a]
data InitSym0 (a1 :: TyFun [a] [a])
type family InitSym1 (a6989586621679545444 :: [a]) :: [a]
data NullSym0 (a1 :: TyFun t a Bool)
type family NullSym1 (a6989586621679922560 :: t a) :: Bool
data LengthSym0 (a1 :: TyFun t a Natural)
type family LengthSym1 (a6989586621679922563 :: t a) :: Natural
data MapSym0 (a1 :: TyFun a ~> b [a] ~> [b])
data MapSym1 (a6989586621679154373 :: a ~> b) (b1 :: TyFun [a] [b])
type family MapSym2 (a6989586621679154373 :: a ~> b) (a6989586621679154374 :: [a]) :: [b]
data ReverseSym0 (a1 :: TyFun [a] [a])
type family ReverseSym1 (a6989586621679545429 :: [a]) :: [a]
data IntersperseSym0 (a1 :: TyFun a [a] ~> [a])
data IntersperseSym1 (a6989586621679545422 :: a) (b :: TyFun [a] [a])
type family IntersperseSym2 (a6989586621679545422 :: a) (a6989586621679545423 :: [a]) :: [a]
data IntercalateSym0 (a1 :: TyFun [a] [[a]] ~> [a])
data IntercalateSym1 (a6989586621679545415 :: [a]) (b :: TyFun [[a]] [a])
type family IntercalateSym2 (a6989586621679545415 :: [a]) (a6989586621679545416 :: [[a]]) :: [a]
data TransposeSym0 (a1 :: TyFun [[a]] [[a]])
type family TransposeSym1 (a6989586621679544278 :: [[a]]) :: [[a]]
data SubsequencesSym0 (a1 :: TyFun [a] [[a]])
type family SubsequencesSym1 (a6989586621679545410 :: [a]) :: [[a]]
data PermutationsSym0 (a1 :: TyFun [a] [[a]])
type family PermutationsSym1 (a6989586621679545330 :: [a]) :: [[a]]
data FoldlSym0 (a1 :: TyFun b ~> a ~> b b ~> t a ~> b)
data FoldlSym1 (a6989586621679922535 :: b ~> a ~> b) (b1 :: TyFun b t a ~> b)
data FoldlSym2 (a6989586621679922535 :: b ~> a ~> b) (a6989586621679922536 :: b) (c :: TyFun t a b)
type family FoldlSym3 (a6989586621679922535 :: b ~> a ~> b) (a6989586621679922536 :: b) (a6989586621679922537 :: t a) :: b
data Foldl'Sym0 (a1 :: TyFun b ~> a ~> b b ~> t a ~> b)
data Foldl'Sym1 (a6989586621679922542 :: b ~> a ~> b) (b1 :: TyFun b t a ~> b)
data Foldl'Sym2 (a6989586621679922542 :: b ~> a ~> b) (a6989586621679922543 :: b) (c :: TyFun t a b)
type family Foldl'Sym3 (a6989586621679922542 :: b ~> a ~> b) (a6989586621679922543 :: b) (a6989586621679922544 :: t a) :: b
data Foldl1Sym0 (a1 :: TyFun a ~> a ~> a t a ~> a)
data Foldl1Sym1 (a6989586621679922553 :: a ~> a ~> a) (b :: TyFun t a a)
type family Foldl1Sym2 (a6989586621679922553 :: a ~> a ~> a) (a6989586621679922554 :: t a) :: a
data Foldl1'Sym0 (a1 :: TyFun a ~> a ~> a [a] ~> a)
data Foldl1'Sym1 (a6989586621679545295 :: a ~> a ~> a) (b :: TyFun [a] a)
type family Foldl1'Sym2 (a6989586621679545295 :: a ~> a ~> a) (a6989586621679545296 :: [a]) :: a
data FoldrSym0 (a1 :: TyFun a ~> b ~> b b ~> t a ~> b)
data FoldrSym1 (a6989586621679922521 :: a ~> b ~> b) (b1 :: TyFun b t a ~> b)
data FoldrSym2 (a6989586621679922521 :: a ~> b ~> b) (a6989586621679922522 :: b) (c :: TyFun t a b)
type family FoldrSym3 (a6989586621679922521 :: a ~> b ~> b) (a6989586621679922522 :: b) (a6989586621679922523 :: t a) :: b
data Foldr1Sym0 (a1 :: TyFun a ~> a ~> a t a ~> a)
data Foldr1Sym1 (a6989586621679922548 :: a ~> a ~> a) (b :: TyFun t a a)
type family Foldr1Sym2 (a6989586621679922548 :: a ~> a ~> a) (a6989586621679922549 :: t a) :: a
data ConcatSym0 (a1 :: TyFun t [a] [a])
type family ConcatSym1 (a6989586621679922398 :: t [a]) :: [a]
data ConcatMapSym0 (a1 :: TyFun a ~> [b] t a ~> [b])
data ConcatMapSym1 (a6989586621679922383 :: a ~> [b]) (b1 :: TyFun t a [b])
type family ConcatMapSym2 (a6989586621679922383 :: a ~> [b]) (a6989586621679922384 :: t a) :: [b]
data AndSym0 (a :: TyFun t Bool Bool)
type family AndSym1 (a6989586621679922378 :: t Bool) :: Bool
data OrSym0 (a :: TyFun t Bool Bool)
type family OrSym1 (a6989586621679922372 :: t Bool) :: Bool
data AnySym0 (a1 :: TyFun a ~> Bool t a ~> Bool)
data AnySym1 (a6989586621679922364 :: a ~> Bool) (b :: TyFun t a Bool)
type family AnySym2 (a6989586621679922364 :: a ~> Bool) (a6989586621679922365 :: t a) :: Bool
data AllSym0 (a1 :: TyFun a ~> Bool t a ~> Bool)
data AllSym1 (a6989586621679922355 :: a ~> Bool) (b :: TyFun t a Bool)
type family AllSym2 (a6989586621679922355 :: a ~> Bool) (a6989586621679922356 :: t a) :: Bool
data SumSym0 (a1 :: TyFun t a a)
type family SumSym1 (a6989586621679922577 :: t a) :: a
data ProductSym0 (a1 :: TyFun t a a)
type family ProductSym1 (a6989586621679922580 :: t a) :: a
data MaximumSym0 (a1 :: TyFun t a a)
type family MaximumSym1 (a6989586621679922571 :: t a) :: a
data MinimumSym0 (a1 :: TyFun t a a)
type family MinimumSym1 (a6989586621679922574 :: t a) :: a
data ScanlSym0 (a1 :: TyFun b ~> a ~> b b ~> [a] ~> [b])
data ScanlSym1 (a6989586621679545226 :: b ~> a ~> b) (b1 :: TyFun b [a] ~> [b])
data ScanlSym2 (a6989586621679545226 :: b ~> a ~> b) (a6989586621679545227 :: b) (c :: TyFun [a] [b])
type family ScanlSym3 (a6989586621679545226 :: b ~> a ~> b) (a6989586621679545227 :: b) (a6989586621679545228 :: [a]) :: [b]
data Scanl1Sym0 (a1 :: TyFun a ~> a ~> a [a] ~> [a])
data Scanl1Sym1 (a6989586621679545217 :: a ~> a ~> a) (b :: TyFun [a] [a])
type family Scanl1Sym2 (a6989586621679545217 :: a ~> a ~> a) (a6989586621679545218 :: [a]) :: [a]
data ScanrSym0 (a1 :: TyFun a ~> b ~> b b ~> [a] ~> [b])
data ScanrSym1 (a6989586621679545199 :: a ~> b ~> b) (b1 :: TyFun b [a] ~> [b])
data ScanrSym2 (a6989586621679545199 :: a ~> b ~> b) (a6989586621679545200 :: b) (c :: TyFun [a] [b])
type family ScanrSym3 (a6989586621679545199 :: a ~> b ~> b) (a6989586621679545200 :: b) (a6989586621679545201 :: [a]) :: [b]
data Scanr1Sym0 (a1 :: TyFun a ~> a ~> a [a] ~> [a])
data Scanr1Sym1 (a6989586621679545179 :: a ~> a ~> a) (b :: TyFun [a] [a])
type family Scanr1Sym2 (a6989586621679545179 :: a ~> a ~> a) (a6989586621679545180 :: [a]) :: [a]
data MapAccumLSym0 (a1 :: TyFun a ~> b ~> (a, c) a ~> t b ~> (a, t c))
data MapAccumLSym1 (a6989586621680103082 :: a ~> b ~> (a, c)) (b1 :: TyFun a t b ~> (a, t c))
data MapAccumLSym2 (a6989586621680103082 :: a ~> b ~> (a, c)) (a6989586621680103083 :: a) (c1 :: TyFun t b (a, t c))
type family MapAccumLSym3 (a6989586621680103082 :: a ~> b ~> (a, c)) (a6989586621680103083 :: a) (a6989586621680103084 :: t b) :: (a, t c)
data MapAccumRSym0 (a1 :: TyFun a ~> b ~> (a, c) a ~> t b ~> (a, t c))
data MapAccumRSym1 (a6989586621680103072 :: a ~> b ~> (a, c)) (b1 :: TyFun a t b ~> (a, t c))
data MapAccumRSym2 (a6989586621680103072 :: a ~> b ~> (a, c)) (a6989586621680103073 :: a) (c1 :: TyFun t b (a, t c))
type family MapAccumRSym3 (a6989586621680103072 :: a ~> b ~> (a, c)) (a6989586621680103073 :: a) (a6989586621680103074 :: t b) :: (a, t c)
data ReplicateSym0 (a1 :: TyFun Natural a ~> [a])
data ReplicateSym1 (a6989586621679544286 :: Natural) (b :: TyFun a [a])
type family ReplicateSym2 (a6989586621679544286 :: Natural) (a6989586621679544287 :: a) :: [a]
data UnfoldrSym0 (a1 :: TyFun b ~> Maybe (a, b) b ~> [a])
data UnfoldrSym1 (a6989586621679545055 :: b ~> Maybe (a, b)) (b1 :: TyFun b [a])
type family UnfoldrSym2 (a6989586621679545055 :: b ~> Maybe (a, b)) (a6989586621679545056 :: b) :: [a]
data TakeSym0 (a1 :: TyFun Natural [a] ~> [a])
data TakeSym1 (a6989586621679544445 :: Natural) (b :: TyFun [a] [a])
type family TakeSym2 (a6989586621679544445 :: Natural) (a6989586621679544446 :: [a]) :: [a]
data DropSym0 (a1 :: TyFun Natural [a] ~> [a])
data DropSym1 (a6989586621679544432 :: Natural) (b :: TyFun [a] [a])
type family DropSym2 (a6989586621679544432 :: Natural) (a6989586621679544433 :: [a]) :: [a]
data SplitAtSym0 (a1 :: TyFun Natural [a] ~> ([a], [a]))
data SplitAtSym1 (a6989586621679544425 :: Natural) (b :: TyFun [a] ([a], [a]))
type family SplitAtSym2 (a6989586621679544425 :: Natural) (a6989586621679544426 :: [a]) :: ([a], [a])
data TakeWhileSym0 (a1 :: TyFun a ~> Bool [a] ~> [a])
data TakeWhileSym1 (a6989586621679544574 :: a ~> Bool) (b :: TyFun [a] [a])
type family TakeWhileSym2 (a6989586621679544574 :: a ~> Bool) (a6989586621679544575 :: [a]) :: [a]
data DropWhileSym0 (a1 :: TyFun a ~> Bool [a] ~> [a])
data DropWhileSym1 (a6989586621679544559 :: a ~> Bool) (b :: TyFun [a] [a])
type family DropWhileSym2 (a6989586621679544559 :: a ~> Bool) (a6989586621679544560 :: [a]) :: [a]
data DropWhileEndSym0 (a1 :: TyFun a ~> Bool [a] ~> [a])
data DropWhileEndSym1 (a6989586621679544538 :: a ~> Bool) (b :: TyFun [a] [a])
type family DropWhileEndSym2 (a6989586621679544538 :: a ~> Bool) (a6989586621679544539 :: [a]) :: [a]
data SpanSym0 (a1 :: TyFun a ~> Bool [a] ~> ([a], [a]))
data SpanSym1 (a6989586621679544497 :: a ~> Bool) (b :: TyFun [a] ([a], [a]))
type family SpanSym2 (a6989586621679544497 :: a ~> Bool) (a6989586621679544498 :: [a]) :: ([a], [a])
data BreakSym0 (a1 :: TyFun a ~> Bool [a] ~> ([a], [a]))
data BreakSym1 (a6989586621679544458 :: a ~> Bool) (b :: TyFun [a] ([a], [a]))
type family BreakSym2 (a6989586621679544458 :: a ~> Bool) (a6989586621679544459 :: [a]) :: ([a], [a])
data StripPrefixSym0 (a1 :: TyFun [a] [a] ~> Maybe [a])
data StripPrefixSym1 (a6989586621679656297 :: [a]) (b :: TyFun [a] Maybe [a])
type family StripPrefixSym2 (a6989586621679656297 :: [a]) (a6989586621679656298 :: [a]) :: Maybe [a]
data GroupSym0 (a1 :: TyFun [a] [[a]])
type family GroupSym1 (a6989586621679544420 :: [a]) :: [[a]]
data InitsSym0 (a1 :: TyFun [a] [[a]])
type family InitsSym1 (a6989586621679545043 :: [a]) :: [[a]]
data TailsSym0 (a1 :: TyFun [a] [[a]])
type family TailsSym1 (a6989586621679545033 :: [a]) :: [[a]]
data IsPrefixOfSym0 (a1 :: TyFun [a] [a] ~> Bool)
data IsPrefixOfSym1 (a6989586621679545025 :: [a]) (b :: TyFun [a] Bool)
type family IsPrefixOfSym2 (a6989586621679545025 :: [a]) (a6989586621679545026 :: [a]) :: Bool
data IsSuffixOfSym0 (a1 :: TyFun [a] [a] ~> Bool)
data IsSuffixOfSym1 (a6989586621679545018 :: [a]) (b :: TyFun [a] Bool)
type family IsSuffixOfSym2 (a6989586621679545018 :: [a]) (a6989586621679545019 :: [a]) :: Bool
data IsInfixOfSym0 (a1 :: TyFun [a] [a] ~> Bool)
data IsInfixOfSym1 (a6989586621679545011 :: [a]) (b :: TyFun [a] Bool)
type family IsInfixOfSym2 (a6989586621679545011 :: [a]) (a6989586621679545012 :: [a]) :: Bool
data ElemSym0 (a1 :: TyFun a t a ~> Bool)
data ElemSym1 (a6989586621679922567 :: a) (b :: TyFun t a Bool)
type family ElemSym2 (a6989586621679922567 :: a) (a6989586621679922568 :: t a) :: Bool
data NotElemSym0 (a1 :: TyFun a t a ~> Bool)
data NotElemSym1 (a6989586621679922306 :: a) (b :: TyFun t a Bool)
type family NotElemSym2 (a6989586621679922306 :: a) (a6989586621679922307 :: t a) :: Bool
data LookupSym0 (a1 :: TyFun a [(a, b)] ~> Maybe b)
data LookupSym1 (a6989586621679544349 :: a) (b1 :: TyFun [(a, b)] Maybe b)
type family LookupSym2 (a6989586621679544349 :: a) (a6989586621679544350 :: [(a, b)]) :: Maybe b
data FindSym0 (a1 :: TyFun a ~> Bool t a ~> Maybe a)
data FindSym1 (a6989586621679922286 :: a ~> Bool) (b :: TyFun t a Maybe a)
type family FindSym2 (a6989586621679922286 :: a ~> Bool) (a6989586621679922287 :: t a) :: Maybe a
data FilterSym0 (a1 :: TyFun a ~> Bool [a] ~> [a])
data FilterSym1 (a6989586621679544674 :: a ~> Bool) (b :: TyFun [a] [a])
type family FilterSym2 (a6989586621679544674 :: a ~> Bool) (a6989586621679544675 :: [a]) :: [a]
data PartitionSym0 (a1 :: TyFun a ~> Bool [a] ~> ([a], [a]))
data PartitionSym1 (a6989586621679544342 :: a ~> Bool) (b :: TyFun [a] ([a], [a]))
type family PartitionSym2 (a6989586621679544342 :: a ~> Bool) (a6989586621679544343 :: [a]) :: ([a], [a])
data (a1 :: TyFun [a] Natural ~> a) !!@#@$
infixl 9 !!@#@$
data (a6989586621679544266 :: [a]) !!@#@$$ (b :: TyFun Natural a)
infixl 9 !!@#@$$
type family (a6989586621679544266 :: [a]) !!@#@$$$ (a6989586621679544267 :: Natural) :: a
infixl 9 !!@#@$$$
data ElemIndexSym0 (a1 :: TyFun a [a] ~> Maybe Natural)
data ElemIndexSym1 (a6989586621679544658 :: a) (b :: TyFun [a] Maybe Natural)
type family ElemIndexSym2 (a6989586621679544658 :: a) (a6989586621679544659 :: [a]) :: Maybe Natural
data ElemIndicesSym0 (a1 :: TyFun a [a] ~> [Natural])
data ElemIndicesSym1 (a6989586621679544649 :: a) (b :: TyFun [a] [Natural])
type family ElemIndicesSym2 (a6989586621679544649 :: a) (a6989586621679544650 :: [a]) :: [Natural]
data FindIndexSym0 (a1 :: TyFun a ~> Bool [a] ~> Maybe Natural)
data FindIndexSym1 (a6989586621679544640 :: a ~> Bool) (b :: TyFun [a] Maybe Natural)
type family FindIndexSym2 (a6989586621679544640 :: a ~> Bool) (a6989586621679544641 :: [a]) :: Maybe Natural
data FindIndicesSym0 (a1 :: TyFun a ~> Bool [a] ~> [Natural])
data FindIndicesSym1 (a6989586621679544619 :: a ~> Bool) (b :: TyFun [a] [Natural])
type family FindIndicesSym2 (a6989586621679544619 :: a ~> Bool) (a6989586621679544620 :: [a]) :: [Natural]
data ZipSym0 (a1 :: TyFun [a] [b] ~> [(a, b)])
data ZipSym1 (a6989586621679544986 :: [a]) (b1 :: TyFun [b] [(a, b)])
type family ZipSym2 (a6989586621679544986 :: [a]) (a6989586621679544987 :: [b]) :: [(a, b)]
data Zip3Sym0 (a1 :: TyFun [a] [b] ~> [c] ~> [(a, b, c)])
data Zip3Sym1 (a6989586621679544974 :: [a]) (b1 :: TyFun [b] [c] ~> [(a, b, c)])
data Zip3Sym2 (a6989586621679544974 :: [a]) (a6989586621679544975 :: [b]) (c1 :: TyFun [c] [(a, b, c)])
type family Zip3Sym3 (a6989586621679544974 :: [a]) (a6989586621679544975 :: [b]) (a6989586621679544976 :: [c]) :: [(a, b, c)]
data Zip4Sym0 (a1 :: TyFun [a] [b] ~> [c] ~> [d] ~> [(a, b, c, d)])
data Zip4Sym1 (a6989586621679656286 :: [a]) (b1 :: TyFun [b] [c] ~> [d] ~> [(a, b, c, d)])
data Zip4Sym2 (a6989586621679656286 :: [a]) (a6989586621679656287 :: [b]) (c1 :: TyFun [c] [d] ~> [(a, b, c, d)])
data Zip4Sym3 (a6989586621679656286 :: [a]) (a6989586621679656287 :: [b]) (a6989586621679656288 :: [c]) (d1 :: TyFun [d] [(a, b, c, d)])
type family Zip4Sym4 (a6989586621679656286 :: [a]) (a6989586621679656287 :: [b]) (a6989586621679656288 :: [c]) (a6989586621679656289 :: [d]) :: [(a, b, c, d)]
data Zip5Sym0 (a1 :: TyFun [a] [b] ~> [c] ~> [d] ~> [e] ~> [(a, b, c, d, e)])
data Zip5Sym1 (a6989586621679656263 :: [a]) (b1 :: TyFun [b] [c] ~> [d] ~> [e] ~> [(a, b, c, d, e)])
data Zip5Sym2 (a6989586621679656263 :: [a]) (a6989586621679656264 :: [b]) (c1 :: TyFun [c] [d] ~> [e] ~> [(a, b, c, d, e)])
data Zip5Sym3 (a6989586621679656263 :: [a]) (a6989586621679656264 :: [b]) (a6989586621679656265 :: [c]) (d1 :: TyFun [d] [e] ~> [(a, b, c, d, e)])
data Zip5Sym4 (a6989586621679656263 :: [a]) (a6989586621679656264 :: [b]) (a6989586621679656265 :: [c]) (a6989586621679656266 :: [d]) (e1 :: TyFun [e] [(a, b, c, d, e)])
type family Zip5Sym5 (a6989586621679656263 :: [a]) (a6989586621679656264 :: [b]) (a6989586621679656265 :: [c]) (a6989586621679656266 :: [d]) (a6989586621679656267 :: [e]) :: [(a, b, c, d, e)]
data Zip6Sym0 (a1 :: TyFun [a] [b] ~> [c] ~> [d] ~> [e] ~> [f] ~> [(a, b, c, d, e, f)])
data Zip6Sym1 (a6989586621679656235 :: [a]) (b1 :: TyFun [b] [c] ~> [d] ~> [e] ~> [f] ~> [(a, b, c, d, e, f)])
data Zip6Sym2 (a6989586621679656235 :: [a]) (a6989586621679656236 :: [b]) (c1 :: TyFun [c] [d] ~> [e] ~> [f] ~> [(a, b, c, d, e, f)])
data Zip6Sym3 (a6989586621679656235 :: [a]) (a6989586621679656236 :: [b]) (a6989586621679656237 :: [c]) (d1 :: TyFun [d] [e] ~> [f] ~> [(a, b, c, d, e, f)])
data Zip6Sym4 (a6989586621679656235 :: [a]) (a6989586621679656236 :: [b]) (a6989586621679656237 :: [c]) (a6989586621679656238 :: [d]) (e1 :: TyFun [e] [f] ~> [(a, b, c, d, e, f)])
data Zip6Sym5 (a6989586621679656235 :: [a]) (a6989586621679656236 :: [b]) (a6989586621679656237 :: [c]) (a6989586621679656238 :: [d]) (a6989586621679656239 :: [e]) (f1 :: TyFun [f] [(a, b, c, d, e, f)])
type family Zip6Sym6 (a6989586621679656235 :: [a]) (a6989586621679656236 :: [b]) (a6989586621679656237 :: [c]) (a6989586621679656238 :: [d]) (a6989586621679656239 :: [e]) (a6989586621679656240 :: [f]) :: [(a, b, c, d, e, f)]
data Zip7Sym0 (a1 :: TyFun [a] [b] ~> [c] ~> [d] ~> [e] ~> [f] ~> [g] ~> [(a, b, c, d, e, f, g)])
data Zip7Sym1 (a6989586621679656202 :: [a]) (b1 :: TyFun [b] [c] ~> [d] ~> [e] ~> [f] ~> [g] ~> [(a, b, c, d, e, f, g)])
data Zip7Sym2 (a6989586621679656202 :: [a]) (a6989586621679656203 :: [b]) (c1 :: TyFun [c] [d] ~> [e] ~> [f] ~> [g] ~> [(a, b, c, d, e, f, g)])
data Zip7Sym3 (a6989586621679656202 :: [a]) (a6989586621679656203 :: [b]) (a6989586621679656204 :: [c]) (d1 :: TyFun [d] [e] ~> [f] ~> [g] ~> [(a, b, c, d, e, f, g)])
data Zip7Sym4 (a6989586621679656202 :: [a]) (a6989586621679656203 :: [b]) (a6989586621679656204 :: [c]) (a6989586621679656205 :: [d]) (e1 :: TyFun [e] [f] ~> [g] ~> [(a, b, c, d, e, f, g)])
data Zip7Sym5 (a6989586621679656202 :: [a]) (a6989586621679656203 :: [b]) (a6989586621679656204 :: [c]) (a6989586621679656205 :: [d]) (a6989586621679656206 :: [e]) (f1 :: TyFun [f] [g] ~> [(a, b, c, d, e, f, g)])
data Zip7Sym6 (a6989586621679656202 :: [a]) (a6989586621679656203 :: [b]) (a6989586621679656204 :: [c]) (a6989586621679656205 :: [d]) (a6989586621679656206 :: [e]) (a6989586621679656207 :: [f]) (g1 :: TyFun [g] [(a, b, c, d, e, f, g)])
type family Zip7Sym7 (a6989586621679656202 :: [a]) (a6989586621679656203 :: [b]) (a6989586621679656204 :: [c]) (a6989586621679656205 :: [d]) (a6989586621679656206 :: [e]) (a6989586621679656207 :: [f]) (a6989586621679656208 :: [g]) :: [(a, b, c, d, e, f, g)]
data ZipWithSym0 (a1 :: TyFun a ~> b ~> c [a] ~> [b] ~> [c])
data ZipWithSym1 (a6989586621679544962 :: a ~> b ~> c) (b1 :: TyFun [a] [b] ~> [c])
data ZipWithSym2 (a6989586621679544962 :: a ~> b ~> c) (a6989586621679544963 :: [a]) (c1 :: TyFun [b] [c])
type family ZipWithSym3 (a6989586621679544962 :: a ~> b ~> c) (a6989586621679544963 :: [a]) (a6989586621679544964 :: [b]) :: [c]
data ZipWith3Sym0 (a1 :: TyFun a ~> b ~> c ~> d [a] ~> [b] ~> [c] ~> [d])
data ZipWith3Sym1 (a6989586621679544947 :: a ~> b ~> c ~> d) (b1 :: TyFun [a] [b] ~> [c] ~> [d])
data ZipWith3Sym2 (a6989586621679544947 :: a ~> b ~> c ~> d) (a6989586621679544948 :: [a]) (c1 :: TyFun [b] [c] ~> [d])
data ZipWith3Sym3 (a6989586621679544947 :: a ~> b ~> c ~> d) (a6989586621679544948 :: [a]) (a6989586621679544949 :: [b]) (d1 :: TyFun [c] [d])
type family ZipWith3Sym4 (a6989586621679544947 :: a ~> b ~> c ~> d) (a6989586621679544948 :: [a]) (a6989586621679544949 :: [b]) (a6989586621679544950 :: [c]) :: [d]
data ZipWith4Sym0 (a1 :: TyFun a ~> b ~> c ~> d ~> e [a] ~> [b] ~> [c] ~> [d] ~> [e])
data ZipWith4Sym1 (a6989586621679656166 :: a ~> b ~> c ~> d ~> e) (b1 :: TyFun [a] [b] ~> [c] ~> [d] ~> [e])
data ZipWith4Sym2 (a6989586621679656166 :: a ~> b ~> c ~> d ~> e) (a6989586621679656167 :: [a]) (c1 :: TyFun [b] [c] ~> [d] ~> [e])
data ZipWith4Sym3 (a6989586621679656166 :: a ~> b ~> c ~> d ~> e) (a6989586621679656167 :: [a]) (a6989586621679656168 :: [b]) (d1 :: TyFun [c] [d] ~> [e])
data ZipWith4Sym4 (a6989586621679656166 :: a ~> b ~> c ~> d ~> e) (a6989586621679656167 :: [a]) (a6989586621679656168 :: [b]) (a6989586621679656169 :: [c]) (e1 :: TyFun [d] [e])
type family ZipWith4Sym5 (a6989586621679656166 :: a ~> b ~> c ~> d ~> e) (a6989586621679656167 :: [a]) (a6989586621679656168 :: [b]) (a6989586621679656169 :: [c]) (a6989586621679656170 :: [d]) :: [e]
data ZipWith5Sym0 (a1 :: TyFun a ~> b ~> c ~> d ~> e ~> f [a] ~> [b] ~> [c] ~> [d] ~> [e] ~> [f])
data ZipWith5Sym1 (a6989586621679656143 :: a ~> b ~> c ~> d ~> e ~> f) (b1 :: TyFun [a] [b] ~> [c] ~> [d] ~> [e] ~> [f])
data ZipWith5Sym2 (a6989586621679656143 :: a ~> b ~> c ~> d ~> e ~> f) (a6989586621679656144 :: [a]) (c1 :: TyFun [b] [c] ~> [d] ~> [e] ~> [f])
data ZipWith5Sym3 (a6989586621679656143 :: a ~> b ~> c ~> d ~> e ~> f) (a6989586621679656144 :: [a]) (a6989586621679656145 :: [b]) (d1 :: TyFun [c] [d] ~> [e] ~> [f])
data ZipWith5Sym4 (a6989586621679656143 :: a ~> b ~> c ~> d ~> e ~> f) (a6989586621679656144 :: [a]) (a6989586621679656145 :: [b]) (a6989586621679656146 :: [c]) (e1 :: TyFun [d] [e] ~> [f])
data ZipWith5Sym5 (a6989586621679656143 :: a ~> b ~> c ~> d ~> e ~> f) (a6989586621679656144 :: [a]) (a6989586621679656145 :: [b]) (a6989586621679656146 :: [c]) (a6989586621679656147 :: [d]) (f1 :: TyFun [e] [f])
type family ZipWith5Sym6 (a6989586621679656143 :: a ~> b ~> c ~> d ~> e ~> f) (a6989586621679656144 :: [a]) (a6989586621679656145 :: [b]) (a6989586621679656146 :: [c]) (a6989586621679656147 :: [d]) (a6989586621679656148 :: [e]) :: [f]
data ZipWith6Sym0 (a1 :: TyFun a ~> b ~> c ~> d ~> e ~> f ~> g [a] ~> [b] ~> [c] ~> [d] ~> [e] ~> [f] ~> [g])
data ZipWith6Sym1 (a6989586621679656116 :: a ~> b ~> c ~> d ~> e ~> f ~> g) (b1 :: TyFun [a] [b] ~> [c] ~> [d] ~> [e] ~> [f] ~> [g])
data ZipWith6Sym2 (a6989586621679656116 :: a ~> b ~> c ~> d ~> e ~> f ~> g) (a6989586621679656117 :: [a]) (c1 :: TyFun [b] [c] ~> [d] ~> [e] ~> [f] ~> [g])
data ZipWith6Sym3 (a6989586621679656116 :: a ~> b ~> c ~> d ~> e ~> f ~> g) (a6989586621679656117 :: [a]) (a6989586621679656118 :: [b]) (d1 :: TyFun [c] [d] ~> [e] ~> [f] ~> [g])
data ZipWith6Sym4 (a6989586621679656116 :: a ~> b ~> c ~> d ~> e ~> f ~> g) (a6989586621679656117 :: [a]) (a6989586621679656118 :: [b]) (a6989586621679656119 :: [c]) (e1 :: TyFun [d] [e] ~> [f] ~> [g])
data ZipWith6Sym5 (a6989586621679656116 :: a ~> b ~> c ~> d ~> e ~> f ~> g) (a6989586621679656117 :: [a]) (a6989586621679656118 :: [b]) (a6989586621679656119 :: [c]) (a6989586621679656120 :: [d]) (f1 :: TyFun [e] [f] ~> [g])
data ZipWith6Sym6 (a6989586621679656116 :: a ~> b ~> c ~> d ~> e ~> f ~> g) (a6989586621679656117 :: [a]) (a6989586621679656118 :: [b]) (a6989586621679656119 :: [c]) (a6989586621679656120 :: [d]) (a6989586621679656121 :: [e]) (g1 :: TyFun [f] [g])
type family ZipWith6Sym7 (a6989586621679656116 :: a ~> b ~> c ~> d ~> e ~> f ~> g) (a6989586621679656117 :: [a]) (a6989586621679656118 :: [b]) (a6989586621679656119 :: [c]) (a6989586621679656120 :: [d]) (a6989586621679656121 :: [e]) (a6989586621679656122 :: [f]) :: [g]
data ZipWith7Sym0 (a1 :: TyFun a ~> b ~> c ~> d ~> e ~> f ~> g ~> h [a] ~> [b] ~> [c] ~> [d] ~> [e] ~> [f] ~> [g] ~> [h])
data ZipWith7Sym1 (a6989586621679656085 :: a ~> b ~> c ~> d ~> e ~> f ~> g ~> h) (b1 :: TyFun [a] [b] ~> [c] ~> [d] ~> [e] ~> [f] ~> [g] ~> [h])
data ZipWith7Sym2 (a6989586621679656085 :: a ~> b ~> c ~> d ~> e ~> f ~> g ~> h) (a6989586621679656086 :: [a]) (c1 :: TyFun [b] [c] ~> [d] ~> [e] ~> [f] ~> [g] ~> [h])
data ZipWith7Sym3 (a6989586621679656085 :: a ~> b ~> c ~> d ~> e ~> f ~> g ~> h) (a6989586621679656086 :: [a]) (a6989586621679656087 :: [b]) (d1 :: TyFun [c] [d] ~> [e] ~> [f] ~> [g] ~> [h])
data ZipWith7Sym4 (a6989586621679656085 :: a ~> b ~> c ~> d ~> e ~> f ~> g ~> h) (a6989586621679656086 :: [a]) (a6989586621679656087 :: [b]) (a6989586621679656088 :: [c]) (e1 :: TyFun [d] [e] ~> [f] ~> [g] ~> [h])
data ZipWith7Sym5 (a6989586621679656085 :: a ~> b ~> c ~> d ~> e ~> f ~> g ~> h) (a6989586621679656086 :: [a]) (a6989586621679656087 :: [b]) (a6989586621679656088 :: [c]) (a6989586621679656089 :: [d]) (f1 :: TyFun [e] [f] ~> [g] ~> [h])
data ZipWith7Sym6 (a6989586621679656085 :: a ~> b ~> c ~> d ~> e ~> f ~> g ~> h) (a6989586621679656086 :: [a]) (a6989586621679656087 :: [b]) (a6989586621679656088 :: [c]) (a6989586621679656089 :: [d]) (a6989586621679656090 :: [e]) (g1 :: TyFun [f] [g] ~> [h])
data ZipWith7Sym7 (a6989586621679656085 :: a ~> b ~> c ~> d ~> e ~> f ~> g ~> h) (a6989586621679656086 :: [a]) (a6989586621679656087 :: [b]) (a6989586621679656088 :: [c]) (a6989586621679656089 :: [d]) (a6989586621679656090 :: [e]) (a6989586621679656091 :: [f]) (h1 :: TyFun [g] [h])
type family ZipWith7Sym8 (a6989586621679656085 :: a ~> b ~> c ~> d ~> e ~> f ~> g ~> h) (a6989586621679656086 :: [a]) (a6989586621679656087 :: [b]) (a6989586621679656088 :: [c]) (a6989586621679656089 :: [d]) (a6989586621679656090 :: [e]) (a6989586621679656091 :: [f]) (a6989586621679656092 :: [g]) :: [h]
data UnzipSym0 (a1 :: TyFun [(a, b)] ([a], [b]))
type family UnzipSym1 (a6989586621679544929 :: [(a, b)]) :: ([a], [b])
data Unzip3Sym0 (a1 :: TyFun [(a, b, c)] ([a], [b], [c]))
type family Unzip3Sym1 (a6989586621679544912 :: [(a, b, c)]) :: ([a], [b], [c])
data Unzip4Sym0 (a1 :: TyFun [(a, b, c, d)] ([a], [b], [c], [d]))
type family Unzip4Sym1 (a6989586621679544893 :: [(a, b, c, d)]) :: ([a], [b], [c], [d])
data Unzip5Sym0 (a1 :: TyFun [(a, b, c, d, e)] ([a], [b], [c], [d], [e]))
type family Unzip5Sym1 (a6989586621679544872 :: [(a, b, c, d, e)]) :: ([a], [b], [c], [d], [e])
data Unzip6Sym0 (a1 :: TyFun [(a, b, c, d, e, f)] ([a], [b], [c], [d], [e], [f]))
type family Unzip6Sym1 (a6989586621679544849 :: [(a, b, c, d, e, f)]) :: ([a], [b], [c], [d], [e], [f])
data Unzip7Sym0 (a1 :: TyFun [(a, b, c, d, e, f, g)] ([a], [b], [c], [d], [e], [f], [g]))
type family Unzip7Sym1 (a6989586621679544824 :: [(a, b, c, d, e, f, g)]) :: ([a], [b], [c], [d], [e], [f], [g])
data UnlinesSym0 (a :: TyFun [Symbol] Symbol)
type family UnlinesSym1 (a6989586621679544819 :: [Symbol]) :: Symbol
data UnwordsSym0 (a :: TyFun [Symbol] Symbol)
type family UnwordsSym1 (a6989586621679544809 :: [Symbol]) :: Symbol
data NubSym0 (a1 :: TyFun [a] [a])
type family NubSym1 (a6989586621679544249 :: [a]) :: [a]
data DeleteSym0 (a1 :: TyFun a [a] ~> [a])
data DeleteSym1 (a6989586621679544803 :: a) (b :: TyFun [a] [a])
type family DeleteSym2 (a6989586621679544803 :: a) (a6989586621679544804 :: [a]) :: [a]
data (a1 :: TyFun [a] [a] ~> [a]) \\@#@$
infix 5 \\@#@$
data (a6989586621679544792 :: [a]) \\@#@$$ (b :: TyFun [a] [a])
infix 5 \\@#@$$
type family (a6989586621679544792 :: [a]) \\@#@$$$ (a6989586621679544793 :: [a]) :: [a]
infix 5 \\@#@$$$
data UnionSym0 (a1 :: TyFun [a] [a] ~> [a])
data UnionSym1 (a6989586621679544203 :: [a]) (b :: TyFun [a] [a])
type family UnionSym2 (a6989586621679544203 :: [a]) (a6989586621679544204 :: [a]) :: [a]
data IntersectSym0 (a1 :: TyFun [a] [a] ~> [a])
data IntersectSym1 (a6989586621679544612 :: [a]) (b :: TyFun [a] [a])
type family IntersectSym2 (a6989586621679544612 :: [a]) (a6989586621679544613 :: [a]) :: [a]
data InsertSym0 (a1 :: TyFun a [a] ~> [a])
data InsertSym1 (a6989586621679544400 :: a) (b :: TyFun [a] [a])
type family InsertSym2 (a6989586621679544400 :: a) (a6989586621679544401 :: [a]) :: [a]
data SortSym0 (a1 :: TyFun [a] [a])
type family SortSym1 (a6989586621679544395 :: [a]) :: [a]
data NubBySym0 (a1 :: TyFun a ~> a ~> Bool [a] ~> [a])
data NubBySym1 (a6989586621679544231 :: a ~> a ~> Bool) (b :: TyFun [a] [a])
type family NubBySym2 (a6989586621679544231 :: a ~> a ~> Bool) (a6989586621679544232 :: [a]) :: [a]
data DeleteBySym0 (a1 :: TyFun a ~> a ~> Bool a ~> [a] ~> [a])
data DeleteBySym1 (a6989586621679544773 :: a ~> a ~> Bool) (b :: TyFun a [a] ~> [a])
data DeleteBySym2 (a6989586621679544773 :: a ~> a ~> Bool) (a6989586621679544774 :: a) (c :: TyFun [a] [a])
type family DeleteBySym3 (a6989586621679544773 :: a ~> a ~> Bool) (a6989586621679544774 :: a) (a6989586621679544775 :: [a]) :: [a]
data DeleteFirstsBySym0 (a1 :: TyFun a ~> a ~> Bool [a] ~> [a] ~> [a])
data DeleteFirstsBySym1 (a6989586621679544763 :: a ~> a ~> Bool) (b :: TyFun [a] [a] ~> [a])
data DeleteFirstsBySym2 (a6989586621679544763 :: a ~> a ~> Bool) (a6989586621679544764 :: [a]) (c :: TyFun [a] [a])
type family DeleteFirstsBySym3 (a6989586621679544763 :: a ~> a ~> Bool) (a6989586621679544764 :: [a]) (a6989586621679544765 :: [a]) :: [a]
data UnionBySym0 (a1 :: TyFun a ~> a ~> Bool [a] ~> [a] ~> [a])
data UnionBySym1 (a6989586621679544211 :: a ~> a ~> Bool) (b :: TyFun [a] [a] ~> [a])
data UnionBySym2 (a6989586621679544211 :: a ~> a ~> Bool) (a6989586621679544212 :: [a]) (c :: TyFun [a] [a])
type family UnionBySym3 (a6989586621679544211 :: a ~> a ~> Bool) (a6989586621679544212 :: [a]) (a6989586621679544213 :: [a]) :: [a]
data IntersectBySym0 (a1 :: TyFun a ~> a ~> Bool [a] ~> [a] ~> [a])
data IntersectBySym1 (a6989586621679544588 :: a ~> a ~> Bool) (b :: TyFun [a] [a] ~> [a])
data IntersectBySym2 (a6989586621679544588 :: a ~> a ~> Bool) (a6989586621679544589 :: [a]) (c :: TyFun [a] [a])
type family IntersectBySym3 (a6989586621679544588 :: a ~> a ~> Bool) (a6989586621679544589 :: [a]) (a6989586621679544590 :: [a]) :: [a]
data GroupBySym0 (a1 :: TyFun a ~> a ~> Bool [a] ~> [[a]])
data GroupBySym1 (a6989586621679544364 :: a ~> a ~> Bool) (b :: TyFun [a] [[a]])
type family GroupBySym2 (a6989586621679544364 :: a ~> a ~> Bool) (a6989586621679544365 :: [a]) :: [[a]]
data SortBySym0 (a1 :: TyFun a ~> a ~> Ordering [a] ~> [a])
data SortBySym1 (a6989586621679544751 :: a ~> a ~> Ordering) (b :: TyFun [a] [a])
type family SortBySym2 (a6989586621679544751 :: a ~> a ~> Ordering) (a6989586621679544752 :: [a]) :: [a]
data InsertBySym0 (a1 :: TyFun a ~> a ~> Ordering a ~> [a] ~> [a])
data InsertBySym1 (a6989586621679544731 :: a ~> a ~> Ordering) (b :: TyFun a [a] ~> [a])
data InsertBySym2 (a6989586621679544731 :: a ~> a ~> Ordering) (a6989586621679544732 :: a) (c :: TyFun [a] [a])
type family InsertBySym3 (a6989586621679544731 :: a ~> a ~> Ordering) (a6989586621679544732 :: a) (a6989586621679544733 :: [a]) :: [a]
data MaximumBySym0 (a1 :: TyFun a ~> a ~> Ordering t a ~> a)
data MaximumBySym1 (a6989586621679922335 :: a ~> a ~> Ordering) (b :: TyFun t a a)
type family MaximumBySym2 (a6989586621679922335 :: a ~> a ~> Ordering) (a6989586621679922336 :: t a) :: a
data MinimumBySym0 (a1 :: TyFun a ~> a ~> Ordering t a ~> a)
data MinimumBySym1 (a6989586621679922315 :: a ~> a ~> Ordering) (b :: TyFun t a a)
type family MinimumBySym2 (a6989586621679922315 :: a ~> a ~> Ordering) (a6989586621679922316 :: t a) :: a
data GenericLengthSym0 (a1 :: TyFun [a] i)
type family GenericLengthSym1 (a6989586621679544194 :: [a]) :: i
-- | Defines the promoted and singled versions of the MonadZip
-- type class.
module Control.Monad.Zip.Singletons
class PMonadZip (m :: Type -> Type) where {
type Mzip (arg :: m a) (arg1 :: m b) :: m (a, b);
type MzipWith (arg :: a ~> b ~> c) (arg1 :: m a) (arg2 :: m b) :: m c;
type Munzip (arg :: m (a, b)) :: (m a, m b);
type Mzip arg :: m a arg1 :: m b = Mzip_6989586621680264777 arg arg1;
type MzipWith arg :: a ~> b ~> c arg1 :: m a arg2 :: m b = MzipWith_6989586621680264793 arg arg1 arg2;
type Munzip arg :: m (a, b) = Munzip_6989586621680264806 arg;
}
class SMonad m => SMonadZip (m :: Type -> Type)
sMzip :: forall a b (t1 :: m a) (t2 :: m b). SMonadZip m => Sing t1 -> Sing t2 -> Sing (Mzip t1 t2)
($dmsMzip) :: forall a b (t1 :: m a) (t2 :: m b). (SMonadZip m, Mzip t1 t2 ~ Mzip_6989586621680264777 t1 t2) => Sing t1 -> Sing t2 -> Sing (Mzip t1 t2)
sMzipWith :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: m a) (t3 :: m b). SMonadZip m => Sing t1 -> Sing t2 -> Sing t3 -> Sing (MzipWith t1 t2 t3)
($dmsMzipWith) :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: m a) (t3 :: m b). (SMonadZip m, MzipWith t1 t2 t3 ~ MzipWith_6989586621680264793 t1 t2 t3) => Sing t1 -> Sing t2 -> Sing t3 -> Sing (MzipWith t1 t2 t3)
sMunzip :: forall a b (t :: m (a, b)). SMonadZip m => Sing t -> Sing (Munzip t)
($dmsMunzip) :: forall a b (t :: m (a, b)). (SMonadZip m, Munzip t ~ Munzip_6989586621680264806 t) => Sing t -> Sing (Munzip t)
data MzipSym0 (a1 :: TyFun m a m b ~> m (a, b))
data MzipSym1 (a6989586621680264763 :: m a) (b1 :: TyFun m b m (a, b))
type family MzipSym2 (a6989586621680264763 :: m a) (a6989586621680264764 :: m b) :: m (a, b)
data MzipWithSym0 (a1 :: TyFun a ~> b ~> c m a ~> m b ~> m c)
data MzipWithSym1 (a6989586621680264769 :: a ~> b ~> c) (b1 :: TyFun m a m b ~> m c)
data MzipWithSym2 (a6989586621680264769 :: a ~> b ~> c) (a6989586621680264770 :: m a) (c1 :: TyFun m b m c)
type family MzipWithSym3 (a6989586621680264769 :: a ~> b ~> c) (a6989586621680264770 :: m a) (a6989586621680264771 :: m b) :: m c
data MunzipSym0 (a1 :: TyFun m (a, b) (m a, m b))
type family MunzipSym1 (a6989586621680264774 :: m (a, b)) :: (m a, m b)
instance Control.Monad.Zip.Singletons.PMonadZip GHC.Internal.Data.Semigroup.Internal.Dual
instance Control.Monad.Zip.Singletons.PMonadZip GHC.Internal.Data.Monoid.First
instance Control.Monad.Zip.Singletons.PMonadZip GHC.Internal.Data.Functor.Identity.Identity
instance Control.Monad.Zip.Singletons.PMonadZip GHC.Internal.Data.Monoid.Last
instance Control.Monad.Zip.Singletons.PMonadZip []
instance Control.Monad.Zip.Singletons.PMonadZip GHC.Internal.Maybe.Maybe
instance Control.Monad.Zip.Singletons.PMonadZip GHC.Internal.Data.Semigroup.Internal.Product
instance Control.Monad.Zip.Singletons.PMonadZip GHC.Internal.Data.Proxy.Proxy
instance Control.Monad.Zip.Singletons.PMonadZip GHC.Internal.Data.Semigroup.Internal.Sum
instance Control.Monad.Zip.Singletons.SMonadZip GHC.Internal.Data.Semigroup.Internal.Dual
instance Control.Monad.Zip.Singletons.SMonadZip GHC.Internal.Data.Monoid.First
instance Control.Monad.Zip.Singletons.SMonadZip GHC.Internal.Data.Functor.Identity.Identity
instance Control.Monad.Zip.Singletons.SMonadZip GHC.Internal.Data.Monoid.Last
instance Control.Monad.Zip.Singletons.SMonadZip []
instance Control.Monad.Zip.Singletons.SMonadZip GHC.Internal.Maybe.Maybe
instance Control.Monad.Zip.Singletons.SMonadZip GHC.Internal.Data.Semigroup.Internal.Product
instance Control.Monad.Zip.Singletons.SMonadZip GHC.Internal.Data.Proxy.Proxy
instance Control.Monad.Zip.Singletons.SMonadZip GHC.Internal.Data.Semigroup.Internal.Sum
instance Control.Monad.Zip.Singletons.SMonadZip m => Data.Singletons.SingI1 Control.Monad.Zip.Singletons.MzipWithSym1
instance Control.Monad.Zip.Singletons.SMonadZip m => Data.Singletons.SingI1 Control.Monad.Zip.Singletons.MzipSym1
instance forall (m :: * -> *) a b c (d :: a Data.Singletons.~> (b Data.Singletons.~> c)). (Control.Monad.Zip.Singletons.SMonadZip m, Data.Singletons.SingI d) => Data.Singletons.SingI1 (Control.Monad.Zip.Singletons.MzipWithSym2 d)
instance Control.Monad.Zip.Singletons.SMonadZip m => Data.Singletons.SingI2 Control.Monad.Zip.Singletons.MzipWithSym2
instance Control.Monad.Zip.Singletons.SMonadZip m => Data.Singletons.SingI Control.Monad.Zip.Singletons.MunzipSym0
instance Control.Monad.Zip.Singletons.SMonadZip m => Data.Singletons.SingI Control.Monad.Zip.Singletons.MzipSym0
instance forall (m :: * -> *) a (d :: m a) b. (Control.Monad.Zip.Singletons.SMonadZip m, Data.Singletons.SingI d) => Data.Singletons.SingI (Control.Monad.Zip.Singletons.MzipSym1 d)
instance Control.Monad.Zip.Singletons.SMonadZip m => Data.Singletons.SingI Control.Monad.Zip.Singletons.MzipWithSym0
instance forall (m :: * -> *) a b c (d :: a Data.Singletons.~> (b Data.Singletons.~> c)). (Control.Monad.Zip.Singletons.SMonadZip m, Data.Singletons.SingI d) => Data.Singletons.SingI (Control.Monad.Zip.Singletons.MzipWithSym1 d)
instance forall (m :: * -> *) a b c (d1 :: a Data.Singletons.~> (b Data.Singletons.~> c)) (d2 :: m a). (Control.Monad.Zip.Singletons.SMonadZip m, Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Control.Monad.Zip.Singletons.MzipWithSym2 d1 d2)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Control.Monad.Zip.Singletons.MunzipSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Control.Monad.Zip.Singletons.MzipSym0
instance forall (m :: * -> *) a b (a6989586621680264763 :: m a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Zip.Singletons.MzipSym1 a6989586621680264763)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Control.Monad.Zip.Singletons.MzipWithSym0
instance forall a b c (m :: * -> *) (a6989586621680264769 :: a Data.Singletons.~> (b Data.Singletons.~> c)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Zip.Singletons.MzipWithSym1 a6989586621680264769)
instance forall a b c (m :: * -> *) (a6989586621680264769 :: a Data.Singletons.~> (b Data.Singletons.~> c)) (a6989586621680264770 :: m a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Zip.Singletons.MzipWithSym2 a6989586621680264769 a6989586621680264770)
-- | Defines functions and datatypes relating to the singleton for
-- NonEmpty, including singled versions of all the definitions in
-- Data.List.NonEmpty.
--
-- Because many of these definitions are produced by Template Haskell, it
-- is not possible to create proper Haddock documentation. Please look up
-- the corresponding operation in Data.List.NonEmpty. Also,
-- please excuse the apparent repeated variable names. This is due to an
-- interaction between Template Haskell and Haddock.
module Data.List.NonEmpty.Singletons
type family Sing :: k -> Type
data SNonEmpty (a1 :: NonEmpty a)
[:%|] :: forall a (n1 :: a) (n2 :: [a]). Sing n1 -> Sing n2 -> SNonEmpty (n1 ':| n2)
infixr 5 :%|
type family Map (a1 :: a ~> b) (a2 :: NonEmpty a) :: NonEmpty b
sMap :: forall a b (t1 :: a ~> b) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Map t1 t2)
type family Intersperse (a1 :: a) (a2 :: NonEmpty a) :: NonEmpty a
sIntersperse :: forall a (t1 :: a) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Intersperse t1 t2)
type family Scanl (a1 :: b ~> a ~> b) (a2 :: b) (a3 :: [a]) :: NonEmpty b
sScanl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: [a]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Scanl t1 t2 t3)
type family Scanr (a1 :: a ~> b ~> b) (a2 :: b) (a3 :: [a]) :: NonEmpty b
sScanr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: [a]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Scanr t1 t2 t3)
type family Scanl1 (a1 :: a ~> a ~> a) (a2 :: NonEmpty a) :: NonEmpty a
sScanl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Scanl1 t1 t2)
type family Scanr1 (a1 :: a ~> a ~> a) (a2 :: NonEmpty a) :: NonEmpty a
sScanr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Scanr1 t1 t2)
type family Transpose (a1 :: NonEmpty NonEmpty a) :: NonEmpty NonEmpty a
sTranspose :: forall a (t :: NonEmpty (NonEmpty a)). Sing t -> Sing (Transpose t)
type family SortBy (a1 :: a ~> a ~> Ordering) (a2 :: NonEmpty a) :: NonEmpty a
sSortBy :: forall a (t1 :: a ~> (a ~> Ordering)) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (SortBy t1 t2)
type family SortWith (a1 :: a ~> o) (a2 :: NonEmpty a) :: NonEmpty a
sSortWith :: forall a o (t1 :: a ~> o) (t2 :: NonEmpty a). SOrd o => Sing t1 -> Sing t2 -> Sing (SortWith t1 t2)
type family Length (a1 :: NonEmpty a) :: Natural
sLength :: forall a (t :: NonEmpty a). Sing t -> Sing (Length t)
type family Head (a1 :: NonEmpty a) :: a
sHead :: forall a (t :: NonEmpty a). Sing t -> Sing (Head t)
type family Tail (a1 :: NonEmpty a) :: [a]
sTail :: forall a (t :: NonEmpty a). Sing t -> Sing (Tail t)
type family Last (a1 :: NonEmpty a) :: a
sLast :: forall a (t :: NonEmpty a). Sing t -> Sing (Last t)
type family Init (a1 :: NonEmpty a) :: [a]
sInit :: forall a (t :: NonEmpty a). Sing t -> Sing (Init t)
type family (a1 :: a) <| (a2 :: NonEmpty a) :: NonEmpty a
(%<|) :: forall a (t1 :: a) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (t1 <| t2)
type family Cons (a1 :: a) (a2 :: NonEmpty a) :: NonEmpty a
sCons :: forall a (t1 :: a) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Cons t1 t2)
type family Uncons (a1 :: NonEmpty a) :: (a, Maybe NonEmpty a)
sUncons :: forall a (t :: NonEmpty a). Sing t -> Sing (Uncons t)
type family Unfoldr (a1 :: a ~> (b, Maybe a)) (a2 :: a) :: NonEmpty b
sUnfoldr :: forall a b (t1 :: a ~> (b, Maybe a)) (t2 :: a). Sing t1 -> Sing t2 -> Sing (Unfoldr t1 t2)
type family Sort (a1 :: NonEmpty a) :: NonEmpty a
sSort :: forall a (t :: NonEmpty a). SOrd a => Sing t -> Sing (Sort t)
type family Reverse (a1 :: NonEmpty a) :: NonEmpty a
sReverse :: forall a (t :: NonEmpty a). Sing t -> Sing (Reverse t)
type family Inits (a1 :: [a]) :: NonEmpty [a]
sInits :: forall a (t :: [a]). Sing t -> Sing (Inits t)
type family Tails (a1 :: [a]) :: NonEmpty [a]
sTails :: forall a (t :: [a]). Sing t -> Sing (Tails t)
type family Unfold (a1 :: a ~> (b, Maybe a)) (a2 :: a) :: NonEmpty b
sUnfold :: forall a b (t1 :: a ~> (b, Maybe a)) (t2 :: a). Sing t1 -> Sing t2 -> Sing (Unfold t1 t2)
type family Insert (a1 :: a) (a2 :: [a]) :: NonEmpty a
sInsert :: forall a (t1 :: a) (t2 :: [a]). SOrd a => Sing t1 -> Sing t2 -> Sing (Insert t1 t2)
type family Take (a1 :: Natural) (a2 :: NonEmpty a) :: [a]
sTake :: forall a (t1 :: Natural) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Take t1 t2)
type family Drop (a1 :: Natural) (a2 :: NonEmpty a) :: [a]
sDrop :: forall a (t1 :: Natural) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Drop t1 t2)
type family SplitAt (a1 :: Natural) (a2 :: NonEmpty a) :: ([a], [a])
sSplitAt :: forall a (t1 :: Natural) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (SplitAt t1 t2)
type family TakeWhile (a1 :: a ~> Bool) (a2 :: NonEmpty a) :: [a]
sTakeWhile :: forall a (t1 :: a ~> Bool) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (TakeWhile t1 t2)
type family DropWhile (a1 :: a ~> Bool) (a2 :: NonEmpty a) :: [a]
sDropWhile :: forall a (t1 :: a ~> Bool) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (DropWhile t1 t2)
type family Span (a1 :: a ~> Bool) (a2 :: NonEmpty a) :: ([a], [a])
sSpan :: forall a (t1 :: a ~> Bool) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Span t1 t2)
type family Break (a1 :: a ~> Bool) (a2 :: NonEmpty a) :: ([a], [a])
sBreak :: forall a (t1 :: a ~> Bool) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Break t1 t2)
type family Filter (a1 :: a ~> Bool) (a2 :: NonEmpty a) :: [a]
sFilter :: forall a (t1 :: a ~> Bool) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Filter t1 t2)
type family Partition (a1 :: a ~> Bool) (a2 :: NonEmpty a) :: ([a], [a])
sPartition :: forall a (t1 :: a ~> Bool) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Partition t1 t2)
type family Group (a1 :: [a]) :: [NonEmpty a]
sGroup :: forall a (t :: [a]). SEq a => Sing t -> Sing (Group t)
type family GroupBy (a1 :: a ~> a ~> Bool) (a2 :: [a]) :: [NonEmpty a]
sGroupBy :: forall a (t1 :: a ~> (a ~> Bool)) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (GroupBy t1 t2)
type family GroupWith (a1 :: a ~> b) (a2 :: [a]) :: [NonEmpty a]
sGroupWith :: forall a b (t1 :: a ~> b) (t2 :: [a]). SEq b => Sing t1 -> Sing t2 -> Sing (GroupWith t1 t2)
type family GroupAllWith (a1 :: a ~> b) (a2 :: [a]) :: [NonEmpty a]
sGroupAllWith :: forall a b (t1 :: a ~> b) (t2 :: [a]). SOrd b => Sing t1 -> Sing t2 -> Sing (GroupAllWith t1 t2)
type family Group1 (a1 :: NonEmpty a) :: NonEmpty NonEmpty a
sGroup1 :: forall a (t :: NonEmpty a). SEq a => Sing t -> Sing (Group1 t)
type family GroupBy1 (a1 :: a ~> a ~> Bool) (a2 :: NonEmpty a) :: NonEmpty NonEmpty a
sGroupBy1 :: forall a (t1 :: a ~> (a ~> Bool)) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (GroupBy1 t1 t2)
type family GroupWith1 (a1 :: a ~> b) (a2 :: NonEmpty a) :: NonEmpty NonEmpty a
sGroupWith1 :: forall a b (t1 :: a ~> b) (t2 :: NonEmpty a). SEq b => Sing t1 -> Sing t2 -> Sing (GroupWith1 t1 t2)
type family GroupAllWith1 (a1 :: a ~> b) (a2 :: NonEmpty a) :: NonEmpty NonEmpty a
sGroupAllWith1 :: forall a b (t1 :: a ~> b) (t2 :: NonEmpty a). SOrd b => Sing t1 -> Sing t2 -> Sing (GroupAllWith1 t1 t2)
type family IsPrefixOf (a1 :: [a]) (a2 :: NonEmpty a) :: Bool
sIsPrefixOf :: forall a (t1 :: [a]) (t2 :: NonEmpty a). SEq a => Sing t1 -> Sing t2 -> Sing (IsPrefixOf t1 t2)
type family Nub (a1 :: NonEmpty a) :: NonEmpty a
sNub :: forall a (t :: NonEmpty a). SEq a => Sing t -> Sing (Nub t)
type family NubBy (a1 :: a ~> a ~> Bool) (a2 :: NonEmpty a) :: NonEmpty a
sNubBy :: forall a (t1 :: a ~> (a ~> Bool)) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (NubBy t1 t2)
type family (a1 :: NonEmpty a) !! (a2 :: Natural) :: a
(%!!) :: forall a (t1 :: NonEmpty a) (t2 :: Natural). Sing t1 -> Sing t2 -> Sing (t1 !! t2)
type family Zip (a1 :: NonEmpty a) (a2 :: NonEmpty b) :: NonEmpty (a, b)
sZip :: forall a b (t1 :: NonEmpty a) (t2 :: NonEmpty b). Sing t1 -> Sing t2 -> Sing (Zip t1 t2)
type family ZipWith (a1 :: a ~> b ~> c) (a2 :: NonEmpty a) (a3 :: NonEmpty b) :: NonEmpty c
sZipWith :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: NonEmpty a) (t3 :: NonEmpty b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (ZipWith t1 t2 t3)
type family Unzip (a1 :: NonEmpty (a, b)) :: (NonEmpty a, NonEmpty b)
sUnzip :: forall a b (t :: NonEmpty (a, b)). Sing t -> Sing (Unzip t)
type family FromList (a1 :: [a]) :: NonEmpty a
sFromList :: forall a (t :: [a]). Sing t -> Sing (FromList t)
type family ToList (a1 :: NonEmpty a) :: [a]
sToList :: forall a (t :: NonEmpty a). Sing t -> Sing (ToList t)
type family NonEmpty_ (a1 :: [a]) :: Maybe NonEmpty a
sNonEmpty_ :: forall a (t :: [a]). Sing t -> Sing (NonEmpty_ t)
type family Xor (a :: NonEmpty Bool) :: Bool
sXor :: forall (t :: NonEmpty Bool). Sing t -> Sing (Xor t)
data (a1 :: TyFun a [a] ~> NonEmpty a) :|@#@$
infixr 5 :|@#@$
data (a6989586621679050362 :: a) :|@#@$$ (b :: TyFun [a] NonEmpty a)
infixr 5 :|@#@$$
type family (a6989586621679050362 :: a) :|@#@$$$ (a6989586621679050363 :: [a]) :: NonEmpty a
infixr 5 :|@#@$$$
data MapSym0 (a1 :: TyFun a ~> b NonEmpty a ~> NonEmpty b)
data MapSym1 (a6989586621680287251 :: a ~> b) (b1 :: TyFun NonEmpty a NonEmpty b)
type family MapSym2 (a6989586621680287251 :: a ~> b) (a6989586621680287252 :: NonEmpty a) :: NonEmpty b
data IntersperseSym0 (a1 :: TyFun a NonEmpty a ~> NonEmpty a)
data IntersperseSym1 (a6989586621680287177 :: a) (b :: TyFun NonEmpty a NonEmpty a)
type family IntersperseSym2 (a6989586621680287177 :: a) (a6989586621680287178 :: NonEmpty a) :: NonEmpty a
data ScanlSym0 (a1 :: TyFun b ~> a ~> b b ~> [a] ~> NonEmpty b)
data ScanlSym1 (a6989586621680287221 :: b ~> a ~> b) (b1 :: TyFun b [a] ~> NonEmpty b)
data ScanlSym2 (a6989586621680287221 :: b ~> a ~> b) (a6989586621680287222 :: b) (c :: TyFun [a] NonEmpty b)
type family ScanlSym3 (a6989586621680287221 :: b ~> a ~> b) (a6989586621680287222 :: b) (a6989586621680287223 :: [a]) :: NonEmpty b
data ScanrSym0 (a1 :: TyFun a ~> b ~> b b ~> [a] ~> NonEmpty b)
data ScanrSym1 (a6989586621680287209 :: a ~> b ~> b) (b1 :: TyFun b [a] ~> NonEmpty b)
data ScanrSym2 (a6989586621680287209 :: a ~> b ~> b) (a6989586621680287210 :: b) (c :: TyFun [a] NonEmpty b)
type family ScanrSym3 (a6989586621680287209 :: a ~> b ~> b) (a6989586621680287210 :: b) (a6989586621680287211 :: [a]) :: NonEmpty b
data Scanl1Sym0 (a1 :: TyFun a ~> a ~> a NonEmpty a ~> NonEmpty a)
data Scanl1Sym1 (a6989586621680287198 :: a ~> a ~> a) (b :: TyFun NonEmpty a NonEmpty a)
type family Scanl1Sym2 (a6989586621680287198 :: a ~> a ~> a) (a6989586621680287199 :: NonEmpty a) :: NonEmpty a
data Scanr1Sym0 (a1 :: TyFun a ~> a ~> a NonEmpty a ~> NonEmpty a)
data Scanr1Sym1 (a6989586621680287190 :: a ~> a ~> a) (b :: TyFun NonEmpty a NonEmpty a)
type family Scanr1Sym2 (a6989586621680287190 :: a ~> a ~> a) (a6989586621680287191 :: NonEmpty a) :: NonEmpty a
data TransposeSym0 (a1 :: TyFun NonEmpty NonEmpty a NonEmpty NonEmpty a)
type family TransposeSym1 (a6989586621680286864 :: NonEmpty NonEmpty a) :: NonEmpty NonEmpty a
data SortBySym0 (a1 :: TyFun a ~> a ~> Ordering NonEmpty a ~> NonEmpty a)
data SortBySym1 (a6989586621680286856 :: a ~> a ~> Ordering) (b :: TyFun NonEmpty a NonEmpty a)
type family SortBySym2 (a6989586621680286856 :: a ~> a ~> Ordering) (a6989586621680286857 :: NonEmpty a) :: NonEmpty a
data SortWithSym0 (a1 :: TyFun a ~> o NonEmpty a ~> NonEmpty a)
data SortWithSym1 (a6989586621680286847 :: a ~> o) (b :: TyFun NonEmpty a NonEmpty a)
type family SortWithSym2 (a6989586621680286847 :: a ~> o) (a6989586621680286848 :: NonEmpty a) :: NonEmpty a
data LengthSym0 (a1 :: TyFun NonEmpty a Natural)
type family LengthSym1 (a6989586621680287381 :: NonEmpty a) :: Natural
data HeadSym0 (a1 :: TyFun NonEmpty a a)
type family HeadSym1 (a6989586621680287316 :: NonEmpty a) :: a
data TailSym0 (a1 :: TyFun NonEmpty a [a])
type family TailSym1 (a6989586621680287312 :: NonEmpty a) :: [a]
data LastSym0 (a1 :: TyFun NonEmpty a a)
type family LastSym1 (a6989586621680287307 :: NonEmpty a) :: a
data InitSym0 (a1 :: TyFun NonEmpty a [a])
type family InitSym1 (a6989586621680287302 :: NonEmpty a) :: [a]
data (a1 :: TyFun a NonEmpty a ~> NonEmpty a) <|@#@$
data (a6989586621680287295 :: a) <|@#@$$ (b :: TyFun NonEmpty a NonEmpty a)
type family (a6989586621680287295 :: a) <|@#@$$$ (a6989586621680287296 :: NonEmpty a) :: NonEmpty a
data ConsSym0 (a1 :: TyFun a NonEmpty a ~> NonEmpty a)
data ConsSym1 (a6989586621680287288 :: a) (b :: TyFun NonEmpty a NonEmpty a)
type family ConsSym2 (a6989586621680287288 :: a) (a6989586621680287289 :: NonEmpty a) :: NonEmpty a
data UnconsSym0 (a1 :: TyFun NonEmpty a (a, Maybe NonEmpty a))
type family UnconsSym1 (a6989586621680287345 :: NonEmpty a) :: (a, Maybe NonEmpty a)
data UnfoldrSym0 (a1 :: TyFun a ~> (b, Maybe a) a ~> NonEmpty b)
data UnfoldrSym1 (a6989586621680287321 :: a ~> (b, Maybe a)) (b1 :: TyFun a NonEmpty b)
type family UnfoldrSym2 (a6989586621680287321 :: a ~> (b, Maybe a)) (a6989586621680287322 :: a) :: NonEmpty b
data SortSym0 (a1 :: TyFun NonEmpty a NonEmpty a)
type family SortSym1 (a6989586621680287279 :: NonEmpty a) :: NonEmpty a
data ReverseSym0 (a1 :: TyFun NonEmpty a NonEmpty a)
type family ReverseSym1 (a6989586621680287172 :: NonEmpty a) :: NonEmpty a
data InitsSym0 (a1 :: TyFun [a] NonEmpty [a])
type family InitsSym1 (a6989586621680287246 :: [a]) :: NonEmpty [a]
data TailsSym0 (a1 :: TyFun [a] NonEmpty [a])
type family TailsSym1 (a6989586621680287240 :: [a]) :: NonEmpty [a]
data UnfoldSym0 (a1 :: TyFun a ~> (b, Maybe a) a ~> NonEmpty b)
data UnfoldSym1 (a6989586621680287356 :: a ~> (b, Maybe a)) (b1 :: TyFun a NonEmpty b)
data InsertSym0 (a1 :: TyFun a [a] ~> NonEmpty a)
data InsertSym1 (a6989586621680287232 :: a) (b :: TyFun [a] NonEmpty a)
type family InsertSym2 (a6989586621680287232 :: a) (a6989586621680287233 :: [a]) :: NonEmpty a
data TakeSym0 (a1 :: TyFun Natural NonEmpty a ~> [a])
data TakeSym1 (a6989586621680287164 :: Natural) (b :: TyFun NonEmpty a [a])
type family TakeSym2 (a6989586621680287164 :: Natural) (a6989586621680287165 :: NonEmpty a) :: [a]
data DropSym0 (a1 :: TyFun Natural NonEmpty a ~> [a])
data DropSym1 (a6989586621680287155 :: Natural) (b :: TyFun NonEmpty a [a])
type family DropSym2 (a6989586621680287155 :: Natural) (a6989586621680287156 :: NonEmpty a) :: [a]
data SplitAtSym0 (a1 :: TyFun Natural NonEmpty a ~> ([a], [a]))
data SplitAtSym1 (a6989586621680287146 :: Natural) (b :: TyFun NonEmpty a ([a], [a]))
type family SplitAtSym2 (a6989586621680287146 :: Natural) (a6989586621680287147 :: NonEmpty a) :: ([a], [a])
data TakeWhileSym0 (a1 :: TyFun a ~> Bool NonEmpty a ~> [a])
data TakeWhileSym1 (a6989586621680287137 :: a ~> Bool) (b :: TyFun NonEmpty a [a])
type family TakeWhileSym2 (a6989586621680287137 :: a ~> Bool) (a6989586621680287138 :: NonEmpty a) :: [a]
data DropWhileSym0 (a1 :: TyFun a ~> Bool NonEmpty a ~> [a])
data DropWhileSym1 (a6989586621680287128 :: a ~> Bool) (b :: TyFun NonEmpty a [a])
type family DropWhileSym2 (a6989586621680287128 :: a ~> Bool) (a6989586621680287129 :: NonEmpty a) :: [a]
data SpanSym0 (a1 :: TyFun a ~> Bool NonEmpty a ~> ([a], [a]))
data SpanSym1 (a6989586621680287119 :: a ~> Bool) (b :: TyFun NonEmpty a ([a], [a]))
type family SpanSym2 (a6989586621680287119 :: a ~> Bool) (a6989586621680287120 :: NonEmpty a) :: ([a], [a])
data BreakSym0 (a1 :: TyFun a ~> Bool NonEmpty a ~> ([a], [a]))
data BreakSym1 (a6989586621680287110 :: a ~> Bool) (b :: TyFun NonEmpty a ([a], [a]))
type family BreakSym2 (a6989586621680287110 :: a ~> Bool) (a6989586621680287111 :: NonEmpty a) :: ([a], [a])
data FilterSym0 (a1 :: TyFun a ~> Bool NonEmpty a ~> [a])
data FilterSym1 (a6989586621680287101 :: a ~> Bool) (b :: TyFun NonEmpty a [a])
type family FilterSym2 (a6989586621680287101 :: a ~> Bool) (a6989586621680287102 :: NonEmpty a) :: [a]
data PartitionSym0 (a1 :: TyFun a ~> Bool NonEmpty a ~> ([a], [a]))
data PartitionSym1 (a6989586621680287092 :: a ~> Bool) (b :: TyFun NonEmpty a ([a], [a]))
type family PartitionSym2 (a6989586621680287092 :: a ~> Bool) (a6989586621680287093 :: NonEmpty a) :: ([a], [a])
data GroupSym0 (a1 :: TyFun [a] [NonEmpty a])
type family GroupSym1 (a6989586621680287085 :: [a]) :: [NonEmpty a]
data GroupBySym0 (a1 :: TyFun a ~> a ~> Bool [a] ~> [NonEmpty a])
data GroupBySym1 (a6989586621680287048 :: a ~> a ~> Bool) (b :: TyFun [a] [NonEmpty a])
type family GroupBySym2 (a6989586621680287048 :: a ~> a ~> Bool) (a6989586621680287049 :: [a]) :: [NonEmpty a]
data GroupWithSym0 (a1 :: TyFun a ~> b [a] ~> [NonEmpty a])
data GroupWithSym1 (a6989586621680287039 :: a ~> b) (b1 :: TyFun [a] [NonEmpty a])
type family GroupWithSym2 (a6989586621680287039 :: a ~> b) (a6989586621680287040 :: [a]) :: [NonEmpty a]
data GroupAllWithSym0 (a1 :: TyFun a ~> b [a] ~> [NonEmpty a])
data GroupAllWithSym1 (a6989586621680287030 :: a ~> b) (b1 :: TyFun [a] [NonEmpty a])
type family GroupAllWithSym2 (a6989586621680287030 :: a ~> b) (a6989586621680287031 :: [a]) :: [NonEmpty a]
data Group1Sym0 (a1 :: TyFun NonEmpty a NonEmpty NonEmpty a)
type family Group1Sym1 (a6989586621680287023 :: NonEmpty a) :: NonEmpty NonEmpty a
data GroupBy1Sym0 (a1 :: TyFun a ~> a ~> Bool NonEmpty a ~> NonEmpty NonEmpty a)
data GroupBy1Sym1 (a6989586621680286992 :: a ~> a ~> Bool) (b :: TyFun NonEmpty a NonEmpty NonEmpty a)
type family GroupBy1Sym2 (a6989586621680286992 :: a ~> a ~> Bool) (a6989586621680286993 :: NonEmpty a) :: NonEmpty NonEmpty a
data GroupWith1Sym0 (a1 :: TyFun a ~> b NonEmpty a ~> NonEmpty NonEmpty a)
data GroupWith1Sym1 (a6989586621680286985 :: a ~> b) (b1 :: TyFun NonEmpty a NonEmpty NonEmpty a)
type family GroupWith1Sym2 (a6989586621680286985 :: a ~> b) (a6989586621680286986 :: NonEmpty a) :: NonEmpty NonEmpty a
data GroupAllWith1Sym0 (a1 :: TyFun a ~> b NonEmpty a ~> NonEmpty NonEmpty a)
data GroupAllWith1Sym1 (a6989586621680286976 :: a ~> b) (b1 :: TyFun NonEmpty a NonEmpty NonEmpty a)
type family GroupAllWith1Sym2 (a6989586621680286976 :: a ~> b) (a6989586621680286977 :: NonEmpty a) :: NonEmpty NonEmpty a
data IsPrefixOfSym0 (a1 :: TyFun [a] NonEmpty a ~> Bool)
data IsPrefixOfSym1 (a6989586621680286965 :: [a]) (b :: TyFun NonEmpty a Bool)
type family IsPrefixOfSym2 (a6989586621680286965 :: [a]) (a6989586621680286966 :: NonEmpty a) :: Bool
data NubSym0 (a1 :: TyFun NonEmpty a NonEmpty a)
type family NubSym1 (a6989586621680286884 :: NonEmpty a) :: NonEmpty a
data NubBySym0 (a1 :: TyFun a ~> a ~> Bool NonEmpty a ~> NonEmpty a)
data NubBySym1 (a6989586621680286869 :: a ~> a ~> Bool) (b :: TyFun NonEmpty a NonEmpty a)
type family NubBySym2 (a6989586621680286869 :: a ~> a ~> Bool) (a6989586621680286870 :: NonEmpty a) :: NonEmpty a
data (a1 :: TyFun NonEmpty a Natural ~> a) !!@#@$
data (a6989586621680286938 :: NonEmpty a) !!@#@$$ (b :: TyFun Natural a)
type family (a6989586621680286938 :: NonEmpty a) !!@#@$$$ (a6989586621680286939 :: Natural) :: a
data ZipSym0 (a1 :: TyFun NonEmpty a NonEmpty b ~> NonEmpty (a, b))
data ZipSym1 (a6989586621680286929 :: NonEmpty a) (b1 :: TyFun NonEmpty b NonEmpty (a, b))
type family ZipSym2 (a6989586621680286929 :: NonEmpty a) (a6989586621680286930 :: NonEmpty b) :: NonEmpty (a, b)
data ZipWithSym0 (a1 :: TyFun a ~> b ~> c NonEmpty a ~> NonEmpty b ~> NonEmpty c)
data ZipWithSym1 (a6989586621680286918 :: a ~> b ~> c) (b1 :: TyFun NonEmpty a NonEmpty b ~> NonEmpty c)
data ZipWithSym2 (a6989586621680286918 :: a ~> b ~> c) (a6989586621680286919 :: NonEmpty a) (c1 :: TyFun NonEmpty b NonEmpty c)
type family ZipWithSym3 (a6989586621680286918 :: a ~> b ~> c) (a6989586621680286919 :: NonEmpty a) (a6989586621680286920 :: NonEmpty b) :: NonEmpty c
data UnzipSym0 (a1 :: TyFun NonEmpty (a, b) (NonEmpty a, NonEmpty b))
type family UnzipSym1 (a6989586621680286888 :: NonEmpty (a, b)) :: (NonEmpty a, NonEmpty b)
data FromListSym0 (a1 :: TyFun [a] NonEmpty a)
type family FromListSym1 (a6989586621680287272 :: [a]) :: NonEmpty a
data ToListSym0 (a1 :: TyFun NonEmpty a [a])
type family ToListSym1 (a6989586621680287267 :: NonEmpty a) :: [a]
data NonEmpty_Sym0 (a1 :: TyFun [a] Maybe NonEmpty a)
type family NonEmpty_Sym1 (a6989586621680287350 :: [a]) :: Maybe NonEmpty a
data XorSym0 (a :: TyFun NonEmpty Bool Bool)
type family XorSym1 (a6989586621680287370 :: NonEmpty Bool) :: Bool
instance Control.Monad.Zip.Singletons.PMonadZip GHC.Internal.Base.NonEmpty
instance Control.Monad.Zip.Singletons.SMonadZip GHC.Internal.Base.NonEmpty
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.BreakSym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.DropWhileSym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.FilterSym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.FmapSym1
instance Data.Ord.Singletons.SOrd b => Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.GroupAllWith1Sym1
instance Data.Ord.Singletons.SOrd b => Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.GroupAllWithSym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.GroupBy1Sym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.GroupBySym1
instance Data.Eq.Singletons.SEq b => Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.GroupWith1Sym1
instance Data.Eq.Singletons.SEq b => Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.GroupWithSym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.LiftSym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.MapSym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.NubBySym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.PartitionSym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.Scanl1Sym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.ScanlSym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.Scanr1Sym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.ScanrSym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.SortBySym1
instance Data.Ord.Singletons.SOrd o => Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.SortWithSym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.SpanSym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.TakeWhileSym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.UnfoldSym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.UnfoldrSym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.ZipWithSym1
instance Data.Eq.Singletons.SEq a => Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.IsPrefixOfSym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.DropSym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.SplitAtSym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.TakeSym1
instance Data.Singletons.SingI1 (Data.List.NonEmpty.Singletons.!!@#@$$)
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.ZipSym1
instance forall a b c (d :: a Data.Singletons.~> (b Data.Singletons.~> c)). Data.Singletons.SingI d => Data.Singletons.SingI1 (Data.List.NonEmpty.Singletons.ZipWithSym2 d)
instance Data.Singletons.SingI1 (Data.List.NonEmpty.Singletons.<|@#@$$)
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.ConsSym1
instance Data.Ord.Singletons.SOrd a => Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.InsertSym1
instance Data.Singletons.SingI1 Data.List.NonEmpty.Singletons.IntersperseSym1
instance forall b a (d :: b Data.Singletons.~> (a Data.Singletons.~> b)). Data.Singletons.SingI d => Data.Singletons.SingI1 (Data.List.NonEmpty.Singletons.ScanlSym2 d)
instance forall a b (d :: a Data.Singletons.~> (b Data.Singletons.~> b)). Data.Singletons.SingI d => Data.Singletons.SingI1 (Data.List.NonEmpty.Singletons.ScanrSym2 d)
instance Data.Singletons.SingI2 Data.List.NonEmpty.Singletons.ZipWithSym2
instance Data.Singletons.SingI2 Data.List.NonEmpty.Singletons.ScanlSym2
instance Data.Singletons.SingI2 Data.List.NonEmpty.Singletons.ScanrSym2
instance Data.Singletons.SingI (Data.List.NonEmpty.Singletons.!!@#@$)
instance forall a (d :: GHC.Internal.Base.NonEmpty a). Data.Singletons.SingI d => Data.Singletons.SingI ((Data.List.NonEmpty.Singletons.!!@#@$$) d)
instance Data.Singletons.SingI (Data.List.NonEmpty.Singletons.<|@#@$)
instance forall a (d :: a). Data.Singletons.SingI d => Data.Singletons.SingI ((Data.List.NonEmpty.Singletons.<|@#@$$) d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.BreakSym0
instance forall a (d :: a Data.Singletons.~> GHC.Types.Bool). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.BreakSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.ConsSym0
instance forall a (d :: a). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.ConsSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.DropSym0
instance Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.DropSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.DropWhileSym0
instance forall a (d :: a Data.Singletons.~> GHC.Types.Bool). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.DropWhileSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.FilterSym0
instance forall a (d :: a Data.Singletons.~> GHC.Types.Bool). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.FilterSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.FmapSym0
instance forall a b (d :: a Data.Singletons.~> b). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.FmapSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.FromListSym0
instance Data.Eq.Singletons.SEq a => Data.Singletons.SingI Data.List.NonEmpty.Singletons.Group1Sym0
instance Data.Ord.Singletons.SOrd b => Data.Singletons.SingI Data.List.NonEmpty.Singletons.GroupAllWith1Sym0
instance forall b a (d :: a Data.Singletons.~> b). (Data.Ord.Singletons.SOrd b, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.GroupAllWith1Sym1 d)
instance Data.Ord.Singletons.SOrd b => Data.Singletons.SingI Data.List.NonEmpty.Singletons.GroupAllWithSym0
instance forall b a (d :: a Data.Singletons.~> b). (Data.Ord.Singletons.SOrd b, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.GroupAllWithSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.GroupBy1Sym0
instance forall a (d :: a Data.Singletons.~> (a Data.Singletons.~> GHC.Types.Bool)). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.GroupBy1Sym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.GroupBySym0
instance forall a (d :: a Data.Singletons.~> (a Data.Singletons.~> GHC.Types.Bool)). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.GroupBySym1 d)
instance Data.Eq.Singletons.SEq a => Data.Singletons.SingI Data.List.NonEmpty.Singletons.GroupSym0
instance Data.Eq.Singletons.SEq b => Data.Singletons.SingI Data.List.NonEmpty.Singletons.GroupWith1Sym0
instance forall b a (d :: a Data.Singletons.~> b). (Data.Eq.Singletons.SEq b, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.GroupWith1Sym1 d)
instance Data.Eq.Singletons.SEq b => Data.Singletons.SingI Data.List.NonEmpty.Singletons.GroupWithSym0
instance forall b a (d :: a Data.Singletons.~> b). (Data.Eq.Singletons.SEq b, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.GroupWithSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.HeadSym0
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.InitSym0
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.InitsSym0
instance Data.Ord.Singletons.SOrd a => Data.Singletons.SingI Data.List.NonEmpty.Singletons.InsertSym0
instance forall a (d :: a). (Data.Ord.Singletons.SOrd a, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.InsertSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.IntersperseSym0
instance forall a (d :: a). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.IntersperseSym1 d)
instance Data.Eq.Singletons.SEq a => Data.Singletons.SingI Data.List.NonEmpty.Singletons.IsPrefixOfSym0
instance forall a (d :: [a]). (Data.Eq.Singletons.SEq a, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.IsPrefixOfSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.LastSym0
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.LengthSym0
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.LiftSym0
instance forall a b (d :: [a] Data.Singletons.~> [b]). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.LiftSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.MapSym0
instance forall a b (d :: a Data.Singletons.~> b). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.MapSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.NonEmpty_Sym0
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.NubBySym0
instance forall a (d :: a Data.Singletons.~> (a Data.Singletons.~> GHC.Types.Bool)). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.NubBySym1 d)
instance Data.Eq.Singletons.SEq a => Data.Singletons.SingI Data.List.NonEmpty.Singletons.NubSym0
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.PartitionSym0
instance forall a (d :: a Data.Singletons.~> GHC.Types.Bool). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.PartitionSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.ReverseSym0
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.Scanl1Sym0
instance forall a (d :: a Data.Singletons.~> (a Data.Singletons.~> a)). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.Scanl1Sym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.ScanlSym0
instance forall b a (d :: b Data.Singletons.~> (a Data.Singletons.~> b)). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.ScanlSym1 d)
instance forall b a (d1 :: b Data.Singletons.~> (a Data.Singletons.~> b)) (d2 :: b). (Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.ScanlSym2 d1 d2)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.Scanr1Sym0
instance forall a (d :: a Data.Singletons.~> (a Data.Singletons.~> a)). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.Scanr1Sym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.ScanrSym0
instance forall a b (d :: a Data.Singletons.~> (b Data.Singletons.~> b)). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.ScanrSym1 d)
instance forall a b (d1 :: a Data.Singletons.~> (b Data.Singletons.~> b)) (d2 :: b). (Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.ScanrSym2 d1 d2)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.SortBySym0
instance forall a (d :: a Data.Singletons.~> (a Data.Singletons.~> GHC.Types.Ordering)). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.SortBySym1 d)
instance Data.Ord.Singletons.SOrd a => Data.Singletons.SingI Data.List.NonEmpty.Singletons.SortSym0
instance Data.Ord.Singletons.SOrd o => Data.Singletons.SingI Data.List.NonEmpty.Singletons.SortWithSym0
instance forall o a (d :: a Data.Singletons.~> o). (Data.Ord.Singletons.SOrd o, Data.Singletons.SingI d) => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.SortWithSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.SpanSym0
instance forall a (d :: a Data.Singletons.~> GHC.Types.Bool). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.SpanSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.SplitAtSym0
instance Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.SplitAtSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.TailSym0
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.TailsSym0
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.TakeSym0
instance Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.TakeSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.TakeWhileSym0
instance forall a (d :: a Data.Singletons.~> GHC.Types.Bool). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.TakeWhileSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.ToListSym0
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.TransposeSym0
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.UnconsSym0
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.UnfoldSym0
instance forall a b (d :: a Data.Singletons.~> (b, GHC.Internal.Maybe.Maybe a)). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.UnfoldSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.UnfoldrSym0
instance forall a b (d :: a Data.Singletons.~> (b, GHC.Internal.Maybe.Maybe a)). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.UnfoldrSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.UnzipSym0
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.XorSym0
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.ZipSym0
instance forall a (d :: GHC.Internal.Base.NonEmpty a) b. Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.ZipSym1 d)
instance Data.Singletons.SingI Data.List.NonEmpty.Singletons.ZipWithSym0
instance forall a b c (d :: a Data.Singletons.~> (b Data.Singletons.~> c)). Data.Singletons.SingI d => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.ZipWithSym1 d)
instance forall a b c (d1 :: a Data.Singletons.~> (b Data.Singletons.~> c)) (d2 :: GHC.Internal.Base.NonEmpty a). (Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Data.List.NonEmpty.Singletons.ZipWithSym2 d1 d2)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.!!@#@$)
instance forall a (a6989586621680286938 :: GHC.Internal.Base.NonEmpty a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings ((Data.List.NonEmpty.Singletons.!!@#@$$) a6989586621680286938)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.<|@#@$)
instance forall a (a6989586621680287295 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings ((Data.List.NonEmpty.Singletons.<|@#@$$) a6989586621680287295)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.BreakSym0
instance forall a (a6989586621680287110 :: a Data.Singletons.~> GHC.Types.Bool). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.BreakSym1 a6989586621680287110)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.ConsSym0
instance forall a (a6989586621680287288 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.ConsSym1 a6989586621680287288)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.DropSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.DropSym1 a6989586621680287155)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.DropWhileSym0
instance forall a (a6989586621680287128 :: a Data.Singletons.~> GHC.Types.Bool). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.DropWhileSym1 a6989586621680287128)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.FilterSym0
instance forall a (a6989586621680287101 :: a Data.Singletons.~> GHC.Types.Bool). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.FilterSym1 a6989586621680287101)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.FmapSym0
instance forall a b (a6989586621680287386 :: a Data.Singletons.~> b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.FmapSym1 a6989586621680287386)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.FromListSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.Group1Sym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.GroupAllWith1Sym0
instance forall a b (a6989586621680286976 :: a Data.Singletons.~> b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.GroupAllWith1Sym1 a6989586621680286976)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.GroupAllWithSym0
instance forall a b (a6989586621680287030 :: a Data.Singletons.~> b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.GroupAllWithSym1 a6989586621680287030)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.GroupBy1Sym0
instance forall a (a6989586621680286992 :: a Data.Singletons.~> (a Data.Singletons.~> GHC.Types.Bool)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.GroupBy1Sym1 a6989586621680286992)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.GroupBySym0
instance forall a (a6989586621680287048 :: a Data.Singletons.~> (a Data.Singletons.~> GHC.Types.Bool)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.GroupBySym1 a6989586621680287048)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.GroupSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.GroupWith1Sym0
instance forall a b (a6989586621680286985 :: a Data.Singletons.~> b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.GroupWith1Sym1 a6989586621680286985)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.GroupWithSym0
instance forall a b (a6989586621680287039 :: a Data.Singletons.~> b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.GroupWithSym1 a6989586621680287039)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.HeadSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.InitSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.InitsSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.InsertSym0
instance forall a (a6989586621680287232 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.InsertSym1 a6989586621680287232)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.IntersperseSym0
instance forall a (a6989586621680287177 :: a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.IntersperseSym1 a6989586621680287177)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.IsPrefixOfSym0
instance forall a (a6989586621680286965 :: [a]). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.IsPrefixOfSym1 a6989586621680286965)
instance forall a6989586621680285660 k (eq6989586621680286871 :: a6989586621680285660 Data.Singletons.~> (a6989586621680285660 Data.Singletons.~> GHC.Types.Bool)) (a6989586621680286872 :: a6989586621680285660) (as6989586621680286873 :: k). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.LamCases_6989586621680286874Sym0 eq6989586621680286871 a6989586621680286872 as6989586621680286873)
instance forall k1 k2 k3 k4 k5 (a6989586621680286889 :: k1) (b6989586621680286890 :: k2) (asbs6989586621680286891 :: k3). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.LamCases_6989586621680286900Sym0 a6989586621680286889 b6989586621680286890 asbs6989586621680286891)
instance forall k1 k2 k3 k4 k5 (a6989586621680286889 :: k1) (b6989586621680286890 :: k2) (asbs6989586621680286891 :: k3). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.LamCases_6989586621680286907Sym0 a6989586621680286889 b6989586621680286890 asbs6989586621680286891)
instance forall a6989586621680285669 k (arg_69895866216802858876989586621680286940 :: GHC.Internal.Base.NonEmpty a6989586621680285669) (arg_69895866216802858896989586621680286941 :: GHC.Num.Natural.Natural). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.LamCases_6989586621680286942Sym0 arg_69895866216802858876989586621680286940 arg_69895866216802858896989586621680286941)
instance forall a6989586621680285669 k (arg_69895866216802858876989586621680286940 :: GHC.Internal.Base.NonEmpty a6989586621680285669) (arg_69895866216802858896989586621680286941 :: GHC.Num.Natural.Natural) (a_69895866216802869576989586621680286958 :: GHC.Internal.Base.NonEmpty k). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.LamCases_6989586621680286942Sym1 arg_69895866216802858876989586621680286940 arg_69895866216802858896989586621680286941 a_69895866216802869576989586621680286958)
instance forall k a6989586621680285669 (x6989586621680286944 :: k) (xs6989586621680286945 :: [k]) (n6989586621680286946 :: GHC.Num.Natural.Natural) (arg_69895866216802858876989586621680286940 :: GHC.Internal.Base.NonEmpty a6989586621680285669) (arg_69895866216802858896989586621680286941 :: GHC.Num.Natural.Natural). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.LamCases_6989586621680286947Sym0 x6989586621680286944 xs6989586621680286945 n6989586621680286946 arg_69895866216802858876989586621680286940 arg_69895866216802858896989586621680286941)
instance forall k1 k2 a6989586621680285669 (x6989586621680286944 :: k1) (xs6989586621680286945 :: [k2]) (n6989586621680286946 :: GHC.Num.Natural.Natural) (arg_69895866216802858876989586621680286940 :: GHC.Internal.Base.NonEmpty a6989586621680285669) (arg_69895866216802858896989586621680286941 :: GHC.Num.Natural.Natural). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.LamCases_6989586621680286949Sym0 x6989586621680286944 xs6989586621680286945 n6989586621680286946 arg_69895866216802858876989586621680286940 arg_69895866216802858896989586621680286941)
instance forall a6989586621680285675 k1 k2 k3 k4 (eq6989586621680286994 :: a6989586621680285675 Data.Singletons.~> (a6989586621680285675 Data.Singletons.~> GHC.Types.Bool)) (x6989586621680286995 :: k1) (xs6989586621680286996 :: k2). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.LamCases_6989586621680287005Sym0 eq6989586621680286994 x6989586621680286995 xs6989586621680286996)
instance forall a6989586621680285675 k1 k2 k3 k4 (eq6989586621680286994 :: a6989586621680285675 Data.Singletons.~> (a6989586621680285675 Data.Singletons.~> GHC.Types.Bool)) (x6989586621680286995 :: k1) (xs6989586621680286996 :: k2). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.LamCases_6989586621680287012Sym0 eq6989586621680286994 x6989586621680286995 xs6989586621680286996)
instance forall k1 k2 k3 a6989586621680285681 k4 k5 (eq6989586621680287056 :: k1) (x6989586621680287057 :: k2) (xs6989586621680287058 :: k3) (eq06989586621680287050 :: a6989586621680285681 Data.Singletons.~> (a6989586621680285681 Data.Singletons.~> GHC.Types.Bool)) (a_69895866216802870436989586621680287051 :: [a6989586621680285681]). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.LamCases_6989586621680287067Sym0 eq6989586621680287056 x6989586621680287057 xs6989586621680287058 eq06989586621680287050 a_69895866216802870436989586621680287051)
instance forall k1 k2 k3 a6989586621680285681 k4 k5 (eq6989586621680287056 :: k1) (x6989586621680287057 :: k2) (xs6989586621680287058 :: k3) (eq06989586621680287050 :: a6989586621680285681 Data.Singletons.~> (a6989586621680285681 Data.Singletons.~> GHC.Types.Bool)) (a_69895866216802870436989586621680287051 :: [a6989586621680285681]). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.LamCases_6989586621680287074Sym0 eq6989586621680287056 x6989586621680287057 xs6989586621680287058 eq06989586621680287050 a_69895866216802870436989586621680287051)
instance forall a6989586621680285693 k a (a6989586621680287179 :: a6989586621680285693) (b6989586621680287180 :: k) (bs6989586621680287181 :: [a6989586621680285693]). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.LamCases_6989586621680287182Sym0 a6989586621680287179 b6989586621680287180 bs6989586621680287181)
instance forall a6989586621680285716 b6989586621680285717 (c6989586621680287328 :: a6989586621680285716) (f6989586621680287323 :: a6989586621680285716 Data.Singletons.~> (b6989586621680285717, GHC.Internal.Maybe.Maybe a6989586621680285716)) (a6989586621680287324 :: a6989586621680285716). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.LamCases_6989586621680287329Sym0 c6989586621680287328 f6989586621680287323 a6989586621680287324)
instance forall a6989586621680285716 b6989586621680285717 (f6989586621680287323 :: a6989586621680285716 Data.Singletons.~> (b6989586621680285717, GHC.Internal.Maybe.Maybe a6989586621680285716)) (a6989586621680287324 :: a6989586621680285716). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.LamCases_6989586621680287336Sym0 f6989586621680287323 a6989586621680287324)
instance forall a6989586621680285720 b6989586621680285721 (f6989586621680287358 :: a6989586621680285720 Data.Singletons.~> (b6989586621680285721, GHC.Internal.Maybe.Maybe a6989586621680285720)) (a6989586621680287359 :: a6989586621680285720). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.LamCases_6989586621680287360Sym0 f6989586621680287358 a6989586621680287359)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.LastSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.LengthSym0
instance forall a6989586621680285681 a (eq06989586621680287050 :: a6989586621680285681 Data.Singletons.~> (a6989586621680285681 Data.Singletons.~> GHC.Types.Bool)) (a_69895866216802870436989586621680287051 :: [a6989586621680285681]). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.Let6989586621680287052GoSym0 eq06989586621680287050 a_69895866216802870436989586621680287051)
instance forall a6989586621680285681 a (eq06989586621680287050 :: a6989586621680285681 Data.Singletons.~> (a6989586621680285681 Data.Singletons.~> GHC.Types.Bool)) (a_69895866216802870436989586621680287051 :: [a6989586621680285681]) (a6989586621680287053 :: a Data.Singletons.~> (a Data.Singletons.~> GHC.Types.Bool)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.Let6989586621680287052GoSym1 eq06989586621680287050 a_69895866216802870436989586621680287051 a6989586621680287053)
instance forall a6989586621680285716 b6989586621680285717 (f6989586621680287323 :: a6989586621680285716 Data.Singletons.~> (b6989586621680285717, GHC.Internal.Maybe.Maybe a6989586621680285716)) (a6989586621680287324 :: a6989586621680285716). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.Let6989586621680287325GoSym0 f6989586621680287323 a6989586621680287324)
instance forall k1 k2 (x6989586621680287371 :: k1) (xs6989586621680287372 :: k2). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.Let6989586621680287373Xor'Sym0 x6989586621680287371 xs6989586621680287372)
instance forall k1 k2 (x6989586621680287371 :: k1) (xs6989586621680287372 :: k2) (a6989586621680287374 :: GHC.Types.Bool). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.Let6989586621680287373Xor'Sym1 x6989586621680287371 xs6989586621680287372 a6989586621680287374)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.LiftSym0
instance forall a b (a6989586621680287261 :: [a] Data.Singletons.~> [b]). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.LiftSym1 a6989586621680287261)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.MapSym0
instance forall a b (a6989586621680287251 :: a Data.Singletons.~> b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.MapSym1 a6989586621680287251)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.NonEmpty_Sym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.NubBySym0
instance forall a (a6989586621680286869 :: a Data.Singletons.~> (a Data.Singletons.~> GHC.Types.Bool)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.NubBySym1 a6989586621680286869)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.NubSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.PartitionSym0
instance forall a (a6989586621680287092 :: a Data.Singletons.~> GHC.Types.Bool). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.PartitionSym1 a6989586621680287092)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.ReverseSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.Scanl1Sym0
instance forall a (a6989586621680287198 :: a Data.Singletons.~> (a Data.Singletons.~> a)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.Scanl1Sym1 a6989586621680287198)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.ScanlSym0
instance forall b a (a6989586621680287221 :: b Data.Singletons.~> (a Data.Singletons.~> b)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.ScanlSym1 a6989586621680287221)
instance forall b a (a6989586621680287221 :: b Data.Singletons.~> (a Data.Singletons.~> b)) (a6989586621680287222 :: b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.ScanlSym2 a6989586621680287221 a6989586621680287222)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.Scanr1Sym0
instance forall a (a6989586621680287190 :: a Data.Singletons.~> (a Data.Singletons.~> a)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.Scanr1Sym1 a6989586621680287190)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.ScanrSym0
instance forall a b (a6989586621680287209 :: a Data.Singletons.~> (b Data.Singletons.~> b)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.ScanrSym1 a6989586621680287209)
instance forall a b (a6989586621680287209 :: a Data.Singletons.~> (b Data.Singletons.~> b)) (a6989586621680287210 :: b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.ScanrSym2 a6989586621680287209 a6989586621680287210)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.SortBySym0
instance forall a (a6989586621680286856 :: a Data.Singletons.~> (a Data.Singletons.~> GHC.Types.Ordering)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.SortBySym1 a6989586621680286856)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.SortSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.SortWithSym0
instance forall a o (a6989586621680286847 :: a Data.Singletons.~> o). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.SortWithSym1 a6989586621680286847)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.SpanSym0
instance forall a (a6989586621680287119 :: a Data.Singletons.~> GHC.Types.Bool). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.SpanSym1 a6989586621680287119)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.SplitAtSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.SplitAtSym1 a6989586621680287146)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.TailSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.TailsSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.TakeSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.TakeSym1 a6989586621680287164)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.TakeWhileSym0
instance forall a (a6989586621680287137 :: a Data.Singletons.~> GHC.Types.Bool). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.TakeWhileSym1 a6989586621680287137)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.ToListSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.TransposeSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.UnconsSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.UnfoldSym0
instance forall a b (a6989586621680287356 :: a Data.Singletons.~> (b, GHC.Internal.Maybe.Maybe a)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.UnfoldSym1 a6989586621680287356)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.UnfoldrSym0
instance forall a b (a6989586621680287321 :: a Data.Singletons.~> (b, GHC.Internal.Maybe.Maybe a)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.UnfoldrSym1 a6989586621680287321)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.UnzipSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.XorSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.ZipSym0
instance forall a b (a6989586621680286929 :: GHC.Internal.Base.NonEmpty a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.ZipSym1 a6989586621680286929)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.List.NonEmpty.Singletons.ZipWithSym0
instance forall a b c (a6989586621680286918 :: a Data.Singletons.~> (b Data.Singletons.~> c)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.ZipWithSym1 a6989586621680286918)
instance forall a b c (a6989586621680286918 :: a Data.Singletons.~> (b Data.Singletons.~> c)) (a6989586621680286919 :: GHC.Internal.Base.NonEmpty a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.List.NonEmpty.Singletons.ZipWithSym2 a6989586621680286918 a6989586621680286919)
-- | Exports the promoted and singled versions of the Sum data type.
module Data.Functor.Sum.Singletons
type family Sing :: k -> Type
data SSum (a1 :: Sum f g a)
[SInL] :: forall {k} (f :: k -> Type) (g :: k -> Type) (a :: k) (n :: f a). Sing n -> SSum ('InL n :: Sum f g a)
[SInR] :: forall {k} (f :: k -> Type) (g :: k -> Type) (a :: k) (n :: g a). Sing n -> SSum ('InR n :: Sum f g a)
data InLSym0 (a1 :: TyFun f a Sum f g a)
type family InLSym1 (a6989586621680331253 :: f a) :: Sum f g a
data InRSym0 (a1 :: TyFun g a Sum f g a)
type family InRSym1 (a6989586621680331255 :: g a) :: Sum f g a
instance forall k (f :: k -> *) (g :: k -> *) (a :: k) (z :: Data.Functor.Sum.Sum f g a). GHC.Classes.Eq (Data.Functor.Sum.Singletons.SSum z)
instance forall k (f :: k -> *) (g :: k -> *) (a :: k) (z :: Data.Functor.Sum.Sum f g a). GHC.Classes.Ord (Data.Functor.Sum.Singletons.SSum z)
instance forall k (f :: k -> *) (g :: k -> *) (a :: k). Data.Eq.Singletons.PEq (Data.Functor.Sum.Sum f g a)
instance Data.Foldable.Singletons.PFoldable (Data.Functor.Sum.Sum f g)
instance Control.Monad.Singletons.Internal.PFunctor (Data.Functor.Sum.Sum f g)
instance forall k (f :: k -> *) (g :: k -> *) (a :: k). Data.Ord.Singletons.POrd (Data.Functor.Sum.Sum f g a)
instance Data.Traversable.Singletons.PTraversable (Data.Functor.Sum.Sum f g)
instance forall k (f :: k -> *) (a :: k) (g :: k -> *). (Data.Singletons.Decide.SDecide (f a), Data.Singletons.Decide.SDecide (g a)) => Data.Singletons.Decide.SDecide (Data.Functor.Sum.Sum f g a)
instance forall k (f :: k -> *) (a :: k) (g :: k -> *). (Data.Eq.Singletons.SEq (f a), Data.Eq.Singletons.SEq (g a)) => Data.Eq.Singletons.SEq (Data.Functor.Sum.Sum f g a)
instance (Data.Foldable.Singletons.SFoldable f, Data.Foldable.Singletons.SFoldable g) => Data.Foldable.Singletons.SFoldable (Data.Functor.Sum.Sum f g)
instance (Control.Monad.Singletons.Internal.SFunctor f, Control.Monad.Singletons.Internal.SFunctor g) => Control.Monad.Singletons.Internal.SFunctor (Data.Functor.Sum.Sum f g)
instance forall k (f :: k -> *) (a :: k) (g :: k -> *). (Data.Ord.Singletons.SOrd (f a), Data.Ord.Singletons.SOrd (g a)) => Data.Ord.Singletons.SOrd (Data.Functor.Sum.Sum f g a)
instance (Data.Traversable.Singletons.STraversable f, Data.Traversable.Singletons.STraversable g) => Data.Traversable.Singletons.STraversable (Data.Functor.Sum.Sum f g)
instance forall k (f :: k -> *) (a :: k) (g :: k -> *). Data.Singletons.SingI1 'Data.Functor.Sum.InL
instance forall k (g :: k -> *) (a :: k) (f :: k -> *). Data.Singletons.SingI1 'Data.Functor.Sum.InR
instance forall k (f :: k -> *) (a :: k) (g :: k -> *). Data.Singletons.SingI Data.Functor.Sum.Singletons.InLSym0
instance forall k (g :: k -> *) (a :: k) (f :: k -> *). Data.Singletons.SingI Data.Functor.Sum.Singletons.InRSym0
instance forall k (g :: k -> *) (f :: k -> *) (a :: k) (n :: f a). Data.Singletons.SingI n => Data.Singletons.SingI ('Data.Functor.Sum.InL n)
instance forall k (f :: k -> *) (g :: k -> *) (a :: k) (n :: g a). Data.Singletons.SingI n => Data.Singletons.SingI ('Data.Functor.Sum.InR n)
instance forall k (f :: k -> *) (a :: k) (g :: k -> *). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Functor.Sum.Singletons.InLSym0
instance forall k (g :: k -> *) (a :: k) (f :: k -> *). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Functor.Sum.Singletons.InRSym0
instance forall k (f :: k -> *) (a :: k) (g :: k -> *). (Data.Singletons.Decide.SDecide (f a), Data.Singletons.Decide.SDecide (g a)) => GHC.Internal.Data.Type.Coercion.TestCoercion Data.Functor.Sum.Singletons.SSum
instance forall k (f :: k -> *) (a :: k) (g :: k -> *). (Data.Singletons.Decide.SDecide (f a), Data.Singletons.Decide.SDecide (g a)) => GHC.Internal.Data.Type.Equality.TestEquality Data.Functor.Sum.Singletons.SSum
-- | Defines and exports a promoted and singled version of the
-- IsString type class from Data.String.
module Data.String.Singletons
class PIsString a where {
type FromString (arg :: Symbol) :: a;
}
class SIsString a
sFromString :: forall (t :: Symbol). SIsString a => Sing t -> Sing (FromString t :: a)
data FromStringSym0 (a1 :: TyFun Symbol a)
type family FromStringSym1 (a6989586621680338575 :: Symbol) :: a
instance forall a k (b :: k). Data.String.Singletons.PIsString (GHC.Internal.Data.Functor.Const.Const a b)
instance Data.String.Singletons.PIsString (GHC.Internal.Data.Functor.Identity.Identity a)
instance Data.String.Singletons.PIsString GHC.Types.Symbol
instance forall a k (b :: k). Data.String.Singletons.SIsString a => Data.String.Singletons.SIsString (GHC.Internal.Data.Functor.Const.Const a b)
instance Data.String.Singletons.SIsString a => Data.String.Singletons.SIsString (GHC.Internal.Data.Functor.Identity.Identity a)
instance Data.String.Singletons.SIsString GHC.Types.Symbol
instance Data.String.Singletons.SIsString a => Data.Singletons.SingI Data.String.Singletons.FromStringSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.String.Singletons.FromStringSym0
-- | Provides the SomeSing data type along with instances of
-- Eq, Ord, etc., which are defined as orphans due to
-- SomeSing originally being defined in a separate library
-- (singletons).
module Data.Singletons.Base.SomeSing
data SomeSing k
[SomeSing] :: forall k (a :: k). Sing a -> SomeSing k
instance Data.Singletons.Base.Enum.SBounded k => GHC.Internal.Enum.Bounded (Data.Singletons.SomeSing k)
instance Data.Singletons.Base.Enum.SEnum k => GHC.Internal.Enum.Enum (Data.Singletons.SomeSing k)
instance Data.Eq.Singletons.SEq k => GHC.Classes.Eq (Data.Singletons.SomeSing k)
instance Data.String.Singletons.SIsString k => GHC.Internal.Data.String.IsString (Data.Singletons.SomeSing k)
instance Data.Monoid.Singletons.SMonoid k => GHC.Internal.Base.Monoid (Data.Singletons.SomeSing k)
instance GHC.Num.Singletons.SNum k => GHC.Internal.Num.Num (Data.Singletons.SomeSing k)
instance Data.Ord.Singletons.SOrd k => GHC.Classes.Ord (Data.Singletons.SomeSing k)
instance Data.Semigroup.Singletons.Internal.Classes.SSemigroup k => GHC.Internal.Base.Semigroup (Data.Singletons.SomeSing k)
instance Data.Singletons.ShowSing.ShowSing k => GHC.Internal.Show.Show (Data.Singletons.SomeSing k)
-- | Defines the promoted and singled versions of the Applicative
-- type class.
module Control.Applicative.Singletons
class PApplicative (f :: Type -> Type) where {
type Pure (arg :: a) :: f a;
type (arg :: f a ~> b) <*> (arg1 :: f a) :: f b;
type LiftA2 (arg :: a ~> b ~> c) (arg1 :: f a) (arg2 :: f b) :: f c;
type (arg :: f a) *> (arg1 :: f b) :: f b;
type (arg :: f a) <* (arg1 :: f b) :: f a;
type arg :: f a ~> b <*> arg1 :: f a = TFHelper_6989586621679271276 arg arg1;
type LiftA2 arg :: a ~> b ~> c arg1 :: f a arg2 :: f b = LiftA2_6989586621679271292 arg arg1 arg2;
type arg :: f a *> arg1 :: f b = TFHelper_6989586621679271308 arg arg1;
type arg :: f a <* arg1 :: f b = TFHelper_6989586621679271319 arg arg1;
}
infixl 4 <*>
infixl 4 *>
infixl 4 <*
class SFunctor f => SApplicative (f :: Type -> Type)
sPure :: forall a (t :: a). SApplicative f => Sing t -> Sing (Pure t :: f a)
(%<*>) :: forall a b (t1 :: f (a ~> b)) (t2 :: f a). SApplicative f => Sing t1 -> Sing t2 -> Sing (t1 <*> t2)
($dm%<*>) :: forall a b (t1 :: f (a ~> b)) (t2 :: f a). (SApplicative f, (t1 <*> t2) ~ TFHelper_6989586621679271276 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 <*> t2)
sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: f a) (t3 :: f b). SApplicative f => Sing t1 -> Sing t2 -> Sing t3 -> Sing (LiftA2 t1 t2 t3)
($dmsLiftA2) :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: f a) (t3 :: f b). (SApplicative f, LiftA2 t1 t2 t3 ~ LiftA2_6989586621679271292 t1 t2 t3) => Sing t1 -> Sing t2 -> Sing t3 -> Sing (LiftA2 t1 t2 t3)
(%*>) :: forall a b (t1 :: f a) (t2 :: f b). SApplicative f => Sing t1 -> Sing t2 -> Sing (t1 *> t2)
($dm%*>) :: forall a b (t1 :: f a) (t2 :: f b). (SApplicative f, (t1 *> t2) ~ TFHelper_6989586621679271308 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 *> t2)
(%<*) :: forall a b (t1 :: f a) (t2 :: f b). SApplicative f => Sing t1 -> Sing t2 -> Sing (t1 <* t2)
($dm%<*) :: forall a b (t1 :: f a) (t2 :: f b). (SApplicative f, (t1 <* t2) ~ TFHelper_6989586621679271319 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 <* t2)
infixl 4 %<*>
infixl 4 %*>
infixl 4 %<*
class PAlternative (f :: Type -> Type) where {
type Empty :: f a;
type (arg :: f a) <|> (arg1 :: f a) :: f a;
}
infixl 3 <|>
class SApplicative f => SAlternative (f :: Type -> Type)
sEmpty :: SAlternative f => Sing (Empty :: f a)
(%<|>) :: forall a (t1 :: f a) (t2 :: f a). SAlternative f => Sing t1 -> Sing t2 -> Sing (t1 <|> t2)
infixl 3 %<|>
type family Sing :: k -> Type
data SConst (a1 :: Const a b)
[SConst] :: forall {k} a (b :: k) (n :: a). Sing n -> SConst ('Const n :: Const a b)
-- | The Const functor.
--
-- Examples
--
--
-- >>> fmap (++ "World") (Const "Hello")
-- Const "Hello"
--
--
-- Because we ignore the second type parameter to Const, the
-- Applicative instance, which has (<*>) :: Monoid m
-- => Const m (a -> b) -> Const m a -> Const m b
-- essentially turns into Monoid m => m -> m -> m,
-- which is (<>)
--
--
-- >>> Const [1, 2, 3] <*> Const [4, 5, 6]
-- Const [1,2,3,4,5,6]
--
data Const a (b :: k)
type family GetConst (a1 :: Const a b) :: a
sGetConst :: forall {k} a (b :: k) (t :: Const a b). Sing t -> Sing (GetConst t)
type family (a1 :: a ~> b) <$> (a2 :: f a) :: f b
infixl 4 <$>
(%<$>) :: forall a b (f :: Type -> Type) (t1 :: a ~> b) (t2 :: f a). SFunctor f => Sing t1 -> Sing t2 -> Sing (t1 <$> t2)
infixl 4 %<$>
type family (arg :: a) <$ (arg1 :: f b) :: f a
infixl 4 <$
(%<$) :: forall a b (t1 :: a) (t2 :: f b). SFunctor f => Sing t1 -> Sing t2 -> Sing (t1 <$ t2)
infixl 4 %<$
type family (a1 :: f a) <**> (a2 :: f a ~> b) :: f b
infixl 4 <**>
(%<**>) :: forall (f :: Type -> Type) a b (t1 :: f a) (t2 :: f (a ~> b)). SApplicative f => Sing t1 -> Sing t2 -> Sing (t1 <**> t2)
infixl 4 %<**>
type family LiftA (a1 :: a ~> b) (a2 :: f a) :: f b
sLiftA :: forall a b (f :: Type -> Type) (t1 :: a ~> b) (t2 :: f a). SApplicative f => Sing t1 -> Sing t2 -> Sing (LiftA t1 t2)
type family LiftA3 (a1 :: a ~> b ~> c ~> d) (a2 :: f a) (a3 :: f b) (a4 :: f c) :: f d
sLiftA3 :: forall a b c d (f :: Type -> Type) (t1 :: a ~> (b ~> (c ~> d))) (t2 :: f a) (t3 :: f b) (t4 :: f c). SApplicative f => Sing t1 -> Sing t2 -> Sing t3 -> Sing t4 -> Sing (LiftA3 t1 t2 t3 t4)
type family Optional (a1 :: f a) :: f Maybe a
sOptional :: forall (f :: Type -> Type) a (t :: f a). SAlternative f => Sing t -> Sing (Optional t)
data PureSym0 (a1 :: TyFun a f a)
type family PureSym1 (a6989586621679271251 :: a) :: f a
data (a1 :: TyFun f a ~> b f a ~> f b) <*>@#@$
infixl 4 <*>@#@$
data (a6989586621679271255 :: f a ~> b) <*>@#@$$ (b1 :: TyFun f a f b)
infixl 4 <*>@#@$$
type family (a6989586621679271255 :: f a ~> b) <*>@#@$$$ (a6989586621679271256 :: f a) :: f b
infixl 4 <*>@#@$$$
data (a1 :: TyFun f a f b ~> f b) *>@#@$
infixl 4 *>@#@$
data (a6989586621679271267 :: f a) *>@#@$$ (b1 :: TyFun f b f b)
infixl 4 *>@#@$$
type family (a6989586621679271267 :: f a) *>@#@$$$ (a6989586621679271268 :: f b) :: f b
infixl 4 *>@#@$$$
data (a1 :: TyFun f a f b ~> f a) <*@#@$
infixl 4 <*@#@$
data (a6989586621679271272 :: f a) <*@#@$$ (b1 :: TyFun f b f a)
infixl 4 <*@#@$$
type family (a6989586621679271272 :: f a) <*@#@$$$ (a6989586621679271273 :: f b) :: f a
infixl 4 <*@#@$$$
type family EmptySym0 :: f a
data (a1 :: TyFun f a f a ~> f a) <|>@#@$
infixl 3 <|>@#@$
data (a6989586621679271374 :: f a) <|>@#@$$ (b :: TyFun f a f a)
infixl 3 <|>@#@$$
type family (a6989586621679271374 :: f a) <|>@#@$$$ (a6989586621679271375 :: f a) :: f a
infixl 3 <|>@#@$$$
data ConstSym0 (a1 :: TyFun a Const a b)
type family ConstSym1 (a6989586621680067841 :: a) :: Const a b
data GetConstSym0 (a1 :: TyFun Const a b a)
type family GetConstSym1 (a6989586621680067844 :: Const a b) :: a
data (a1 :: TyFun a ~> b f a ~> f b) <$>@#@$
infixl 4 <$>@#@$
data (a6989586621679357520 :: a ~> b) <$>@#@$$ (b1 :: TyFun f a f b)
infixl 4 <$>@#@$$
type family (a6989586621679357520 :: a ~> b) <$>@#@$$$ (a6989586621679357521 :: f a) :: f b
infixl 4 <$>@#@$$$
data (a1 :: TyFun a f b ~> f a) <$@#@$
infixl 4 <$@#@$
data (a6989586621679271232 :: a) <$@#@$$ (b1 :: TyFun f b f a)
infixl 4 <$@#@$$
type family (a6989586621679271232 :: a) <$@#@$$$ (a6989586621679271233 :: f b) :: f a
infixl 4 <$@#@$$$
data (a1 :: TyFun f a f a ~> b ~> f b) <**>@#@$
infixl 4 <**>@#@$
data (a6989586621679271211 :: f a) <**>@#@$$ (b1 :: TyFun f a ~> b f b)
infixl 4 <**>@#@$$
type family (a6989586621679271211 :: f a) <**>@#@$$$ (a6989586621679271212 :: f a ~> b) :: f b
infixl 4 <**>@#@$$$
data LiftASym0 (a1 :: TyFun a ~> b f a ~> f b)
data LiftASym1 (a6989586621679271200 :: a ~> b) (b1 :: TyFun f a f b)
type family LiftASym2 (a6989586621679271200 :: a ~> b) (a6989586621679271201 :: f a) :: f b
data LiftA2Sym0 (a1 :: TyFun a ~> b ~> c f a ~> f b ~> f c)
data LiftA2Sym1 (a6989586621679271261 :: a ~> b ~> c) (b1 :: TyFun f a f b ~> f c)
data LiftA2Sym2 (a6989586621679271261 :: a ~> b ~> c) (a6989586621679271262 :: f a) (c1 :: TyFun f b f c)
type family LiftA2Sym3 (a6989586621679271261 :: a ~> b ~> c) (a6989586621679271262 :: f a) (a6989586621679271263 :: f b) :: f c
data LiftA3Sym0 (a1 :: TyFun a ~> b ~> c ~> d f a ~> f b ~> f c ~> f d)
data LiftA3Sym1 (a6989586621679271189 :: a ~> b ~> c ~> d) (b1 :: TyFun f a f b ~> f c ~> f d)
data LiftA3Sym2 (a6989586621679271189 :: a ~> b ~> c ~> d) (a6989586621679271190 :: f a) (c1 :: TyFun f b f c ~> f d)
data LiftA3Sym3 (a6989586621679271189 :: a ~> b ~> c ~> d) (a6989586621679271190 :: f a) (a6989586621679271191 :: f b) (d1 :: TyFun f c f d)
data OptionalSym0 (a1 :: TyFun f a f Maybe a)
type family OptionalSym1 (a6989586621680340908 :: f a) :: f Maybe a
instance Control.Monad.Singletons.Internal.PApplicative GHC.Internal.Data.Ord.Down
instance Control.Monad.Singletons.Internal.PApplicative ((,) a)
instance Control.Monad.Singletons.Internal.SApplicative GHC.Internal.Data.Ord.Down
instance Data.Monoid.Singletons.SMonoid a => Control.Monad.Singletons.Internal.SApplicative ((,) a)
instance Control.Monad.Singletons.Internal.SAlternative f => Data.Singletons.SingI Control.Applicative.Singletons.OptionalSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Control.Applicative.Singletons.OptionalSym0
-- | This module contains everything you need to derive your own singletons
-- via Template Haskell, exporting both Template Haskell functionality
-- and definitions that are likely to be mentioned in promoted or singled
-- code. For a version of this module that only contains the Template
-- Haskell functionality and nothing else, see Data.Singletons.TH
-- from the singletons-th library.
module Data.Singletons.Base.TH
singletons :: OptionsMonad q => q [Dec] -> q [Dec]
singletonsOnly :: OptionsMonad q => q [Dec] -> q [Dec]
genSingletons :: OptionsMonad q => [Name] -> q [Dec]
promote :: OptionsMonad q => q [Dec] -> q [Dec]
promoteOnly :: OptionsMonad q => q [Dec] -> q [Dec]
genDefunSymbols :: OptionsMonad q => [Name] -> q [Dec]
genPromotions :: OptionsMonad q => [Name] -> q [Dec]
promoteEqInstances :: OptionsMonad q => [Name] -> q [Dec]
promoteEqInstance :: OptionsMonad q => Name -> q [Dec]
singEqInstances :: OptionsMonad q => [Name] -> q [Dec]
singEqInstance :: OptionsMonad q => Name -> q [Dec]
singDecideInstances :: OptionsMonad q => [Name] -> q [Dec]
singDecideInstance :: OptionsMonad q => Name -> q [Dec]
promoteOrdInstances :: OptionsMonad q => [Name] -> q [Dec]
promoteOrdInstance :: OptionsMonad q => Name -> q [Dec]
singOrdInstances :: OptionsMonad q => [Name] -> q [Dec]
singOrdInstance :: OptionsMonad q => Name -> q [Dec]
promoteBoundedInstances :: OptionsMonad q => [Name] -> q [Dec]
promoteBoundedInstance :: OptionsMonad q => Name -> q [Dec]
singBoundedInstances :: OptionsMonad q => [Name] -> q [Dec]
singBoundedInstance :: OptionsMonad q => Name -> q [Dec]
promoteEnumInstances :: OptionsMonad q => [Name] -> q [Dec]
promoteEnumInstance :: OptionsMonad q => Name -> q [Dec]
singEnumInstances :: OptionsMonad q => [Name] -> q [Dec]
singEnumInstance :: OptionsMonad q => Name -> q [Dec]
promoteShowInstances :: OptionsMonad q => [Name] -> q [Dec]
promoteShowInstance :: OptionsMonad q => Name -> q [Dec]
singShowInstances :: OptionsMonad q => [Name] -> q [Dec]
singShowInstance :: OptionsMonad q => Name -> q [Dec]
showSingInstances :: OptionsMonad q => [Name] -> q [Dec]
showSingInstance :: OptionsMonad q => Name -> q [Dec]
singITyConInstances :: DsMonad q => [Int] -> q [Dec]
singITyConInstance :: DsMonad q => Int -> q Dec
cases :: DsMonad q => Name -> q Exp -> q Exp -> q Exp
sCases :: OptionsMonad q => Name -> q Exp -> q Exp -> q Exp
data SList (a1 :: [a])
[SNil] :: forall a. SList ('[] :: [a])
[SCons] :: forall a (n1 :: a) (n2 :: [a]). Sing n1 -> Sing n2 -> SList (n1 ': n2)
infixr 5 `SCons`
data SBool (a :: Bool)
[SFalse] :: SBool 'False
[STrue] :: SBool 'True
data STuple0 (a :: ())
[STuple0] :: STuple0 '()
data STuple2 (a1 :: (a, b))
[STuple2] :: forall a b (n1 :: a) (n2 :: b). Sing n1 -> Sing n2 -> STuple2 '(n1, n2)
data STuple3 (a1 :: (a, b, c))
[STuple3] :: forall a b c (n1 :: a) (n2 :: b) (n3 :: c). Sing n1 -> Sing n2 -> Sing n3 -> STuple3 '(n1, n2, n3)
data STuple4 (a1 :: (a, b, c, d))
[STuple4] :: forall a b c d (n1 :: a) (n2 :: b) (n3 :: c) (n4 :: d). Sing n1 -> Sing n2 -> Sing n3 -> Sing n4 -> STuple4 '(n1, n2, n3, n4)
data STuple5 (a1 :: (a, b, c, d, e))
[STuple5] :: forall a b c d e (n1 :: a) (n2 :: b) (n3 :: c) (n4 :: d) (n5 :: e). Sing n1 -> Sing n2 -> Sing n3 -> Sing n4 -> Sing n5 -> STuple5 '(n1, n2, n3, n4, n5)
data STuple6 (a1 :: (a, b, c, d, e, f))
[STuple6] :: forall a b c d e f (n1 :: a) (n2 :: b) (n3 :: c) (n4 :: d) (n5 :: e) (n6 :: f). Sing n1 -> Sing n2 -> Sing n3 -> Sing n4 -> Sing n5 -> Sing n6 -> STuple6 '(n1, n2, n3, n4, n5, n6)
data STuple7 (a1 :: (a, b, c, d, e, f, g))
[STuple7] :: forall a b c d e f g (n1 :: a) (n2 :: b) (n3 :: c) (n4 :: d) (n5 :: e) (n6 :: f) (n7 :: g). Sing n1 -> Sing n2 -> Sing n3 -> Sing n4 -> Sing n5 -> Sing n6 -> Sing n7 -> STuple7 '(n1, n2, n3, n4, n5, n6, n7)
data SOrdering (a :: Ordering)
[SLT] :: SOrdering 'LT
[SEQ] :: SOrdering 'EQ
[SGT] :: SOrdering 'GT
(@@) :: forall k1 k2 (f :: k1 ~> k2) (t :: k1). Sing f -> Sing t -> Sing (f @@ t)
pattern FromSing :: forall k (a :: k). SingKind k => Sing a -> Demote k
pattern SLambda2 :: forall {a1} {a2} {b} (f :: a1 ~> (a2 ~> b)). SingFunction2 f -> Sing f
pattern SLambda3 :: forall {a1} {a2} {a3} {b} (f :: a1 ~> (a2 ~> (a3 ~> b))). SingFunction3 f -> Sing f
pattern SLambda4 :: forall {a1} {a2} {a3} {a4} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> b)))). SingFunction4 f -> Sing f
pattern SLambda5 :: forall {a1} {a2} {a3} {a4} {a5} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> b))))). SingFunction5 f -> Sing f
pattern SLambda6 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> b)))))). SingFunction6 f -> Sing f
pattern SLambda7 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {a7} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> (a7 ~> b))))))). SingFunction7 f -> Sing f
pattern SLambda8 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {a7} {a8} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> (a7 ~> (a8 ~> b)))))))). SingFunction8 f -> Sing f
pattern Sing :: forall k (a :: k). () => SingI a => Sing a
applySing2 :: forall {a1} {a2} {b} (f :: a1 ~> (a2 ~> b)). Sing f -> SingFunction2 f
applySing3 :: forall {a1} {a2} {a3} {b} (f :: a1 ~> (a2 ~> (a3 ~> b))). Sing f -> SingFunction3 f
applySing4 :: forall {a1} {a2} {a3} {a4} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> b)))). Sing f -> SingFunction4 f
applySing5 :: forall {a1} {a2} {a3} {a4} {a5} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> b))))). Sing f -> SingFunction5 f
applySing6 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> b)))))). Sing f -> SingFunction6 f
applySing7 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {a7} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> (a7 ~> b))))))). Sing f -> SingFunction7 f
applySing8 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {a7} {a8} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> (a7 ~> (a8 ~> b)))))))). Sing f -> SingFunction8 f
demote :: forall {k} (a :: k). (SingKind k, SingI a) => Demote k
demote1 :: forall {k1} {k2} (f :: k1 -> k2) (x :: k1). (SingKind k2, SingI1 f, SingI x) => Demote k2
demote2 :: forall {k1} {k2} {k3} (f :: k1 -> k2 -> k3) (x :: k1) (y :: k2). (SingKind k3, SingI2 f, SingI x, SingI y) => Demote k3
sing1 :: forall {k1} {k} (f :: k1 -> k) (x :: k1). (SingI1 f, SingI x) => Sing (f x)
sing2 :: forall {k1} {k2} {k} (f :: k1 -> k2 -> k) (x :: k1) (y :: k2). (SingI2 f, SingI x, SingI y) => Sing (f x y)
singByProxy :: forall {k} (a :: k) proxy. SingI a => proxy a -> Sing a
singByProxy# :: forall {k} (a :: k). SingI a => Proxy# a -> Sing a
singByProxy1 :: forall {k1} {k} (f :: k1 -> k) (x :: k1) proxy. (SingI1 f, SingI x) => proxy (f x) -> Sing (f x)
singByProxy1# :: forall {k1} {k} (f :: k1 -> k) (x :: k1). (SingI1 f, SingI x) => Proxy# (f x) -> Sing (f x)
singByProxy2 :: forall {k1} {k2} {k} (f :: k1 -> k2 -> k) (x :: k1) (y :: k2) proxy. (SingI2 f, SingI x, SingI y) => proxy (f x y) -> Sing (f x y)
singByProxy2# :: forall {k1} {k2} {k} (f :: k1 -> k2 -> k) (x :: k1) (y :: k2). (SingI2 f, SingI x, SingI y) => Proxy# (f x y) -> Sing (f x y)
singFun1 :: forall {a1} {b} (f :: a1 ~> b). SingFunction1 f -> Sing f
singFun2 :: forall {a1} {a2} {b} (f :: a1 ~> (a2 ~> b)). SingFunction2 f -> Sing f
singFun3 :: forall {a1} {a2} {a3} {b} (f :: a1 ~> (a2 ~> (a3 ~> b))). SingFunction3 f -> Sing f
singFun4 :: forall {a1} {a2} {a3} {a4} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> b)))). SingFunction4 f -> Sing f
singFun5 :: forall {a1} {a2} {a3} {a4} {a5} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> b))))). SingFunction5 f -> Sing f
singFun6 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> b)))))). SingFunction6 f -> Sing f
singFun7 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {a7} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> (a7 ~> b))))))). SingFunction7 f -> Sing f
singFun8 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {a7} {a8} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> (a7 ~> (a8 ~> b)))))))). SingFunction8 f -> Sing f
singInstance :: forall k (a :: k). Sing a -> SingInstance a
singThat :: forall k (a :: k). (SingKind k, SingI a) => (Demote k -> Bool) -> Maybe (Sing a)
singThat1 :: forall k1 k2 (f :: k1 -> k2) (x :: k1). (SingKind k2, SingI1 f, SingI x) => (Demote k2 -> Bool) -> Maybe (Sing (f x))
singThat2 :: forall k1 k2 k3 (f :: k1 -> k2 -> k3) (x :: k1) (y :: k2). (SingKind k3, SingI2 f, SingI x, SingI y) => (Demote k3 -> Bool) -> Maybe (Sing (f x y))
unSingFun1 :: forall {a1} {b} (f :: a1 ~> b). Sing f -> SingFunction1 f
unSingFun2 :: forall {a1} {a2} {b} (f :: a1 ~> (a2 ~> b)). Sing f -> SingFunction2 f
unSingFun3 :: forall {a1} {a2} {a3} {b} (f :: a1 ~> (a2 ~> (a3 ~> b))). Sing f -> SingFunction3 f
unSingFun4 :: forall {a1} {a2} {a3} {a4} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> b)))). Sing f -> SingFunction4 f
unSingFun5 :: forall {a1} {a2} {a3} {a4} {a5} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> b))))). Sing f -> SingFunction5 f
unSingFun6 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> b)))))). Sing f -> SingFunction6 f
unSingFun7 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {a7} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> (a7 ~> b))))))). Sing f -> SingFunction7 f
unSingFun8 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {a7} {a8} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> (a7 ~> (a8 ~> b)))))))). Sing f -> SingFunction8 f
usingSingI1 :: forall {k1} {k} (f :: k1 -> k) (x :: k1) r. (SingI1 f, SingI x) => (SingI (f x) => r) -> r
usingSingI2 :: forall {k1} {k2} {k} (f :: k1 -> k2 -> k) (x :: k1) (y :: k2) r. (SingI2 f, SingI x, SingI y) => (SingI (f x y) => r) -> r
withSing :: forall {k} (a :: k) b. SingI a => (Sing a -> b) -> b
withSing1 :: forall {k1} {k} (f :: k1 -> k) (x :: k1) b. (SingI1 f, SingI x) => (Sing (f x) -> b) -> b
withSing2 :: forall {k1} {k2} {k} (f :: k1 -> k2 -> k) (x :: k1) (y :: k2) b. (SingI2 f, SingI x, SingI y) => (Sing (f x y) -> b) -> b
withSingI :: forall {k} (n :: k) r. Sing n -> (SingI n => r) -> r
withSomeSing :: SingKind k => Demote k -> (forall (a :: k). () => Sing a -> r) -> r
-- | Proxy is a type that holds no data, but has a phantom parameter
-- of arbitrary type (or even kind). Its use is to provide type
-- information, even though there is no value available of that type (or
-- it may be too costly to create one).
--
-- Historically, Proxy :: Proxy a is a safer
-- alternative to the undefined :: a idiom.
--
--
-- >>> Proxy :: Proxy (Void, Int -> Int)
-- Proxy
--
--
-- Proxy can even hold types of higher kinds,
--
--
-- >>> Proxy :: Proxy Either
-- Proxy
--
--
--
-- >>> Proxy :: Proxy Functor
-- Proxy
--
--
--
-- >>> Proxy :: Proxy complicatedStructure
-- Proxy
--
data Proxy (t :: k)
Proxy :: Proxy (t :: k)
type (a :: k1 ~> k2) @@ (b :: k1) = Apply a b
data (a1 :: TyFun a ~> b a ~> b) @@@#@$
data (a1 :: a ~> b) @@@#@$$ (b1 :: TyFun a b)
type (f :: a ~> b) @@@#@$$$ (x :: a) = f @@ x
type family Apply (f :: k1 ~> k2) (x :: k1) :: k2
data ApplySym0 (a1 :: TyFun a ~> b a ~> b)
data ApplySym1 (a1 :: a ~> b) (b1 :: TyFun a b)
type ApplySym2 (f :: a ~> b) (x :: a) = Apply f x
type family ApplyTyCon :: k1 -> k2 -> TyFun k1 unmatchable_fun -> Type
data ApplyTyConAux1 (a :: k1 -> k2) (b :: TyFun k1 k2)
data ApplyTyConAux2 (a :: k1 -> k2 -> k3) (b :: TyFun k1 unmatchable_fun)
type family Demote k = (r :: Type) | r -> k
data DemoteSym0 (a :: TyFun Type Type)
type DemoteSym1 x = Demote x
type KindOf (a :: k) = k
data KindOfSym0 (a :: TyFun k Type)
type KindOfSym1 (x :: k) = KindOf x
newtype SLambda (f :: k1 ~> k2)
SLambda :: (forall (t :: k1). () => Sing t -> Sing (f @@ t)) -> SLambda (f :: k1 ~> k2)
[applySing] :: SLambda (f :: k1 ~> k2) -> forall (t :: k1). () => Sing t -> Sing (f @@ t)
newtype SWrappedSing (a1 :: WrappedSing a)
[SWrapSing] :: forall k (a :: k) (a1 :: WrappedSing a). Sing a -> SWrappedSing a1
type SameKind (a :: k) (b :: k) = ()
data SameKindSym0 (a :: TyFun k k ~> Constraint)
data SameKindSym1 (a :: k) (b :: TyFun k Constraint)
type SameKindSym2 (x :: k) (y :: k) = SameKind x y
type family Sing :: k -> Type
type SingFunction1 (f :: a1 ~> b) = forall (t :: a1). () => Sing t -> Sing f @@ t
type SingFunction2 (f :: a1 ~> a2 ~> b) = forall (t1 :: a1) (t2 :: a2). () => Sing t1 -> Sing t2 -> Sing f @@ t1 @@ t2
type SingFunction3 (f :: a1 ~> a2 ~> a3 ~> b) = forall (t1 :: a1) (t2 :: a2) (t3 :: a3). () => Sing t1 -> Sing t2 -> Sing t3 -> Sing f @@ t1 @@ t2 @@ t3
type SingFunction4 (f :: a1 ~> a2 ~> a3 ~> a4 ~> b) = forall (t1 :: a1) (t2 :: a2) (t3 :: a3) (t4 :: a4). () => Sing t1 -> Sing t2 -> Sing t3 -> Sing t4 -> Sing f @@ t1 @@ t2 @@ t3 @@ t4
type SingFunction5 (f :: a1 ~> a2 ~> a3 ~> a4 ~> a5 ~> b) = forall (t1 :: a1) (t2 :: a2) (t3 :: a3) (t4 :: a4) (t5 :: a5). () => Sing t1 -> Sing t2 -> Sing t3 -> Sing t4 -> Sing t5 -> Sing f @@ t1 @@ t2 @@ t3 @@ t4 @@ t5
type SingFunction6 (f :: a1 ~> a2 ~> a3 ~> a4 ~> a5 ~> a6 ~> b) = forall (t1 :: a1) (t2 :: a2) (t3 :: a3) (t4 :: a4) (t5 :: a5) (t6 :: a6). () => Sing t1 -> Sing t2 -> Sing t3 -> Sing t4 -> Sing t5 -> Sing t6 -> Sing f @@ t1 @@ t2 @@ t3 @@ t4 @@ t5 @@ t6
type SingFunction7 (f :: a1 ~> a2 ~> a3 ~> a4 ~> a5 ~> a6 ~> a7 ~> b) = forall (t1 :: a1) (t2 :: a2) (t3 :: a3) (t4 :: a4) (t5 :: a5) (t6 :: a6) (t7 :: a7). () => Sing t1 -> Sing t2 -> Sing t3 -> Sing t4 -> Sing t5 -> Sing t6 -> Sing t7 -> Sing f @@ t1 @@ t2 @@ t3 @@ t4 @@ t5 @@ t6 @@ t7
type SingFunction8 (f :: a1 ~> a2 ~> a3 ~> a4 ~> a5 ~> a6 ~> a7 ~> a8 ~> b) = forall (t1 :: a1) (t2 :: a2) (t3 :: a3) (t4 :: a4) (t5 :: a5) (t6 :: a6) (t7 :: a7) (t8 :: a8). () => Sing t1 -> Sing t2 -> Sing t3 -> Sing t4 -> Sing t5 -> Sing t6 -> Sing t7 -> Sing t8 -> Sing f @@ t1 @@ t2 @@ t3 @@ t4 @@ t5 @@ t6 @@ t7 @@ t8
class SingI (a :: k)
sing :: SingI a => Sing a
class forall (x :: k1). SingI x => SingI f x => SingI1 (f :: k1 -> k2)
liftSing :: forall (x :: k1). SingI1 f => Sing x -> Sing (f x)
class forall (x :: k1) (y :: k2). (SingI x, SingI y) => SingI f x y => SingI2 (f :: k1 -> k2 -> k3)
liftSing2 :: forall (x :: k1) (y :: k2). SingI2 f => Sing x -> Sing y -> Sing (f x y)
data SingInstance (a :: k)
[SingInstance] :: forall {k} (a :: k). SingI a => SingInstance a
class SingKind k where {
type Demote k = (r :: Type) | r -> k;
}
fromSing :: forall (a :: k). SingKind k => Sing a -> Demote k
toSing :: SingKind k => Demote k -> SomeSing k
data SomeSing k
[SomeSing] :: forall k (a :: k). Sing a -> SomeSing k
data family TyCon :: forall k1 k2 unmatchable_fun. () => k1 -> k2 -> unmatchable_fun
type TyCon1 = TyCon
type TyCon2 = TyCon
type TyCon3 = TyCon
type TyCon4 = TyCon
type TyCon5 = TyCon
type TyCon6 = TyCon
type TyCon7 = TyCon
type TyCon8 = TyCon
data TyFun a b
type family UnwrapSing (ws :: WrappedSing a) :: Sing a
newtype WrappedSing (a :: k)
[WrapSing] :: forall k (a :: k). Sing a -> WrappedSing a
type a ~> b = TyFun a b -> Type
data (a :: TyFun Type Type ~> Type) ~>@#@$
data a ~>@#@$$ (b :: TyFun Type Type)
type x ~>@#@$$$ y = x ~> y
class PEq a where {
type (arg :: a) == (arg1 :: a) :: Bool;
type (arg :: a) /= (arg1 :: a) :: Bool;
type arg :: a == arg1 :: a = TFHelper_6989586621679128045 arg arg1;
type arg :: a /= arg1 :: a = TFHelper_6989586621679128034 arg arg1;
}
infix 4 ==
infix 4 /=
-- | Type-level If. If True a b ==> a; If
-- False a b ==> b
type family If (cond :: Bool) (tru :: k) (fls :: k) :: k
-- | Conditional over singletons
sIf :: forall {k} (a :: Bool) (b :: k) (c :: k). Sing a -> Sing b -> Sing c -> Sing (If a b c)
-- | Type-level "and"
type family (a :: Bool) && (b :: Bool) :: Bool
infixr 3 &&
-- | Conjunction of singletons
(%&&) :: forall (a :: Bool) (b :: Bool). Sing a -> Sing b -> Sing (a && b)
infixr 3 %&&
class SEq a
(%==) :: forall (t1 :: a) (t2 :: a). SEq a => Sing t1 -> Sing t2 -> Sing (t1 == t2)
($dm%==) :: forall (t1 :: a) (t2 :: a). (SEq a, (t1 == t2) ~ TFHelper_6989586621679128045 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 == t2)
(%/=) :: forall (t1 :: a) (t2 :: a). SEq a => Sing t1 -> Sing t2 -> Sing (t1 /= t2)
($dm%/=) :: forall (t1 :: a) (t2 :: a). (SEq a, (t1 /= t2) ~ TFHelper_6989586621679128034 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 /= t2)
infix 4 %==
infix 4 %/=
class POrd a where {
type Compare (arg :: a) (arg1 :: a) :: Ordering;
type (arg :: a) < (arg1 :: a) :: Bool;
type (arg :: a) <= (arg1 :: a) :: Bool;
type (arg :: a) > (arg1 :: a) :: Bool;
type (arg :: a) >= (arg1 :: a) :: Bool;
type Max (arg :: a) (arg1 :: a) :: a;
type Min (arg :: a) (arg1 :: a) :: a;
type Compare arg :: a arg1 :: a = Compare_6989586621679190000 arg arg1;
type arg :: a < arg1 :: a = TFHelper_6989586621679190021 arg arg1;
type arg :: a <= arg1 :: a = TFHelper_6989586621679190037 arg arg1;
type arg :: a > arg1 :: a = TFHelper_6989586621679190053 arg arg1;
type arg :: a >= arg1 :: a = TFHelper_6989586621679190069 arg arg1;
type Max arg :: a arg1 :: a = Max_6989586621679190085 arg arg1;
type Min arg :: a arg1 :: a = Min_6989586621679190101 arg arg1;
}
infix 4 <
infix 4 <=
infix 4 >
infix 4 >=
class SEq a => SOrd a
sCompare :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (Compare t1 t2)
($dmsCompare) :: forall (t1 :: a) (t2 :: a). (SOrd a, Compare t1 t2 ~ Compare_6989586621679190000 t1 t2) => Sing t1 -> Sing t2 -> Sing (Compare t1 t2)
(%<) :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (t1 < t2)
($dm%<) :: forall (t1 :: a) (t2 :: a). (SOrd a, (t1 < t2) ~ TFHelper_6989586621679190021 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 < t2)
(%<=) :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (t1 <= t2)
($dm%<=) :: forall (t1 :: a) (t2 :: a). (SOrd a, (t1 <= t2) ~ TFHelper_6989586621679190037 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 <= t2)
(%>) :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (t1 > t2)
($dm%>) :: forall (t1 :: a) (t2 :: a). (SOrd a, (t1 > t2) ~ TFHelper_6989586621679190053 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 > t2)
(%>=) :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (t1 >= t2)
($dm%>=) :: forall (t1 :: a) (t2 :: a). (SOrd a, (t1 >= t2) ~ TFHelper_6989586621679190069 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 >= t2)
sMax :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (Max t1 t2)
($dmsMax) :: forall (t1 :: a) (t2 :: a). (SOrd a, Max t1 t2 ~ Max_6989586621679190085 t1 t2) => Sing t1 -> Sing t2 -> Sing (Max t1 t2)
sMin :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (Min t1 t2)
($dmsMin) :: forall (t1 :: a) (t2 :: a). (SOrd a, Min t1 t2 ~ Min_6989586621679190101 t1 t2) => Sing t1 -> Sing t2 -> Sing (Min t1 t2)
infix 4 %<
infix 4 %<=
infix 4 %>
infix 4 %>=
class SDecide k
(%~) :: forall (a :: k) (b :: k). SDecide k => Sing a -> Sing b -> Decision (a :~: b)
-- | Propositional equality. If a :~: b is inhabited by some
-- terminating value, then the type a is the same as the type
-- b. To use this equality in practice, pattern-match on the
-- a :~: b to get out the Refl constructor; in the body
-- of the pattern-match, the compiler knows that a ~ b.
data (a :: k) :~: (b :: k)
[Refl] :: forall {k} (a :: k). a :~: a
infix 4 :~:
-- | Uninhabited data type
data Void
type Refuted a = a -> Void
data Decision a
Proved :: a -> Decision a
Disproved :: Refuted a -> Decision a
class PBounded a where {
type MinBound :: a;
type MaxBound :: a;
}
class SBounded a
sMinBound :: SBounded a => Sing (MinBound :: a)
sMaxBound :: SBounded a => Sing (MaxBound :: a)
class PEnum a where {
type ToEnum (arg :: Natural) :: a;
type FromEnum (arg :: a) :: Natural;
type Succ arg :: a = Succ_6989586621679414077 arg;
type Pred arg :: a = Pred_6989586621679414092 arg;
type EnumFromTo arg :: a arg1 :: a = EnumFromTo_6989586621679414102 arg arg1;
type EnumFromThenTo arg :: a arg1 :: a arg2 :: a = EnumFromThenTo_6989586621679414114 arg arg1 arg2;
}
class SEnum a
sToEnum :: forall (t :: Natural). SEnum a => Sing t -> Sing (ToEnum t :: a)
sFromEnum :: forall (t :: a). SEnum a => Sing t -> Sing (FromEnum t)
class PShow a where {
type ShowsPrec (arg :: Natural) (arg1 :: a) (arg2 :: Symbol) :: Symbol;
type Show_ (arg :: a) :: Symbol;
type ShowList (arg :: [a]) (arg1 :: Symbol) :: Symbol;
type ShowsPrec arg :: Natural arg1 :: a arg2 :: Symbol = ShowsPrec_6989586621679807423 arg arg1 arg2;
type Show_ arg :: a = Show__6989586621679807435 arg;
type ShowList arg :: [a] arg1 :: Symbol = ShowList_6989586621679807443 arg arg1;
}
class SShow a
sShowsPrec :: forall (t1 :: Natural) (t2 :: a) (t3 :: Symbol). SShow a => Sing t1 -> Sing t2 -> Sing t3 -> Sing (ShowsPrec t1 t2 t3)
($dmsShowsPrec) :: forall (t1 :: Natural) (t2 :: a) (t3 :: Symbol). (SShow a, ShowsPrec t1 t2 t3 ~ ShowsPrec_6989586621679807423 t1 t2 t3) => Sing t1 -> Sing t2 -> Sing t3 -> Sing (ShowsPrec t1 t2 t3)
sShow_ :: forall (t :: a). SShow a => Sing t -> Sing (Show_ t)
($dmsShow_) :: forall (t :: a). (SShow a, Show_ t ~ Show__6989586621679807435 t) => Sing t -> Sing (Show_ t)
sShowList :: forall (t1 :: [a]) (t2 :: Symbol). SShow a => Sing t1 -> Sing t2 -> Sing (ShowList t1 t2)
($dmsShowList) :: forall (t1 :: [a]) (t2 :: Symbol). (SShow a, ShowList t1 t2 ~ ShowList_6989586621679807443 t1 t2) => Sing t1 -> Sing t2 -> Sing (ShowList t1 t2)
class PIsString a where {
type FromString (arg :: Symbol) :: a;
}
class SIsString a
sFromString :: forall (t :: Symbol). SIsString a => Sing t -> Sing (FromString t :: a)
type family ShowString (a :: Symbol) (a1 :: Symbol) :: Symbol
sShowString :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (ShowString t1 t2)
type family ShowParen (a :: Bool) (a1 :: Symbol ~> Symbol) (a2 :: Symbol) :: Symbol
sShowParen :: forall (t1 :: Bool) (t2 :: Symbol ~> Symbol) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (ShowParen t1 t2 t3)
type family ShowSpace (a :: Symbol) :: Symbol
sShowSpace :: forall (t :: Symbol). Sing t -> Sing (ShowSpace t)
type family ShowChar (a :: Char) (a1 :: Symbol) :: Symbol
sShowChar :: forall (t1 :: Char) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (ShowChar t1 t2)
type family ShowCommaSpace (a :: Symbol) :: Symbol
sShowCommaSpace :: forall (t :: Symbol). Sing t -> Sing (ShowCommaSpace t)
type family FromInteger (arg :: Natural) :: a
sFromInteger :: forall (t :: Natural). SNum a => Sing t -> Sing (FromInteger t :: a)
type family Negate (arg :: a) :: a
sNegate :: forall (t :: a). SNum a => Sing t -> Sing (Negate t)
class PFunctor (f :: Type -> Type) where {
type Fmap (arg :: a ~> b) (arg1 :: f a) :: f b;
type (arg :: a) <$ (arg1 :: f b) :: f a;
type arg :: a <$ arg1 :: f b = TFHelper_6989586621679271236 arg arg1;
}
infixl 4 <$
class SFunctor (f :: Type -> Type)
sFmap :: forall a b (t1 :: a ~> b) (t2 :: f a). SFunctor f => Sing t1 -> Sing t2 -> Sing (Fmap t1 t2)
(%<$) :: forall a b (t1 :: a) (t2 :: f b). SFunctor f => Sing t1 -> Sing t2 -> Sing (t1 <$ t2)
($dm%<$) :: forall a b (t1 :: a) (t2 :: f b). (SFunctor f, (t1 <$ t2) ~ TFHelper_6989586621679271236 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 <$ t2)
infixl 4 %<$
class PFoldable (t :: Type -> Type) where {
type Fold (arg :: t m) :: m;
type FoldMap (arg :: a ~> m) (arg1 :: t a) :: m;
type Foldr (arg :: a ~> b ~> b) (arg1 :: b) (arg2 :: t a) :: b;
type Foldr' (arg :: a ~> b ~> b) (arg1 :: b) (arg2 :: t a) :: b;
type Foldl (arg :: b ~> a ~> b) (arg1 :: b) (arg2 :: t a) :: b;
type Foldl' (arg :: b ~> a ~> b) (arg1 :: b) (arg2 :: t a) :: b;
type Foldr1 (arg :: a ~> a ~> a) (arg1 :: t a) :: a;
type Foldl1 (arg :: a ~> a ~> a) (arg1 :: t a) :: a;
type ToList (arg :: t a) :: [a];
type Null (arg :: t a) :: Bool;
type Length (arg :: t a) :: Natural;
type Elem (arg :: a) (arg1 :: 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;
type Fold arg :: t m = Fold_6989586621679922582 arg;
type FoldMap arg :: a ~> m arg1 :: t a = FoldMap_6989586621679922592 arg arg1;
type Foldr arg :: a ~> b ~> b arg1 :: b arg2 :: t a = Foldr_6989586621679922606 arg arg1 arg2;
type Foldr' arg :: a ~> b ~> b arg1 :: b arg2 :: t a = Foldr'_6989586621679922621 arg arg1 arg2;
type Foldl arg :: b ~> a ~> b arg1 :: b arg2 :: t a = Foldl_6989586621679922644 arg arg1 arg2;
type Foldl' arg :: b ~> a ~> b arg1 :: b arg2 :: t a = Foldl'_6989586621679922659 arg arg1 arg2;
type Foldr1 arg :: a ~> a ~> a arg1 :: t a = Foldr1_6989586621679922681 arg arg1;
type Foldl1 arg :: a ~> a ~> a arg1 :: t a = Foldl1_6989586621679922704 arg arg1;
type ToList arg :: t a = ToList_6989586621679922726 arg;
type Null arg :: t a = Null_6989586621679922735 arg;
type Length arg :: t a = Length_6989586621679922751 arg;
type Elem arg :: a arg1 :: t a = Elem_6989586621679922769 arg arg1;
type Maximum arg :: t a = Maximum_6989586621679922783 arg;
type Minimum arg :: t a = Minimum_6989586621679922798 arg;
type Sum arg :: t a = Sum_6989586621679922813 arg;
type Product arg :: t a = Product_6989586621679922822 arg;
}
class SFoldable (t :: Type -> Type)
sFold :: forall m (t1 :: t m). (SFoldable t, SMonoid m) => Sing t1 -> Sing (Fold t1)
($dmsFold) :: forall m (t1 :: t m). (SFoldable t, Fold t1 ~ Fold_6989586621679922582 t1, SMonoid m) => Sing t1 -> Sing (Fold t1)
sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: t a). (SFoldable t, SMonoid m) => Sing t1 -> Sing t2 -> Sing (FoldMap t1 t2)
($dmsFoldMap) :: forall a m (t1 :: a ~> m) (t2 :: t a). (SFoldable t, FoldMap t1 t2 ~ FoldMap_6989586621679922592 t1 t2, SMonoid m) => Sing t1 -> Sing t2 -> Sing (FoldMap t1 t2)
sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldr t1 t2 t3)
($dmsFoldr) :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: t a). (SFoldable t, Foldr t1 t2 t3 ~ Foldr_6989586621679922606 t1 t2 t3) => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldr t1 t2 t3)
sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldr' t1 t2 t3)
($dmsFoldr') :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: t a). (SFoldable t, Foldr' t1 t2 t3 ~ Foldr'_6989586621679922621 t1 t2 t3) => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldr' t1 t2 t3)
sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldl t1 t2 t3)
($dmsFoldl) :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a). (SFoldable t, Foldl t1 t2 t3 ~ Foldl_6989586621679922644 t1 t2 t3) => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldl t1 t2 t3)
sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldl' t1 t2 t3)
($dmsFoldl') :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a). (SFoldable t, Foldl' t1 t2 t3 ~ Foldl'_6989586621679922659 t1 t2 t3) => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldl' t1 t2 t3)
sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing (Foldr1 t1 t2)
($dmsFoldr1) :: forall a (t1 :: a ~> (a ~> a)) (t2 :: t a). (SFoldable t, Foldr1 t1 t2 ~ Foldr1_6989586621679922681 t1 t2) => Sing t1 -> Sing t2 -> Sing (Foldr1 t1 t2)
sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing (Foldl1 t1 t2)
($dmsFoldl1) :: forall a (t1 :: a ~> (a ~> a)) (t2 :: t a). (SFoldable t, Foldl1 t1 t2 ~ Foldl1_6989586621679922704 t1 t2) => Sing t1 -> Sing t2 -> Sing (Foldl1 t1 t2)
sToList :: forall a (t1 :: t a). SFoldable t => Sing t1 -> Sing (ToList t1)
($dmsToList) :: forall a (t1 :: t a). (SFoldable t, ToList t1 ~ ToList_6989586621679922726 t1) => Sing t1 -> Sing (ToList t1)
sNull :: forall a (t1 :: t a). SFoldable t => Sing t1 -> Sing (Null t1)
($dmsNull) :: forall a (t1 :: t a). (SFoldable t, Null t1 ~ Null_6989586621679922735 t1) => Sing t1 -> Sing (Null t1)
sLength :: forall a (t1 :: t a). SFoldable t => Sing t1 -> Sing (Length t1)
($dmsLength) :: forall a (t1 :: t a). (SFoldable t, Length t1 ~ Length_6989586621679922751 t1) => Sing t1 -> Sing (Length t1)
sElem :: forall a (t1 :: a) (t2 :: t a). (SFoldable t, SEq a) => Sing t1 -> Sing t2 -> Sing (Elem t1 t2)
($dmsElem) :: forall a (t1 :: a) (t2 :: t a). (SFoldable t, Elem t1 t2 ~ Elem_6989586621679922769 t1 t2, SEq a) => Sing t1 -> Sing t2 -> Sing (Elem t1 t2)
sMaximum :: forall a (t1 :: t a). (SFoldable t, SOrd a) => Sing t1 -> Sing (Maximum t1)
($dmsMaximum) :: forall a (t1 :: t a). (SFoldable t, Maximum t1 ~ Maximum_6989586621679922783 t1, SOrd a) => Sing t1 -> Sing (Maximum t1)
sMinimum :: forall a (t1 :: t a). (SFoldable t, SOrd a) => Sing t1 -> Sing (Minimum t1)
($dmsMinimum) :: forall a (t1 :: t a). (SFoldable t, Minimum t1 ~ Minimum_6989586621679922798 t1, SOrd a) => Sing t1 -> Sing (Minimum t1)
sSum :: forall a (t1 :: t a). (SFoldable t, SNum a) => Sing t1 -> Sing (Sum t1)
($dmsSum) :: forall a (t1 :: t a). (SFoldable t, Sum t1 ~ Sum_6989586621679922813 t1, SNum a) => Sing t1 -> Sing (Sum t1)
sProduct :: forall a (t1 :: t a). (SFoldable t, SNum a) => Sing t1 -> Sing (Product t1)
($dmsProduct) :: forall a (t1 :: t a). (SFoldable t, Product t1 ~ Product_6989586621679922822 t1, SNum a) => Sing t1 -> Sing (Product t1)
class PSemigroup a where {
type (arg :: a) <> (arg1 :: a) :: a;
type Sconcat (arg :: NonEmpty a) :: a;
type Sconcat arg :: NonEmpty a = Sconcat_6989586621679173985 arg;
}
infixr 6 <>
class SSemigroup a
(%<>) :: forall (t1 :: a) (t2 :: a). SSemigroup a => Sing t1 -> Sing t2 -> Sing (t1 <> t2)
sSconcat :: forall (t :: NonEmpty a). SSemigroup a => Sing t -> Sing (Sconcat t)
($dmsSconcat) :: forall (t :: NonEmpty a). (SSemigroup a, Sconcat t ~ Sconcat_6989586621679173985 t) => Sing t -> Sing (Sconcat t)
infixr 6 %<>
class PMonoid a where {
type Mempty :: a;
type Mappend (arg :: a) (arg1 :: a) :: a;
type Mconcat (arg :: [a]) :: a;
type Mappend arg :: a arg1 :: a = Mappend_6989586621679860753 arg arg1;
type Mconcat arg :: [a] = Mconcat_6989586621679860767 arg;
}
class SSemigroup a => SMonoid a
sMempty :: SMonoid a => Sing (Mempty :: a)
sMappend :: forall (t1 :: a) (t2 :: a). SMonoid a => Sing t1 -> Sing t2 -> Sing (Mappend t1 t2)
($dmsMappend) :: forall (t1 :: a) (t2 :: a). (SMonoid a, Mappend t1 t2 ~ Mappend_6989586621679860753 t1 t2) => Sing t1 -> Sing t2 -> Sing (Mappend t1 t2)
sMconcat :: forall (t :: [a]). SMonoid a => Sing t -> Sing (Mconcat t)
($dmsMconcat) :: forall (t :: [a]). (SMonoid a, Mconcat t ~ Mconcat_6989586621679860767 t) => Sing t -> Sing (Mconcat t)
class PTraversable (t :: Type -> Type) where {
type Traverse (arg :: a ~> f b) (arg1 :: t a) :: f t b;
type SequenceA (arg :: t f a) :: f t a;
type MapM (arg :: a ~> m b) (arg1 :: t a) :: m t b;
type Sequence (arg :: t m a) :: m t a;
type Traverse arg :: a ~> f b arg1 :: t a = Traverse_6989586621680096875 arg arg1;
type SequenceA arg :: t f a = SequenceA_6989586621680096887 arg;
type MapM arg :: a ~> m b arg1 :: t a = MapM_6989586621680096897 arg arg1;
type Sequence arg :: t m a = Sequence_6989586621680096911 arg;
}
class (SFunctor t, SFoldable t) => STraversable (t :: Type -> Type)
sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: t a). (STraversable t, SApplicative f) => Sing t1 -> Sing t2 -> Sing (Traverse t1 t2)
($dmsTraverse) :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: t a). (STraversable t, Traverse t1 t2 ~ Traverse_6989586621680096875 t1 t2, SApplicative f) => Sing t1 -> Sing t2 -> Sing (Traverse t1 t2)
sSequenceA :: forall (f :: Type -> Type) a (t1 :: t (f a)). (STraversable t, SApplicative f) => Sing t1 -> Sing (SequenceA t1)
($dmsSequenceA) :: forall (f :: Type -> Type) a (t1 :: t (f a)). (STraversable t, SequenceA t1 ~ SequenceA_6989586621680096887 t1, SApplicative f) => Sing t1 -> Sing (SequenceA t1)
sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: t a). (STraversable t, SMonad m) => Sing t1 -> Sing t2 -> Sing (MapM t1 t2)
($dmsMapM) :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: t a). (STraversable t, MapM t1 t2 ~ MapM_6989586621680096897 t1 t2, SMonad m) => Sing t1 -> Sing t2 -> Sing (MapM t1 t2)
sSequence :: forall (m :: Type -> Type) a (t1 :: t (m a)). (STraversable t, SMonad m) => Sing t1 -> Sing (Sequence t1)
($dmsSequence) :: forall (m :: Type -> Type) a (t1 :: t (m a)). (STraversable t, Sequence t1 ~ Sequence_6989586621680096911 t1, SMonad m) => Sing t1 -> Sing (Sequence t1)
class PApplicative (f :: Type -> Type) where {
type Pure (arg :: a) :: f a;
type (arg :: f a ~> b) <*> (arg1 :: f a) :: f b;
type LiftA2 (arg :: a ~> b ~> c) (arg1 :: f a) (arg2 :: f b) :: f c;
type (arg :: f a) *> (arg1 :: f b) :: f b;
type (arg :: f a) <* (arg1 :: f b) :: f a;
type arg :: f a ~> b <*> arg1 :: f a = TFHelper_6989586621679271276 arg arg1;
type LiftA2 arg :: a ~> b ~> c arg1 :: f a arg2 :: f b = LiftA2_6989586621679271292 arg arg1 arg2;
type arg :: f a *> arg1 :: f b = TFHelper_6989586621679271308 arg arg1;
type arg :: f a <* arg1 :: f b = TFHelper_6989586621679271319 arg arg1;
}
infixl 4 <*>
infixl 4 *>
infixl 4 <*
class SFunctor f => SApplicative (f :: Type -> Type)
sPure :: forall a (t :: a). SApplicative f => Sing t -> Sing (Pure t :: f a)
(%<*>) :: forall a b (t1 :: f (a ~> b)) (t2 :: f a). SApplicative f => Sing t1 -> Sing t2 -> Sing (t1 <*> t2)
($dm%<*>) :: forall a b (t1 :: f (a ~> b)) (t2 :: f a). (SApplicative f, (t1 <*> t2) ~ TFHelper_6989586621679271276 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 <*> t2)
sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: f a) (t3 :: f b). SApplicative f => Sing t1 -> Sing t2 -> Sing t3 -> Sing (LiftA2 t1 t2 t3)
($dmsLiftA2) :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: f a) (t3 :: f b). (SApplicative f, LiftA2 t1 t2 t3 ~ LiftA2_6989586621679271292 t1 t2 t3) => Sing t1 -> Sing t2 -> Sing t3 -> Sing (LiftA2 t1 t2 t3)
(%*>) :: forall a b (t1 :: f a) (t2 :: f b). SApplicative f => Sing t1 -> Sing t2 -> Sing (t1 *> t2)
($dm%*>) :: forall a b (t1 :: f a) (t2 :: f b). (SApplicative f, (t1 *> t2) ~ TFHelper_6989586621679271308 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 *> t2)
(%<*) :: forall a b (t1 :: f a) (t2 :: f b). SApplicative f => Sing t1 -> Sing t2 -> Sing (t1 <* t2)
($dm%<*) :: forall a b (t1 :: f a) (t2 :: f b). (SApplicative f, (t1 <* t2) ~ TFHelper_6989586621679271319 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 <* t2)
infixl 4 %<*>
infixl 4 %*>
infixl 4 %<*
type family ( (a1 :: b ~> c) . (a2 :: a ~> b) ) (a3 :: a) :: c
infixr 9 .
(%.) :: forall b c a (t1 :: b ~> c) (t2 :: a ~> b) (t3 :: a). Sing t1 -> Sing t2 -> Sing t3 -> Sing ((t1 . t2) t3)
infixr 9 %.
-- | A promoted version of error. This implements Error as a
-- stuck type family with a Symbol argument. Depending on your
-- needs, you might also consider the following alternatives:
--
--
-- - Data.Singletons.Base.PolyError provides PolyError,
-- which generalizes the argument to be kind-polymorphic. This allows
-- passing additional information to the error besides raw
-- Symbols.
-- - Data.Singletons.Base.TypeError provides TypeError,
-- a slightly modified version of the custom type error machinery found
-- in GHC.TypeLits. This allows emitting error messages as
-- compiler errors rather than as stuck type families.
--
type family Error (str :: Symbol) :: a
-- | The singleton for error.
sError :: forall a (str :: Symbol). HasCallStack => Sing str -> Sing (Error str :: a)
data ErrorSym0 (a1 :: TyFun Symbol a)
type family ErrorSym1 (a6989586621679368947 :: Symbol) :: a
-- | The promotion of undefined.
type family Undefined :: forall a. () => a
-- | The singleton for undefined.
sUndefined :: HasCallStack => Sing Undefined
type family UndefinedSym0 :: a
type family TrueSym0 :: Bool
type family FalseSym0 :: Bool
data (a1 :: TyFun a a ~> Bool) ==@#@$
infix 4 ==@#@$
data (a6989586621679128025 :: a) ==@#@$$ (b :: TyFun a Bool)
infix 4 ==@#@$$
type family (a6989586621679128025 :: a) ==@#@$$$ (a6989586621679128026 :: a) :: Bool
infix 4 ==@#@$$$
data (a1 :: TyFun a a ~> Bool) >@#@$
infix 4 >@#@$
data (a6989586621679189981 :: a) >@#@$$ (b :: TyFun a Bool)
infix 4 >@#@$$
type family (a6989586621679189981 :: a) >@#@$$$ (a6989586621679189982 :: a) :: Bool
infix 4 >@#@$$$
data IfSym0 (a :: TyFun Bool k ~> k ~> k)
data IfSym1 (a6989586621679124436 :: Bool) (b :: TyFun k k ~> k)
data IfSym2 (a6989586621679124436 :: Bool) (a6989586621679124437 :: k) (c :: TyFun k k)
type family IfSym3 (a6989586621679124436 :: Bool) (a6989586621679124437 :: k) (a6989586621679124438 :: k) :: k
data (a :: TyFun Bool Bool ~> Bool) &&@#@$
infixr 3 &&@#@$
data (a6989586621679123502 :: Bool) &&@#@$$ (b :: TyFun Bool Bool)
infixr 3 &&@#@$$
type family (a6989586621679123502 :: Bool) &&@#@$$$ (a6989586621679123503 :: Bool) :: Bool
infixr 3 &&@#@$$$
type family LTSym0 :: Ordering
type family EQSym0 :: Ordering
type family GTSym0 :: Ordering
type family Tuple0Sym0 :: ()
data Tuple2Sym0 (a1 :: TyFun a b ~> (a, b))
data Tuple2Sym1 (a6989586621679050782 :: a) (b1 :: TyFun b (a, b))
type family Tuple2Sym2 (a6989586621679050782 :: a) (a6989586621679050783 :: b) :: (a, b)
data Tuple3Sym0 (a1 :: TyFun a b ~> c ~> (a, b, c))
data Tuple3Sym1 (a6989586621679050813 :: a) (b1 :: TyFun b c ~> (a, b, c))
data Tuple3Sym2 (a6989586621679050813 :: a) (a6989586621679050814 :: b) (c1 :: TyFun c (a, b, c))
type family Tuple3Sym3 (a6989586621679050813 :: a) (a6989586621679050814 :: b) (a6989586621679050815 :: c) :: (a, b, c)
data Tuple4Sym0 (a1 :: TyFun a b ~> c ~> d ~> (a, b, c, d))
data Tuple4Sym1 (a6989586621679050862 :: a) (b1 :: TyFun b c ~> d ~> (a, b, c, d))
data Tuple4Sym2 (a6989586621679050862 :: a) (a6989586621679050863 :: b) (c1 :: TyFun c d ~> (a, b, c, d))
data Tuple4Sym3 (a6989586621679050862 :: a) (a6989586621679050863 :: b) (a6989586621679050864 :: c) (d1 :: TyFun d (a, b, c, d))
type family Tuple4Sym4 (a6989586621679050862 :: a) (a6989586621679050863 :: b) (a6989586621679050864 :: c) (a6989586621679050865 :: d) :: (a, b, c, d)
data Tuple5Sym0 (a1 :: TyFun a b ~> c ~> d ~> e ~> (a, b, c, d, e))
data Tuple5Sym1 (a6989586621679050931 :: a) (b1 :: TyFun b c ~> d ~> e ~> (a, b, c, d, e))
data Tuple5Sym2 (a6989586621679050931 :: a) (a6989586621679050932 :: b) (c1 :: TyFun c d ~> e ~> (a, b, c, d, e))
data Tuple5Sym3 (a6989586621679050931 :: a) (a6989586621679050932 :: b) (a6989586621679050933 :: c) (d1 :: TyFun d e ~> (a, b, c, d, e))
data Tuple5Sym4 (a6989586621679050931 :: a) (a6989586621679050932 :: b) (a6989586621679050933 :: c) (a6989586621679050934 :: d) (e1 :: TyFun e (a, b, c, d, e))
type family Tuple5Sym5 (a6989586621679050931 :: a) (a6989586621679050932 :: b) (a6989586621679050933 :: c) (a6989586621679050934 :: d) (a6989586621679050935 :: e) :: (a, b, c, d, e)
data Tuple6Sym0 (a1 :: TyFun a b ~> c ~> d ~> e ~> f ~> (a, b, c, d, e, f))
data Tuple6Sym1 (a6989586621679051022 :: a) (b1 :: TyFun b c ~> d ~> e ~> f ~> (a, b, c, d, e, f))
data Tuple6Sym2 (a6989586621679051022 :: a) (a6989586621679051023 :: b) (c1 :: TyFun c d ~> e ~> f ~> (a, b, c, d, e, f))
data Tuple6Sym3 (a6989586621679051022 :: a) (a6989586621679051023 :: b) (a6989586621679051024 :: c) (d1 :: TyFun d e ~> f ~> (a, b, c, d, e, f))
data Tuple6Sym4 (a6989586621679051022 :: a) (a6989586621679051023 :: b) (a6989586621679051024 :: c) (a6989586621679051025 :: d) (e1 :: TyFun e f ~> (a, b, c, d, e, f))
data Tuple6Sym5 (a6989586621679051022 :: a) (a6989586621679051023 :: b) (a6989586621679051024 :: c) (a6989586621679051025 :: d) (a6989586621679051026 :: e) (f1 :: TyFun f (a, b, c, d, e, f))
type family Tuple6Sym6 (a6989586621679051022 :: a) (a6989586621679051023 :: b) (a6989586621679051024 :: c) (a6989586621679051025 :: d) (a6989586621679051026 :: e) (a6989586621679051027 :: f) :: (a, b, c, d, e, f)
data Tuple7Sym0 (a1 :: TyFun a b ~> c ~> d ~> e ~> f ~> g ~> (a, b, c, d, e, f, g))
data Tuple7Sym1 (a6989586621679051137 :: a) (b1 :: TyFun b c ~> d ~> e ~> f ~> g ~> (a, b, c, d, e, f, g))
data Tuple7Sym2 (a6989586621679051137 :: a) (a6989586621679051138 :: b) (c1 :: TyFun c d ~> e ~> f ~> g ~> (a, b, c, d, e, f, g))
data Tuple7Sym3 (a6989586621679051137 :: a) (a6989586621679051138 :: b) (a6989586621679051139 :: c) (d1 :: TyFun d e ~> f ~> g ~> (a, b, c, d, e, f, g))
data Tuple7Sym4 (a6989586621679051137 :: a) (a6989586621679051138 :: b) (a6989586621679051139 :: c) (a6989586621679051140 :: d) (e1 :: TyFun e f ~> g ~> (a, b, c, d, e, f, g))
data Tuple7Sym5 (a6989586621679051137 :: a) (a6989586621679051138 :: b) (a6989586621679051139 :: c) (a6989586621679051140 :: d) (a6989586621679051141 :: e) (f1 :: TyFun f g ~> (a, b, c, d, e, f, g))
data Tuple7Sym6 (a6989586621679051137 :: a) (a6989586621679051138 :: b) (a6989586621679051139 :: c) (a6989586621679051140 :: d) (a6989586621679051141 :: e) (a6989586621679051142 :: f) (g1 :: TyFun g (a, b, c, d, e, f, g))
type family Tuple7Sym7 (a6989586621679051137 :: a) (a6989586621679051138 :: b) (a6989586621679051139 :: c) (a6989586621679051140 :: d) (a6989586621679051141 :: e) (a6989586621679051142 :: f) (a6989586621679051143 :: g) :: (a, b, c, d, e, f, g)
data CompareSym0 (a1 :: TyFun a a ~> Ordering)
data CompareSym1 (a6989586621679189966 :: a) (b :: TyFun a Ordering)
type family CompareSym2 (a6989586621679189966 :: a) (a6989586621679189967 :: a) :: Ordering
data FoldlSym0 (a1 :: TyFun b ~> a ~> b b ~> t a ~> b)
data FoldlSym1 (a6989586621679922535 :: b ~> a ~> b) (b1 :: TyFun b t a ~> b)
data FoldlSym2 (a6989586621679922535 :: b ~> a ~> b) (a6989586621679922536 :: b) (c :: TyFun t a b)
type family FoldlSym3 (a6989586621679922535 :: b ~> a ~> b) (a6989586621679922536 :: b) (a6989586621679922537 :: t a) :: b
type family MinBoundSym0 :: a
type family MaxBoundSym0 :: a
data ShowsPrecSym0 (a1 :: TyFun Natural a ~> Symbol ~> Symbol)
data ShowsPrecSym1 (a6989586621679807409 :: Natural) (b :: TyFun a Symbol ~> Symbol)
data ShowsPrecSym2 (a6989586621679807409 :: Natural) (a6989586621679807410 :: a) (c :: TyFun Symbol Symbol)
type family ShowsPrecSym3 (a6989586621679807409 :: Natural) (a6989586621679807410 :: a) (a6989586621679807411 :: Symbol) :: Symbol
data ShowStringSym0 (a :: TyFun Symbol Symbol ~> Symbol)
data ShowStringSym1 (a6989586621679807364 :: Symbol) (b :: TyFun Symbol Symbol)
type family ShowStringSym2 (a6989586621679807364 :: Symbol) (a6989586621679807365 :: Symbol) :: Symbol
data ShowParenSym0 (a :: TyFun Bool Symbol ~> Symbol ~> Symbol ~> Symbol)
data ShowParenSym1 (a6989586621679807346 :: Bool) (b :: TyFun Symbol ~> Symbol Symbol ~> Symbol)
data ShowParenSym2 (a6989586621679807346 :: Bool) (a6989586621679807347 :: Symbol ~> Symbol) (c :: TyFun Symbol Symbol)
data ShowSpaceSym0 (a :: TyFun Symbol Symbol)
type family ShowSpaceSym1 (a6989586621679807332 :: Symbol) :: Symbol
data ShowCharSym0 (a :: TyFun Char Symbol ~> Symbol)
data ShowCharSym1 (a6989586621679807375 :: Char) (b :: TyFun Symbol Symbol)
type family ShowCharSym2 (a6989586621679807375 :: Char) (a6989586621679807376 :: Symbol) :: Symbol
data ShowCommaSpaceSym0 (a :: TyFun Symbol Symbol)
type family ShowCommaSpaceSym1 (a6989586621679807326 :: Symbol) :: Symbol
data FromIntegerSym0 (a1 :: TyFun Natural a)
type family FromIntegerSym1 (a6989586621679398591 :: Natural) :: a
data NegateSym0 (a1 :: TyFun a a)
type family NegateSym1 (a6989586621679398582 :: a) :: a
data FromStringSym0 (a1 :: TyFun Symbol a)
type family FromStringSym1 (a6989586621680338575 :: Symbol) :: a
data FmapSym0 (a1 :: TyFun a ~> b f a ~> f b)
data FmapSym1 (a6989586621679271227 :: a ~> b) (b1 :: TyFun f a f b)
type family FmapSym2 (a6989586621679271227 :: a ~> b) (a6989586621679271228 :: f a) :: f b
data (a1 :: TyFun a f b ~> f a) <$@#@$
infixl 4 <$@#@$
data (a6989586621679271232 :: a) <$@#@$$ (b1 :: TyFun f b f a)
infixl 4 <$@#@$$
type family (a6989586621679271232 :: a) <$@#@$$$ (a6989586621679271233 :: f b) :: f a
infixl 4 <$@#@$$$
data FoldMapSym0 (a1 :: TyFun a ~> m t a ~> m)
data FoldMapSym1 (a6989586621679922515 :: a ~> m) (b :: TyFun t a m)
type family FoldMapSym2 (a6989586621679922515 :: a ~> m) (a6989586621679922516 :: t a) :: m
data (a1 :: TyFun a a ~> a) <>@#@$
infixr 6 <>@#@$
data (a6989586621679173979 :: a) <>@#@$$ (b :: TyFun a a)
infixr 6 <>@#@$$
type family (a6989586621679173979 :: a) <>@#@$$$ (a6989586621679173980 :: a) :: a
infixr 6 <>@#@$$$
type family MemptySym0 :: a
data MappendSym0 (a1 :: TyFun a a ~> a)
data MappendSym1 (a6989586621679860746 :: a) (b :: TyFun a a)
type family MappendSym2 (a6989586621679860746 :: a) (a6989586621679860747 :: a) :: a
data FoldrSym0 (a1 :: TyFun a ~> b ~> b b ~> t a ~> b)
data FoldrSym1 (a6989586621679922521 :: a ~> b ~> b) (b1 :: TyFun b t a ~> b)
data FoldrSym2 (a6989586621679922521 :: a ~> b ~> b) (a6989586621679922522 :: b) (c :: TyFun t a b)
type family FoldrSym3 (a6989586621679922521 :: a ~> b ~> b) (a6989586621679922522 :: b) (a6989586621679922523 :: t a) :: b
data TraverseSym0 (a1 :: TyFun a ~> f b t a ~> f t b)
data TraverseSym1 (a6989586621680096860 :: a ~> f b) (b1 :: TyFun t a f t b)
type family TraverseSym2 (a6989586621680096860 :: a ~> f b) (a6989586621680096861 :: t a) :: f t b
data PureSym0 (a1 :: TyFun a f a)
type family PureSym1 (a6989586621679271251 :: a) :: f a
data (a1 :: TyFun f a ~> b f a ~> f b) <*>@#@$
infixl 4 <*>@#@$
data (a6989586621679271255 :: f a ~> b) <*>@#@$$ (b1 :: TyFun f a f b)
infixl 4 <*>@#@$$
type family (a6989586621679271255 :: f a ~> b) <*>@#@$$$ (a6989586621679271256 :: f a) :: f b
infixl 4 <*>@#@$$$
data LiftA2Sym0 (a1 :: TyFun a ~> b ~> c f a ~> f b ~> f c)
data LiftA2Sym1 (a6989586621679271261 :: a ~> b ~> c) (b1 :: TyFun f a f b ~> f c)
data LiftA2Sym2 (a6989586621679271261 :: a ~> b ~> c) (a6989586621679271262 :: f a) (c1 :: TyFun f b f c)
type family LiftA2Sym3 (a6989586621679271261 :: a ~> b ~> c) (a6989586621679271262 :: f a) (a6989586621679271263 :: f b) :: f c
data (a1 :: TyFun b ~> c a ~> b ~> a ~> c) .@#@$
infixr 9 .@#@$
data (a6989586621679154339 :: b ~> c) .@#@$$ (b1 :: TyFun a ~> b a ~> c)
infixr 9 .@#@$$
data ( (a6989586621679154339 :: b ~> c) .@#@$$$ (a6989586621679154340 :: a ~> b) ) (c1 :: TyFun a c)
infixr 9 .@#@$$$
type family ( (a6989586621679154339 :: b ~> c) .@#@$$$$ (a6989586621679154340 :: a ~> b) ) (a6989586621679154341 :: a) :: c
infixr 9 .@#@$$$$
type family NilSym0 :: [a]
data (a1 :: TyFun a [a] ~> [a]) :@#@$
infixr 5 :@#@$
data (a6989586621679050289 :: a) :@#@$$ (b :: TyFun [a] [a])
infixr 5 :@#@$$
type family (a6989586621679050289 :: a) :@#@$$$ (a6989586621679050290 :: [a]) :: [a]
infixr 5 :@#@$$$
class SuppressUnusedWarnings (t :: k)
suppressUnusedWarnings :: SuppressUnusedWarnings t => ()
-- | This file implements singletonStar, which generates a datatype
-- Rep and associated singleton from a list of types. The
-- promoted version of Rep is kind * and the Haskell
-- types themselves. This is still very experimental, so expect unusual
-- results!
--
-- See also Data.Singletons.TH.CustomStar from
-- singletons-th, a more minimal version of this module that
-- does not re-export anything from Prelude.Singletons.
module Data.Singletons.Base.CustomStar
singletonStar :: OptionsMonad q => [Name] -> q [Dec]
-- | Exports the promoted and singled versions of the Compose data
-- type.
module Data.Functor.Compose.Singletons
type family Sing :: k -> Type
data SCompose (a1 :: Compose f g a)
[SCompose] :: forall {k} {k1} (f :: k -> Type) (g :: k1 -> k) (a :: k1) (n :: f (g a)). Sing n -> SCompose ('Compose n)
infixr 9 `SCompose`
type family GetCompose (a1 :: Compose f g a) :: f g a
sGetCompose :: forall {k} {k1} (f :: k -> Type) (g :: k1 -> k) (a :: k1) (t :: Compose f g a). Sing t -> Sing (GetCompose t)
data ComposeSym0 (a1 :: TyFun f g a Compose f g a)
infixr 9 `ComposeSym0`
type family ComposeSym1 (a6989586621680345043 :: f g a) :: Compose f g a
infixr 9 `ComposeSym1`
data GetComposeSym0 (a1 :: TyFun Compose f g a f g a)
type family GetComposeSym1 (a6989586621680345046 :: Compose f g a) :: f g a
instance forall k k1 (f :: k -> *) (g :: k1 -> k) (a :: k1) (z :: Data.Functor.Compose.Compose f g a). GHC.Classes.Eq (Data.Functor.Compose.Singletons.SCompose z)
instance forall k k1 (f :: k -> *) (g :: k1 -> k) (a :: k1) (z :: Data.Functor.Compose.Compose f g a). GHC.Classes.Ord (Data.Functor.Compose.Singletons.SCompose z)
instance Control.Monad.Singletons.Internal.PAlternative (Data.Functor.Compose.Compose f g)
instance Control.Monad.Singletons.Internal.PApplicative (Data.Functor.Compose.Compose f g)
instance forall k k1 (f :: k -> *) (g :: k1 -> k) (a :: k1). Data.Eq.Singletons.PEq (Data.Functor.Compose.Compose f g a)
instance Data.Foldable.Singletons.PFoldable (Data.Functor.Compose.Compose f g)
instance Control.Monad.Singletons.Internal.PFunctor (Data.Functor.Compose.Compose f g)
instance forall k k1 (f :: k -> *) (g :: k1 -> k) (a :: k1). Data.Ord.Singletons.POrd (Data.Functor.Compose.Compose f g a)
instance Data.Traversable.Singletons.PTraversable (Data.Functor.Compose.Compose f g)
instance (Control.Monad.Singletons.Internal.SAlternative f, Control.Monad.Singletons.Internal.SApplicative g) => Control.Monad.Singletons.Internal.SAlternative (Data.Functor.Compose.Compose f g)
instance (Control.Monad.Singletons.Internal.SApplicative f, Control.Monad.Singletons.Internal.SApplicative g) => Control.Monad.Singletons.Internal.SApplicative (Data.Functor.Compose.Compose f g)
instance forall k k1 (f :: k -> *) (g :: k1 -> k) (a :: k1). Data.Singletons.Decide.SDecide (f (g a)) => Data.Singletons.Decide.SDecide (Data.Functor.Compose.Compose f g a)
instance forall k k1 (f :: k -> *) (g :: k1 -> k) (a :: k1). Data.Eq.Singletons.SEq (f (g a)) => Data.Eq.Singletons.SEq (Data.Functor.Compose.Compose f g a)
instance (Data.Foldable.Singletons.SFoldable f, Data.Foldable.Singletons.SFoldable g) => Data.Foldable.Singletons.SFoldable (Data.Functor.Compose.Compose f g)
instance (Control.Monad.Singletons.Internal.SFunctor f, Control.Monad.Singletons.Internal.SFunctor g) => Control.Monad.Singletons.Internal.SFunctor (Data.Functor.Compose.Compose f g)
instance forall k k1 (f :: k -> *) (g :: k1 -> k) (a :: k1). Data.Ord.Singletons.SOrd (f (g a)) => Data.Ord.Singletons.SOrd (Data.Functor.Compose.Compose f g a)
instance (Data.Traversable.Singletons.STraversable f, Data.Traversable.Singletons.STraversable g) => Data.Traversable.Singletons.STraversable (Data.Functor.Compose.Compose f g)
instance forall k (f :: k -> *) k1 (g :: k1 -> k) (a :: k1). Data.Singletons.SingI1 'Data.Functor.Compose.Compose
instance forall k k1 (f :: k -> *) (g :: k1 -> k) (a :: k1) (n :: f (g a)). Data.Singletons.SingI n => Data.Singletons.SingI ('Data.Functor.Compose.Compose n)
instance forall k k1 (f :: k -> *) (g :: k1 -> k) (a :: k1). Data.Singletons.SingI Data.Functor.Compose.Singletons.ComposeSym0
instance forall k k1 (f :: k -> *) (g :: k1 -> k) (a :: k1). Data.Singletons.SingI Data.Functor.Compose.Singletons.GetComposeSym0
instance forall k (f :: k -> *) k1 (g :: k1 -> k) (a :: k1). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Functor.Compose.Singletons.ComposeSym0
instance forall k k1 (f :: k -> *) (g :: k1 -> k) (a :: k1). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Functor.Compose.Singletons.GetComposeSym0
instance forall k k1 (f :: k -> *) (g :: k1 -> k) (a :: k1). Data.Singletons.Decide.SDecide (f (g a)) => GHC.Internal.Data.Type.Coercion.TestCoercion Data.Functor.Compose.Singletons.SCompose
instance forall k k1 (f :: k -> *) (g :: k1 -> k) (a :: k1). Data.Singletons.Decide.SDecide (f (g a)) => GHC.Internal.Data.Type.Equality.TestEquality Data.Functor.Compose.Singletons.SCompose
-- | Defines the promoted and singled versions of the Monad type
-- class.
module Control.Monad.Singletons
class PFunctor (f :: Type -> Type) where {
type Fmap (arg :: a ~> b) (arg1 :: f a) :: f b;
type arg :: a <$ arg1 :: f b = TFHelper_6989586621679271236 arg arg1;
}
class SFunctor (f :: Type -> Type)
sFmap :: forall a b (t1 :: a ~> b) (t2 :: f a). SFunctor f => Sing t1 -> Sing t2 -> Sing (Fmap t1 t2)
class PMonad (m :: Type -> Type) where {
type (arg :: m a) >>= (arg1 :: a ~> m b) :: m b;
type (arg :: m a) >> (arg1 :: m b) :: m b;
type Return (arg :: a) :: m a;
type arg :: m a >> arg1 :: m b = TFHelper_6989586621679271347 arg arg1;
type Return arg :: a = Return_6989586621679271362 arg :: m a;
}
infixl 1 >>=
infixl 1 >>
class SApplicative m => SMonad (m :: Type -> Type)
(%>>=) :: forall a b (t1 :: m a) (t2 :: a ~> m b). SMonad m => Sing t1 -> Sing t2 -> Sing (t1 >>= t2)
(%>>) :: forall a b (t1 :: m a) (t2 :: m b). SMonad m => Sing t1 -> Sing t2 -> Sing (t1 >> t2)
($dm%>>) :: forall a b (t1 :: m a) (t2 :: m b). (SMonad m, (t1 >> t2) ~ TFHelper_6989586621679271347 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 >> t2)
sReturn :: forall a (t :: a). SMonad m => Sing t -> Sing (Return t :: m a)
($dmsReturn) :: forall a (t :: a). (SMonad m, (Return t :: m a) ~ (Return_6989586621679271362 t :: m a)) => Sing t -> Sing (Return t :: m a)
infixl 1 %>>=
infixl 1 %>>
class PMonadPlus (m :: Type -> Type) where {
type Mzero :: m a;
type Mplus (arg :: m a) (arg1 :: m a) :: m a;
type Mzero = Mzero_6989586621679271382 :: m a;
type Mplus arg :: m a arg1 :: m a = Mplus_6989586621679271387 arg arg1;
}
class (SAlternative m, SMonad m) => SMonadPlus (m :: Type -> Type)
sMzero :: SMonadPlus m => Sing (Mzero :: m a)
($dmsMzero) :: (SMonadPlus m, (Mzero :: m a) ~ (Mzero_6989586621679271382 :: m a)) => Sing (Mzero :: m a)
sMplus :: forall a (t1 :: m a) (t2 :: m a). SMonadPlus m => Sing t1 -> Sing t2 -> Sing (Mplus t1 t2)
($dmsMplus) :: forall a (t1 :: m a) (t2 :: m a). (SMonadPlus m, Mplus t1 t2 ~ Mplus_6989586621679271387 t1 t2) => Sing t1 -> Sing t2 -> Sing (Mplus t1 t2)
class PMonadFail (m :: Type -> Type) where {
type Fail (arg :: [Char]) :: m a;
}
class SMonad m => SMonadFail (m :: Type -> Type)
sFail :: forall a (t :: [Char]). SMonadFail m => Sing t -> Sing (Fail t :: m a)
type family MapM (arg :: a ~> m b) (arg1 :: t a) :: m t b
sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: t a). (STraversable t, SMonad m) => Sing t1 -> Sing t2 -> Sing (MapM t1 t2)
type family MapM_ (a1 :: a ~> m b) (a2 :: t a) :: m ()
sMapM_ :: forall a (m :: Type -> Type) b (t1 :: Type -> Type) (t2 :: a ~> m b) (t3 :: t1 a). (SFoldable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing (MapM_ t2 t3)
type family ForM (a1 :: t a) (a2 :: a ~> m b) :: m t b
sForM :: forall (t1 :: Type -> Type) a (m :: Type -> Type) b (t2 :: t1 a) (t3 :: a ~> m b). (STraversable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing (ForM t2 t3)
type family Sequence (arg :: t m a) :: m t a
sSequence :: forall (m :: Type -> Type) a (t1 :: t (m a)). (STraversable t, SMonad m) => Sing t1 -> Sing (Sequence t1)
type family Sequence_ (a1 :: t m a) :: m ()
sSequence_ :: forall (t1 :: Type -> Type) (m :: Type -> Type) a (t2 :: t1 (m a)). (SFoldable t1, SMonad m) => Sing t2 -> Sing (Sequence_ t2)
type family (a1 :: a ~> m b) =<< (a2 :: m a) :: m b
infixr 1 =<<
(%=<<) :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: m a). SMonad m => Sing t1 -> Sing t2 -> Sing (t1 =<< t2)
infixr 1 %=<<
type family ( (a1 :: a ~> m b) >=> (a2 :: b ~> m c) ) (a3 :: a) :: m c
infixr 1 >=>
(%>=>) :: forall a (m :: Type -> Type) b c (t1 :: a ~> m b) (t2 :: b ~> m c) (t3 :: a). SMonad m => Sing t1 -> Sing t2 -> Sing t3 -> Sing ((t1 >=> t2) t3)
infixr 1 %>=>
type family ( (a1 :: b ~> m c) <=< (a2 :: a ~> m b) ) (a3 :: a) :: m c
infixr 1 <=<
(%<=<) :: forall b (m :: Type -> Type) c a (t1 :: b ~> m c) (t2 :: a ~> m b) (t3 :: a). SMonad m => Sing t1 -> Sing t2 -> Sing t3 -> Sing ((t1 <=< t2) t3)
infixr 1 %<=<
type family Void (a1 :: f a) :: f ()
sVoid :: forall (f :: Type -> Type) a (t :: f a). SFunctor f => Sing t -> Sing (Void t)
type family Join (a1 :: m m a) :: m a
sJoin :: forall (m :: Type -> Type) a (t :: m (m a)). SMonad m => Sing t -> Sing (Join t)
type family Msum (a1 :: t m a) :: m a
sMsum :: forall (t1 :: Type -> Type) (m :: Type -> Type) a (t2 :: t1 (m a)). (SFoldable t1, SMonadPlus m) => Sing t2 -> Sing (Msum t2)
type family Mfilter (a1 :: a ~> Bool) (a2 :: m a) :: m a
sMfilter :: forall a (m :: Type -> Type) (t1 :: a ~> Bool) (t2 :: m a). SMonadPlus m => Sing t1 -> Sing t2 -> Sing (Mfilter t1 t2)
type family FilterM (a1 :: a ~> m Bool) (a2 :: [a]) :: m [a]
sFilterM :: forall a (m :: Type -> Type) (t1 :: a ~> m Bool) (t2 :: [a]). SApplicative m => Sing t1 -> Sing t2 -> Sing (FilterM t1 t2)
type family MapAndUnzipM (a1 :: a ~> m (b, c)) (a2 :: [a]) :: m ([b], [c])
sMapAndUnzipM :: forall a (m :: Type -> Type) b c (t1 :: a ~> m (b, c)) (t2 :: [a]). SApplicative m => Sing t1 -> Sing t2 -> Sing (MapAndUnzipM t1 t2)
type family ZipWithM (a1 :: a ~> b ~> m c) (a2 :: [a]) (a3 :: [b]) :: m [c]
sZipWithM :: forall a b (m :: Type -> Type) c (t1 :: a ~> (b ~> m c)) (t2 :: [a]) (t3 :: [b]). SApplicative m => Sing t1 -> Sing t2 -> Sing t3 -> Sing (ZipWithM t1 t2 t3)
type family ZipWithM_ (a1 :: a ~> b ~> m c) (a2 :: [a]) (a3 :: [b]) :: m ()
sZipWithM_ :: forall a b (m :: Type -> Type) c (t1 :: a ~> (b ~> m c)) (t2 :: [a]) (t3 :: [b]). SApplicative m => Sing t1 -> Sing t2 -> Sing t3 -> Sing (ZipWithM_ t1 t2 t3)
type family FoldlM (a1 :: b ~> a ~> m b) (a2 :: b) (a3 :: t a) :: m b
sFoldlM :: forall b a (m :: Type -> Type) (t1 :: Type -> Type) (t2 :: b ~> (a ~> m b)) (t3 :: b) (t4 :: t1 a). (SFoldable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing t4 -> Sing (FoldlM t2 t3 t4)
type family ReplicateM (a1 :: Natural) (a2 :: m a) :: m [a]
sReplicateM :: forall (m :: Type -> Type) a (t1 :: Natural) (t2 :: m a). SApplicative m => Sing t1 -> Sing t2 -> Sing (ReplicateM t1 t2)
type family ReplicateM_ (a1 :: Natural) (a2 :: m a) :: m ()
sReplicateM_ :: forall (m :: Type -> Type) a (t1 :: Natural) (t2 :: m a). SApplicative m => Sing t1 -> Sing t2 -> Sing (ReplicateM_ t1 t2)
type family Guard (a :: Bool) :: f ()
sGuard :: forall (f :: Type -> Type) (t :: Bool). SAlternative f => Sing t -> Sing (Guard t :: f ())
type family When (a :: Bool) (a1 :: f ()) :: f ()
sWhen :: forall (f :: Type -> Type) (t1 :: Bool) (t2 :: f ()). SApplicative f => Sing t1 -> Sing t2 -> Sing (When t1 t2)
type family Unless (a :: Bool) (a1 :: f ()) :: f ()
sUnless :: forall (f :: Type -> Type) (t1 :: Bool) (t2 :: f ()). SApplicative f => Sing t1 -> Sing t2 -> Sing (Unless t1 t2)
type family LiftM (a :: a1 ~> r) (a2 :: m a1) :: m r
sLiftM :: forall a1 r (m :: Type -> Type) (t1 :: a1 ~> r) (t2 :: m a1). SMonad m => Sing t1 -> Sing t2 -> Sing (LiftM t1 t2)
type family LiftM2 (a :: a1 ~> a2 ~> r) (a4 :: m a1) (a5 :: m a2) :: m r
sLiftM2 :: forall a1 a2 r (m :: Type -> Type) (t1 :: a1 ~> (a2 ~> r)) (t2 :: m a1) (t3 :: m a2). SMonad m => Sing t1 -> Sing t2 -> Sing t3 -> Sing (LiftM2 t1 t2 t3)
type family LiftM3 (a :: a1 ~> a2 ~> a3 ~> r) (a4 :: m a1) (a5 :: m a2) (a6 :: m a3) :: m r
sLiftM3 :: forall a1 a2 a3 r (m :: Type -> Type) (t1 :: a1 ~> (a2 ~> (a3 ~> r))) (t2 :: m a1) (t3 :: m a2) (t4 :: m a3). SMonad m => Sing t1 -> Sing t2 -> Sing t3 -> Sing t4 -> Sing (LiftM3 t1 t2 t3 t4)
type family LiftM4 (a :: a1 ~> a2 ~> a3 ~> a4 ~> r) (a7 :: m a1) (a8 :: m a2) (a9 :: m a3) (a10 :: m a4) :: m r
sLiftM4 :: forall a1 a2 a3 a4 r (m :: Type -> Type) (t1 :: a1 ~> (a2 ~> (a3 ~> (a4 ~> r)))) (t2 :: m a1) (t3 :: m a2) (t4 :: m a3) (t5 :: m a4). SMonad m => Sing t1 -> Sing t2 -> Sing t3 -> Sing t4 -> Sing t5 -> Sing (LiftM4 t1 t2 t3 t4 t5)
type family LiftM5 (a :: a1 ~> a2 ~> a3 ~> a4 ~> a5 ~> r) (a7 :: m a1) (a8 :: m a2) (a9 :: m a3) (a10 :: m a4) (a11 :: m a5) :: m r
sLiftM5 :: forall a1 a2 a3 a4 a5 r (m :: Type -> Type) (t1 :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> r))))) (t2 :: m a1) (t3 :: m a2) (t4 :: m a3) (t5 :: m a4) (t6 :: m a5). SMonad m => Sing t1 -> Sing t2 -> Sing t3 -> Sing t4 -> Sing t5 -> Sing t6 -> Sing (LiftM5 t1 t2 t3 t4 t5 t6)
type family Ap (a1 :: m a ~> b) (a2 :: m a) :: m b
sAp :: forall (m :: Type -> Type) a b (t1 :: m (a ~> b)) (t2 :: m a). SMonad m => Sing t1 -> Sing t2 -> Sing (Ap t1 t2)
type family (a1 :: a ~> b) <$!> (a2 :: m a) :: m b
infixl 4 <$!>
(%<$!>) :: forall a b (m :: Type -> Type) (t1 :: a ~> b) (t2 :: m a). SMonad m => Sing t1 -> Sing t2 -> Sing (t1 <$!> t2)
infixl 4 %<$!>
data FmapSym0 (a1 :: TyFun a ~> b f a ~> f b)
data FmapSym1 (a6989586621679271227 :: a ~> b) (b1 :: TyFun f a f b)
type family FmapSym2 (a6989586621679271227 :: a ~> b) (a6989586621679271228 :: f a) :: f b
data (a1 :: TyFun m a a ~> m b ~> m b) >>=@#@$
infixl 1 >>=@#@$
data (a6989586621679271335 :: m a) >>=@#@$$ (b1 :: TyFun a ~> m b m b)
infixl 1 >>=@#@$$
type family (a6989586621679271335 :: m a) >>=@#@$$$ (a6989586621679271336 :: a ~> m b) :: m b
infixl 1 >>=@#@$$$
data (a1 :: TyFun m a m b ~> m b) >>@#@$
infixl 1 >>@#@$
data (a6989586621679271340 :: m a) >>@#@$$ (b1 :: TyFun m b m b)
infixl 1 >>@#@$$
type family (a6989586621679271340 :: m a) >>@#@$$$ (a6989586621679271341 :: m b) :: m b
infixl 1 >>@#@$$$
data ReturnSym0 (a1 :: TyFun a m a)
type family ReturnSym1 (a6989586621679271344 :: a) :: m a
data FailSym0 (a1 :: TyFun [Char] m a)
type family FailSym1 (a6989586621679365940 :: [Char]) :: m a
type family MzeroSym0 :: m a
data MplusSym0 (a1 :: TyFun m a m a ~> m a)
data MplusSym1 (a6989586621679271380 :: m a) (b :: TyFun m a m a)
type family MplusSym2 (a6989586621679271380 :: m a) (a6989586621679271381 :: m a) :: m a
data MapMSym0 (a1 :: TyFun a ~> m b t a ~> m t b)
data MapMSym1 (a6989586621680096868 :: a ~> m b) (b1 :: TyFun t a m t b)
type family MapMSym2 (a6989586621680096868 :: a ~> m b) (a6989586621680096869 :: t a) :: m t b
data MapM_Sym0 (a1 :: TyFun a ~> m b t a ~> m ())
data MapM_Sym1 (a6989586621679922449 :: a ~> m b) (b1 :: TyFun t a m ())
type family MapM_Sym2 (a6989586621679922449 :: a ~> m b) (a6989586621679922450 :: t a) :: m ()
data ForMSym0 (a1 :: TyFun t a a ~> m b ~> m t b)
data ForMSym1 (a6989586621680103095 :: t a) (b1 :: TyFun a ~> m b m t b)
type family ForMSym2 (a6989586621680103095 :: t a) (a6989586621680103096 :: a ~> m b) :: m t b
data SequenceSym0 (a1 :: TyFun t m a m t a)
type family SequenceSym1 (a6989586621680096872 :: t m a) :: m t a
data Sequence_Sym0 (a1 :: TyFun t m a m ())
type family Sequence_Sym1 (a6989586621679922425 :: t m a) :: m ()
data (a1 :: TyFun a ~> m b m a ~> m b) =<<@#@$
infixr 1 =<<@#@$
data (a6989586621679271176 :: a ~> m b) =<<@#@$$ (b1 :: TyFun m a m b)
infixr 1 =<<@#@$$
type family (a6989586621679271176 :: a ~> m b) =<<@#@$$$ (a6989586621679271177 :: m a) :: m b
infixr 1 =<<@#@$$$
data (a1 :: TyFun a ~> m b b ~> m c ~> a ~> m c) >=>@#@$
infixr 1 >=>@#@$
data (a6989586621680354988 :: a ~> m b) >=>@#@$$ (b1 :: TyFun b ~> m c a ~> m c)
infixr 1 >=>@#@$$
data ( (a6989586621680354988 :: a ~> m b) >=>@#@$$$ (a6989586621680354989 :: b ~> m c) ) (c1 :: TyFun a m c)
infixr 1 >=>@#@$$$
data (a1 :: TyFun b ~> m c a ~> m b ~> a ~> m c) <=<@#@$
infixr 1 <=<@#@$
data (a6989586621680354976 :: b ~> m c) <=<@#@$$ (b1 :: TyFun a ~> m b a ~> m c)
infixr 1 <=<@#@$$
data ( (a6989586621680354976 :: b ~> m c) <=<@#@$$$ (a6989586621680354977 :: a ~> m b) ) (c1 :: TyFun a m c)
infixr 1 <=<@#@$$$
data VoidSym0 (a1 :: TyFun f a f ())
type family VoidSym1 (a6989586621679357493 :: f a) :: f ()
data JoinSym0 (a1 :: TyFun m m a m a)
type family JoinSym1 (a6989586621679271182 :: m m a) :: m a
data MsumSym0 (a1 :: TyFun t m a m a)
type family MsumSym1 (a6989586621679922413 :: t m a) :: m a
data MfilterSym0 (a1 :: TyFun a ~> Bool m a ~> m a)
data MfilterSym1 (a6989586621680354827 :: a ~> Bool) (b :: TyFun m a m a)
type family MfilterSym2 (a6989586621680354827 :: a ~> Bool) (a6989586621680354828 :: m a) :: m a
data FilterMSym0 (a1 :: TyFun a ~> m Bool [a] ~> m [a])
data FilterMSym1 (a6989586621680355005 :: a ~> m Bool) (b :: TyFun [a] m [a])
type family FilterMSym2 (a6989586621680355005 :: a ~> m Bool) (a6989586621680355006 :: [a]) :: m [a]
data MapAndUnzipMSym0 (a1 :: TyFun a ~> m (b, c) [a] ~> m ([b], [c]))
data MapAndUnzipMSym1 (a6989586621680354962 :: a ~> m (b, c)) (b1 :: TyFun [a] m ([b], [c]))
type family MapAndUnzipMSym2 (a6989586621680354962 :: a ~> m (b, c)) (a6989586621680354963 :: [a]) :: m ([b], [c])
data ZipWithMSym0 (a1 :: TyFun a ~> b ~> m c [a] ~> [b] ~> m [c])
data ZipWithMSym1 (a6989586621680354953 :: a ~> b ~> m c) (b1 :: TyFun [a] [b] ~> m [c])
data ZipWithMSym2 (a6989586621680354953 :: a ~> b ~> m c) (a6989586621680354954 :: [a]) (c1 :: TyFun [b] m [c])
type family ZipWithMSym3 (a6989586621680354953 :: a ~> b ~> m c) (a6989586621680354954 :: [a]) (a6989586621680354955 :: [b]) :: m [c]
data ZipWithM_Sym0 (a1 :: TyFun a ~> b ~> m c [a] ~> [b] ~> m ())
data ZipWithM_Sym1 (a6989586621680354943 :: a ~> b ~> m c) (b1 :: TyFun [a] [b] ~> m ())
data ZipWithM_Sym2 (a6989586621680354943 :: a ~> b ~> m c) (a6989586621680354944 :: [a]) (c1 :: TyFun [b] m ())
type family ZipWithM_Sym3 (a6989586621680354943 :: a ~> b ~> m c) (a6989586621680354944 :: [a]) (a6989586621680354945 :: [b]) :: m ()
data FoldlMSym0 (a1 :: TyFun b ~> a ~> m b b ~> t a ~> m b)
data FoldlMSym1 (a6989586621679922477 :: b ~> a ~> m b) (b1 :: TyFun b t a ~> m b)
data FoldlMSym2 (a6989586621679922477 :: b ~> a ~> m b) (a6989586621679922478 :: b) (c :: TyFun t a m b)
type family FoldlMSym3 (a6989586621679922477 :: b ~> a ~> m b) (a6989586621679922478 :: b) (a6989586621679922479 :: t a) :: m b
data ReplicateMSym0 (a1 :: TyFun Natural m a ~> m [a])
data ReplicateMSym1 (a6989586621680354894 :: Natural) (b :: TyFun m a m [a])
type family ReplicateMSym2 (a6989586621680354894 :: Natural) (a6989586621680354895 :: m a) :: m [a]
data ReplicateM_Sym0 (a1 :: TyFun Natural m a ~> m ())
data ReplicateM_Sym1 (a6989586621680354872 :: Natural) (b :: TyFun m a m ())
type family ReplicateM_Sym2 (a6989586621680354872 :: Natural) (a6989586621680354873 :: m a) :: m ()
data GuardSym0 (a :: TyFun Bool f ())
type family GuardSym1 (a6989586621679270986 :: Bool) :: f ()
data WhenSym0 (a :: TyFun Bool f () ~> f ())
data WhenSym1 (a6989586621679271164 :: Bool) (b :: TyFun f () f ())
type family WhenSym2 (a6989586621679271164 :: Bool) (a6989586621679271165 :: f ()) :: f ()
data UnlessSym0 (a :: TyFun Bool f () ~> f ())
data UnlessSym1 (a6989586621680354860 :: Bool) (b :: TyFun f () f ())
type family UnlessSym2 (a6989586621680354860 :: Bool) (a6989586621680354861 :: f ()) :: f ()
data LiftMSym0 (a :: TyFun a1 ~> r m a1 ~> m r)
data LiftMSym1 (a6989586621679271151 :: a1 ~> r) (b :: TyFun m a1 m r)
type family LiftMSym2 (a6989586621679271151 :: a1 ~> r) (a6989586621679271152 :: m a1) :: m r
data LiftM2Sym0 (a :: TyFun a1 ~> a2 ~> r m a1 ~> m a2 ~> m r)
data LiftM2Sym1 (a6989586621679271130 :: a1 ~> a2 ~> r) (b :: TyFun m a1 m a2 ~> m r)
data LiftM2Sym2 (a6989586621679271130 :: a1 ~> a2 ~> r) (a6989586621679271131 :: m a1) (c :: TyFun m a2 m r)
type family LiftM2Sym3 (a6989586621679271130 :: a1 ~> a2 ~> r) (a6989586621679271131 :: m a1) (a6989586621679271132 :: m a2) :: m r
data LiftM3Sym0 (a :: TyFun a1 ~> a2 ~> a3 ~> r m a1 ~> m a2 ~> m a3 ~> m r)
data LiftM3Sym1 (a6989586621679271100 :: a1 ~> a2 ~> a3 ~> r) (b :: TyFun m a1 m a2 ~> m a3 ~> m r)
data LiftM3Sym2 (a6989586621679271100 :: a1 ~> a2 ~> a3 ~> r) (a6989586621679271101 :: m a1) (c :: TyFun m a2 m a3 ~> m r)
data LiftM3Sym3 (a6989586621679271100 :: a1 ~> a2 ~> a3 ~> r) (a6989586621679271101 :: m a1) (a6989586621679271102 :: m a2) (d :: TyFun m a3 m r)
type family LiftM3Sym4 (a6989586621679271100 :: a1 ~> a2 ~> a3 ~> r) (a6989586621679271101 :: m a1) (a6989586621679271102 :: m a2) (a6989586621679271103 :: m a3) :: m r
data LiftM4Sym0 (a :: TyFun a1 ~> a2 ~> a3 ~> a4 ~> r m a1 ~> m a2 ~> m a3 ~> m a4 ~> m r)
data LiftM4Sym1 (a6989586621679271061 :: a1 ~> a2 ~> a3 ~> a4 ~> r) (b :: TyFun m a1 m a2 ~> m a3 ~> m a4 ~> m r)
data LiftM4Sym2 (a6989586621679271061 :: a1 ~> a2 ~> a3 ~> a4 ~> r) (a6989586621679271062 :: m a1) (c :: TyFun m a2 m a3 ~> m a4 ~> m r)
data LiftM4Sym3 (a6989586621679271061 :: a1 ~> a2 ~> a3 ~> a4 ~> r) (a6989586621679271062 :: m a1) (a6989586621679271063 :: m a2) (d :: TyFun m a3 m a4 ~> m r)
data LiftM4Sym4 (a6989586621679271061 :: a1 ~> a2 ~> a3 ~> a4 ~> r) (a6989586621679271062 :: m a1) (a6989586621679271063 :: m a2) (a6989586621679271064 :: m a3) (e :: TyFun m a4 m r)
type family LiftM4Sym5 (a6989586621679271061 :: a1 ~> a2 ~> a3 ~> a4 ~> r) (a6989586621679271062 :: m a1) (a6989586621679271063 :: m a2) (a6989586621679271064 :: m a3) (a6989586621679271065 :: m a4) :: m r
data LiftM5Sym0 (a :: TyFun a1 ~> a2 ~> a3 ~> a4 ~> a5 ~> r m a1 ~> m a2 ~> m a3 ~> m a4 ~> m a5 ~> m r)
data LiftM5Sym1 (a6989586621679271013 :: a1 ~> a2 ~> a3 ~> a4 ~> a5 ~> r) (b :: TyFun m a1 m a2 ~> m a3 ~> m a4 ~> m a5 ~> m r)
data LiftM5Sym2 (a6989586621679271013 :: a1 ~> a2 ~> a3 ~> a4 ~> a5 ~> r) (a6989586621679271014 :: m a1) (c :: TyFun m a2 m a3 ~> m a4 ~> m a5 ~> m r)
data LiftM5Sym3 (a6989586621679271013 :: a1 ~> a2 ~> a3 ~> a4 ~> a5 ~> r) (a6989586621679271014 :: m a1) (a6989586621679271015 :: m a2) (d :: TyFun m a3 m a4 ~> m a5 ~> m r)
data LiftM5Sym4 (a6989586621679271013 :: a1 ~> a2 ~> a3 ~> a4 ~> a5 ~> r) (a6989586621679271014 :: m a1) (a6989586621679271015 :: m a2) (a6989586621679271016 :: m a3) (e :: TyFun m a4 m a5 ~> m r)
data LiftM5Sym5 (a6989586621679271013 :: a1 ~> a2 ~> a3 ~> a4 ~> a5 ~> r) (a6989586621679271014 :: m a1) (a6989586621679271015 :: m a2) (a6989586621679271016 :: m a3) (a6989586621679271017 :: m a4) (f :: TyFun m a5 m r)
type family LiftM5Sym6 (a6989586621679271013 :: a1 ~> a2 ~> a3 ~> a4 ~> a5 ~> r) (a6989586621679271014 :: m a1) (a6989586621679271015 :: m a2) (a6989586621679271016 :: m a3) (a6989586621679271017 :: m a4) (a6989586621679271018 :: m a5) :: m r
data ApSym0 (a1 :: TyFun m a ~> b m a ~> m b)
data ApSym1 (a6989586621679270990 :: m a ~> b) (b1 :: TyFun m a m b)
type family ApSym2 (a6989586621679270990 :: m a ~> b) (a6989586621679270991 :: m a) :: m b
data (a1 :: TyFun a ~> b m a ~> m b) <$!>@#@$
infixl 4 <$!>@#@$
data (a6989586621680354845 :: a ~> b) <$!>@#@$$ (b1 :: TyFun m a m b)
infixl 4 <$!>@#@$$
type family (a6989586621680354845 :: a ~> b) <$!>@#@$$$ (a6989586621680354846 :: m a) :: m b
infixl 4 <$!>@#@$$$
instance Control.Monad.Singletons.Internal.PMonad GHC.Internal.Data.Ord.Down
instance Control.Monad.Singletons.Internal.PMonad ((,) a)
instance Control.Monad.Singletons.Internal.SMonad GHC.Internal.Data.Ord.Down
instance Data.Monoid.Singletons.SMonoid a => Control.Monad.Singletons.Internal.SMonad ((,) a)
instance Control.Monad.Singletons.Internal.SApplicative f => Data.Singletons.SingI1 Control.Monad.Singletons.UnlessSym1
instance Control.Monad.Singletons.Internal.SMonad m => Data.Singletons.SingI1 (Control.Monad.Singletons.<$!>@#@$$)
instance Control.Monad.Singletons.Internal.SMonad m => Data.Singletons.SingI1 (Control.Monad.Singletons.<=<@#@$$)
instance forall (m :: * -> *) b c (d :: b Data.Singletons.~> m c) a. (Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d) => Data.Singletons.SingI1 ((Control.Monad.Singletons.<=<@#@$$$) d)
instance Control.Monad.Singletons.Internal.SMonad m => Data.Singletons.SingI1 (Control.Monad.Singletons.>=>@#@$$)
instance forall (m :: * -> *) a b (d :: a Data.Singletons.~> m b) c. (Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d) => Data.Singletons.SingI1 ((Control.Monad.Singletons.>=>@#@$$$) d)
instance Control.Monad.Singletons.Internal.SApplicative m => Data.Singletons.SingI1 Control.Monad.Singletons.FilterMSym1
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI1 Control.Monad.Singletons.FoldMSym1
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI1 Control.Monad.Singletons.FoldM_Sym1
instance Control.Monad.Singletons.Internal.SApplicative m => Data.Singletons.SingI1 Control.Monad.Singletons.MapAndUnzipMSym1
instance Control.Monad.Singletons.Internal.SMonadPlus m => Data.Singletons.SingI1 Control.Monad.Singletons.MfilterSym1
instance Control.Monad.Singletons.Internal.SApplicative m => Data.Singletons.SingI1 Control.Monad.Singletons.ZipWithMSym1
instance Control.Monad.Singletons.Internal.SApplicative m => Data.Singletons.SingI1 Control.Monad.Singletons.ZipWithM_Sym1
instance forall (m :: * -> *) a b c (d :: a Data.Singletons.~> (b Data.Singletons.~> m c)). (Control.Monad.Singletons.Internal.SApplicative m, Data.Singletons.SingI d) => Data.Singletons.SingI1 (Control.Monad.Singletons.ZipWithMSym2 d)
instance forall (m :: * -> *) a b c (d :: a Data.Singletons.~> (b Data.Singletons.~> m c)). (Control.Monad.Singletons.Internal.SApplicative m, Data.Singletons.SingI d) => Data.Singletons.SingI1 (Control.Monad.Singletons.ZipWithM_Sym2 d)
instance Control.Monad.Singletons.Internal.SApplicative m => Data.Singletons.SingI1 Control.Monad.Singletons.ReplicateMSym1
instance Control.Monad.Singletons.Internal.SApplicative m => Data.Singletons.SingI1 Control.Monad.Singletons.ReplicateM_Sym1
instance forall (t :: * -> *) (m :: * -> *) b a (d :: b Data.Singletons.~> (a Data.Singletons.~> m b)). (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d) => Data.Singletons.SingI1 (Control.Monad.Singletons.FoldMSym2 d)
instance forall (t :: * -> *) (m :: * -> *) b a (d :: b Data.Singletons.~> (a Data.Singletons.~> m b)). (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d) => Data.Singletons.SingI1 (Control.Monad.Singletons.FoldM_Sym2 d)
instance Control.Monad.Singletons.Internal.SMonad m => Data.Singletons.SingI2 (Control.Monad.Singletons.<=<@#@$$$)
instance Control.Monad.Singletons.Internal.SMonad m => Data.Singletons.SingI2 (Control.Monad.Singletons.>=>@#@$$$)
instance Control.Monad.Singletons.Internal.SApplicative m => Data.Singletons.SingI2 Control.Monad.Singletons.ZipWithMSym2
instance Control.Monad.Singletons.Internal.SApplicative m => Data.Singletons.SingI2 Control.Monad.Singletons.ZipWithM_Sym2
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI2 Control.Monad.Singletons.FoldMSym2
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI2 Control.Monad.Singletons.FoldM_Sym2
instance Control.Monad.Singletons.Internal.SMonad m => Data.Singletons.SingI (Control.Monad.Singletons.<$!>@#@$)
instance forall (m :: * -> *) a b (d :: a Data.Singletons.~> b). (Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d) => Data.Singletons.SingI ((Control.Monad.Singletons.<$!>@#@$$) d)
instance Control.Monad.Singletons.Internal.SMonad m => Data.Singletons.SingI (Control.Monad.Singletons.<=<@#@$)
instance forall (m :: * -> *) b c (d :: b Data.Singletons.~> m c) a. (Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d) => Data.Singletons.SingI ((Control.Monad.Singletons.<=<@#@$$) d)
instance forall (m :: * -> *) b c (d1 :: b Data.Singletons.~> m c) a (d2 :: a Data.Singletons.~> m b). (Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (d1 Control.Monad.Singletons.<=<@#@$$$ d2)
instance Control.Monad.Singletons.Internal.SMonad m => Data.Singletons.SingI (Control.Monad.Singletons.>=>@#@$)
instance forall (m :: * -> *) a b (d :: a Data.Singletons.~> m b) c. (Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d) => Data.Singletons.SingI ((Control.Monad.Singletons.>=>@#@$$) d)
instance forall (m :: * -> *) a b (d1 :: a Data.Singletons.~> m b) c (d2 :: b Data.Singletons.~> m c). (Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (d1 Control.Monad.Singletons.>=>@#@$$$ d2)
instance Control.Monad.Singletons.Internal.SApplicative m => Data.Singletons.SingI Control.Monad.Singletons.FilterMSym0
instance forall (m :: * -> *) a (d :: a Data.Singletons.~> m GHC.Types.Bool). (Control.Monad.Singletons.Internal.SApplicative m, Data.Singletons.SingI d) => Data.Singletons.SingI (Control.Monad.Singletons.FilterMSym1 d)
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI Control.Monad.Singletons.FoldMSym0
instance forall (t :: * -> *) (m :: * -> *) b a (d :: b Data.Singletons.~> (a Data.Singletons.~> m b)). (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d) => Data.Singletons.SingI (Control.Monad.Singletons.FoldMSym1 d)
instance forall (t :: * -> *) (m :: * -> *) b a (d1 :: b Data.Singletons.~> (a Data.Singletons.~> m b)) (d2 :: b). (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Control.Monad.Singletons.FoldMSym2 d1 d2)
instance (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m) => Data.Singletons.SingI Control.Monad.Singletons.FoldM_Sym0
instance forall (t :: * -> *) (m :: * -> *) b a (d :: b Data.Singletons.~> (a Data.Singletons.~> m b)). (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d) => Data.Singletons.SingI (Control.Monad.Singletons.FoldM_Sym1 d)
instance forall (t :: * -> *) (m :: * -> *) b a (d1 :: b Data.Singletons.~> (a Data.Singletons.~> m b)) (d2 :: b). (Data.Foldable.Singletons.SFoldable t, Control.Monad.Singletons.Internal.SMonad m, Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Control.Monad.Singletons.FoldM_Sym2 d1 d2)
instance Control.Monad.Singletons.Internal.SApplicative m => Data.Singletons.SingI Control.Monad.Singletons.MapAndUnzipMSym0
instance forall (m :: * -> *) a b c (d :: a Data.Singletons.~> m (b, c)). (Control.Monad.Singletons.Internal.SApplicative m, Data.Singletons.SingI d) => Data.Singletons.SingI (Control.Monad.Singletons.MapAndUnzipMSym1 d)
instance Control.Monad.Singletons.Internal.SMonadPlus m => Data.Singletons.SingI Control.Monad.Singletons.MfilterSym0
instance forall (m :: * -> *) a (d :: a Data.Singletons.~> GHC.Types.Bool). (Control.Monad.Singletons.Internal.SMonadPlus m, Data.Singletons.SingI d) => Data.Singletons.SingI (Control.Monad.Singletons.MfilterSym1 d)
instance Control.Monad.Singletons.Internal.SApplicative m => Data.Singletons.SingI Control.Monad.Singletons.ReplicateMSym0
instance (Control.Monad.Singletons.Internal.SApplicative m, Data.Singletons.SingI d) => Data.Singletons.SingI (Control.Monad.Singletons.ReplicateMSym1 d)
instance Control.Monad.Singletons.Internal.SApplicative m => Data.Singletons.SingI Control.Monad.Singletons.ReplicateM_Sym0
instance (Control.Monad.Singletons.Internal.SApplicative m, Data.Singletons.SingI d) => Data.Singletons.SingI (Control.Monad.Singletons.ReplicateM_Sym1 d)
instance Control.Monad.Singletons.Internal.SApplicative f => Data.Singletons.SingI Control.Monad.Singletons.UnlessSym0
instance (Control.Monad.Singletons.Internal.SApplicative f, Data.Singletons.SingI d) => Data.Singletons.SingI (Control.Monad.Singletons.UnlessSym1 d)
instance Control.Monad.Singletons.Internal.SApplicative m => Data.Singletons.SingI Control.Monad.Singletons.ZipWithMSym0
instance forall (m :: * -> *) a b c (d :: a Data.Singletons.~> (b Data.Singletons.~> m c)). (Control.Monad.Singletons.Internal.SApplicative m, Data.Singletons.SingI d) => Data.Singletons.SingI (Control.Monad.Singletons.ZipWithMSym1 d)
instance forall (m :: * -> *) a b c (d1 :: a Data.Singletons.~> (b Data.Singletons.~> m c)) (d2 :: [a]). (Control.Monad.Singletons.Internal.SApplicative m, Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Control.Monad.Singletons.ZipWithMSym2 d1 d2)
instance Control.Monad.Singletons.Internal.SApplicative m => Data.Singletons.SingI Control.Monad.Singletons.ZipWithM_Sym0
instance forall (m :: * -> *) a b c (d :: a Data.Singletons.~> (b Data.Singletons.~> m c)). (Control.Monad.Singletons.Internal.SApplicative m, Data.Singletons.SingI d) => Data.Singletons.SingI (Control.Monad.Singletons.ZipWithM_Sym1 d)
instance forall (m :: * -> *) a b c (d1 :: a Data.Singletons.~> (b Data.Singletons.~> m c)) (d2 :: [a]). (Control.Monad.Singletons.Internal.SApplicative m, Data.Singletons.SingI d1, Data.Singletons.SingI d2) => Data.Singletons.SingI (Control.Monad.Singletons.ZipWithM_Sym2 d1 d2)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.<$!>@#@$)
instance forall a b (m :: * -> *) (a6989586621680354845 :: a Data.Singletons.~> b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings ((Control.Monad.Singletons.<$!>@#@$$) a6989586621680354845)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.<=<@#@$)
instance forall b (m :: * -> *) c a (a6989586621680354976 :: b Data.Singletons.~> m c). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings ((Control.Monad.Singletons.<=<@#@$$) a6989586621680354976)
instance forall b (m :: * -> *) c a (a6989586621680354976 :: b Data.Singletons.~> m c) (a6989586621680354977 :: a Data.Singletons.~> m b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (a6989586621680354976 Control.Monad.Singletons.<=<@#@$$$ a6989586621680354977)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.>=>@#@$)
instance forall a (m :: * -> *) b c (a6989586621680354988 :: a Data.Singletons.~> m b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings ((Control.Monad.Singletons.>=>@#@$$) a6989586621680354988)
instance forall a (m :: * -> *) b c (a6989586621680354988 :: a Data.Singletons.~> m b) (a6989586621680354989 :: b Data.Singletons.~> m c). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (a6989586621680354988 Control.Monad.Singletons.>=>@#@$$$ a6989586621680354989)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Control.Monad.Singletons.FilterMSym0
instance forall a (m :: * -> *) (a6989586621680355005 :: a Data.Singletons.~> m GHC.Types.Bool). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.FilterMSym1 a6989586621680355005)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Control.Monad.Singletons.FoldMSym0
instance forall b a (m :: * -> *) (t :: * -> *) (a6989586621680354933 :: b Data.Singletons.~> (a Data.Singletons.~> m b)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.FoldMSym1 a6989586621680354933)
instance forall b a (m :: * -> *) (t :: * -> *) (a6989586621680354933 :: b Data.Singletons.~> (a Data.Singletons.~> m b)) (a6989586621680354934 :: b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.FoldMSym2 a6989586621680354933 a6989586621680354934)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Control.Monad.Singletons.FoldM_Sym0
instance forall b a (m :: * -> *) (t :: * -> *) (a6989586621680354917 :: b Data.Singletons.~> (a Data.Singletons.~> m b)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.FoldM_Sym1 a6989586621680354917)
instance forall b a (m :: * -> *) (t :: * -> *) (a6989586621680354917 :: b Data.Singletons.~> (a Data.Singletons.~> m b)) (a6989586621680354918 :: b). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.FoldM_Sym2 a6989586621680354917 a6989586621680354918)
instance forall a6989586621680354510 (m6989586621680354509 :: * -> *) (m :: * -> *) (p6989586621680354829 :: a6989586621680354510 Data.Singletons.~> GHC.Types.Bool) (ma6989586621680354830 :: m6989586621680354509 a6989586621680354510). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.LamCases_6989586621680354831Sym0 p6989586621680354829 ma6989586621680354830)
instance forall k1 a6989586621680354510 (m6989586621680354509 :: * -> *) (m :: * -> *) (a6989586621680354833 :: k1) (p6989586621680354829 :: a6989586621680354510 Data.Singletons.~> GHC.Types.Bool) (ma6989586621680354830 :: m6989586621680354509 a6989586621680354510). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.LamCases_6989586621680354834Sym0 a6989586621680354833 p6989586621680354829 ma6989586621680354830)
instance forall a6989586621680354512 b6989586621680354513 (m6989586621680354511 :: * -> *) (m :: * -> *) (f6989586621680354847 :: a6989586621680354512 Data.Singletons.~> b6989586621680354513) (m6989586621680354848 :: m6989586621680354511 a6989586621680354512). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.LamCases_6989586621680354849Sym0 f6989586621680354847 m6989586621680354848)
instance forall (f6989586621680354514 :: * -> *) (p6989586621680354862 :: GHC.Types.Bool) (s6989586621680354863 :: f6989586621680354514 ()). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.LamCases_6989586621680354864Sym0 p6989586621680354862 s6989586621680354863)
instance forall (m6989586621680354515 :: * -> *) a6989586621680354516 (arg_69895866216803546066989586621680354879 :: GHC.Num.Natural.Natural) (cnt06989586621680354874 :: GHC.Num.Natural.Natural) (f6989586621680354875 :: m6989586621680354515 a6989586621680354516). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.LamCases_6989586621680354880Sym0 m6989586621680354515 a6989586621680354516 arg_69895866216803546066989586621680354879 cnt06989586621680354874 f6989586621680354875)
instance forall (m6989586621680354515 :: * -> *) a6989586621680354516 (cnt6989586621680354882 :: GHC.Num.Natural.Natural) (arg_69895866216803546066989586621680354879 :: GHC.Num.Natural.Natural) (cnt06989586621680354874 :: GHC.Num.Natural.Natural) (f6989586621680354875 :: m6989586621680354515 a6989586621680354516). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.LamCases_6989586621680354883Sym0 m6989586621680354515 a6989586621680354516 cnt6989586621680354882 arg_69895866216803546066989586621680354879 cnt06989586621680354874 f6989586621680354875)
instance forall (m6989586621680354517 :: * -> *) a6989586621680354518 (arg_69895866216803546046989586621680354901 :: GHC.Num.Natural.Natural) (cnt06989586621680354896 :: GHC.Num.Natural.Natural) (f6989586621680354897 :: m6989586621680354517 a6989586621680354518). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.LamCases_6989586621680354902Sym0 m6989586621680354517 a6989586621680354518 arg_69895866216803546046989586621680354901 cnt06989586621680354896 f6989586621680354897)
instance forall (m6989586621680354517 :: * -> *) a6989586621680354518 (cnt6989586621680354904 :: GHC.Num.Natural.Natural) (arg_69895866216803546046989586621680354901 :: GHC.Num.Natural.Natural) (cnt06989586621680354896 :: GHC.Num.Natural.Natural) (f6989586621680354897 :: m6989586621680354517 a6989586621680354518). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.LamCases_6989586621680354905Sym0 m6989586621680354517 a6989586621680354518 cnt6989586621680354904 arg_69895866216803546046989586621680354901 cnt06989586621680354896 f6989586621680354897)
instance forall a6989586621680354544 (m6989586621680354543 :: * -> *) b6989586621680354545 c6989586621680354546 (f6989586621680354991 :: a6989586621680354544 Data.Singletons.~> m6989586621680354543 b6989586621680354545) (g6989586621680354992 :: b6989586621680354545 Data.Singletons.~> m6989586621680354543 c6989586621680354546) (a_69895866216803549826989586621680354993 :: a6989586621680354544). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.LamCases_6989586621680354994Sym0 f6989586621680354991 g6989586621680354992 a_69895866216803549826989586621680354993)
instance forall a6989586621680354548 (m6989586621680354547 :: * -> *) (p6989586621680355007 :: a6989586621680354548 Data.Singletons.~> m6989586621680354547 GHC.Types.Bool) (a_69895866216803550006989586621680355008 :: [a6989586621680354548]). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.LamCases_6989586621680355009Sym0 p6989586621680355007 a_69895866216803550006989586621680355008)
instance forall k1 a6989586621680354548 (m6989586621680354547 :: * -> *) (x6989586621680355011 :: k1) (p6989586621680355007 :: a6989586621680354548 Data.Singletons.~> m6989586621680354547 GHC.Types.Bool) (a_69895866216803550006989586621680355008 :: [a6989586621680354548]). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.LamCases_6989586621680355012Sym0 x6989586621680355011 p6989586621680355007 a_69895866216803550006989586621680355008)
instance forall k k1 a6989586621680354548 (m6989586621680354547 :: * -> *) (flg6989586621680355014 :: k) (x6989586621680355011 :: k1) (p6989586621680355007 :: a6989586621680354548 Data.Singletons.~> m6989586621680354547 GHC.Types.Bool) (a_69895866216803550006989586621680355008 :: [a6989586621680354548]). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.LamCases_6989586621680355015Sym0 flg6989586621680355014 x6989586621680355011 p6989586621680355007 a_69895866216803550006989586621680355008)
instance forall k2 k a7566047373982778566 b7566047373982778567 k3 a6989586621680354596 (u6989586621680355035 :: k2) (a6989586621680355036 :: k) (k6989586621680355037 :: a7566047373982778566 Data.Singletons.~> (a6989586621680354596, b7566047373982778567)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.LamCases_6989586621680355038Sym0 a6989586621680354596 u6989586621680355035 a6989586621680355036 k6989586621680355037)
instance forall (m6989586621680354515 :: * -> *) a6989586621680354516 (cnt06989586621680354874 :: GHC.Num.Natural.Natural) (f6989586621680354875 :: m6989586621680354515 a6989586621680354516). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.Let6989586621680354876LoopSym0 m6989586621680354515 a6989586621680354516 cnt06989586621680354874 f6989586621680354875)
instance forall (m6989586621680354517 :: * -> *) a6989586621680354518 (cnt06989586621680354896 :: GHC.Num.Natural.Natural) (f6989586621680354897 :: m6989586621680354517 a6989586621680354518). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.Let6989586621680354898LoopSym0 m6989586621680354517 a6989586621680354518 cnt06989586621680354896 f6989586621680354897)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Control.Monad.Singletons.MapAndUnzipMSym0
instance forall a (m :: * -> *) b c (a6989586621680354962 :: a Data.Singletons.~> m (b, c)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.MapAndUnzipMSym1 a6989586621680354962)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Control.Monad.Singletons.MfilterSym0
instance forall a (m :: * -> *) (a6989586621680354827 :: a Data.Singletons.~> GHC.Types.Bool). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.MfilterSym1 a6989586621680354827)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Control.Monad.Singletons.ReplicateMSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.ReplicateMSym1 a6989586621680354894)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Control.Monad.Singletons.ReplicateM_Sym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.ReplicateM_Sym1 a6989586621680354872)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Control.Monad.Singletons.UnlessSym0
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.UnlessSym1 a6989586621680354860)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Control.Monad.Singletons.ZipWithMSym0
instance forall a b (m :: * -> *) c (a6989586621680354953 :: a Data.Singletons.~> (b Data.Singletons.~> m c)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.ZipWithMSym1 a6989586621680354953)
instance forall a b (m :: * -> *) c (a6989586621680354953 :: a Data.Singletons.~> (b Data.Singletons.~> m c)) (a6989586621680354954 :: [a]). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.ZipWithMSym2 a6989586621680354953 a6989586621680354954)
instance Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Control.Monad.Singletons.ZipWithM_Sym0
instance forall a b (m :: * -> *) c (a6989586621680354943 :: a Data.Singletons.~> (b Data.Singletons.~> m c)). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.ZipWithM_Sym1 a6989586621680354943)
instance forall a b (m :: * -> *) c (a6989586621680354943 :: a Data.Singletons.~> (b Data.Singletons.~> m c)) (a6989586621680354944 :: [a]). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Control.Monad.Singletons.ZipWithM_Sym2 a6989586621680354943 a6989586621680354944)
-- | 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.
module Prelude.Singletons
(@@) :: forall k1 k2 (f :: k1 ~> k2) (t :: k1). Sing f -> Sing t -> Sing (f @@ t)
pattern FromSing :: forall k (a :: k). SingKind k => Sing a -> Demote k
pattern SLambda2 :: forall {a1} {a2} {b} (f :: a1 ~> (a2 ~> b)). SingFunction2 f -> Sing f
pattern SLambda3 :: forall {a1} {a2} {a3} {b} (f :: a1 ~> (a2 ~> (a3 ~> b))). SingFunction3 f -> Sing f
pattern SLambda4 :: forall {a1} {a2} {a3} {a4} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> b)))). SingFunction4 f -> Sing f
pattern SLambda5 :: forall {a1} {a2} {a3} {a4} {a5} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> b))))). SingFunction5 f -> Sing f
pattern SLambda6 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> b)))))). SingFunction6 f -> Sing f
pattern SLambda7 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {a7} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> (a7 ~> b))))))). SingFunction7 f -> Sing f
pattern SLambda8 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {a7} {a8} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> (a7 ~> (a8 ~> b)))))))). SingFunction8 f -> Sing f
pattern Sing :: forall k (a :: k). () => SingI a => Sing a
applySing2 :: forall {a1} {a2} {b} (f :: a1 ~> (a2 ~> b)). Sing f -> SingFunction2 f
applySing3 :: forall {a1} {a2} {a3} {b} (f :: a1 ~> (a2 ~> (a3 ~> b))). Sing f -> SingFunction3 f
applySing4 :: forall {a1} {a2} {a3} {a4} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> b)))). Sing f -> SingFunction4 f
applySing5 :: forall {a1} {a2} {a3} {a4} {a5} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> b))))). Sing f -> SingFunction5 f
applySing6 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> b)))))). Sing f -> SingFunction6 f
applySing7 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {a7} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> (a7 ~> b))))))). Sing f -> SingFunction7 f
applySing8 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {a7} {a8} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> (a7 ~> (a8 ~> b)))))))). Sing f -> SingFunction8 f
demote :: forall {k} (a :: k). (SingKind k, SingI a) => Demote k
demote1 :: forall {k1} {k2} (f :: k1 -> k2) (x :: k1). (SingKind k2, SingI1 f, SingI x) => Demote k2
demote2 :: forall {k1} {k2} {k3} (f :: k1 -> k2 -> k3) (x :: k1) (y :: k2). (SingKind k3, SingI2 f, SingI x, SingI y) => Demote k3
sing1 :: forall {k1} {k} (f :: k1 -> k) (x :: k1). (SingI1 f, SingI x) => Sing (f x)
sing2 :: forall {k1} {k2} {k} (f :: k1 -> k2 -> k) (x :: k1) (y :: k2). (SingI2 f, SingI x, SingI y) => Sing (f x y)
singByProxy :: forall {k} (a :: k) proxy. SingI a => proxy a -> Sing a
singByProxy# :: forall {k} (a :: k). SingI a => Proxy# a -> Sing a
singByProxy1 :: forall {k1} {k} (f :: k1 -> k) (x :: k1) proxy. (SingI1 f, SingI x) => proxy (f x) -> Sing (f x)
singByProxy1# :: forall {k1} {k} (f :: k1 -> k) (x :: k1). (SingI1 f, SingI x) => Proxy# (f x) -> Sing (f x)
singByProxy2 :: forall {k1} {k2} {k} (f :: k1 -> k2 -> k) (x :: k1) (y :: k2) proxy. (SingI2 f, SingI x, SingI y) => proxy (f x y) -> Sing (f x y)
singByProxy2# :: forall {k1} {k2} {k} (f :: k1 -> k2 -> k) (x :: k1) (y :: k2). (SingI2 f, SingI x, SingI y) => Proxy# (f x y) -> Sing (f x y)
singFun1 :: forall {a1} {b} (f :: a1 ~> b). SingFunction1 f -> Sing f
singFun2 :: forall {a1} {a2} {b} (f :: a1 ~> (a2 ~> b)). SingFunction2 f -> Sing f
singFun3 :: forall {a1} {a2} {a3} {b} (f :: a1 ~> (a2 ~> (a3 ~> b))). SingFunction3 f -> Sing f
singFun4 :: forall {a1} {a2} {a3} {a4} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> b)))). SingFunction4 f -> Sing f
singFun5 :: forall {a1} {a2} {a3} {a4} {a5} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> b))))). SingFunction5 f -> Sing f
singFun6 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> b)))))). SingFunction6 f -> Sing f
singFun7 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {a7} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> (a7 ~> b))))))). SingFunction7 f -> Sing f
singFun8 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {a7} {a8} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> (a7 ~> (a8 ~> b)))))))). SingFunction8 f -> Sing f
singInstance :: forall k (a :: k). Sing a -> SingInstance a
singThat :: forall k (a :: k). (SingKind k, SingI a) => (Demote k -> Bool) -> Maybe (Sing a)
singThat1 :: forall k1 k2 (f :: k1 -> k2) (x :: k1). (SingKind k2, SingI1 f, SingI x) => (Demote k2 -> Bool) -> Maybe (Sing (f x))
singThat2 :: forall k1 k2 k3 (f :: k1 -> k2 -> k3) (x :: k1) (y :: k2). (SingKind k3, SingI2 f, SingI x, SingI y) => (Demote k3 -> Bool) -> Maybe (Sing (f x y))
unSingFun1 :: forall {a1} {b} (f :: a1 ~> b). Sing f -> SingFunction1 f
unSingFun2 :: forall {a1} {a2} {b} (f :: a1 ~> (a2 ~> b)). Sing f -> SingFunction2 f
unSingFun3 :: forall {a1} {a2} {a3} {b} (f :: a1 ~> (a2 ~> (a3 ~> b))). Sing f -> SingFunction3 f
unSingFun4 :: forall {a1} {a2} {a3} {a4} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> b)))). Sing f -> SingFunction4 f
unSingFun5 :: forall {a1} {a2} {a3} {a4} {a5} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> b))))). Sing f -> SingFunction5 f
unSingFun6 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> b)))))). Sing f -> SingFunction6 f
unSingFun7 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {a7} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> (a7 ~> b))))))). Sing f -> SingFunction7 f
unSingFun8 :: forall {a1} {a2} {a3} {a4} {a5} {a6} {a7} {a8} {b} (f :: a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> (a6 ~> (a7 ~> (a8 ~> b)))))))). Sing f -> SingFunction8 f
usingSingI1 :: forall {k1} {k} (f :: k1 -> k) (x :: k1) r. (SingI1 f, SingI x) => (SingI (f x) => r) -> r
usingSingI2 :: forall {k1} {k2} {k} (f :: k1 -> k2 -> k) (x :: k1) (y :: k2) r. (SingI2 f, SingI x, SingI y) => (SingI (f x y) => r) -> r
withSing :: forall {k} (a :: k) b. SingI a => (Sing a -> b) -> b
withSing1 :: forall {k1} {k} (f :: k1 -> k) (x :: k1) b. (SingI1 f, SingI x) => (Sing (f x) -> b) -> b
withSing2 :: forall {k1} {k2} {k} (f :: k1 -> k2 -> k) (x :: k1) (y :: k2) b. (SingI2 f, SingI x, SingI y) => (Sing (f x y) -> b) -> b
withSingI :: forall {k} (n :: k) r. Sing n -> (SingI n => r) -> r
withSomeSing :: SingKind k => Demote k -> (forall (a :: k). () => Sing a -> r) -> r
-- | Proxy is a type that holds no data, but has a phantom parameter
-- of arbitrary type (or even kind). Its use is to provide type
-- information, even though there is no value available of that type (or
-- it may be too costly to create one).
--
-- Historically, Proxy :: Proxy a is a safer
-- alternative to the undefined :: a idiom.
--
--
-- >>> Proxy :: Proxy (Void, Int -> Int)
-- Proxy
--
--
-- Proxy can even hold types of higher kinds,
--
--
-- >>> Proxy :: Proxy Either
-- Proxy
--
--
--
-- >>> Proxy :: Proxy Functor
-- Proxy
--
--
--
-- >>> Proxy :: Proxy complicatedStructure
-- Proxy
--
data Proxy (t :: k)
Proxy :: Proxy (t :: k)
type (a :: k1 ~> k2) @@ (b :: k1) = Apply a b
data (a1 :: TyFun a ~> b a ~> b) @@@#@$
data (a1 :: a ~> b) @@@#@$$ (b1 :: TyFun a b)
type (f :: a ~> b) @@@#@$$$ (x :: a) = f @@ x
type family Apply (f :: k1 ~> k2) (x :: k1) :: k2
data ApplySym0 (a1 :: TyFun a ~> b a ~> b)
data ApplySym1 (a1 :: a ~> b) (b1 :: TyFun a b)
type ApplySym2 (f :: a ~> b) (x :: a) = Apply f x
type family ApplyTyCon :: k1 -> k2 -> TyFun k1 unmatchable_fun -> Type
data ApplyTyConAux1 (a :: k1 -> k2) (b :: TyFun k1 k2)
data ApplyTyConAux2 (a :: k1 -> k2 -> k3) (b :: TyFun k1 unmatchable_fun)
type family Demote k = (r :: Type) | r -> k
data DemoteSym0 (a :: TyFun Type Type)
type DemoteSym1 x = Demote x
type KindOf (a :: k) = k
data KindOfSym0 (a :: TyFun k Type)
type KindOfSym1 (x :: k) = KindOf x
newtype SLambda (f :: k1 ~> k2)
SLambda :: (forall (t :: k1). () => Sing t -> Sing (f @@ t)) -> SLambda (f :: k1 ~> k2)
[applySing] :: SLambda (f :: k1 ~> k2) -> forall (t :: k1). () => Sing t -> Sing (f @@ t)
newtype SWrappedSing (a1 :: WrappedSing a)
[SWrapSing] :: forall k (a :: k) (a1 :: WrappedSing a). Sing a -> SWrappedSing a1
type SameKind (a :: k) (b :: k) = ()
data SameKindSym0 (a :: TyFun k k ~> Constraint)
data SameKindSym1 (a :: k) (b :: TyFun k Constraint)
type SameKindSym2 (x :: k) (y :: k) = SameKind x y
type family Sing :: k -> Type
type SingFunction1 (f :: a1 ~> b) = forall (t :: a1). () => Sing t -> Sing f @@ t
type SingFunction2 (f :: a1 ~> a2 ~> b) = forall (t1 :: a1) (t2 :: a2). () => Sing t1 -> Sing t2 -> Sing f @@ t1 @@ t2
type SingFunction3 (f :: a1 ~> a2 ~> a3 ~> b) = forall (t1 :: a1) (t2 :: a2) (t3 :: a3). () => Sing t1 -> Sing t2 -> Sing t3 -> Sing f @@ t1 @@ t2 @@ t3
type SingFunction4 (f :: a1 ~> a2 ~> a3 ~> a4 ~> b) = forall (t1 :: a1) (t2 :: a2) (t3 :: a3) (t4 :: a4). () => Sing t1 -> Sing t2 -> Sing t3 -> Sing t4 -> Sing f @@ t1 @@ t2 @@ t3 @@ t4
type SingFunction5 (f :: a1 ~> a2 ~> a3 ~> a4 ~> a5 ~> b) = forall (t1 :: a1) (t2 :: a2) (t3 :: a3) (t4 :: a4) (t5 :: a5). () => Sing t1 -> Sing t2 -> Sing t3 -> Sing t4 -> Sing t5 -> Sing f @@ t1 @@ t2 @@ t3 @@ t4 @@ t5
type SingFunction6 (f :: a1 ~> a2 ~> a3 ~> a4 ~> a5 ~> a6 ~> b) = forall (t1 :: a1) (t2 :: a2) (t3 :: a3) (t4 :: a4) (t5 :: a5) (t6 :: a6). () => Sing t1 -> Sing t2 -> Sing t3 -> Sing t4 -> Sing t5 -> Sing t6 -> Sing f @@ t1 @@ t2 @@ t3 @@ t4 @@ t5 @@ t6
type SingFunction7 (f :: a1 ~> a2 ~> a3 ~> a4 ~> a5 ~> a6 ~> a7 ~> b) = forall (t1 :: a1) (t2 :: a2) (t3 :: a3) (t4 :: a4) (t5 :: a5) (t6 :: a6) (t7 :: a7). () => Sing t1 -> Sing t2 -> Sing t3 -> Sing t4 -> Sing t5 -> Sing t6 -> Sing t7 -> Sing f @@ t1 @@ t2 @@ t3 @@ t4 @@ t5 @@ t6 @@ t7
type SingFunction8 (f :: a1 ~> a2 ~> a3 ~> a4 ~> a5 ~> a6 ~> a7 ~> a8 ~> b) = forall (t1 :: a1) (t2 :: a2) (t3 :: a3) (t4 :: a4) (t5 :: a5) (t6 :: a6) (t7 :: a7) (t8 :: a8). () => Sing t1 -> Sing t2 -> Sing t3 -> Sing t4 -> Sing t5 -> Sing t6 -> Sing t7 -> Sing t8 -> Sing f @@ t1 @@ t2 @@ t3 @@ t4 @@ t5 @@ t6 @@ t7 @@ t8
class SingI (a :: k)
sing :: SingI a => Sing a
class forall (x :: k1). SingI x => SingI f x => SingI1 (f :: k1 -> k2)
liftSing :: forall (x :: k1). SingI1 f => Sing x -> Sing (f x)
class forall (x :: k1) (y :: k2). (SingI x, SingI y) => SingI f x y => SingI2 (f :: k1 -> k2 -> k3)
liftSing2 :: forall (x :: k1) (y :: k2). SingI2 f => Sing x -> Sing y -> Sing (f x y)
data SingInstance (a :: k)
[SingInstance] :: forall {k} (a :: k). SingI a => SingInstance a
class SingKind k where {
type Demote k = (r :: Type) | r -> k;
}
fromSing :: forall (a :: k). SingKind k => Sing a -> Demote k
toSing :: SingKind k => Demote k -> SomeSing k
data SomeSing k
[SomeSing] :: forall k (a :: k). Sing a -> SomeSing k
data family TyCon :: forall k1 k2 unmatchable_fun. () => k1 -> k2 -> unmatchable_fun
type TyCon1 = TyCon
type TyCon2 = TyCon
type TyCon3 = TyCon
type TyCon4 = TyCon
type TyCon5 = TyCon
type TyCon6 = TyCon
type TyCon7 = TyCon
type TyCon8 = TyCon
data TyFun a b
type family UnwrapSing (ws :: WrappedSing a) :: Sing a
newtype WrappedSing (a :: k)
[WrapSing] :: forall k (a :: k). Sing a -> WrappedSing a
type a ~> b = TyFun a b -> Type
data (a :: TyFun Type Type ~> Type) ~>@#@$
data a ~>@#@$$ (b :: TyFun Type Type)
type x ~>@#@$$$ y = x ~> y
data SBool (a :: Bool)
[SFalse] :: SBool 'False
[STrue] :: SBool 'True
-- | Type-level If. If True a b ==> a; If
-- False a b ==> b
type family If (cond :: Bool) (tru :: k) (fls :: k) :: k
-- | Conditional over singletons
sIf :: forall {k} (a :: Bool) (b :: k) (c :: k). Sing a -> Sing b -> Sing c -> Sing (If a b c)
-- | Type-level "and"
type family (a :: Bool) && (b :: Bool) :: Bool
infixr 3 &&
-- | Conjunction of singletons
(%&&) :: forall (a :: Bool) (b :: Bool). Sing a -> Sing b -> Sing (a && b)
infixr 3 %&&
-- | Type-level "or"
type family (a :: Bool) || (b :: Bool) :: Bool
infixr 2 ||
-- | Disjunction of singletons
(%||) :: forall (a :: Bool) (b :: Bool). Sing a -> Sing b -> Sing (a || b)
infixr 2 %||
-- | Type-level "not". An injective type family since 4.10.0.0.
type family Not (a :: Bool) = (res :: Bool) | res -> a
-- | Negation of a singleton
sNot :: forall (a :: Bool). Sing a -> Sing (Not a)
type family Otherwise :: Bool
sOtherwise :: Sing Otherwise
data SMaybe (a1 :: Maybe a)
[SNothing] :: forall a. SMaybe ('Nothing :: Maybe a)
[SJust] :: forall a (n :: a). Sing n -> SMaybe ('Just n)
maybe_ :: b -> (a -> b) -> Maybe a -> b
type family Maybe_ (a1 :: b) (a2 :: a ~> b) (a3 :: Maybe a) :: b
sMaybe_ :: forall b a (t1 :: b) (t2 :: a ~> b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Maybe_ t1 t2 t3)
data SEither (a1 :: Either a b)
[SLeft] :: forall a b (n :: a). Sing n -> SEither ('Left n :: Either a b)
[SRight] :: forall a b (n :: b). Sing n -> SEither ('Right n :: Either a b)
either_ :: (a -> c) -> (b -> c) -> Either a b -> c
type family Either_ (a1 :: a ~> c) (a2 :: b ~> c) (a3 :: Either a b) :: c
sEither_ :: forall a c b (t1 :: a ~> c) (t2 :: b ~> c) (t3 :: Either a b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Either_ t1 t2 t3)
data SOrdering (a :: Ordering)
[SLT] :: SOrdering 'LT
[SEQ] :: SOrdering 'EQ
[SGT] :: SOrdering 'GT
-- | A value-level witness for a type-level character. This is commonly
-- referred to as a singleton type, as for each c, there
-- is a single value that inhabits the type SChar c
-- (aside from bottom).
--
-- The definition of SChar is intentionally left abstract. To
-- obtain an SChar value, use one of the following:
--
--
-- - The charSing method of KnownChar.
-- - The SChar pattern synonym.
-- - The withSomeSChar function, which creates an SChar
-- from a Char.
--
data SChar (s :: Char)
-- | (Kind) This is the kind of type-level symbols.
data Symbol
data SList (a1 :: [a])
[SNil] :: forall a. SList ('[] :: [a])
[SCons] :: forall a (n1 :: a) (n2 :: [a]). Sing n1 -> Sing n2 -> SList (n1 ': n2)
infixr 5 `SCons`
data STuple0 (a :: ())
[STuple0] :: STuple0 '()
data STuple2 (a1 :: (a, b))
[STuple2] :: forall a b (n1 :: a) (n2 :: b). Sing n1 -> Sing n2 -> STuple2 '(n1, n2)
data STuple3 (a1 :: (a, b, c))
[STuple3] :: forall a b c (n1 :: a) (n2 :: b) (n3 :: c). Sing n1 -> Sing n2 -> Sing n3 -> STuple3 '(n1, n2, n3)
data STuple4 (a1 :: (a, b, c, d))
[STuple4] :: forall a b c d (n1 :: a) (n2 :: b) (n3 :: c) (n4 :: d). Sing n1 -> Sing n2 -> Sing n3 -> Sing n4 -> STuple4 '(n1, n2, n3, n4)
data STuple5 (a1 :: (a, b, c, d, e))
[STuple5] :: forall a b c d e (n1 :: a) (n2 :: b) (n3 :: c) (n4 :: d) (n5 :: e). Sing n1 -> Sing n2 -> Sing n3 -> Sing n4 -> Sing n5 -> STuple5 '(n1, n2, n3, n4, n5)
data STuple6 (a1 :: (a, b, c, d, e, f))
[STuple6] :: forall a b c d e f (n1 :: a) (n2 :: b) (n3 :: c) (n4 :: d) (n5 :: e) (n6 :: f). Sing n1 -> Sing n2 -> Sing n3 -> Sing n4 -> Sing n5 -> Sing n6 -> STuple6 '(n1, n2, n3, n4, n5, n6)
data STuple7 (a1 :: (a, b, c, d, e, f, g))
[STuple7] :: forall a b c d e f g (n1 :: a) (n2 :: b) (n3 :: c) (n4 :: d) (n5 :: e) (n6 :: f) (n7 :: g). Sing n1 -> Sing n2 -> Sing n3 -> Sing n4 -> Sing n5 -> Sing n6 -> Sing n7 -> STuple7 '(n1, n2, n3, n4, n5, n6, n7)
type family Fst (a1 :: (a, b)) :: a
sFst :: forall a b (t :: (a, b)). Sing t -> Sing (Fst t)
type family Snd (a1 :: (a, b)) :: b
sSnd :: forall a b (t :: (a, b)). Sing t -> Sing (Snd t)
type family Curry (a1 :: (a, b) ~> c) (a2 :: a) (a3 :: b) :: c
sCurry :: forall a b c (t1 :: (a, b) ~> c) (t2 :: a) (t3 :: b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Curry t1 t2 t3)
type family Uncurry (a1 :: a ~> b ~> c) (a2 :: (a, b)) :: c
sUncurry :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: (a, b)). Sing t1 -> Sing t2 -> Sing (Uncurry t1 t2)
class PEq a where {
type (arg :: a) == (arg1 :: a) :: Bool;
type (arg :: a) /= (arg1 :: a) :: Bool;
type arg :: a == arg1 :: a = TFHelper_6989586621679128045 arg arg1;
type arg :: a /= arg1 :: a = TFHelper_6989586621679128034 arg arg1;
}
infix 4 ==
infix 4 /=
class SEq a
(%==) :: forall (t1 :: a) (t2 :: a). SEq a => Sing t1 -> Sing t2 -> Sing (t1 == t2)
($dm%==) :: forall (t1 :: a) (t2 :: a). (SEq a, (t1 == t2) ~ TFHelper_6989586621679128045 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 == t2)
(%/=) :: forall (t1 :: a) (t2 :: a). SEq a => Sing t1 -> Sing t2 -> Sing (t1 /= t2)
($dm%/=) :: forall (t1 :: a) (t2 :: a). (SEq a, (t1 /= t2) ~ TFHelper_6989586621679128034 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 /= t2)
infix 4 %==
infix 4 %/=
class POrd a where {
type Compare (arg :: a) (arg1 :: a) :: Ordering;
type (arg :: a) < (arg1 :: a) :: Bool;
type (arg :: a) <= (arg1 :: a) :: Bool;
type (arg :: a) > (arg1 :: a) :: Bool;
type (arg :: a) >= (arg1 :: a) :: Bool;
type Max (arg :: a) (arg1 :: a) :: a;
type Min (arg :: a) (arg1 :: a) :: a;
type Compare arg :: a arg1 :: a = Compare_6989586621679190000 arg arg1;
type arg :: a < arg1 :: a = TFHelper_6989586621679190021 arg arg1;
type arg :: a <= arg1 :: a = TFHelper_6989586621679190037 arg arg1;
type arg :: a > arg1 :: a = TFHelper_6989586621679190053 arg arg1;
type arg :: a >= arg1 :: a = TFHelper_6989586621679190069 arg arg1;
type Max arg :: a arg1 :: a = Max_6989586621679190085 arg arg1;
type Min arg :: a arg1 :: a = Min_6989586621679190101 arg arg1;
}
infix 4 <
infix 4 <=
infix 4 >
infix 4 >=
class SEq a => SOrd a
sCompare :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (Compare t1 t2)
($dmsCompare) :: forall (t1 :: a) (t2 :: a). (SOrd a, Compare t1 t2 ~ Compare_6989586621679190000 t1 t2) => Sing t1 -> Sing t2 -> Sing (Compare t1 t2)
(%<) :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (t1 < t2)
($dm%<) :: forall (t1 :: a) (t2 :: a). (SOrd a, (t1 < t2) ~ TFHelper_6989586621679190021 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 < t2)
(%<=) :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (t1 <= t2)
($dm%<=) :: forall (t1 :: a) (t2 :: a). (SOrd a, (t1 <= t2) ~ TFHelper_6989586621679190037 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 <= t2)
(%>) :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (t1 > t2)
($dm%>) :: forall (t1 :: a) (t2 :: a). (SOrd a, (t1 > t2) ~ TFHelper_6989586621679190053 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 > t2)
(%>=) :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (t1 >= t2)
($dm%>=) :: forall (t1 :: a) (t2 :: a). (SOrd a, (t1 >= t2) ~ TFHelper_6989586621679190069 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 >= t2)
sMax :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (Max t1 t2)
($dmsMax) :: forall (t1 :: a) (t2 :: a). (SOrd a, Max t1 t2 ~ Max_6989586621679190085 t1 t2) => Sing t1 -> Sing t2 -> Sing (Max t1 t2)
sMin :: forall (t1 :: a) (t2 :: a). SOrd a => Sing t1 -> Sing t2 -> Sing (Min t1 t2)
($dmsMin) :: forall (t1 :: a) (t2 :: a). (SOrd a, Min t1 t2 ~ Min_6989586621679190101 t1 t2) => Sing t1 -> Sing t2 -> Sing (Min t1 t2)
infix 4 %<
infix 4 %<=
infix 4 %>
infix 4 %>=
class PEnum a where {
type ToEnum (arg :: Natural) :: a;
type FromEnum (arg :: a) :: Natural;
type EnumFromTo (arg :: a) (arg1 :: a) :: [a];
type EnumFromThenTo (arg :: a) (arg1 :: a) (arg2 :: a) :: [a];
type Succ arg :: a = Succ_6989586621679414077 arg;
type Pred arg :: a = Pred_6989586621679414092 arg;
type EnumFromTo arg :: a arg1 :: a = EnumFromTo_6989586621679414102 arg arg1;
type EnumFromThenTo arg :: a arg1 :: a arg2 :: a = EnumFromThenTo_6989586621679414114 arg arg1 arg2;
}
class SEnum a
sToEnum :: forall (t :: Natural). SEnum a => Sing t -> Sing (ToEnum t :: a)
sFromEnum :: forall (t :: a). SEnum a => Sing t -> Sing (FromEnum t)
sEnumFromTo :: forall (t1 :: a) (t2 :: a). SEnum a => Sing t1 -> Sing t2 -> Sing (EnumFromTo t1 t2)
($dmsEnumFromTo) :: forall (t1 :: a) (t2 :: a). (SEnum a, EnumFromTo t1 t2 ~ EnumFromTo_6989586621679414102 t1 t2) => Sing t1 -> Sing t2 -> Sing (EnumFromTo t1 t2)
sEnumFromThenTo :: forall (t1 :: a) (t2 :: a) (t3 :: a). SEnum a => Sing t1 -> Sing t2 -> Sing t3 -> Sing (EnumFromThenTo t1 t2 t3)
($dmsEnumFromThenTo) :: forall (t1 :: a) (t2 :: a) (t3 :: a). (SEnum a, EnumFromThenTo t1 t2 t3 ~ EnumFromThenTo_6989586621679414114 t1 t2 t3) => Sing t1 -> Sing t2 -> Sing t3 -> Sing (EnumFromThenTo t1 t2 t3)
class PBounded a where {
type MinBound :: a;
type MaxBound :: a;
}
class SBounded a
sMinBound :: SBounded a => Sing (MinBound :: a)
sMaxBound :: SBounded a => Sing (MaxBound :: a)
class PNum a where {
type (arg :: a) + (arg1 :: a) :: a;
type (arg :: a) - (arg1 :: a) :: a;
type (arg :: a) * (arg1 :: a) :: a;
type Negate (arg :: a) :: a;
type Abs (arg :: a) :: a;
type Signum (arg :: a) :: a;
type FromInteger (arg :: Natural) :: a;
type arg :: a - arg1 :: a = TFHelper_6989586621679398594 arg arg1;
type Negate arg :: a = Negate_6989586621679398604 arg;
}
infixl 6 +
infixl 6 -
infixl 7 *
class SNum a
(%+) :: forall (t1 :: a) (t2 :: a). SNum a => Sing t1 -> Sing t2 -> Sing (t1 + t2)
(%-) :: forall (t1 :: a) (t2 :: a). SNum a => Sing t1 -> Sing t2 -> Sing (t1 - t2)
($dm%-) :: forall (t1 :: a) (t2 :: a). (SNum a, (t1 - t2) ~ TFHelper_6989586621679398594 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 - t2)
(%*) :: forall (t1 :: a) (t2 :: a). SNum a => Sing t1 -> Sing t2 -> Sing (t1 * t2)
sNegate :: forall (t :: a). SNum a => Sing t -> Sing (Negate t)
($dmsNegate) :: forall (t :: a). (SNum a, Negate t ~ Negate_6989586621679398604 t) => Sing t -> Sing (Negate t)
sAbs :: forall (t :: a). SNum a => Sing t -> Sing (Abs t)
sSignum :: forall (t :: a). SNum a => Sing t -> Sing (Signum t)
sFromInteger :: forall (t :: Natural). SNum a => Sing t -> Sing (FromInteger t :: a)
infixl 6 %+
infixl 6 %-
infixl 7 %*
type family Subtract (a1 :: a) (a2 :: a) :: a
sSubtract :: forall a (t1 :: a) (t2 :: a). SNum a => Sing t1 -> Sing t2 -> Sing (Subtract t1 t2)
class PSemigroup a where {
type (arg :: a) <> (arg1 :: a) :: a;
type Sconcat arg :: NonEmpty a = Sconcat_6989586621679173985 arg;
}
infixr 6 <>
class SSemigroup a
(%<>) :: forall (t1 :: a) (t2 :: a). SSemigroup a => Sing t1 -> Sing t2 -> Sing (t1 <> t2)
infixr 6 %<>
class PMonoid a where {
type Mempty :: a;
type Mappend (arg :: a) (arg1 :: a) :: a;
type Mconcat (arg :: [a]) :: a;
type Mappend arg :: a arg1 :: a = Mappend_6989586621679860753 arg arg1;
type Mconcat arg :: [a] = Mconcat_6989586621679860767 arg;
}
class SSemigroup a => SMonoid a
sMempty :: SMonoid a => Sing (Mempty :: a)
sMappend :: forall (t1 :: a) (t2 :: a). SMonoid a => Sing t1 -> Sing t2 -> Sing (Mappend t1 t2)
($dmsMappend) :: forall (t1 :: a) (t2 :: a). (SMonoid a, Mappend t1 t2 ~ Mappend_6989586621679860753 t1 t2) => Sing t1 -> Sing t2 -> Sing (Mappend t1 t2)
sMconcat :: forall (t :: [a]). SMonoid a => Sing t -> Sing (Mconcat t)
($dmsMconcat) :: forall (t :: [a]). (SMonoid a, Mconcat t ~ Mconcat_6989586621679860767 t) => Sing t -> Sing (Mconcat t)
class PFunctor (f :: Type -> Type) where {
type Fmap (arg :: a ~> b) (arg1 :: f a) :: f b;
type (arg :: a) <$ (arg1 :: f b) :: f a;
type arg :: a <$ arg1 :: f b = TFHelper_6989586621679271236 arg arg1;
}
infixl 4 <$
class SFunctor (f :: Type -> Type)
sFmap :: forall a b (t1 :: a ~> b) (t2 :: f a). SFunctor f => Sing t1 -> Sing t2 -> Sing (Fmap t1 t2)
(%<$) :: forall a b (t1 :: a) (t2 :: f b). SFunctor f => Sing t1 -> Sing t2 -> Sing (t1 <$ t2)
($dm%<$) :: forall a b (t1 :: a) (t2 :: f b). (SFunctor f, (t1 <$ t2) ~ TFHelper_6989586621679271236 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 <$ t2)
infixl 4 %<$
type family (a1 :: a ~> b) <$> (a2 :: f a) :: f b
infixl 4 <$>
(%<$>) :: forall a b (f :: Type -> Type) (t1 :: a ~> b) (t2 :: f a). SFunctor f => Sing t1 -> Sing t2 -> Sing (t1 <$> t2)
infixl 4 %<$>
class PApplicative (f :: Type -> Type) where {
type Pure (arg :: a) :: f a;
type (arg :: f a ~> b) <*> (arg1 :: f a) :: f b;
type LiftA2 (arg :: a ~> b ~> c) (arg1 :: f a) (arg2 :: f b) :: f c;
type (arg :: f a) *> (arg1 :: f b) :: f b;
type (arg :: f a) <* (arg1 :: f b) :: f a;
type arg :: f a ~> b <*> arg1 :: f a = TFHelper_6989586621679271276 arg arg1;
type LiftA2 arg :: a ~> b ~> c arg1 :: f a arg2 :: f b = LiftA2_6989586621679271292 arg arg1 arg2;
type arg :: f a *> arg1 :: f b = TFHelper_6989586621679271308 arg arg1;
type arg :: f a <* arg1 :: f b = TFHelper_6989586621679271319 arg arg1;
}
infixl 4 <*>
infixl 4 *>
infixl 4 <*
class SFunctor f => SApplicative (f :: Type -> Type)
sPure :: forall a (t :: a). SApplicative f => Sing t -> Sing (Pure t :: f a)
(%<*>) :: forall a b (t1 :: f (a ~> b)) (t2 :: f a). SApplicative f => Sing t1 -> Sing t2 -> Sing (t1 <*> t2)
($dm%<*>) :: forall a b (t1 :: f (a ~> b)) (t2 :: f a). (SApplicative f, (t1 <*> t2) ~ TFHelper_6989586621679271276 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 <*> t2)
sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: f a) (t3 :: f b). SApplicative f => Sing t1 -> Sing t2 -> Sing t3 -> Sing (LiftA2 t1 t2 t3)
($dmsLiftA2) :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: f a) (t3 :: f b). (SApplicative f, LiftA2 t1 t2 t3 ~ LiftA2_6989586621679271292 t1 t2 t3) => Sing t1 -> Sing t2 -> Sing t3 -> Sing (LiftA2 t1 t2 t3)
(%*>) :: forall a b (t1 :: f a) (t2 :: f b). SApplicative f => Sing t1 -> Sing t2 -> Sing (t1 *> t2)
($dm%*>) :: forall a b (t1 :: f a) (t2 :: f b). (SApplicative f, (t1 *> t2) ~ TFHelper_6989586621679271308 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 *> t2)
(%<*) :: forall a b (t1 :: f a) (t2 :: f b). SApplicative f => Sing t1 -> Sing t2 -> Sing (t1 <* t2)
($dm%<*) :: forall a b (t1 :: f a) (t2 :: f b). (SApplicative f, (t1 <* t2) ~ TFHelper_6989586621679271319 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 <* t2)
infixl 4 %<*>
infixl 4 %*>
infixl 4 %<*
class PMonad (m :: Type -> Type) where {
type (arg :: m a) >>= (arg1 :: a ~> m b) :: m b;
type (arg :: m a) >> (arg1 :: m b) :: m b;
type Return (arg :: a) :: m a;
type arg :: m a >> arg1 :: m b = TFHelper_6989586621679271347 arg arg1;
type Return arg :: a = Return_6989586621679271362 arg :: m a;
}
infixl 1 >>=
infixl 1 >>
class SApplicative m => SMonad (m :: Type -> Type)
(%>>=) :: forall a b (t1 :: m a) (t2 :: a ~> m b). SMonad m => Sing t1 -> Sing t2 -> Sing (t1 >>= t2)
(%>>) :: forall a b (t1 :: m a) (t2 :: m b). SMonad m => Sing t1 -> Sing t2 -> Sing (t1 >> t2)
($dm%>>) :: forall a b (t1 :: m a) (t2 :: m b). (SMonad m, (t1 >> t2) ~ TFHelper_6989586621679271347 t1 t2) => Sing t1 -> Sing t2 -> Sing (t1 >> t2)
sReturn :: forall a (t :: a). SMonad m => Sing t -> Sing (Return t :: m a)
($dmsReturn) :: forall a (t :: a). (SMonad m, (Return t :: m a) ~ (Return_6989586621679271362 t :: m a)) => Sing t -> Sing (Return t :: m a)
infixl 1 %>>=
infixl 1 %>>
class PMonadFail (m :: Type -> Type) where {
type Fail (arg :: [Char]) :: m a;
}
class SMonad m => SMonadFail (m :: Type -> Type)
sFail :: forall a (t :: [Char]). SMonadFail m => Sing t -> Sing (Fail t :: m a)
type family MapM_ (a1 :: a ~> m b) (a2 :: t a) :: m ()
sMapM_ :: forall a (m :: Type -> Type) b (t1 :: Type -> Type) (t2 :: a ~> m b) (t3 :: t1 a). (SFoldable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing (MapM_ t2 t3)
type family Sequence_ (a1 :: t m a) :: m ()
sSequence_ :: forall (t1 :: Type -> Type) (m :: Type -> Type) a (t2 :: t1 (m a)). (SFoldable t1, SMonad m) => Sing t2 -> Sing (Sequence_ t2)
type family (a1 :: a ~> m b) =<< (a2 :: m a) :: m b
infixr 1 =<<
(%=<<) :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: m a). SMonad m => Sing t1 -> Sing t2 -> Sing (t1 =<< t2)
infixr 1 %=<<
class PFoldable (t :: Type -> Type) where {
type FoldMap (arg :: a ~> m) (arg1 :: t a) :: m;
type Foldr (arg :: a ~> b ~> b) (arg1 :: b) (arg2 :: t a) :: b;
type Foldl (arg :: b ~> a ~> b) (arg1 :: b) (arg2 :: t a) :: b;
type Foldr1 (arg :: a ~> a ~> a) (arg1 :: t a) :: a;
type Foldl1 (arg :: a ~> a ~> a) (arg1 :: t a) :: a;
type Elem (arg :: a) (arg1 :: 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;
type Fold arg :: t m = Fold_6989586621679922582 arg;
type FoldMap arg :: a ~> m arg1 :: t a = FoldMap_6989586621679922592 arg arg1;
type Foldr arg :: a ~> b ~> b arg1 :: b arg2 :: t a = Foldr_6989586621679922606 arg arg1 arg2;
type Foldr' arg :: a ~> b ~> b arg1 :: b arg2 :: t a = Foldr'_6989586621679922621 arg arg1 arg2;
type Foldl arg :: b ~> a ~> b arg1 :: b arg2 :: t a = Foldl_6989586621679922644 arg arg1 arg2;
type Foldl' arg :: b ~> a ~> b arg1 :: b arg2 :: t a = Foldl'_6989586621679922659 arg arg1 arg2;
type Foldr1 arg :: a ~> a ~> a arg1 :: t a = Foldr1_6989586621679922681 arg arg1;
type Foldl1 arg :: a ~> a ~> a arg1 :: t a = Foldl1_6989586621679922704 arg arg1;
type ToList arg :: t a = ToList_6989586621679922726 arg;
type Null arg :: t a = Null_6989586621679922735 arg;
type Length arg :: t a = Length_6989586621679922751 arg;
type Elem arg :: a arg1 :: t a = Elem_6989586621679922769 arg arg1;
type Maximum arg :: t a = Maximum_6989586621679922783 arg;
type Minimum arg :: t a = Minimum_6989586621679922798 arg;
type Sum arg :: t a = Sum_6989586621679922813 arg;
type Product arg :: t a = Product_6989586621679922822 arg;
}
class SFoldable (t :: Type -> Type)
sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: t a). (SFoldable t, SMonoid m) => Sing t1 -> Sing t2 -> Sing (FoldMap t1 t2)
($dmsFoldMap) :: forall a m (t1 :: a ~> m) (t2 :: t a). (SFoldable t, FoldMap t1 t2 ~ FoldMap_6989586621679922592 t1 t2, SMonoid m) => Sing t1 -> Sing t2 -> Sing (FoldMap t1 t2)
sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldr t1 t2 t3)
($dmsFoldr) :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: t a). (SFoldable t, Foldr t1 t2 t3 ~ Foldr_6989586621679922606 t1 t2 t3) => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldr t1 t2 t3)
sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldl t1 t2 t3)
($dmsFoldl) :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a). (SFoldable t, Foldl t1 t2 t3 ~ Foldl_6989586621679922644 t1 t2 t3) => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Foldl t1 t2 t3)
sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing (Foldr1 t1 t2)
($dmsFoldr1) :: forall a (t1 :: a ~> (a ~> a)) (t2 :: t a). (SFoldable t, Foldr1 t1 t2 ~ Foldr1_6989586621679922681 t1 t2) => Sing t1 -> Sing t2 -> Sing (Foldr1 t1 t2)
sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: t a). SFoldable t => Sing t1 -> Sing t2 -> Sing (Foldl1 t1 t2)
($dmsFoldl1) :: forall a (t1 :: a ~> (a ~> a)) (t2 :: t a). (SFoldable t, Foldl1 t1 t2 ~ Foldl1_6989586621679922704 t1 t2) => Sing t1 -> Sing t2 -> Sing (Foldl1 t1 t2)
sElem :: forall a (t1 :: a) (t2 :: t a). (SFoldable t, SEq a) => Sing t1 -> Sing t2 -> Sing (Elem t1 t2)
($dmsElem) :: forall a (t1 :: a) (t2 :: t a). (SFoldable t, Elem t1 t2 ~ Elem_6989586621679922769 t1 t2, SEq a) => Sing t1 -> Sing t2 -> Sing (Elem t1 t2)
sMaximum :: forall a (t1 :: t a). (SFoldable t, SOrd a) => Sing t1 -> Sing (Maximum t1)
($dmsMaximum) :: forall a (t1 :: t a). (SFoldable t, Maximum t1 ~ Maximum_6989586621679922783 t1, SOrd a) => Sing t1 -> Sing (Maximum t1)
sMinimum :: forall a (t1 :: t a). (SFoldable t, SOrd a) => Sing t1 -> Sing (Minimum t1)
($dmsMinimum) :: forall a (t1 :: t a). (SFoldable t, Minimum t1 ~ Minimum_6989586621679922798 t1, SOrd a) => Sing t1 -> Sing (Minimum t1)
sSum :: forall a (t1 :: t a). (SFoldable t, SNum a) => Sing t1 -> Sing (Sum t1)
($dmsSum) :: forall a (t1 :: t a). (SFoldable t, Sum t1 ~ Sum_6989586621679922813 t1, SNum a) => Sing t1 -> Sing (Sum t1)
sProduct :: forall a (t1 :: t a). (SFoldable t, SNum a) => Sing t1 -> Sing (Product t1)
($dmsProduct) :: forall a (t1 :: t a). (SFoldable t, Product t1 ~ Product_6989586621679922822 t1, SNum a) => Sing t1 -> Sing (Product t1)
class PTraversable (t :: Type -> Type) where {
type Traverse (arg :: a ~> f b) (arg1 :: t a) :: f t b;
type SequenceA (arg :: t f a) :: f t a;
type MapM (arg :: a ~> m b) (arg1 :: t a) :: m t b;
type Sequence (arg :: t m a) :: m t a;
type Traverse arg :: a ~> f b arg1 :: t a = Traverse_6989586621680096875 arg arg1;
type SequenceA arg :: t f a = SequenceA_6989586621680096887 arg;
type MapM arg :: a ~> m b arg1 :: t a = MapM_6989586621680096897 arg arg1;
type Sequence arg :: t m a = Sequence_6989586621680096911 arg;
}
class (SFunctor t, SFoldable t) => STraversable (t :: Type -> Type)
sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: t a). (STraversable t, SApplicative f) => Sing t1 -> Sing t2 -> Sing (Traverse t1 t2)
($dmsTraverse) :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: t a). (STraversable t, Traverse t1 t2 ~ Traverse_6989586621680096875 t1 t2, SApplicative f) => Sing t1 -> Sing t2 -> Sing (Traverse t1 t2)
sSequenceA :: forall (f :: Type -> Type) a (t1 :: t (f a)). (STraversable t, SApplicative f) => Sing t1 -> Sing (SequenceA t1)
($dmsSequenceA) :: forall (f :: Type -> Type) a (t1 :: t (f a)). (STraversable t, SequenceA t1 ~ SequenceA_6989586621680096887 t1, SApplicative f) => Sing t1 -> Sing (SequenceA t1)
sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: t a). (STraversable t, SMonad m) => Sing t1 -> Sing t2 -> Sing (MapM t1 t2)
($dmsMapM) :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: t a). (STraversable t, MapM t1 t2 ~ MapM_6989586621680096897 t1 t2, SMonad m) => Sing t1 -> Sing t2 -> Sing (MapM t1 t2)
sSequence :: forall (m :: Type -> Type) a (t1 :: t (m a)). (STraversable t, SMonad m) => Sing t1 -> Sing (Sequence t1)
($dmsSequence) :: forall (m :: Type -> Type) a (t1 :: t (m a)). (STraversable t, Sequence t1 ~ Sequence_6989586621680096911 t1, SMonad m) => Sing t1 -> Sing (Sequence t1)
type family Id (a1 :: a) :: a
sId :: forall a (t :: a). Sing t -> Sing (Id t)
type family Const (a1 :: a) (a2 :: b) :: a
sConst :: forall a b (t1 :: a) (t2 :: b). Sing t1 -> Sing t2 -> Sing (Const t1 t2)
type family ( (a1 :: b ~> c) . (a2 :: a ~> b) ) (a3 :: a) :: c
infixr 9 .
(%.) :: forall b c a (t1 :: b ~> c) (t2 :: a ~> b) (t3 :: a). Sing t1 -> Sing t2 -> Sing t3 -> Sing ((t1 . t2) t3)
infixr 9 %.
type family Flip (a1 :: a ~> b ~> c) (a2 :: b) (a3 :: a) :: c
sFlip :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: b) (t3 :: a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Flip t1 t2 t3)
type family (a1 :: a ~> b) $ (a2 :: a) :: b
infixr 0 $
(%$) :: forall a b (t1 :: a ~> b) (t2 :: a). Sing t1 -> Sing t2 -> Sing (t1 $ t2)
infixr 0 %$
type family Until (a1 :: a ~> Bool) (a2 :: a ~> a) (a3 :: a) :: a
sUntil :: forall a (t1 :: a ~> Bool) (t2 :: a ~> a) (t3 :: a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Until t1 t2 t3)
type family AsTypeOf (a1 :: a) (a2 :: a) :: a
sAsTypeOf :: forall a (t1 :: a) (t2 :: a). Sing t1 -> Sing t2 -> Sing (AsTypeOf t1 t2)
-- | A promoted version of error. This implements Error as a
-- stuck type family with a Symbol argument. Depending on your
-- needs, you might also consider the following alternatives:
--
--
-- - Data.Singletons.Base.PolyError provides PolyError,
-- which generalizes the argument to be kind-polymorphic. This allows
-- passing additional information to the error besides raw
-- Symbols.
-- - Data.Singletons.Base.TypeError provides TypeError,
-- a slightly modified version of the custom type error machinery found
-- in GHC.TypeLits. This allows emitting error messages as
-- compiler errors rather than as stuck type families.
--
type family Error (str :: Symbol) :: a
-- | The singleton for error.
sError :: forall a (str :: Symbol). HasCallStack => Sing str -> Sing (Error str :: a)
-- | The promotion of errorWithoutStackTrace.
type family ErrorWithoutStackTrace (str :: Symbol) :: a
-- | The singleton for errorWithoutStackTrace.
sErrorWithoutStackTrace :: forall a (str :: Symbol). Sing str -> Sing (ErrorWithoutStackTrace str :: a)
-- | The promotion of undefined.
type family Undefined :: forall a. () => a
-- | The singleton for undefined.
sUndefined :: HasCallStack => Sing Undefined
type family Seq (a1 :: a) (a2 :: b) :: b
infixr 0 `Seq`
sSeq :: forall a b (t1 :: a) (t2 :: b). Sing t1 -> Sing t2 -> Sing (Seq t1 t2)
infixr 0 `sSeq`
type family (a1 :: a ~> b) $! (a2 :: a) :: b
infixr 0 $!
(%$!) :: forall a b (t1 :: a ~> b) (t2 :: a). Sing t1 -> Sing t2 -> Sing (t1 $! t2)
infixr 0 %$!
type family Map (a1 :: a ~> b) (a2 :: [a]) :: [b]
sMap :: forall a b (t1 :: a ~> b) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Map t1 t2)
type family (a1 :: [a]) ++ (a2 :: [a]) :: [a]
infixr 5 ++
(%++) :: forall a (t1 :: [a]) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (t1 ++ t2)
infixr 5 %++
type family Filter (a1 :: a ~> Bool) (a2 :: [a]) :: [a]
sFilter :: forall a (t1 :: a ~> Bool) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Filter t1 t2)
type family Head (a1 :: [a]) :: a
sHead :: forall a (t :: [a]). Sing t -> Sing (Head t)
type family Last (a1 :: [a]) :: a
sLast :: forall a (t :: [a]). Sing t -> Sing (Last t)
type family Tail (a1 :: [a]) :: [a]
sTail :: forall a (t :: [a]). Sing t -> Sing (Tail t)
type family Init (a1 :: [a]) :: [a]
sInit :: forall a (t :: [a]). Sing t -> Sing (Init t)
type family (a1 :: [a]) !! (a2 :: Natural) :: a
infixl 9 !!
(%!!) :: forall a (t1 :: [a]) (t2 :: Natural). Sing t1 -> Sing t2 -> Sing (t1 !! t2)
infixl 9 %!!
type family Null (arg :: t a) :: Bool
sNull :: forall a (t1 :: t a). SFoldable t => Sing t1 -> Sing (Null t1)
type family Length (arg :: t a) :: Natural
sLength :: forall a (t1 :: t a). SFoldable t => Sing t1 -> Sing (Length t1)
type family Reverse (a1 :: [a]) :: [a]
sReverse :: forall a (t :: [a]). Sing t -> Sing (Reverse t)
type family And (a :: t Bool) :: Bool
sAnd :: forall (t1 :: Type -> Type) (t2 :: t1 Bool). SFoldable t1 => Sing t2 -> Sing (And t2)
type family Or (a :: t Bool) :: Bool
sOr :: forall (t1 :: Type -> Type) (t2 :: t1 Bool). SFoldable t1 => Sing t2 -> Sing (Or t2)
type family Any (a1 :: a ~> Bool) (a2 :: t a) :: Bool
sAny :: forall a (t1 :: Type -> Type) (t2 :: a ~> Bool) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (Any t2 t3)
type family All (a1 :: a ~> Bool) (a2 :: t a) :: Bool
sAll :: forall a (t1 :: Type -> Type) (t2 :: a ~> Bool) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (All t2 t3)
type family Concat (a1 :: t [a]) :: [a]
sConcat :: forall (t1 :: Type -> Type) a (t2 :: t1 [a]). SFoldable t1 => Sing t2 -> Sing (Concat t2)
type family ConcatMap (a1 :: a ~> [b]) (a2 :: t a) :: [b]
sConcatMap :: forall a b (t1 :: Type -> Type) (t2 :: a ~> [b]) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (ConcatMap t2 t3)
type family Scanl (a1 :: b ~> a ~> b) (a2 :: b) (a3 :: [a]) :: [b]
sScanl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: [a]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Scanl t1 t2 t3)
type family Scanl1 (a1 :: a ~> a ~> a) (a2 :: [a]) :: [a]
sScanl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Scanl1 t1 t2)
type family Scanr (a1 :: a ~> b ~> b) (a2 :: b) (a3 :: [a]) :: [b]
sScanr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: [a]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Scanr t1 t2 t3)
type family Scanr1 (a1 :: a ~> a ~> a) (a2 :: [a]) :: [a]
sScanr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Scanr1 t1 t2)
type family Replicate (a1 :: Natural) (a2 :: a) :: [a]
sReplicate :: forall a (t1 :: Natural) (t2 :: a). Sing t1 -> Sing t2 -> Sing (Replicate t1 t2)
type family Take (a1 :: Natural) (a2 :: [a]) :: [a]
sTake :: forall a (t1 :: Natural) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Take t1 t2)
type family Drop (a1 :: Natural) (a2 :: [a]) :: [a]
sDrop :: forall a (t1 :: Natural) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Drop t1 t2)
type family TakeWhile (a1 :: a ~> Bool) (a2 :: [a]) :: [a]
sTakeWhile :: forall a (t1 :: a ~> Bool) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (TakeWhile t1 t2)
type family DropWhile (a1 :: a ~> Bool) (a2 :: [a]) :: [a]
sDropWhile :: forall a (t1 :: a ~> Bool) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (DropWhile t1 t2)
type family Span (a1 :: a ~> Bool) (a2 :: [a]) :: ([a], [a])
sSpan :: forall a (t1 :: a ~> Bool) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Span t1 t2)
type family Break (a1 :: a ~> Bool) (a2 :: [a]) :: ([a], [a])
sBreak :: forall a (t1 :: a ~> Bool) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Break t1 t2)
type family SplitAt (a1 :: Natural) (a2 :: [a]) :: ([a], [a])
sSplitAt :: forall a (t1 :: Natural) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (SplitAt t1 t2)
type family NotElem (a1 :: a) (a2 :: t a) :: Bool
sNotElem :: forall a (t1 :: Type -> Type) (t2 :: a) (t3 :: t1 a). (SFoldable t1, SEq a) => Sing t2 -> Sing t3 -> Sing (NotElem t2 t3)
type family Lookup (a1 :: a) (a2 :: [(a, b)]) :: Maybe b
sLookup :: forall a b (t1 :: a) (t2 :: [(a, b)]). SEq a => Sing t1 -> Sing t2 -> Sing (Lookup t1 t2)
type family Zip (a1 :: [a]) (a2 :: [b]) :: [(a, b)]
sZip :: forall a b (t1 :: [a]) (t2 :: [b]). Sing t1 -> Sing t2 -> Sing (Zip t1 t2)
type family Zip3 (a1 :: [a]) (a2 :: [b]) (a3 :: [c]) :: [(a, b, c)]
sZip3 :: forall a b c (t1 :: [a]) (t2 :: [b]) (t3 :: [c]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Zip3 t1 t2 t3)
type family ZipWith (a1 :: a ~> b ~> c) (a2 :: [a]) (a3 :: [b]) :: [c]
sZipWith :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: [a]) (t3 :: [b]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (ZipWith t1 t2 t3)
type family ZipWith3 (a1 :: a ~> b ~> c ~> d) (a2 :: [a]) (a3 :: [b]) (a4 :: [c]) :: [d]
sZipWith3 :: forall a b c d (t1 :: a ~> (b ~> (c ~> d))) (t2 :: [a]) (t3 :: [b]) (t4 :: [c]). Sing t1 -> Sing t2 -> Sing t3 -> Sing t4 -> Sing (ZipWith3 t1 t2 t3 t4)
type family Unzip (a1 :: [(a, b)]) :: ([a], [b])
sUnzip :: forall a b (t :: [(a, b)]). Sing t -> Sing (Unzip t)
type family Unzip3 (a1 :: [(a, b, c)]) :: ([a], [b], [c])
sUnzip3 :: forall a b c (t :: [(a, b, c)]). Sing t -> Sing (Unzip3 t)
type family Unlines (a :: [Symbol]) :: Symbol
sUnlines :: forall (t :: [Symbol]). Sing t -> Sing (Unlines t)
type family Unwords (a :: [Symbol]) :: Symbol
sUnwords :: forall (t :: [Symbol]). Sing t -> Sing (Unwords t)
-- | The shows functions return a function that prepends the
-- output Symbol to an existing Symbol. This allows
-- constant-time concatenation of results using function composition.
type SymbolS = Symbol -> Symbol
-- | show, but with an extra underscore so that its promoted
-- counterpart (Show_) will not clash with the Show
-- class.
show_ :: Show a => a -> String
class PShow a where {
type ShowsPrec (arg :: Natural) (arg1 :: a) (arg2 :: Symbol) :: Symbol;
type Show_ (arg :: a) :: Symbol;
type ShowList (arg :: [a]) (arg1 :: Symbol) :: Symbol;
type ShowsPrec arg :: Natural arg1 :: a arg2 :: Symbol = ShowsPrec_6989586621679807423 arg arg1 arg2;
type Show_ arg :: a = Show__6989586621679807435 arg;
type ShowList arg :: [a] arg1 :: Symbol = ShowList_6989586621679807443 arg arg1;
}
class SShow a
sShowsPrec :: forall (t1 :: Natural) (t2 :: a) (t3 :: Symbol). SShow a => Sing t1 -> Sing t2 -> Sing t3 -> Sing (ShowsPrec t1 t2 t3)
($dmsShowsPrec) :: forall (t1 :: Natural) (t2 :: a) (t3 :: Symbol). (SShow a, ShowsPrec t1 t2 t3 ~ ShowsPrec_6989586621679807423 t1 t2 t3) => Sing t1 -> Sing t2 -> Sing t3 -> Sing (ShowsPrec t1 t2 t3)
sShow_ :: forall (t :: a). SShow a => Sing t -> Sing (Show_ t)
($dmsShow_) :: forall (t :: a). (SShow a, Show_ t ~ Show__6989586621679807435 t) => Sing t -> Sing (Show_ t)
sShowList :: forall (t1 :: [a]) (t2 :: Symbol). SShow a => Sing t1 -> Sing t2 -> Sing (ShowList t1 t2)
($dmsShowList) :: forall (t1 :: [a]) (t2 :: Symbol). (SShow a, ShowList t1 t2 ~ ShowList_6989586621679807443 t1 t2) => Sing t1 -> Sing t2 -> Sing (ShowList t1 t2)
type family Shows (a1 :: a) (a2 :: Symbol) :: Symbol
sShows :: forall a (t1 :: a) (t2 :: Symbol). SShow a => Sing t1 -> Sing t2 -> Sing (Shows t1 t2)
type family ShowChar (a :: Char) (a1 :: Symbol) :: Symbol
sShowChar :: forall (t1 :: Char) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (ShowChar t1 t2)
type family ShowString (a :: Symbol) (a1 :: Symbol) :: Symbol
sShowString :: forall (t1 :: Symbol) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (ShowString t1 t2)
type family ShowParen (a :: Bool) (a1 :: Symbol ~> Symbol) (a2 :: Symbol) :: Symbol
sShowParen :: forall (t1 :: Bool) (t2 :: Symbol ~> Symbol) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (ShowParen t1 t2 t3)
type family FalseSym0 :: Bool
type family TrueSym0 :: Bool
data IfSym0 (a :: TyFun Bool k ~> k ~> k)
data IfSym1 (a6989586621679124436 :: Bool) (b :: TyFun k k ~> k)
data IfSym2 (a6989586621679124436 :: Bool) (a6989586621679124437 :: k) (c :: TyFun k k)
type family IfSym3 (a6989586621679124436 :: Bool) (a6989586621679124437 :: k) (a6989586621679124438 :: k) :: k
data (a :: TyFun Bool Bool ~> Bool) &&@#@$
infixr 3 &&@#@$
data (a6989586621679123502 :: Bool) &&@#@$$ (b :: TyFun Bool Bool)
infixr 3 &&@#@$$
type family (a6989586621679123502 :: Bool) &&@#@$$$ (a6989586621679123503 :: Bool) :: Bool
infixr 3 &&@#@$$$
data (a :: TyFun Bool Bool ~> Bool) ||@#@$
infixr 2 ||@#@$
data (a6989586621679123865 :: Bool) ||@#@$$ (b :: TyFun Bool Bool)
infixr 2 ||@#@$$
type family (a6989586621679123865 :: Bool) ||@#@$$$ (a6989586621679123866 :: Bool) :: Bool
infixr 2 ||@#@$$$
data NotSym0 (a :: TyFun Bool Bool)
type family NotSym1 (a6989586621679124212 :: Bool) :: Bool
type family OtherwiseSym0 :: Bool
type family NothingSym0 :: Maybe a
data JustSym0 (a1 :: TyFun a Maybe a)
type family JustSym1 (a6989586621679050265 :: a) :: Maybe a
data Maybe_Sym0 (a1 :: TyFun b a ~> b ~> Maybe a ~> b)
data Maybe_Sym1 (a6989586621679387993 :: b) (b1 :: TyFun a ~> b Maybe a ~> b)
data Maybe_Sym2 (a6989586621679387993 :: b) (a6989586621679387994 :: a ~> b) (c :: TyFun Maybe a b)
type family Maybe_Sym3 (a6989586621679387993 :: b) (a6989586621679387994 :: a ~> b) (a6989586621679387995 :: Maybe a) :: b
data LeftSym0 (a1 :: TyFun a Either a b)
type family LeftSym1 (a6989586621679050337 :: a) :: Either a b
data RightSym0 (a1 :: TyFun b Either a b)
type family RightSym1 (a6989586621679050339 :: b) :: Either a b
data Either_Sym0 (a1 :: TyFun a ~> c b ~> c ~> Either a b ~> c)
data Either_Sym1 (a6989586621679259290 :: a ~> c) (b1 :: TyFun b ~> c Either a b ~> c)
data Either_Sym2 (a6989586621679259290 :: a ~> c) (a6989586621679259291 :: b ~> c) (c1 :: TyFun Either a b c)
type family Either_Sym3 (a6989586621679259290 :: a ~> c) (a6989586621679259291 :: b ~> c) (a6989586621679259292 :: Either a b) :: c
type family LTSym0 :: Ordering
type family EQSym0 :: Ordering
type family GTSym0 :: Ordering
data (a1 :: TyFun a [a] ~> [a]) :@#@$
infixr 5 :@#@$
data (a6989586621679050289 :: a) :@#@$$ (b :: TyFun [a] [a])
infixr 5 :@#@$$
type family (a6989586621679050289 :: a) :@#@$$$ (a6989586621679050290 :: [a]) :: [a]
infixr 5 :@#@$$$
type family NilSym0 :: [a]
type family Tuple0Sym0 :: ()
data Tuple2Sym0 (a1 :: TyFun a b ~> (a, b))
data Tuple2Sym1 (a6989586621679050782 :: a) (b1 :: TyFun b (a, b))
type family Tuple2Sym2 (a6989586621679050782 :: a) (a6989586621679050783 :: b) :: (a, b)
data Tuple3Sym0 (a1 :: TyFun a b ~> c ~> (a, b, c))
data Tuple3Sym1 (a6989586621679050813 :: a) (b1 :: TyFun b c ~> (a, b, c))
data Tuple3Sym2 (a6989586621679050813 :: a) (a6989586621679050814 :: b) (c1 :: TyFun c (a, b, c))
type family Tuple3Sym3 (a6989586621679050813 :: a) (a6989586621679050814 :: b) (a6989586621679050815 :: c) :: (a, b, c)
data Tuple4Sym0 (a1 :: TyFun a b ~> c ~> d ~> (a, b, c, d))
data Tuple4Sym1 (a6989586621679050862 :: a) (b1 :: TyFun b c ~> d ~> (a, b, c, d))
data Tuple4Sym2 (a6989586621679050862 :: a) (a6989586621679050863 :: b) (c1 :: TyFun c d ~> (a, b, c, d))
data Tuple4Sym3 (a6989586621679050862 :: a) (a6989586621679050863 :: b) (a6989586621679050864 :: c) (d1 :: TyFun d (a, b, c, d))
type family Tuple4Sym4 (a6989586621679050862 :: a) (a6989586621679050863 :: b) (a6989586621679050864 :: c) (a6989586621679050865 :: d) :: (a, b, c, d)
data Tuple5Sym0 (a1 :: TyFun a b ~> c ~> d ~> e ~> (a, b, c, d, e))
data Tuple5Sym1 (a6989586621679050931 :: a) (b1 :: TyFun b c ~> d ~> e ~> (a, b, c, d, e))
data Tuple5Sym2 (a6989586621679050931 :: a) (a6989586621679050932 :: b) (c1 :: TyFun c d ~> e ~> (a, b, c, d, e))
data Tuple5Sym3 (a6989586621679050931 :: a) (a6989586621679050932 :: b) (a6989586621679050933 :: c) (d1 :: TyFun d e ~> (a, b, c, d, e))
data Tuple5Sym4 (a6989586621679050931 :: a) (a6989586621679050932 :: b) (a6989586621679050933 :: c) (a6989586621679050934 :: d) (e1 :: TyFun e (a, b, c, d, e))
type family Tuple5Sym5 (a6989586621679050931 :: a) (a6989586621679050932 :: b) (a6989586621679050933 :: c) (a6989586621679050934 :: d) (a6989586621679050935 :: e) :: (a, b, c, d, e)
data Tuple6Sym0 (a1 :: TyFun a b ~> c ~> d ~> e ~> f ~> (a, b, c, d, e, f))
data Tuple6Sym1 (a6989586621679051022 :: a) (b1 :: TyFun b c ~> d ~> e ~> f ~> (a, b, c, d, e, f))
data Tuple6Sym2 (a6989586621679051022 :: a) (a6989586621679051023 :: b) (c1 :: TyFun c d ~> e ~> f ~> (a, b, c, d, e, f))
data Tuple6Sym3 (a6989586621679051022 :: a) (a6989586621679051023 :: b) (a6989586621679051024 :: c) (d1 :: TyFun d e ~> f ~> (a, b, c, d, e, f))
data Tuple6Sym4 (a6989586621679051022 :: a) (a6989586621679051023 :: b) (a6989586621679051024 :: c) (a6989586621679051025 :: d) (e1 :: TyFun e f ~> (a, b, c, d, e, f))
data Tuple6Sym5 (a6989586621679051022 :: a) (a6989586621679051023 :: b) (a6989586621679051024 :: c) (a6989586621679051025 :: d) (a6989586621679051026 :: e) (f1 :: TyFun f (a, b, c, d, e, f))
type family Tuple6Sym6 (a6989586621679051022 :: a) (a6989586621679051023 :: b) (a6989586621679051024 :: c) (a6989586621679051025 :: d) (a6989586621679051026 :: e) (a6989586621679051027 :: f) :: (a, b, c, d, e, f)
data Tuple7Sym0 (a1 :: TyFun a b ~> c ~> d ~> e ~> f ~> g ~> (a, b, c, d, e, f, g))
data Tuple7Sym1 (a6989586621679051137 :: a) (b1 :: TyFun b c ~> d ~> e ~> f ~> g ~> (a, b, c, d, e, f, g))
data Tuple7Sym2 (a6989586621679051137 :: a) (a6989586621679051138 :: b) (c1 :: TyFun c d ~> e ~> f ~> g ~> (a, b, c, d, e, f, g))
data Tuple7Sym3 (a6989586621679051137 :: a) (a6989586621679051138 :: b) (a6989586621679051139 :: c) (d1 :: TyFun d e ~> f ~> g ~> (a, b, c, d, e, f, g))
data Tuple7Sym4 (a6989586621679051137 :: a) (a6989586621679051138 :: b) (a6989586621679051139 :: c) (a6989586621679051140 :: d) (e1 :: TyFun e f ~> g ~> (a, b, c, d, e, f, g))
data Tuple7Sym5 (a6989586621679051137 :: a) (a6989586621679051138 :: b) (a6989586621679051139 :: c) (a6989586621679051140 :: d) (a6989586621679051141 :: e) (f1 :: TyFun f g ~> (a, b, c, d, e, f, g))
data Tuple7Sym6 (a6989586621679051137 :: a) (a6989586621679051138 :: b) (a6989586621679051139 :: c) (a6989586621679051140 :: d) (a6989586621679051141 :: e) (a6989586621679051142 :: f) (g1 :: TyFun g (a, b, c, d, e, f, g))
type family Tuple7Sym7 (a6989586621679051137 :: a) (a6989586621679051138 :: b) (a6989586621679051139 :: c) (a6989586621679051140 :: d) (a6989586621679051141 :: e) (a6989586621679051142 :: f) (a6989586621679051143 :: g) :: (a, b, c, d, e, f, g)
data FstSym0 (a1 :: TyFun (a, b) a)
type family FstSym1 (a6989586621679147673 :: (a, b)) :: a
data SndSym0 (a1 :: TyFun (a, b) b)
type family SndSym1 (a6989586621679147669 :: (a, b)) :: b
data CurrySym0 (a1 :: TyFun (a, b) ~> c a ~> b ~> c)
data CurrySym1 (a6989586621679147661 :: (a, b) ~> c) (b1 :: TyFun a b ~> c)
data CurrySym2 (a6989586621679147661 :: (a, b) ~> c) (a6989586621679147662 :: a) (c1 :: TyFun b c)
type family CurrySym3 (a6989586621679147661 :: (a, b) ~> c) (a6989586621679147662 :: a) (a6989586621679147663 :: b) :: c
data UncurrySym0 (a1 :: TyFun a ~> b ~> c (a, b) ~> c)
data UncurrySym1 (a6989586621679147653 :: a ~> b ~> c) (b1 :: TyFun (a, b) c)
type family UncurrySym2 (a6989586621679147653 :: a ~> b ~> c) (a6989586621679147654 :: (a, b)) :: c
data (a1 :: TyFun a a ~> Bool) ==@#@$
infix 4 ==@#@$
data (a6989586621679128025 :: a) ==@#@$$ (b :: TyFun a Bool)
infix 4 ==@#@$$
type family (a6989586621679128025 :: a) ==@#@$$$ (a6989586621679128026 :: a) :: Bool
infix 4 ==@#@$$$
data (a1 :: TyFun a a ~> Bool) /=@#@$
infix 4 /=@#@$
data (a6989586621679128030 :: a) /=@#@$$ (b :: TyFun a Bool)
infix 4 /=@#@$$
type family (a6989586621679128030 :: a) /=@#@$$$ (a6989586621679128031 :: a) :: Bool
infix 4 /=@#@$$$
data CompareSym0 (a1 :: TyFun a a ~> Ordering)
data CompareSym1 (a6989586621679189966 :: a) (b :: TyFun a Ordering)
type family CompareSym2 (a6989586621679189966 :: a) (a6989586621679189967 :: a) :: Ordering
data (a1 :: TyFun a a ~> Bool) <@#@$
infix 4 <@#@$
data (a6989586621679189971 :: a) <@#@$$ (b :: TyFun a Bool)
infix 4 <@#@$$
type family (a6989586621679189971 :: a) <@#@$$$ (a6989586621679189972 :: a) :: Bool
infix 4 <@#@$$$
data (a1 :: TyFun a a ~> Bool) <=@#@$
infix 4 <=@#@$
data (a6989586621679189976 :: a) <=@#@$$ (b :: TyFun a Bool)
infix 4 <=@#@$$
type family (a6989586621679189976 :: a) <=@#@$$$ (a6989586621679189977 :: a) :: Bool
infix 4 <=@#@$$$
data (a1 :: TyFun a a ~> Bool) >@#@$
infix 4 >@#@$
data (a6989586621679189981 :: a) >@#@$$ (b :: TyFun a Bool)
infix 4 >@#@$$
type family (a6989586621679189981 :: a) >@#@$$$ (a6989586621679189982 :: a) :: Bool
infix 4 >@#@$$$
data (a1 :: TyFun a a ~> Bool) >=@#@$
infix 4 >=@#@$
data (a6989586621679189986 :: a) >=@#@$$ (b :: TyFun a Bool)
infix 4 >=@#@$$
type family (a6989586621679189986 :: a) >=@#@$$$ (a6989586621679189987 :: a) :: Bool
infix 4 >=@#@$$$
data MaxSym0 (a1 :: TyFun a a ~> a)
data MaxSym1 (a6989586621679189991 :: a) (b :: TyFun a a)
type family MaxSym2 (a6989586621679189991 :: a) (a6989586621679189992 :: a) :: a
data MinSym0 (a1 :: TyFun a a ~> a)
data MinSym1 (a6989586621679189996 :: a) (b :: TyFun a a)
type family MinSym2 (a6989586621679189996 :: a) (a6989586621679189997 :: a) :: a
data ToEnumSym0 (a1 :: TyFun Natural a)
type family ToEnumSym1 (a6989586621679414060 :: Natural) :: a
data FromEnumSym0 (a1 :: TyFun a Natural)
type family FromEnumSym1 (a6989586621679414063 :: a) :: Natural
data EnumFromToSym0 (a1 :: TyFun a a ~> [a])
data EnumFromToSym1 (a6989586621679414067 :: a) (b :: TyFun a [a])
type family EnumFromToSym2 (a6989586621679414067 :: a) (a6989586621679414068 :: a) :: [a]
data EnumFromThenToSym0 (a1 :: TyFun a a ~> a ~> [a])
data EnumFromThenToSym1 (a6989586621679414073 :: a) (b :: TyFun a a ~> [a])
data EnumFromThenToSym2 (a6989586621679414073 :: a) (a6989586621679414074 :: a) (c :: TyFun a [a])
type family EnumFromThenToSym3 (a6989586621679414073 :: a) (a6989586621679414074 :: a) (a6989586621679414075 :: a) :: [a]
type family MinBoundSym0 :: a
type family MaxBoundSym0 :: a
data (a1 :: TyFun a a ~> a) +@#@$
infixl 6 +@#@$
data (a6989586621679398568 :: a) +@#@$$ (b :: TyFun a a)
infixl 6 +@#@$$
type family (a6989586621679398568 :: a) +@#@$$$ (a6989586621679398569 :: a) :: a
infixl 6 +@#@$$$
data (a1 :: TyFun a a ~> a) -@#@$
infixl 6 -@#@$
data (a6989586621679398573 :: a) -@#@$$ (b :: TyFun a a)
infixl 6 -@#@$$
type family (a6989586621679398573 :: a) -@#@$$$ (a6989586621679398574 :: a) :: a
infixl 6 -@#@$$$
data (a1 :: TyFun a a ~> a) *@#@$
infixl 7 *@#@$
data (a6989586621679398578 :: a) *@#@$$ (b :: TyFun a a)
infixl 7 *@#@$$
type family (a6989586621679398578 :: a) *@#@$$$ (a6989586621679398579 :: a) :: a
infixl 7 *@#@$$$
data NegateSym0 (a1 :: TyFun a a)
type family NegateSym1 (a6989586621679398582 :: a) :: a
data AbsSym0 (a1 :: TyFun a a)
type family AbsSym1 (a6989586621679398585 :: a) :: a
data SignumSym0 (a1 :: TyFun a a)
type family SignumSym1 (a6989586621679398588 :: a) :: a
data FromIntegerSym0 (a1 :: TyFun Natural a)
type family FromIntegerSym1 (a6989586621679398591 :: Natural) :: a
data SubtractSym0 (a1 :: TyFun a a ~> a)
data SubtractSym1 (a6989586621679398561 :: a) (b :: TyFun a a)
type family SubtractSym2 (a6989586621679398561 :: a) (a6989586621679398562 :: a) :: a
data (a1 :: TyFun a a ~> a) <>@#@$
infixr 6 <>@#@$
data (a6989586621679173979 :: a) <>@#@$$ (b :: TyFun a a)
infixr 6 <>@#@$$
type family (a6989586621679173979 :: a) <>@#@$$$ (a6989586621679173980 :: a) :: a
infixr 6 <>@#@$$$
type family MemptySym0 :: a
data MappendSym0 (a1 :: TyFun a a ~> a)
data MappendSym1 (a6989586621679860746 :: a) (b :: TyFun a a)
type family MappendSym2 (a6989586621679860746 :: a) (a6989586621679860747 :: a) :: a
data MconcatSym0 (a1 :: TyFun [a] a)
type family MconcatSym1 (a6989586621679860750 :: [a]) :: a
data FmapSym0 (a1 :: TyFun a ~> b f a ~> f b)
data FmapSym1 (a6989586621679271227 :: a ~> b) (b1 :: TyFun f a f b)
type family FmapSym2 (a6989586621679271227 :: a ~> b) (a6989586621679271228 :: f a) :: f b
data (a1 :: TyFun a f b ~> f a) <$@#@$
infixl 4 <$@#@$
data (a6989586621679271232 :: a) <$@#@$$ (b1 :: TyFun f b f a)
infixl 4 <$@#@$$
type family (a6989586621679271232 :: a) <$@#@$$$ (a6989586621679271233 :: f b) :: f a
infixl 4 <$@#@$$$
data (a1 :: TyFun a ~> b f a ~> f b) <$>@#@$
infixl 4 <$>@#@$
data (a6989586621679357520 :: a ~> b) <$>@#@$$ (b1 :: TyFun f a f b)
infixl 4 <$>@#@$$
type family (a6989586621679357520 :: a ~> b) <$>@#@$$$ (a6989586621679357521 :: f a) :: f b
infixl 4 <$>@#@$$$
data PureSym0 (a1 :: TyFun a f a)
type family PureSym1 (a6989586621679271251 :: a) :: f a
data (a1 :: TyFun f a ~> b f a ~> f b) <*>@#@$
infixl 4 <*>@#@$
data (a6989586621679271255 :: f a ~> b) <*>@#@$$ (b1 :: TyFun f a f b)
infixl 4 <*>@#@$$
type family (a6989586621679271255 :: f a ~> b) <*>@#@$$$ (a6989586621679271256 :: f a) :: f b
infixl 4 <*>@#@$$$
data (a1 :: TyFun f a f b ~> f b) *>@#@$
infixl 4 *>@#@$
data (a6989586621679271267 :: f a) *>@#@$$ (b1 :: TyFun f b f b)
infixl 4 *>@#@$$
type family (a6989586621679271267 :: f a) *>@#@$$$ (a6989586621679271268 :: f b) :: f b
infixl 4 *>@#@$$$
data (a1 :: TyFun f a f b ~> f a) <*@#@$
infixl 4 <*@#@$
data (a6989586621679271272 :: f a) <*@#@$$ (b1 :: TyFun f b f a)
infixl 4 <*@#@$$
type family (a6989586621679271272 :: f a) <*@#@$$$ (a6989586621679271273 :: f b) :: f a
infixl 4 <*@#@$$$
data LiftA2Sym0 (a1 :: TyFun a ~> b ~> c f a ~> f b ~> f c)
data LiftA2Sym1 (a6989586621679271261 :: a ~> b ~> c) (b1 :: TyFun f a f b ~> f c)
data LiftA2Sym2 (a6989586621679271261 :: a ~> b ~> c) (a6989586621679271262 :: f a) (c1 :: TyFun f b f c)
type family LiftA2Sym3 (a6989586621679271261 :: a ~> b ~> c) (a6989586621679271262 :: f a) (a6989586621679271263 :: f b) :: f c
data (a1 :: TyFun m a a ~> m b ~> m b) >>=@#@$
infixl 1 >>=@#@$
data (a6989586621679271335 :: m a) >>=@#@$$ (b1 :: TyFun a ~> m b m b)
infixl 1 >>=@#@$$
type family (a6989586621679271335 :: m a) >>=@#@$$$ (a6989586621679271336 :: a ~> m b) :: m b
infixl 1 >>=@#@$$$
data (a1 :: TyFun m a m b ~> m b) >>@#@$
infixl 1 >>@#@$
data (a6989586621679271340 :: m a) >>@#@$$ (b1 :: TyFun m b m b)
infixl 1 >>@#@$$
type family (a6989586621679271340 :: m a) >>@#@$$$ (a6989586621679271341 :: m b) :: m b
infixl 1 >>@#@$$$
data ReturnSym0 (a1 :: TyFun a m a)
type family ReturnSym1 (a6989586621679271344 :: a) :: m a
data FailSym0 (a1 :: TyFun [Char] m a)
type family FailSym1 (a6989586621679365940 :: [Char]) :: m a
data MapM_Sym0 (a1 :: TyFun a ~> m b t a ~> m ())
data MapM_Sym1 (a6989586621679922449 :: a ~> m b) (b1 :: TyFun t a m ())
type family MapM_Sym2 (a6989586621679922449 :: a ~> m b) (a6989586621679922450 :: t a) :: m ()
data Sequence_Sym0 (a1 :: TyFun t m a m ())
type family Sequence_Sym1 (a6989586621679922425 :: t m a) :: m ()
data (a1 :: TyFun a ~> m b m a ~> m b) =<<@#@$
infixr 1 =<<@#@$
data (a6989586621679271176 :: a ~> m b) =<<@#@$$ (b1 :: TyFun m a m b)
infixr 1 =<<@#@$$
type family (a6989586621679271176 :: a ~> m b) =<<@#@$$$ (a6989586621679271177 :: m a) :: m b
infixr 1 =<<@#@$$$
data ElemSym0 (a1 :: TyFun a t a ~> Bool)
data ElemSym1 (a6989586621679922567 :: a) (b :: TyFun t a Bool)
type family ElemSym2 (a6989586621679922567 :: a) (a6989586621679922568 :: t a) :: Bool
data FoldMapSym0 (a1 :: TyFun a ~> m t a ~> m)
data FoldMapSym1 (a6989586621679922515 :: a ~> m) (b :: TyFun t a m)
type family FoldMapSym2 (a6989586621679922515 :: a ~> m) (a6989586621679922516 :: t a) :: m
data FoldrSym0 (a1 :: TyFun a ~> b ~> b b ~> t a ~> b)
data FoldrSym1 (a6989586621679922521 :: a ~> b ~> b) (b1 :: TyFun b t a ~> b)
data FoldrSym2 (a6989586621679922521 :: a ~> b ~> b) (a6989586621679922522 :: b) (c :: TyFun t a b)
type family FoldrSym3 (a6989586621679922521 :: a ~> b ~> b) (a6989586621679922522 :: b) (a6989586621679922523 :: t a) :: b
data FoldlSym0 (a1 :: TyFun b ~> a ~> b b ~> t a ~> b)
data FoldlSym1 (a6989586621679922535 :: b ~> a ~> b) (b1 :: TyFun b t a ~> b)
data FoldlSym2 (a6989586621679922535 :: b ~> a ~> b) (a6989586621679922536 :: b) (c :: TyFun t a b)
type family FoldlSym3 (a6989586621679922535 :: b ~> a ~> b) (a6989586621679922536 :: b) (a6989586621679922537 :: t a) :: b
data Foldr1Sym0 (a1 :: TyFun a ~> a ~> a t a ~> a)
data Foldr1Sym1 (a6989586621679922548 :: a ~> a ~> a) (b :: TyFun t a a)
type family Foldr1Sym2 (a6989586621679922548 :: a ~> a ~> a) (a6989586621679922549 :: t a) :: a
data Foldl1Sym0 (a1 :: TyFun a ~> a ~> a t a ~> a)
data Foldl1Sym1 (a6989586621679922553 :: a ~> a ~> a) (b :: TyFun t a a)
type family Foldl1Sym2 (a6989586621679922553 :: a ~> a ~> a) (a6989586621679922554 :: t a) :: a
data MaximumSym0 (a1 :: TyFun t a a)
type family MaximumSym1 (a6989586621679922571 :: t a) :: a
data MinimumSym0 (a1 :: TyFun t a a)
type family MinimumSym1 (a6989586621679922574 :: t a) :: a
data ProductSym0 (a1 :: TyFun t a a)
type family ProductSym1 (a6989586621679922580 :: t a) :: a
data SumSym0 (a1 :: TyFun t a a)
type family SumSym1 (a6989586621679922577 :: t a) :: a
data TraverseSym0 (a1 :: TyFun a ~> f b t a ~> f t b)
data TraverseSym1 (a6989586621680096860 :: a ~> f b) (b1 :: TyFun t a f t b)
type family TraverseSym2 (a6989586621680096860 :: a ~> f b) (a6989586621680096861 :: t a) :: f t b
data SequenceASym0 (a1 :: TyFun t f a f t a)
type family SequenceASym1 (a6989586621680096864 :: t f a) :: f t a
data MapMSym0 (a1 :: TyFun a ~> m b t a ~> m t b)
data MapMSym1 (a6989586621680096868 :: a ~> m b) (b1 :: TyFun t a m t b)
type family MapMSym2 (a6989586621680096868 :: a ~> m b) (a6989586621680096869 :: t a) :: m t b
data SequenceSym0 (a1 :: TyFun t m a m t a)
type family SequenceSym1 (a6989586621680096872 :: t m a) :: m t a
data IdSym0 (a1 :: TyFun a a)
type family IdSym1 (a6989586621679154359 :: a) :: a
data ConstSym0 (a1 :: TyFun a b ~> a)
data ConstSym1 (a6989586621679154354 :: a) (b1 :: TyFun b a)
type family ConstSym2 (a6989586621679154354 :: a) (a6989586621679154355 :: b) :: a
data (a1 :: TyFun b ~> c a ~> b ~> a ~> c) .@#@$
infixr 9 .@#@$
data (a6989586621679154339 :: b ~> c) .@#@$$ (b1 :: TyFun a ~> b a ~> c)
infixr 9 .@#@$$
data ( (a6989586621679154339 :: b ~> c) .@#@$$$ (a6989586621679154340 :: a ~> b) ) (c1 :: TyFun a c)
infixr 9 .@#@$$$
type family ( (a6989586621679154339 :: b ~> c) .@#@$$$$ (a6989586621679154340 :: a ~> b) ) (a6989586621679154341 :: a) :: c
infixr 9 .@#@$$$$
data FlipSym0 (a1 :: TyFun a ~> b ~> c b ~> a ~> c)
data FlipSym1 (a6989586621679154327 :: a ~> b ~> c) (b1 :: TyFun b a ~> c)
data FlipSym2 (a6989586621679154327 :: a ~> b ~> c) (a6989586621679154328 :: b) (c1 :: TyFun a c)
type family FlipSym3 (a6989586621679154327 :: a ~> b ~> c) (a6989586621679154328 :: b) (a6989586621679154329 :: a) :: c
data (a1 :: TyFun a ~> b a ~> b) $@#@$
infixr 0 $@#@$
data (a6989586621679154308 :: a ~> b) $@#@$$ (b1 :: TyFun a b)
infixr 0 $@#@$$
type family (a6989586621679154308 :: a ~> b) $@#@$$$ (a6989586621679154309 :: a) :: b
infixr 0 $@#@$$$
data UntilSym0 (a1 :: TyFun a ~> Bool a ~> a ~> a ~> a)
data UntilSym1 (a6989586621679154281 :: a ~> Bool) (b :: TyFun a ~> a a ~> a)
data UntilSym2 (a6989586621679154281 :: a ~> Bool) (a6989586621679154282 :: a ~> a) (c :: TyFun a a)
type family UntilSym3 (a6989586621679154281 :: a ~> Bool) (a6989586621679154282 :: a ~> a) (a6989586621679154283 :: a) :: a
data AsTypeOfSym0 (a1 :: TyFun a a ~> a)
data AsTypeOfSym1 (a6989586621679154319 :: a) (b :: TyFun a a)
type family AsTypeOfSym2 (a6989586621679154319 :: a) (a6989586621679154320 :: a) :: a
data ErrorSym0 (a1 :: TyFun Symbol a)
type family ErrorSym1 (a6989586621679368947 :: Symbol) :: a
data ErrorWithoutStackTraceSym0 (a1 :: TyFun Symbol a)
type family ErrorWithoutStackTraceSym1 (a6989586621679369227 :: Symbol) :: a
type family UndefinedSym0 :: a
data SeqSym0 (a1 :: TyFun a b ~> b)
infixr 0 `SeqSym0`
data SeqSym1 (a6989586621679154272 :: a) (b1 :: TyFun b b)
infixr 0 `SeqSym1`
type family SeqSym2 (a6989586621679154272 :: a) (a6989586621679154273 :: b) :: b
infixr 0 `SeqSym2`
data (a1 :: TyFun a ~> b a ~> b) $!@#@$
infixr 0 $!@#@$
data (a6989586621679154299 :: a ~> b) $!@#@$$ (b1 :: TyFun a b)
infixr 0 $!@#@$$
type family (a6989586621679154299 :: a ~> b) $!@#@$$$ (a6989586621679154300 :: a) :: b
infixr 0 $!@#@$$$
data MapSym0 (a1 :: TyFun a ~> b [a] ~> [b])
data MapSym1 (a6989586621679154373 :: a ~> b) (b1 :: TyFun [a] [b])
type family MapSym2 (a6989586621679154373 :: a ~> b) (a6989586621679154374 :: [a]) :: [b]
data (a1 :: TyFun [a] [a] ~> [a]) ++@#@$
infixr 5 ++@#@$
data (a6989586621679154364 :: [a]) ++@#@$$ (b :: TyFun [a] [a])
infixr 5 ++@#@$$
type family (a6989586621679154364 :: [a]) ++@#@$$$ (a6989586621679154365 :: [a]) :: [a]
infixr 5 ++@#@$$$
data FilterSym0 (a1 :: TyFun a ~> Bool [a] ~> [a])
data FilterSym1 (a6989586621679544674 :: a ~> Bool) (b :: TyFun [a] [a])
type family FilterSym2 (a6989586621679544674 :: a ~> Bool) (a6989586621679544675 :: [a]) :: [a]
data HeadSym0 (a1 :: TyFun [a] a)
type family HeadSym1 (a6989586621679545466 :: [a]) :: a
data LastSym0 (a1 :: TyFun [a] a)
type family LastSym1 (a6989586621679545460 :: [a]) :: a
data TailSym0 (a1 :: TyFun [a] [a])
type family TailSym1 (a6989586621679545456 :: [a]) :: [a]
data InitSym0 (a1 :: TyFun [a] [a])
type family InitSym1 (a6989586621679545444 :: [a]) :: [a]
data (a1 :: TyFun [a] Natural ~> a) !!@#@$
infixl 9 !!@#@$
data (a6989586621679544266 :: [a]) !!@#@$$ (b :: TyFun Natural a)
infixl 9 !!@#@$$
type family (a6989586621679544266 :: [a]) !!@#@$$$ (a6989586621679544267 :: Natural) :: a
infixl 9 !!@#@$$$
data NullSym0 (a1 :: TyFun t a Bool)
type family NullSym1 (a6989586621679922560 :: t a) :: Bool
data LengthSym0 (a1 :: TyFun t a Natural)
type family LengthSym1 (a6989586621679922563 :: t a) :: Natural
data ReverseSym0 (a1 :: TyFun [a] [a])
type family ReverseSym1 (a6989586621679545429 :: [a]) :: [a]
data AndSym0 (a :: TyFun t Bool Bool)
type family AndSym1 (a6989586621679922378 :: t Bool) :: Bool
data OrSym0 (a :: TyFun t Bool Bool)
type family OrSym1 (a6989586621679922372 :: t Bool) :: Bool
data AnySym0 (a1 :: TyFun a ~> Bool t a ~> Bool)
data AnySym1 (a6989586621679922364 :: a ~> Bool) (b :: TyFun t a Bool)
type family AnySym2 (a6989586621679922364 :: a ~> Bool) (a6989586621679922365 :: t a) :: Bool
data AllSym0 (a1 :: TyFun a ~> Bool t a ~> Bool)
data AllSym1 (a6989586621679922355 :: a ~> Bool) (b :: TyFun t a Bool)
type family AllSym2 (a6989586621679922355 :: a ~> Bool) (a6989586621679922356 :: t a) :: Bool
data ConcatSym0 (a1 :: TyFun t [a] [a])
type family ConcatSym1 (a6989586621679922398 :: t [a]) :: [a]
data ConcatMapSym0 (a1 :: TyFun a ~> [b] t a ~> [b])
data ConcatMapSym1 (a6989586621679922383 :: a ~> [b]) (b1 :: TyFun t a [b])
type family ConcatMapSym2 (a6989586621679922383 :: a ~> [b]) (a6989586621679922384 :: t a) :: [b]
data ScanlSym0 (a1 :: TyFun b ~> a ~> b b ~> [a] ~> [b])
data ScanlSym1 (a6989586621679545226 :: b ~> a ~> b) (b1 :: TyFun b [a] ~> [b])
data ScanlSym2 (a6989586621679545226 :: b ~> a ~> b) (a6989586621679545227 :: b) (c :: TyFun [a] [b])
type family ScanlSym3 (a6989586621679545226 :: b ~> a ~> b) (a6989586621679545227 :: b) (a6989586621679545228 :: [a]) :: [b]
data Scanl1Sym0 (a1 :: TyFun a ~> a ~> a [a] ~> [a])
data Scanl1Sym1 (a6989586621679545217 :: a ~> a ~> a) (b :: TyFun [a] [a])
type family Scanl1Sym2 (a6989586621679545217 :: a ~> a ~> a) (a6989586621679545218 :: [a]) :: [a]
data ScanrSym0 (a1 :: TyFun a ~> b ~> b b ~> [a] ~> [b])
data ScanrSym1 (a6989586621679545199 :: a ~> b ~> b) (b1 :: TyFun b [a] ~> [b])
data ScanrSym2 (a6989586621679545199 :: a ~> b ~> b) (a6989586621679545200 :: b) (c :: TyFun [a] [b])
type family ScanrSym3 (a6989586621679545199 :: a ~> b ~> b) (a6989586621679545200 :: b) (a6989586621679545201 :: [a]) :: [b]
data Scanr1Sym0 (a1 :: TyFun a ~> a ~> a [a] ~> [a])
data Scanr1Sym1 (a6989586621679545179 :: a ~> a ~> a) (b :: TyFun [a] [a])
type family Scanr1Sym2 (a6989586621679545179 :: a ~> a ~> a) (a6989586621679545180 :: [a]) :: [a]
data ReplicateSym0 (a1 :: TyFun Natural a ~> [a])
data ReplicateSym1 (a6989586621679544286 :: Natural) (b :: TyFun a [a])
type family ReplicateSym2 (a6989586621679544286 :: Natural) (a6989586621679544287 :: a) :: [a]
data TakeSym0 (a1 :: TyFun Natural [a] ~> [a])
data TakeSym1 (a6989586621679544445 :: Natural) (b :: TyFun [a] [a])
type family TakeSym2 (a6989586621679544445 :: Natural) (a6989586621679544446 :: [a]) :: [a]
data DropSym0 (a1 :: TyFun Natural [a] ~> [a])
data DropSym1 (a6989586621679544432 :: Natural) (b :: TyFun [a] [a])
type family DropSym2 (a6989586621679544432 :: Natural) (a6989586621679544433 :: [a]) :: [a]
data TakeWhileSym0 (a1 :: TyFun a ~> Bool [a] ~> [a])
data TakeWhileSym1 (a6989586621679544574 :: a ~> Bool) (b :: TyFun [a] [a])
type family TakeWhileSym2 (a6989586621679544574 :: a ~> Bool) (a6989586621679544575 :: [a]) :: [a]
data DropWhileSym0 (a1 :: TyFun a ~> Bool [a] ~> [a])
data DropWhileSym1 (a6989586621679544559 :: a ~> Bool) (b :: TyFun [a] [a])
type family DropWhileSym2 (a6989586621679544559 :: a ~> Bool) (a6989586621679544560 :: [a]) :: [a]
data DropWhileEndSym0 (a1 :: TyFun a ~> Bool [a] ~> [a])
data DropWhileEndSym1 (a6989586621679544538 :: a ~> Bool) (b :: TyFun [a] [a])
type family DropWhileEndSym2 (a6989586621679544538 :: a ~> Bool) (a6989586621679544539 :: [a]) :: [a]
data SpanSym0 (a1 :: TyFun a ~> Bool [a] ~> ([a], [a]))
data SpanSym1 (a6989586621679544497 :: a ~> Bool) (b :: TyFun [a] ([a], [a]))
type family SpanSym2 (a6989586621679544497 :: a ~> Bool) (a6989586621679544498 :: [a]) :: ([a], [a])
data BreakSym0 (a1 :: TyFun a ~> Bool [a] ~> ([a], [a]))
data BreakSym1 (a6989586621679544458 :: a ~> Bool) (b :: TyFun [a] ([a], [a]))
type family BreakSym2 (a6989586621679544458 :: a ~> Bool) (a6989586621679544459 :: [a]) :: ([a], [a])
data SplitAtSym0 (a1 :: TyFun Natural [a] ~> ([a], [a]))
data SplitAtSym1 (a6989586621679544425 :: Natural) (b :: TyFun [a] ([a], [a]))
type family SplitAtSym2 (a6989586621679544425 :: Natural) (a6989586621679544426 :: [a]) :: ([a], [a])
data NotElemSym0 (a1 :: TyFun a t a ~> Bool)
data NotElemSym1 (a6989586621679922306 :: a) (b :: TyFun t a Bool)
type family NotElemSym2 (a6989586621679922306 :: a) (a6989586621679922307 :: t a) :: Bool
data LookupSym0 (a1 :: TyFun a [(a, b)] ~> Maybe b)
data LookupSym1 (a6989586621679544349 :: a) (b1 :: TyFun [(a, b)] Maybe b)
type family LookupSym2 (a6989586621679544349 :: a) (a6989586621679544350 :: [(a, b)]) :: Maybe b
data ZipSym0 (a1 :: TyFun [a] [b] ~> [(a, b)])
data ZipSym1 (a6989586621679544986 :: [a]) (b1 :: TyFun [b] [(a, b)])
type family ZipSym2 (a6989586621679544986 :: [a]) (a6989586621679544987 :: [b]) :: [(a, b)]
data Zip3Sym0 (a1 :: TyFun [a] [b] ~> [c] ~> [(a, b, c)])
data Zip3Sym1 (a6989586621679544974 :: [a]) (b1 :: TyFun [b] [c] ~> [(a, b, c)])
data Zip3Sym2 (a6989586621679544974 :: [a]) (a6989586621679544975 :: [b]) (c1 :: TyFun [c] [(a, b, c)])
type family Zip3Sym3 (a6989586621679544974 :: [a]) (a6989586621679544975 :: [b]) (a6989586621679544976 :: [c]) :: [(a, b, c)]
data ZipWithSym0 (a1 :: TyFun a ~> b ~> c [a] ~> [b] ~> [c])
data ZipWithSym1 (a6989586621679544962 :: a ~> b ~> c) (b1 :: TyFun [a] [b] ~> [c])
data ZipWithSym2 (a6989586621679544962 :: a ~> b ~> c) (a6989586621679544963 :: [a]) (c1 :: TyFun [b] [c])
type family ZipWithSym3 (a6989586621679544962 :: a ~> b ~> c) (a6989586621679544963 :: [a]) (a6989586621679544964 :: [b]) :: [c]
data ZipWith3Sym0 (a1 :: TyFun a ~> b ~> c ~> d [a] ~> [b] ~> [c] ~> [d])
data ZipWith3Sym1 (a6989586621679544947 :: a ~> b ~> c ~> d) (b1 :: TyFun [a] [b] ~> [c] ~> [d])
data ZipWith3Sym2 (a6989586621679544947 :: a ~> b ~> c ~> d) (a6989586621679544948 :: [a]) (c1 :: TyFun [b] [c] ~> [d])
data ZipWith3Sym3 (a6989586621679544947 :: a ~> b ~> c ~> d) (a6989586621679544948 :: [a]) (a6989586621679544949 :: [b]) (d1 :: TyFun [c] [d])
data UnzipSym0 (a1 :: TyFun [(a, b)] ([a], [b]))
type family UnzipSym1 (a6989586621679544929 :: [(a, b)]) :: ([a], [b])
data Unzip3Sym0 (a1 :: TyFun [(a, b, c)] ([a], [b], [c]))
type family Unzip3Sym1 (a6989586621679544912 :: [(a, b, c)]) :: ([a], [b], [c])
data UnlinesSym0 (a :: TyFun [Symbol] Symbol)
type family UnlinesSym1 (a6989586621679544819 :: [Symbol]) :: Symbol
data UnwordsSym0 (a :: TyFun [Symbol] Symbol)
type family UnwordsSym1 (a6989586621679544809 :: [Symbol]) :: Symbol
data ShowsPrecSym0 (a1 :: TyFun Natural a ~> Symbol ~> Symbol)
data ShowsPrecSym1 (a6989586621679807409 :: Natural) (b :: TyFun a Symbol ~> Symbol)
data ShowsPrecSym2 (a6989586621679807409 :: Natural) (a6989586621679807410 :: a) (c :: TyFun Symbol Symbol)
type family ShowsPrecSym3 (a6989586621679807409 :: Natural) (a6989586621679807410 :: a) (a6989586621679807411 :: Symbol) :: Symbol
data ShowListSym0 (a1 :: TyFun [a] Symbol ~> Symbol)
data ShowListSym1 (a6989586621679807418 :: [a]) (b :: TyFun Symbol Symbol)
type family ShowListSym2 (a6989586621679807418 :: [a]) (a6989586621679807419 :: Symbol) :: Symbol
data Show_Sym0 (a1 :: TyFun a Symbol)
type family Show_Sym1 (a6989586621679807414 :: a) :: Symbol
data ShowsSym0 (a1 :: TyFun a Symbol ~> Symbol)
data ShowsSym1 (a6989586621679807401 :: a) (b :: TyFun Symbol Symbol)
type family ShowsSym2 (a6989586621679807401 :: a) (a6989586621679807402 :: Symbol) :: Symbol
data ShowCharSym0 (a :: TyFun Char Symbol ~> Symbol)
data ShowCharSym1 (a6989586621679807375 :: Char) (b :: TyFun Symbol Symbol)
type family ShowCharSym2 (a6989586621679807375 :: Char) (a6989586621679807376 :: Symbol) :: Symbol
data ShowStringSym0 (a :: TyFun Symbol Symbol ~> Symbol)
data ShowStringSym1 (a6989586621679807364 :: Symbol) (b :: TyFun Symbol Symbol)
type family ShowStringSym2 (a6989586621679807364 :: Symbol) (a6989586621679807365 :: Symbol) :: Symbol
data ShowParenSym0 (a :: TyFun Bool Symbol ~> Symbol ~> Symbol ~> Symbol)
data ShowParenSym1 (a6989586621679807346 :: Bool) (b :: TyFun Symbol ~> Symbol Symbol ~> Symbol)
data ShowParenSym2 (a6989586621679807346 :: Bool) (a6989586621679807347 :: Symbol ~> Symbol) (c :: TyFun Symbol Symbol)
-- | Exports the promoted and singled versions of the Product data
-- type.
module Data.Functor.Product.Singletons
type family Sing :: k -> Type
data SProduct (a1 :: Product f g a)
[SPair] :: forall {k} (f :: k -> Type) (g :: k -> Type) (a :: k) (n1 :: f a) (n2 :: g a). Sing n1 -> Sing n2 -> SProduct ('Pair n1 n2)
data PairSym0 (a1 :: TyFun f a g a ~> Product f g a)
data PairSym1 (a6989586621680392419 :: f a) (b :: TyFun g a Product f g a)
type family PairSym2 (a6989586621680392419 :: f a) (a6989586621680392420 :: g a) :: Product f g a
instance forall k (f :: k -> *) (g :: k -> *) (a :: k) (z :: Data.Functor.Product.Product f g a). GHC.Classes.Eq (Data.Functor.Product.Singletons.SProduct z)
instance forall k (f :: k -> *) (g :: k -> *) (a :: k) (z :: Data.Functor.Product.Product f g a). GHC.Classes.Ord (Data.Functor.Product.Singletons.SProduct z)
instance Control.Monad.Singletons.Internal.PAlternative (Data.Functor.Product.Product f g)
instance Control.Monad.Singletons.Internal.PApplicative (Data.Functor.Product.Product f g)
instance forall k (f :: k -> *) (g :: k -> *) (a :: k). Data.Eq.Singletons.PEq (Data.Functor.Product.Product f g a)
instance Data.Foldable.Singletons.PFoldable (Data.Functor.Product.Product f g)
instance Control.Monad.Singletons.Internal.PFunctor (Data.Functor.Product.Product f g)
instance Control.Monad.Singletons.Internal.PMonadPlus (Data.Functor.Product.Product f g)
instance Control.Monad.Singletons.Internal.PMonad (Data.Functor.Product.Product f g)
instance Control.Monad.Zip.Singletons.PMonadZip (Data.Functor.Product.Product f g)
instance forall k (f :: k -> *) (g :: k -> *) (a :: k). Data.Ord.Singletons.POrd (Data.Functor.Product.Product f g a)
instance Data.Traversable.Singletons.PTraversable (Data.Functor.Product.Product f g)
instance (Control.Monad.Singletons.Internal.SAlternative f, Control.Monad.Singletons.Internal.SAlternative g) => Control.Monad.Singletons.Internal.SAlternative (Data.Functor.Product.Product f g)
instance (Control.Monad.Singletons.Internal.SApplicative f, Control.Monad.Singletons.Internal.SApplicative g) => Control.Monad.Singletons.Internal.SApplicative (Data.Functor.Product.Product f g)
instance forall k (f :: k -> *) (a :: k) (g :: k -> *). (Data.Singletons.Decide.SDecide (f a), Data.Singletons.Decide.SDecide (g a)) => Data.Singletons.Decide.SDecide (Data.Functor.Product.Product f g a)
instance forall k (f :: k -> *) (a :: k) (g :: k -> *). (Data.Eq.Singletons.SEq (f a), Data.Eq.Singletons.SEq (g a)) => Data.Eq.Singletons.SEq (Data.Functor.Product.Product f g a)
instance (Data.Foldable.Singletons.SFoldable f, Data.Foldable.Singletons.SFoldable g) => Data.Foldable.Singletons.SFoldable (Data.Functor.Product.Product f g)
instance (Control.Monad.Singletons.Internal.SFunctor f, Control.Monad.Singletons.Internal.SFunctor g) => Control.Monad.Singletons.Internal.SFunctor (Data.Functor.Product.Product f g)
instance (Control.Monad.Singletons.Internal.SMonadPlus f, Control.Monad.Singletons.Internal.SMonadPlus g) => Control.Monad.Singletons.Internal.SMonadPlus (Data.Functor.Product.Product f g)
instance (Control.Monad.Singletons.Internal.SMonad f, Control.Monad.Singletons.Internal.SMonad g) => Control.Monad.Singletons.Internal.SMonad (Data.Functor.Product.Product f g)
instance (Control.Monad.Zip.Singletons.SMonadZip f, Control.Monad.Zip.Singletons.SMonadZip g) => Control.Monad.Zip.Singletons.SMonadZip (Data.Functor.Product.Product f g)
instance forall k (f :: k -> *) (a :: k) (g :: k -> *). (Data.Ord.Singletons.SOrd (f a), Data.Ord.Singletons.SOrd (g a)) => Data.Ord.Singletons.SOrd (Data.Functor.Product.Product f g a)
instance (Data.Traversable.Singletons.STraversable f, Data.Traversable.Singletons.STraversable g) => Data.Traversable.Singletons.STraversable (Data.Functor.Product.Product f g)
instance forall k (f :: k -> *) (a :: k) (g :: k -> *). Data.Singletons.SingI1 Data.Functor.Product.Singletons.PairSym1
instance forall k (g :: k -> *) (f :: k -> *) (a :: k) (n :: f a). Data.Singletons.SingI n => Data.Singletons.SingI1 ('Data.Functor.Product.Pair n)
instance forall k (f :: k -> *) (a :: k) (g :: k -> *). Data.Singletons.SingI2 'Data.Functor.Product.Pair
instance forall k (f :: k -> *) (a :: k) (g :: k -> *). Data.Singletons.SingI Data.Functor.Product.Singletons.PairSym0
instance forall k (f :: k -> *) (a :: k) (d :: f a) (g :: k -> *). Data.Singletons.SingI d => Data.Singletons.SingI (Data.Functor.Product.Singletons.PairSym1 d)
instance forall k (f :: k -> *) (a :: k) (n1 :: f a) (g :: k -> *) (n2 :: g a). (Data.Singletons.SingI n1, Data.Singletons.SingI n2) => Data.Singletons.SingI ('Data.Functor.Product.Pair n1 n2)
instance forall k1 k2 k3 a7566047373982778566 (b7566047373982778567 :: k1) k4 (f :: k4 -> *) (g :: k4 -> *) (a :: k4) (f6989586621680395346 :: k1 -> *) (g6989586621680395347 :: k1 -> *) (m6989586621680395759 :: k2) (n6989586621680395760 :: k3) (f6989586621680395761 :: a7566047373982778566 Data.Singletons.~> Data.Functor.Product.Product f6989586621680395346 g6989586621680395347 b7566047373982778567). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Functor.Product.Singletons.Let6989586621680395762FstPSym0 f6989586621680395346 g6989586621680395347 m6989586621680395759 n6989586621680395760 f6989586621680395761)
instance forall k1 k2 k3 a7566047373982778566 (b7566047373982778567 :: k1) k4 (f :: k4 -> *) (g :: k4 -> *) (a :: k4) (f6989586621680395346 :: k1 -> *) (g6989586621680395347 :: k1 -> *) (m6989586621680395759 :: k2) (n6989586621680395760 :: k3) (f6989586621680395761 :: a7566047373982778566 Data.Singletons.~> Data.Functor.Product.Product f6989586621680395346 g6989586621680395347 b7566047373982778567). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Functor.Product.Singletons.Let6989586621680395762SndPSym0 f6989586621680395346 g6989586621680395347 m6989586621680395759 n6989586621680395760 f6989586621680395761)
instance forall k (f :: k -> *) (a :: k) (g :: k -> *). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings Data.Functor.Product.Singletons.PairSym0
instance forall k (f :: k -> *) (a :: k) (g :: k -> *) (a6989586621680392419 :: f a). Data.Singletons.TH.SuppressUnusedWarnings.SuppressUnusedWarnings (Data.Functor.Product.Singletons.PairSym1 a6989586621680392419)
instance forall k (f :: k -> *) (a :: k) (g :: k -> *). (Data.Singletons.Decide.SDecide (f a), Data.Singletons.Decide.SDecide (g a)) => GHC.Internal.Data.Type.Coercion.TestCoercion Data.Functor.Product.Singletons.SProduct
instance forall k (f :: k -> *) (a :: k) (g :: k -> *). (Data.Singletons.Decide.SDecide (f a), Data.Singletons.Decide.SDecide (g a)) => GHC.Internal.Data.Type.Equality.TestEquality Data.Functor.Product.Singletons.SProduct