Chris Hammill
Chris Hammill
Absolutely, I'll write a handful this afternoon, thanks! On Mon, Nov 19, 2018, 11:18 AM Anthony Cowley Can you provide an example with a record before and after unnesting? I'd...
Ok so first attempt: ```haskell tr :: Rec Identity '[Int, [Int], Int] tr = 5 :& Identity [6,7,8] :& 3 :& RNil utr :: [Rec Identity '[Int,Int,Int]] utr = unnest1...
Sorry for the close and reopen, keyboard got away from me. You can do the cartesian version really simply I think. Off the top of my head you can split...
The counter-argument I guess is that if you know in advance you can just tuple the stuff you care about and unnest1
So there are two ways I can think to move forward: 1. Accept cartesian producting: in which case `unnest` just becomes type-level recursive unnest1. If we did this, we should...
I got it, and did both. The key thing to note is that the difference between the two unnestings comes down to a choice of a `pure` and `liftA2`. For...
@acowley do you want me to PR the vinyl stuff against your vinyl fork?
Now that this project has moved to nix-community, is anyone with commit rights able to say if they'd be interested in ever merging this? I'm maintaining the branch for my...
I have the same failures
It might be easy to mechanize doing lens law tests for each lens. The difficulty is input data. I wonder how good the R quickcheck library is...