summaryrefslogtreecommitdiff
path: root/Verification/Insert.lean (unfollow)
Commit message (Collapse)AuthorFilesLines
2024-04-23feat: close `find` / `insert` proofsRaito Bezarius1-45/+6
After a complete 180 with the Order theory, we close the goals of find and insert and we give an example of U32 order that we will upstream to Aeneas directly. Signed-off-by: Raito Bezarius <masterancpp@gmail.com>
2024-04-17feat: factor everything in `OrdSpecRel`Raito Bezarius1-1/+1
Now, we speak only about equivalence. Signed-off-by: Raito Bezarius <masterancpp@gmail.com>
2024-04-17feat: add functional correctness of elements contained in the resulting treeRaito Bezarius1-57/+58
We revamp the typeclass mechanisms and we add an equality hypothesis now. Signed-off-by: Raito Bezarius <masterancpp@gmail.com>
2024-04-12feat: upgrade and close all proofs except Preorder on U32Raito Bezarius1-30/+65
Signed-off-by: Raito Bezarius <masterancpp@gmail.com>
2024-04-05feat: close the BST proof modulo unbundlingRaito Bezarius1-1/+50
Signed-off-by: Raito Bezarius <masterancpp@gmail.com>
2024-04-04feat: close key theorem for any result on binary search treesRaito Bezarius1-25/+26
Signed-off-by: Raito Bezarius <masterancpp@gmail.com>
2024-03-28refactor: generalize the theory and perform some liftsRaito Bezarius1-0/+87
Move forward the "HSpec" idea, move around files, construct the hierarchy of trees, etc. Signed-off-by: Raito Bezarius <masterancpp@gmail.com>