This repository has been archived by the owner. It is now read-only.
Verifying weight biased leftist heaps using dependent types in Agda
Switch branches/tags
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
paper
src
.gitignore
LICENSE
Makefile
README.md

README.md

Verifying weight biased leftist heaps using dependent types

Tutorial paper "Verifying weight biased leftist heaps using dependent types" + companion code. This paper has not been published in any peer-reviewed journal.

Source organization

Code is located in src/ directory containing three subdirectories:

  • Basics - modules defining Bool, Nat, Order, basic functions for equational reasoning and proofs of elementary properties (like associativity and commutatibity of addition).

  • TwoPassMerge - implementation of weight biased leftist heaps based on a two-pass merging algorithm. Merging uses helper function makeT.

  • SinglePassMerge - implementation based on a single-pass merging obtained by inlining all calls to makeT.

Latest version of the source code is available on BitBucket.

License

See LICENSE file for code license.