summaryrefslogtreecommitdiff
path: root/AvlVerification/Insert.lean (follow)
Commit message (Collapse)AuthorAgeFilesLines
* feat: close `find` / `insert` proofsRaito Bezarius2024-04-231-173/+0
| | | | | | | | 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>
* feat: factor everything in `OrdSpecRel`Raito Bezarius2024-04-171-1/+1
| | | | | | Now, we speak only about equivalence. Signed-off-by: Raito Bezarius <masterancpp@gmail.com>
* feat: add functional correctness of elements contained in the resulting treeRaito Bezarius2024-04-171-57/+58
| | | | | | | We revamp the typeclass mechanisms and we add an equality hypothesis now. Signed-off-by: Raito Bezarius <masterancpp@gmail.com>
* feat: upgrade and close all proofs except Preorder on U32Raito Bezarius2024-04-121-30/+65
| | | | Signed-off-by: Raito Bezarius <masterancpp@gmail.com>
* feat: close the BST proof modulo unbundlingRaito Bezarius2024-04-051-1/+50
| | | | Signed-off-by: Raito Bezarius <masterancpp@gmail.com>
* feat: close key theorem for any result on binary search treesRaito Bezarius2024-04-041-25/+26
| | | | Signed-off-by: Raito Bezarius <masterancpp@gmail.com>
* refactor: generalize the theory and perform some liftsRaito Bezarius2024-03-281-0/+87
Move forward the "HSpec" idea, move around files, construct the hierarchy of trees, etc. Signed-off-by: Raito Bezarius <masterancpp@gmail.com>