Re: [Haskell-cafe] ANN: Bookkeeper

This is a very fair point - indeed compilation is quite slow with larger records. I'll see if it can be made better. The link Adam sent is very helpful! On Wed, Aug 24, 2016 at 07:26:48PM -0400, adam vogt wrote:

Book seems to use a quicksort (in package type-level-sets) to avoid duplicates. A couple years ago I did a benchmark http://code.haskell.org/~aavogt/HList-nodup/Run.html that includes a different quicksort. It is a good method, but maybe type-level-sets has a better implementation. Provided my timings generalize, I think dealing with many records of 50 elements will be frustrating.

On Wed, Aug 24, 2016 at 5:10 PM, Dmitry Olshansky wrote:

...

This is really interesting. But how many fields in Book could be? I'm afraid there could be a problem for time and memory consumption by compiler. Isn't it?

Best regards, Dmitry

2016-08-24 22:39 GMT+03:00 Julian Arni :

...

I was playing around with GHC 8 yesterday, and ended up writing another extensible records library:

https://hackage.haskell.org/package/bookkeeper

And a blog post about it:

https://turingjump.com/blog/bookkeeper/

I hope someone finds this useful!

-- Julian K. Arni Haskell Consultant, Turing Jump https://turingjump.com

_______________________________________________ Haskell-Cafe mailing list To (un)subscribe, modify options or view archives go to: http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe Only members subscribed via the mailman list are allowed to post.

_______________________________________________ Haskell-Cafe mailing list To (un)subscribe, modify options or view archives go to: http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe Only members subscribed via the mailman list are allowed to post.

-- Julian K. Arni Haskell Consultant, Turing Jump https://turingjump.com