Re:Hell Is Other REPLs
by a1369209993 on Sunday August 29, 2021 @03:03PM
(#28349508)
> But for solving several of them, you need to compose your monads, and there is no good general way to do that.
It's (provably, I think) impossible for fully general monads, but for traversable-but-otherwise-general monads you can do[0]:
newtype (%) (f1::k1->Type) (f2::k2->k1) (a::k2) = Comp { unComp :: (f1 (f2 a)) }
instance (Monad f1,Monad f2,Traversable f2) => Monad (f1 % f2) where
join (Comp a) = Comp $ a >>= (map join . mapA (unComp ))
(Comp a) >>= k = Comp $ a >>= (map join . mapA (unComp . k))
(For that matter, you only need f2 to be traversable; f1 can be any monad at all.)0: copied from my own code, so it might need other adjustment than s/map/fmap/ and s/mapA/traverse/.
Re:Hell Is Other REPLs
by josephcsible on Sunday August 29, 2021 @07:09PM
(#28351341)
That instance is type-correct but unlawful: https://stackoverflow.com/q/42284879/7509065
But for solving several of them, you need to compose your monads, and there is no good general way to do that. There are context dependent ways to compose some of them, but you are always thinking about their compatibility and they often require that you specialize your code.