Hood-Melville Queue

Alejandro Gómez-Londoño 📧

January 18, 2021

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:

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy