Those, I believe, are fairly easy to capture in the `Moore b r -> Moore a r` formulation. It also captures linearity. That said, I think the more general formu

Those, I believe, are fairly easy to capture in the `Moore b r -> Moore a r` formulation. It also captures linearity. That said, I think the more general formulation is something like Fold or Traversal in Lens which operates polymorphically over the whole thing with a type that a refinement of Profunctor p => p a b -> p s t where such a type generalizes all of the concrete Haskell formulations.