Formalization of a persistent union-find data structure in Coq

The following article introduces an efficient and persistent union-find data structure :

Related OCaml data structures:

The code presented in this article has been formally proved using the Coq proof assistant :

Ocaml files used to make the benchmarks presented in the article


Français Homepage Generated on 8/12/2022.