defun-sop 0.1.0.1 → 0.1.0.2
raw patch · 1 files changed
+8/−7 lines, 1 filesdep −basePVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependencies removed: base
API changes (from Hackage documentation)
- Data.SOP.NP.DeFun: append :: NP a xs -> NP a ys -> NP a (Append xs ys)
+ Data.SOP.NP.DeFun: append :: forall {a1} (a2 :: a1 -> Type) (xs :: [a1]) (ys :: [a1]). NP a2 xs -> NP a2 ys -> NP a2 (Append xs ys)
- Data.SOP.NP.DeFun: appendSym :: Lam2 (NP a) (NP a) (NP a) AppendSym
+ Data.SOP.NP.DeFun: appendSym :: forall {k} (a :: k -> Type). Lam2 (NP a) (NP a) (NP a) (AppendSym :: FunKind [k] ([k] ~> [k]) -> Type)
- Data.SOP.NP.DeFun: appendSym1 :: NP a xs -> Lam (NP a) (NP a) (AppendSym1 xs)
+ Data.SOP.NP.DeFun: appendSym1 :: forall {a1} (a2 :: a1 -> Type) (xs :: [a1]). NP a2 xs -> Lam (NP a2) (NP a2) (AppendSym1 xs)
- Data.SOP.NP.DeFun: concat :: NP (NP a) xss -> NP a (Concat xss)
+ Data.SOP.NP.DeFun: concat :: forall {a1} (a2 :: a1 -> Type) (xss :: [[a1]]). NP (NP a2) xss -> NP a2 (Concat xss)
- Data.SOP.NP.DeFun: concatMap :: Lam a (NP b) f -> NP a xs -> NP b (ConcatMap f xs)
+ Data.SOP.NP.DeFun: concatMap :: forall {a1} {b1} (a2 :: a1 -> Type) (b2 :: b1 -> Type) (f :: a1 ~> [b1]) (xs :: [a1]). Lam a2 (NP b2) f -> NP a2 xs -> NP b2 (ConcatMap f xs)
- Data.SOP.NP.DeFun: concatMapSym :: Lam2 (a :~> NP b) (NP a) (NP b) ConcatMapSym
+ Data.SOP.NP.DeFun: concatMapSym :: forall {k1} {k2} (a :: k1 -> Type) (b :: k2 -> Type). Lam2 (a :~> NP b) (NP a) (NP b) (ConcatMapSym :: FunKind (k1 ~> [k2]) ([k1] ~> [k2]) -> Type)
- Data.SOP.NP.DeFun: concatMapSym1 :: Lam a (NP b) f -> Lam (NP a) (NP b) (ConcatMapSym1 f)
+ Data.SOP.NP.DeFun: concatMapSym1 :: forall {a1} {b1} (a2 :: a1 -> Type) (b2 :: b1 -> Type) (f :: a1 ~> [b1]). Lam a2 (NP b2) f -> Lam (NP a2) (NP b2) (ConcatMapSym1 f)
- Data.SOP.NP.DeFun: concatSym :: Lam (NP (NP a)) (NP a) ConcatSym
+ Data.SOP.NP.DeFun: concatSym :: forall {k} (a :: k -> Type). Lam (NP (NP a)) (NP a) (ConcatSym :: FunKind [[k]] [k] -> Type)
- Data.SOP.NP.DeFun: data () => AppendSym (xs :: FunKind [a] [a] ~> [a])
+ Data.SOP.NP.DeFun: data AppendSym (xs :: FunKind [a] [a] ~> [a])
- Data.SOP.NP.DeFun: data () => AppendSym1 (xs :: [a]) (ys :: FunKind [a] [a])
+ Data.SOP.NP.DeFun: data AppendSym1 (xs :: [a]) (ys :: FunKind [a] [a])
- Data.SOP.NP.DeFun: data () => ConcatMapSym (f :: FunKind a ~> [b] [a] ~> [b])
+ Data.SOP.NP.DeFun: data ConcatMapSym (f :: FunKind a ~> [b] [a] ~> [b])
- Data.SOP.NP.DeFun: data () => ConcatMapSym1 (f :: a ~> [b]) (xs :: FunKind [a] [b])
+ Data.SOP.NP.DeFun: data ConcatMapSym1 (f :: a ~> [b]) (xs :: FunKind [a] [b])
- Data.SOP.NP.DeFun: data () => ConcatSym (xss :: FunKind [[a]] [a])
+ Data.SOP.NP.DeFun: data ConcatSym (xss :: FunKind [[a]] [a])
- Data.SOP.NP.DeFun: data () => FoldlSym (f :: FunKind b ~> a ~> b b ~> [a] ~> b)
+ Data.SOP.NP.DeFun: data FoldlSym (f :: FunKind b ~> a ~> b b ~> [a] ~> b)
- Data.SOP.NP.DeFun: data () => FoldlSym1 (f :: b ~> a ~> b) (z :: FunKind b [a] ~> b)
+ Data.SOP.NP.DeFun: data FoldlSym1 (f :: b ~> a ~> b) (z :: FunKind b [a] ~> b)
- Data.SOP.NP.DeFun: data () => FoldlSym2 (f :: b ~> a ~> b) (z :: b) (xs :: FunKind [a] b)
+ Data.SOP.NP.DeFun: data FoldlSym2 (f :: b ~> a ~> b) (z :: b) (xs :: FunKind [a] b)
- Data.SOP.NP.DeFun: data () => FoldrSym (f :: FunKind a ~> b ~> b b ~> [a] ~> b)
+ Data.SOP.NP.DeFun: data FoldrSym (f :: FunKind a ~> b ~> b b ~> [a] ~> b)
- Data.SOP.NP.DeFun: data () => FoldrSym1 (f :: a ~> b ~> b) (z :: FunKind b [a] ~> b)
+ Data.SOP.NP.DeFun: data FoldrSym1 (f :: a ~> b ~> b) (z :: FunKind b [a] ~> b)
- Data.SOP.NP.DeFun: data () => FoldrSym2 (f :: a ~> b ~> b) (z :: b) (xs :: FunKind [a] b)
+ Data.SOP.NP.DeFun: data FoldrSym2 (f :: a ~> b ~> b) (z :: b) (xs :: FunKind [a] b)
- Data.SOP.NP.DeFun: data () => Map2Sym (f :: FunKind a ~> b ~> c [a] ~> [b] ~> [c])
+ Data.SOP.NP.DeFun: data Map2Sym (f :: FunKind a ~> b ~> c [a] ~> [b] ~> [c])
- Data.SOP.NP.DeFun: data () => Map2Sym1 (f :: a ~> b ~> c) (xs :: FunKind [a] [b] ~> [c])
+ Data.SOP.NP.DeFun: data Map2Sym1 (f :: a ~> b ~> c) (xs :: FunKind [a] [b] ~> [c])
- Data.SOP.NP.DeFun: data () => Map2Sym2 (f :: a ~> b ~> c) (xs :: [a]) (ys :: FunKind [b] [c])
+ Data.SOP.NP.DeFun: data Map2Sym2 (f :: a ~> b ~> c) (xs :: [a]) (ys :: FunKind [b] [c])
- Data.SOP.NP.DeFun: data () => MapSym (f :: FunKind a ~> b [a] ~> [b])
+ Data.SOP.NP.DeFun: data MapSym (f :: FunKind a ~> b [a] ~> [b])
- Data.SOP.NP.DeFun: data () => MapSym1 (f :: a ~> b) (xs :: FunKind [a] [b])
+ Data.SOP.NP.DeFun: data MapSym1 (f :: a ~> b) (xs :: FunKind [a] [b])
- Data.SOP.NP.DeFun: data () => ReverseSym (xs :: FunKind [a] [a])
+ Data.SOP.NP.DeFun: data ReverseSym (xs :: FunKind [a] [a])
- Data.SOP.NP.DeFun: data () => SequenceSym (xss :: FunKind [[a]] [[a]])
+ Data.SOP.NP.DeFun: data SequenceSym (xss :: FunKind [[a]] [[a]])
- Data.SOP.NP.DeFun: data () => ZipWithSym (f :: FunKind a ~> b ~> c [a] ~> [b] ~> [c])
+ Data.SOP.NP.DeFun: data ZipWithSym (f :: FunKind a ~> b ~> c [a] ~> [b] ~> [c])
- Data.SOP.NP.DeFun: data () => ZipWithSym1 (f :: a ~> b ~> c) (xs :: FunKind [a] [b] ~> [c])
+ Data.SOP.NP.DeFun: data ZipWithSym1 (f :: a ~> b ~> c) (xs :: FunKind [a] [b] ~> [c])
- Data.SOP.NP.DeFun: data () => ZipWithSym2 (f :: a ~> b ~> c) (xs :: [a]) (ys :: FunKind [b] [c])
+ Data.SOP.NP.DeFun: data ZipWithSym2 (f :: a ~> b ~> c) (xs :: [a]) (ys :: FunKind [b] [c])
- Data.SOP.NP.DeFun: foldl :: Lam2 b a b f -> b x -> NP a ys -> b (Foldl f x ys)
+ Data.SOP.NP.DeFun: foldl :: forall {b1} {a1} b2 (a2 :: a1 -> Type) (f :: b1 ~> (a1 ~> b1)) (x :: b1) (ys :: [a1]). Lam2 b2 a2 b2 f -> b2 x -> NP a2 ys -> b2 (Foldl f x ys)
- Data.SOP.NP.DeFun: foldlSym :: Lam3 (b :~> (a :~> b)) b (NP a) b FoldlSym
+ Data.SOP.NP.DeFun: foldlSym :: forall {b1} {k} (b2 :: b1 -> Type) (a :: k -> Type). Lam3 (b2 :~> (a :~> b2)) b2 (NP a) b2 (FoldlSym :: FunKind (b1 ~> (k ~> b1)) (b1 ~> ([k] ~> b1)) -> Type)
- Data.SOP.NP.DeFun: foldlSym1 :: Lam2 b a b f -> Lam2 b (NP a) b (FoldlSym1 f)
+ Data.SOP.NP.DeFun: foldlSym1 :: forall {b1} {a1} (b2 :: b1 -> Type) (a2 :: a1 -> Type) (f :: b1 ~> (a1 ~> b1)). Lam2 b2 a2 b2 f -> Lam2 b2 (NP a2) b2 (FoldlSym1 f)
- Data.SOP.NP.DeFun: foldlSym2 :: Lam2 b a b f -> b x -> Lam (NP a) b (FoldlSym2 f x)
+ Data.SOP.NP.DeFun: foldlSym2 :: forall {b1} {a1} b2 (a2 :: a1 -> Type) (f :: b1 ~> (a1 ~> b1)) (x :: b1). Lam2 b2 a2 b2 f -> b2 x -> Lam (NP a2) b2 (FoldlSym2 f x)
- Data.SOP.NP.DeFun: foldr :: Lam2 a b b f -> b x -> NP a ys -> b (Foldr f x ys)
+ Data.SOP.NP.DeFun: foldr :: forall {a1} {b1} (a2 :: a1 -> Type) b2 (f :: a1 ~> (b1 ~> b1)) (x :: b1) (ys :: [a1]). Lam2 a2 b2 b2 f -> b2 x -> NP a2 ys -> b2 (Foldr f x ys)
- Data.SOP.NP.DeFun: foldrSym :: Lam3 (a :~> (b :~> b)) b (NP a) b FoldrSym
+ Data.SOP.NP.DeFun: foldrSym :: forall {k} {b1} (a :: k -> Type) (b2 :: b1 -> Type). Lam3 (a :~> (b2 :~> b2)) b2 (NP a) b2 (FoldrSym :: FunKind (k ~> (b1 ~> b1)) (b1 ~> ([k] ~> b1)) -> Type)
- Data.SOP.NP.DeFun: foldrSym1 :: Lam2 a b b f -> Lam2 b (NP a) b (FoldrSym1 f)
+ Data.SOP.NP.DeFun: foldrSym1 :: forall {a1} {b1} (a2 :: a1 -> Type) (b2 :: b1 -> Type) (f :: a1 ~> (b1 ~> b1)). Lam2 a2 b2 b2 f -> Lam2 b2 (NP a2) b2 (FoldrSym1 f)
- Data.SOP.NP.DeFun: foldrSym2 :: Lam2 a b b f -> b x -> Lam (NP a) b (FoldrSym2 f x)
+ Data.SOP.NP.DeFun: foldrSym2 :: forall {a1} {b1} (a2 :: a1 -> Type) b2 (f :: a1 ~> (b1 ~> b1)) (x :: b1). Lam2 a2 b2 b2 f -> b2 x -> Lam (NP a2) b2 (FoldrSym2 f x)
- Data.SOP.NP.DeFun: map :: Lam a b f -> NP a xs -> NP b (Map f xs)
+ Data.SOP.NP.DeFun: map :: forall {a1} {b1} (a2 :: a1 -> Type) (b2 :: b1 -> Type) (f :: a1 ~> b1) (xs :: [a1]). Lam a2 b2 f -> NP a2 xs -> NP b2 (Map f xs)
- Data.SOP.NP.DeFun: map2 :: Lam2 a b c f -> NP a xs -> NP b ys -> NP c (Map2 f xs ys)
+ Data.SOP.NP.DeFun: map2 :: forall {a1} {b1} {c1} (a2 :: a1 -> Type) (b2 :: b1 -> Type) (c2 :: c1 -> Type) (f :: a1 ~> (b1 ~> c1)) (xs :: [a1]) (ys :: [b1]). Lam2 a2 b2 c2 f -> NP a2 xs -> NP b2 ys -> NP c2 (Map2 f xs ys)
- Data.SOP.NP.DeFun: map2Sym :: Lam3 (a :~> (b :~> c)) (NP a) (NP b) (NP c) Map2Sym
+ Data.SOP.NP.DeFun: map2Sym :: forall {k1} {k2} {k3} (a :: k1 -> Type) (b :: k2 -> Type) (c :: k3 -> Type). Lam3 (a :~> (b :~> c)) (NP a) (NP b) (NP c) (Map2Sym :: FunKind (k1 ~> (k2 ~> k3)) ([k1] ~> ([k2] ~> [k3])) -> Type)
- Data.SOP.NP.DeFun: map2Sym1 :: Lam2 a b c f -> Lam2 (NP a) (NP b) (NP c) (Map2Sym1 f)
+ Data.SOP.NP.DeFun: map2Sym1 :: forall {a1} {b1} {c1} (a2 :: a1 -> Type) (b2 :: b1 -> Type) (c2 :: c1 -> Type) (f :: a1 ~> (b1 ~> c1)). Lam2 a2 b2 c2 f -> Lam2 (NP a2) (NP b2) (NP c2) (Map2Sym1 f)
- Data.SOP.NP.DeFun: map2Sym2 :: Lam2 a b c f -> NP a xs -> Lam (NP b) (NP c) (Map2Sym2 f xs)
+ Data.SOP.NP.DeFun: map2Sym2 :: forall {a1} {b1} {c1} (a2 :: a1 -> Type) (b2 :: b1 -> Type) (c2 :: c1 -> Type) (f :: a1 ~> (b1 ~> c1)) (xs :: [a1]). Lam2 a2 b2 c2 f -> NP a2 xs -> Lam (NP b2) (NP c2) (Map2Sym2 f xs)
- Data.SOP.NP.DeFun: mapSym :: Lam (a :~> b) (Lam (NP a) (NP b)) MapSym
+ Data.SOP.NP.DeFun: mapSym :: forall {k1} {k2} (a :: k1 -> Type) (b :: k2 -> Type). Lam (a :~> b) (Lam (NP a) (NP b)) (MapSym :: FunKind (k1 ~> k2) ([k1] ~> [k2]) -> Type)
- Data.SOP.NP.DeFun: mapSym1 :: Lam a b f -> Lam (NP a) (NP b) (MapSym1 f)
+ Data.SOP.NP.DeFun: mapSym1 :: forall {a1} {b1} (a2 :: a1 -> Type) (b2 :: b1 -> Type) (f :: a1 ~> b1). Lam a2 b2 f -> Lam (NP a2) (NP b2) (MapSym1 f)
- Data.SOP.NP.DeFun: reverse :: NP a xs -> NP a (Reverse xs)
+ Data.SOP.NP.DeFun: reverse :: forall {a1} (a2 :: a1 -> Type) (xs :: [a1]). NP a2 xs -> NP a2 (Reverse xs)
- Data.SOP.NP.DeFun: reverseSym :: Lam (NP a) (NP a) ReverseSym
+ Data.SOP.NP.DeFun: reverseSym :: forall {k} (a :: k -> Type). Lam (NP a) (NP a) (ReverseSym :: FunKind [k] [k] -> Type)
- Data.SOP.NP.DeFun: sequence :: NP (NP a) xss -> NP (NP a) (Sequence xss)
+ Data.SOP.NP.DeFun: sequence :: forall {a1} (a2 :: a1 -> Type) (xss :: [[a1]]). NP (NP a2) xss -> NP (NP a2) (Sequence xss)
- Data.SOP.NP.DeFun: sequenceSym :: Lam (NP (NP a)) (NP (NP a)) SequenceSym
+ Data.SOP.NP.DeFun: sequenceSym :: forall {k} (a :: k -> Type). Lam (NP (NP a)) (NP (NP a)) (SequenceSym :: FunKind [[k]] [[k]] -> Type)
- Data.SOP.NP.DeFun: zipWith :: Lam2 a b c f -> NP a xs -> NP b ys -> NP c (ZipWith f xs ys)
+ Data.SOP.NP.DeFun: zipWith :: forall {a1} {b1} {c1} (a2 :: a1 -> Type) (b2 :: b1 -> Type) (c2 :: c1 -> Type) (f :: a1 ~> (b1 ~> c1)) (xs :: [a1]) (ys :: [b1]). Lam2 a2 b2 c2 f -> NP a2 xs -> NP b2 ys -> NP c2 (ZipWith f xs ys)
- Data.SOP.NP.DeFun: zipWithSym :: Lam3 (a :~> (b :~> c)) (NP a) (NP b) (NP c) ZipWithSym
+ Data.SOP.NP.DeFun: zipWithSym :: forall {k1} {k2} {k3} (a :: k1 -> Type) (b :: k2 -> Type) (c :: k3 -> Type). Lam3 (a :~> (b :~> c)) (NP a) (NP b) (NP c) (ZipWithSym :: FunKind (k1 ~> (k2 ~> k3)) ([k1] ~> ([k2] ~> [k3])) -> Type)
- Data.SOP.NP.DeFun: zipWithSym1 :: Lam2 a b c f -> Lam2 (NP a) (NP b) (NP c) (ZipWithSym1 f)
+ Data.SOP.NP.DeFun: zipWithSym1 :: forall {a1} {b1} {c1} (a2 :: a1 -> Type) (b2 :: b1 -> Type) (c2 :: c1 -> Type) (f :: a1 ~> (b1 ~> c1)). Lam2 a2 b2 c2 f -> Lam2 (NP a2) (NP b2) (NP c2) (ZipWithSym1 f)
- Data.SOP.NP.DeFun: zipWithSym2 :: Lam2 a b c f -> NP a xs -> Lam (NP b) (NP c) (ZipWithSym2 f xs)
+ Data.SOP.NP.DeFun: zipWithSym2 :: forall {a1} {b1} {c1} (a2 :: a1 -> Type) (b2 :: b1 -> Type) (c2 :: c1 -> Type) (f :: a1 ~> (b1 ~> c1)) (xs :: [a1]). Lam2 a2 b2 c2 f -> NP a2 xs -> Lam (NP b2) (NP c2) (ZipWithSym2 f xs)
Files
- defun-sop.cabal +8/−7
defun-sop.cabal view
@@ -1,6 +1,6 @@ cabal-version: 2.4 name: defun-sop-version: 0.1.0.1+version: 0.1.0.2 license: BSD-3-Clause license-file: LICENSE author: Oleg Grenrus <oleg.grenrus@iki.fi>@@ -13,8 +13,9 @@ || ==9.4.8 || ==9.6.7 || ==9.8.4- || ==9.10.1+ || ==9.10.3 || ==9.12.2+ || ==9.14.1 synopsis: Defunctionalization helpers: lists description:@@ -46,12 +47,12 @@ ViewPatterns library- import: language- hs-source-dirs: src- exposed-modules: Data.SOP.NP.DeFun+ import: language+ hs-source-dirs: src+ exposed-modules: Data.SOP.NP.DeFun build-depends:- , base ^>=4.16.3.0 || ^>=4.17.2.0 || ^>=4.18.0.0 || ^>=4.19.0.0 || ^>=4.20.0.0 || ^>=4.21.0.0 , defun-core ^>=0.1 , sop-core ^>=0.5.0.2 - x-docspec-options: -XDataKinds -XGADTs -XStandaloneDeriving -XKindSignatures+ x-docspec-extra-packages: base+ x-docspec-options: -XDataKinds -XGADTs -XStandaloneDeriving -XKindSignatures