[Haskell-cafe] Re: Literate Priority Queue, plus question
andrewcoppin at btinternet.com
Sat Jun 16 10:50:01 EDT 2007
> Lazy skew heaps are thoroughly explained in
> C. Okasaski. Fun with binary heap trees.
> In: The Fun of Programming. Palgrave. 2003.
Extremely cool stuff, that. I love it when people write material like
Unfortunately, so many documents about Haskell are too hard to
More information about the Haskell-Cafe