Structure Conv

signature Conv =
sig
   include Abbrev

   exception UNCHANGED

   val QCONV                 : conv -> conv
   val REWR_CONV             : thm -> conv
   val HO_REWR_CONV          : thm -> conv
   val REWR_CONV_A           : thm -> conv
   val LAND_CONV             : conv -> conv
   val RAND_CONV             : conv -> conv
   val RATOR_CONV            : conv -> conv
   val ABS_CONV              : conv -> conv
   val COMB_CONV             : conv -> conv
   val COMB2_CONV            : conv * conv -> conv
   val FORK_CONV             : conv * conv -> conv
   val BINOP_CONV            : conv -> conv
   val EVERY_DISJ_CONV       : conv -> conv
   val EVERY_CONJ_CONV       : conv -> conv
   val QUANT_CONV            : conv -> conv
   val BINDER_CONV           : conv -> conv
   val STRIP_BINDER_CONV     : term option -> conv -> conv
   val STRIP_QUANT_CONV      : conv -> conv
   val LAST_EXISTS_CONV      : conv -> conv
   val LAST_FORALL_CONV      : conv -> conv
   val LHS_CONV              : conv -> conv
   val RHS_CONV              : conv -> conv
   val NO_CONV               : conv
   val ALL_CONV              : conv
   val THENC                 : conv * conv -> conv
   val ORELSEC               : conv * conv -> conv
   val IFC                   : conv -> conv -> conv -> conv
   val FIRST_CONV            : conv list -> conv
   val EVERY_CONV            : conv list -> conv
   val REPEATC               : conv -> conv
   val CHANGED_CONV          : conv -> conv
   val QCHANGED_CONV         : conv -> conv
   val TRY_CONV              : conv -> conv
   val SUB_CONV              : conv -> conv
   val DEPTH_CONV            : conv -> conv
   val REDEPTH_CONV          : conv -> conv
   val TOP_DEPTH_CONV        : conv -> conv
   val TOP_SWEEP_CONV        : conv -> conv
   val ONCE_DEPTH_CONV       : conv -> conv
   val CONV_RULE             : conv -> thm -> thm
   val HYP_CONV_RULE         : (term -> bool) -> conv -> thm -> thm
   val BETA_RULE             : thm -> thm
   val UNBETA_CONV           : term -> conv
   val NOT_FORALL_CONV       : conv
   val NOT_EXISTS_CONV       : conv
   val EXISTS_NOT_CONV       : conv
   val FORALL_NOT_CONV       : conv
   val FORALL_AND_CONV       : conv
   val EXISTS_OR_CONV        : conv
   val AND_FORALL_CONV       : conv
   val LEFT_AND_FORALL_CONV  : conv
   val RIGHT_AND_FORALL_CONV : conv
   val OR_EXISTS_CONV        : conv
   val LEFT_OR_EXISTS_CONV   : conv
   val RIGHT_OR_EXISTS_CONV  : conv
   val EXISTS_AND_CONV       : conv
   val EXISTS_AND_REORDER_CONV : conv
   val AND_EXISTS_CONV       : conv
   val LEFT_AND_EXISTS_CONV  : conv
   val RIGHT_AND_EXISTS_CONV : conv
   val FORALL_OR_CONV        : conv
   val OR_FORALL_CONV        : conv
   val LEFT_OR_FORALL_CONV   : conv
   val RIGHT_OR_FORALL_CONV  : conv
   val FORALL_IMP_CONV       : conv
   val LEFT_IMP_EXISTS_CONV  : conv
   val RIGHT_IMP_FORALL_CONV : conv
   val EXISTS_IMP_CONV       : conv
   val BOTH_EXISTS_IMP_CONV  : conv
   val LEFT_IMP_FORALL_CONV  : conv
   val RIGHT_IMP_EXISTS_CONV : conv
   val X_SKOLEM_CONV         : term -> conv
   val SKOLEM_CONV           : conv
   val SYM_CONV              : conv
   val RIGHT_CONV_RULE       : conv -> thm -> thm
   val FUN_EQ_CONV           : conv
   val X_FUN_EQ_CONV         : term -> conv
   val SELECT_CONV           : conv
   val SPLICE_CONJ_CONV      : conv
   val CONTRAPOS_CONV        : conv
   val ANTE_CONJ_CONV        : conv
   val AND_IMP_INTRO_CONV    : conv
   val SWAP_EXISTS_CONV      : conv
   val SWAP_FORALL_CONV      : conv
   val RESORT_FORALL_CONV    : (term list -> term list) -> conv
   val RESORT_EXISTS_CONV    : (term list -> term list) -> conv
   val FORALL_SIMP_CONV      : conv
   val EXISTS_SIMP_CONV      : conv
   val LIST_FORALL_SIMP_CONV : conv
   val LIST_FORALL_AND_CONV  : conv
   val LIST_FORALL_IMP_CONV  : bool -> conv
   val LIST_FORALL_OR_CONV   : conv
   val LIST_FORALL_NOT_CONV  : conv
   val MINISCOPE_FORALL_CONV : bool -> conv
   val LIST_EXISTS_SIMP_CONV : conv
   val LIST_EXISTS_AND_CONV  : conv
   val LIST_EXISTS_IMP_CONV  : bool -> conv
   val LIST_EXISTS_OR_CONV   : conv
   val LIST_EXISTS_NOT_CONV  : conv
   val MINISCOPE_EXISTS_CONV : bool -> conv
   val SWAP_VARS_CONV        : conv
   val bool_EQ_CONV          : conv
   val EXISTS_UNIQUE_CONV    : conv
   val COND_CONV             : conv
   val EXISTENCE             : thm -> thm
   val AC_CONV               : thm * thm -> conv
   val GSYM                  : thm -> thm
   val RENAME_VARS_CONV      : string list -> conv
   val PAT_CONV              : term -> conv -> conv
   val PRINT_CONV            : conv
   val MAP_THM               : conv -> thm -> thm
   val PATH_CONV             : string -> conv -> conv

   val memoize : (term -> 'a option) -> ('a, thm) Redblackmap.dict ->
                 (term -> bool) -> exn -> conv -> conv
end

HOL 4, Kananaskis-13