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 28/8/2014.