@hackage setoid0.1.0.0

A Haskell implementation of setoid

Setoid (https://en.wikipedia.org/wiki/Setoid) is a set equipped with an equivalence relation. Setoid is a useful data structure in cases where equivalence is chosen not to be equality. One can use it to influence the memberships of the elements more strictly, as opposed to sets, and run computations on unions when conflicts between elements are found. You can find more deatails in Data.Setoid