[WIP] implement a PriorityQueue #272
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
The priority queue is described in Okasaki Purely Functional Data structures it is based on leftist trees
|
I started a discussion to give feedback |
This function returns the root value with from a non empty tree
This relies on PriorityQueue.Tree.peek by lifting a proof of non-emptyness of the queue to a proof of non-emptyness of the tree the queue is made from.
This is with gracious help from @regille. During the development a bug was caught in the desugaring of terms that was reported in issue HigherOrderCO#281
|
Amazing |
|
Thanks for merging. I am still working on various proofs. But I will send separate pull-requests for them |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The priority queue is described in Okasaki's "Purely Functional Data structures". It is based on leftist trees.