Data.Promotion.Prelude.List

Defines promoted functions and datatypes relating to List, including a promoted version of all 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.

Basic functions

type family a :++ a :: [a]

Equations

`[]` :++ ys = ys

((:) x xs) :++ ys = Apply (Apply (:$) x) (Apply (Apply (:++$) xs) ys)

type family Head a :: a

Equations

Head ((:) a z) = a

Head `[]` = Apply ErrorSym0 "Data.Singletons.List.head: empty list"

type family Last a :: a

Equations

Last `[]` = Apply ErrorSym0 "Data.Singletons.List.last: empty list"

Last ((:) x xs) = Apply (Apply (Let_1627596970Last'Sym2 x xs) x) xs

type family Tail a :: [a]

Equations

Tail ((:) z t) = t

Tail `[]` = Apply ErrorSym0 "Data.Singletons.List.tail: empty list"

type family Init a :: [a]

Equations

Init `[]` = Apply ErrorSym0 "Data.Singletons.List.init: empty list"

Init ((:) x xs) = Apply (Apply (Let_1627596932Init'Sym2 x xs) x) xs

type family Null a :: Bool

Equations

Null `[]` = TrueSym0

Null ((:) z z) = FalseSym0

type family Length a :: Nat

Equations

Length `[]` = 0

Length ((:) z xs) = Apply (Apply (:+$) 1) (Apply LengthSym0 xs)

List transformations

type family Map a a :: [b]

Equations

Map z `[]` = `[]`

Map f ((:) x xs) = Apply (Apply (:$) (Apply f x)) (Apply (Apply MapSym0 f) xs)

type family Reverse a :: [a]

Equations

Reverse l = Apply (Apply (Let_1627596889RevSym1 l) l) `[]`

type family Intersperse a a :: [a]

Equations

Intersperse z `[]` = `[]`

Intersperse sep ((:) x xs) = Apply (Apply (:$) x) (Apply (Apply PrependToAllSym0 sep) xs)

type family Intercalate a a :: [a]

Equations

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

type family Transpose a :: [[a]]

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

type family Subsequences a :: [[a]]

Equations

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

type family Permutations a :: [[a]]

Equations

Permutations xs0 = Apply (Apply (:$) xs0) (Apply (Apply (Let_1627596448PermsSym1 xs0) xs0) `[]`)

Reducing lists (folds)

type family Foldl a a a :: b

Equations

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

type family Foldl' a a a :: b

Equations

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

type family Foldl1 a a :: a

Equations

Foldl1 f ((:) x xs) = Apply (Apply (Apply FoldlSym0 f) x) xs

Foldl1 z `[]` = Apply ErrorSym0 "Data.Singletons.List.foldl1: empty list"

type family Foldl1' a a :: a

Equations

Foldl1' f ((:) x xs) = Apply (Apply (Apply Foldl'Sym0 f) x) xs

Foldl1' z `[]` = Apply ErrorSym0 "Data.Singletons.List.foldl1': empty list"

type family Foldr a a a :: b

Equations

Foldr k z a_1627559854 = Apply (Let_1627559859GoSym3 k z a_1627559854) a_1627559854

type family Foldr1 a a :: a

Equations

Foldr1 z `[x]` = x

Foldr1 f ((:) x ((:) wild_1627594821 wild_1627594823)) = Apply (Apply f x) (Apply (Apply Foldr1Sym0 f) (Let_1627596044XsSym4 f x wild_1627594821 wild_1627594823))

Foldr1 z `[]` = Apply ErrorSym0 "Data.Singletons.List.foldr1: empty list"

Special folds

type family Concat a :: [a]

Equations

Concat a_1627596022 = Apply (Apply (Apply FoldrSym0 (:++$)) `[]`) a_1627596022

type family ConcatMap a a :: [b]

Equations

ConcatMap f a_1627596018 = Apply (Apply (Apply FoldrSym0 (Apply (Apply (:.$) (:++$)) f)) `[]`) a_1627596018

type family And a :: Bool

Equations

And `[]` = TrueSym0

And ((:) x xs) = Apply (Apply (:&&$) x) (Apply AndSym0 xs)

type family Or a :: Bool

Equations

Or `[]` = FalseSym0

Or ((:) x xs) = Apply (Apply (:||$) x) (Apply OrSym0 xs)

type family Any_ a a :: Bool

Equations

Any_ z `[]` = FalseSym0

Any_ p ((:) x xs) = Apply (Apply (:||$) (Apply p x)) (Apply (Apply Any_Sym0 p) xs)

type family All a a :: Bool

Equations

All z `[]` = TrueSym0

All p ((:) x xs) = Apply (Apply (:&&$) (Apply p x)) (Apply (Apply AllSym0 p) xs)

type family Sum a :: Nat

Equations

Sum l = Apply (Apply (Let_1627771184Sum'Sym1 l) l) 0

type family Product a :: Nat

Equations

Product l = Apply (Apply (Let_1627771159ProdSym1 l) l) 1

type family Maximum a :: a

Equations

Maximum `[]` = Apply ErrorSym0 "Data.Singletons.List.maximum: empty list"

Maximum xs = Apply (Apply Foldl1Sym0 MaxSym0) xs

type family Minimum a :: a

Equations

Minimum `[]` = Apply ErrorSym0 "Data.Singletons.List.minimum: empty list"

Minimum xs = Apply (Apply Foldl1Sym0 MinSym0) xs

any_ :: forall a. (a -> Bool) -> [a] -> Bool

Building lists

Scans

type family Scanl a a a :: [b]

Equations

Scanl f q ls = Apply (Apply (:$) q) (Case_1627595965 f q ls (Let_1627595951Scrutinee_1627594825Sym3 f q ls))

type family Scanl1 a a :: [a]

Equations

Scanl1 f ((:) x xs) = Apply (Apply (Apply ScanlSym0 f) x) xs

Scanl1 z `[]` = `[]`

type family Scanr a a a :: [b]

Equations

Scanr z q0 `[]` = Apply (Apply (:$) q0) `[]`

Scanr f q0 ((:) x xs) = Case_1627595927 f q0 x xs (Let_1627595907Scrutinee_1627594827Sym4 f q0 x xs)

type family Scanr1 a a :: [a]

Equations

Scanr1 z `[]` = `[]`

Scanr1 z `[x]` = Apply (Apply (:$) x) `[]`

Scanr1 f ((:) x ((:) wild_1627594831 wild_1627594833)) = Case_1627595880 f x wild_1627594831 wild_1627594833 (Let_1627595860Scrutinee_1627594829Sym4 f x wild_1627594831 wild_1627594833)

Accumulating maps

type family MapAccumL a a a :: (acc, [y])

Equations

MapAccumL z s `[]` = Apply (Apply Tuple2Sym0 s) `[]`

MapAccumL f s ((:) x xs) = Apply (Apply Tuple2Sym0 (Let_1627595678S''Sym4 f s x xs)) (Apply (Apply (:$) (Let_1627595678YSym4 f s x xs)) (Let_1627595678YsSym4 f s x xs))

type family MapAccumR a a a :: (acc, [y])

Equations

MapAccumR z s `[]` = Apply (Apply Tuple2Sym0 s) `[]`

MapAccumR f s ((:) x xs) = Apply (Apply Tuple2Sym0 (Let_1627595511S''Sym4 f s x xs)) (Apply (Apply (:$) (Let_1627595511YSym4 f s x xs)) (Let_1627595511YsSym4 f s x xs))

Infinite lists

type family Replicate a a :: [a]

Equations

Replicate 0 z = `[]`

Replicate n x = Apply (Apply (:$) x) (Apply (Apply ReplicateSym0 (Apply (Apply (:-$) n) 1)) x)

Unfolding

type family Unfoldr a a :: [a]

Equations

Unfoldr f b = Case_1627595484 f b (Let_1627595475Scrutinee_1627594835Sym2 f b)

Sublists

Extracting sublists

type family Take a a :: [a]

Equations

Take z `[]` = `[]`

Take 0 ((:) z z) = `[]`

Take n ((:) x xs) = Apply (Apply (:$) x) (Apply (Apply TakeSym0 (Apply (Apply (:-$) n) 1)) xs)

type family Drop a a :: [a]

Equations

Drop z `[]` = `[]`

Drop 0 ((:) wild_1627769621 wild_1627769623) = Let_1627771036XsSym2 wild_1627769621 wild_1627769623

Drop n ((:) z xs) = Apply (Apply DropSym0 (Apply (Apply (:-$) n) 1)) xs

type family SplitAt a a :: ([a], [a])

Equations

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

type family TakeWhile a a :: [a]

Equations

TakeWhile z `[]` = `[]`

TakeWhile arg_1627769625 arg_1627769627 = Case_1627771013 arg_1627769625 arg_1627769627 (Apply (Apply Tuple2Sym0 arg_1627769625) arg_1627769627)

type family DropWhile a a :: [a]

Equations

DropWhile z `[]` = `[]`

DropWhile arg_1627769629 arg_1627769631 = Case_1627770963 arg_1627769629 arg_1627769631 (Apply (Apply Tuple2Sym0 arg_1627769629) arg_1627769631)

type family DropWhileEnd a a :: [a]

Equations

DropWhileEnd p a_1627770898 = Apply (Apply (Apply FoldrSym0 (Apply (Apply Lambda_1627770902Sym0 p) a_1627770898)) `[]`) a_1627770898

type family Span a a :: ([a], [a])

Equations

Span z `[]` = Apply (Apply Tuple2Sym0 Let_1627770678XsSym0) Let_1627770678XsSym0

Span arg_1627769635 arg_1627769637 = Case_1627770682 arg_1627769635 arg_1627769637 (Apply (Apply Tuple2Sym0 arg_1627769635) arg_1627769637)

type family Break a a :: ([a], [a])

Equations

Break z `[]` = Apply (Apply Tuple2Sym0 Let_1627770531XsSym0) Let_1627770531XsSym0

Break arg_1627769639 arg_1627769641 = Case_1627770535 arg_1627769639 arg_1627769641 (Apply (Apply Tuple2Sym0 arg_1627769639) arg_1627769641)

type family StripPrefix a a :: Maybe [a]

Equations

StripPrefix `[]` ys = Apply JustSym0 ys

StripPrefix arg_1627769643 arg_1627769645 = Case_1627770501 arg_1627769643 arg_1627769645 (Apply (Apply Tuple2Sym0 arg_1627769643) arg_1627769645)

type family Group a :: [[a]]

Equations

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

type family Inits a :: [[a]]

Equations

Inits xs = Apply (Apply (:$) `[]`) (Case_1627595458 xs (Let_1627595453Scrutinee_1627594837Sym1 xs))

type family Tails a :: [[a]]

Equations

Tails xs = Apply (Apply (:$) xs) (Case_1627595431 xs (Let_1627595426Scrutinee_1627594839Sym1 xs))

Predicates

type family IsPrefixOf a a :: Bool

Equations

IsPrefixOf `[]` `[]` = TrueSym0

IsPrefixOf `[]` ((:) z z) = TrueSym0

IsPrefixOf ((:) z z) `[]` = FalseSym0

IsPrefixOf ((:) x xs) ((:) y ys) = Apply (Apply (:&&$) (Apply (Apply (:==$) x) y)) (Apply (Apply IsPrefixOfSym0 xs) ys)

type family IsSuffixOf a a :: Bool

Equations

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

type family IsInfixOf a a :: Bool

Equations

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

Searching lists

Searching by equality

type family Elem a a :: Bool

Equations

Elem z `[]` = FalseSym0

Elem x ((:) y ys) = Apply (Apply (:||$) (Apply (Apply (:==$) x) y)) (Apply (Apply ElemSym0 x) ys)

type family NotElem a a :: Bool

Equations

NotElem z `[]` = TrueSym0

NotElem x ((:) y ys) = Apply (Apply (:&&$) (Apply (Apply (:/=$) x) y)) (Apply (Apply NotElemSym0 x) ys)

type family Lookup a a :: Maybe b

Equations

Lookup _key `[]` = NothingSym0

Lookup arg_1627769647 arg_1627769649 = Case_1627770449 arg_1627769647 arg_1627769649 (Apply (Apply Tuple2Sym0 arg_1627769647) arg_1627769649)

Searching with a predicate

type family Find a a :: Maybe a

Equations

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

type family Filter a a :: [a]

Equations

Filter _p `[]` = `[]`

Filter arg_1627769651 arg_1627769653 = Case_1627770350 arg_1627769651 arg_1627769653 (Apply (Apply Tuple2Sym0 arg_1627769651) arg_1627769653)

type family Partition a a :: ([a], [a])

Equations

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

Indexing lists

type family a :!! a :: a

Equations

`[]` :!! z = Apply ErrorSym0 "Data.Singletons.List.!!: index too large"

((:) x xs) :!! n = Case_1627770278 x xs n (Apply (Apply (:==$) n) 0)

type family ElemIndex a a :: Maybe Nat

Equations

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

type family ElemIndices a a :: [Nat]

Equations

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

type family FindIndex a a :: Maybe Nat

Equations

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

type family FindIndices a a :: [Nat]

Equations

FindIndices p xs = Apply (Apply MapSym0 SndSym0) (Apply (Apply FilterSym0 (Apply (Apply Lambda_1627771246Sym0 p) xs)) (Apply (Apply ZipSym0 xs) (Apply (Apply (Let_1627771221BuildListSym2 p xs) 0) (Apply LengthSym0 xs))))

Zipping and unzipping lists

type family Zip a a :: [(a, b)]

Equations

Zip ((:) x xs) ((:) y ys) = Apply (Apply (:$) (Apply (Apply Tuple2Sym0 x) y)) (Apply (Apply ZipSym0 xs) ys)

Zip `[]` `[]` = `[]`

Zip ((:) z z) `[]` = `[]`

Zip `[]` ((:) z z) = `[]`

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

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 z) = `[]`

Zip3 `[]` ((:) z z) `[]` = `[]`

Zip3 `[]` ((:) z z) ((:) z z) = `[]`

Zip3 ((:) z z) `[]` `[]` = `[]`

Zip3 ((:) z z) `[]` ((:) z z) = `[]`

Zip3 ((:) z z) ((:) z z) `[]` = `[]`

type family Zip4 a a a a :: [(a, b, c, d)]

Equations

Zip4 a_1627770231 a_1627770233 a_1627770235 a_1627770237 = Apply (Apply (Apply (Apply (Apply ZipWith4Sym0 Tuple4Sym0) a_1627770231) a_1627770233) a_1627770235) a_1627770237

type family Zip5 a a a a a :: [(a, b, c, d, e)]

Equations

Zip5 a_1627770186 a_1627770188 a_1627770190 a_1627770192 a_1627770194 = Apply (Apply (Apply (Apply (Apply (Apply ZipWith5Sym0 Tuple5Sym0) a_1627770186) a_1627770188) a_1627770190) a_1627770192) a_1627770194

type family Zip6 a a a a a a :: [(a, b, c, d, e, f)]

Equations

Zip6 a_1627770129 a_1627770131 a_1627770133 a_1627770135 a_1627770137 a_1627770139 = Apply (Apply (Apply (Apply (Apply (Apply (Apply ZipWith6Sym0 Tuple6Sym0) a_1627770129) a_1627770131) a_1627770133) a_1627770135) a_1627770137) a_1627770139

type family Zip7 a a a a a a a :: [(a, b, c, d, e, f, g)]

Equations

Zip7 a_1627770059 a_1627770061 a_1627770063 a_1627770065 a_1627770067 a_1627770069 a_1627770071 = Apply (Apply (Apply (Apply (Apply (Apply (Apply (Apply ZipWith7Sym0 Tuple7Sym0) a_1627770059) a_1627770061) a_1627770063) a_1627770065) a_1627770067) a_1627770069) a_1627770071

type family ZipWith a a a :: [c]

Equations

ZipWith f ((:) x xs) ((:) y ys) = Apply (Apply (:$) (Apply (Apply f x) y)) (Apply (Apply (Apply ZipWithSym0 f) xs) ys)

ZipWith z `[]` `[]` = `[]`

ZipWith z ((:) z z) `[]` = `[]`

ZipWith z `[]` ((:) z z) = `[]`

type family ZipWith3 a a a a :: [d]

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 `[]` `[]` `[]` = `[]`

ZipWith3 z `[]` `[]` ((:) z z) = `[]`

ZipWith3 z `[]` ((:) z z) `[]` = `[]`

ZipWith3 z `[]` ((:) z z) ((:) z z) = `[]`

ZipWith3 z ((:) z z) `[]` `[]` = `[]`

ZipWith3 z ((:) z z) `[]` ((:) z z) = `[]`

ZipWith3 z ((:) z z) ((:) z z) `[]` = `[]`

type family ZipWith4 a a a a a :: [e]

Equations

ZipWith4 z ((:) a as) ((:) b bs) ((:) c cs) ((:) d ds) = Apply (Apply (:$) (Apply (Apply (Apply (Apply z a) b) c) d)) (Apply (Apply (Apply (Apply (Apply ZipWith4Sym0 z) as) bs) cs) ds)

ZipWith4 z z z z z = `[]`

type family ZipWith5 a a a a a a :: [f]

Equations

ZipWith5 z ((:) a as) ((:) b bs) ((:) c cs) ((:) d ds) ((:) e es) = Apply (Apply (:$) (Apply (Apply (Apply (Apply (Apply z a) b) c) d) e)) (Apply (Apply (Apply (Apply (Apply (Apply ZipWith5Sym0 z) as) bs) cs) ds) es)

ZipWith5 z z z z z z = `[]`

type family ZipWith6 a a a a a a a :: [g]

Equations

ZipWith6 z ((:) a as) ((:) b bs) ((:) c cs) ((:) d ds) ((:) e es) ((:) f fs) = Apply (Apply (:$) (Apply (Apply (Apply (Apply (Apply (Apply z a) b) c) d) e) f)) (Apply (Apply (Apply (Apply (Apply (Apply (Apply ZipWith6Sym0 z) as) bs) cs) ds) es) fs)

ZipWith6 z z z z z z z = `[]`

type family ZipWith7 a a a a a a a a :: [h]

Equations

ZipWith7 z ((:) a as) ((:) b bs) ((:) c cs) ((:) d ds) ((:) e es) ((:) f fs) ((:) g gs) = Apply (Apply (:$) (Apply (Apply (Apply (Apply (Apply (Apply (Apply z a) b) c) d) e) f) g)) (Apply (Apply (Apply (Apply (Apply (Apply (Apply (Apply ZipWith7Sym0 z) as) bs) cs) ds) es) fs) gs)

ZipWith7 z z z z z z z z = `[]`

type family Unzip a :: ([a], [b])

Equations

Unzip xs = Apply (Apply (Apply FoldrSym0 (Apply Lambda_1627595214Sym0 xs)) (Apply (Apply Tuple2Sym0 `[]`) `[]`)) xs

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

Equations

Unzip3 xs = Apply (Apply (Apply FoldrSym0 (Apply Lambda_1627595180Sym0 xs)) (Apply (Apply (Apply Tuple3Sym0 `[]`) `[]`) `[]`)) xs

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

Equations

Unzip4 xs = Apply (Apply (Apply FoldrSym0 (Apply Lambda_1627595144Sym0 xs)) (Apply (Apply (Apply (Apply Tuple4Sym0 `[]`) `[]`) `[]`) `[]`)) xs

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

Equations

Unzip5 xs = Apply (Apply (Apply FoldrSym0 (Apply Lambda_1627595106Sym0 xs)) (Apply (Apply (Apply (Apply (Apply Tuple5Sym0 `[]`) `[]`) `[]`) `[]`) `[]`)) xs

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

Equations

Unzip6 xs = Apply (Apply (Apply FoldrSym0 (Apply Lambda_1627595066Sym0 xs)) (Apply (Apply (Apply (Apply (Apply (Apply Tuple6Sym0 `[]`) `[]`) `[]`) `[]`) `[]`) `[]`)) xs

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

Equations

Unzip7 xs = Apply (Apply (Apply FoldrSym0 (Apply Lambda_1627595024Sym0 xs)) (Apply (Apply (Apply (Apply (Apply (Apply (Apply Tuple7Sym0 `[]`) `[]`) `[]`) `[]`) `[]`) `[]`) `[]`)) xs

Special lists

"Set" operations

type family Nub a :: [a]

Equations

Nub l = Apply (Apply (Let_1627769777Nub'Sym1 l) l) `[]`

type family Delete a a :: [a]

Equations

Delete a_1627595004 a_1627595006 = Apply (Apply (Apply DeleteBySym0 (:==$)) a_1627595004) a_1627595006

type family a :\\ a :: [a]

Equations

a_1627596406 :\\ a_1627596408 = Apply (Apply (Apply FoldlSym0 (Apply FlipSym0 DeleteSym0)) a_1627596406) a_1627596408

type family Union a a :: [a]

Equations

Union a_1627769757 a_1627769759 = Apply (Apply (Apply UnionBySym0 (:==$)) a_1627769757) a_1627769759

type family Intersect a a :: [a]

Equations

Intersect a_1627770409 a_1627770411 = Apply (Apply (Apply IntersectBySym0 (:==$)) a_1627770409) a_1627770411

Ordered lists

type family Sort a :: [a]

Equations

Sort a_1627770461 = Apply (Apply SortBySym0 CompareSym0) a_1627770461

type family Insert a a :: [a]

Equations

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

Generalized functions

The "By" operations

User-supplied equality (replacing an Eq context)

type family NubBy a a :: [a]

Equations

NubBy eq l = Apply (Apply (Let_1627769703NubBy'Sym2 eq l) l) `[]`

type family DeleteBy a a a :: [a]

Equations

DeleteBy z z `[]` = `[]`

DeleteBy eq x ((:) y ys) = Case_1627595000 eq x y ys (Let_1627594980Scrutinee_1627594865Sym4 eq x y ys)

type family DeleteFirstsBy a a a :: [a]

Equations

DeleteFirstsBy eq a_1627596436 a_1627596438 = Apply (Apply (Apply FoldlSym0 (Apply FlipSym0 (Apply DeleteBySym0 eq))) a_1627596436) a_1627596438

type family UnionBy a a a :: [a]

Equations

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

type family GroupBy a a :: [[a]]

Equations

GroupBy z `[]` = `[]`

GroupBy eq ((:) x xs) = Apply (Apply (:$) (Apply (Apply (:$) x) (Let_1627770828YsSym3 eq x xs))) (Apply (Apply GroupBySym0 eq) (Let_1627770828ZsSym3 eq x xs))

type family IntersectBy a a a :: [a]

Equations

IntersectBy z `[]` `[]` = `[]`

IntersectBy z `[]` ((:) z z) = `[]`

IntersectBy z ((:) z z) `[]` = `[]`

IntersectBy eq xs ys = Apply (Apply FilterSym0 (Apply (Apply (Apply Lambda_1627770386Sym0 eq) xs) ys)) xs

User-supplied comparison (replacing an Ord context)

type family SortBy a a :: [a]

Equations

SortBy cmp a_1627594955 = Apply (Apply (Apply FoldrSym0 (Apply InsertBySym0 cmp)) `[]`) a_1627594955

type family InsertBy a a a :: [a]

Equations

InsertBy z x `[]` = Apply (Apply (:$) x) `[]`

InsertBy cmp x ((:) y ys') = Case_1627594942 cmp x y ys' (Let_1627594922Scrutinee_1627594867Sym4 cmp x y ys')

type family MaximumBy a a :: a

Equations

MaximumBy z `[]` = Apply ErrorSym0 "Data.Singletons.List.maximumBy: empty list"

MaximumBy cmp ((:) wild_1627594871 wild_1627594873) = Apply (Apply Foldl1Sym0 (Let_1627596255MaxBySym3 cmp wild_1627594871 wild_1627594873)) (Let_1627596241XsSym3 cmp wild_1627594871 wild_1627594873)

type family MinimumBy a a :: a

Equations

MinimumBy z `[]` = Apply ErrorSym0 "Data.Singletons.List.minimumBy: empty list"

MinimumBy cmp ((:) wild_1627594877 wild_1627594879) = Apply (Apply Foldl1Sym0 (Let_1627596344MinBySym3 cmp wild_1627594877 wild_1627594879)) (Let_1627596330XsSym3 cmp wild_1627594877 wild_1627594879)

The "generic" operations

type family GenericLength a :: i

Equations

GenericLength a_1627771308 = Apply LengthSym0 a_1627771308

type family GenericTake a a :: [a]

Equations

GenericTake a_1627771104 a_1627771106 = Apply (Apply TakeSym0 a_1627771104) a_1627771106

type family GenericDrop a a :: [a]

Equations

GenericDrop a_1627771048 a_1627771050 = Apply (Apply DropSym0 a_1627771048) a_1627771050

type family GenericSplitAt a a :: ([a], [a])

Equations

GenericSplitAt a_1627771089 a_1627771091 = Apply (Apply SplitAtSym0 a_1627771089) a_1627771091

type family GenericIndex a a :: a

Equations

GenericIndex a_1627770282 a_1627770284 = Apply (Apply (:!!$) a_1627770282) a_1627770284

type family GenericReplicate a a :: [a]

Equations

GenericReplicate a_1627771139 a_1627771141 = Apply (Apply ReplicateSym0 a_1627771139) a_1627771141

Defunctionalization symbols

type NilSym0 = `[]`

data (:$) l

Instances

SuppressUnusedWarnings (TyFun k (TyFun [k] [k] -> *) -> *) ((:$) k)

type Apply (TyFun [k] [k] -> *) k ((:$) k) l0 = (:$$) k l0

data l :$$ l

Instances

SuppressUnusedWarnings (k -> TyFun [k] [k] -> *) ((:$$) k)

type Apply [k] [k] ((:$$) k l1) l0 = (:$$$) k l1 l0

type (:$$$) t t = (:) t t

data l :++$$ l

Instances

SuppressUnusedWarnings ([k] -> TyFun [k] [k] -> *) ((:++$$) k)

type Apply [k] [k] ((:++$$) k l1) l0

data (:++$) l

Instances

SuppressUnusedWarnings (TyFun [k] (TyFun [k] [k] -> *) -> *) ((:++$) k)

type Apply (TyFun [k] [k] -> *) [k] ((:++$) k) l0 = (:++$$) k l0

data HeadSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] k -> *) (HeadSym0 k)

type Apply k [k] (HeadSym0 k) l0 = HeadSym1 k l0

type HeadSym1 t = Head t

data LastSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] k -> *) (LastSym0 k)

type Apply k [k] (LastSym0 k) l0 = LastSym1 k l0

type LastSym1 t = Last t

data TailSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] [k] -> *) (TailSym0 k)

type Apply [k] [k] (TailSym0 k) l0 = TailSym1 k l0

type TailSym1 t = Tail t

data InitSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] [k] -> *) (InitSym0 k)

type Apply [k] [k] (InitSym0 k) l0 = InitSym1 k l0

type InitSym1 t = Init t

data NullSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] Bool -> *) (NullSym0 k)

type Apply Bool [k] (NullSym0 k) l0 = NullSym1 k l0

type NullSym1 t = Null t

data MapSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k k -> *) (TyFun [k] [k] -> *) -> *) (MapSym0 k k)

type Apply (TyFun [k] [k1] -> *) (TyFun k k1 -> *) (MapSym0 k k1) l0 = MapSym1 k k1 l0

data MapSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k k -> *) -> TyFun [k] [k] -> *) (MapSym1 k k)

type Apply [k1] [k] (MapSym1 k k1 l1) l0 = MapSym2 k k1 l1 l0

type MapSym2 t t = Map t t

data ReverseSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] [k] -> *) (ReverseSym0 k)

type Apply [k] [k] (ReverseSym0 k) l0 = ReverseSym1 k l0

type ReverseSym1 t = Reverse t

data IntersperseSym0 l

Instances

SuppressUnusedWarnings (TyFun k (TyFun [k] [k] -> *) -> *) (IntersperseSym0 k)

type Apply (TyFun [k] [k] -> *) k (IntersperseSym0 k) l0 = IntersperseSym1 k l0

data IntersperseSym1 l l

Instances

SuppressUnusedWarnings (k -> TyFun [k] [k] -> *) (IntersperseSym1 k)

type Apply [k] [k] (IntersperseSym1 k l1) l0 = IntersperseSym2 k l1 l0

type IntersperseSym2 t t = Intersperse t t

data IntercalateSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] (TyFun [[k]] [k] -> *) -> *) (IntercalateSym0 k)

type Apply (TyFun [[k]] [k] -> *) [k] (IntercalateSym0 k) l0 = IntercalateSym1 k l0

data IntercalateSym1 l l

Instances

SuppressUnusedWarnings ([k] -> TyFun [[k]] [k] -> *) (IntercalateSym1 k)

type Apply [k] [[k]] (IntercalateSym1 k l1) l0 = IntercalateSym2 k l1 l0

type IntercalateSym2 t t = Intercalate t t

data SubsequencesSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] [[k]] -> *) (SubsequencesSym0 k)

type Apply [[k]] [k] (SubsequencesSym0 k) l0 = SubsequencesSym1 k l0

type SubsequencesSym1 t = Subsequences t

data PermutationsSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] [[k]] -> *) (PermutationsSym0 k)

type Apply [[k]] [k] (PermutationsSym0 k) l0 = PermutationsSym1 k l0

type PermutationsSym1 t = Permutations t

data FoldlSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k k -> *) -> *) (TyFun k (TyFun [k] k -> *) -> *) -> *) (FoldlSym0 k k)

type Apply (TyFun k (TyFun [k1] k -> *) -> *) (TyFun k (TyFun k1 k -> *) -> *) (FoldlSym0 k k1) l0 = FoldlSym1 k k1 l0

data FoldlSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k k -> *) -> *) -> TyFun k (TyFun [k] k -> *) -> *) (FoldlSym1 k k)

type Apply (TyFun [k1] k -> *) k (FoldlSym1 k k1 l1) l0 = FoldlSym2 k k1 l1 l0

data FoldlSym2 l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k k -> *) -> *) -> k -> TyFun [k] k -> *) (FoldlSym2 k k)

type Apply k [k1] (FoldlSym2 k k1 l1 l2) l0 = FoldlSym3 k k1 l1 l2 l0

type FoldlSym3 t t t = Foldl t t t

data Foldl'Sym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k k -> *) -> *) (TyFun k (TyFun [k] k -> *) -> *) -> *) (Foldl'Sym0 k k)

type Apply (TyFun k (TyFun [k1] k -> *) -> *) (TyFun k (TyFun k1 k -> *) -> *) (Foldl'Sym0 k k1) l0 = Foldl'Sym1 k k1 l0

data Foldl'Sym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k k -> *) -> *) -> TyFun k (TyFun [k] k -> *) -> *) (Foldl'Sym1 k k)

type Apply (TyFun [k1] k -> *) k (Foldl'Sym1 k k1 l1) l0 = Foldl'Sym2 k k1 l1 l0

data Foldl'Sym2 l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k k -> *) -> *) -> k -> TyFun [k] k -> *) (Foldl'Sym2 k k)

type Apply k [k1] (Foldl'Sym2 k k1 l1 l2) l0 = Foldl'Sym3 k k1 l1 l2 l0

type Foldl'Sym3 t t t = Foldl' t t t

data Foldl1Sym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k k -> *) -> *) (TyFun [k] k -> *) -> *) (Foldl1Sym0 k)

type Apply (TyFun [k] k -> *) (TyFun k (TyFun k k -> *) -> *) (Foldl1Sym0 k) l0 = Foldl1Sym1 k l0

data Foldl1Sym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k k -> *) -> *) -> TyFun [k] k -> *) (Foldl1Sym1 k)

type Apply k [k] (Foldl1Sym1 k l1) l0 = Foldl1Sym2 k l1 l0

type Foldl1Sym2 t t = Foldl1 t t

data Foldl1'Sym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k k -> *) -> *) (TyFun [k] k -> *) -> *) (Foldl1'Sym0 k)

type Apply (TyFun [k] k -> *) (TyFun k (TyFun k k -> *) -> *) (Foldl1'Sym0 k) l0 = Foldl1'Sym1 k l0

data Foldl1'Sym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k k -> *) -> *) -> TyFun [k] k -> *) (Foldl1'Sym1 k)

type Apply k [k] (Foldl1'Sym1 k l1) l0 = Foldl1'Sym2 k l1 l0

type Foldl1'Sym2 t t = Foldl1' t t

data FoldrSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k k -> *) -> *) (TyFun k (TyFun [k] k -> *) -> *) -> *) (FoldrSym0 k k)

type Apply (TyFun k1 (TyFun [k] k1 -> *) -> *) (TyFun k (TyFun k1 k1 -> *) -> *) (FoldrSym0 k k1) l0 = FoldrSym1 k k1 l0

data FoldrSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k k -> *) -> *) -> TyFun k (TyFun [k] k -> *) -> *) (FoldrSym1 k k)

type Apply (TyFun [k1] k -> *) k (FoldrSym1 k1 k l1) l0 = FoldrSym2 k1 k l1 l0

data FoldrSym2 l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k k -> *) -> *) -> k -> TyFun [k] k -> *) (FoldrSym2 k k)

type Apply k1 [k] (FoldrSym2 k k1 l1 l2) l0 = FoldrSym3 k k1 l1 l2 l0

type FoldrSym3 t t t = Foldr t t t

data Foldr1Sym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k k -> *) -> *) (TyFun [k] k -> *) -> *) (Foldr1Sym0 k)

type Apply (TyFun [k] k -> *) (TyFun k (TyFun k k -> *) -> *) (Foldr1Sym0 k) l0 = Foldr1Sym1 k l0

data Foldr1Sym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k k -> *) -> *) -> TyFun [k] k -> *) (Foldr1Sym1 k)

type Apply k [k] (Foldr1Sym1 k l1) l0 = Foldr1Sym2 k l1 l0

type Foldr1Sym2 t t = Foldr1 t t

data ConcatSym0 l

Instances

SuppressUnusedWarnings (TyFun [[k]] [k] -> *) (ConcatSym0 k)

type Apply [k] [[k]] (ConcatSym0 k) l0 = ConcatSym1 k l0

type ConcatSym1 t = Concat t

data ConcatMapSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k [k] -> *) (TyFun [k] [k] -> *) -> *) (ConcatMapSym0 k k)

type Apply (TyFun [k] [k1] -> *) (TyFun k [k1] -> *) (ConcatMapSym0 k k1) l0 = ConcatMapSym1 k k1 l0

data ConcatMapSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k [k] -> *) -> TyFun [k] [k] -> *) (ConcatMapSym1 k k)

type Apply [k1] [k] (ConcatMapSym1 k k1 l1) l0 = ConcatMapSym2 k k1 l1 l0

type ConcatMapSym2 t t = ConcatMap t t

data AndSym0 l

Instances

SuppressUnusedWarnings (TyFun [Bool] Bool -> *) AndSym0

type Apply Bool [Bool] AndSym0 l0 = AndSym1 l0

type AndSym1 t = And t

data OrSym0 l

Instances

SuppressUnusedWarnings (TyFun [Bool] Bool -> *) OrSym0

type Apply Bool [Bool] OrSym0 l0 = OrSym1 l0

type OrSym1 t = Or t

data Any_Sym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k Bool -> *) (TyFun [k] Bool -> *) -> *) (Any_Sym0 k)

type Apply (TyFun [k] Bool -> *) (TyFun k Bool -> *) (Any_Sym0 k) l0 = Any_Sym1 k l0

data Any_Sym1 l l

Instances

SuppressUnusedWarnings ((TyFun k Bool -> *) -> TyFun [k] Bool -> *) (Any_Sym1 k)

type Apply Bool [k] (Any_Sym1 k l1) l0 = Any_Sym2 k l1 l0

type Any_Sym2 t t = Any_ t t

data AllSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k Bool -> *) (TyFun [k] Bool -> *) -> *) (AllSym0 k)

type Apply (TyFun [k] Bool -> *) (TyFun k Bool -> *) (AllSym0 k) l0 = AllSym1 k l0

data AllSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k Bool -> *) -> TyFun [k] Bool -> *) (AllSym1 k)

type Apply Bool [k] (AllSym1 k l1) l0 = AllSym2 k l1 l0

type AllSym2 t t = All t t

data ScanlSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k k -> *) -> *) (TyFun k (TyFun [k] [k] -> *) -> *) -> *) (ScanlSym0 k k)

type Apply (TyFun k (TyFun [k1] [k] -> *) -> *) (TyFun k (TyFun k1 k -> *) -> *) (ScanlSym0 k k1) l0 = ScanlSym1 k k1 l0

data ScanlSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k k -> *) -> *) -> TyFun k (TyFun [k] [k] -> *) -> *) (ScanlSym1 k k)

type Apply (TyFun [k1] [k] -> *) k (ScanlSym1 k k1 l1) l0 = ScanlSym2 k k1 l1 l0

data ScanlSym2 l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k k -> *) -> *) -> k -> TyFun [k] [k] -> *) (ScanlSym2 k k)

type Apply [k] [k1] (ScanlSym2 k k1 l1 l2) l0 = ScanlSym3 k k1 l1 l2 l0

type ScanlSym3 t t t = Scanl t t t

data Scanl1Sym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k k -> *) -> *) (TyFun [k] [k] -> *) -> *) (Scanl1Sym0 k)

type Apply (TyFun [k] [k] -> *) (TyFun k (TyFun k k -> *) -> *) (Scanl1Sym0 k) l0 = Scanl1Sym1 k l0

data Scanl1Sym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k k -> *) -> *) -> TyFun [k] [k] -> *) (Scanl1Sym1 k)

type Apply [k] [k] (Scanl1Sym1 k l1) l0 = Scanl1Sym2 k l1 l0

type Scanl1Sym2 t t = Scanl1 t t

data ScanrSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k k -> *) -> *) (TyFun k (TyFun [k] [k] -> *) -> *) -> *) (ScanrSym0 k k)

type Apply (TyFun k1 (TyFun [k] [k1] -> *) -> *) (TyFun k (TyFun k1 k1 -> *) -> *) (ScanrSym0 k k1) l0 = ScanrSym1 k k1 l0

data ScanrSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k k -> *) -> *) -> TyFun k (TyFun [k] [k] -> *) -> *) (ScanrSym1 k k)

type Apply (TyFun [k1] [k] -> *) k (ScanrSym1 k1 k l1) l0 = ScanrSym2 k1 k l1 l0

data ScanrSym2 l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k k -> *) -> *) -> k -> TyFun [k] [k] -> *) (ScanrSym2 k k)

type Apply [k1] [k] (ScanrSym2 k k1 l1 l2) l0 = ScanrSym3 k k1 l1 l2 l0

type ScanrSym3 t t t = Scanr t t t

data Scanr1Sym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k k -> *) -> *) (TyFun [k] [k] -> *) -> *) (Scanr1Sym0 k)

type Apply (TyFun [k] [k] -> *) (TyFun k (TyFun k k -> *) -> *) (Scanr1Sym0 k) l0 = Scanr1Sym1 k l0

data Scanr1Sym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k k -> *) -> *) -> TyFun [k] [k] -> *) (Scanr1Sym1 k)

type Apply [k] [k] (Scanr1Sym1 k l1) l0 = Scanr1Sym2 k l1 l0

type Scanr1Sym2 t t = Scanr1 t t

data MapAccumLSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k ((,) k k) -> *) -> *) (TyFun k (TyFun [k] ((,) k [k]) -> *) -> *) -> *) (MapAccumLSym0 k k k)

type Apply (TyFun k (TyFun [k1] ((,) k [k2]) -> *) -> *) (TyFun k (TyFun k1 ((,) k k2) -> *) -> *) (MapAccumLSym0 k k1 k2) l0 = MapAccumLSym1 k k1 k2 l0

data MapAccumLSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k ((,) k k) -> *) -> *) -> TyFun k (TyFun [k] ((,) k [k]) -> *) -> *) (MapAccumLSym1 k k k)

type Apply (TyFun [k1] ((,) k [k2]) -> *) k (MapAccumLSym1 k k1 k2 l1) l0 = MapAccumLSym2 k k1 k2 l1 l0

data MapAccumLSym2 l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k ((,) k k) -> *) -> *) -> k -> TyFun [k] ((,) k [k]) -> *) (MapAccumLSym2 k k k)

type Apply ((,) k [k2]) [k1] (MapAccumLSym2 k k1 k2 l1 l2) l0 = MapAccumLSym3 k k1 k2 l1 l2 l0

type MapAccumLSym3 t t t = MapAccumL t t t

data MapAccumRSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k ((,) k k) -> *) -> *) (TyFun k (TyFun [k] ((,) k [k]) -> *) -> *) -> *) (MapAccumRSym0 k k k)

type Apply (TyFun k (TyFun [k1] ((,) k [k2]) -> *) -> *) (TyFun k (TyFun k1 ((,) k k2) -> *) -> *) (MapAccumRSym0 k k1 k2) l0 = MapAccumRSym1 k k1 k2 l0

data MapAccumRSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k ((,) k k) -> *) -> *) -> TyFun k (TyFun [k] ((,) k [k]) -> *) -> *) (MapAccumRSym1 k k k)

type Apply (TyFun [k1] ((,) k [k2]) -> *) k (MapAccumRSym1 k k1 k2 l1) l0 = MapAccumRSym2 k k1 k2 l1 l0

data MapAccumRSym2 l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k ((,) k k) -> *) -> *) -> k -> TyFun [k] ((,) k [k]) -> *) (MapAccumRSym2 k k k)

type Apply ((,) k [k2]) [k1] (MapAccumRSym2 k k1 k2 l1 l2) l0 = MapAccumRSym3 k k1 k2 l1 l2 l0

type MapAccumRSym3 t t t = MapAccumR t t t

data UnfoldrSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (Maybe ((,) k k)) -> *) (TyFun k [k] -> *) -> *) (UnfoldrSym0 k k)

type Apply (TyFun k [k1] -> *) (TyFun k (Maybe ((,) k1 k)) -> *) (UnfoldrSym0 k k1) l0 = UnfoldrSym1 k k1 l0

data UnfoldrSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (Maybe ((,) k k)) -> *) -> TyFun k [k] -> *) (UnfoldrSym1 k k)

type Apply [k1] k (UnfoldrSym1 k k1 l1) l0 = UnfoldrSym2 k k1 l1 l0

type UnfoldrSym2 t t = Unfoldr t t

data InitsSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] [[k]] -> *) (InitsSym0 k)

type Apply [[k]] [k] (InitsSym0 k) l0 = InitsSym1 k l0

type InitsSym1 t = Inits t

data TailsSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] [[k]] -> *) (TailsSym0 k)

type Apply [[k]] [k] (TailsSym0 k) l0 = TailsSym1 k l0

type TailsSym1 t = Tails t

data IsPrefixOfSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] (TyFun [k] Bool -> *) -> *) (IsPrefixOfSym0 k)

type Apply (TyFun [k] Bool -> *) [k] (IsPrefixOfSym0 k) l0 = IsPrefixOfSym1 k l0

data IsPrefixOfSym1 l l

Instances

SuppressUnusedWarnings ([k] -> TyFun [k] Bool -> *) (IsPrefixOfSym1 k)

type Apply Bool [k] (IsPrefixOfSym1 k l1) l0 = IsPrefixOfSym2 k l1 l0

type IsPrefixOfSym2 t t = IsPrefixOf t t

data IsSuffixOfSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] (TyFun [k] Bool -> *) -> *) (IsSuffixOfSym0 k)

type Apply (TyFun [k] Bool -> *) [k] (IsSuffixOfSym0 k) l0 = IsSuffixOfSym1 k l0

data IsSuffixOfSym1 l l

Instances

SuppressUnusedWarnings ([k] -> TyFun [k] Bool -> *) (IsSuffixOfSym1 k)

type Apply Bool [k] (IsSuffixOfSym1 k l1) l0 = IsSuffixOfSym2 k l1 l0

type IsSuffixOfSym2 t t = IsSuffixOf t t

data IsInfixOfSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] (TyFun [k] Bool -> *) -> *) (IsInfixOfSym0 k)

type Apply (TyFun [k] Bool -> *) [k] (IsInfixOfSym0 k) l0 = IsInfixOfSym1 k l0

data IsInfixOfSym1 l l

Instances

SuppressUnusedWarnings ([k] -> TyFun [k] Bool -> *) (IsInfixOfSym1 k)

type Apply Bool [k] (IsInfixOfSym1 k l1) l0 = IsInfixOfSym2 k l1 l0

type IsInfixOfSym2 t t = IsInfixOf t t

data ElemSym0 l

Instances

SuppressUnusedWarnings (TyFun k (TyFun [k] Bool -> *) -> *) (ElemSym0 k)

type Apply (TyFun [k] Bool -> *) k (ElemSym0 k) l0 = ElemSym1 k l0

data ElemSym1 l l

Instances

SuppressUnusedWarnings (k -> TyFun [k] Bool -> *) (ElemSym1 k)

type Apply Bool [k] (ElemSym1 k l1) l0 = ElemSym2 k l1 l0

type ElemSym2 t t = Elem t t

data NotElemSym0 l

Instances

SuppressUnusedWarnings (TyFun k (TyFun [k] Bool -> *) -> *) (NotElemSym0 k)

type Apply (TyFun [k] Bool -> *) k (NotElemSym0 k) l0 = NotElemSym1 k l0

data NotElemSym1 l l

Instances

SuppressUnusedWarnings (k -> TyFun [k] Bool -> *) (NotElemSym1 k)

type Apply Bool [k] (NotElemSym1 k l1) l0 = NotElemSym2 k l1 l0

type NotElemSym2 t t = NotElem t t

data ZipSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] (TyFun [k] [(,) k k] -> *) -> *) (ZipSym0 k k)

type Apply (TyFun [k1] [(,) k k1] -> *) [k] (ZipSym0 k k1) l0 = ZipSym1 k k1 l0

data ZipSym1 l l

Instances

SuppressUnusedWarnings ([k] -> TyFun [k] [(,) k k] -> *) (ZipSym1 k k)

type Apply [(,) k1 k] [k] (ZipSym1 k1 k l1) l0 = ZipSym2 k1 k l1 l0

type ZipSym2 t t = Zip t t

data Zip3Sym0 l

Instances

SuppressUnusedWarnings (TyFun [k] (TyFun [k] (TyFun [k] [(,,) k k k] -> *) -> *) -> *) (Zip3Sym0 k k k)

type Apply (TyFun [k1] (TyFun [k2] [(,,) k k1 k2] -> *) -> *) [k] (Zip3Sym0 k k1 k2) l0 = Zip3Sym1 k k1 k2 l0

data Zip3Sym1 l l

Instances

SuppressUnusedWarnings ([k] -> TyFun [k] (TyFun [k] [(,,) k k k] -> *) -> *) (Zip3Sym1 k k k)

type Apply (TyFun [k1] [(,,) k2 k k1] -> *) [k] (Zip3Sym1 k2 k k1 l1) l0 = Zip3Sym2 k2 k k1 l1 l0

data Zip3Sym2 l l l

Instances

SuppressUnusedWarnings ([k] -> [k] -> TyFun [k] [(,,) k k k] -> *) (Zip3Sym2 k k k)

type Apply [(,,) k1 k2 k] [k] (Zip3Sym2 k1 k2 k l1 l2) l0 = Zip3Sym3 k1 k2 k l1 l2 l0

type Zip3Sym3 t t t = Zip3 t t t

data ZipWithSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k k -> *) -> *) (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) (ZipWithSym0 k k k)

type Apply (TyFun [k] (TyFun [k1] [k2] -> *) -> *) (TyFun k (TyFun k1 k2 -> *) -> *) (ZipWithSym0 k k1 k2) l0 = ZipWithSym1 k k1 k2 l0

data ZipWithSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k k -> *) -> *) -> TyFun [k] (TyFun [k] [k] -> *) -> *) (ZipWithSym1 k k k)

type Apply (TyFun [k1] [k2] -> *) [k] (ZipWithSym1 k k1 k2 l1) l0 = ZipWithSym2 k k1 k2 l1 l0

data ZipWithSym2 l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k k -> *) -> *) -> [k] -> TyFun [k] [k] -> *) (ZipWithSym2 k k k)

type Apply [k2] [k1] (ZipWithSym2 k k1 k2 l1 l2) l0 = ZipWithSym3 k k1 k2 l1 l2 l0

type ZipWithSym3 t t t = ZipWith t t t

data ZipWith3Sym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) (TyFun [k] (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) -> *) (ZipWith3Sym0 k k k k)

type Apply (TyFun [k] (TyFun [k1] (TyFun [k2] [k3] -> *) -> *) -> *) (TyFun k (TyFun k1 (TyFun k2 k3 -> *) -> *) -> *) (ZipWith3Sym0 k k1 k2 k3) l0 = ZipWith3Sym1 k k1 k2 k3 l0

data ZipWith3Sym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> TyFun [k] (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) (ZipWith3Sym1 k k k k)

type Apply (TyFun [k1] (TyFun [k2] [k3] -> *) -> *) [k] (ZipWith3Sym1 k k1 k2 k3 l1) l0 = ZipWith3Sym2 k k1 k2 k3 l1 l0

data ZipWith3Sym2 l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> [k] -> TyFun [k] (TyFun [k] [k] -> *) -> *) (ZipWith3Sym2 k k k k)

type Apply (TyFun [k2] [k3] -> *) [k1] (ZipWith3Sym2 k k1 k2 k3 l1 l2) l0 = ZipWith3Sym3 k k1 k2 k3 l1 l2 l0

data ZipWith3Sym3 l l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> [k] -> [k] -> TyFun [k] [k] -> *) (ZipWith3Sym3 k k k k)

type Apply [k3] [k2] (ZipWith3Sym3 k k1 k2 k3 l1 l2 l3) l0

data UnzipSym0 l

Instances

SuppressUnusedWarnings (TyFun [(,) k k] ((,) [k] [k]) -> *) (UnzipSym0 k k)

type Apply ((,) [k] [k1]) [(,) k k1] (UnzipSym0 k k1) l0 = UnzipSym1 k k1 l0

type UnzipSym1 t = Unzip t

data Unzip3Sym0 l

Instances

SuppressUnusedWarnings (TyFun [(,,) k k k] ((,,) [k] [k] [k]) -> *) (Unzip3Sym0 k k k)

type Apply ((,,) [k] [k1] [k2]) [(,,) k k1 k2] (Unzip3Sym0 k k1 k2) l0 = Unzip3Sym1 k k1 k2 l0

type Unzip3Sym1 t = Unzip3 t

data Unzip4Sym0 l

Instances

SuppressUnusedWarnings (TyFun [(,,,) k k k k] ((,,,) [k] [k] [k] [k]) -> *) (Unzip4Sym0 k k k k)

type Apply ((,,,) [k] [k1] [k2] [k3]) [(,,,) k k1 k2 k3] (Unzip4Sym0 k k1 k2 k3) l0 = Unzip4Sym1 k k1 k2 k3 l0

type Unzip4Sym1 t = Unzip4 t

data Unzip5Sym0 l

Instances

SuppressUnusedWarnings (TyFun [(,,,,) k k k k k] ((,,,,) [k] [k] [k] [k] [k]) -> *) (Unzip5Sym0 k k k k k)

type Apply ((,,,,) [k] [k1] [k2] [k3] [k4]) [(,,,,) k k1 k2 k3 k4] (Unzip5Sym0 k k1 k2 k3 k4) l0 = Unzip5Sym1 k k1 k2 k3 k4 l0

type Unzip5Sym1 t = Unzip5 t

data Unzip6Sym0 l

Instances

SuppressUnusedWarnings (TyFun [(,,,,,) k k k k k k] ((,,,,,) [k] [k] [k] [k] [k] [k]) -> *) (Unzip6Sym0 k k k k k k)

type Apply ((,,,,,) [k] [k1] [k2] [k3] [k4] [k5]) [(,,,,,) k k1 k2 k3 k4 k5] (Unzip6Sym0 k k1 k2 k3 k4 k5) l0 = Unzip6Sym1 k k1 k2 k3 k4 k5 l0

type Unzip6Sym1 t = Unzip6 t

data Unzip7Sym0 l

Instances

SuppressUnusedWarnings (TyFun [(,,,,,,) k k k k k k k] ((,,,,,,) [k] [k] [k] [k] [k] [k] [k]) -> *) (Unzip7Sym0 k k k k k k k)

type Apply ((,,,,,,) [k] [k1] [k2] [k3] [k4] [k5] [k6]) [(,,,,,,) k k1 k2 k3 k4 k5 k6] (Unzip7Sym0 k k1 k2 k3 k4 k5 k6) l0 = Unzip7Sym1 k k1 k2 k3 k4 k5 k6 l0

type Unzip7Sym1 t = Unzip7 t

data DeleteSym0 l

Instances

SuppressUnusedWarnings (TyFun k (TyFun [k] [k] -> *) -> *) (DeleteSym0 k)

type Apply (TyFun [k] [k] -> *) k (DeleteSym0 k) l0 = DeleteSym1 k l0

data DeleteSym1 l l

Instances

SuppressUnusedWarnings (k -> TyFun [k] [k] -> *) (DeleteSym1 k)

type Apply [k] [k] (DeleteSym1 k l1) l0 = DeleteSym2 k l1 l0

type DeleteSym2 t t = Delete t t

data (:\\$) l

Instances

SuppressUnusedWarnings (TyFun [k] (TyFun [k] [k] -> *) -> *) ((:\\$) k)

type Apply (TyFun [k] [k] -> *) [k] ((:\\$) k) l0 = (:\\$$) k l0

data l :\\$$ l

Instances

SuppressUnusedWarnings ([k] -> TyFun [k] [k] -> *) ((:\\$$) k)

type Apply [k] [k] ((:\\$$) k l1) l0 = (:\\$$$) k l1 l0

type (:\\$$$) t t = (:\\) t t

data IntersectSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] (TyFun [k] [k] -> *) -> *) (IntersectSym0 k)

type Apply (TyFun [k] [k] -> *) [k] (IntersectSym0 k) l0 = IntersectSym1 k l0

data IntersectSym1 l l

Instances

SuppressUnusedWarnings ([k] -> TyFun [k] [k] -> *) (IntersectSym1 k)

type Apply [k] [k] (IntersectSym1 k l1) l0 = IntersectSym2 k l1 l0

type IntersectSym2 t t = Intersect t t

data InsertSym0 l

Instances

SuppressUnusedWarnings (TyFun k (TyFun [k] [k] -> *) -> *) (InsertSym0 k)

type Apply (TyFun [k] [k] -> *) k (InsertSym0 k) l0 = InsertSym1 k l0

data InsertSym1 l l

Instances

SuppressUnusedWarnings (k -> TyFun [k] [k] -> *) (InsertSym1 k)

type Apply [k] [k] (InsertSym1 k l1) l0 = InsertSym2 k l1 l0

type InsertSym2 t t = Insert t t

data SortSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] [k] -> *) (SortSym0 k)

type Apply [k] [k] (SortSym0 k) l0 = SortSym1 k l0

type SortSym1 t = Sort t

data DeleteBySym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k Bool -> *) -> *) (TyFun k (TyFun [k] [k] -> *) -> *) -> *) (DeleteBySym0 k)

type Apply (TyFun k (TyFun [k] [k] -> *) -> *) (TyFun k (TyFun k Bool -> *) -> *) (DeleteBySym0 k) l0 = DeleteBySym1 k l0

data DeleteBySym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k Bool -> *) -> *) -> TyFun k (TyFun [k] [k] -> *) -> *) (DeleteBySym1 k)

type Apply (TyFun [k] [k] -> *) k (DeleteBySym1 k l1) l0 = DeleteBySym2 k l1 l0

data DeleteBySym2 l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k Bool -> *) -> *) -> k -> TyFun [k] [k] -> *) (DeleteBySym2 k)

type Apply [k] [k] (DeleteBySym2 k l1 l2) l0 = DeleteBySym3 k l1 l2 l0

type DeleteBySym3 t t t = DeleteBy t t t

data DeleteFirstsBySym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k Bool -> *) -> *) (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) (DeleteFirstsBySym0 k)

type Apply (TyFun [k] (TyFun [k] [k] -> *) -> *) (TyFun k (TyFun k Bool -> *) -> *) (DeleteFirstsBySym0 k) l0 = DeleteFirstsBySym1 k l0

data DeleteFirstsBySym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k Bool -> *) -> *) -> TyFun [k] (TyFun [k] [k] -> *) -> *) (DeleteFirstsBySym1 k)

type Apply (TyFun [k] [k] -> *) [k] (DeleteFirstsBySym1 k l1) l0 = DeleteFirstsBySym2 k l1 l0

data DeleteFirstsBySym2 l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k Bool -> *) -> *) -> [k] -> TyFun [k] [k] -> *) (DeleteFirstsBySym2 k)

type Apply [k] [k] (DeleteFirstsBySym2 k l1 l2) l0 = DeleteFirstsBySym3 k l1 l2 l0

type DeleteFirstsBySym3 t t t = DeleteFirstsBy t t t

data IntersectBySym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k Bool -> *) -> *) (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) (IntersectBySym0 k)

type Apply (TyFun [k] (TyFun [k] [k] -> *) -> *) (TyFun k (TyFun k Bool -> *) -> *) (IntersectBySym0 k) l0 = IntersectBySym1 k l0

data IntersectBySym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k Bool -> *) -> *) -> TyFun [k] (TyFun [k] [k] -> *) -> *) (IntersectBySym1 k)

type Apply (TyFun [k] [k] -> *) [k] (IntersectBySym1 k l1) l0 = IntersectBySym2 k l1 l0

data IntersectBySym2 l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k Bool -> *) -> *) -> [k] -> TyFun [k] [k] -> *) (IntersectBySym2 k)

type Apply [k] [k] (IntersectBySym2 k l1 l2) l0

data SortBySym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k Ordering -> *) -> *) (TyFun [k] [k] -> *) -> *) (SortBySym0 k)

type Apply (TyFun [k] [k] -> *) (TyFun k (TyFun k Ordering -> *) -> *) (SortBySym0 k) l0 = SortBySym1 k l0

data SortBySym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k Ordering -> *) -> *) -> TyFun [k] [k] -> *) (SortBySym1 k)

type Apply [k] [k] (SortBySym1 k l1) l0 = SortBySym2 k l1 l0

type SortBySym2 t t = SortBy t t

data InsertBySym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k Ordering -> *) -> *) (TyFun k (TyFun [k] [k] -> *) -> *) -> *) (InsertBySym0 k)

type Apply (TyFun k (TyFun [k] [k] -> *) -> *) (TyFun k (TyFun k Ordering -> *) -> *) (InsertBySym0 k) l0 = InsertBySym1 k l0

data InsertBySym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k Ordering -> *) -> *) -> TyFun k (TyFun [k] [k] -> *) -> *) (InsertBySym1 k)

type Apply (TyFun [k] [k] -> *) k (InsertBySym1 k l1) l0 = InsertBySym2 k l1 l0

data InsertBySym2 l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k Ordering -> *) -> *) -> k -> TyFun [k] [k] -> *) (InsertBySym2 k)

type Apply [k] [k] (InsertBySym2 k l1 l2) l0 = InsertBySym3 k l1 l2 l0

type InsertBySym3 t t t = InsertBy t t t

data MaximumBySym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k Ordering -> *) -> *) (TyFun [k] k -> *) -> *) (MaximumBySym0 k)

type Apply (TyFun [k] k -> *) (TyFun k (TyFun k Ordering -> *) -> *) (MaximumBySym0 k) l0 = MaximumBySym1 k l0

data MaximumBySym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k Ordering -> *) -> *) -> TyFun [k] k -> *) (MaximumBySym1 k)

type Apply k [k] (MaximumBySym1 k l1) l0 = MaximumBySym2 k l1 l0

type MaximumBySym2 t t = MaximumBy t t

data MinimumBySym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k Ordering -> *) -> *) (TyFun [k] k -> *) -> *) (MinimumBySym0 k)

type Apply (TyFun [k] k -> *) (TyFun k (TyFun k Ordering -> *) -> *) (MinimumBySym0 k) l0 = MinimumBySym1 k l0

data MinimumBySym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k Ordering -> *) -> *) -> TyFun [k] k -> *) (MinimumBySym1 k)

type Apply k [k] (MinimumBySym1 k l1) l0 = MinimumBySym2 k l1 l0

type MinimumBySym2 t t = MinimumBy t t

data LengthSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] Nat -> *) (LengthSym0 k)

type Apply Nat [k] (LengthSym0 k) l0 = LengthSym1 k l0

type LengthSym1 t = Length t

data SumSym0 l

Instances

SuppressUnusedWarnings (TyFun [Nat] Nat -> *) SumSym0

type Apply Nat [Nat] SumSym0 l0 = SumSym1 l0

type SumSym1 t = Sum t

data ProductSym0 l

Instances

SuppressUnusedWarnings (TyFun [Nat] Nat -> *) ProductSym0

type Apply Nat [Nat] ProductSym0 l0 = ProductSym1 l0

type ProductSym1 t = Product t

data ReplicateSym0 l

Instances

SuppressUnusedWarnings (TyFun Nat (TyFun k [k] -> *) -> *) (ReplicateSym0 k)

type Apply (TyFun k [k] -> *) Nat (ReplicateSym0 k) l0 = ReplicateSym1 k l0

data ReplicateSym1 l l

Instances

SuppressUnusedWarnings (Nat -> TyFun k [k] -> *) (ReplicateSym1 k)

type Apply [k] k (ReplicateSym1 k l1) l0 = ReplicateSym2 k l1 l0

type ReplicateSym2 t t = Replicate t t

data TransposeSym0 l

Instances

SuppressUnusedWarnings (TyFun [[k]] [[k]] -> *) (TransposeSym0 k)

type Apply [[k]] [[k]] (TransposeSym0 k) l0 = TransposeSym1 k l0

type TransposeSym1 t = Transpose t

data TakeSym0 l

Instances

SuppressUnusedWarnings (TyFun Nat (TyFun [k] [k] -> *) -> *) (TakeSym0 k)

type Apply (TyFun [k] [k] -> *) Nat (TakeSym0 k) l0 = TakeSym1 k l0

data TakeSym1 l l

Instances

SuppressUnusedWarnings (Nat -> TyFun [k] [k] -> *) (TakeSym1 k)

type Apply [k] [k] (TakeSym1 k l1) l0 = TakeSym2 k l1 l0

type TakeSym2 t t = Take t t

data DropSym0 l

Instances

SuppressUnusedWarnings (TyFun Nat (TyFun [k] [k] -> *) -> *) (DropSym0 k)

type Apply (TyFun [k] [k] -> *) Nat (DropSym0 k) l0 = DropSym1 k l0

data DropSym1 l l

Instances

SuppressUnusedWarnings (Nat -> TyFun [k] [k] -> *) (DropSym1 k)

type Apply [k] [k] (DropSym1 k l1) l0 = DropSym2 k l1 l0

type DropSym2 t t = Drop t t

data SplitAtSym0 l

Instances

SuppressUnusedWarnings (TyFun Nat (TyFun [k] ((,) [k] [k]) -> *) -> *) (SplitAtSym0 k)

type Apply (TyFun [k] ((,) [k] [k]) -> *) Nat (SplitAtSym0 k) l0 = SplitAtSym1 k l0

data SplitAtSym1 l l

Instances

SuppressUnusedWarnings (Nat -> TyFun [k] ((,) [k] [k]) -> *) (SplitAtSym1 k)

type Apply ((,) [k] [k]) [k] (SplitAtSym1 k l1) l0 = SplitAtSym2 k l1 l0

type SplitAtSym2 t t = SplitAt t t

data TakeWhileSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k Bool -> *) (TyFun [k] [k] -> *) -> *) (TakeWhileSym0 k)

type Apply (TyFun [k] [k] -> *) (TyFun k Bool -> *) (TakeWhileSym0 k) l0 = TakeWhileSym1 k l0

data TakeWhileSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k Bool -> *) -> TyFun [k] [k] -> *) (TakeWhileSym1 k)

type Apply [k] [k] (TakeWhileSym1 k l1) l0 = TakeWhileSym2 k l1 l0

type TakeWhileSym2 t t = TakeWhile t t

data DropWhileSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k Bool -> *) (TyFun [k] [k] -> *) -> *) (DropWhileSym0 k)

type Apply (TyFun [k] [k] -> *) (TyFun k Bool -> *) (DropWhileSym0 k) l0 = DropWhileSym1 k l0

data DropWhileSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k Bool -> *) -> TyFun [k] [k] -> *) (DropWhileSym1 k)

type Apply [k] [k] (DropWhileSym1 k l1) l0 = DropWhileSym2 k l1 l0

type DropWhileSym2 t t = DropWhile t t

data DropWhileEndSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k Bool -> *) (TyFun [k] [k] -> *) -> *) (DropWhileEndSym0 k)

type Apply (TyFun [k] [k] -> *) (TyFun k Bool -> *) (DropWhileEndSym0 k) l0 = DropWhileEndSym1 k l0

data DropWhileEndSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k Bool -> *) -> TyFun [k] [k] -> *) (DropWhileEndSym1 k)

type Apply [k] [k] (DropWhileEndSym1 k l1) l0 = DropWhileEndSym2 k l1 l0

type DropWhileEndSym2 t t = DropWhileEnd t t

data SpanSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k Bool -> *) (TyFun [k] ((,) [k] [k]) -> *) -> *) (SpanSym0 k)

type Apply (TyFun [k] ((,) [k] [k]) -> *) (TyFun k Bool -> *) (SpanSym0 k) l0 = SpanSym1 k l0

data SpanSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k Bool -> *) -> TyFun [k] ((,) [k] [k]) -> *) (SpanSym1 k)

type Apply ((,) [k] [k]) [k] (SpanSym1 k l1) l0 = SpanSym2 k l1 l0

type SpanSym2 t t = Span t t

data BreakSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k Bool -> *) (TyFun [k] ((,) [k] [k]) -> *) -> *) (BreakSym0 k)

type Apply (TyFun [k] ((,) [k] [k]) -> *) (TyFun k Bool -> *) (BreakSym0 k) l0 = BreakSym1 k l0

data BreakSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k Bool -> *) -> TyFun [k] ((,) [k] [k]) -> *) (BreakSym1 k)

type Apply ((,) [k] [k]) [k] (BreakSym1 k l1) l0 = BreakSym2 k l1 l0

type BreakSym2 t t = Break t t

data StripPrefixSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] (TyFun [k] (Maybe [k]) -> *) -> *) (StripPrefixSym0 k)

type Apply (TyFun [k] (Maybe [k]) -> *) [k] (StripPrefixSym0 k) l0 = StripPrefixSym1 k l0

data StripPrefixSym1 l l

Instances

SuppressUnusedWarnings ([k] -> TyFun [k] (Maybe [k]) -> *) (StripPrefixSym1 k)

type Apply (Maybe [k]) [k] (StripPrefixSym1 k l1) l0

data MaximumSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] k -> *) (MaximumSym0 k)

type Apply k [k] (MaximumSym0 k) l0 = MaximumSym1 k l0

type MaximumSym1 t = Maximum t

data MinimumSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] k -> *) (MinimumSym0 k)

type Apply k [k] (MinimumSym0 k) l0 = MinimumSym1 k l0

type MinimumSym1 t = Minimum t

data GroupSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] [[k]] -> *) (GroupSym0 k)

type Apply [[k]] [k] (GroupSym0 k) l0 = GroupSym1 k l0

type GroupSym1 t = Group t

data GroupBySym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k Bool -> *) -> *) (TyFun [k] [[k]] -> *) -> *) (GroupBySym0 k)

type Apply (TyFun [k] [[k]] -> *) (TyFun k (TyFun k Bool -> *) -> *) (GroupBySym0 k) l0 = GroupBySym1 k l0

data GroupBySym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k Bool -> *) -> *) -> TyFun [k] [[k]] -> *) (GroupBySym1 k)

type Apply [[k]] [k] (GroupBySym1 k l1) l0 = GroupBySym2 k l1 l0

type GroupBySym2 t t = GroupBy t t

data LookupSym0 l

Instances

SuppressUnusedWarnings (TyFun k (TyFun [(,) k k] (Maybe k) -> *) -> *) (LookupSym0 k k)

type Apply (TyFun [(,) k k1] (Maybe k1) -> *) k (LookupSym0 k k1) l0 = LookupSym1 k k1 l0

data LookupSym1 l l

Instances

SuppressUnusedWarnings (k -> TyFun [(,) k k] (Maybe k) -> *) (LookupSym1 k k)

type Apply (Maybe k) [(,) k1 k] (LookupSym1 k1 k l1) l0 = LookupSym2 k1 k l1 l0

type LookupSym2 t t = Lookup t t

data FindSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k Bool -> *) (TyFun [k] (Maybe k) -> *) -> *) (FindSym0 k)

type Apply (TyFun [k] (Maybe k) -> *) (TyFun k Bool -> *) (FindSym0 k) l0 = FindSym1 k l0

data FindSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k Bool -> *) -> TyFun [k] (Maybe k) -> *) (FindSym1 k)

type Apply (Maybe k) [k] (FindSym1 k l1) l0 = FindSym2 k l1 l0

type FindSym2 t t = Find t t

data FilterSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k Bool -> *) (TyFun [k] [k] -> *) -> *) (FilterSym0 k)

type Apply (TyFun [k] [k] -> *) (TyFun k Bool -> *) (FilterSym0 k) l0 = FilterSym1 k l0

data FilterSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k Bool -> *) -> TyFun [k] [k] -> *) (FilterSym1 k)

type Apply [k] [k] (FilterSym1 k l1) l0 = FilterSym2 k l1 l0

type FilterSym2 t t = Filter t t

data PartitionSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k Bool -> *) (TyFun [k] ((,) [k] [k]) -> *) -> *) (PartitionSym0 k)

type Apply (TyFun [k] ((,) [k] [k]) -> *) (TyFun k Bool -> *) (PartitionSym0 k) l0 = PartitionSym1 k l0

data PartitionSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k Bool -> *) -> TyFun [k] ((,) [k] [k]) -> *) (PartitionSym1 k)

type Apply ((,) [k] [k]) [k] (PartitionSym1 k l1) l0 = PartitionSym2 k l1 l0

type PartitionSym2 t t = Partition t t

data (:!!$) l

Instances

SuppressUnusedWarnings (TyFun [k] (TyFun Nat k -> *) -> *) ((:!!$) k)

type Apply (TyFun Nat k -> *) [k] ((:!!$) k) l0 = (:!!$$) k l0

data l :!!$$ l

Instances

SuppressUnusedWarnings ([k] -> TyFun Nat k -> *) ((:!!$$) k)

type Apply k Nat ((:!!$$) k l1) l0 = (:!!$$$) k l1 l0

type (:!!$$$) t t = (:!!) t t

data ElemIndexSym0 l

Instances

SuppressUnusedWarnings (TyFun k (TyFun [k] (Maybe Nat) -> *) -> *) (ElemIndexSym0 k)

type Apply (TyFun [k] (Maybe Nat) -> *) k (ElemIndexSym0 k) l0 = ElemIndexSym1 k l0

data ElemIndexSym1 l l

Instances

SuppressUnusedWarnings (k -> TyFun [k] (Maybe Nat) -> *) (ElemIndexSym1 k)

type Apply (Maybe Nat) [k] (ElemIndexSym1 k l1) l0 = ElemIndexSym2 k l1 l0

type ElemIndexSym2 t t = ElemIndex t t

data ElemIndicesSym0 l

Instances

SuppressUnusedWarnings (TyFun k (TyFun [k] [Nat] -> *) -> *) (ElemIndicesSym0 k)

type Apply (TyFun [k] [Nat] -> *) k (ElemIndicesSym0 k) l0 = ElemIndicesSym1 k l0

data ElemIndicesSym1 l l

Instances

SuppressUnusedWarnings (k -> TyFun [k] [Nat] -> *) (ElemIndicesSym1 k)

type Apply [Nat] [k] (ElemIndicesSym1 k l1) l0 = ElemIndicesSym2 k l1 l0

type ElemIndicesSym2 t t = ElemIndices t t

data FindIndexSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k Bool -> *) (TyFun [k] (Maybe Nat) -> *) -> *) (FindIndexSym0 k)

type Apply (TyFun [k] (Maybe Nat) -> *) (TyFun k Bool -> *) (FindIndexSym0 k) l0 = FindIndexSym1 k l0

data FindIndexSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k Bool -> *) -> TyFun [k] (Maybe Nat) -> *) (FindIndexSym1 k)

type Apply (Maybe Nat) [k] (FindIndexSym1 k l1) l0 = FindIndexSym2 k l1 l0

type FindIndexSym2 t t = FindIndex t t

data FindIndicesSym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k Bool -> *) (TyFun [k] [Nat] -> *) -> *) (FindIndicesSym0 k)

type Apply (TyFun [k] [Nat] -> *) (TyFun k Bool -> *) (FindIndicesSym0 k) l0 = FindIndicesSym1 k l0

data FindIndicesSym1 l l

Instances

SuppressUnusedWarnings ((TyFun k Bool -> *) -> TyFun [k] [Nat] -> *) (FindIndicesSym1 k)

type Apply [Nat] [k] (FindIndicesSym1 k l1) l0 = FindIndicesSym2 k l1 l0

type FindIndicesSym2 t t = FindIndices t t

data Zip4Sym0 l

Instances

SuppressUnusedWarnings (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [(,,,) k k k k] -> *) -> *) -> *) -> *) (Zip4Sym0 k k k k)

type Apply (TyFun [k1] (TyFun [k2] (TyFun [k3] [(,,,) k k1 k2 k3] -> *) -> *) -> *) [k] (Zip4Sym0 k k1 k2 k3) l0 = Zip4Sym1 k k1 k2 k3 l0

data Zip4Sym1 l l

Instances

SuppressUnusedWarnings ([k] -> TyFun [k] (TyFun [k] (TyFun [k] [(,,,) k k k k] -> *) -> *) -> *) (Zip4Sym1 k k k k)

type Apply (TyFun [k1] (TyFun [k2] [(,,,) k3 k k1 k2] -> *) -> *) [k] (Zip4Sym1 k3 k k1 k2 l1) l0 = Zip4Sym2 k3 k k1 k2 l1 l0

data Zip4Sym2 l l l

Instances

SuppressUnusedWarnings ([k] -> [k] -> TyFun [k] (TyFun [k] [(,,,) k k k k] -> *) -> *) (Zip4Sym2 k k k k)

type Apply (TyFun [k1] [(,,,) k2 k3 k k1] -> *) [k] (Zip4Sym2 k2 k3 k k1 l1 l2) l0 = Zip4Sym3 k2 k3 k k1 l1 l2 l0

data Zip4Sym3 l l l l

Instances

SuppressUnusedWarnings ([k] -> [k] -> [k] -> TyFun [k] [(,,,) k k k k] -> *) (Zip4Sym3 k k k k)

type Apply [(,,,) k1 k2 k3 k] [k] (Zip4Sym3 k1 k2 k3 k l1 l2 l3) l0 = Zip4Sym4 k1 k2 k3 k l1 l2 l3 l0

type Zip4Sym4 t t t t = Zip4 t t t t

data Zip5Sym0 l

Instances

SuppressUnusedWarnings (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [(,,,,) k k k k k] -> *) -> *) -> *) -> *) -> *) (Zip5Sym0 k k k k k)

type Apply (TyFun [k1] (TyFun [k2] (TyFun [k3] (TyFun [k4] [(,,,,) k k1 k2 k3 k4] -> *) -> *) -> *) -> *) [k] (Zip5Sym0 k k1 k2 k3 k4) l0 = Zip5Sym1 k k1 k2 k3 k4 l0

data Zip5Sym1 l l

Instances

SuppressUnusedWarnings ([k] -> TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [(,,,,) k k k k k] -> *) -> *) -> *) -> *) (Zip5Sym1 k k k k k)

type Apply (TyFun [k1] (TyFun [k2] (TyFun [k3] [(,,,,) k4 k k1 k2 k3] -> *) -> *) -> *) [k] (Zip5Sym1 k4 k k1 k2 k3 l1) l0 = Zip5Sym2 k4 k k1 k2 k3 l1 l0

data Zip5Sym2 l l l

Instances

SuppressUnusedWarnings ([k] -> [k] -> TyFun [k] (TyFun [k] (TyFun [k] [(,,,,) k k k k k] -> *) -> *) -> *) (Zip5Sym2 k k k k k)

type Apply (TyFun [k1] (TyFun [k2] [(,,,,) k3 k4 k k1 k2] -> *) -> *) [k] (Zip5Sym2 k3 k4 k k1 k2 l1 l2) l0 = Zip5Sym3 k3 k4 k k1 k2 l1 l2 l0

data Zip5Sym3 l l l l

Instances

SuppressUnusedWarnings ([k] -> [k] -> [k] -> TyFun [k] (TyFun [k] [(,,,,) k k k k k] -> *) -> *) (Zip5Sym3 k k k k k)

type Apply (TyFun [k1] [(,,,,) k2 k3 k4 k k1] -> *) [k] (Zip5Sym3 k2 k3 k4 k k1 l1 l2 l3) l0 = Zip5Sym4 k2 k3 k4 k k1 l1 l2 l3 l0

data Zip5Sym4 l l l l l

Instances

SuppressUnusedWarnings ([k] -> [k] -> [k] -> [k] -> TyFun [k] [(,,,,) k k k k k] -> *) (Zip5Sym4 k k k k k)

type Apply [(,,,,) k1 k2 k3 k4 k] [k] (Zip5Sym4 k1 k2 k3 k4 k l1 l2 l3 l4) l0 = Zip5Sym5 k1 k2 k3 k4 k l1 l2 l3 l4 l0

type Zip5Sym5 t t t t t = Zip5 t t t t t

data Zip6Sym0 l

Instances

SuppressUnusedWarnings (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [(,,,,,) k k k k k k] -> *) -> *) -> *) -> *) -> *) -> *) (Zip6Sym0 k k k k k k)

type Apply (TyFun [k1] (TyFun [k2] (TyFun [k3] (TyFun [k4] (TyFun [k5] [(,,,,,) k k1 k2 k3 k4 k5] -> *) -> *) -> *) -> *) -> *) [k] (Zip6Sym0 k k1 k2 k3 k4 k5) l0 = Zip6Sym1 k k1 k2 k3 k4 k5 l0

data Zip6Sym1 l l

Instances

SuppressUnusedWarnings ([k] -> TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [(,,,,,) k k k k k k] -> *) -> *) -> *) -> *) -> *) (Zip6Sym1 k k k k k k)

type Apply (TyFun [k1] (TyFun [k2] (TyFun [k3] (TyFun [k4] [(,,,,,) k5 k k1 k2 k3 k4] -> *) -> *) -> *) -> *) [k] (Zip6Sym1 k5 k k1 k2 k3 k4 l1) l0 = Zip6Sym2 k5 k k1 k2 k3 k4 l1 l0

data Zip6Sym2 l l l

Instances

SuppressUnusedWarnings ([k] -> [k] -> TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [(,,,,,) k k k k k k] -> *) -> *) -> *) -> *) (Zip6Sym2 k k k k k k)

type Apply (TyFun [k1] (TyFun [k2] (TyFun [k3] [(,,,,,) k4 k5 k k1 k2 k3] -> *) -> *) -> *) [k] (Zip6Sym2 k4 k5 k k1 k2 k3 l1 l2) l0 = Zip6Sym3 k4 k5 k k1 k2 k3 l1 l2 l0

data Zip6Sym3 l l l l

Instances

SuppressUnusedWarnings ([k] -> [k] -> [k] -> TyFun [k] (TyFun [k] (TyFun [k] [(,,,,,) k k k k k k] -> *) -> *) -> *) (Zip6Sym3 k k k k k k)

type Apply (TyFun [k1] (TyFun [k2] [(,,,,,) k3 k4 k5 k k1 k2] -> *) -> *) [k] (Zip6Sym3 k3 k4 k5 k k1 k2 l1 l2 l3) l0 = Zip6Sym4 k3 k4 k5 k k1 k2 l1 l2 l3 l0

data Zip6Sym4 l l l l l

Instances

SuppressUnusedWarnings ([k] -> [k] -> [k] -> [k] -> TyFun [k] (TyFun [k] [(,,,,,) k k k k k k] -> *) -> *) (Zip6Sym4 k k k k k k)

type Apply (TyFun [k1] [(,,,,,) k2 k3 k4 k5 k k1] -> *) [k] (Zip6Sym4 k2 k3 k4 k5 k k1 l1 l2 l3 l4) l0 = Zip6Sym5 k2 k3 k4 k5 k k1 l1 l2 l3 l4 l0

data Zip6Sym5 l l l l l l

Instances

SuppressUnusedWarnings ([k] -> [k] -> [k] -> [k] -> [k] -> TyFun [k] [(,,,,,) k k k k k k] -> *) (Zip6Sym5 k k k k k k)

type Apply [(,,,,,) k1 k2 k3 k4 k5 k] [k] (Zip6Sym5 k1 k2 k3 k4 k5 k l1 l2 l3 l4 l5) l0 = Zip6Sym6 k1 k2 k3 k4 k5 k l1 l2 l3 l4 l5 l0

type Zip6Sym6 t t t t t t = Zip6 t t t t t t

data Zip7Sym0 l

Instances

SuppressUnusedWarnings (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [(,,,,,,) k k k k k k k] -> *) -> *) -> *) -> *) -> *) -> *) -> *) (Zip7Sym0 k k k k k k k)

type Apply (TyFun [k1] (TyFun [k2] (TyFun [k3] (TyFun [k4] (TyFun [k5] (TyFun [k6] [(,,,,,,) k k1 k2 k3 k4 k5 k6] -> *) -> *) -> *) -> *) -> *) -> *) [k] (Zip7Sym0 k k1 k2 k3 k4 k5 k6) l0 = Zip7Sym1 k k1 k2 k3 k4 k5 k6 l0

data Zip7Sym1 l l

Instances

SuppressUnusedWarnings ([k] -> TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [(,,,,,,) k k k k k k k] -> *) -> *) -> *) -> *) -> *) -> *) (Zip7Sym1 k k k k k k k)

type Apply (TyFun [k1] (TyFun [k2] (TyFun [k3] (TyFun [k4] (TyFun [k5] [(,,,,,,) k6 k k1 k2 k3 k4 k5] -> *) -> *) -> *) -> *) -> *) [k] (Zip7Sym1 k6 k k1 k2 k3 k4 k5 l1) l0 = Zip7Sym2 k6 k k1 k2 k3 k4 k5 l1 l0

data Zip7Sym2 l l l

Instances

SuppressUnusedWarnings ([k] -> [k] -> TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [(,,,,,,) k k k k k k k] -> *) -> *) -> *) -> *) -> *) (Zip7Sym2 k k k k k k k)

type Apply (TyFun [k1] (TyFun [k2] (TyFun [k3] (TyFun [k4] [(,,,,,,) k5 k6 k k1 k2 k3 k4] -> *) -> *) -> *) -> *) [k] (Zip7Sym2 k5 k6 k k1 k2 k3 k4 l1 l2) l0 = Zip7Sym3 k5 k6 k k1 k2 k3 k4 l1 l2 l0

data Zip7Sym3 l l l l

Instances

SuppressUnusedWarnings ([k] -> [k] -> [k] -> TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [(,,,,,,) k k k k k k k] -> *) -> *) -> *) -> *) (Zip7Sym3 k k k k k k k)

type Apply (TyFun [k1] (TyFun [k2] (TyFun [k3] [(,,,,,,) k4 k5 k6 k k1 k2 k3] -> *) -> *) -> *) [k] (Zip7Sym3 k4 k5 k6 k k1 k2 k3 l1 l2 l3) l0 = Zip7Sym4 k4 k5 k6 k k1 k2 k3 l1 l2 l3 l0

data Zip7Sym4 l l l l l

Instances

SuppressUnusedWarnings ([k] -> [k] -> [k] -> [k] -> TyFun [k] (TyFun [k] (TyFun [k] [(,,,,,,) k k k k k k k] -> *) -> *) -> *) (Zip7Sym4 k k k k k k k)

type Apply (TyFun [k1] (TyFun [k2] [(,,,,,,) k3 k4 k5 k6 k k1 k2] -> *) -> *) [k] (Zip7Sym4 k3 k4 k5 k6 k k1 k2 l1 l2 l3 l4) l0 = Zip7Sym5 k3 k4 k5 k6 k k1 k2 l1 l2 l3 l4 l0

data Zip7Sym5 l l l l l l

Instances

SuppressUnusedWarnings ([k] -> [k] -> [k] -> [k] -> [k] -> TyFun [k] (TyFun [k] [(,,,,,,) k k k k k k k] -> *) -> *) (Zip7Sym5 k k k k k k k)

type Apply (TyFun [k1] [(,,,,,,) k2 k3 k4 k5 k6 k k1] -> *) [k] (Zip7Sym5 k2 k3 k4 k5 k6 k k1 l1 l2 l3 l4 l5) l0 = Zip7Sym6 k2 k3 k4 k5 k6 k k1 l1 l2 l3 l4 l5 l0

data Zip7Sym6 l l l l l l l

Instances

SuppressUnusedWarnings ([k] -> [k] -> [k] -> [k] -> [k] -> [k] -> TyFun [k] [(,,,,,,) k k k k k k k] -> *) (Zip7Sym6 k k k k k k k)

type Apply [(,,,,,,) k1 k2 k3 k4 k5 k6 k] [k] (Zip7Sym6 k1 k2 k3 k4 k5 k6 k l1 l2 l3 l4 l5 l6) l0 = Zip7Sym7 k1 k2 k3 k4 k5 k6 k l1 l2 l3 l4 l5 l6 l0

type Zip7Sym7 t t t t t t t = Zip7 t t t t t t t

data ZipWith4Sym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) -> *) -> *) (ZipWith4Sym0 k k k k k)

type Apply (TyFun [k] (TyFun [k1] (TyFun [k2] (TyFun [k3] [k4] -> *) -> *) -> *) -> *) (TyFun k (TyFun k1 (TyFun k2 (TyFun k3 k4 -> *) -> *) -> *) -> *) (ZipWith4Sym0 k k1 k2 k3 k4) l0 = ZipWith4Sym1 k k1 k2 k3 k4 l0

data ZipWith4Sym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) -> *) (ZipWith4Sym1 k k k k k)

type Apply (TyFun [k1] (TyFun [k2] (TyFun [k3] [k4] -> *) -> *) -> *) [k] (ZipWith4Sym1 k k1 k2 k3 k4 l1) l0 = ZipWith4Sym2 k k1 k2 k3 k4 l1 l0

data ZipWith4Sym2 l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> [k] -> TyFun [k] (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) (ZipWith4Sym2 k k k k k)

type Apply (TyFun [k2] (TyFun [k3] [k4] -> *) -> *) [k1] (ZipWith4Sym2 k k1 k2 k3 k4 l1 l2) l0 = ZipWith4Sym3 k k1 k2 k3 k4 l1 l2 l0

data ZipWith4Sym3 l l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> [k] -> [k] -> TyFun [k] (TyFun [k] [k] -> *) -> *) (ZipWith4Sym3 k k k k k)

type Apply (TyFun [k3] [k4] -> *) [k2] (ZipWith4Sym3 k k1 k2 k3 k4 l1 l2 l3) l0 = ZipWith4Sym4 k k1 k2 k3 k4 l1 l2 l3 l0

data ZipWith4Sym4 l l l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> [k] -> [k] -> [k] -> TyFun [k] [k] -> *) (ZipWith4Sym4 k k k k k)

type Apply [k4] [k3] (ZipWith4Sym4 k k1 k2 k3 k4 l1 l2 l3 l4) l0

data ZipWith5Sym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) -> *) -> *) -> *) (ZipWith5Sym0 k k k k k k)

type Apply (TyFun [k] (TyFun [k1] (TyFun [k2] (TyFun [k3] (TyFun [k4] [k5] -> *) -> *) -> *) -> *) -> *) (TyFun k (TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 k5 -> *) -> *) -> *) -> *) -> *) (ZipWith5Sym0 k k1 k2 k3 k4 k5) l0 = ZipWith5Sym1 k k1 k2 k3 k4 k5 l0

data ZipWith5Sym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) -> TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) -> *) -> *) (ZipWith5Sym1 k k k k k k)

type Apply (TyFun [k1] (TyFun [k2] (TyFun [k3] (TyFun [k4] [k5] -> *) -> *) -> *) -> *) [k] (ZipWith5Sym1 k k1 k2 k3 k4 k5 l1) l0 = ZipWith5Sym2 k k1 k2 k3 k4 k5 l1 l0

data ZipWith5Sym2 l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) -> [k] -> TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) -> *) (ZipWith5Sym2 k k k k k k)

type Apply (TyFun [k2] (TyFun [k3] (TyFun [k4] [k5] -> *) -> *) -> *) [k1] (ZipWith5Sym2 k k1 k2 k3 k4 k5 l1 l2) l0 = ZipWith5Sym3 k k1 k2 k3 k4 k5 l1 l2 l0

data ZipWith5Sym3 l l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) -> [k] -> [k] -> TyFun [k] (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) (ZipWith5Sym3 k k k k k k)

type Apply (TyFun [k3] (TyFun [k4] [k5] -> *) -> *) [k2] (ZipWith5Sym3 k k1 k2 k3 k4 k5 l1 l2 l3) l0 = ZipWith5Sym4 k k1 k2 k3 k4 k5 l1 l2 l3 l0

data ZipWith5Sym4 l l l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) -> [k] -> [k] -> [k] -> TyFun [k] (TyFun [k] [k] -> *) -> *) (ZipWith5Sym4 k k k k k k)

type Apply (TyFun [k4] [k5] -> *) [k3] (ZipWith5Sym4 k k1 k2 k3 k4 k5 l1 l2 l3 l4) l0 = ZipWith5Sym5 k k1 k2 k3 k4 k5 l1 l2 l3 l4 l0

data ZipWith5Sym5 l l l l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) -> [k] -> [k] -> [k] -> [k] -> TyFun [k] [k] -> *) (ZipWith5Sym5 k k k k k k)

type Apply [k5] [k4] (ZipWith5Sym5 k k1 k2 k3 k4 k5 l1 l2 l3 l4 l5) l0

data ZipWith6Sym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) -> *) (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) -> *) -> *) -> *) -> *) (ZipWith6Sym0 k k k k k k k)

type Apply (TyFun [k] (TyFun [k1] (TyFun [k2] (TyFun [k3] (TyFun [k4] (TyFun [k5] [k6] -> *) -> *) -> *) -> *) -> *) -> *) (TyFun k (TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 k6 -> *) -> *) -> *) -> *) -> *) -> *) (ZipWith6Sym0 k k1 k2 k3 k4 k5 k6) l0 = ZipWith6Sym1 k k1 k2 k3 k4 k5 k6 l0

data ZipWith6Sym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) -> *) -> TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) -> *) -> *) -> *) (ZipWith6Sym1 k k k k k k k)

type Apply (TyFun [k1] (TyFun [k2] (TyFun [k3] (TyFun [k4] (TyFun [k5] [k6] -> *) -> *) -> *) -> *) -> *) [k] (ZipWith6Sym1 k k1 k2 k3 k4 k5 k6 l1) l0 = ZipWith6Sym2 k k1 k2 k3 k4 k5 k6 l1 l0

data ZipWith6Sym2 l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) -> *) -> [k] -> TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) -> *) -> *) (ZipWith6Sym2 k k k k k k k)

type Apply (TyFun [k2] (TyFun [k3] (TyFun [k4] (TyFun [k5] [k6] -> *) -> *) -> *) -> *) [k1] (ZipWith6Sym2 k k1 k2 k3 k4 k5 k6 l1 l2) l0 = ZipWith6Sym3 k k1 k2 k3 k4 k5 k6 l1 l2 l0

data ZipWith6Sym3 l l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) -> *) -> [k] -> [k] -> TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) -> *) (ZipWith6Sym3 k k k k k k k)

type Apply (TyFun [k3] (TyFun [k4] (TyFun [k5] [k6] -> *) -> *) -> *) [k2] (ZipWith6Sym3 k k1 k2 k3 k4 k5 k6 l1 l2 l3) l0 = ZipWith6Sym4 k k1 k2 k3 k4 k5 k6 l1 l2 l3 l0

data ZipWith6Sym4 l l l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) -> *) -> [k] -> [k] -> [k] -> TyFun [k] (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) (ZipWith6Sym4 k k k k k k k)

type Apply (TyFun [k4] (TyFun [k5] [k6] -> *) -> *) [k3] (ZipWith6Sym4 k k1 k2 k3 k4 k5 k6 l1 l2 l3 l4) l0 = ZipWith6Sym5 k k1 k2 k3 k4 k5 k6 l1 l2 l3 l4 l0

data ZipWith6Sym5 l l l l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) -> *) -> [k] -> [k] -> [k] -> [k] -> TyFun [k] (TyFun [k] [k] -> *) -> *) (ZipWith6Sym5 k k k k k k k)

type Apply (TyFun [k5] [k6] -> *) [k4] (ZipWith6Sym5 k k1 k2 k3 k4 k5 k6 l1 l2 l3 l4 l5) l0 = ZipWith6Sym6 k k1 k2 k3 k4 k5 k6 l1 l2 l3 l4 l5 l0

data ZipWith6Sym6 l l l l l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) -> *) -> [k] -> [k] -> [k] -> [k] -> [k] -> TyFun [k] [k] -> *) (ZipWith6Sym6 k k k k k k k)

type Apply [k6] [k5] (ZipWith6Sym6 k k1 k2 k3 k4 k5 k6 l1 l2 l3 l4 l5 l6) l0

data ZipWith7Sym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) -> *) -> *) (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) -> *) -> *) -> *) -> *) -> *) (ZipWith7Sym0 k k k k k k k k)

type Apply (TyFun [k] (TyFun [k1] (TyFun [k2] (TyFun [k3] (TyFun [k4] (TyFun [k5] (TyFun [k6] [k7] -> *) -> *) -> *) -> *) -> *) -> *) -> *) (TyFun k (TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 (TyFun k6 k7 -> *) -> *) -> *) -> *) -> *) -> *) -> *) (ZipWith7Sym0 k k1 k2 k3 k4 k5 k6 k7) l0 = ZipWith7Sym1 k k1 k2 k3 k4 k5 k6 k7 l0

data ZipWith7Sym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) -> *) -> *) -> TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) -> *) -> *) -> *) -> *) (ZipWith7Sym1 k k k k k k k k)

type Apply (TyFun [k1] (TyFun [k2] (TyFun [k3] (TyFun [k4] (TyFun [k5] (TyFun [k6] [k7] -> *) -> *) -> *) -> *) -> *) -> *) [k] (ZipWith7Sym1 k k1 k2 k3 k4 k5 k6 k7 l1) l0 = ZipWith7Sym2 k k1 k2 k3 k4 k5 k6 k7 l1 l0

data ZipWith7Sym2 l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) -> *) -> *) -> [k] -> TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) -> *) -> *) -> *) (ZipWith7Sym2 k k k k k k k k)

type Apply (TyFun [k2] (TyFun [k3] (TyFun [k4] (TyFun [k5] (TyFun [k6] [k7] -> *) -> *) -> *) -> *) -> *) [k1] (ZipWith7Sym2 k k1 k2 k3 k4 k5 k6 k7 l1 l2) l0 = ZipWith7Sym3 k k1 k2 k3 k4 k5 k6 k7 l1 l2 l0

data ZipWith7Sym3 l l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) -> *) -> *) -> [k] -> [k] -> TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) -> *) -> *) (ZipWith7Sym3 k k k k k k k k)

type Apply (TyFun [k3] (TyFun [k4] (TyFun [k5] (TyFun [k6] [k7] -> *) -> *) -> *) -> *) [k2] (ZipWith7Sym3 k k1 k2 k3 k4 k5 k6 k7 l1 l2 l3) l0 = ZipWith7Sym4 k k1 k2 k3 k4 k5 k6 k7 l1 l2 l3 l0

data ZipWith7Sym4 l l l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) -> *) -> *) -> [k] -> [k] -> [k] -> TyFun [k] (TyFun [k] (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) -> *) (ZipWith7Sym4 k k k k k k k k)

type Apply (TyFun [k4] (TyFun [k5] (TyFun [k6] [k7] -> *) -> *) -> *) [k3] (ZipWith7Sym4 k k1 k2 k3 k4 k5 k6 k7 l1 l2 l3 l4) l0 = ZipWith7Sym5 k k1 k2 k3 k4 k5 k6 k7 l1 l2 l3 l4 l0

data ZipWith7Sym5 l l l l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) -> *) -> *) -> [k] -> [k] -> [k] -> [k] -> TyFun [k] (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) (ZipWith7Sym5 k k k k k k k k)

type Apply (TyFun [k5] (TyFun [k6] [k7] -> *) -> *) [k4] (ZipWith7Sym5 k k1 k2 k3 k4 k5 k6 k7 l1 l2 l3 l4 l5) l0 = ZipWith7Sym6 k k1 k2 k3 k4 k5 k6 k7 l1 l2 l3 l4 l5 l0

data ZipWith7Sym6 l l l l l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) -> *) -> *) -> [k] -> [k] -> [k] -> [k] -> [k] -> TyFun [k] (TyFun [k] [k] -> *) -> *) (ZipWith7Sym6 k k k k k k k k)

type Apply (TyFun [k6] [k7] -> *) [k5] (ZipWith7Sym6 k k1 k2 k3 k4 k5 k6 k7 l1 l2 l3 l4 l5 l6) l0 = ZipWith7Sym7 k k1 k2 k3 k4 k5 k6 k7 l1 l2 l3 l4 l5 l6 l0

data ZipWith7Sym7 l l l l l l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k (TyFun k k -> *) -> *) -> *) -> *) -> *) -> *) -> *) -> [k] -> [k] -> [k] -> [k] -> [k] -> [k] -> TyFun [k] [k] -> *) (ZipWith7Sym7 k k k k k k k k)

type Apply [k7] [k6] (ZipWith7Sym7 k k1 k2 k3 k4 k5 k6 k7 l1 l2 l3 l4 l5 l6 l7) l0

data NubSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] [k] -> *) (NubSym0 k)

type Apply [k] [k] (NubSym0 k) l0 = NubSym1 k l0

type NubSym1 t = Nub t

data NubBySym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k Bool -> *) -> *) (TyFun [k] [k] -> *) -> *) (NubBySym0 k)

type Apply (TyFun [k] [k] -> *) (TyFun k (TyFun k Bool -> *) -> *) (NubBySym0 k) l0 = NubBySym1 k l0

data NubBySym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k Bool -> *) -> *) -> TyFun [k] [k] -> *) (NubBySym1 k)

type Apply [k] [k] (NubBySym1 k l1) l0 = NubBySym2 k l1 l0

type NubBySym2 t t = NubBy t t

data UnionSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] (TyFun [k] [k] -> *) -> *) (UnionSym0 k)

type Apply (TyFun [k] [k] -> *) [k] (UnionSym0 k) l0 = UnionSym1 k l0

data UnionSym1 l l

Instances

SuppressUnusedWarnings ([k] -> TyFun [k] [k] -> *) (UnionSym1 k)

type Apply [k] [k] (UnionSym1 k l1) l0 = UnionSym2 k l1 l0

type UnionSym2 t t = Union t t

data UnionBySym0 l

Instances

SuppressUnusedWarnings (TyFun (TyFun k (TyFun k Bool -> *) -> *) (TyFun [k] (TyFun [k] [k] -> *) -> *) -> *) (UnionBySym0 k)

type Apply (TyFun [k] (TyFun [k] [k] -> *) -> *) (TyFun k (TyFun k Bool -> *) -> *) (UnionBySym0 k) l0 = UnionBySym1 k l0

data UnionBySym1 l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k Bool -> *) -> *) -> TyFun [k] (TyFun [k] [k] -> *) -> *) (UnionBySym1 k)

type Apply (TyFun [k] [k] -> *) [k] (UnionBySym1 k l1) l0 = UnionBySym2 k l1 l0

data UnionBySym2 l l l

Instances

SuppressUnusedWarnings ((TyFun k (TyFun k Bool -> *) -> *) -> [k] -> TyFun [k] [k] -> *) (UnionBySym2 k)

type Apply [k] [k] (UnionBySym2 k l1 l2) l0 = UnionBySym3 k l1 l2 l0

type UnionBySym3 t t t = UnionBy t t t

data GenericLengthSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] k -> *) (GenericLengthSym0 k k)

type Apply k [k1] (GenericLengthSym0 k1 k) l0 = GenericLengthSym1 k1 k l0

type GenericLengthSym1 t = GenericLength t

data GenericTakeSym0 l

Instances

SuppressUnusedWarnings (TyFun k (TyFun [k] [k] -> *) -> *) (GenericTakeSym0 k k)

type Apply (TyFun [k1] [k1] -> *) k (GenericTakeSym0 k k1) l0 = GenericTakeSym1 k k1 l0

data GenericTakeSym1 l l

Instances

SuppressUnusedWarnings (k -> TyFun [k] [k] -> *) (GenericTakeSym1 k k)

type Apply [k] [k] (GenericTakeSym1 k1 k l1) l0 = GenericTakeSym2 k1 k l1 l0

type GenericTakeSym2 t t = GenericTake t t

data GenericDropSym0 l

Instances

SuppressUnusedWarnings (TyFun k (TyFun [k] [k] -> *) -> *) (GenericDropSym0 k k)

type Apply (TyFun [k1] [k1] -> *) k (GenericDropSym0 k k1) l0 = GenericDropSym1 k k1 l0

data GenericDropSym1 l l

Instances

SuppressUnusedWarnings (k -> TyFun [k] [k] -> *) (GenericDropSym1 k k)

type Apply [k] [k] (GenericDropSym1 k1 k l1) l0 = GenericDropSym2 k1 k l1 l0

type GenericDropSym2 t t = GenericDrop t t

data GenericSplitAtSym0 l

Instances

SuppressUnusedWarnings (TyFun k (TyFun [k] ((,) [k] [k]) -> *) -> *) (GenericSplitAtSym0 k k)

type Apply (TyFun [k1] ((,) [k1] [k1]) -> *) k (GenericSplitAtSym0 k k1) l0 = GenericSplitAtSym1 k k1 l0

data GenericSplitAtSym1 l l

Instances

SuppressUnusedWarnings (k -> TyFun [k] ((,) [k] [k]) -> *) (GenericSplitAtSym1 k k)

type Apply ((,) [k] [k]) [k] (GenericSplitAtSym1 k1 k l1) l0 = GenericSplitAtSym2 k1 k l1 l0

type GenericSplitAtSym2 t t = GenericSplitAt t t

data GenericIndexSym0 l

Instances

SuppressUnusedWarnings (TyFun [k] (TyFun k k -> *) -> *) (GenericIndexSym0 k k)

type Apply (TyFun k1 k -> *) [k] (GenericIndexSym0 k k1) l0 = GenericIndexSym1 k k1 l0

data GenericIndexSym1 l l

Instances

SuppressUnusedWarnings ([k] -> TyFun k k -> *) (GenericIndexSym1 k k)

type Apply k1 k (GenericIndexSym1 k1 k l1) l0 = GenericIndexSym2 k1 k l1 l0

type GenericIndexSym2 t t = GenericIndex t t

data GenericReplicateSym0 l

Instances

SuppressUnusedWarnings (TyFun k (TyFun k [k] -> *) -> *) (GenericReplicateSym0 k k)

type Apply (TyFun k1 [k1] -> *) k (GenericReplicateSym0 k k1) l0 = GenericReplicateSym1 k k1 l0

data GenericReplicateSym1 l l

Instances

SuppressUnusedWarnings (k -> TyFun k [k] -> *) (GenericReplicateSym1 k k)

type Apply [k] k (GenericReplicateSym1 k1 k l1) l0 = GenericReplicateSym2 k1 k l1 l0

type GenericReplicateSym2 t t = GenericReplicate t t