"Proof Pearl: Purely Functional, Simple and Efficient Priority Search Trees ..."

Peter Lammich, Tobias Nipkow (2019)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ITP.2019.23

access: open

type: Conference or Workshop Paper

metadata version: 2019-09-23

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/itp/LammichN19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/itp/LammichN19
Peter Lammich, Tobias Nipkow:
Proof Pearl: Purely Functional, Simple and Efficient Priority Search Trees and Applications to Prim and Dijkstra. ITP 2019: 23:1-23:18

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.