higherkindness.droste.data
Mu is the least fixed point of a functor F. It is a computation that can consume a inductive noninfinite structure in one go.
F
In Haskell this can more aptly be expressed as: data Mu f = Mu (forall x . (f x -> x) -> x)
data Mu f = Mu (forall x . (f x -> x) -> x)
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)