Define a hash table on generic containers which have a notion of "death" and aliveness. If a binding is dead the hash table can automatically remove it.
module MakeSeeded : functor (H : sig ... end) -> SeededS with type key = H.tFunctor building an implementation of an hash table that use the container for keeping the information given