| Commit message (Collapse) | Author | Files | Lines | ||
|---|---|---|---|---|---|
| 2024-04-18 | feat: outline of `find` proof | Raito Bezarius | 1 | -0/+42 | |
| Signed-off-by: Raito Bezarius <masterancpp@gmail.com> | |||||
| 2024-04-17 | feat: factor everything in `OrdSpecRel` | Raito Bezarius | 2 | -6/+2 | |
| Now, we speak only about equivalence. Signed-off-by: Raito Bezarius <masterancpp@gmail.com> | |||||
| 2024-04-17 | feat: add functional correctness of elements contained in the resulting tree | Raito Bezarius | 3 | -71/+83 | |
| We revamp the typeclass mechanisms and we add an equality hypothesis now. Signed-off-by: Raito Bezarius <masterancpp@gmail.com> | |||||
| 2024-04-12 | feat: upgrade and close all proofs except Preorder on U32 | Raito Bezarius | 4 | -72/+129 | |
| Signed-off-by: Raito Bezarius <masterancpp@gmail.com> | |||||
| 2024-04-05 | feat: close the BST proof modulo unbundling | Raito Bezarius | 2 | -1/+60 | |
| Signed-off-by: Raito Bezarius <masterancpp@gmail.com> | |||||
| 2024-04-04 | feat: close key theorem for any result on binary search trees | Raito Bezarius | 1 | -25/+26 | |
| Signed-off-by: Raito Bezarius <masterancpp@gmail.com> | |||||
| 2024-04-04 | feat: lift Rust "totality" to total orders | Raito Bezarius | 1 | -15/+30 | |
| Signed-off-by: Raito Bezarius <masterancpp@gmail.com> | |||||
| 2024-04-04 | refactor: define some projectors for ForallNode | Raito Bezarius | 1 | -0/+6 | |
| Signed-off-by: Raito Bezarius <masterancpp@gmail.com> | |||||
| 2024-03-28 | refactor: generalize the theory and perform some lifts | Raito Bezarius | 4 | -0/+260 | |
| Move forward the "HSpec" idea, move around files, construct the hierarchy of trees, etc. Signed-off-by: Raito Bezarius <masterancpp@gmail.com> | |||||
 |
index : avl-verification | |
| Isabelle fork of https://github.com/RaitoBezarius/avl-verification |
| summaryrefslogtreecommitdiff |