| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | feat: close key theorem for any result on binary search trees | Raito Bezarius | 2024-04-04 | 1 | -25/+26 |
| | | | | | Signed-off-by: Raito Bezarius <masterancpp@gmail.com> | ||||
| * | feat: lift Rust "totality" to total orders | Raito Bezarius | 2024-04-04 | 1 | -15/+30 |
| | | | | | Signed-off-by: Raito Bezarius <masterancpp@gmail.com> | ||||
| * | refactor: define some projectors for ForallNode | Raito Bezarius | 2024-04-04 | 1 | -0/+6 |
| | | | | | Signed-off-by: Raito Bezarius <masterancpp@gmail.com> | ||||
| * | refactor: generalize the theory and perform some lifts | Raito Bezarius | 2024-03-28 | 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 |