@InProceedings{lammich_et_al:LIPIcs.ITP.2019.23,
author = {Lammich, Peter and Nipkow, Tobias},
title = {{Proof Pearl: Purely Functional, Simple and Efficient Priority Search Trees and Applications to Prim and Dijkstra}},
booktitle = {10th International Conference on Interactive Theorem Proving (ITP 2019)},
pages = {23:1--23:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-122-1},
ISSN = {1868-8969},
year = {2019},
volume = {141},
editor = {Harrison, John and O'Leary, John and Tolmach, Andrew},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2019.23},
URN = {urn:nbn:de:0030-drops-110788},
doi = {10.4230/LIPIcs.ITP.2019.23},
annote = {Keywords: Priority queue, Dijkstra’s algorithm, Prim’s algorithm, verification, Isabelle}
}