16 Jun
2007
16 Jun
'07
2:50 p.m.
apfelmus wrote:
Lazy skew heaps are thoroughly explained in
C. Okasaski. Fun with binary heap trees. In: The Fun of Programming. Palgrave. 2003. http://www.palgrave.com/pdfs/0333992857.pdf
Extremely cool stuff, that. I love it when people write material like this... Unfortunately, so many documents about Haskell are too hard to comprehend. :-(