### Abstract

This library defines three different versions of pairing heaps: a functional version of the original design based on binary trees [Fredman et al. 1986], the version by Okasaki [1998] and a modified version of the latter that is free of structural invariants.

The amortized complexity of pairing heaps is analyzed in the AFP article Amortized Complexity.

### License

BSD License

### Extra 0

Origin: This library was extracted from Amortized Complexity and extended.

### Topics

- Computer science/Data structures

### Related publications

- Nipkow, T., & Brinkop, H. (2018). Amortized Complexity Verified. Journal of Automated Reasoning, 62(3), 367–391. https://doi.org/10.1007/s10817-018-9459-3
- Chapter Pairing Heaps in Functional Data Structures and Algorithms
- Wikipedia

### Session Pairing_Heap

- Pairing_Heap_Tree
- Pairing_Heap_List1
- Pairing_Heap_List2

### Used by

- A Verified Code Generator from Isabelle/HOL to CakeML
- Amortized Complexity Verified

## Cite

×

Pairing_Heap-AFP

    @article{Pairing_Heap-AFP,
      author  = {Hauke Brinkop and Tobias Nipkow},
      title   = {Pairing Heap},
      journal = {Archive of Formal Proofs},
      month   = {July},
      year    = {2016},
      note    = {\url{https://isa-afp.org/entries/Pairing_Heap.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