Ryan Scott

Indeed, my only concern with this patch is the fact that it isn't obviously connected to the API that `bifunctors` offers unless you know `unzipWith` is implemented under the hood....

> And I don't think there's much chance most people would see a module called `Data.Biapplicative.LazyPair` (or perhaps more likely `Data.Bifunctor.LazyPair`) and realize that was the place to find an...

> Can we at least agree on adding two lazy pair types (one with `NOINLINE`s and one without) and a strict one to `bifunctors`? Sure, I would be fine with...

I investigated these parts of `copilot-theorem` recently as well. I believe what the `README` refers to as `lightProver` has been superseded by the new `kInduction` prover, which is separate from...

> Sounds like they solve the same problem with a different backend? Yes, that is my understanding as well.

To be honest, I haven't really used `monad-control` much, so I don't have a strong opinion on it. Since @ekmett has expressed reservations about adding instances from `monad-control` in the...

`ContT` is deliberately not given a `MonadCatch` instance because in general, it is not possible to know how many times the continuation inside of a `ContT` is called. It could...

I'm not sure if I have a strong opinion about which of the APIs proposed above is best, since I've never tried to use this code in practice. I imagine...

Sounds reasonable to me. Care to make a pull request? > Can it be given for `a :- b`? Sure, you could do this: ```hs instance Lift (a :- b)...

On the other hand, @mpickering reminds me that if these instances were to be defined, they would have to be used with care, as today's typed Template Haskell is unsound....