Luka Jacobowitz
I very much appreciate the PR, it's really great work! I don't know if I'll personally have a lot of time to experiment in the near future, but to me,...
I think we could express associatvity and distributivity without `pure`, as well as a handful of combinators :)
Another thing worth discussing; should the second argument be strict, by-name or use `Eval` one prevalent use case in the paper is use of selective parsers, where laziness can be...
I think we should set up a new repo `cats-selective` that contains the code for this for now, where we can easily create changes, and once we feel it's ready,...
I have thought of a yet another thing we need to consider, what about the `Parallel` type class? Right now it represents going from a `Monad` to an `Applicative`, but...
@cb372 I'm sorry if I created confusion, I just said I want to split up `Selective` into two classes, one extending `Apply` and another `Applicative`. Similar to how we have...
@johnynek, I guess you're right since there is no `apS = ap` law. Not sure if that means that it never makes sense, but I can't think of a situation...
So what if I want to have a statically analyzable `IO`, it'd be nice to be able to express the difference between what is now `*>` and `&>` or `mapN`...
@cb372 I think mirroring Cats' usage of MIT license is probably easiest :)
We could add redeem and `redeemWith` add syntax on the `SyntaxBinCompat` trait :)