| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Add CompleteTree.contains. Decidable Predicate. | Andreas Grois | 2024-07-24 | 1 | -0/+28 |
| | | | | | This is a preparation step for additional proofs. | ||||
| * | Add CompleteTree/AdditionalOperations.lean for non-heap operations. | Andreas Grois | 2024-07-23 | 4 | -48/+53 |
| | | |||||
| * | Split code in multiple source files. Separate proofs and logic. | Andreas Grois | 2024-07-23 | 9 | -1148/+1220 |
| | | |||||
| * | Add GetElem instances. | Andreas Grois | 2024-07-22 | 2 | -14/+43 |
| | | |||||
| * | Initial commit. | Andreas Grois | 2024-07-22 | 11 | -0/+1543 |
 |
index : BinaryHeap | |
| A toy project about formal validation of a Heap in Lean4 | Andreas Grois |
| aboutsummaryrefslogtreecommitdiff |