Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Uses of recursion schemes that use Haskell’s built-in recursion in a total manner.
Synopsis
- newtype Fix f = Fix {}
- distCofreeT :: (Functor f, Functor h) => DistributiveLaw (->) f h -> DistributiveLaw (->) f (Cofree h)
Documentation
A fixed-point constructor that uses Haskell's built-in recursion. This is lazy/corecursive.
distCofreeT :: (Functor f, Functor h) => DistributiveLaw (->) f h -> DistributiveLaw (->) f (Cofree h) Source #
Orphan instances
Recursive ((->) :: Type -> Type -> Type) Natural Maybe Source # | |
Corecursive ((->) :: Type -> Type -> Type) ([a] :: Type) (XNor a :: Type -> Type) Source # | |
Corecursive ((->) :: Type -> Type -> Type) (NonEmpty a :: Type) (AndMaybe a :: Type -> Type) Source # | |
Functor f => Corecursive ((->) :: Type -> Type -> Type) (Cofree f a :: Type) (EnvT a f :: Type -> Type) Source # | |
Functor f => Corecursive ((->) :: Type -> Type -> Type) (Free f a :: Type) (FreeF f a :: Type -> Type) Source # | |