The Props are back in town! And there are some interesting use-cases: rocq-prover/rfcs#37 (comment)
This could be useful to implement data structures for which picking a unique representative
clashes with efficiency considerations (e.g. implementing a FIFO using two lists yields many
representations for the same FIFO but also guarantees amortised O(1) time for dequeue).
The Props are back in town! And there are some interesting use-cases: rocq-prover/rfcs#37 (comment)
This could be useful to implement data structures for which picking a unique representative
clashes with efficiency considerations (e.g. implementing a FIFO using two lists yields many
representations for the same FIFO but also guarantees amortised O(1) time for dequeue).