fact: Definition Usable R t : relation term := filter_top R (fun g => exists f, symb_in_term f t = true /\ refl_trans_clos (symb_sup R) f g).
imports: Coq(List Relations Wellfounded Arith Recdef Setoid) CoLoR(closure more_list weaved_relation term_spec equational_theory_spec dp graph_dp terminaison interp)