Type Members

1.  type :<[F[_], A] = Cofree[F, A]
2.  abstract type Cofree[F[_], A]

   A very basic cofree comonad.

   A very basic cofree comonad.

   Implemented as an obscured alias:

   type Cofree[F[_], A] = (A, F[Cofree[F, A]])

   The companion object can be used to translate between representations.

3.  abstract type EnvT[E, W[_], A]

   A very basic environment monad transformer

   A very basic environment monad transformer

   Implemented as an obscured alias:

   type EnvT[E, W[_], A] = (E, W[A])

   The companion object can be used to translate between representations.

4.  abstract type Fix[F[_]]

   A fix point function for types.

   A fix point function for types.

   Implemented as an obscured alias:

   type Fix[F[_]] = F[Fix[F]]

   The companion object can be used to translate between representations.

5.  abstract type Free[F[_], A]

   A very basic free monad.

   A very basic free monad.

   Implemented as an obscured alias:

   type Free[F[_], A] = Either[A, F[Free[F, A]]]

   The companion object can be used to translate between representations.

6.  sealed abstract class Mu[F[_]] extends ~>[[β$0$]GAlgebra[β$0$, F, β$0$], Id] with Serializable

   Mu is the least fixed point of a functor F.

   Mu is the least fixed point of a functor F. It is a computation that can consume a inductive noninfinite structure in one go.

   In Haskell this can more aptly be expressed as: data Mu f = Mu (forall x . (f x -> x) -> x)

7.  sealed abstract class Nu[F[_]] extends Serializable

   Nu is the greatest fixed point of a functor F.

   Nu is the greatest fixed point of a functor F. It is a computation that can generate a coinductive infinite structure on demand.

   In Haskell this can more aptly be expressed as: data Nu g = forall s . Nu (s -> g s) s