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

[ bsd3, data-structures, library ] [ Propose Tags ]

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 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 JimApple
Revised Revision 1 made by JimApple at Sat May 19 04:30:47 UTC 2018
Category Data Structures
Home page https://github.com/jbapple/priority-queues
Uploaded by JimApple at Sun May 23 22:38:44 UTC 2010
Distributions NixOS:2.0.3
Downloads 3188 total (101 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Downloads

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'.

Maintainer's Corner

For package maintainers and hackage trustees