meldable-heap: Asymptotically optimal, Coq-verified meldable heaps, AKA priority queues
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.
|Versions [RSS] [faq]||1.0, 1.1, 1.1.1, 1.1.2, 2.0, 2.0.1, 2.0.2, 2.0.3|
|Dependencies||base (>=3 && <5) [details]|
|Revised||Revision 1 made by JimApple at 2018-05-19T04:30:47Z|
|Uploaded||by JimApple at 2010-05-23T22:38:44Z|
|Downloads||6384 total (33 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs uploaded by user
Build status unknown [no reports yet]
- meldable-heap-2.0.3.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.