package coq

You can search for identifiers within the package.

in-package search v0.2.0

Formal proof management system

Install

sha256=13a67c0a4559ae22e9765c8fdb88957b16c2b335a2d5f47e4d6d9b4b8b299926

An imperative implementation of partitions via Union-Find

Paths are compressed imperatively at each lookup of a canonical representative. Each union also modifies in-place the partition structure.

Nota: for the moment we use Pervasive's comparison for choosing the smallest object as representative. This could be made more generic.

Sourcemodule type PartitionSig = sig ... end

Sourcemodule type SetS = sig ... end

Minimal interface for sets, subtype of stdlib's Set.

Sourcemodule type MapS = sig ... end

Minimal interface for maps, subtype of stdlib's Map.

module Make
  (S : SetS)
  (M : MapS with type key = S.elt) : 
  PartitionSig with type elt = S.elt and type set = S.t