Hello,

I would like to now if anyone has or knows of
functional implementations of priority (aka Min,
aka Max) heaps. Specifically I am looking for:

Fibonacci, Brodal and relaxed heaps [1]

with fast insert and deletes.

Any literature or implementation in Haskell
or F# are also welcome.

I also would appreciate any additional comments on
implementation issues and experience with heaps
that may help me.

TIA,
Hugo Ferreira.


[1] http://en.wikipedia.org/wiki/Fibonacci_heap