Copyright	(C) 2013-2014 Richard Eisenberg Jan Stolarek
License	BSD-style (see LICENSE)
Maintainer	Richard Eisenberg (rae@cs.brynmawr.edu)
Stability	experimental
Portability	non-portable
Safe Haskell	None
Language	Haskell2010

Data.Singletons.Prelude.List

Contents

The singleton for lists
Basic functions
List transformations
Reducing lists (folds)
- Special folds
Building lists
Sublists
- Extracting sublists
- Predicates
Searching lists
- Searching by equality
- Searching with a predicate
Indexing lists
Zipping and unzipping lists
Special lists
- "Set" operations
- Ordered lists
Generalized functions
- The "By" operations
  - User-supplied equality (replacing an Eq context)
  - User-supplied comparison (replacing an Ord context)
- The "generic" operations
Defunctionalization symbols

Description

Defines functions and datatypes relating to the singleton for '[]', including a singletons version 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.

Synopsis

The singleton for lists

data family Sing (a :: k) #

The singleton kind-indexed data family.

Instances

data Sing Bool #
data Sing Bool where SFalse :: Sing Bool z STrue :: Sing Bool z
data Sing Ordering #
data Sing Ordering where SLT :: Sing Ordering z SEQ :: Sing Ordering z SGT :: Sing Ordering z
data Sing * #
data Sing * where STypeRep :: Sing * a
data Sing Nat #
data Sing Nat where SNat :: Sing Nat n
data Sing Symbol #
data Sing Symbol where SSym :: Sing Symbol n
data Sing () #
data Sing () where STuple0 :: Sing () z
data Sing [a] #
data Sing [a] where SNil :: Sing [a] z SCons :: Sing [a] z
data Sing (Maybe a) #
data Sing (Maybe a) where SNothing :: Sing (Maybe a) z SJust :: Sing (Maybe a) z
data Sing (NonEmpty a) #
data Sing (NonEmpty a) where (:%\|) :: Sing (NonEmpty a) z
data Sing (Either a b) #
data Sing (Either a b) where SLeft :: Sing (Either a b) z SRight :: Sing (Either a b) z
data Sing (a, b) #
data Sing (a, b) where STuple2 :: Sing (a, b) z
data Sing ((~>) k1 k2) #
data Sing ((~>) k1 k2) = SLambda { applySing :: forall (t :: k1). Sing k1 t -> Sing k2 ((@@) k1 k2 f t) }
data Sing (a, b, c) #
data Sing (a, b, c) where STuple3 :: Sing (a, b, c) z
data Sing (a, b, c, d) #
data Sing (a, b, c, d) where STuple4 :: Sing (a, b, c, d) z
data Sing (a, b, c, d, e) #
data Sing (a, b, c, d, e) where STuple5 :: Sing (a, b, c, d, e) z
data Sing (a, b, c, d, e, f) #
data Sing (a, b, c, d, e, f) where STuple6 :: Sing (a, b, c, d, e, f) z
data Sing (a, b, c, d, e, f, g) #
data Sing (a, b, c, d, e, f, g) where STuple7 :: Sing (a, b, c, d, e, f, g) z

Though Haddock doesn't show it, the Sing instance above declares constructors

SNil  :: Sing '[]
SCons :: Sing (h :: k) -> Sing (t :: [k]) -> Sing (h ': t)

type SList = (Sing :: [a] -> Type) #

SList is a kind-restricted synonym for Sing: type SList (a :: [k]) = Sing a

Basic functions

type family (a :: [a]) :++ (a :: [a]) :: [a] where ... infixr 5 #

Equations

'[] :++ ys = ys
((:) x xs) :++ ys = Apply (Apply (:$) x) (Apply (Apply (:++$) xs) ys)

(%:++) :: forall (t :: [a]) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply (:++$) t) t :: [a]) infixr 5 #

type family Head (a :: [a]) :: a where ... #

Equations

Head ((:) a _z_1627860147) = a
Head '[] = Apply ErrorSym0 "Data.Singletons.List.head: empty list"

sHead :: forall (t :: [a]). Sing t -> Sing (Apply HeadSym0 t :: a) #

type family Last (a :: [a]) :: a where ... #

Equations

Last '[] = Apply ErrorSym0 "Data.Singletons.List.last: empty list"
Last '[x] = x
Last ((:) _z_1627860137 ((:) x xs)) = Apply LastSym0 (Apply (Apply (:$) x) xs)

sLast :: forall (t :: [a]). Sing t -> Sing (Apply LastSym0 t :: a) #

type family Tail (a :: [a]) :: [a] where ... #

Equations

Tail ((:) _z_1627860128 t) = t
Tail '[] = Apply ErrorSym0 "Data.Singletons.List.tail: empty list"

sTail :: forall (t :: [a]). Sing t -> Sing (Apply TailSym0 t :: [a]) #

type family Init (a :: [a]) :: [a] where ... #

Equations

Init '[] = Apply ErrorSym0 "Data.Singletons.List.init: empty list"
Init ((:) x xs) = Apply (Apply (Let1627860097Init'Sym2 x xs) x) xs

sInit :: forall (t :: [a]). Sing t -> Sing (Apply InitSym0 t :: [a]) #

type family Null (a :: [a]) :: Bool where ... #

Equations

Null '[] = TrueSym0
Null ((:) _z_1627860026 _z_1627860029) = FalseSym0

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

type family Length (a :: [a]) :: Nat where ... #

Equations

Length '[] = FromInteger 0
Length ((:) _z_1627856947 xs) = Apply (Apply (:+$) (FromInteger 1)) (Apply LengthSym0 xs)

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

List transformations

type family Map (a :: TyFun a b -> Type) (a :: [a]) :: [b] where ... #

Equations

Map _z_1627672640 '[] = '[]
Map f ((:) x xs) = Apply (Apply (:$) (Apply f x)) (Apply (Apply MapSym0 f) xs)

sMap :: forall (t :: TyFun a b -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply MapSym0 t) t :: [b]) #

type family Reverse (a :: [a]) :: [a] where ... #

Equations

Reverse l = Apply (Apply (Let1627859992RevSym1 l) l) '[]

sReverse :: forall (t :: [a]). Sing t -> Sing (Apply ReverseSym0 t :: [a]) #

type family Intersperse (a :: a) (a :: [a]) :: [a] where ... #

Equations

Intersperse _z_1627859970 '[] = '[]
Intersperse sep ((:) x xs) = Apply (Apply (:$) x) (Apply (Apply PrependToAllSym0 sep) xs)

sIntersperse :: forall (t :: a) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply IntersperseSym0 t) t :: [a]) #

type family Intercalate (a :: [a]) (a :: [[a]]) :: [a] where ... #

Equations

Intercalate xs xss = Apply ConcatSym0 (Apply (Apply IntersperseSym0 xs) xss)

sIntercalate :: forall (t :: [a]) (t :: [[a]]). Sing t -> Sing t -> Sing (Apply (Apply IntercalateSym0 t) t :: [a]) #

type family Transpose (a :: [[a]]) :: [[a]] where ... #

Equations

Transpose '[] = '[]
Transpose ((:) '[] xss) = Apply TransposeSym0 xss
Transpose ((:) ((:) x xs) xss) = Apply (Apply (:$) (Apply (Apply (:$) x) (Apply (Apply MapSym0 HeadSym0) xss))) (Apply TransposeSym0 (Apply (Apply (:$) xs) (Apply (Apply MapSym0 TailSym0) xss)))

sTranspose :: forall (t :: [[a]]). Sing t -> Sing (Apply TransposeSym0 t :: [[a]]) #

type family Subsequences (a :: [a]) :: [[a]] where ... #

Equations

Subsequences xs = Apply (Apply (:$) '[]) (Apply NonEmptySubsequencesSym0 xs)

sSubsequences :: forall (t :: [a]). Sing t -> Sing (Apply SubsequencesSym0 t :: [[a]]) #

type family Permutations (a :: [a]) :: [[a]] where ... #

Equations

Permutations xs0 = Apply (Apply (:$) xs0) (Apply (Apply (Let1627859545PermsSym1 xs0) xs0) '[])

sPermutations :: forall (t :: [a]). Sing t -> Sing (Apply PermutationsSym0 t :: [[a]]) #

Reducing lists (folds)

type family Foldl (a :: TyFun b (TyFun a b -> Type) -> Type) (a :: b) (a :: [a]) :: b where ... #

Equations

Foldl f z0 xs0 = Apply (Apply (Let1627632085LgoSym3 f z0 xs0) z0) xs0

sFoldl :: forall (t :: TyFun b (TyFun a b -> Type) -> Type) (t :: b) (t :: [a]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t :: b) #

type family Foldl' (a :: TyFun b (TyFun a b -> Type) -> Type) (a :: b) (a :: [a]) :: b where ... #

Equations

Foldl' f z0 xs0 = Apply (Apply (Let1627859459LgoSym3 f z0 xs0) z0) xs0

sFoldl' :: forall (t :: TyFun b (TyFun a b -> Type) -> Type) (t :: b) (t :: [a]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t :: b) #

type family Foldl1 (a :: TyFun a (TyFun a a -> Type) -> Type) (a :: [a]) :: a where ... #

Equations

Foldl1 f ((:) x xs) = Apply (Apply (Apply FoldlSym0 f) x) xs
Foldl1 _z_1627859236 '[] = Apply ErrorSym0 "Data.Singletons.List.foldl1: empty list"

sFoldl1 :: forall (t :: TyFun a (TyFun a a -> Type) -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t :: a) #

type family Foldl1' (a :: TyFun a (TyFun a a -> Type) -> Type) (a :: [a]) :: a where ... #

Equations

Foldl1' f ((:) x xs) = Apply (Apply (Apply Foldl'Sym0 f) x) xs
Foldl1' _z_1627859537 '[] = Apply ErrorSym0 "Data.Singletons.List.foldl1': empty list"

sFoldl1' :: forall (t :: TyFun a (TyFun a a -> Type) -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply Foldl1'Sym0 t) t :: a) #

type family Foldr (a :: TyFun a (TyFun b b -> Type) -> Type) (a :: b) (a :: [a]) :: b where ... #

Equations

Foldr k z a_1627672661 = Apply (Let1627672666GoSym3 k z a_1627672661) a_1627672661

sFoldr :: forall (t :: TyFun a (TyFun b b -> Type) -> Type) (t :: b) (t :: [a]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t :: b) #

type family Foldr1 (a :: TyFun a (TyFun a a -> Type) -> Type) (a :: [a]) :: a where ... #

Equations

Foldr1 _z_1627859194 '[x] = x
Foldr1 f ((:) x ((:) wild_1627856651 wild_1627856653)) = Apply (Apply f x) (Apply (Apply Foldr1Sym0 f) (Let1627859202XsSym4 f x wild_1627856651 wild_1627856653))
Foldr1 _z_1627859221 '[] = Apply ErrorSym0 "Data.Singletons.List.foldr1: empty list"

sFoldr1 :: forall (t :: TyFun a (TyFun a a -> Type) -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t :: a) #

Special folds

type family Concat (a :: [[a]]) :: [a] where ... #

Equations

Concat a_1627859178 = Apply (Apply (Apply FoldrSym0 (:++$)) '[]) a_1627859178

sConcat :: forall (t :: [[a]]). Sing t -> Sing (Apply ConcatSym0 t :: [a]) #

type family ConcatMap (a :: TyFun a [b] -> Type) (a :: [a]) :: [b] where ... #

Equations

ConcatMap f a_1627859174 = Apply (Apply (Apply FoldrSym0 (Apply (Apply (:.$) (:++$)) f)) '[]) a_1627859174

sConcatMap :: forall (t :: TyFun a [b] -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply ConcatMapSym0 t) t :: [b]) #

type family And (a :: [Bool]) :: Bool where ... #

Equations

And '[] = TrueSym0
And ((:) x xs) = Apply (Apply (:&&$) x) (Apply AndSym0 xs)

sAnd :: forall (t :: [Bool]). Sing t -> Sing (Apply AndSym0 t :: Bool) #

type family Or (a :: [Bool]) :: Bool where ... #

Equations

Or '[] = FalseSym0
Or ((:) x xs) = Apply (Apply (:\|\|$) x) (Apply OrSym0 xs)

sOr :: forall (t :: [Bool]). Sing t -> Sing (Apply OrSym0 t :: Bool) #

type family Any_ (a :: TyFun a Bool -> Type) (a :: [a]) :: Bool where ... #

Equations

Any_ _z_1627845981 '[] = FalseSym0
Any_ p ((:) x xs) = Apply (Apply (:\|\|$) (Apply p x)) (Apply (Apply Any_Sym0 p) xs)

sAny_ :: forall (t :: TyFun a Bool -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply Any_Sym0 t) t :: Bool) #

type family All (a :: TyFun a Bool -> Type) (a :: [a]) :: Bool where ... #

Equations

All _z_1627859147 '[] = TrueSym0
All p ((:) x xs) = Apply (Apply (:&&$) (Apply p x)) (Apply (Apply AllSym0 p) xs)

sAll :: forall (t :: TyFun a Bool -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply AllSym0 t) t :: Bool) #

type family Sum (a :: [a]) :: a where ... #

Equations

Sum l = Apply (Apply (Let1627856980Sum'Sym1 l) l) (FromInteger 0)

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

type family Product (a :: [a]) :: a where ... #

Equations

Product l = Apply (Apply (Let1627856956ProdSym1 l) l) (FromInteger 1)

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

type family Maximum (a :: [a]) :: a where ... #

Equations

Maximum '[] = Apply ErrorSym0 "Data.Singletons.List.maximum: empty list"
Maximum ((:) wild_1627856731 wild_1627856733) = Apply (Apply Foldl1Sym0 MaxSym0) (Let1627859419XsSym2 wild_1627856731 wild_1627856733)

sMaximum :: forall (t :: [a]). SOrd a => Sing t -> Sing (Apply MaximumSym0 t :: a) #

type family Minimum (a :: [a]) :: a where ... #

Equations

Minimum '[] = Apply ErrorSym0 "Data.Singletons.List.minimum: empty list"
Minimum ((:) wild_1627856735 wild_1627856737) = Apply (Apply Foldl1Sym0 MinSym0) (Let1627859433XsSym2 wild_1627856735 wild_1627856737)

sMinimum :: forall (t :: [a]). SOrd a => Sing t -> Sing (Apply MinimumSym0 t :: a) #

any_ :: (a -> Bool) -> [a] -> Bool #

Building lists

Scans

type family Scanl (a :: TyFun b (TyFun a b -> Type) -> Type) (a :: b) (a :: [a]) :: [b] where ... #

Equations

Scanl f q ls = Apply (Apply (:$) q) (Case_1627859118 f q ls ls)

sScanl :: forall (t :: TyFun b (TyFun a b -> Type) -> Type) (t :: b) (t :: [a]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ScanlSym0 t) t) t :: [b]) #

type family Scanl1 (a :: TyFun a (TyFun a a -> Type) -> Type) (a :: [a]) :: [a] where ... #

Equations

Scanl1 f ((:) x xs) = Apply (Apply (Apply ScanlSym0 f) x) xs
Scanl1 _z_1627859135 '[] = '[]

sScanl1 :: forall (t :: TyFun a (TyFun a a -> Type) -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply Scanl1Sym0 t) t :: [a]) #

type family Scanr (a :: TyFun a (TyFun b b -> Type) -> Type) (a :: b) (a :: [a]) :: [b] where ... #

Equations

Scanr _z_1627859068 q0 '[] = Apply (Apply (:$) q0) '[]
Scanr f q0 ((:) x xs) = Case_1627859095 f q0 x xs (Let1627859076Scrutinee_1627856655Sym4 f q0 x xs)

sScanr :: forall (t :: TyFun a (TyFun b b -> Type) -> Type) (t :: b) (t :: [a]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ScanrSym0 t) t) t :: [b]) #

type family Scanr1 (a :: TyFun a (TyFun a a -> Type) -> Type) (a :: [a]) :: [a] where ... #

Equations

Scanr1 _z_1627858999 '[] = '[]
Scanr1 _z_1627859002 '[x] = Apply (Apply (:$) x) '[]
Scanr1 f ((:) x ((:) wild_1627856659 wild_1627856661)) = Case_1627859048 f x wild_1627856659 wild_1627856661 (Let1627859029Scrutinee_1627856657Sym4 f x wild_1627856659 wild_1627856661)

sScanr1 :: forall (t :: TyFun a (TyFun a a -> Type) -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply Scanr1Sym0 t) t :: [a]) #

Accumulating maps

type family MapAccumL (a :: TyFun acc (TyFun x (acc, y) -> Type) -> Type) (a :: acc) (a :: [x]) :: (acc, [y]) where ... #

Equations

MapAccumL _z_1627858833 s '[] = Apply (Apply Tuple2Sym0 s) '[]
MapAccumL f s ((:) x xs) = Apply (Apply Tuple2Sym0 (Let1627858841S''Sym4 f s x xs)) (Apply (Apply (:$) (Let1627858841YSym4 f s x xs)) (Let1627858841YsSym4 f s x xs))

sMapAccumL :: forall (t :: TyFun acc (TyFun x (acc, y) -> Type) -> Type) (t :: acc) (t :: [x]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply MapAccumLSym0 t) t) t :: (acc, [y])) #

type family MapAccumR (a :: TyFun acc (TyFun x (acc, y) -> Type) -> Type) (a :: acc) (a :: [x]) :: (acc, [y]) where ... #

Equations

MapAccumR _z_1627858661 s '[] = Apply (Apply Tuple2Sym0 s) '[]
MapAccumR f s ((:) x xs) = Apply (Apply Tuple2Sym0 (Let1627858669S''Sym4 f s x xs)) (Apply (Apply (:$) (Let1627858669YSym4 f s x xs)) (Let1627858669YsSym4 f s x xs))

sMapAccumR :: forall (t :: TyFun acc (TyFun x (acc, y) -> Type) -> Type) (t :: acc) (t :: [x]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply MapAccumRSym0 t) t) t :: (acc, [y])) #

Cyclical lists

type family Replicate (a :: Nat) (a :: a) :: [a] where ... #

Equations

Replicate n x = Case_1627856940 n x (Let1627856932Scrutinee_1627856743Sym2 n x)

sReplicate :: forall (t :: Nat) (t :: a). Sing t -> Sing t -> Sing (Apply (Apply ReplicateSym0 t) t :: [a]) #

Unfolding

type family Unfoldr (a :: TyFun b (Maybe (a, b)) -> Type) (a :: b) :: [a] where ... #

Equations

Unfoldr f b = Case_1627858641 f b (Let1627858633Scrutinee_1627856663Sym2 f b)

sUnfoldr :: forall (t :: TyFun b (Maybe (a, b)) -> Type) (t :: b). Sing t -> Sing t -> Sing (Apply (Apply UnfoldrSym0 t) t :: [a]) #

Sublists

Extracting sublists

type family Take (a :: Nat) (a :: [a]) :: [a] where ... #

Equations

Take _z_1627857127 '[] = '[]
Take n ((:) x xs) = Case_1627857146 n x xs (Let1627857133Scrutinee_1627856727Sym3 n x xs)

sTake :: forall (t :: Nat) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply TakeSym0 t) t :: [a]) #

type family Drop (a :: Nat) (a :: [a]) :: [a] where ... #

Equations

Drop _z_1627857096 '[] = '[]
Drop n ((:) x xs) = Case_1627857115 n x xs (Let1627857102Scrutinee_1627856729Sym3 n x xs)

sDrop :: forall (t :: Nat) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply DropSym0 t) t :: [a]) #

type family SplitAt (a :: Nat) (a :: [a]) :: ([a], [a]) where ... #

Equations

SplitAt n xs = Apply (Apply Tuple2Sym0 (Apply (Apply TakeSym0 n) xs)) (Apply (Apply DropSym0 n) xs)

sSplitAt :: forall (t :: Nat) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply SplitAtSym0 t) t :: ([a], [a])) #

type family TakeWhile (a :: TyFun a Bool -> Type) (a :: [a]) :: [a] where ... #

Equations

TakeWhile _z_1627857494 '[] = '[]
TakeWhile p ((:) x xs) = Case_1627857513 p x xs (Let1627857500Scrutinee_1627856717Sym3 p x xs)

sTakeWhile :: forall (t :: TyFun a Bool -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply TakeWhileSym0 t) t :: [a]) #

type family DropWhile (a :: TyFun a Bool -> Type) (a :: [a]) :: [a] where ... #

Equations

DropWhile _z_1627857450 '[] = '[]
DropWhile p ((:) x xs') = Case_1627857482 p x xs' (Let1627857469Scrutinee_1627856719Sym3 p x xs')

sDropWhile :: forall (t :: TyFun a Bool -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply DropWhileSym0 t) t :: [a]) #

type family DropWhileEnd (a :: TyFun a Bool -> Type) (a :: [a]) :: [a] where ... #

Equations

DropWhileEnd p a_1627860041 = Apply (Apply (Apply FoldrSym0 (Apply (Apply Lambda_1627860045Sym0 p) a_1627860041)) '[]) a_1627860041

sDropWhileEnd :: forall (t :: TyFun a Bool -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply DropWhileEndSym0 t) t :: [a]) #

type family Span (a :: TyFun a Bool -> Type) (a :: [a]) :: ([a], [a]) where ... #

Equations

Span _z_1627857271 '[] = Apply (Apply Tuple2Sym0 Let1627857274XsSym0) Let1627857274XsSym0
Span p ((:) x xs') = Case_1627857304 p x xs' (Let1627857291Scrutinee_1627856723Sym3 p x xs')

sSpan :: forall (t :: TyFun a Bool -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply SpanSym0 t) t :: ([a], [a])) #

type family Break (a :: TyFun a Bool -> Type) (a :: [a]) :: ([a], [a]) where ... #

Equations

Break _z_1627857169 '[] = Apply (Apply Tuple2Sym0 Let1627857172XsSym0) Let1627857172XsSym0
Break p ((:) x xs') = Case_1627857202 p x xs' (Let1627857189Scrutinee_1627856725Sym3 p x xs')

sBreak :: forall (t :: TyFun a Bool -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply BreakSym0 t) t :: ([a], [a])) #

type family Group (a :: [a]) :: [[a]] where ... #

Equations

Group xs = Apply (Apply GroupBySym0 (:==$)) xs

sGroup :: forall (t :: [a]). SEq a => Sing t -> Sing (Apply GroupSym0 t :: [[a]]) #

type family Inits (a :: [a]) :: [[a]] where ... #

Equations

Inits xs = Apply (Apply (:$) '[]) (Case_1627858617 xs xs)

sInits :: forall (t :: [a]). Sing t -> Sing (Apply InitsSym0 t :: [[a]]) #

type family Tails (a :: [a]) :: [[a]] where ... #

Equations

Tails xs = Apply (Apply (:$) xs) (Case_1627858594 xs xs)

sTails :: forall (t :: [a]). Sing t -> Sing (Apply TailsSym0 t :: [[a]]) #

Predicates

type family IsPrefixOf (a :: [a]) (a :: [a]) :: Bool where ... #

Equations

IsPrefixOf '[] '[] = TrueSym0
IsPrefixOf '[] ((:) _z_1627858573 _z_1627858576) = TrueSym0
IsPrefixOf ((:) _z_1627858579 _z_1627858582) '[] = FalseSym0
IsPrefixOf ((:) x xs) ((:) y ys) = Apply (Apply (:&&$) (Apply (Apply (:==$) x) y)) (Apply (Apply IsPrefixOfSym0 xs) ys)

sIsPrefixOf :: forall (t :: [a]) (t :: [a]). SEq a => Sing t -> Sing t -> Sing (Apply (Apply IsPrefixOfSym0 t) t :: Bool) #

type family IsSuffixOf (a :: [a]) (a :: [a]) :: Bool where ... #

Equations

IsSuffixOf x y = Apply (Apply IsPrefixOfSym0 (Apply ReverseSym0 x)) (Apply ReverseSym0 y)

sIsSuffixOf :: forall (t :: [a]) (t :: [a]). SEq a => Sing t -> Sing t -> Sing (Apply (Apply IsSuffixOfSym0 t) t :: Bool) #

type family IsInfixOf (a :: [a]) (a :: [a]) :: Bool where ... #

Equations

IsInfixOf needle haystack = Apply (Apply Any_Sym0 (Apply IsPrefixOfSym0 needle)) (Apply TailsSym0 haystack)

sIsInfixOf :: forall (t :: [a]) (t :: [a]). SEq a => Sing t -> Sing t -> Sing (Apply (Apply IsInfixOfSym0 t) t :: Bool) #

Searching lists

Searching by equality

type family Elem (a :: a) (a :: [a]) :: Bool where ... #

Equations

Elem _z_1627858510 '[] = FalseSym0
Elem x ((:) y ys) = Apply (Apply (:\|\|$) (Apply (Apply (:==$) x) y)) (Apply (Apply ElemSym0 x) ys)

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

type family NotElem (a :: a) (a :: [a]) :: Bool where ... #

Equations

NotElem _z_1627858495 '[] = TrueSym0
NotElem x ((:) y ys) = Apply (Apply (:&&$) (Apply (Apply (:/=$) x) y)) (Apply (Apply NotElemSym0 x) ys)

sNotElem :: forall (t :: a) (t :: [a]). SEq a => Sing t -> Sing t -> Sing (Apply (Apply NotElemSym0 t) t :: Bool) #

type family Lookup (a :: a) (a :: [(a, b)]) :: Maybe b where ... #

Equations

Lookup _key '[] = NothingSym0
Lookup key ((:) '(x, y) xys) = Case_1627857084 key x y xys (Let1627857065Scrutinee_1627856739Sym4 key x y xys)

sLookup :: forall (t :: a) (t :: [(a, b)]). SEq a => Sing t -> Sing t -> Sing (Apply (Apply LookupSym0 t) t :: Maybe b) #

Searching with a predicate

type family Find (a :: TyFun a Bool -> Type) (a :: [a]) :: Maybe a where ... #

Equations

Find p a_1627857554 = Apply (Apply (Apply (:.$) ListToMaybeSym0) (Apply FilterSym0 p)) a_1627857554

sFind :: forall (t :: TyFun a Bool -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply FindSym0 t) t :: Maybe a) #

type family Filter (a :: TyFun a Bool -> Type) (a :: [a]) :: [a] where ... #

Equations

Filter _p '[] = '[]
Filter p ((:) x xs) = Case_1627857542 p x xs (Let1627857529Scrutinee_1627856705Sym3 p x xs)

sFilter :: forall (t :: TyFun a Bool -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply FilterSym0 t) t :: [a]) #

type family Partition (a :: TyFun a Bool -> Type) (a :: [a]) :: ([a], [a]) where ... #

Equations

Partition p xs = Apply (Apply (Apply FoldrSym0 (Apply SelectSym0 p)) (Apply (Apply Tuple2Sym0 '[]) '[])) xs

sPartition :: forall (t :: TyFun a Bool -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply PartitionSym0 t) t :: ([a], [a])) #

Indexing lists

type family (a :: [a]) :!! (a :: Nat) :: a where ... #

Equations

'[] :!! _z_1627856899 = Apply ErrorSym0 "Data.Singletons.List.!!: index too large"
((:) x xs) :!! n = Case_1627856918 x xs n (Let1627856905Scrutinee_1627856745Sym3 x xs n)

(%:!!) :: forall (t :: [a]) (t :: Nat). Sing t -> Sing t -> Sing (Apply (Apply (:!!$) t) t :: a) #

type family ElemIndex (a :: a) (a :: [a]) :: Maybe Nat where ... #

Equations

ElemIndex x a_1627858482 = Apply (Apply FindIndexSym0 (Apply (:==$) x)) a_1627858482

sElemIndex :: forall (t :: a) (t :: [a]). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemIndexSym0 t) t :: Maybe Nat) #

type family ElemIndices (a :: a) (a :: [a]) :: [Nat] where ... #

Equations

ElemIndices x a_1627858456 = Apply (Apply FindIndicesSym0 (Apply (:==$) x)) a_1627858456

sElemIndices :: forall (t :: a) (t :: [a]). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemIndicesSym0 t) t :: [Nat]) #

type family FindIndex (a :: TyFun a Bool -> Type) (a :: [a]) :: Maybe Nat where ... #

Equations

FindIndex p a_1627858469 = Apply (Apply (Apply (:.$) ListToMaybeSym0) (Apply FindIndicesSym0 p)) a_1627858469

sFindIndex :: forall (t :: TyFun a Bool -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply FindIndexSym0 t) t :: Maybe Nat) #

type family FindIndices (a :: TyFun a Bool -> Type) (a :: [a]) :: [Nat] where ... #

Equations

FindIndices p xs = Apply (Apply MapSym0 SndSym0) (Apply (Apply FilterSym0 (Apply (Apply Lambda_1627858424Sym0 p) xs)) (Apply (Apply ZipSym0 xs) (Apply (Apply (Let1627858395BuildListSym2 p xs) (FromInteger 0)) xs)))

sFindIndices :: forall (t :: TyFun a Bool -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply FindIndicesSym0 t) t :: [Nat]) #

Zipping and unzipping lists

type family Zip (a :: [a]) (a :: [b]) :: [(a, b)] where ... #

Equations

Zip ((:) x xs) ((:) y ys) = Apply (Apply (:$) (Apply (Apply Tuple2Sym0 x) y)) (Apply (Apply ZipSym0 xs) ys)
Zip '[] '[] = '[]
Zip ((:) _z_1627858372 _z_1627858375) '[] = '[]
Zip '[] ((:) _z_1627858378 _z_1627858381) = '[]

sZip :: forall (t :: [a]) (t :: [b]). Sing t -> Sing t -> Sing (Apply (Apply ZipSym0 t) t :: [(a, b)]) #

type family Zip3 (a :: [a]) (a :: [b]) (a :: [c]) :: [(a, b, c)] where ... #

Equations

Zip3 ((:) a as) ((:) b bs) ((:) c cs) = Apply (Apply (:$) (Apply (Apply (Apply Tuple3Sym0 a) b) c)) (Apply (Apply (Apply Zip3Sym0 as) bs) cs)
Zip3 '[] '[] '[] = '[]
Zip3 '[] '[] ((:) _z_1627858305 _z_1627858308) = '[]
Zip3 '[] ((:) _z_1627858311 _z_1627858314) '[] = '[]
Zip3 '[] ((:) _z_1627858317 _z_1627858320) ((:) _z_1627858323 _z_1627858326) = '[]
Zip3 ((:) _z_1627858329 _z_1627858332) '[] '[] = '[]
Zip3 ((:) _z_1627858335 _z_1627858338) '[] ((:) _z_1627858341 _z_1627858344) = '[]
Zip3 ((:) _z_1627858347 _z_1627858350) ((:) _z_1627858353 _z_1627858356) '[] = '[]

sZip3 :: forall (t :: [a]) (t :: [b]) (t :: [c]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Zip3Sym0 t) t) t :: [(a, b, c)]) #

type family ZipWith (a :: TyFun a (TyFun b c -> Type) -> Type) (a :: [a]) (a :: [b]) :: [c] where ... #

Equations

ZipWith f ((:) x xs) ((:) y ys) = Apply (Apply (:$) (Apply (Apply f x) y)) (Apply (Apply (Apply ZipWithSym0 f) xs) ys)
ZipWith _z_1627858263 '[] '[] = '[]
ZipWith _z_1627858266 ((:) _z_1627858269 _z_1627858272) '[] = '[]
ZipWith _z_1627858275 '[] ((:) _z_1627858278 _z_1627858281) = '[]

sZipWith :: forall (t :: TyFun a (TyFun b c -> Type) -> Type) (t :: [a]) (t :: [b]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply ZipWithSym0 t) t) t :: [c]) #

type family ZipWith3 (a :: TyFun a (TyFun b (TyFun c d -> Type) -> Type) -> Type) (a :: [a]) (a :: [b]) (a :: [c]) :: [d] where ... #

Equations

ZipWith3 z ((:) a as) ((:) b bs) ((:) c cs) = Apply (Apply (:$) (Apply (Apply (Apply z a) b) c)) (Apply (Apply (Apply (Apply ZipWith3Sym0 z) as) bs) cs)
ZipWith3 _z_1627858168 '[] '[] '[] = '[]
ZipWith3 _z_1627858171 '[] '[] ((:) _z_1627858174 _z_1627858177) = '[]
ZipWith3 _z_1627858180 '[] ((:) _z_1627858183 _z_1627858186) '[] = '[]
ZipWith3 _z_1627858189 '[] ((:) _z_1627858192 _z_1627858195) ((:) _z_1627858198 _z_1627858201) = '[]
ZipWith3 _z_1627858204 ((:) _z_1627858207 _z_1627858210) '[] '[] = '[]
ZipWith3 _z_1627858213 ((:) _z_1627858216 _z_1627858219) '[] ((:) _z_1627858222 _z_1627858225) = '[]
ZipWith3 _z_1627858228 ((:) _z_1627858231 _z_1627858234) ((:) _z_1627858237 _z_1627858240) '[] = '[]

sZipWith3 :: forall (t :: TyFun a (TyFun b (TyFun c d -> Type) -> Type) -> Type) (t :: [a]) (t :: [b]) (t :: [c]). Sing t -> Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply (Apply ZipWith3Sym0 t) t) t) t :: [d]) #

type family Unzip (a :: [(a, b)]) :: ([a], [b]) where ... #

Equations

Unzip xs = Apply (Apply (Apply FoldrSym0 (Apply Lambda_1627858114Sym0 xs)) (Apply (Apply Tuple2Sym0 '[]) '[])) xs

sUnzip :: forall (t :: [(a, b)]). Sing t -> Sing (Apply UnzipSym0 t :: ([a], [b])) #

type family Unzip3 (a :: [(a, b, c)]) :: ([a], [b], [c]) where ... #

Equations

Unzip3 xs = Apply (Apply (Apply FoldrSym0 (Apply Lambda_1627858082Sym0 xs)) (Apply (Apply (Apply Tuple3Sym0 '[]) '[]) '[])) xs

sUnzip3 :: forall (t :: [(a, b, c)]). Sing t -> Sing (Apply Unzip3Sym0 t :: ([a], [b], [c])) #

type family Unzip4 (a :: [(a, b, c, d)]) :: ([a], [b], [c], [d]) where ... #

Equations

Unzip4 xs = Apply (Apply (Apply FoldrSym0 (Apply Lambda_1627858048Sym0 xs)) (Apply (Apply (Apply (Apply Tuple4Sym0 '[]) '[]) '[]) '[])) xs

sUnzip4 :: forall (t :: [(a, b, c, d)]). Sing t -> Sing (Apply Unzip4Sym0 t :: ([a], [b], [c], [d])) #

type family Unzip5 (a :: [(a, b, c, d, e)]) :: ([a], [b], [c], [d], [e]) where ... #

Equations

Unzip5 xs = Apply (Apply (Apply FoldrSym0 (Apply Lambda_1627858012Sym0 xs)) (Apply (Apply (Apply (Apply (Apply Tuple5Sym0 '[]) '[]) '[]) '[]) '[])) xs

sUnzip5 :: forall (t :: [(a, b, c, d, e)]). Sing t -> Sing (Apply Unzip5Sym0 t :: ([a], [b], [c], [d], [e])) #

type family Unzip6 (a :: [(a, b, c, d, e, f)]) :: ([a], [b], [c], [d], [e], [f]) where ... #

Equations

Unzip6 xs = Apply (Apply (Apply FoldrSym0 (Apply Lambda_1627857974Sym0 xs)) (Apply (Apply (Apply (Apply (Apply (Apply Tuple6Sym0 '[]) '[]) '[]) '[]) '[]) '[])) xs

sUnzip6 :: forall (t :: [(a, b, c, d, e, f)]). Sing t -> Sing (Apply Unzip6Sym0 t :: ([a], [b], [c], [d], [e], [f])) #

type family Unzip7 (a :: [(a, b, c, d, e, f, g)]) :: ([a], [b], [c], [d], [e], [f], [g]) where ... #

Equations

Unzip7 xs = Apply (Apply (Apply FoldrSym0 (Apply Lambda_1627857934Sym0 xs)) (Apply (Apply (Apply (Apply (Apply (Apply (Apply Tuple7Sym0 '[]) '[]) '[]) '[]) '[]) '[]) '[])) xs

sUnzip7 :: forall (t :: [(a, b, c, d, e, f, g)]). Sing t -> Sing (Apply Unzip7Sym0 t :: ([a], [b], [c], [d], [e], [f], [g])) #

Special lists

"Set" operations

type family Nub (a :: [a]) :: [a] where ... #

Equations

Nub l = Apply (Apply (Let1627858521Nub'Sym1 l) l) '[]

sNub :: forall (t :: [a]). SEq a => Sing t -> Sing (Apply NubSym0 t :: [a]) #

type family Delete (a :: a) (a :: [a]) :: [a] where ... #

Equations

Delete a_1627857899 a_1627857901 = Apply (Apply (Apply DeleteBySym0 (:==$)) a_1627857899) a_1627857901

sDelete :: forall (t :: a) (t :: [a]). SEq a => Sing t -> Sing t -> Sing (Apply (Apply DeleteSym0 t) t :: [a]) #

type family (a :: [a]) :\\ (a :: [a]) :: [a] where ... infix 5 #

Equations

a_1627857914 :\\ a_1627857916 = Apply (Apply (Apply FoldlSym0 (Apply FlipSym0 DeleteSym0)) a_1627857914) a_1627857916

(%:\\) :: forall (t :: [a]) (t :: [a]). SEq a => Sing t -> Sing t -> Sing (Apply (Apply (:\\$) t) t :: [a]) infix 5 #

type family Union (a :: [a]) (a :: [a]) :: [a] where ... #

Equations

Union a_1627857884 a_1627857886 = Apply (Apply (Apply UnionBySym0 (:==$)) a_1627857884) a_1627857886

sUnion :: forall (t :: [a]) (t :: [a]). SEq a => Sing t -> Sing t -> Sing (Apply (Apply UnionSym0 t) t :: [a]) #

type family Intersect (a :: [a]) (a :: [a]) :: [a] where ... #

Equations

Intersect a_1627857687 a_1627857689 = Apply (Apply (Apply IntersectBySym0 (:==$)) a_1627857687) a_1627857689

sIntersect :: forall (t :: [a]) (t :: [a]). SEq a => Sing t -> Sing t -> Sing (Apply (Apply IntersectSym0 t) t :: [a]) #

Ordered lists

type family Insert (a :: a) (a :: [a]) :: [a] where ... #

Equations

Insert e ls = Apply (Apply (Apply InsertBySym0 CompareSym0) e) ls

sInsert :: forall (t :: a) (t :: [a]). SOrd a => Sing t -> Sing t -> Sing (Apply (Apply InsertSym0 t) t :: [a]) #

type family Sort (a :: [a]) :: [a] where ... #

Equations

Sort a_1627857790 = Apply (Apply SortBySym0 CompareSym0) a_1627857790

sSort :: forall (t :: [a]). SOrd a => Sing t -> Sing (Apply SortSym0 t :: [a]) #

Generalized functions

The "`By`" operations

User-supplied equality (replacing an `Eq` context)

The predicate is assumed to define an equivalence.

type family NubBy (a :: TyFun a (TyFun a Bool -> Type) -> Type) (a :: [a]) :: [a] where ... #

Equations

NubBy eq l = Apply (Apply (Let1627856834NubBy'Sym2 eq l) l) '[]

sNubBy :: forall (t :: TyFun a (TyFun a Bool -> Type) -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply NubBySym0 t) t :: [a]) #

type family DeleteBy (a :: TyFun a (TyFun a Bool -> Type) -> Type) (a :: a) (a :: [a]) :: [a] where ... #

Equations

DeleteBy _z_1627857812 _z_1627857815 '[] = '[]
DeleteBy eq x ((:) y ys) = Case_1627857841 eq x y ys (Let1627857822Scrutinee_1627856689Sym4 eq x y ys)

sDeleteBy :: forall (t :: TyFun a (TyFun a Bool -> Type) -> Type) (t :: a) (t :: [a]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply DeleteBySym0 t) t) t :: [a]) #

type family DeleteFirstsBy (a :: TyFun a (TyFun a Bool -> Type) -> Type) (a :: [a]) (a :: [a]) :: [a] where ... #

Equations

DeleteFirstsBy eq a_1627857859 a_1627857861 = Apply (Apply (Apply FoldlSym0 (Apply FlipSym0 (Apply DeleteBySym0 eq))) a_1627857859) a_1627857861

sDeleteFirstsBy :: forall (t :: TyFun a (TyFun a Bool -> Type) -> Type) (t :: [a]) (t :: [a]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply DeleteFirstsBySym0 t) t) t :: [a]) #

type family UnionBy (a :: TyFun a (TyFun a Bool -> Type) -> Type) (a :: [a]) (a :: [a]) :: [a] where ... #

Equations

UnionBy eq xs ys = Apply (Apply (:++$) xs) (Apply (Apply (Apply FoldlSym0 (Apply FlipSym0 (Apply DeleteBySym0 eq))) (Apply (Apply NubBySym0 eq) ys)) xs)

sUnionBy :: forall (t :: TyFun a (TyFun a Bool -> Type) -> Type) (t :: [a]) (t :: [a]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply UnionBySym0 t) t) t :: [a]) #

type family IntersectBy (a :: TyFun a (TyFun a Bool -> Type) -> Type) (a :: [a]) (a :: [a]) :: [a] where ... #

Equations

IntersectBy _z_1627857573 '[] '[] = '[]
IntersectBy _z_1627857576 '[] ((:) _z_1627857579 _z_1627857582) = '[]
IntersectBy _z_1627857585 ((:) _z_1627857588 _z_1627857591) '[] = '[]
IntersectBy eq ((:) wild_1627856709 wild_1627856711) ((:) wild_1627856713 wild_1627856715) = Apply (Apply FilterSym0 (Apply (Apply (Apply (Apply (Apply Lambda_1627857650Sym0 eq) wild_1627856709) wild_1627856711) wild_1627856713) wild_1627856715)) (Let1627857599XsSym5 eq wild_1627856709 wild_1627856711 wild_1627856713 wild_1627856715)

sIntersectBy :: forall (t :: TyFun a (TyFun a Bool -> Type) -> Type) (t :: [a]) (t :: [a]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply IntersectBySym0 t) t) t :: [a]) #

type family GroupBy (a :: TyFun a (TyFun a Bool -> Type) -> Type) (a :: [a]) :: [[a]] where ... #

Equations

GroupBy _z_1627857373 '[] = '[]
GroupBy eq ((:) x xs) = Apply (Apply (:$) (Apply (Apply (:$) x) (Let1627857379YsSym3 eq x xs))) (Apply (Apply GroupBySym0 eq) (Let1627857379ZsSym3 eq x xs))

sGroupBy :: forall (t :: TyFun a (TyFun a Bool -> Type) -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply GroupBySym0 t) t :: [[a]]) #

User-supplied comparison (replacing an `Ord` context)

The function is assumed to define a total ordering.

type family SortBy (a :: TyFun a (TyFun a Ordering -> Type) -> Type) (a :: [a]) :: [a] where ... #

Equations

SortBy cmp a_1627857786 = Apply (Apply (Apply FoldrSym0 (Apply InsertBySym0 cmp)) '[]) a_1627857786

sSortBy :: forall (t :: TyFun a (TyFun a Ordering -> Type) -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply SortBySym0 t) t :: [a]) #

type family InsertBy (a :: TyFun a (TyFun a Ordering -> Type) -> Type) (a :: a) (a :: [a]) :: [a] where ... #

Equations

InsertBy _z_1627857717 x '[] = Apply (Apply (:$) x) '[]
InsertBy cmp x ((:) y ys') = Case_1627857763 cmp x y ys' (Let1627857744Scrutinee_1627856691Sym4 cmp x y ys')

sInsertBy :: forall (t :: TyFun a (TyFun a Ordering -> Type) -> Type) (t :: a) (t :: [a]). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply InsertBySym0 t) t) t :: [a]) #

type family MaximumBy (a :: TyFun a (TyFun a Ordering -> Type) -> Type) (a :: [a]) :: a where ... #

Equations

MaximumBy _z_1627859248 '[] = Apply ErrorSym0 "Data.Singletons.List.maximumBy: empty list"
MaximumBy cmp ((:) wild_1627856695 wild_1627856697) = Apply (Apply Foldl1Sym0 (Let1627859267MaxBySym3 cmp wild_1627856695 wild_1627856697)) (Let1627859254XsSym3 cmp wild_1627856695 wild_1627856697)

sMaximumBy :: forall (t :: TyFun a (TyFun a Ordering -> Type) -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply MaximumBySym0 t) t :: a) #

type family MinimumBy (a :: TyFun a (TyFun a Ordering -> Type) -> Type) (a :: [a]) :: a where ... #

Equations

MinimumBy _z_1627859335 '[] = Apply ErrorSym0 "Data.Singletons.List.minimumBy: empty list"
MinimumBy cmp ((:) wild_1627856701 wild_1627856703) = Apply (Apply Foldl1Sym0 (Let1627859354MinBySym3 cmp wild_1627856701 wild_1627856703)) (Let1627859341XsSym3 cmp wild_1627856701 wild_1627856703)

sMinimumBy :: forall (t :: TyFun a (TyFun a Ordering -> Type) -> Type) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply MinimumBySym0 t) t :: a) #

The "`generic`" operations

The prefix `generic' indicates an overloaded function that is a generalized version of a Prelude function.

type family GenericLength (a :: [a]) :: i where ... #

Equations

GenericLength '[] = FromInteger 0
GenericLength ((:) _z_1627856794 xs) = Apply (Apply (:+$) (FromInteger 1)) (Apply GenericLengthSym0 xs)

sGenericLength :: forall (t :: [a]). SNum i => Sing t -> Sing (Apply GenericLengthSym0 t :: i) #

Defunctionalization symbols

type NilSym0 = '[] #

data (:$) (l :: TyFun a822083585 (TyFun [a822083585] [a822083585] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun a822083585 (TyFun [a822083585] [a822083585] -> Type) -> *) ((:$) a822083585) #
Methods suppressUnusedWarnings :: Proxy ((:$) a822083585) t -> () #
type Apply a822083585 (TyFun [a822083585] [a822083585] -> Type) ((:$) a822083585) l #
type Apply a822083585 (TyFun [a822083585] [a822083585] -> Type) ((:$) a822083585) l = (:$$) a822083585 l

data (l :: a822083585) :$$ (l :: TyFun [a822083585] [a822083585]) #

Instances

SuppressUnusedWarnings (a822083585 -> TyFun [a822083585] [a822083585] -> *) ((:$$) a822083585) #
Methods suppressUnusedWarnings :: Proxy ((:$$) a822083585) t -> () #
type Apply [a] [a] ((:$$) a l1) l2 #
type Apply [a] [a] ((:$$) a l1) l2 = (:) a l1 l2

type (:$$$) (t :: a822083585) (t :: [a822083585]) = (:) t t #

type (:++$$$) (t :: [a1627672477]) (t :: [a1627672477]) = (:++) t t #

data (l :: [a1627672477]) :++$$ (l :: TyFun [a1627672477] [a1627672477]) #

Instances

SuppressUnusedWarnings ([a1627672477] -> TyFun [a1627672477] [a1627672477] -> *) ((:++$$) a1627672477) #
Methods suppressUnusedWarnings :: Proxy ((:++$$) a1627672477) t -> () #
type Apply [a] [a] ((:++$$) a l1) l2 #
type Apply [a] [a] ((:++$$) a l1) l2 = (:++) a l1 l2

data (:++$) (l :: TyFun [a1627672477] (TyFun [a1627672477] [a1627672477] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun [a1627672477] (TyFun [a1627672477] [a1627672477] -> Type) -> *) ((:++$) a1627672477) #
Methods suppressUnusedWarnings :: Proxy ((:++$) a1627672477) t -> () #
type Apply [a1627672477] (TyFun [a1627672477] [a1627672477] -> Type) ((:++$) a1627672477) l #
type Apply [a1627672477] (TyFun [a1627672477] [a1627672477] -> Type) ((:++$) a1627672477) l = (:++$$) a1627672477 l

data HeadSym0 (l :: TyFun [a1627856203] a1627856203) #

Instances

SuppressUnusedWarnings (TyFun [a1627856203] a1627856203 -> *) (HeadSym0 a1627856203) #
Methods suppressUnusedWarnings :: Proxy (HeadSym0 a1627856203) t -> () #
type Apply [a] a (HeadSym0 a) l #
type Apply [a] a (HeadSym0 a) l = Head a l

type HeadSym1 (t :: [a1627856203]) = Head t #

data LastSym0 (l :: TyFun [a1627856202] a1627856202) #

Instances

SuppressUnusedWarnings (TyFun [a1627856202] a1627856202 -> *) (LastSym0 a1627856202) #
Methods suppressUnusedWarnings :: Proxy (LastSym0 a1627856202) t -> () #
type Apply [a] a (LastSym0 a) l #
type Apply [a] a (LastSym0 a) l = Last a l

type LastSym1 (t :: [a1627856202]) = Last t #

data TailSym0 (l :: TyFun [a1627856201] [a1627856201]) #

Instances

SuppressUnusedWarnings (TyFun [a1627856201] [a1627856201] -> *) (TailSym0 a1627856201) #
Methods suppressUnusedWarnings :: Proxy (TailSym0 a1627856201) t -> () #
type Apply [a] [a] (TailSym0 a) l #
type Apply [a] [a] (TailSym0 a) l = Tail a l

type TailSym1 (t :: [a1627856201]) = Tail t #

data InitSym0 (l :: TyFun [a1627856200] [a1627856200]) #

Instances

SuppressUnusedWarnings (TyFun [a1627856200] [a1627856200] -> *) (InitSym0 a1627856200) #
Methods suppressUnusedWarnings :: Proxy (InitSym0 a1627856200) t -> () #
type Apply [a] [a] (InitSym0 a) l #
type Apply [a] [a] (InitSym0 a) l = Init a l

type InitSym1 (t :: [a1627856200]) = Init t #

data NullSym0 (l :: TyFun [a1627856199] Bool) #

Instances

SuppressUnusedWarnings (TyFun [a1627856199] Bool -> *) (NullSym0 a1627856199) #
Methods suppressUnusedWarnings :: Proxy (NullSym0 a1627856199) t -> () #
type Apply [a] Bool (NullSym0 a) l #
type Apply [a] Bool (NullSym0 a) l = Null a l

type NullSym1 (t :: [a1627856199]) = Null t #

data LengthSym0 (l :: TyFun [a1627856086] Nat) #

Instances

SuppressUnusedWarnings (TyFun [a1627856086] Nat -> *) (LengthSym0 a1627856086) #
Methods suppressUnusedWarnings :: Proxy (LengthSym0 a1627856086) t -> () #
type Apply [a] Nat (LengthSym0 a) l #
type Apply [a] Nat (LengthSym0 a) l = Length a l

type LengthSym1 (t :: [a1627856086]) = Length t #

data MapSym0 (l :: TyFun (TyFun a1627672478 b1627672479 -> Type) (TyFun [a1627672478] [b1627672479] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627672478 b1627672479 -> Type) (TyFun [a1627672478] [b1627672479] -> Type) -> *) (MapSym0 a1627672478 b1627672479) #
Methods suppressUnusedWarnings :: Proxy (MapSym0 a1627672478 b1627672479) t -> () #
type Apply (TyFun a1627672478 b1627672479 -> Type) (TyFun [a1627672478] [b1627672479] -> Type) (MapSym0 a1627672478 b1627672479) l #
type Apply (TyFun a1627672478 b1627672479 -> Type) (TyFun [a1627672478] [b1627672479] -> Type) (MapSym0 a1627672478 b1627672479) l = MapSym1 a1627672478 b1627672479 l

data MapSym1 (l :: TyFun a1627672478 b1627672479 -> Type) (l :: TyFun [a1627672478] [b1627672479]) #

Instances

SuppressUnusedWarnings ((TyFun a1627672478 b1627672479 -> Type) -> TyFun [a1627672478] [b1627672479] -> *) (MapSym1 a1627672478 b1627672479) #
Methods suppressUnusedWarnings :: Proxy (MapSym1 a1627672478 b1627672479) t -> () #
type Apply [a] [b] (MapSym1 a b l1) l2 #
type Apply [a] [b] (MapSym1 a b l1) l2 = Map a b l1 l2

type MapSym2 (t :: TyFun a1627672478 b1627672479 -> Type) (t :: [a1627672478]) = Map t t #

data ReverseSym0 (l :: TyFun [a1627856198] [a1627856198]) #

Instances

SuppressUnusedWarnings (TyFun [a1627856198] [a1627856198] -> *) (ReverseSym0 a1627856198) #
Methods suppressUnusedWarnings :: Proxy (ReverseSym0 a1627856198) t -> () #
type Apply [a] [a] (ReverseSym0 a) l #
type Apply [a] [a] (ReverseSym0 a) l = Reverse a l

type ReverseSym1 (t :: [a1627856198]) = Reverse t #

data IntersperseSym0 (l :: TyFun a1627856197 (TyFun [a1627856197] [a1627856197] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun a1627856197 (TyFun [a1627856197] [a1627856197] -> Type) -> *) (IntersperseSym0 a1627856197) #
Methods suppressUnusedWarnings :: Proxy (IntersperseSym0 a1627856197) t -> () #
type Apply a1627856197 (TyFun [a1627856197] [a1627856197] -> Type) (IntersperseSym0 a1627856197) l #
type Apply a1627856197 (TyFun [a1627856197] [a1627856197] -> Type) (IntersperseSym0 a1627856197) l = IntersperseSym1 a1627856197 l

data IntersperseSym1 (l :: a1627856197) (l :: TyFun [a1627856197] [a1627856197]) #

Instances

SuppressUnusedWarnings (a1627856197 -> TyFun [a1627856197] [a1627856197] -> *) (IntersperseSym1 a1627856197) #
Methods suppressUnusedWarnings :: Proxy (IntersperseSym1 a1627856197) t -> () #
type Apply [a] [a] (IntersperseSym1 a l1) l2 #
type Apply [a] [a] (IntersperseSym1 a l1) l2 = Intersperse a l1 l2

type IntersperseSym2 (t :: a1627856197) (t :: [a1627856197]) = Intersperse t t #

data IntercalateSym0 (l :: TyFun [a1627856196] (TyFun [[a1627856196]] [a1627856196] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun [a1627856196] (TyFun [[a1627856196]] [a1627856196] -> Type) -> *) (IntercalateSym0 a1627856196) #
Methods suppressUnusedWarnings :: Proxy (IntercalateSym0 a1627856196) t -> () #
type Apply [a1627856196] (TyFun [[a1627856196]] [a1627856196] -> Type) (IntercalateSym0 a1627856196) l #
type Apply [a1627856196] (TyFun [[a1627856196]] [a1627856196] -> Type) (IntercalateSym0 a1627856196) l = IntercalateSym1 a1627856196 l

data IntercalateSym1 (l :: [a1627856196]) (l :: TyFun [[a1627856196]] [a1627856196]) #

Instances

SuppressUnusedWarnings ([a1627856196] -> TyFun [[a1627856196]] [a1627856196] -> *) (IntercalateSym1 a1627856196) #
Methods suppressUnusedWarnings :: Proxy (IntercalateSym1 a1627856196) t -> () #
type Apply [[a]] [a] (IntercalateSym1 a l1) l2 #
type Apply [[a]] [a] (IntercalateSym1 a l1) l2 = Intercalate a l1 l2

type IntercalateSym2 (t :: [a1627856196]) (t :: [[a1627856196]]) = Intercalate t t #

data TransposeSym0 (l :: TyFun [[a1627856084]] [[a1627856084]]) #

Instances

SuppressUnusedWarnings (TyFun [[a1627856084]] [[a1627856084]] -> *) (TransposeSym0 a1627856084) #
Methods suppressUnusedWarnings :: Proxy (TransposeSym0 a1627856084) t -> () #
type Apply [[a]] [[a]] (TransposeSym0 a) l #
type Apply [[a]] [[a]] (TransposeSym0 a) l = Transpose a l

type TransposeSym1 (t :: [[a1627856084]]) = Transpose t #

data SubsequencesSym0 (l :: TyFun [a1627856195] [[a1627856195]]) #

Instances

SuppressUnusedWarnings (TyFun [a1627856195] [[a1627856195]] -> *) (SubsequencesSym0 a1627856195) #
Methods suppressUnusedWarnings :: Proxy (SubsequencesSym0 a1627856195) t -> () #
type Apply [a] [[a]] (SubsequencesSym0 a) l #
type Apply [a] [[a]] (SubsequencesSym0 a) l = Subsequences a l

type SubsequencesSym1 (t :: [a1627856195]) = Subsequences t #

data PermutationsSym0 (l :: TyFun [a1627856192] [[a1627856192]]) #

Instances

SuppressUnusedWarnings (TyFun [a1627856192] [[a1627856192]] -> *) (PermutationsSym0 a1627856192) #
Methods suppressUnusedWarnings :: Proxy (PermutationsSym0 a1627856192) t -> () #
type Apply [a] [[a]] (PermutationsSym0 a) l #
type Apply [a] [[a]] (PermutationsSym0 a) l = Permutations a l

type PermutationsSym1 (t :: [a1627856192]) = Permutations t #

data FoldlSym0 (l :: TyFun (TyFun b1627632057 (TyFun a1627632056 b1627632057 -> Type) -> Type) (TyFun b1627632057 (TyFun [a1627632056] b1627632057 -> Type) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun b1627632057 (TyFun a1627632056 b1627632057 -> Type) -> Type) (TyFun b1627632057 (TyFun [a1627632056] b1627632057 -> Type) -> Type) -> *) (FoldlSym0 a1627632056 b1627632057) #
Methods suppressUnusedWarnings :: Proxy (FoldlSym0 a1627632056 b1627632057) t -> () #
type Apply (TyFun b1627632057 (TyFun a1627632056 b1627632057 -> Type) -> Type) (TyFun b1627632057 (TyFun [a1627632056] b1627632057 -> Type) -> Type) (FoldlSym0 a1627632056 b1627632057) l #
type Apply (TyFun b1627632057 (TyFun a1627632056 b1627632057 -> Type) -> Type) (TyFun b1627632057 (TyFun [a1627632056] b1627632057 -> Type) -> Type) (FoldlSym0 a1627632056 b1627632057) l = FoldlSym1 a1627632056 b1627632057 l

data FoldlSym1 (l :: TyFun b1627632057 (TyFun a1627632056 b1627632057 -> Type) -> Type) (l :: TyFun b1627632057 (TyFun [a1627632056] b1627632057 -> Type)) #

Instances

SuppressUnusedWarnings ((TyFun b1627632057 (TyFun a1627632056 b1627632057 -> Type) -> Type) -> TyFun b1627632057 (TyFun [a1627632056] b1627632057 -> Type) -> *) (FoldlSym1 a1627632056 b1627632057) #
Methods suppressUnusedWarnings :: Proxy (FoldlSym1 a1627632056 b1627632057) t -> () #
type Apply b1627632057 (TyFun [a1627632056] b1627632057 -> Type) (FoldlSym1 a1627632056 b1627632057 l1) l2 #
type Apply b1627632057 (TyFun [a1627632056] b1627632057 -> Type) (FoldlSym1 a1627632056 b1627632057 l1) l2 = FoldlSym2 a1627632056 b1627632057 l1 l2

data FoldlSym2 (l :: TyFun b1627632057 (TyFun a1627632056 b1627632057 -> Type) -> Type) (l :: b1627632057) (l :: TyFun [a1627632056] b1627632057) #

Instances

SuppressUnusedWarnings ((TyFun b1627632057 (TyFun a1627632056 b1627632057 -> Type) -> Type) -> b1627632057 -> TyFun [a1627632056] b1627632057 -> *) (FoldlSym2 a1627632056 b1627632057) #
Methods suppressUnusedWarnings :: Proxy (FoldlSym2 a1627632056 b1627632057) t -> () #
type Apply [a] b (FoldlSym2 a b l1 l2) l3 #
type Apply [a] b (FoldlSym2 a b l1 l2) l3 = Foldl a b l1 l2 l3

type FoldlSym3 (t :: TyFun b1627632057 (TyFun a1627632056 b1627632057 -> Type) -> Type) (t :: b1627632057) (t :: [a1627632056]) = Foldl t t t #

data Foldl'Sym0 (l :: TyFun (TyFun b1627856191 (TyFun a1627856190 b1627856191 -> Type) -> Type) (TyFun b1627856191 (TyFun [a1627856190] b1627856191 -> Type) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun b1627856191 (TyFun a1627856190 b1627856191 -> Type) -> Type) (TyFun b1627856191 (TyFun [a1627856190] b1627856191 -> Type) -> Type) -> *) (Foldl'Sym0 a1627856190 b1627856191) #
Methods suppressUnusedWarnings :: Proxy (Foldl'Sym0 a1627856190 b1627856191) t -> () #
type Apply (TyFun b1627856191 (TyFun a1627856190 b1627856191 -> Type) -> Type) (TyFun b1627856191 (TyFun [a1627856190] b1627856191 -> Type) -> Type) (Foldl'Sym0 a1627856190 b1627856191) l #
type Apply (TyFun b1627856191 (TyFun a1627856190 b1627856191 -> Type) -> Type) (TyFun b1627856191 (TyFun [a1627856190] b1627856191 -> Type) -> Type) (Foldl'Sym0 a1627856190 b1627856191) l = Foldl'Sym1 a1627856190 b1627856191 l

data Foldl'Sym1 (l :: TyFun b1627856191 (TyFun a1627856190 b1627856191 -> Type) -> Type) (l :: TyFun b1627856191 (TyFun [a1627856190] b1627856191 -> Type)) #

Instances

SuppressUnusedWarnings ((TyFun b1627856191 (TyFun a1627856190 b1627856191 -> Type) -> Type) -> TyFun b1627856191 (TyFun [a1627856190] b1627856191 -> Type) -> *) (Foldl'Sym1 a1627856190 b1627856191) #
Methods suppressUnusedWarnings :: Proxy (Foldl'Sym1 a1627856190 b1627856191) t -> () #
type Apply b1627856191 (TyFun [a1627856190] b1627856191 -> Type) (Foldl'Sym1 a1627856190 b1627856191 l1) l2 #
type Apply b1627856191 (TyFun [a1627856190] b1627856191 -> Type) (Foldl'Sym1 a1627856190 b1627856191 l1) l2 = Foldl'Sym2 a1627856190 b1627856191 l1 l2

data Foldl'Sym2 (l :: TyFun b1627856191 (TyFun a1627856190 b1627856191 -> Type) -> Type) (l :: b1627856191) (l :: TyFun [a1627856190] b1627856191) #

Instances

SuppressUnusedWarnings ((TyFun b1627856191 (TyFun a1627856190 b1627856191 -> Type) -> Type) -> b1627856191 -> TyFun [a1627856190] b1627856191 -> *) (Foldl'Sym2 a1627856190 b1627856191) #
Methods suppressUnusedWarnings :: Proxy (Foldl'Sym2 a1627856190 b1627856191) t -> () #
type Apply [a] b (Foldl'Sym2 a b l1 l2) l3 #
type Apply [a] b (Foldl'Sym2 a b l1 l2) l3 = Foldl' a b l1 l2 l3

type Foldl'Sym3 (t :: TyFun b1627856191 (TyFun a1627856190 b1627856191 -> Type) -> Type) (t :: b1627856191) (t :: [a1627856190]) = Foldl' t t t #

data Foldl1Sym0 (l :: TyFun (TyFun a1627856189 (TyFun a1627856189 a1627856189 -> Type) -> Type) (TyFun [a1627856189] a1627856189 -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856189 (TyFun a1627856189 a1627856189 -> Type) -> Type) (TyFun [a1627856189] a1627856189 -> Type) -> *) (Foldl1Sym0 a1627856189) #
Methods suppressUnusedWarnings :: Proxy (Foldl1Sym0 a1627856189) t -> () #
type Apply (TyFun a1627856189 (TyFun a1627856189 a1627856189 -> Type) -> Type) (TyFun [a1627856189] a1627856189 -> Type) (Foldl1Sym0 a1627856189) l #
type Apply (TyFun a1627856189 (TyFun a1627856189 a1627856189 -> Type) -> Type) (TyFun [a1627856189] a1627856189 -> Type) (Foldl1Sym0 a1627856189) l = Foldl1Sym1 a1627856189 l

data Foldl1Sym1 (l :: TyFun a1627856189 (TyFun a1627856189 a1627856189 -> Type) -> Type) (l :: TyFun [a1627856189] a1627856189) #

Instances

SuppressUnusedWarnings ((TyFun a1627856189 (TyFun a1627856189 a1627856189 -> Type) -> Type) -> TyFun [a1627856189] a1627856189 -> *) (Foldl1Sym1 a1627856189) #
Methods suppressUnusedWarnings :: Proxy (Foldl1Sym1 a1627856189) t -> () #
type Apply [a] a (Foldl1Sym1 a l1) l2 #
type Apply [a] a (Foldl1Sym1 a l1) l2 = Foldl1 a l1 l2

type Foldl1Sym2 (t :: TyFun a1627856189 (TyFun a1627856189 a1627856189 -> Type) -> Type) (t :: [a1627856189]) = Foldl1 t t #

data Foldl1'Sym0 (l :: TyFun (TyFun a1627856188 (TyFun a1627856188 a1627856188 -> Type) -> Type) (TyFun [a1627856188] a1627856188 -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856188 (TyFun a1627856188 a1627856188 -> Type) -> Type) (TyFun [a1627856188] a1627856188 -> Type) -> *) (Foldl1'Sym0 a1627856188) #
Methods suppressUnusedWarnings :: Proxy (Foldl1'Sym0 a1627856188) t -> () #
type Apply (TyFun a1627856188 (TyFun a1627856188 a1627856188 -> Type) -> Type) (TyFun [a1627856188] a1627856188 -> Type) (Foldl1'Sym0 a1627856188) l #
type Apply (TyFun a1627856188 (TyFun a1627856188 a1627856188 -> Type) -> Type) (TyFun [a1627856188] a1627856188 -> Type) (Foldl1'Sym0 a1627856188) l = Foldl1'Sym1 a1627856188 l

data Foldl1'Sym1 (l :: TyFun a1627856188 (TyFun a1627856188 a1627856188 -> Type) -> Type) (l :: TyFun [a1627856188] a1627856188) #

Instances

SuppressUnusedWarnings ((TyFun a1627856188 (TyFun a1627856188 a1627856188 -> Type) -> Type) -> TyFun [a1627856188] a1627856188 -> *) (Foldl1'Sym1 a1627856188) #
Methods suppressUnusedWarnings :: Proxy (Foldl1'Sym1 a1627856188) t -> () #
type Apply [a] a (Foldl1'Sym1 a l1) l2 #
type Apply [a] a (Foldl1'Sym1 a l1) l2 = Foldl1' a l1 l2

type Foldl1'Sym2 (t :: TyFun a1627856188 (TyFun a1627856188 a1627856188 -> Type) -> Type) (t :: [a1627856188]) = Foldl1' t t #

data FoldrSym0 (l :: TyFun (TyFun a1627672480 (TyFun b1627672481 b1627672481 -> Type) -> Type) (TyFun b1627672481 (TyFun [a1627672480] b1627672481 -> Type) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627672480 (TyFun b1627672481 b1627672481 -> Type) -> Type) (TyFun b1627672481 (TyFun [a1627672480] b1627672481 -> Type) -> Type) -> *) (FoldrSym0 a1627672480 b1627672481) #
Methods suppressUnusedWarnings :: Proxy (FoldrSym0 a1627672480 b1627672481) t -> () #
type Apply (TyFun a1627672480 (TyFun b1627672481 b1627672481 -> Type) -> Type) (TyFun b1627672481 (TyFun [a1627672480] b1627672481 -> Type) -> Type) (FoldrSym0 a1627672480 b1627672481) l #
type Apply (TyFun a1627672480 (TyFun b1627672481 b1627672481 -> Type) -> Type) (TyFun b1627672481 (TyFun [a1627672480] b1627672481 -> Type) -> Type) (FoldrSym0 a1627672480 b1627672481) l = FoldrSym1 a1627672480 b1627672481 l

data FoldrSym1 (l :: TyFun a1627672480 (TyFun b1627672481 b1627672481 -> Type) -> Type) (l :: TyFun b1627672481 (TyFun [a1627672480] b1627672481 -> Type)) #

Instances

SuppressUnusedWarnings ((TyFun a1627672480 (TyFun b1627672481 b1627672481 -> Type) -> Type) -> TyFun b1627672481 (TyFun [a1627672480] b1627672481 -> Type) -> *) (FoldrSym1 a1627672480 b1627672481) #
Methods suppressUnusedWarnings :: Proxy (FoldrSym1 a1627672480 b1627672481) t -> () #
type Apply b1627672481 (TyFun [a1627672480] b1627672481 -> Type) (FoldrSym1 a1627672480 b1627672481 l1) l2 #
type Apply b1627672481 (TyFun [a1627672480] b1627672481 -> Type) (FoldrSym1 a1627672480 b1627672481 l1) l2 = FoldrSym2 a1627672480 b1627672481 l1 l2

data FoldrSym2 (l :: TyFun a1627672480 (TyFun b1627672481 b1627672481 -> Type) -> Type) (l :: b1627672481) (l :: TyFun [a1627672480] b1627672481) #

Instances

SuppressUnusedWarnings ((TyFun a1627672480 (TyFun b1627672481 b1627672481 -> Type) -> Type) -> b1627672481 -> TyFun [a1627672480] b1627672481 -> *) (FoldrSym2 a1627672480 b1627672481) #
Methods suppressUnusedWarnings :: Proxy (FoldrSym2 a1627672480 b1627672481) t -> () #
type Apply [a] b (FoldrSym2 a b l1 l2) l3 #
type Apply [a] b (FoldrSym2 a b l1 l2) l3 = Foldr a b l1 l2 l3

type FoldrSym3 (t :: TyFun a1627672480 (TyFun b1627672481 b1627672481 -> Type) -> Type) (t :: b1627672481) (t :: [a1627672480]) = Foldr t t t #

data Foldr1Sym0 (l :: TyFun (TyFun a1627856187 (TyFun a1627856187 a1627856187 -> Type) -> Type) (TyFun [a1627856187] a1627856187 -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856187 (TyFun a1627856187 a1627856187 -> Type) -> Type) (TyFun [a1627856187] a1627856187 -> Type) -> *) (Foldr1Sym0 a1627856187) #
Methods suppressUnusedWarnings :: Proxy (Foldr1Sym0 a1627856187) t -> () #
type Apply (TyFun a1627856187 (TyFun a1627856187 a1627856187 -> Type) -> Type) (TyFun [a1627856187] a1627856187 -> Type) (Foldr1Sym0 a1627856187) l #
type Apply (TyFun a1627856187 (TyFun a1627856187 a1627856187 -> Type) -> Type) (TyFun [a1627856187] a1627856187 -> Type) (Foldr1Sym0 a1627856187) l = Foldr1Sym1 a1627856187 l

data Foldr1Sym1 (l :: TyFun a1627856187 (TyFun a1627856187 a1627856187 -> Type) -> Type) (l :: TyFun [a1627856187] a1627856187) #

Instances

SuppressUnusedWarnings ((TyFun a1627856187 (TyFun a1627856187 a1627856187 -> Type) -> Type) -> TyFun [a1627856187] a1627856187 -> *) (Foldr1Sym1 a1627856187) #
Methods suppressUnusedWarnings :: Proxy (Foldr1Sym1 a1627856187) t -> () #
type Apply [a] a (Foldr1Sym1 a l1) l2 #
type Apply [a] a (Foldr1Sym1 a l1) l2 = Foldr1 a l1 l2

type Foldr1Sym2 (t :: TyFun a1627856187 (TyFun a1627856187 a1627856187 -> Type) -> Type) (t :: [a1627856187]) = Foldr1 t t #

data ConcatSym0 (l :: TyFun [[a1627856186]] [a1627856186]) #

Instances

SuppressUnusedWarnings (TyFun [[a1627856186]] [a1627856186] -> *) (ConcatSym0 a1627856186) #
Methods suppressUnusedWarnings :: Proxy (ConcatSym0 a1627856186) t -> () #
type Apply [[a]] [a] (ConcatSym0 a) l #
type Apply [[a]] [a] (ConcatSym0 a) l = Concat a l

type ConcatSym1 (t :: [[a1627856186]]) = Concat t #

data ConcatMapSym0 (l :: TyFun (TyFun a1627856184 [b1627856185] -> Type) (TyFun [a1627856184] [b1627856185] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856184 [b1627856185] -> Type) (TyFun [a1627856184] [b1627856185] -> Type) -> *) (ConcatMapSym0 a1627856184 b1627856185) #
Methods suppressUnusedWarnings :: Proxy (ConcatMapSym0 a1627856184 b1627856185) t -> () #
type Apply (TyFun a1627856184 [b1627856185] -> Type) (TyFun [a1627856184] [b1627856185] -> Type) (ConcatMapSym0 a1627856184 b1627856185) l #
type Apply (TyFun a1627856184 [b1627856185] -> Type) (TyFun [a1627856184] [b1627856185] -> Type) (ConcatMapSym0 a1627856184 b1627856185) l = ConcatMapSym1 a1627856184 b1627856185 l

data ConcatMapSym1 (l :: TyFun a1627856184 [b1627856185] -> Type) (l :: TyFun [a1627856184] [b1627856185]) #

Instances

SuppressUnusedWarnings ((TyFun a1627856184 [b1627856185] -> Type) -> TyFun [a1627856184] [b1627856185] -> *) (ConcatMapSym1 a1627856184 b1627856185) #
Methods suppressUnusedWarnings :: Proxy (ConcatMapSym1 a1627856184 b1627856185) t -> () #
type Apply [a] [b] (ConcatMapSym1 a b l1) l2 #
type Apply [a] [b] (ConcatMapSym1 a b l1) l2 = ConcatMap a b l1 l2

type ConcatMapSym2 (t :: TyFun a1627856184 [b1627856185] -> Type) (t :: [a1627856184]) = ConcatMap t t #

data AndSym0 (l :: TyFun [Bool] Bool) #

Instances

SuppressUnusedWarnings (TyFun [Bool] Bool -> *) AndSym0 #
Methods suppressUnusedWarnings :: Proxy AndSym0 t -> () #
type Apply [Bool] Bool AndSym0 l #
type Apply [Bool] Bool AndSym0 l = And l

type AndSym1 (t :: [Bool]) = And t #

data OrSym0 (l :: TyFun [Bool] Bool) #

Instances

SuppressUnusedWarnings (TyFun [Bool] Bool -> *) OrSym0 #
Methods suppressUnusedWarnings :: Proxy OrSym0 t -> () #
type Apply [Bool] Bool OrSym0 l #
type Apply [Bool] Bool OrSym0 l = Or l

type OrSym1 (t :: [Bool]) = Or t #

data Any_Sym0 (l :: TyFun (TyFun a1627845967 Bool -> Type) (TyFun [a1627845967] Bool -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627845967 Bool -> Type) (TyFun [a1627845967] Bool -> Type) -> *) (Any_Sym0 a1627845967) #
Methods suppressUnusedWarnings :: Proxy (Any_Sym0 a1627845967) t -> () #
type Apply (TyFun a1627845967 Bool -> Type) (TyFun [a1627845967] Bool -> Type) (Any_Sym0 a1627845967) l #
type Apply (TyFun a1627845967 Bool -> Type) (TyFun [a1627845967] Bool -> Type) (Any_Sym0 a1627845967) l = Any_Sym1 a1627845967 l

data Any_Sym1 (l :: TyFun a1627845967 Bool -> Type) (l :: TyFun [a1627845967] Bool) #

Instances

SuppressUnusedWarnings ((TyFun a1627845967 Bool -> Type) -> TyFun [a1627845967] Bool -> *) (Any_Sym1 a1627845967) #
Methods suppressUnusedWarnings :: Proxy (Any_Sym1 a1627845967) t -> () #
type Apply [a] Bool (Any_Sym1 a l1) l2 #
type Apply [a] Bool (Any_Sym1 a l1) l2 = Any_ a l1 l2

type Any_Sym2 (t :: TyFun a1627845967 Bool -> Type) (t :: [a1627845967]) = Any_ t t #

data AllSym0 (l :: TyFun (TyFun a1627856183 Bool -> Type) (TyFun [a1627856183] Bool -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856183 Bool -> Type) (TyFun [a1627856183] Bool -> Type) -> *) (AllSym0 a1627856183) #
Methods suppressUnusedWarnings :: Proxy (AllSym0 a1627856183) t -> () #
type Apply (TyFun a1627856183 Bool -> Type) (TyFun [a1627856183] Bool -> Type) (AllSym0 a1627856183) l #
type Apply (TyFun a1627856183 Bool -> Type) (TyFun [a1627856183] Bool -> Type) (AllSym0 a1627856183) l = AllSym1 a1627856183 l

data AllSym1 (l :: TyFun a1627856183 Bool -> Type) (l :: TyFun [a1627856183] Bool) #

Instances

SuppressUnusedWarnings ((TyFun a1627856183 Bool -> Type) -> TyFun [a1627856183] Bool -> *) (AllSym1 a1627856183) #
Methods suppressUnusedWarnings :: Proxy (AllSym1 a1627856183) t -> () #
type Apply [a] Bool (AllSym1 a l1) l2 #
type Apply [a] Bool (AllSym1 a l1) l2 = All a l1 l2

type AllSym2 (t :: TyFun a1627856183 Bool -> Type) (t :: [a1627856183]) = All t t #

data SumSym0 (l :: TyFun [a1627856088] a1627856088) #

Instances

SuppressUnusedWarnings (TyFun [a1627856088] a1627856088 -> *) (SumSym0 a1627856088) #
Methods suppressUnusedWarnings :: Proxy (SumSym0 a1627856088) t -> () #
type Apply [a] a (SumSym0 a) l #
type Apply [a] a (SumSym0 a) l = Sum a l

type SumSym1 (t :: [a1627856088]) = Sum t #

data ProductSym0 (l :: TyFun [a1627856087] a1627856087) #

Instances

SuppressUnusedWarnings (TyFun [a1627856087] a1627856087 -> *) (ProductSym0 a1627856087) #
Methods suppressUnusedWarnings :: Proxy (ProductSym0 a1627856087) t -> () #
type Apply [a] a (ProductSym0 a) l #
type Apply [a] a (ProductSym0 a) l = Product a l

type ProductSym1 (t :: [a1627856087]) = Product t #

data MaximumSym0 (l :: TyFun [a1627856097] a1627856097) #

Instances

SuppressUnusedWarnings (TyFun [a1627856097] a1627856097 -> *) (MaximumSym0 a1627856097) #
Methods suppressUnusedWarnings :: Proxy (MaximumSym0 a1627856097) t -> () #
type Apply [a] a (MaximumSym0 a) l #
type Apply [a] a (MaximumSym0 a) l = Maximum a l

type MaximumSym1 (t :: [a1627856097]) = Maximum t #

data MinimumSym0 (l :: TyFun [a1627856096] a1627856096) #

Instances

SuppressUnusedWarnings (TyFun [a1627856096] a1627856096 -> *) (MinimumSym0 a1627856096) #
Methods suppressUnusedWarnings :: Proxy (MinimumSym0 a1627856096) t -> () #
type Apply [a] a (MinimumSym0 a) l #
type Apply [a] a (MinimumSym0 a) l = Minimum a l

type MinimumSym1 (t :: [a1627856096]) = Minimum t #

data ScanlSym0 (l :: TyFun (TyFun b1627856181 (TyFun a1627856182 b1627856181 -> Type) -> Type) (TyFun b1627856181 (TyFun [a1627856182] [b1627856181] -> Type) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun b1627856181 (TyFun a1627856182 b1627856181 -> Type) -> Type) (TyFun b1627856181 (TyFun [a1627856182] [b1627856181] -> Type) -> Type) -> *) (ScanlSym0 a1627856182 b1627856181) #
Methods suppressUnusedWarnings :: Proxy (ScanlSym0 a1627856182 b1627856181) t -> () #
type Apply (TyFun b1627856181 (TyFun a1627856182 b1627856181 -> Type) -> Type) (TyFun b1627856181 (TyFun [a1627856182] [b1627856181] -> Type) -> Type) (ScanlSym0 a1627856182 b1627856181) l #
type Apply (TyFun b1627856181 (TyFun a1627856182 b1627856181 -> Type) -> Type) (TyFun b1627856181 (TyFun [a1627856182] [b1627856181] -> Type) -> Type) (ScanlSym0 a1627856182 b1627856181) l = ScanlSym1 a1627856182 b1627856181 l

data ScanlSym1 (l :: TyFun b1627856181 (TyFun a1627856182 b1627856181 -> Type) -> Type) (l :: TyFun b1627856181 (TyFun [a1627856182] [b1627856181] -> Type)) #

Instances

SuppressUnusedWarnings ((TyFun b1627856181 (TyFun a1627856182 b1627856181 -> Type) -> Type) -> TyFun b1627856181 (TyFun [a1627856182] [b1627856181] -> Type) -> *) (ScanlSym1 a1627856182 b1627856181) #
Methods suppressUnusedWarnings :: Proxy (ScanlSym1 a1627856182 b1627856181) t -> () #
type Apply b1627856181 (TyFun [a1627856182] [b1627856181] -> Type) (ScanlSym1 a1627856182 b1627856181 l1) l2 #
type Apply b1627856181 (TyFun [a1627856182] [b1627856181] -> Type) (ScanlSym1 a1627856182 b1627856181 l1) l2 = ScanlSym2 a1627856182 b1627856181 l1 l2

data ScanlSym2 (l :: TyFun b1627856181 (TyFun a1627856182 b1627856181 -> Type) -> Type) (l :: b1627856181) (l :: TyFun [a1627856182] [b1627856181]) #

Instances

SuppressUnusedWarnings ((TyFun b1627856181 (TyFun a1627856182 b1627856181 -> Type) -> Type) -> b1627856181 -> TyFun [a1627856182] [b1627856181] -> *) (ScanlSym2 a1627856182 b1627856181) #
Methods suppressUnusedWarnings :: Proxy (ScanlSym2 a1627856182 b1627856181) t -> () #
type Apply [a] [b] (ScanlSym2 a b l1 l2) l3 #
type Apply [a] [b] (ScanlSym2 a b l1 l2) l3 = Scanl a b l1 l2 l3

type ScanlSym3 (t :: TyFun b1627856181 (TyFun a1627856182 b1627856181 -> Type) -> Type) (t :: b1627856181) (t :: [a1627856182]) = Scanl t t t #

data Scanl1Sym0 (l :: TyFun (TyFun a1627856180 (TyFun a1627856180 a1627856180 -> Type) -> Type) (TyFun [a1627856180] [a1627856180] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856180 (TyFun a1627856180 a1627856180 -> Type) -> Type) (TyFun [a1627856180] [a1627856180] -> Type) -> *) (Scanl1Sym0 a1627856180) #
Methods suppressUnusedWarnings :: Proxy (Scanl1Sym0 a1627856180) t -> () #
type Apply (TyFun a1627856180 (TyFun a1627856180 a1627856180 -> Type) -> Type) (TyFun [a1627856180] [a1627856180] -> Type) (Scanl1Sym0 a1627856180) l #
type Apply (TyFun a1627856180 (TyFun a1627856180 a1627856180 -> Type) -> Type) (TyFun [a1627856180] [a1627856180] -> Type) (Scanl1Sym0 a1627856180) l = Scanl1Sym1 a1627856180 l

data Scanl1Sym1 (l :: TyFun a1627856180 (TyFun a1627856180 a1627856180 -> Type) -> Type) (l :: TyFun [a1627856180] [a1627856180]) #

Instances

SuppressUnusedWarnings ((TyFun a1627856180 (TyFun a1627856180 a1627856180 -> Type) -> Type) -> TyFun [a1627856180] [a1627856180] -> *) (Scanl1Sym1 a1627856180) #
Methods suppressUnusedWarnings :: Proxy (Scanl1Sym1 a1627856180) t -> () #
type Apply [a] [a] (Scanl1Sym1 a l1) l2 #
type Apply [a] [a] (Scanl1Sym1 a l1) l2 = Scanl1 a l1 l2

type Scanl1Sym2 (t :: TyFun a1627856180 (TyFun a1627856180 a1627856180 -> Type) -> Type) (t :: [a1627856180]) = Scanl1 t t #

data ScanrSym0 (l :: TyFun (TyFun a1627856178 (TyFun b1627856179 b1627856179 -> Type) -> Type) (TyFun b1627856179 (TyFun [a1627856178] [b1627856179] -> Type) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856178 (TyFun b1627856179 b1627856179 -> Type) -> Type) (TyFun b1627856179 (TyFun [a1627856178] [b1627856179] -> Type) -> Type) -> *) (ScanrSym0 a1627856178 b1627856179) #
Methods suppressUnusedWarnings :: Proxy (ScanrSym0 a1627856178 b1627856179) t -> () #
type Apply (TyFun a1627856178 (TyFun b1627856179 b1627856179 -> Type) -> Type) (TyFun b1627856179 (TyFun [a1627856178] [b1627856179] -> Type) -> Type) (ScanrSym0 a1627856178 b1627856179) l #
type Apply (TyFun a1627856178 (TyFun b1627856179 b1627856179 -> Type) -> Type) (TyFun b1627856179 (TyFun [a1627856178] [b1627856179] -> Type) -> Type) (ScanrSym0 a1627856178 b1627856179) l = ScanrSym1 a1627856178 b1627856179 l

data ScanrSym1 (l :: TyFun a1627856178 (TyFun b1627856179 b1627856179 -> Type) -> Type) (l :: TyFun b1627856179 (TyFun [a1627856178] [b1627856179] -> Type)) #

Instances

SuppressUnusedWarnings ((TyFun a1627856178 (TyFun b1627856179 b1627856179 -> Type) -> Type) -> TyFun b1627856179 (TyFun [a1627856178] [b1627856179] -> Type) -> *) (ScanrSym1 a1627856178 b1627856179) #
Methods suppressUnusedWarnings :: Proxy (ScanrSym1 a1627856178 b1627856179) t -> () #
type Apply b1627856179 (TyFun [a1627856178] [b1627856179] -> Type) (ScanrSym1 a1627856178 b1627856179 l1) l2 #
type Apply b1627856179 (TyFun [a1627856178] [b1627856179] -> Type) (ScanrSym1 a1627856178 b1627856179 l1) l2 = ScanrSym2 a1627856178 b1627856179 l1 l2

data ScanrSym2 (l :: TyFun a1627856178 (TyFun b1627856179 b1627856179 -> Type) -> Type) (l :: b1627856179) (l :: TyFun [a1627856178] [b1627856179]) #

Instances

SuppressUnusedWarnings ((TyFun a1627856178 (TyFun b1627856179 b1627856179 -> Type) -> Type) -> b1627856179 -> TyFun [a1627856178] [b1627856179] -> *) (ScanrSym2 a1627856178 b1627856179) #
Methods suppressUnusedWarnings :: Proxy (ScanrSym2 a1627856178 b1627856179) t -> () #
type Apply [a] [b] (ScanrSym2 a b l1 l2) l3 #
type Apply [a] [b] (ScanrSym2 a b l1 l2) l3 = Scanr a b l1 l2 l3

type ScanrSym3 (t :: TyFun a1627856178 (TyFun b1627856179 b1627856179 -> Type) -> Type) (t :: b1627856179) (t :: [a1627856178]) = Scanr t t t #

data Scanr1Sym0 (l :: TyFun (TyFun a1627856177 (TyFun a1627856177 a1627856177 -> Type) -> Type) (TyFun [a1627856177] [a1627856177] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856177 (TyFun a1627856177 a1627856177 -> Type) -> Type) (TyFun [a1627856177] [a1627856177] -> Type) -> *) (Scanr1Sym0 a1627856177) #
Methods suppressUnusedWarnings :: Proxy (Scanr1Sym0 a1627856177) t -> () #
type Apply (TyFun a1627856177 (TyFun a1627856177 a1627856177 -> Type) -> Type) (TyFun [a1627856177] [a1627856177] -> Type) (Scanr1Sym0 a1627856177) l #
type Apply (TyFun a1627856177 (TyFun a1627856177 a1627856177 -> Type) -> Type) (TyFun [a1627856177] [a1627856177] -> Type) (Scanr1Sym0 a1627856177) l = Scanr1Sym1 a1627856177 l

data Scanr1Sym1 (l :: TyFun a1627856177 (TyFun a1627856177 a1627856177 -> Type) -> Type) (l :: TyFun [a1627856177] [a1627856177]) #

Instances

SuppressUnusedWarnings ((TyFun a1627856177 (TyFun a1627856177 a1627856177 -> Type) -> Type) -> TyFun [a1627856177] [a1627856177] -> *) (Scanr1Sym1 a1627856177) #
Methods suppressUnusedWarnings :: Proxy (Scanr1Sym1 a1627856177) t -> () #
type Apply [a] [a] (Scanr1Sym1 a l1) l2 #
type Apply [a] [a] (Scanr1Sym1 a l1) l2 = Scanr1 a l1 l2

type Scanr1Sym2 (t :: TyFun a1627856177 (TyFun a1627856177 a1627856177 -> Type) -> Type) (t :: [a1627856177]) = Scanr1 t t #

data MapAccumLSym0 (l :: TyFun (TyFun acc1627856174 (TyFun x1627856175 (acc1627856174, y1627856176) -> Type) -> Type) (TyFun acc1627856174 (TyFun [x1627856175] (acc1627856174, [y1627856176]) -> Type) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun acc1627856174 (TyFun x1627856175 (acc1627856174, y1627856176) -> Type) -> Type) (TyFun acc1627856174 (TyFun [x1627856175] (acc1627856174, [y1627856176]) -> Type) -> Type) -> *) (MapAccumLSym0 x1627856175 acc1627856174 y1627856176) #
Methods suppressUnusedWarnings :: Proxy (MapAccumLSym0 x1627856175 acc1627856174 y1627856176) t -> () #
type Apply (TyFun acc1627856174 (TyFun x1627856175 (acc1627856174, y1627856176) -> Type) -> Type) (TyFun acc1627856174 (TyFun [x1627856175] (acc1627856174, [y1627856176]) -> Type) -> Type) (MapAccumLSym0 x1627856175 acc1627856174 y1627856176) l #
type Apply (TyFun acc1627856174 (TyFun x1627856175 (acc1627856174, y1627856176) -> Type) -> Type) (TyFun acc1627856174 (TyFun [x1627856175] (acc1627856174, [y1627856176]) -> Type) -> Type) (MapAccumLSym0 x1627856175 acc1627856174 y1627856176) l = MapAccumLSym1 x1627856175 acc1627856174 y1627856176 l

data MapAccumLSym1 (l :: TyFun acc1627856174 (TyFun x1627856175 (acc1627856174, y1627856176) -> Type) -> Type) (l :: TyFun acc1627856174 (TyFun [x1627856175] (acc1627856174, [y1627856176]) -> Type)) #

Instances

SuppressUnusedWarnings ((TyFun acc1627856174 (TyFun x1627856175 (acc1627856174, y1627856176) -> Type) -> Type) -> TyFun acc1627856174 (TyFun [x1627856175] (acc1627856174, [y1627856176]) -> Type) -> *) (MapAccumLSym1 x1627856175 acc1627856174 y1627856176) #
Methods suppressUnusedWarnings :: Proxy (MapAccumLSym1 x1627856175 acc1627856174 y1627856176) t -> () #
type Apply acc1627856174 (TyFun [x1627856175] (acc1627856174, [y1627856176]) -> Type) (MapAccumLSym1 x1627856175 acc1627856174 y1627856176 l1) l2 #
type Apply acc1627856174 (TyFun [x1627856175] (acc1627856174, [y1627856176]) -> Type) (MapAccumLSym1 x1627856175 acc1627856174 y1627856176 l1) l2 = MapAccumLSym2 x1627856175 acc1627856174 y1627856176 l1 l2

data MapAccumLSym2 (l :: TyFun acc1627856174 (TyFun x1627856175 (acc1627856174, y1627856176) -> Type) -> Type) (l :: acc1627856174) (l :: TyFun [x1627856175] (acc1627856174, [y1627856176])) #

Instances

SuppressUnusedWarnings ((TyFun acc1627856174 (TyFun x1627856175 (acc1627856174, y1627856176) -> Type) -> Type) -> acc1627856174 -> TyFun [x1627856175] (acc1627856174, [y1627856176]) -> *) (MapAccumLSym2 x1627856175 acc1627856174 y1627856176) #
Methods suppressUnusedWarnings :: Proxy (MapAccumLSym2 x1627856175 acc1627856174 y1627856176) t -> () #
type Apply [x] (acc, [y]) (MapAccumLSym2 x acc y l1 l2) l3 #
type Apply [x] (acc, [y]) (MapAccumLSym2 x acc y l1 l2) l3 = MapAccumL x acc y l1 l2 l3

type MapAccumLSym3 (t :: TyFun acc1627856174 (TyFun x1627856175 (acc1627856174, y1627856176) -> Type) -> Type) (t :: acc1627856174) (t :: [x1627856175]) = MapAccumL t t t #

data MapAccumRSym0 (l :: TyFun (TyFun acc1627856171 (TyFun x1627856172 (acc1627856171, y1627856173) -> Type) -> Type) (TyFun acc1627856171 (TyFun [x1627856172] (acc1627856171, [y1627856173]) -> Type) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun acc1627856171 (TyFun x1627856172 (acc1627856171, y1627856173) -> Type) -> Type) (TyFun acc1627856171 (TyFun [x1627856172] (acc1627856171, [y1627856173]) -> Type) -> Type) -> *) (MapAccumRSym0 x1627856172 acc1627856171 y1627856173) #
Methods suppressUnusedWarnings :: Proxy (MapAccumRSym0 x1627856172 acc1627856171 y1627856173) t -> () #
type Apply (TyFun acc1627856171 (TyFun x1627856172 (acc1627856171, y1627856173) -> Type) -> Type) (TyFun acc1627856171 (TyFun [x1627856172] (acc1627856171, [y1627856173]) -> Type) -> Type) (MapAccumRSym0 x1627856172 acc1627856171 y1627856173) l #
type Apply (TyFun acc1627856171 (TyFun x1627856172 (acc1627856171, y1627856173) -> Type) -> Type) (TyFun acc1627856171 (TyFun [x1627856172] (acc1627856171, [y1627856173]) -> Type) -> Type) (MapAccumRSym0 x1627856172 acc1627856171 y1627856173) l = MapAccumRSym1 x1627856172 acc1627856171 y1627856173 l

data MapAccumRSym1 (l :: TyFun acc1627856171 (TyFun x1627856172 (acc1627856171, y1627856173) -> Type) -> Type) (l :: TyFun acc1627856171 (TyFun [x1627856172] (acc1627856171, [y1627856173]) -> Type)) #

Instances

SuppressUnusedWarnings ((TyFun acc1627856171 (TyFun x1627856172 (acc1627856171, y1627856173) -> Type) -> Type) -> TyFun acc1627856171 (TyFun [x1627856172] (acc1627856171, [y1627856173]) -> Type) -> *) (MapAccumRSym1 x1627856172 acc1627856171 y1627856173) #
Methods suppressUnusedWarnings :: Proxy (MapAccumRSym1 x1627856172 acc1627856171 y1627856173) t -> () #
type Apply acc1627856171 (TyFun [x1627856172] (acc1627856171, [y1627856173]) -> Type) (MapAccumRSym1 x1627856172 acc1627856171 y1627856173 l1) l2 #
type Apply acc1627856171 (TyFun [x1627856172] (acc1627856171, [y1627856173]) -> Type) (MapAccumRSym1 x1627856172 acc1627856171 y1627856173 l1) l2 = MapAccumRSym2 x1627856172 acc1627856171 y1627856173 l1 l2

data MapAccumRSym2 (l :: TyFun acc1627856171 (TyFun x1627856172 (acc1627856171, y1627856173) -> Type) -> Type) (l :: acc1627856171) (l :: TyFun [x1627856172] (acc1627856171, [y1627856173])) #

Instances

SuppressUnusedWarnings ((TyFun acc1627856171 (TyFun x1627856172 (acc1627856171, y1627856173) -> Type) -> Type) -> acc1627856171 -> TyFun [x1627856172] (acc1627856171, [y1627856173]) -> *) (MapAccumRSym2 x1627856172 acc1627856171 y1627856173) #
Methods suppressUnusedWarnings :: Proxy (MapAccumRSym2 x1627856172 acc1627856171 y1627856173) t -> () #
type Apply [x] (acc, [y]) (MapAccumRSym2 x acc y l1 l2) l3 #
type Apply [x] (acc, [y]) (MapAccumRSym2 x acc y l1 l2) l3 = MapAccumR x acc y l1 l2 l3

type MapAccumRSym3 (t :: TyFun acc1627856171 (TyFun x1627856172 (acc1627856171, y1627856173) -> Type) -> Type) (t :: acc1627856171) (t :: [x1627856172]) = MapAccumR t t t #

data ReplicateSym0 (l :: TyFun Nat (TyFun a1627856085 [a1627856085] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun Nat (TyFun a1627856085 [a1627856085] -> Type) -> *) (ReplicateSym0 a1627856085) #
Methods suppressUnusedWarnings :: Proxy (ReplicateSym0 a1627856085) t -> () #
type Apply Nat (TyFun a1627856085 [a1627856085] -> Type) (ReplicateSym0 a1627856085) l #
type Apply Nat (TyFun a1627856085 [a1627856085] -> Type) (ReplicateSym0 a1627856085) l = ReplicateSym1 a1627856085 l

data ReplicateSym1 (l :: Nat) (l :: TyFun a1627856085 [a1627856085]) #

Instances

SuppressUnusedWarnings (Nat -> TyFun a1627856085 [a1627856085] -> *) (ReplicateSym1 a1627856085) #
Methods suppressUnusedWarnings :: Proxy (ReplicateSym1 a1627856085) t -> () #
type Apply a [a] (ReplicateSym1 a l1) l2 #
type Apply a [a] (ReplicateSym1 a l1) l2 = Replicate a l1 l2

type ReplicateSym2 (t :: Nat) (t :: a1627856085) = Replicate t t #

data UnfoldrSym0 (l :: TyFun (TyFun b1627856169 (Maybe (a1627856170, b1627856169)) -> Type) (TyFun b1627856169 [a1627856170] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun b1627856169 (Maybe (a1627856170, b1627856169)) -> Type) (TyFun b1627856169 [a1627856170] -> Type) -> *) (UnfoldrSym0 b1627856169 a1627856170) #
Methods suppressUnusedWarnings :: Proxy (UnfoldrSym0 b1627856169 a1627856170) t -> () #
type Apply (TyFun b1627856169 (Maybe (a1627856170, b1627856169)) -> Type) (TyFun b1627856169 [a1627856170] -> Type) (UnfoldrSym0 b1627856169 a1627856170) l #
type Apply (TyFun b1627856169 (Maybe (a1627856170, b1627856169)) -> Type) (TyFun b1627856169 [a1627856170] -> Type) (UnfoldrSym0 b1627856169 a1627856170) l = UnfoldrSym1 b1627856169 a1627856170 l

data UnfoldrSym1 (l :: TyFun b1627856169 (Maybe (a1627856170, b1627856169)) -> Type) (l :: TyFun b1627856169 [a1627856170]) #

Instances

SuppressUnusedWarnings ((TyFun b1627856169 (Maybe (a1627856170, b1627856169)) -> Type) -> TyFun b1627856169 [a1627856170] -> *) (UnfoldrSym1 b1627856169 a1627856170) #
Methods suppressUnusedWarnings :: Proxy (UnfoldrSym1 b1627856169 a1627856170) t -> () #
type Apply b [a] (UnfoldrSym1 b a l1) l2 #
type Apply b [a] (UnfoldrSym1 b a l1) l2 = Unfoldr b a l1 l2

type UnfoldrSym2 (t :: TyFun b1627856169 (Maybe (a1627856170, b1627856169)) -> Type) (t :: b1627856169) = Unfoldr t t #

data TakeSym0 (l :: TyFun Nat (TyFun [a1627856101] [a1627856101] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun Nat (TyFun [a1627856101] [a1627856101] -> Type) -> *) (TakeSym0 a1627856101) #
Methods suppressUnusedWarnings :: Proxy (TakeSym0 a1627856101) t -> () #
type Apply Nat (TyFun [a1627856101] [a1627856101] -> Type) (TakeSym0 a1627856101) l #
type Apply Nat (TyFun [a1627856101] [a1627856101] -> Type) (TakeSym0 a1627856101) l = TakeSym1 a1627856101 l

data TakeSym1 (l :: Nat) (l :: TyFun [a1627856101] [a1627856101]) #

Instances

SuppressUnusedWarnings (Nat -> TyFun [a1627856101] [a1627856101] -> *) (TakeSym1 a1627856101) #
Methods suppressUnusedWarnings :: Proxy (TakeSym1 a1627856101) t -> () #
type Apply [a] [a] (TakeSym1 a l1) l2 #
type Apply [a] [a] (TakeSym1 a l1) l2 = Take a l1 l2

type TakeSym2 (t :: Nat) (t :: [a1627856101]) = Take t t #

data DropSym0 (l :: TyFun Nat (TyFun [a1627856100] [a1627856100] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun Nat (TyFun [a1627856100] [a1627856100] -> Type) -> *) (DropSym0 a1627856100) #
Methods suppressUnusedWarnings :: Proxy (DropSym0 a1627856100) t -> () #
type Apply Nat (TyFun [a1627856100] [a1627856100] -> Type) (DropSym0 a1627856100) l #
type Apply Nat (TyFun [a1627856100] [a1627856100] -> Type) (DropSym0 a1627856100) l = DropSym1 a1627856100 l

data DropSym1 (l :: Nat) (l :: TyFun [a1627856100] [a1627856100]) #

Instances

SuppressUnusedWarnings (Nat -> TyFun [a1627856100] [a1627856100] -> *) (DropSym1 a1627856100) #
Methods suppressUnusedWarnings :: Proxy (DropSym1 a1627856100) t -> () #
type Apply [a] [a] (DropSym1 a l1) l2 #
type Apply [a] [a] (DropSym1 a l1) l2 = Drop a l1 l2

type DropSym2 (t :: Nat) (t :: [a1627856100]) = Drop t t #

data SplitAtSym0 (l :: TyFun Nat (TyFun [a1627856099] ([a1627856099], [a1627856099]) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun Nat (TyFun [a1627856099] ([a1627856099], [a1627856099]) -> Type) -> *) (SplitAtSym0 a1627856099) #
Methods suppressUnusedWarnings :: Proxy (SplitAtSym0 a1627856099) t -> () #
type Apply Nat (TyFun [a1627856099] ([a1627856099], [a1627856099]) -> Type) (SplitAtSym0 a1627856099) l #
type Apply Nat (TyFun [a1627856099] ([a1627856099], [a1627856099]) -> Type) (SplitAtSym0 a1627856099) l = SplitAtSym1 a1627856099 l

data SplitAtSym1 (l :: Nat) (l :: TyFun [a1627856099] ([a1627856099], [a1627856099])) #

Instances

SuppressUnusedWarnings (Nat -> TyFun [a1627856099] ([a1627856099], [a1627856099]) -> *) (SplitAtSym1 a1627856099) #
Methods suppressUnusedWarnings :: Proxy (SplitAtSym1 a1627856099) t -> () #
type Apply [a] ([a], [a]) (SplitAtSym1 a l1) l2 #
type Apply [a] ([a], [a]) (SplitAtSym1 a l1) l2 = SplitAt a l1 l2

type SplitAtSym2 (t :: Nat) (t :: [a1627856099]) = SplitAt t t #

data TakeWhileSym0 (l :: TyFun (TyFun a1627856106 Bool -> Type) (TyFun [a1627856106] [a1627856106] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856106 Bool -> Type) (TyFun [a1627856106] [a1627856106] -> Type) -> *) (TakeWhileSym0 a1627856106) #
Methods suppressUnusedWarnings :: Proxy (TakeWhileSym0 a1627856106) t -> () #
type Apply (TyFun a1627856106 Bool -> Type) (TyFun [a1627856106] [a1627856106] -> Type) (TakeWhileSym0 a1627856106) l #
type Apply (TyFun a1627856106 Bool -> Type) (TyFun [a1627856106] [a1627856106] -> Type) (TakeWhileSym0 a1627856106) l = TakeWhileSym1 a1627856106 l

data TakeWhileSym1 (l :: TyFun a1627856106 Bool -> Type) (l :: TyFun [a1627856106] [a1627856106]) #

Instances

SuppressUnusedWarnings ((TyFun a1627856106 Bool -> Type) -> TyFun [a1627856106] [a1627856106] -> *) (TakeWhileSym1 a1627856106) #
Methods suppressUnusedWarnings :: Proxy (TakeWhileSym1 a1627856106) t -> () #
type Apply [a] [a] (TakeWhileSym1 a l1) l2 #
type Apply [a] [a] (TakeWhileSym1 a l1) l2 = TakeWhile a l1 l2

type TakeWhileSym2 (t :: TyFun a1627856106 Bool -> Type) (t :: [a1627856106]) = TakeWhile t t #

data DropWhileSym0 (l :: TyFun (TyFun a1627856105 Bool -> Type) (TyFun [a1627856105] [a1627856105] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856105 Bool -> Type) (TyFun [a1627856105] [a1627856105] -> Type) -> *) (DropWhileSym0 a1627856105) #
Methods suppressUnusedWarnings :: Proxy (DropWhileSym0 a1627856105) t -> () #
type Apply (TyFun a1627856105 Bool -> Type) (TyFun [a1627856105] [a1627856105] -> Type) (DropWhileSym0 a1627856105) l #
type Apply (TyFun a1627856105 Bool -> Type) (TyFun [a1627856105] [a1627856105] -> Type) (DropWhileSym0 a1627856105) l = DropWhileSym1 a1627856105 l

data DropWhileSym1 (l :: TyFun a1627856105 Bool -> Type) (l :: TyFun [a1627856105] [a1627856105]) #

Instances

SuppressUnusedWarnings ((TyFun a1627856105 Bool -> Type) -> TyFun [a1627856105] [a1627856105] -> *) (DropWhileSym1 a1627856105) #
Methods suppressUnusedWarnings :: Proxy (DropWhileSym1 a1627856105) t -> () #
type Apply [a] [a] (DropWhileSym1 a l1) l2 #
type Apply [a] [a] (DropWhileSym1 a l1) l2 = DropWhile a l1 l2

type DropWhileSym2 (t :: TyFun a1627856105 Bool -> Type) (t :: [a1627856105]) = DropWhile t t #

data DropWhileEndSym0 (l :: TyFun (TyFun a1627856104 Bool -> Type) (TyFun [a1627856104] [a1627856104] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856104 Bool -> Type) (TyFun [a1627856104] [a1627856104] -> Type) -> *) (DropWhileEndSym0 a1627856104) #
Methods suppressUnusedWarnings :: Proxy (DropWhileEndSym0 a1627856104) t -> () #
type Apply (TyFun a1627856104 Bool -> Type) (TyFun [a1627856104] [a1627856104] -> Type) (DropWhileEndSym0 a1627856104) l #
type Apply (TyFun a1627856104 Bool -> Type) (TyFun [a1627856104] [a1627856104] -> Type) (DropWhileEndSym0 a1627856104) l = DropWhileEndSym1 a1627856104 l

data DropWhileEndSym1 (l :: TyFun a1627856104 Bool -> Type) (l :: TyFun [a1627856104] [a1627856104]) #

Instances

SuppressUnusedWarnings ((TyFun a1627856104 Bool -> Type) -> TyFun [a1627856104] [a1627856104] -> *) (DropWhileEndSym1 a1627856104) #
Methods suppressUnusedWarnings :: Proxy (DropWhileEndSym1 a1627856104) t -> () #
type Apply [a] [a] (DropWhileEndSym1 a l1) l2 #
type Apply [a] [a] (DropWhileEndSym1 a l1) l2 = DropWhileEnd a l1 l2

type DropWhileEndSym2 (t :: TyFun a1627856104 Bool -> Type) (t :: [a1627856104]) = DropWhileEnd t t #

data SpanSym0 (l :: TyFun (TyFun a1627856103 Bool -> Type) (TyFun [a1627856103] ([a1627856103], [a1627856103]) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856103 Bool -> Type) (TyFun [a1627856103] ([a1627856103], [a1627856103]) -> Type) -> *) (SpanSym0 a1627856103) #
Methods suppressUnusedWarnings :: Proxy (SpanSym0 a1627856103) t -> () #
type Apply (TyFun a1627856103 Bool -> Type) (TyFun [a1627856103] ([a1627856103], [a1627856103]) -> Type) (SpanSym0 a1627856103) l #
type Apply (TyFun a1627856103 Bool -> Type) (TyFun [a1627856103] ([a1627856103], [a1627856103]) -> Type) (SpanSym0 a1627856103) l = SpanSym1 a1627856103 l

data SpanSym1 (l :: TyFun a1627856103 Bool -> Type) (l :: TyFun [a1627856103] ([a1627856103], [a1627856103])) #

Instances

SuppressUnusedWarnings ((TyFun a1627856103 Bool -> Type) -> TyFun [a1627856103] ([a1627856103], [a1627856103]) -> *) (SpanSym1 a1627856103) #
Methods suppressUnusedWarnings :: Proxy (SpanSym1 a1627856103) t -> () #
type Apply [a] ([a], [a]) (SpanSym1 a l1) l2 #
type Apply [a] ([a], [a]) (SpanSym1 a l1) l2 = Span a l1 l2

type SpanSym2 (t :: TyFun a1627856103 Bool -> Type) (t :: [a1627856103]) = Span t t #

data BreakSym0 (l :: TyFun (TyFun a1627856102 Bool -> Type) (TyFun [a1627856102] ([a1627856102], [a1627856102]) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856102 Bool -> Type) (TyFun [a1627856102] ([a1627856102], [a1627856102]) -> Type) -> *) (BreakSym0 a1627856102) #
Methods suppressUnusedWarnings :: Proxy (BreakSym0 a1627856102) t -> () #
type Apply (TyFun a1627856102 Bool -> Type) (TyFun [a1627856102] ([a1627856102], [a1627856102]) -> Type) (BreakSym0 a1627856102) l #
type Apply (TyFun a1627856102 Bool -> Type) (TyFun [a1627856102] ([a1627856102], [a1627856102]) -> Type) (BreakSym0 a1627856102) l = BreakSym1 a1627856102 l

data BreakSym1 (l :: TyFun a1627856102 Bool -> Type) (l :: TyFun [a1627856102] ([a1627856102], [a1627856102])) #

Instances

SuppressUnusedWarnings ((TyFun a1627856102 Bool -> Type) -> TyFun [a1627856102] ([a1627856102], [a1627856102]) -> *) (BreakSym1 a1627856102) #
Methods suppressUnusedWarnings :: Proxy (BreakSym1 a1627856102) t -> () #
type Apply [a] ([a], [a]) (BreakSym1 a l1) l2 #
type Apply [a] ([a], [a]) (BreakSym1 a l1) l2 = Break a l1 l2

type BreakSym2 (t :: TyFun a1627856102 Bool -> Type) (t :: [a1627856102]) = Break t t #

data GroupSym0 (l :: TyFun [a1627856098] [[a1627856098]]) #

Instances

SuppressUnusedWarnings (TyFun [a1627856098] [[a1627856098]] -> *) (GroupSym0 a1627856098) #
Methods suppressUnusedWarnings :: Proxy (GroupSym0 a1627856098) t -> () #
type Apply [a] [[a]] (GroupSym0 a) l #
type Apply [a] [[a]] (GroupSym0 a) l = Group a l

type GroupSym1 (t :: [a1627856098]) = Group t #

data InitsSym0 (l :: TyFun [a1627856168] [[a1627856168]]) #

Instances

SuppressUnusedWarnings (TyFun [a1627856168] [[a1627856168]] -> *) (InitsSym0 a1627856168) #
Methods suppressUnusedWarnings :: Proxy (InitsSym0 a1627856168) t -> () #
type Apply [a] [[a]] (InitsSym0 a) l #
type Apply [a] [[a]] (InitsSym0 a) l = Inits a l

type InitsSym1 (t :: [a1627856168]) = Inits t #

data TailsSym0 (l :: TyFun [a1627856167] [[a1627856167]]) #

Instances

SuppressUnusedWarnings (TyFun [a1627856167] [[a1627856167]] -> *) (TailsSym0 a1627856167) #
Methods suppressUnusedWarnings :: Proxy (TailsSym0 a1627856167) t -> () #
type Apply [a] [[a]] (TailsSym0 a) l #
type Apply [a] [[a]] (TailsSym0 a) l = Tails a l

type TailsSym1 (t :: [a1627856167]) = Tails t #

data IsPrefixOfSym0 (l :: TyFun [a1627856166] (TyFun [a1627856166] Bool -> Type)) #

Instances

SuppressUnusedWarnings (TyFun [a1627856166] (TyFun [a1627856166] Bool -> Type) -> *) (IsPrefixOfSym0 a1627856166) #
Methods suppressUnusedWarnings :: Proxy (IsPrefixOfSym0 a1627856166) t -> () #
type Apply [a1627856166] (TyFun [a1627856166] Bool -> Type) (IsPrefixOfSym0 a1627856166) l #
type Apply [a1627856166] (TyFun [a1627856166] Bool -> Type) (IsPrefixOfSym0 a1627856166) l = IsPrefixOfSym1 a1627856166 l

data IsPrefixOfSym1 (l :: [a1627856166]) (l :: TyFun [a1627856166] Bool) #

Instances

SuppressUnusedWarnings ([a1627856166] -> TyFun [a1627856166] Bool -> *) (IsPrefixOfSym1 a1627856166) #
Methods suppressUnusedWarnings :: Proxy (IsPrefixOfSym1 a1627856166) t -> () #
type Apply [a] Bool (IsPrefixOfSym1 a l1) l2 #
type Apply [a] Bool (IsPrefixOfSym1 a l1) l2 = IsPrefixOf a l1 l2

type IsPrefixOfSym2 (t :: [a1627856166]) (t :: [a1627856166]) = IsPrefixOf t t #

data IsSuffixOfSym0 (l :: TyFun [a1627856165] (TyFun [a1627856165] Bool -> Type)) #

Instances

SuppressUnusedWarnings (TyFun [a1627856165] (TyFun [a1627856165] Bool -> Type) -> *) (IsSuffixOfSym0 a1627856165) #
Methods suppressUnusedWarnings :: Proxy (IsSuffixOfSym0 a1627856165) t -> () #
type Apply [a1627856165] (TyFun [a1627856165] Bool -> Type) (IsSuffixOfSym0 a1627856165) l #
type Apply [a1627856165] (TyFun [a1627856165] Bool -> Type) (IsSuffixOfSym0 a1627856165) l = IsSuffixOfSym1 a1627856165 l

data IsSuffixOfSym1 (l :: [a1627856165]) (l :: TyFun [a1627856165] Bool) #

Instances

SuppressUnusedWarnings ([a1627856165] -> TyFun [a1627856165] Bool -> *) (IsSuffixOfSym1 a1627856165) #
Methods suppressUnusedWarnings :: Proxy (IsSuffixOfSym1 a1627856165) t -> () #
type Apply [a] Bool (IsSuffixOfSym1 a l1) l2 #
type Apply [a] Bool (IsSuffixOfSym1 a l1) l2 = IsSuffixOf a l1 l2

type IsSuffixOfSym2 (t :: [a1627856165]) (t :: [a1627856165]) = IsSuffixOf t t #

data IsInfixOfSym0 (l :: TyFun [a1627856164] (TyFun [a1627856164] Bool -> Type)) #

Instances

SuppressUnusedWarnings (TyFun [a1627856164] (TyFun [a1627856164] Bool -> Type) -> *) (IsInfixOfSym0 a1627856164) #
Methods suppressUnusedWarnings :: Proxy (IsInfixOfSym0 a1627856164) t -> () #
type Apply [a1627856164] (TyFun [a1627856164] Bool -> Type) (IsInfixOfSym0 a1627856164) l #
type Apply [a1627856164] (TyFun [a1627856164] Bool -> Type) (IsInfixOfSym0 a1627856164) l = IsInfixOfSym1 a1627856164 l

data IsInfixOfSym1 (l :: [a1627856164]) (l :: TyFun [a1627856164] Bool) #

Instances

SuppressUnusedWarnings ([a1627856164] -> TyFun [a1627856164] Bool -> *) (IsInfixOfSym1 a1627856164) #
Methods suppressUnusedWarnings :: Proxy (IsInfixOfSym1 a1627856164) t -> () #
type Apply [a] Bool (IsInfixOfSym1 a l1) l2 #
type Apply [a] Bool (IsInfixOfSym1 a l1) l2 = IsInfixOf a l1 l2

type IsInfixOfSym2 (t :: [a1627856164]) (t :: [a1627856164]) = IsInfixOf t t #

data ElemSym0 (l :: TyFun a1627856163 (TyFun [a1627856163] Bool -> Type)) #

Instances

SuppressUnusedWarnings (TyFun a1627856163 (TyFun [a1627856163] Bool -> Type) -> *) (ElemSym0 a1627856163) #
Methods suppressUnusedWarnings :: Proxy (ElemSym0 a1627856163) t -> () #
type Apply a1627856163 (TyFun [a1627856163] Bool -> Type) (ElemSym0 a1627856163) l #
type Apply a1627856163 (TyFun [a1627856163] Bool -> Type) (ElemSym0 a1627856163) l = ElemSym1 a1627856163 l

data ElemSym1 (l :: a1627856163) (l :: TyFun [a1627856163] Bool) #

Instances

SuppressUnusedWarnings (a1627856163 -> TyFun [a1627856163] Bool -> *) (ElemSym1 a1627856163) #
Methods suppressUnusedWarnings :: Proxy (ElemSym1 a1627856163) t -> () #
type Apply [a] Bool (ElemSym1 a l1) l2 #
type Apply [a] Bool (ElemSym1 a l1) l2 = Elem a l1 l2

type ElemSym2 (t :: a1627856163) (t :: [a1627856163]) = Elem t t #

data NotElemSym0 (l :: TyFun a1627856162 (TyFun [a1627856162] Bool -> Type)) #

Instances

SuppressUnusedWarnings (TyFun a1627856162 (TyFun [a1627856162] Bool -> Type) -> *) (NotElemSym0 a1627856162) #
Methods suppressUnusedWarnings :: Proxy (NotElemSym0 a1627856162) t -> () #
type Apply a1627856162 (TyFun [a1627856162] Bool -> Type) (NotElemSym0 a1627856162) l #
type Apply a1627856162 (TyFun [a1627856162] Bool -> Type) (NotElemSym0 a1627856162) l = NotElemSym1 a1627856162 l

data NotElemSym1 (l :: a1627856162) (l :: TyFun [a1627856162] Bool) #

Instances

SuppressUnusedWarnings (a1627856162 -> TyFun [a1627856162] Bool -> *) (NotElemSym1 a1627856162) #
Methods suppressUnusedWarnings :: Proxy (NotElemSym1 a1627856162) t -> () #
type Apply [a] Bool (NotElemSym1 a l1) l2 #
type Apply [a] Bool (NotElemSym1 a l1) l2 = NotElem a l1 l2

type NotElemSym2 (t :: a1627856162) (t :: [a1627856162]) = NotElem t t #

data LookupSym0 (l :: TyFun a1627856091 (TyFun [(a1627856091, b1627856092)] (Maybe b1627856092) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun a1627856091 (TyFun [(a1627856091, b1627856092)] (Maybe b1627856092) -> Type) -> *) (LookupSym0 a1627856091 b1627856092) #
Methods suppressUnusedWarnings :: Proxy (LookupSym0 a1627856091 b1627856092) t -> () #
type Apply a1627856091 (TyFun [(a1627856091, b1627856092)] (Maybe b1627856092) -> Type) (LookupSym0 a1627856091 b1627856092) l #
type Apply a1627856091 (TyFun [(a1627856091, b1627856092)] (Maybe b1627856092) -> Type) (LookupSym0 a1627856091 b1627856092) l = LookupSym1 a1627856091 b1627856092 l

data LookupSym1 (l :: a1627856091) (l :: TyFun [(a1627856091, b1627856092)] (Maybe b1627856092)) #

Instances

SuppressUnusedWarnings (a1627856091 -> TyFun [(a1627856091, b1627856092)] (Maybe b1627856092) -> *) (LookupSym1 a1627856091 b1627856092) #
Methods suppressUnusedWarnings :: Proxy (LookupSym1 a1627856091 b1627856092) t -> () #
type Apply [(a, b)] (Maybe b) (LookupSym1 a b l1) l2 #
type Apply [(a, b)] (Maybe b) (LookupSym1 a b l1) l2 = Lookup a b l1 l2

type LookupSym2 (t :: a1627856091) (t :: [(a1627856091, b1627856092)]) = Lookup t t #

data FindSym0 (l :: TyFun (TyFun a1627856113 Bool -> Type) (TyFun [a1627856113] (Maybe a1627856113) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856113 Bool -> Type) (TyFun [a1627856113] (Maybe a1627856113) -> Type) -> *) (FindSym0 a1627856113) #
Methods suppressUnusedWarnings :: Proxy (FindSym0 a1627856113) t -> () #
type Apply (TyFun a1627856113 Bool -> Type) (TyFun [a1627856113] (Maybe a1627856113) -> Type) (FindSym0 a1627856113) l #
type Apply (TyFun a1627856113 Bool -> Type) (TyFun [a1627856113] (Maybe a1627856113) -> Type) (FindSym0 a1627856113) l = FindSym1 a1627856113 l

data FindSym1 (l :: TyFun a1627856113 Bool -> Type) (l :: TyFun [a1627856113] (Maybe a1627856113)) #

Instances

SuppressUnusedWarnings ((TyFun a1627856113 Bool -> Type) -> TyFun [a1627856113] (Maybe a1627856113) -> *) (FindSym1 a1627856113) #
Methods suppressUnusedWarnings :: Proxy (FindSym1 a1627856113) t -> () #
type Apply [a] (Maybe a) (FindSym1 a l1) l2 #
type Apply [a] (Maybe a) (FindSym1 a l1) l2 = Find a l1 l2

type FindSym2 (t :: TyFun a1627856113 Bool -> Type) (t :: [a1627856113]) = Find t t #

data FilterSym0 (l :: TyFun (TyFun a1627856114 Bool -> Type) (TyFun [a1627856114] [a1627856114] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856114 Bool -> Type) (TyFun [a1627856114] [a1627856114] -> Type) -> *) (FilterSym0 a1627856114) #
Methods suppressUnusedWarnings :: Proxy (FilterSym0 a1627856114) t -> () #
type Apply (TyFun a1627856114 Bool -> Type) (TyFun [a1627856114] [a1627856114] -> Type) (FilterSym0 a1627856114) l #
type Apply (TyFun a1627856114 Bool -> Type) (TyFun [a1627856114] [a1627856114] -> Type) (FilterSym0 a1627856114) l = FilterSym1 a1627856114 l

data FilterSym1 (l :: TyFun a1627856114 Bool -> Type) (l :: TyFun [a1627856114] [a1627856114]) #

Instances

SuppressUnusedWarnings ((TyFun a1627856114 Bool -> Type) -> TyFun [a1627856114] [a1627856114] -> *) (FilterSym1 a1627856114) #
Methods suppressUnusedWarnings :: Proxy (FilterSym1 a1627856114) t -> () #
type Apply [a] [a] (FilterSym1 a l1) l2 #
type Apply [a] [a] (FilterSym1 a l1) l2 = Filter a l1 l2

type FilterSym2 (t :: TyFun a1627856114 Bool -> Type) (t :: [a1627856114]) = Filter t t #

data PartitionSym0 (l :: TyFun (TyFun a1627856090 Bool -> Type) (TyFun [a1627856090] ([a1627856090], [a1627856090]) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856090 Bool -> Type) (TyFun [a1627856090] ([a1627856090], [a1627856090]) -> Type) -> *) (PartitionSym0 a1627856090) #
Methods suppressUnusedWarnings :: Proxy (PartitionSym0 a1627856090) t -> () #
type Apply (TyFun a1627856090 Bool -> Type) (TyFun [a1627856090] ([a1627856090], [a1627856090]) -> Type) (PartitionSym0 a1627856090) l #
type Apply (TyFun a1627856090 Bool -> Type) (TyFun [a1627856090] ([a1627856090], [a1627856090]) -> Type) (PartitionSym0 a1627856090) l = PartitionSym1 a1627856090 l

data PartitionSym1 (l :: TyFun a1627856090 Bool -> Type) (l :: TyFun [a1627856090] ([a1627856090], [a1627856090])) #

Instances

SuppressUnusedWarnings ((TyFun a1627856090 Bool -> Type) -> TyFun [a1627856090] ([a1627856090], [a1627856090]) -> *) (PartitionSym1 a1627856090) #
Methods suppressUnusedWarnings :: Proxy (PartitionSym1 a1627856090) t -> () #
type Apply [a] ([a], [a]) (PartitionSym1 a l1) l2 #
type Apply [a] ([a], [a]) (PartitionSym1 a l1) l2 = Partition a l1 l2

type PartitionSym2 (t :: TyFun a1627856090 Bool -> Type) (t :: [a1627856090]) = Partition t t #

data (:!!$) (l :: TyFun [a1627856083] (TyFun Nat a1627856083 -> Type)) #

Instances

SuppressUnusedWarnings (TyFun [a1627856083] (TyFun Nat a1627856083 -> Type) -> *) ((:!!$) a1627856083) #
Methods suppressUnusedWarnings :: Proxy ((:!!$) a1627856083) t -> () #
type Apply [a1627856083] (TyFun Nat a1627856083 -> Type) ((:!!$) a1627856083) l #
type Apply [a1627856083] (TyFun Nat a1627856083 -> Type) ((:!!$) a1627856083) l = (:!!$$) a1627856083 l

data (l :: [a1627856083]) :!!$$ (l :: TyFun Nat a1627856083) #

Instances

SuppressUnusedWarnings ([a1627856083] -> TyFun Nat a1627856083 -> *) ((:!!$$) a1627856083) #
Methods suppressUnusedWarnings :: Proxy ((:!!$$) a1627856083) t -> () #
type Apply Nat a ((:!!$$) a l1) l2 #
type Apply Nat a ((:!!$$) a l1) l2 = (:!!) a l1 l2

type (:!!$$$) (t :: [a1627856083]) (t :: Nat) = (:!!) t t #

data ElemIndexSym0 (l :: TyFun a1627856112 (TyFun [a1627856112] (Maybe Nat) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun a1627856112 (TyFun [a1627856112] (Maybe Nat) -> Type) -> *) (ElemIndexSym0 a1627856112) #
Methods suppressUnusedWarnings :: Proxy (ElemIndexSym0 a1627856112) t -> () #
type Apply a1627856112 (TyFun [a1627856112] (Maybe Nat) -> Type) (ElemIndexSym0 a1627856112) l #
type Apply a1627856112 (TyFun [a1627856112] (Maybe Nat) -> Type) (ElemIndexSym0 a1627856112) l = ElemIndexSym1 a1627856112 l

data ElemIndexSym1 (l :: a1627856112) (l :: TyFun [a1627856112] (Maybe Nat)) #

Instances

SuppressUnusedWarnings (a1627856112 -> TyFun [a1627856112] (Maybe Nat) -> *) (ElemIndexSym1 a1627856112) #
Methods suppressUnusedWarnings :: Proxy (ElemIndexSym1 a1627856112) t -> () #
type Apply [a] (Maybe Nat) (ElemIndexSym1 a l1) l2 #
type Apply [a] (Maybe Nat) (ElemIndexSym1 a l1) l2 = ElemIndex a l1 l2

type ElemIndexSym2 (t :: a1627856112) (t :: [a1627856112]) = ElemIndex t t #

data ElemIndicesSym0 (l :: TyFun a1627856111 (TyFun [a1627856111] [Nat] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun a1627856111 (TyFun [a1627856111] [Nat] -> Type) -> *) (ElemIndicesSym0 a1627856111) #
Methods suppressUnusedWarnings :: Proxy (ElemIndicesSym0 a1627856111) t -> () #
type Apply a1627856111 (TyFun [a1627856111] [Nat] -> Type) (ElemIndicesSym0 a1627856111) l #
type Apply a1627856111 (TyFun [a1627856111] [Nat] -> Type) (ElemIndicesSym0 a1627856111) l = ElemIndicesSym1 a1627856111 l

data ElemIndicesSym1 (l :: a1627856111) (l :: TyFun [a1627856111] [Nat]) #

Instances

SuppressUnusedWarnings (a1627856111 -> TyFun [a1627856111] [Nat] -> *) (ElemIndicesSym1 a1627856111) #
Methods suppressUnusedWarnings :: Proxy (ElemIndicesSym1 a1627856111) t -> () #
type Apply [a] [Nat] (ElemIndicesSym1 a l1) l2 #
type Apply [a] [Nat] (ElemIndicesSym1 a l1) l2 = ElemIndices a l1 l2

type ElemIndicesSym2 (t :: a1627856111) (t :: [a1627856111]) = ElemIndices t t #

data FindIndexSym0 (l :: TyFun (TyFun a1627856110 Bool -> Type) (TyFun [a1627856110] (Maybe Nat) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856110 Bool -> Type) (TyFun [a1627856110] (Maybe Nat) -> Type) -> *) (FindIndexSym0 a1627856110) #
Methods suppressUnusedWarnings :: Proxy (FindIndexSym0 a1627856110) t -> () #
type Apply (TyFun a1627856110 Bool -> Type) (TyFun [a1627856110] (Maybe Nat) -> Type) (FindIndexSym0 a1627856110) l #
type Apply (TyFun a1627856110 Bool -> Type) (TyFun [a1627856110] (Maybe Nat) -> Type) (FindIndexSym0 a1627856110) l = FindIndexSym1 a1627856110 l

data FindIndexSym1 (l :: TyFun a1627856110 Bool -> Type) (l :: TyFun [a1627856110] (Maybe Nat)) #

Instances

SuppressUnusedWarnings ((TyFun a1627856110 Bool -> Type) -> TyFun [a1627856110] (Maybe Nat) -> *) (FindIndexSym1 a1627856110) #
Methods suppressUnusedWarnings :: Proxy (FindIndexSym1 a1627856110) t -> () #
type Apply [a] (Maybe Nat) (FindIndexSym1 a l1) l2 #
type Apply [a] (Maybe Nat) (FindIndexSym1 a l1) l2 = FindIndex a l1 l2

type FindIndexSym2 (t :: TyFun a1627856110 Bool -> Type) (t :: [a1627856110]) = FindIndex t t #

data FindIndicesSym0 (l :: TyFun (TyFun a1627856109 Bool -> Type) (TyFun [a1627856109] [Nat] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856109 Bool -> Type) (TyFun [a1627856109] [Nat] -> Type) -> *) (FindIndicesSym0 a1627856109) #
Methods suppressUnusedWarnings :: Proxy (FindIndicesSym0 a1627856109) t -> () #
type Apply (TyFun a1627856109 Bool -> Type) (TyFun [a1627856109] [Nat] -> Type) (FindIndicesSym0 a1627856109) l #
type Apply (TyFun a1627856109 Bool -> Type) (TyFun [a1627856109] [Nat] -> Type) (FindIndicesSym0 a1627856109) l = FindIndicesSym1 a1627856109 l

data FindIndicesSym1 (l :: TyFun a1627856109 Bool -> Type) (l :: TyFun [a1627856109] [Nat]) #

Instances

SuppressUnusedWarnings ((TyFun a1627856109 Bool -> Type) -> TyFun [a1627856109] [Nat] -> *) (FindIndicesSym1 a1627856109) #
Methods suppressUnusedWarnings :: Proxy (FindIndicesSym1 a1627856109) t -> () #
type Apply [a] [Nat] (FindIndicesSym1 a l1) l2 #
type Apply [a] [Nat] (FindIndicesSym1 a l1) l2 = FindIndices a l1 l2

type FindIndicesSym2 (t :: TyFun a1627856109 Bool -> Type) (t :: [a1627856109]) = FindIndices t t #

data ZipSym0 (l :: TyFun [a1627856160] (TyFun [b1627856161] [(a1627856160, b1627856161)] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun [a1627856160] (TyFun [b1627856161] [(a1627856160, b1627856161)] -> Type) -> *) (ZipSym0 a1627856160 b1627856161) #
Methods suppressUnusedWarnings :: Proxy (ZipSym0 a1627856160 b1627856161) t -> () #
type Apply [a1627856160] (TyFun [b1627856161] [(a1627856160, b1627856161)] -> Type) (ZipSym0 a1627856160 b1627856161) l #
type Apply [a1627856160] (TyFun [b1627856161] [(a1627856160, b1627856161)] -> Type) (ZipSym0 a1627856160 b1627856161) l = ZipSym1 a1627856160 b1627856161 l

data ZipSym1 (l :: [a1627856160]) (l :: TyFun [b1627856161] [(a1627856160, b1627856161)]) #

Instances

SuppressUnusedWarnings ([a1627856160] -> TyFun [b1627856161] [(a1627856160, b1627856161)] -> *) (ZipSym1 a1627856160 b1627856161) #
Methods suppressUnusedWarnings :: Proxy (ZipSym1 a1627856160 b1627856161) t -> () #
type Apply [b] [(a, b)] (ZipSym1 a b l1) l2 #
type Apply [b] [(a, b)] (ZipSym1 a b l1) l2 = Zip a b l1 l2

type ZipSym2 (t :: [a1627856160]) (t :: [b1627856161]) = Zip t t #

data Zip3Sym0 (l :: TyFun [a1627856157] (TyFun [b1627856158] (TyFun [c1627856159] [(a1627856157, b1627856158, c1627856159)] -> Type) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun [a1627856157] (TyFun [b1627856158] (TyFun [c1627856159] [(a1627856157, b1627856158, c1627856159)] -> Type) -> Type) -> *) (Zip3Sym0 a1627856157 b1627856158 c1627856159) #
Methods suppressUnusedWarnings :: Proxy (Zip3Sym0 a1627856157 b1627856158 c1627856159) t -> () #
type Apply [a1627856157] (TyFun [b1627856158] (TyFun [c1627856159] [(a1627856157, b1627856158, c1627856159)] -> Type) -> Type) (Zip3Sym0 a1627856157 b1627856158 c1627856159) l #
type Apply [a1627856157] (TyFun [b1627856158] (TyFun [c1627856159] [(a1627856157, b1627856158, c1627856159)] -> Type) -> Type) (Zip3Sym0 a1627856157 b1627856158 c1627856159) l = Zip3Sym1 a1627856157 b1627856158 c1627856159 l

data Zip3Sym1 (l :: [a1627856157]) (l :: TyFun [b1627856158] (TyFun [c1627856159] [(a1627856157, b1627856158, c1627856159)] -> Type)) #

Instances

SuppressUnusedWarnings ([a1627856157] -> TyFun [b1627856158] (TyFun [c1627856159] [(a1627856157, b1627856158, c1627856159)] -> Type) -> *) (Zip3Sym1 a1627856157 b1627856158 c1627856159) #
Methods suppressUnusedWarnings :: Proxy (Zip3Sym1 a1627856157 b1627856158 c1627856159) t -> () #
type Apply [b1627856158] (TyFun [c1627856159] [(a1627856157, b1627856158, c1627856159)] -> Type) (Zip3Sym1 a1627856157 b1627856158 c1627856159 l1) l2 #
type Apply [b1627856158] (TyFun [c1627856159] [(a1627856157, b1627856158, c1627856159)] -> Type) (Zip3Sym1 a1627856157 b1627856158 c1627856159 l1) l2 = Zip3Sym2 a1627856157 b1627856158 c1627856159 l1 l2

data Zip3Sym2 (l :: [a1627856157]) (l :: [b1627856158]) (l :: TyFun [c1627856159] [(a1627856157, b1627856158, c1627856159)]) #

Instances

SuppressUnusedWarnings ([a1627856157] -> [b1627856158] -> TyFun [c1627856159] [(a1627856157, b1627856158, c1627856159)] -> *) (Zip3Sym2 a1627856157 b1627856158 c1627856159) #
Methods suppressUnusedWarnings :: Proxy (Zip3Sym2 a1627856157 b1627856158 c1627856159) t -> () #
type Apply [c] [(a, b, c)] (Zip3Sym2 a b c l1 l2) l3 #
type Apply [c] [(a, b, c)] (Zip3Sym2 a b c l1 l2) l3 = Zip3 a b c l1 l2 l3

type Zip3Sym3 (t :: [a1627856157]) (t :: [b1627856158]) (t :: [c1627856159]) = Zip3 t t t #

data ZipWithSym0 (l :: TyFun (TyFun a1627856154 (TyFun b1627856155 c1627856156 -> Type) -> Type) (TyFun [a1627856154] (TyFun [b1627856155] [c1627856156] -> Type) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856154 (TyFun b1627856155 c1627856156 -> Type) -> Type) (TyFun [a1627856154] (TyFun [b1627856155] [c1627856156] -> Type) -> Type) -> *) (ZipWithSym0 a1627856154 b1627856155 c1627856156) #
Methods suppressUnusedWarnings :: Proxy (ZipWithSym0 a1627856154 b1627856155 c1627856156) t -> () #
type Apply (TyFun a1627856154 (TyFun b1627856155 c1627856156 -> Type) -> Type) (TyFun [a1627856154] (TyFun [b1627856155] [c1627856156] -> Type) -> Type) (ZipWithSym0 a1627856154 b1627856155 c1627856156) l #
type Apply (TyFun a1627856154 (TyFun b1627856155 c1627856156 -> Type) -> Type) (TyFun [a1627856154] (TyFun [b1627856155] [c1627856156] -> Type) -> Type) (ZipWithSym0 a1627856154 b1627856155 c1627856156) l = ZipWithSym1 a1627856154 b1627856155 c1627856156 l

data ZipWithSym1 (l :: TyFun a1627856154 (TyFun b1627856155 c1627856156 -> Type) -> Type) (l :: TyFun [a1627856154] (TyFun [b1627856155] [c1627856156] -> Type)) #

Instances

SuppressUnusedWarnings ((TyFun a1627856154 (TyFun b1627856155 c1627856156 -> Type) -> Type) -> TyFun [a1627856154] (TyFun [b1627856155] [c1627856156] -> Type) -> *) (ZipWithSym1 a1627856154 b1627856155 c1627856156) #
Methods suppressUnusedWarnings :: Proxy (ZipWithSym1 a1627856154 b1627856155 c1627856156) t -> () #
type Apply [a1627856154] (TyFun [b1627856155] [c1627856156] -> Type) (ZipWithSym1 a1627856154 b1627856155 c1627856156 l1) l2 #
type Apply [a1627856154] (TyFun [b1627856155] [c1627856156] -> Type) (ZipWithSym1 a1627856154 b1627856155 c1627856156 l1) l2 = ZipWithSym2 a1627856154 b1627856155 c1627856156 l1 l2

data ZipWithSym2 (l :: TyFun a1627856154 (TyFun b1627856155 c1627856156 -> Type) -> Type) (l :: [a1627856154]) (l :: TyFun [b1627856155] [c1627856156]) #

Instances

SuppressUnusedWarnings ((TyFun a1627856154 (TyFun b1627856155 c1627856156 -> Type) -> Type) -> [a1627856154] -> TyFun [b1627856155] [c1627856156] -> *) (ZipWithSym2 a1627856154 b1627856155 c1627856156) #
Methods suppressUnusedWarnings :: Proxy (ZipWithSym2 a1627856154 b1627856155 c1627856156) t -> () #
type Apply [b] [c] (ZipWithSym2 a b c l1 l2) l3 #
type Apply [b] [c] (ZipWithSym2 a b c l1 l2) l3 = ZipWith a b c l1 l2 l3

type ZipWithSym3 (t :: TyFun a1627856154 (TyFun b1627856155 c1627856156 -> Type) -> Type) (t :: [a1627856154]) (t :: [b1627856155]) = ZipWith t t t #

data ZipWith3Sym0 (l :: TyFun (TyFun a1627856150 (TyFun b1627856151 (TyFun c1627856152 d1627856153 -> Type) -> Type) -> Type) (TyFun [a1627856150] (TyFun [b1627856151] (TyFun [c1627856152] [d1627856153] -> Type) -> Type) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856150 (TyFun b1627856151 (TyFun c1627856152 d1627856153 -> Type) -> Type) -> Type) (TyFun [a1627856150] (TyFun [b1627856151] (TyFun [c1627856152] [d1627856153] -> Type) -> Type) -> Type) -> *) (ZipWith3Sym0 a1627856150 b1627856151 c1627856152 d1627856153) #
Methods suppressUnusedWarnings :: Proxy (ZipWith3Sym0 a1627856150 b1627856151 c1627856152 d1627856153) t -> () #
type Apply (TyFun a1627856150 (TyFun b1627856151 (TyFun c1627856152 d1627856153 -> Type) -> Type) -> Type) (TyFun [a1627856150] (TyFun [b1627856151] (TyFun [c1627856152] [d1627856153] -> Type) -> Type) -> Type) (ZipWith3Sym0 a1627856150 b1627856151 c1627856152 d1627856153) l #
type Apply (TyFun a1627856150 (TyFun b1627856151 (TyFun c1627856152 d1627856153 -> Type) -> Type) -> Type) (TyFun [a1627856150] (TyFun [b1627856151] (TyFun [c1627856152] [d1627856153] -> Type) -> Type) -> Type) (ZipWith3Sym0 a1627856150 b1627856151 c1627856152 d1627856153) l = ZipWith3Sym1 a1627856150 b1627856151 c1627856152 d1627856153 l

data ZipWith3Sym1 (l :: TyFun a1627856150 (TyFun b1627856151 (TyFun c1627856152 d1627856153 -> Type) -> Type) -> Type) (l :: TyFun [a1627856150] (TyFun [b1627856151] (TyFun [c1627856152] [d1627856153] -> Type) -> Type)) #

Instances

SuppressUnusedWarnings ((TyFun a1627856150 (TyFun b1627856151 (TyFun c1627856152 d1627856153 -> Type) -> Type) -> Type) -> TyFun [a1627856150] (TyFun [b1627856151] (TyFun [c1627856152] [d1627856153] -> Type) -> Type) -> *) (ZipWith3Sym1 a1627856150 b1627856151 c1627856152 d1627856153) #
Methods suppressUnusedWarnings :: Proxy (ZipWith3Sym1 a1627856150 b1627856151 c1627856152 d1627856153) t -> () #
type Apply [a1627856150] (TyFun [b1627856151] (TyFun [c1627856152] [d1627856153] -> Type) -> Type) (ZipWith3Sym1 a1627856150 b1627856151 c1627856152 d1627856153 l1) l2 #
type Apply [a1627856150] (TyFun [b1627856151] (TyFun [c1627856152] [d1627856153] -> Type) -> Type) (ZipWith3Sym1 a1627856150 b1627856151 c1627856152 d1627856153 l1) l2 = ZipWith3Sym2 a1627856150 b1627856151 c1627856152 d1627856153 l1 l2

data ZipWith3Sym2 (l :: TyFun a1627856150 (TyFun b1627856151 (TyFun c1627856152 d1627856153 -> Type) -> Type) -> Type) (l :: [a1627856150]) (l :: TyFun [b1627856151] (TyFun [c1627856152] [d1627856153] -> Type)) #

Instances

SuppressUnusedWarnings ((TyFun a1627856150 (TyFun b1627856151 (TyFun c1627856152 d1627856153 -> Type) -> Type) -> Type) -> [a1627856150] -> TyFun [b1627856151] (TyFun [c1627856152] [d1627856153] -> Type) -> *) (ZipWith3Sym2 a1627856150 b1627856151 c1627856152 d1627856153) #
Methods suppressUnusedWarnings :: Proxy (ZipWith3Sym2 a1627856150 b1627856151 c1627856152 d1627856153) t -> () #
type Apply [b1627856151] (TyFun [c1627856152] [d1627856153] -> Type) (ZipWith3Sym2 a1627856150 b1627856151 c1627856152 d1627856153 l1 l2) l3 #
type Apply [b1627856151] (TyFun [c1627856152] [d1627856153] -> Type) (ZipWith3Sym2 a1627856150 b1627856151 c1627856152 d1627856153 l1 l2) l3 = ZipWith3Sym3 a1627856150 b1627856151 c1627856152 d1627856153 l1 l2 l3

data ZipWith3Sym3 (l :: TyFun a1627856150 (TyFun b1627856151 (TyFun c1627856152 d1627856153 -> Type) -> Type) -> Type) (l :: [a1627856150]) (l :: [b1627856151]) (l :: TyFun [c1627856152] [d1627856153]) #

Instances

SuppressUnusedWarnings ((TyFun a1627856150 (TyFun b1627856151 (TyFun c1627856152 d1627856153 -> Type) -> Type) -> Type) -> [a1627856150] -> [b1627856151] -> TyFun [c1627856152] [d1627856153] -> *) (ZipWith3Sym3 a1627856150 b1627856151 c1627856152 d1627856153) #
Methods suppressUnusedWarnings :: Proxy (ZipWith3Sym3 a1627856150 b1627856151 c1627856152 d1627856153) t -> () #
type Apply [c] [d] (ZipWith3Sym3 a b c d l1 l2 l3) l4 #
type Apply [c] [d] (ZipWith3Sym3 a b c d l1 l2 l3) l4 = ZipWith3 a b c d l1 l2 l3 l4

type ZipWith3Sym4 (t :: TyFun a1627856150 (TyFun b1627856151 (TyFun c1627856152 d1627856153 -> Type) -> Type) -> Type) (t :: [a1627856150]) (t :: [b1627856151]) (t :: [c1627856152]) = ZipWith3 t t t t #

data UnzipSym0 (l :: TyFun [(a1627856148, b1627856149)] ([a1627856148], [b1627856149])) #

Instances

SuppressUnusedWarnings (TyFun [(a1627856148, b1627856149)] ([a1627856148], [b1627856149]) -> *) (UnzipSym0 a1627856148 b1627856149) #
Methods suppressUnusedWarnings :: Proxy (UnzipSym0 a1627856148 b1627856149) t -> () #
type Apply [(a, b)] ([a], [b]) (UnzipSym0 a b) l #
type Apply [(a, b)] ([a], [b]) (UnzipSym0 a b) l = Unzip a b l

type UnzipSym1 (t :: [(a1627856148, b1627856149)]) = Unzip t #

data Unzip3Sym0 (l :: TyFun [(a1627856145, b1627856146, c1627856147)] ([a1627856145], [b1627856146], [c1627856147])) #

Instances

SuppressUnusedWarnings (TyFun [(a1627856145, b1627856146, c1627856147)] ([a1627856145], [b1627856146], [c1627856147]) -> *) (Unzip3Sym0 a1627856145 b1627856146 c1627856147) #
Methods suppressUnusedWarnings :: Proxy (Unzip3Sym0 a1627856145 b1627856146 c1627856147) t -> () #
type Apply [(a, b, c)] ([a], [b], [c]) (Unzip3Sym0 a b c) l #
type Apply [(a, b, c)] ([a], [b], [c]) (Unzip3Sym0 a b c) l = Unzip3 a b c l

type Unzip3Sym1 (t :: [(a1627856145, b1627856146, c1627856147)]) = Unzip3 t #

data Unzip4Sym0 (l :: TyFun [(a1627856141, b1627856142, c1627856143, d1627856144)] ([a1627856141], [b1627856142], [c1627856143], [d1627856144])) #

Instances

SuppressUnusedWarnings (TyFun [(a1627856141, b1627856142, c1627856143, d1627856144)] ([a1627856141], [b1627856142], [c1627856143], [d1627856144]) -> *) (Unzip4Sym0 a1627856141 b1627856142 c1627856143 d1627856144) #
Methods suppressUnusedWarnings :: Proxy (Unzip4Sym0 a1627856141 b1627856142 c1627856143 d1627856144) t -> () #
type Apply [(a, b, c, d)] ([a], [b], [c], [d]) (Unzip4Sym0 a b c d) l #
type Apply [(a, b, c, d)] ([a], [b], [c], [d]) (Unzip4Sym0 a b c d) l = Unzip4 a b c d l

type Unzip4Sym1 (t :: [(a1627856141, b1627856142, c1627856143, d1627856144)]) = Unzip4 t #

data Unzip5Sym0 (l :: TyFun [(a1627856136, b1627856137, c1627856138, d1627856139, e1627856140)] ([a1627856136], [b1627856137], [c1627856138], [d1627856139], [e1627856140])) #

Instances

SuppressUnusedWarnings (TyFun [(a1627856136, b1627856137, c1627856138, d1627856139, e1627856140)] ([a1627856136], [b1627856137], [c1627856138], [d1627856139], [e1627856140]) -> *) (Unzip5Sym0 a1627856136 b1627856137 c1627856138 d1627856139 e1627856140) #
Methods suppressUnusedWarnings :: Proxy (Unzip5Sym0 a1627856136 b1627856137 c1627856138 d1627856139 e1627856140) t -> () #
type Apply [(a, b, c, d, e)] ([a], [b], [c], [d], [e]) (Unzip5Sym0 a b c d e) l #
type Apply [(a, b, c, d, e)] ([a], [b], [c], [d], [e]) (Unzip5Sym0 a b c d e) l = Unzip5 a b c d e l

type Unzip5Sym1 (t :: [(a1627856136, b1627856137, c1627856138, d1627856139, e1627856140)]) = Unzip5 t #

data Unzip6Sym0 (l :: TyFun [(a1627856130, b1627856131, c1627856132, d1627856133, e1627856134, f1627856135)] ([a1627856130], [b1627856131], [c1627856132], [d1627856133], [e1627856134], [f1627856135])) #

Instances

SuppressUnusedWarnings (TyFun [(a1627856130, b1627856131, c1627856132, d1627856133, e1627856134, f1627856135)] ([a1627856130], [b1627856131], [c1627856132], [d1627856133], [e1627856134], [f1627856135]) -> *) (Unzip6Sym0 a1627856130 b1627856131 c1627856132 d1627856133 e1627856134 f1627856135) #
Methods suppressUnusedWarnings :: Proxy (Unzip6Sym0 a1627856130 b1627856131 c1627856132 d1627856133 e1627856134 f1627856135) t -> () #
type Apply [(a, b, c, d, e, f)] ([a], [b], [c], [d], [e], [f]) (Unzip6Sym0 a b c d e f) l #
type Apply [(a, b, c, d, e, f)] ([a], [b], [c], [d], [e], [f]) (Unzip6Sym0 a b c d e f) l = Unzip6 a b c d e f l

type Unzip6Sym1 (t :: [(a1627856130, b1627856131, c1627856132, d1627856133, e1627856134, f1627856135)]) = Unzip6 t #

data Unzip7Sym0 (l :: TyFun [(a1627856123, b1627856124, c1627856125, d1627856126, e1627856127, f1627856128, g1627856129)] ([a1627856123], [b1627856124], [c1627856125], [d1627856126], [e1627856127], [f1627856128], [g1627856129])) #

Instances

SuppressUnusedWarnings (TyFun [(a1627856123, b1627856124, c1627856125, d1627856126, e1627856127, f1627856128, g1627856129)] ([a1627856123], [b1627856124], [c1627856125], [d1627856126], [e1627856127], [f1627856128], [g1627856129]) -> *) (Unzip7Sym0 a1627856123 b1627856124 c1627856125 d1627856126 e1627856127 f1627856128 g1627856129) #
Methods suppressUnusedWarnings :: Proxy (Unzip7Sym0 a1627856123 b1627856124 c1627856125 d1627856126 e1627856127 f1627856128 g1627856129) t -> () #
type Apply [(a, b, c, d, e, f, g)] ([a], [b], [c], [d], [e], [f], [g]) (Unzip7Sym0 a b c d e f g) l #
type Apply [(a, b, c, d, e, f, g)] ([a], [b], [c], [d], [e], [f], [g]) (Unzip7Sym0 a b c d e f g) l = Unzip7 a b c d e f g l

type Unzip7Sym1 (t :: [(a1627856123, b1627856124, c1627856125, d1627856126, e1627856127, f1627856128, g1627856129)]) = Unzip7 t #

data NubSym0 (l :: TyFun [a1627856082] [a1627856082]) #

Instances

SuppressUnusedWarnings (TyFun [a1627856082] [a1627856082] -> *) (NubSym0 a1627856082) #
Methods suppressUnusedWarnings :: Proxy (NubSym0 a1627856082) t -> () #
type Apply [a] [a] (NubSym0 a) l #
type Apply [a] [a] (NubSym0 a) l = Nub a l

type NubSym1 (t :: [a1627856082]) = Nub t #

data DeleteSym0 (l :: TyFun a1627856122 (TyFun [a1627856122] [a1627856122] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun a1627856122 (TyFun [a1627856122] [a1627856122] -> Type) -> *) (DeleteSym0 a1627856122) #
Methods suppressUnusedWarnings :: Proxy (DeleteSym0 a1627856122) t -> () #
type Apply a1627856122 (TyFun [a1627856122] [a1627856122] -> Type) (DeleteSym0 a1627856122) l #
type Apply a1627856122 (TyFun [a1627856122] [a1627856122] -> Type) (DeleteSym0 a1627856122) l = DeleteSym1 a1627856122 l

data DeleteSym1 (l :: a1627856122) (l :: TyFun [a1627856122] [a1627856122]) #

Instances

SuppressUnusedWarnings (a1627856122 -> TyFun [a1627856122] [a1627856122] -> *) (DeleteSym1 a1627856122) #
Methods suppressUnusedWarnings :: Proxy (DeleteSym1 a1627856122) t -> () #
type Apply [a] [a] (DeleteSym1 a l1) l2 #
type Apply [a] [a] (DeleteSym1 a l1) l2 = Delete a l1 l2

type DeleteSym2 (t :: a1627856122) (t :: [a1627856122]) = Delete t t #

data (:\\$) (l :: TyFun [a1627856121] (TyFun [a1627856121] [a1627856121] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun [a1627856121] (TyFun [a1627856121] [a1627856121] -> Type) -> *) ((:\\$) a1627856121) #
Methods suppressUnusedWarnings :: Proxy ((:\\$) a1627856121) t -> () #
type Apply [a1627856121] (TyFun [a1627856121] [a1627856121] -> Type) ((:\\$) a1627856121) l #
type Apply [a1627856121] (TyFun [a1627856121] [a1627856121] -> Type) ((:\\$) a1627856121) l = (:\\$$) a1627856121 l

data (l :: [a1627856121]) :\\$$ (l :: TyFun [a1627856121] [a1627856121]) #

Instances

SuppressUnusedWarnings ([a1627856121] -> TyFun [a1627856121] [a1627856121] -> *) ((:\\$$) a1627856121) #
Methods suppressUnusedWarnings :: Proxy ((:\\$$) a1627856121) t -> () #
type Apply [a] [a] ((:\\$$) a l1) l2 #
type Apply [a] [a] ((:\\$$) a l1) l2 = (:\\) a l1 l2

type (:\\$$$) (t :: [a1627856121]) (t :: [a1627856121]) = (:\\) t t #

data UnionSym0 (l :: TyFun [a1627856078] (TyFun [a1627856078] [a1627856078] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun [a1627856078] (TyFun [a1627856078] [a1627856078] -> Type) -> *) (UnionSym0 a1627856078) #
Methods suppressUnusedWarnings :: Proxy (UnionSym0 a1627856078) t -> () #
type Apply [a1627856078] (TyFun [a1627856078] [a1627856078] -> Type) (UnionSym0 a1627856078) l #
type Apply [a1627856078] (TyFun [a1627856078] [a1627856078] -> Type) (UnionSym0 a1627856078) l = UnionSym1 a1627856078 l

data UnionSym1 (l :: [a1627856078]) (l :: TyFun [a1627856078] [a1627856078]) #

Instances

SuppressUnusedWarnings ([a1627856078] -> TyFun [a1627856078] [a1627856078] -> *) (UnionSym1 a1627856078) #
Methods suppressUnusedWarnings :: Proxy (UnionSym1 a1627856078) t -> () #
type Apply [a] [a] (UnionSym1 a l1) l2 #
type Apply [a] [a] (UnionSym1 a l1) l2 = Union a l1 l2

type UnionSym2 (t :: [a1627856078]) (t :: [a1627856078]) = Union t t #

data IntersectSym0 (l :: TyFun [a1627856108] (TyFun [a1627856108] [a1627856108] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun [a1627856108] (TyFun [a1627856108] [a1627856108] -> Type) -> *) (IntersectSym0 a1627856108) #
Methods suppressUnusedWarnings :: Proxy (IntersectSym0 a1627856108) t -> () #
type Apply [a1627856108] (TyFun [a1627856108] [a1627856108] -> Type) (IntersectSym0 a1627856108) l #
type Apply [a1627856108] (TyFun [a1627856108] [a1627856108] -> Type) (IntersectSym0 a1627856108) l = IntersectSym1 a1627856108 l

data IntersectSym1 (l :: [a1627856108]) (l :: TyFun [a1627856108] [a1627856108]) #

Instances

SuppressUnusedWarnings ([a1627856108] -> TyFun [a1627856108] [a1627856108] -> *) (IntersectSym1 a1627856108) #
Methods suppressUnusedWarnings :: Proxy (IntersectSym1 a1627856108) t -> () #
type Apply [a] [a] (IntersectSym1 a l1) l2 #
type Apply [a] [a] (IntersectSym1 a l1) l2 = Intersect a l1 l2

type IntersectSym2 (t :: [a1627856108]) (t :: [a1627856108]) = Intersect t t #

data InsertSym0 (l :: TyFun a1627856095 (TyFun [a1627856095] [a1627856095] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun a1627856095 (TyFun [a1627856095] [a1627856095] -> Type) -> *) (InsertSym0 a1627856095) #
Methods suppressUnusedWarnings :: Proxy (InsertSym0 a1627856095) t -> () #
type Apply a1627856095 (TyFun [a1627856095] [a1627856095] -> Type) (InsertSym0 a1627856095) l #
type Apply a1627856095 (TyFun [a1627856095] [a1627856095] -> Type) (InsertSym0 a1627856095) l = InsertSym1 a1627856095 l

data InsertSym1 (l :: a1627856095) (l :: TyFun [a1627856095] [a1627856095]) #

Instances

SuppressUnusedWarnings (a1627856095 -> TyFun [a1627856095] [a1627856095] -> *) (InsertSym1 a1627856095) #
Methods suppressUnusedWarnings :: Proxy (InsertSym1 a1627856095) t -> () #
type Apply [a] [a] (InsertSym1 a l1) l2 #
type Apply [a] [a] (InsertSym1 a l1) l2 = Insert a l1 l2

type InsertSym2 (t :: a1627856095) (t :: [a1627856095]) = Insert t t #

data SortSym0 (l :: TyFun [a1627856094] [a1627856094]) #

Instances

SuppressUnusedWarnings (TyFun [a1627856094] [a1627856094] -> *) (SortSym0 a1627856094) #
Methods suppressUnusedWarnings :: Proxy (SortSym0 a1627856094) t -> () #
type Apply [a] [a] (SortSym0 a) l #
type Apply [a] [a] (SortSym0 a) l = Sort a l

type SortSym1 (t :: [a1627856094]) = Sort t #

data NubBySym0 (l :: TyFun (TyFun a1627856081 (TyFun a1627856081 Bool -> Type) -> Type) (TyFun [a1627856081] [a1627856081] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856081 (TyFun a1627856081 Bool -> Type) -> Type) (TyFun [a1627856081] [a1627856081] -> Type) -> *) (NubBySym0 a1627856081) #
Methods suppressUnusedWarnings :: Proxy (NubBySym0 a1627856081) t -> () #
type Apply (TyFun a1627856081 (TyFun a1627856081 Bool -> Type) -> Type) (TyFun [a1627856081] [a1627856081] -> Type) (NubBySym0 a1627856081) l #
type Apply (TyFun a1627856081 (TyFun a1627856081 Bool -> Type) -> Type) (TyFun [a1627856081] [a1627856081] -> Type) (NubBySym0 a1627856081) l = NubBySym1 a1627856081 l

data NubBySym1 (l :: TyFun a1627856081 (TyFun a1627856081 Bool -> Type) -> Type) (l :: TyFun [a1627856081] [a1627856081]) #

Instances

SuppressUnusedWarnings ((TyFun a1627856081 (TyFun a1627856081 Bool -> Type) -> Type) -> TyFun [a1627856081] [a1627856081] -> *) (NubBySym1 a1627856081) #
Methods suppressUnusedWarnings :: Proxy (NubBySym1 a1627856081) t -> () #
type Apply [a] [a] (NubBySym1 a l1) l2 #
type Apply [a] [a] (NubBySym1 a l1) l2 = NubBy a l1 l2

type NubBySym2 (t :: TyFun a1627856081 (TyFun a1627856081 Bool -> Type) -> Type) (t :: [a1627856081]) = NubBy t t #

data DeleteBySym0 (l :: TyFun (TyFun a1627856120 (TyFun a1627856120 Bool -> Type) -> Type) (TyFun a1627856120 (TyFun [a1627856120] [a1627856120] -> Type) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856120 (TyFun a1627856120 Bool -> Type) -> Type) (TyFun a1627856120 (TyFun [a1627856120] [a1627856120] -> Type) -> Type) -> *) (DeleteBySym0 a1627856120) #
Methods suppressUnusedWarnings :: Proxy (DeleteBySym0 a1627856120) t -> () #
type Apply (TyFun a1627856120 (TyFun a1627856120 Bool -> Type) -> Type) (TyFun a1627856120 (TyFun [a1627856120] [a1627856120] -> Type) -> Type) (DeleteBySym0 a1627856120) l #
type Apply (TyFun a1627856120 (TyFun a1627856120 Bool -> Type) -> Type) (TyFun a1627856120 (TyFun [a1627856120] [a1627856120] -> Type) -> Type) (DeleteBySym0 a1627856120) l = DeleteBySym1 a1627856120 l

data DeleteBySym1 (l :: TyFun a1627856120 (TyFun a1627856120 Bool -> Type) -> Type) (l :: TyFun a1627856120 (TyFun [a1627856120] [a1627856120] -> Type)) #

Instances

SuppressUnusedWarnings ((TyFun a1627856120 (TyFun a1627856120 Bool -> Type) -> Type) -> TyFun a1627856120 (TyFun [a1627856120] [a1627856120] -> Type) -> *) (DeleteBySym1 a1627856120) #
Methods suppressUnusedWarnings :: Proxy (DeleteBySym1 a1627856120) t -> () #
type Apply a1627856120 (TyFun [a1627856120] [a1627856120] -> Type) (DeleteBySym1 a1627856120 l1) l2 #
type Apply a1627856120 (TyFun [a1627856120] [a1627856120] -> Type) (DeleteBySym1 a1627856120 l1) l2 = DeleteBySym2 a1627856120 l1 l2

data DeleteBySym2 (l :: TyFun a1627856120 (TyFun a1627856120 Bool -> Type) -> Type) (l :: a1627856120) (l :: TyFun [a1627856120] [a1627856120]) #

Instances

SuppressUnusedWarnings ((TyFun a1627856120 (TyFun a1627856120 Bool -> Type) -> Type) -> a1627856120 -> TyFun [a1627856120] [a1627856120] -> *) (DeleteBySym2 a1627856120) #
Methods suppressUnusedWarnings :: Proxy (DeleteBySym2 a1627856120) t -> () #
type Apply [a] [a] (DeleteBySym2 a l1 l2) l3 #
type Apply [a] [a] (DeleteBySym2 a l1 l2) l3 = DeleteBy a l1 l2 l3

type DeleteBySym3 (t :: TyFun a1627856120 (TyFun a1627856120 Bool -> Type) -> Type) (t :: a1627856120) (t :: [a1627856120]) = DeleteBy t t t #

data DeleteFirstsBySym0 (l :: TyFun (TyFun a1627856119 (TyFun a1627856119 Bool -> Type) -> Type) (TyFun [a1627856119] (TyFun [a1627856119] [a1627856119] -> Type) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856119 (TyFun a1627856119 Bool -> Type) -> Type) (TyFun [a1627856119] (TyFun [a1627856119] [a1627856119] -> Type) -> Type) -> *) (DeleteFirstsBySym0 a1627856119) #
Methods suppressUnusedWarnings :: Proxy (DeleteFirstsBySym0 a1627856119) t -> () #
type Apply (TyFun a1627856119 (TyFun a1627856119 Bool -> Type) -> Type) (TyFun [a1627856119] (TyFun [a1627856119] [a1627856119] -> Type) -> Type) (DeleteFirstsBySym0 a1627856119) l #
type Apply (TyFun a1627856119 (TyFun a1627856119 Bool -> Type) -> Type) (TyFun [a1627856119] (TyFun [a1627856119] [a1627856119] -> Type) -> Type) (DeleteFirstsBySym0 a1627856119) l = DeleteFirstsBySym1 a1627856119 l

data DeleteFirstsBySym1 (l :: TyFun a1627856119 (TyFun a1627856119 Bool -> Type) -> Type) (l :: TyFun [a1627856119] (TyFun [a1627856119] [a1627856119] -> Type)) #

Instances

SuppressUnusedWarnings ((TyFun a1627856119 (TyFun a1627856119 Bool -> Type) -> Type) -> TyFun [a1627856119] (TyFun [a1627856119] [a1627856119] -> Type) -> *) (DeleteFirstsBySym1 a1627856119) #
Methods suppressUnusedWarnings :: Proxy (DeleteFirstsBySym1 a1627856119) t -> () #
type Apply [a1627856119] (TyFun [a1627856119] [a1627856119] -> Type) (DeleteFirstsBySym1 a1627856119 l1) l2 #
type Apply [a1627856119] (TyFun [a1627856119] [a1627856119] -> Type) (DeleteFirstsBySym1 a1627856119 l1) l2 = DeleteFirstsBySym2 a1627856119 l1 l2

data DeleteFirstsBySym2 (l :: TyFun a1627856119 (TyFun a1627856119 Bool -> Type) -> Type) (l :: [a1627856119]) (l :: TyFun [a1627856119] [a1627856119]) #

Instances

SuppressUnusedWarnings ((TyFun a1627856119 (TyFun a1627856119 Bool -> Type) -> Type) -> [a1627856119] -> TyFun [a1627856119] [a1627856119] -> *) (DeleteFirstsBySym2 a1627856119) #
Methods suppressUnusedWarnings :: Proxy (DeleteFirstsBySym2 a1627856119) t -> () #
type Apply [a] [a] (DeleteFirstsBySym2 a l1 l2) l3 #
type Apply [a] [a] (DeleteFirstsBySym2 a l1 l2) l3 = DeleteFirstsBy a l1 l2 l3

type DeleteFirstsBySym3 (t :: TyFun a1627856119 (TyFun a1627856119 Bool -> Type) -> Type) (t :: [a1627856119]) (t :: [a1627856119]) = DeleteFirstsBy t t t #

data UnionBySym0 (l :: TyFun (TyFun a1627856079 (TyFun a1627856079 Bool -> Type) -> Type) (TyFun [a1627856079] (TyFun [a1627856079] [a1627856079] -> Type) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856079 (TyFun a1627856079 Bool -> Type) -> Type) (TyFun [a1627856079] (TyFun [a1627856079] [a1627856079] -> Type) -> Type) -> *) (UnionBySym0 a1627856079) #
Methods suppressUnusedWarnings :: Proxy (UnionBySym0 a1627856079) t -> () #
type Apply (TyFun a1627856079 (TyFun a1627856079 Bool -> Type) -> Type) (TyFun [a1627856079] (TyFun [a1627856079] [a1627856079] -> Type) -> Type) (UnionBySym0 a1627856079) l #
type Apply (TyFun a1627856079 (TyFun a1627856079 Bool -> Type) -> Type) (TyFun [a1627856079] (TyFun [a1627856079] [a1627856079] -> Type) -> Type) (UnionBySym0 a1627856079) l = UnionBySym1 a1627856079 l

data UnionBySym1 (l :: TyFun a1627856079 (TyFun a1627856079 Bool -> Type) -> Type) (l :: TyFun [a1627856079] (TyFun [a1627856079] [a1627856079] -> Type)) #

Instances

SuppressUnusedWarnings ((TyFun a1627856079 (TyFun a1627856079 Bool -> Type) -> Type) -> TyFun [a1627856079] (TyFun [a1627856079] [a1627856079] -> Type) -> *) (UnionBySym1 a1627856079) #
Methods suppressUnusedWarnings :: Proxy (UnionBySym1 a1627856079) t -> () #
type Apply [a1627856079] (TyFun [a1627856079] [a1627856079] -> Type) (UnionBySym1 a1627856079 l1) l2 #
type Apply [a1627856079] (TyFun [a1627856079] [a1627856079] -> Type) (UnionBySym1 a1627856079 l1) l2 = UnionBySym2 a1627856079 l1 l2

data UnionBySym2 (l :: TyFun a1627856079 (TyFun a1627856079 Bool -> Type) -> Type) (l :: [a1627856079]) (l :: TyFun [a1627856079] [a1627856079]) #

Instances

SuppressUnusedWarnings ((TyFun a1627856079 (TyFun a1627856079 Bool -> Type) -> Type) -> [a1627856079] -> TyFun [a1627856079] [a1627856079] -> *) (UnionBySym2 a1627856079) #
Methods suppressUnusedWarnings :: Proxy (UnionBySym2 a1627856079) t -> () #
type Apply [a] [a] (UnionBySym2 a l1 l2) l3 #
type Apply [a] [a] (UnionBySym2 a l1 l2) l3 = UnionBy a l1 l2 l3

type UnionBySym3 (t :: TyFun a1627856079 (TyFun a1627856079 Bool -> Type) -> Type) (t :: [a1627856079]) (t :: [a1627856079]) = UnionBy t t t #

data IntersectBySym0 (l :: TyFun (TyFun a1627856107 (TyFun a1627856107 Bool -> Type) -> Type) (TyFun [a1627856107] (TyFun [a1627856107] [a1627856107] -> Type) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856107 (TyFun a1627856107 Bool -> Type) -> Type) (TyFun [a1627856107] (TyFun [a1627856107] [a1627856107] -> Type) -> Type) -> *) (IntersectBySym0 a1627856107) #
Methods suppressUnusedWarnings :: Proxy (IntersectBySym0 a1627856107) t -> () #
type Apply (TyFun a1627856107 (TyFun a1627856107 Bool -> Type) -> Type) (TyFun [a1627856107] (TyFun [a1627856107] [a1627856107] -> Type) -> Type) (IntersectBySym0 a1627856107) l #
type Apply (TyFun a1627856107 (TyFun a1627856107 Bool -> Type) -> Type) (TyFun [a1627856107] (TyFun [a1627856107] [a1627856107] -> Type) -> Type) (IntersectBySym0 a1627856107) l = IntersectBySym1 a1627856107 l

data IntersectBySym1 (l :: TyFun a1627856107 (TyFun a1627856107 Bool -> Type) -> Type) (l :: TyFun [a1627856107] (TyFun [a1627856107] [a1627856107] -> Type)) #

Instances

SuppressUnusedWarnings ((TyFun a1627856107 (TyFun a1627856107 Bool -> Type) -> Type) -> TyFun [a1627856107] (TyFun [a1627856107] [a1627856107] -> Type) -> *) (IntersectBySym1 a1627856107) #
Methods suppressUnusedWarnings :: Proxy (IntersectBySym1 a1627856107) t -> () #
type Apply [a1627856107] (TyFun [a1627856107] [a1627856107] -> Type) (IntersectBySym1 a1627856107 l1) l2 #
type Apply [a1627856107] (TyFun [a1627856107] [a1627856107] -> Type) (IntersectBySym1 a1627856107 l1) l2 = IntersectBySym2 a1627856107 l1 l2

data IntersectBySym2 (l :: TyFun a1627856107 (TyFun a1627856107 Bool -> Type) -> Type) (l :: [a1627856107]) (l :: TyFun [a1627856107] [a1627856107]) #

Instances

SuppressUnusedWarnings ((TyFun a1627856107 (TyFun a1627856107 Bool -> Type) -> Type) -> [a1627856107] -> TyFun [a1627856107] [a1627856107] -> *) (IntersectBySym2 a1627856107) #
Methods suppressUnusedWarnings :: Proxy (IntersectBySym2 a1627856107) t -> () #
type Apply [a] [a] (IntersectBySym2 a l1 l2) l3 #
type Apply [a] [a] (IntersectBySym2 a l1 l2) l3 = IntersectBy a l1 l2 l3

type IntersectBySym3 (t :: TyFun a1627856107 (TyFun a1627856107 Bool -> Type) -> Type) (t :: [a1627856107]) (t :: [a1627856107]) = IntersectBy t t t #

data GroupBySym0 (l :: TyFun (TyFun a1627856093 (TyFun a1627856093 Bool -> Type) -> Type) (TyFun [a1627856093] [[a1627856093]] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856093 (TyFun a1627856093 Bool -> Type) -> Type) (TyFun [a1627856093] [[a1627856093]] -> Type) -> *) (GroupBySym0 a1627856093) #
Methods suppressUnusedWarnings :: Proxy (GroupBySym0 a1627856093) t -> () #
type Apply (TyFun a1627856093 (TyFun a1627856093 Bool -> Type) -> Type) (TyFun [a1627856093] [[a1627856093]] -> Type) (GroupBySym0 a1627856093) l #
type Apply (TyFun a1627856093 (TyFun a1627856093 Bool -> Type) -> Type) (TyFun [a1627856093] [[a1627856093]] -> Type) (GroupBySym0 a1627856093) l = GroupBySym1 a1627856093 l

data GroupBySym1 (l :: TyFun a1627856093 (TyFun a1627856093 Bool -> Type) -> Type) (l :: TyFun [a1627856093] [[a1627856093]]) #

Instances

SuppressUnusedWarnings ((TyFun a1627856093 (TyFun a1627856093 Bool -> Type) -> Type) -> TyFun [a1627856093] [[a1627856093]] -> *) (GroupBySym1 a1627856093) #
Methods suppressUnusedWarnings :: Proxy (GroupBySym1 a1627856093) t -> () #
type Apply [a] [[a]] (GroupBySym1 a l1) l2 #
type Apply [a] [[a]] (GroupBySym1 a l1) l2 = GroupBy a l1 l2

type GroupBySym2 (t :: TyFun a1627856093 (TyFun a1627856093 Bool -> Type) -> Type) (t :: [a1627856093]) = GroupBy t t #

data SortBySym0 (l :: TyFun (TyFun a1627856118 (TyFun a1627856118 Ordering -> Type) -> Type) (TyFun [a1627856118] [a1627856118] -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856118 (TyFun a1627856118 Ordering -> Type) -> Type) (TyFun [a1627856118] [a1627856118] -> Type) -> *) (SortBySym0 a1627856118) #
Methods suppressUnusedWarnings :: Proxy (SortBySym0 a1627856118) t -> () #
type Apply (TyFun a1627856118 (TyFun a1627856118 Ordering -> Type) -> Type) (TyFun [a1627856118] [a1627856118] -> Type) (SortBySym0 a1627856118) l #
type Apply (TyFun a1627856118 (TyFun a1627856118 Ordering -> Type) -> Type) (TyFun [a1627856118] [a1627856118] -> Type) (SortBySym0 a1627856118) l = SortBySym1 a1627856118 l

data SortBySym1 (l :: TyFun a1627856118 (TyFun a1627856118 Ordering -> Type) -> Type) (l :: TyFun [a1627856118] [a1627856118]) #

Instances

SuppressUnusedWarnings ((TyFun a1627856118 (TyFun a1627856118 Ordering -> Type) -> Type) -> TyFun [a1627856118] [a1627856118] -> *) (SortBySym1 a1627856118) #
Methods suppressUnusedWarnings :: Proxy (SortBySym1 a1627856118) t -> () #
type Apply [a] [a] (SortBySym1 a l1) l2 #
type Apply [a] [a] (SortBySym1 a l1) l2 = SortBy a l1 l2

type SortBySym2 (t :: TyFun a1627856118 (TyFun a1627856118 Ordering -> Type) -> Type) (t :: [a1627856118]) = SortBy t t #

data InsertBySym0 (l :: TyFun (TyFun a1627856117 (TyFun a1627856117 Ordering -> Type) -> Type) (TyFun a1627856117 (TyFun [a1627856117] [a1627856117] -> Type) -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856117 (TyFun a1627856117 Ordering -> Type) -> Type) (TyFun a1627856117 (TyFun [a1627856117] [a1627856117] -> Type) -> Type) -> *) (InsertBySym0 a1627856117) #
Methods suppressUnusedWarnings :: Proxy (InsertBySym0 a1627856117) t -> () #
type Apply (TyFun a1627856117 (TyFun a1627856117 Ordering -> Type) -> Type) (TyFun a1627856117 (TyFun [a1627856117] [a1627856117] -> Type) -> Type) (InsertBySym0 a1627856117) l #
type Apply (TyFun a1627856117 (TyFun a1627856117 Ordering -> Type) -> Type) (TyFun a1627856117 (TyFun [a1627856117] [a1627856117] -> Type) -> Type) (InsertBySym0 a1627856117) l = InsertBySym1 a1627856117 l

data InsertBySym1 (l :: TyFun a1627856117 (TyFun a1627856117 Ordering -> Type) -> Type) (l :: TyFun a1627856117 (TyFun [a1627856117] [a1627856117] -> Type)) #

Instances

SuppressUnusedWarnings ((TyFun a1627856117 (TyFun a1627856117 Ordering -> Type) -> Type) -> TyFun a1627856117 (TyFun [a1627856117] [a1627856117] -> Type) -> *) (InsertBySym1 a1627856117) #
Methods suppressUnusedWarnings :: Proxy (InsertBySym1 a1627856117) t -> () #
type Apply a1627856117 (TyFun [a1627856117] [a1627856117] -> Type) (InsertBySym1 a1627856117 l1) l2 #
type Apply a1627856117 (TyFun [a1627856117] [a1627856117] -> Type) (InsertBySym1 a1627856117 l1) l2 = InsertBySym2 a1627856117 l1 l2

data InsertBySym2 (l :: TyFun a1627856117 (TyFun a1627856117 Ordering -> Type) -> Type) (l :: a1627856117) (l :: TyFun [a1627856117] [a1627856117]) #

Instances

SuppressUnusedWarnings ((TyFun a1627856117 (TyFun a1627856117 Ordering -> Type) -> Type) -> a1627856117 -> TyFun [a1627856117] [a1627856117] -> *) (InsertBySym2 a1627856117) #
Methods suppressUnusedWarnings :: Proxy (InsertBySym2 a1627856117) t -> () #
type Apply [a] [a] (InsertBySym2 a l1 l2) l3 #
type Apply [a] [a] (InsertBySym2 a l1 l2) l3 = InsertBy a l1 l2 l3

type InsertBySym3 (t :: TyFun a1627856117 (TyFun a1627856117 Ordering -> Type) -> Type) (t :: a1627856117) (t :: [a1627856117]) = InsertBy t t t #

data MaximumBySym0 (l :: TyFun (TyFun a1627856116 (TyFun a1627856116 Ordering -> Type) -> Type) (TyFun [a1627856116] a1627856116 -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856116 (TyFun a1627856116 Ordering -> Type) -> Type) (TyFun [a1627856116] a1627856116 -> Type) -> *) (MaximumBySym0 a1627856116) #
Methods suppressUnusedWarnings :: Proxy (MaximumBySym0 a1627856116) t -> () #
type Apply (TyFun a1627856116 (TyFun a1627856116 Ordering -> Type) -> Type) (TyFun [a1627856116] a1627856116 -> Type) (MaximumBySym0 a1627856116) l #
type Apply (TyFun a1627856116 (TyFun a1627856116 Ordering -> Type) -> Type) (TyFun [a1627856116] a1627856116 -> Type) (MaximumBySym0 a1627856116) l = MaximumBySym1 a1627856116 l

data MaximumBySym1 (l :: TyFun a1627856116 (TyFun a1627856116 Ordering -> Type) -> Type) (l :: TyFun [a1627856116] a1627856116) #

Instances

SuppressUnusedWarnings ((TyFun a1627856116 (TyFun a1627856116 Ordering -> Type) -> Type) -> TyFun [a1627856116] a1627856116 -> *) (MaximumBySym1 a1627856116) #
Methods suppressUnusedWarnings :: Proxy (MaximumBySym1 a1627856116) t -> () #
type Apply [a] a (MaximumBySym1 a l1) l2 #
type Apply [a] a (MaximumBySym1 a l1) l2 = MaximumBy a l1 l2

type MaximumBySym2 (t :: TyFun a1627856116 (TyFun a1627856116 Ordering -> Type) -> Type) (t :: [a1627856116]) = MaximumBy t t #

data MinimumBySym0 (l :: TyFun (TyFun a1627856115 (TyFun a1627856115 Ordering -> Type) -> Type) (TyFun [a1627856115] a1627856115 -> Type)) #

Instances

SuppressUnusedWarnings (TyFun (TyFun a1627856115 (TyFun a1627856115 Ordering -> Type) -> Type) (TyFun [a1627856115] a1627856115 -> Type) -> *) (MinimumBySym0 a1627856115) #
Methods suppressUnusedWarnings :: Proxy (MinimumBySym0 a1627856115) t -> () #
type Apply (TyFun a1627856115 (TyFun a1627856115 Ordering -> Type) -> Type) (TyFun [a1627856115] a1627856115 -> Type) (MinimumBySym0 a1627856115) l #
type Apply (TyFun a1627856115 (TyFun a1627856115 Ordering -> Type) -> Type) (TyFun [a1627856115] a1627856115 -> Type) (MinimumBySym0 a1627856115) l = MinimumBySym1 a1627856115 l

data MinimumBySym1 (l :: TyFun a1627856115 (TyFun a1627856115 Ordering -> Type) -> Type) (l :: TyFun [a1627856115] a1627856115) #

Instances

SuppressUnusedWarnings ((TyFun a1627856115 (TyFun a1627856115 Ordering -> Type) -> Type) -> TyFun [a1627856115] a1627856115 -> *) (MinimumBySym1 a1627856115) #
Methods suppressUnusedWarnings :: Proxy (MinimumBySym1 a1627856115) t -> () #
type Apply [a] a (MinimumBySym1 a l1) l2 #
type Apply [a] a (MinimumBySym1 a l1) l2 = MinimumBy a l1 l2

type MinimumBySym2 (t :: TyFun a1627856115 (TyFun a1627856115 Ordering -> Type) -> Type) (t :: [a1627856115]) = MinimumBy t t #

data GenericLengthSym0 (l :: TyFun [a1627856077] i1627856076) #

Instances

SuppressUnusedWarnings (TyFun [a1627856077] i1627856076 -> *) (GenericLengthSym0 a1627856077 i1627856076) #
Methods suppressUnusedWarnings :: Proxy (GenericLengthSym0 a1627856077 i1627856076) t -> () #
type Apply [a] k2 (GenericLengthSym0 a k2) l #
type Apply [a] k2 (GenericLengthSym0 a k2) l = GenericLength a k2 l

type GenericLengthSym1 (t :: [a1627856077]) = GenericLength t #

The singleton for lists

Basic functions

List transformations

Reducing lists (folds)

Special folds

Building lists

Scans

Accumulating maps

Cyclical lists

Unfolding

Sublists

Extracting sublists

Predicates

Searching lists

Searching by equality

Searching with a predicate

Indexing lists

Zipping and unzipping lists

Special lists

"Set" operations

Ordered lists

Generalized functions

The "By" operations

User-supplied equality (replacing an Eq context)

User-supplied comparison (replacing an Ord context)

The "generic" operations

Defunctionalization symbols

The "`By`" operations

User-supplied equality (replacing an `Eq` context)

User-supplied comparison (replacing an `Ord` context)

The "`generic`" operations