op_mk_set : ('a -> 'a -> bool) -> 'a list -> 'a list
- op_mk_set aconv [Term `\x y. x /\ y`, Term `\y x. y /\ x`, Term `\z a. z /\ a`]; > val it = [`\z a. z /\ a`] : term list
A high-performance implementation of finite sets may be found in structure HOLset.
There is no requirement that eq be recognizable as a kind of equality (it could be implemented by an order relation, for example).