Hood-Melville Queue

Alejandro Gómez-Londoño 📧

January 18, 2021

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

This is a verified implementation of a constant time queue. The original design is due to Hood and Melville. This formalization follows the presentation in Purely Functional Data Structuresby Okasaki.

License

BSD License

Topics

Related publications

Session Hood_Melville_Queue

Cite

× 
@article{Hood_Melville_Queue-AFP,
  author  = {Alejandro Gómez-Londoño},
  title   = {Hood-Melville Queue},
  journal = {Archive of Formal Proofs},
  month   = {January},
  year    = {2021},
  note    = {\url{https://isa-afp.org/entries/Hood_Melville_Queue.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: