Yaya.Fold.Native

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

Documentation

newtype Fix f

A fixed-point constructor that uses Haskell's built-in recursion. This is lazy/corecursive.

Constructors

Fix

Fields

• unFix :: f (Fix f)

Instances

Functor f => Corecursive ((->) :: Type -> Type -> Type) (Fix f :: Type) (f :: Type -> Type)

Defined in Yaya.Fold.Native

Methods

ana :: forall (a :: k). Coalgebra (->) f a -> a -> Fix f

Projectable ((->) :: Type -> Type -> Type) (Fix f :: Type) (f :: Type -> Type)

Defined in Yaya.Fold.Native

Methods

project :: Coalgebra (->) f (Fix f)

Steppable ((->) :: Type -> Type -> Type) (Fix f :: Type) (f :: Type -> Type)

Defined in Yaya.Fold.Native

Methods

embed :: Algebra (->) f (Fix f)

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

Orphan instances

Recursive ((->) :: Type -> Type -> Type) Natural Maybe

Methods

cata :: forall (a :: k). Algebra (->) Maybe a -> Natural -> a

Corecursive ((->) :: Type -> Type -> Type) ([a] :: Type) (XNor a :: Type -> Type)

Methods

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

Corecursive ((->) :: Type -> Type -> Type) (NonEmpty a :: Type) (AndMaybe a :: Type -> Type)

Methods

ana :: forall (a0 :: k). Coalgebra (->) (AndMaybe a) a0 -> a0 -> NonEmpty a

Functor f => Corecursive ((->) :: Type -> Type -> Type) (Cofree f a :: Type) (EnvT a f :: Type -> Type)

Methods

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

Functor f => Corecursive ((->) :: Type -> Type -> Type) (Free f a :: Type) (FreeF f a :: Type -> Type)

Methods

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