Real-Time Double-Ended Queue

Balazs Toth 📧 and Tobias Nipkow 🌐

June 23, 2022

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Abstract

A double-ended queue (deque) is a queue where one can enqueue and dequeue at both ends. We define and verify the deque implementation by Chuang and Goldberg. It is purely functional and all operations run in constant time.

License

BSD License

Topics

Related publications

  • Chuang, T.-R., & Goldberg, B. (1993). Real-time deques, multihead Turing machines, and purely functional programming. Proceedings of the Conference on Functional Programming Languages and Computer Architecture, 289–298. https://doi.org/10.1145/165180.165225
  • Wikipedia

Session Real_Time_Deque

Cite

× 
@article{Real_Time_Deque-AFP,
  author  = {Balazs Toth and Tobias Nipkow},
  title   = {Real-Time Double-Ended Queue},
  journal = {Archive of Formal Proofs},
  month   = {June},
  year    = {2022},
  note    = {\url{https://isa-afp.org/entries/Real_Time_Deque.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: