This thread relates to another thread: Priority queue and fibonacci queue/heap.
In that thread, someone suggested taking a look at: Functional Brodal Queues. But unfortunately, it appears to me that that implementation also omits reduce-min and delete-node.