package
data
Type Members
-
-
-
-
final
case class
Fix[F[_]](unFix: F[Fix[F]]) extends Product with Serializable
-
-
-
-
-
-
final
case class
Mu[F[_]](unMu: ~>[[β$1$](F[β$1$]) ⇒ β$1$, scalaz.Scalaz.Id]) extends Product with Serializable
-
sealed abstract
class
Nu[F[_]] extends AnyRef
-
Value Members
-
object
Fix extends Serializable
-
object
Mu extends Serializable
-
object
Nu
-
def
attributePara[T, F[_], A](f: GAlgebra[[β$0$](T, β$0$), F, A])(implicit arg0: Functor[F], T: Aux[T, F]): Algebra[F, Cofree[F, A]]
-
-
implicit
def
cofreeCorecursive[F[_], A]: Aux[Cofree[F, A], [γ$1$]EnvT[A, F, γ$1$]]
-
implicit
def
cofreeEqual[F[_]](implicit F: Delay[Equal, F]): Delay[Equal, [β$2$]Cofree[F, β$2$]]
-
implicit
def
cofreeRecursive[F[_], A]: Aux[Cofree[F, A], [γ$0$]EnvT[A, F, γ$0$]]
-
implicit
def
cofreeShow[F[_]](implicit F: Delay[Show, F]): Delay[Show, [β$4$]Cofree[F, β$4$]]
-
-
-
implicit
def
eitherCorecursive[A, B]: Aux[slamdata.Predef.Either[A, B], [β$1$]Const[Either[A, B], β$1$]]
-
implicit
def
eitherRecursive[A, B]: Aux[slamdata.Predef.Either[A, B], [β$0$]Const[Either[A, B], β$0$]]
-
-
implicit
def
freeCorecursive[F[_], A](implicit arg0: Functor[F]): Aux[Free[F, A], [γ$1$]CoEnv[A, F, γ$1$]]
-
implicit
def
freeEqual[F[_]](implicit arg0: Functor[F], F: Delay[Equal, F]): Delay[Equal, [β$3$]Free[F, β$3$]]
-
implicit
def
freeRecursive[F[_], A](implicit arg0: Functor[F]): Aux[Free[F, A], [γ$0$]CoEnv[A, F, γ$0$]]
-
implicit
def
freeShow[F[_]](implicit arg0: Functor[F], F: Delay[Show, F]): Delay[Show, [β$5$]Free[F, β$5$]]
-
-
def
idCorecursive[A]: Aux[A, [β$1$]Const[A, β$1$]]
-
def
idRecursive[A]: Aux[A, [β$0$]Const[A, β$0$]]
-
-
implicit
def
ilistCorecursive[A]: Aux[IList[A], [β$1$]ListF[A, β$1$]]
-
implicit
def
ilistRecursive[A]: Aux[IList[A], [β$0$]ListF[A, β$0$]]
-
-
-
implicit
def
maybeCorecursive[A]: Aux[Maybe[A], [β$1$]Const[Maybe[A], β$1$]]
-
implicit
def
maybeRecursive[A]: Aux[Maybe[A], [β$0$]Const[Maybe[A], β$0$]]
-
Inherited from AnyRef
Inherited from Any
Algebra Transformations
Ungrouped
This packages contains fixed-point operators as well as instances of recursion schemes for various extant data types.
The reason these are relegated to their own package is because, in general, you should eschew using them directly, but rather rely on the type class constraints, and only require specific types at the boundaries.