[Haskell-cafe] Functional counterpart of counting-sort?

[Vivitsu Maharaja]

This video should help in explaining what the library is about. It's a talk
by Edward Kmett, the author of the library, and he goes into the motivation
and internals of the library:

https://youtu.be/cB8DapKQz-I

Don't worry if you don't get everything in the first watch though, I've
watched it a couple of times, and have still worked my way through only the
first half of it, maybe ;)

Reading the papers before hand might help too.

Enjoy!
Vivitsu
On Sun, Sep 6, 2015 at 23:33 Nicola Gigante <nicola.gigante at gmail.com>
wrote:

> Il giorno 06/set/2015, alle ore 19:36, Tom Ellis <
> tom-lists-haskell-cafe-2013 at jaguarpaw.co.uk> ha scritto:
> >
> >> On Sun, Sep 06, 2015 at 07:29:23PM +0200, Nicola Gigante wrote:
> >> Do any of you know if it is possible to sort a _list_ of integers in
> >> O(n) time in a (lazy) purely functional language?
> >
> > Are you familiar with discrimination?
> >
> >    http://hackage.haskell.org/package/discrimination
> >
>
> Well, no, I wasn't aware of it at all! Thank you!
>
> It seems what I'm looking for!
> I'll read the papers pointed in the doc, but does anyone have a few
> words to say on what "discrimination" is all about?
>
> Greetings,
> Nicola
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/haskell-cafe/attachments/20150908/cef27886/attachment.html>