Modulefcf-containers-0.8.2Haskell2010

Fcf.Data.List.Utils

Some of the following methods would probably have better place at the first-class-families library. That is, polish and make a PR.

Example2 expressions

>>> import qualified GHC.TypeLits as TL>>> import           Fcf.Data.Nat

datadata Foldl (c :: b -> a -> Exp b) (d :: b) (e :: t a) (f :: b)

Foldl in terms of Foldr.

Example1 expression

>>> :kind! Eval (Foldl (Fcf.-) 10 '[3,2,1])Eval (Foldl (Fcf.-) 10 '[3,2,1]) :: TL.Natural= 4

Instances1Eval

type Eval (Foldl f b ta) = Eval (Foldr (Flip f) b (Eval (Reverse ta)))Defined in fcf-containers-0.8.2 · Fcf.Data.List.Utils

datadata MaybeToList (b :: Maybe a) (c :: [a])

Turn Maybe into a list.

Example1 expression

>>> :kind! Eval (MaybeToList ('Just 1))Eval (MaybeToList ('Just 1)) :: [TL.Natural]= '[1]

Instances2Eval

type Eval (MaybeToList 'Nothing) = '[]Defined in fcf-containers-0.8.2 · Fcf.Data.List.Utils
type Eval (MaybeToList ('Just a)) = '[a]Defined in fcf-containers-0.8.2 · Fcf.Data.List.Utils