### Abstract

This entry verifies priority queues based on Braun trees. Insertion and deletion take logarithmic time and preserve the balanced nature of Braun trees. Two implementations of deletion are provided.

### License

BSD License

### History

December 16, 2019
  Added theory Priority_Queue_Braun2 with second version of del_min

### Topics

- Computer science/Data structures

### Related publications

- Nipkow, T., & Sewell, T. (2020). Proof pearl: Braun trees. Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs. https://doi.org/10.1145/3372885.3373834
- Author's copy
- Chapter Priority Queues via Braun Trees in Functional Data Structures and Algorithms

### Session Priority_Queue_Braun

- Priority_Queue_Braun
- Priority_Queue_Braun2
- Sorting_Braun

## Cite

×

Priority_Queue_Braun-AFP

    @article{Priority_Queue_Braun-AFP,
      author  = {Tobias Nipkow},
      title   = {Priority Queues Based on Braun Trees},
      journal = {Archive of Formal Proofs},
      month   = {September},
      year    = {2014},
      note    = {\url{https://isa-afp.org/entries/Priority_Queue_Braun.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
- Oct 10, 2017 : Isabelle2017
- Dec 17, 2016 : Isabelle2016-1
- Feb 22, 2016 : Isabelle2016
- May 27, 2015 : Isabelle2015
- Sep 4, 2014 : Isabelle2014