meldable-heap

Asymptotically optimal, Coq-verified meldable heaps, AKA priority queues

https://github.com/jbapple/priority-queues

Latest on Hackage:

2.0.3@rev:1

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.

BSD-3-Clause licensed by Jim Apple

Maintained by JimApple

A heap is a container supporting the insertion of elements and the extraction of the minimum element. This library additionally supports melding two heaps. This library models the implementation of asymptotically optimal purely functional heaps given by Brodal and Okasaki in their paper "Optimal Purely Functional Priority Queues". It has been proved correct using the Coq proof assistant. The proofs are included in the Cabal package.

A description of the differences between versions of this package is available at https://github.com/jbapple/priority-queues/blob/master/brodal-okasaki/cabal/CHANGELOG.