Testing a priority queue with Monolith
- November 19, 2025
A priority queue is a data structure whose specification is
non-deterministic: indeed, if a priority queue contains several
key-value pairs whose key is minimal, then any such pair can be legally
returned by pop. In this blog post, I describe how to test
an OCaml implementation of a priority queue using Monolith.
