The latest version of meldable-heap is 2.0.3-1.
meldable-heap
Version 1.0 revision 0 uploaded by JimApple.
Package meta
- Synopsis
- Asymptotically optimal, Coq-verified meldable heaps, AKA priority queues
- Description
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.
- Author
- Jim Apple
- Bug reports
- n/a
- Category
- Data Structures
- Copyright
- n/a
- Homepage
- http://code.google.com/p/priority-queues/
- Maintainer
- priority-queue-hackage@jbapple.com
- Package URL
- n/a
- Stability
- n/a