| Home |
| About |
| Submission |
| Updating Entries |
| Using Entries |
| Search |
| Statistics |
| Index |
| Download |
Hood-Melville Queue
| Title: | Hood-Melville Queue |
| Author: | Alejandro Gómez-Londoño (alejandro /dot/ gomez /at/ chalmers /dot/ se) |
| Submission date: | 2021-01-18 |
| 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. |
| BibTeX: |
@article{Hood_Melville_Queue-AFP,
author = {Alejandro Gómez-Londoño},
title = {Hood-Melville Queue},
journal = {Archive of Formal Proofs},
month = jan,
year = 2021,
note = {\url{https://isa-afp.org/entries/Hood_Melville_Queue.html},
Formal proof development},
ISSN = {2150-914x},
}
|
| License: | BSD License |
| Status: [ok] | This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations. |
|
Proof outline Proof document |
| Browse theories |
| Download this entry |