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 http://priority-queues.googlecode.com/hg/brodal-okasaki/cabal/CHANGELOG
Downloads
- meldable-heap-2.0.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 1.0, 1.1, 1.1.1, 1.1.2, 2.0, 2.0.1, 2.0.2, 2.0.3 |
---|---|
Change log | CHANGELOG |
Dependencies | base (>=3 && <5) [details] |
License | BSD-3-Clause |
Author | Jim Apple |
Maintainer | http://code.google.com/p/priority-queues/ |
Category | Data Structures |
Home page | http://code.google.com/p/priority-queues/ |
Uploaded | by JimApple at 2010-05-23T01:16:26Z |
Distributions | NixOS:2.0.3 |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Downloads | 7082 total (27 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs uploaded by user Build status unknown [no reports yet] |