Zemyla

It turns out there is one: the Kleisli arrow for `Cont`. https://www.reddit.com/r/haskell/comments/qwklh/coexponentials/

The `get`-`put` laws can be easier described if they're defined in terms of `state`, I think. ```haskell -- Laws for get and put get = state $ \s -> (s,...

Let's look at the types. For example, `Op r a` is a newtype wrapper around `a -> r`. So if we put `Op r` instead of `f`, we get ```haskell...

I just realized that `:=>` isn't *the* canonical exponential type, because it induces a functional dependency. There could be a type family, something like `==>`, which is a constraint but...

Best argument for switching them: `Divisible (Op r)` requires `Monoid r`, but `Decidable (Op r)` really shouldn't.

I remember that, when I mathed it out and undid the innate right bias of the list based form, the Church style `Free` `MonadPlus` wound up being: ```haskell newtype FMP...

Any `Functor` that is both `Applicative` and `Distributive` is also a `Monad`: ```haskell bindDistributive :: (Applicative m, Distributive m) => m a -> (a -> m b) -> m b...

Oh, and all `Distributive` instances are also `MonadFix`s: ```haskell mfixDistributive :: Distributive m => (a -> m a) -> m a mfixDistributive = fmap fix . distribute ```

Unfortunately, I was working on it, but then my laptop died. I'm sending this by phone.

Every `ArrowChoice` is a `Traversing`, and it can be done by "freezing" the traversal into a list and then walking it. ```haskell -- This type represents a traversal "frozen" in...