### Abstract

This theory provides a verified implementation of weight-balanced trees following the work of Hirai and Yamamoto who proved that all parameters in a certain range are valid, i.e. guarantee that insertion and deletion preserve weight-balance. Instead of a general theorem we provide parameterized proofs of preservation of the invariant that work for many (all?) valid parameters.

### License

BSD License

### Topics

- Computer science/Data structures

### Related publications

- HIRAI, Y., & YAMAMOTO, K. (2011). Balancing weight-balanced trees. Journal of Functional Programming, 21(3), 287–307. https://doi.org/10.1017/s0956796811000104
- Wikipedia

### Session Weight_Balanced_Trees

- Weight_Balanced_Trees_log
- Weight_Balanced_Trees

## Cite

×

Weight_Balanced_Trees-AFP

    @article{Weight_Balanced_Trees-AFP,
      author  = {Tobias Nipkow and Stefan Dirix},
      title   = {Weight-Balanced Trees},
      journal = {Archive of Formal Proofs},
      month   = {March},
      year    = {2018},
      note    = {\url{https://isa-afp.org/entries/Weight_Balanced_Trees.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 20, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Aug 16, 2018 : Isabelle2018
- Mar 13, 2018 : Isabelle2017