CONV_TAC : (conv -> tactic)
A ?- g =============== CONV_TAC c A ?- g'Note that the conversion c should return a theorem whose assumptions are also among the assumptions of the goal (normally, the conversion will returns a theorem with no assumptions). CONV_TAC does not fail if this is not the case, but the resulting tactic will be invalid, so the theorem ultimately proved using this tactic will have more assumptions than those of the original goal.
CONV_TAC(DEPTH_CONV BETA_CONV)The conversion BETA_CONV maps a beta-redex "(\x.u)v" to the theorem
|- (\x.u)v = u[v/x]and the ML expression (DEPTH_CONV BETA_CONV) evaluates to a conversion that maps a term "t" to the theorem |- t=t' where t' is obtained from t by beta-reducing all beta-redexes in t. Thus CONV_TAC(DEPTH_CONV BETA_CONV) is a tactic which reduces beta-redexes anywhere in a goal.