Formalizing disjoint-set forests (union-find).
Formalizing disjoint-set forests (union-find).

Hopefully, to prove the functional correctness of the implementation. Then,
convert it to use regions.
- Started writing down a few definitions according following F. Pottier's paper.
- Hit a snag where the [path] relation (reflexive-transitive closure of a
  relation) doesn't work well in a refinement context (can't provide a witness
  for the goal when inside a [Lemma]).
→ about to switch to a constructive style. Hopefully the proofs will go through.

MallabaevAzamat/FStar,A-Manning/FStar,hoheinzollern/FStar,MallabaevAzamat/FStar,FStarLang/FStar,hoheinzollern/FStar,FStarLang/FStar,FStarLang/FStar,YaccConstructor/FStar,hoheinzollern/FStar,hoheinzollern/FStar,YaccConstructor/FStar,YaccConstructor/FStar,MallabaevAzamat/FStar,A-Manning/FStar,MallabaevAzamat/FStar,A-Manning/FStar,YaccConstructor/FStar