Edward Kmett

You'd also need separate names for the Decidable combinators vs. the ContravariantPlus ones, for type inference reasons, lest you wind up with a bunch of code with lawless interactions between...

To the original topic here, such a divide violates the "linear" intuition about how such predicates decompose. There is a real downside to it as well, consider using the variant...

If you look at the way all the generic instances for these work they break apart the sums and products and do things with both sides. Not everything will behave...

I'm actually exploring something similar in the `hkd` package, where it seems this notion of `Semidivisible` becomes way more common. I will admit I'm a bit uncomfortable with the explosion...

@Gabriella439 Yep. That should be the case now, given the patches since this bug was filed. At the time, you couldn't override correctly because the argument order caused the things...

We could likely leave off with just `Applicative`, and not do the `Monad`.

(and `Compose` does have that instance.) The problem is that `Distributive` isn't strong enough to 'zip' despite the conditions necessary for the existence of an instance saying it should be...

`Representable` is strong enough. `Distributive` doesn't let you know what the representation is. I'd like more things to be able to work with just a Haskell-98 distributive constraint. The bind...

The current plan is to package a "Dist" newtype that can be used via Deriving Via to get access to all of these instances for your data type if you...

I've added you as a committer on this repository. You are hereby fully empowered to unilaterally improve our parser performance. =)