Yaya.Fold.Native

Uses of recursion schemes that use Haskell’s built-in recursion in a total manner.

Documentation

newtype Fix f

Constructors

Fix

Fields

• unFix :: f (Fix f)

Instances

Functor f => Corecursive (Fix f) f

Defined in Yaya.Fold.Native

Methods

ana :: Coalgebra f a -> a -> Fix f

Steppable (Fix f) f

Defined in Yaya.Fold.Native

Methods

embed :: Algebra f (Fix f)

Projectable (Fix f) f

Defined in Yaya.Fold.Native

Methods

project :: Coalgebra f (Fix f)

distCofreeT :: (Functor f, Functor h) => DistributiveLaw f h -> DistributiveLaw f (Cofree h)

Orphan instances

Recursive Natural Maybe

Methods

cata :: Algebra Maybe a -> Natural -> a

Corecursive [a] (XNor a)

Methods

ana :: Coalgebra (XNor a) a0 -> a0 -> [a]

Corecursive (NonEmpty a) (AndMaybe a)

Methods

ana :: Coalgebra (AndMaybe a) a0 -> a0 -> NonEmpty a

Functor f => Corecursive (Cofree f a) (EnvT a f)

Methods

ana :: Coalgebra (EnvT a f) a0 -> a0 -> Cofree f a

Functor f => Corecursive (Free f a) (FreeF f a)

Methods

ana :: Coalgebra (FreeF f a) a0 -> a0 -> Free f a