Nested types for binomial heaps

Jim Apple jbapple+haskell-lib at
Mon Mar 22 05:42:01 EDT 2010

Clever type nesting techniques for ensuring the structural correctness of
binomial heaps have been invented before, including the technique that
Louis Wasserman implemented so efficiently for his recent proposal . Perhaps these
previous techniques could make the nested priority queue
implementation even more efiicient.

Ralf Hinze: (uses a different(?) extractMin algorithm)

Chris Okasaki: (stores children in a difference list to make their
reversal fast)

Bertram Felgenhauer: (suggests some space savings)
Mirror 2:

More information about the Libraries mailing list