doc-src/Ref/ref.ind

Updated the NatSum example

\begin{theindex}

  \item {\tt !!} symbol, 65
    \subitem in main goal, 7
  \item {\tt\$}, \bold{57}, 82
  \item {\tt\%} symbol, 65
  \item *
    \subitem claset, 128
    \subitem simpset, 106
  \item {\tt ::} symbol, 65, 66
  \item {\tt ==} symbol, 65
  \item {\tt ==>} symbol, 65
  \item {\tt =>} symbol, 65
  \item {\tt =?=} symbol, 65
  \item {\tt\at Enum} constant, 88
  \item {\tt\at Finset} constant, 88, 89
  \item {\tt [} symbol, 65
  \item {\tt [|} symbol, 65
  \item {\tt ]} symbol, 65
  \item {\tt _K} constant, 90, 92
  \item \verb'{}' symbol, 88
  \item {\tt\ttlbrace} symbol, 65
  \item {\tt\ttrbrace} symbol, 65
  \item {\tt |]} symbol, 65

  \indexspace

  \item {\tt Abs}, \bold{57}, 82
  \item {\tt abstract_over}, \bold{58}
  \item {\tt abstract_rule}, \bold{44}
  \item {\tt aconv}, \bold{58}
  \item {\tt addaltern}, \bold{124}
  \item {\tt addbefore}, \bold{124}
  \item {\tt addcongs}, 103, \bold{115}, 116
  \item {\tt AddDs}, \bold{128}
  \item {\tt addDs}, \bold{123}
  \item {\tt addeqcongs}, \bold{103}, 105, 115
  \item {\tt AddEs}, \bold{128}
  \item {\tt addEs}, \bold{123}
  \item {\tt AddIs}, \bold{128}
  \item {\tt addIs}, \bold{123}
  \item {\tt addloop}, 104, 105
  \item {\tt addSaltern}, \bold{124}
  \item {\tt addSbefore}, \bold{124}
  \item {\tt AddSDs}, \bold{128}
  \item {\tt addSDs}, \bold{123}
  \item {\tt AddSEs}, \bold{128}
  \item {\tt addSEs}, \bold{123}
  \item {\tt Addsimps}, \bold{100}, 105, 106
  \item {\tt addsimps}, 102, 105, 106, 116
  \item {\tt AddSIs}, \bold{128}
  \item {\tt addSIs}, \bold{123}
  \item {\tt addSolver}, 104, 105
  \item {\tt addss}, \bold{124}, 125
  \item {\tt addSSolver}, 104, 105
  \item {\tt all_tac}, \bold{30}
  \item {\tt ALLGOALS}, \bold{34}, 108, 112
  \item ambiguity
    \subitem of parsed expressions, 75
  \item {\tt any} nonterminal, \bold{64}
  \item {\tt APPEND}, \bold{28}, 30
  \item {\tt APPEND'}, 35
  \item {\tt Appl}, 79
  \item {\tt aprop} nonterminal, \bold{66}
  \item {\tt ares_tac}, \bold{19}
  \item {\tt args} nonterminal, 89
  \item {\tt Arith} theory, 111
  \item arities
    \subitem context conditions, 52
  \item {\tt Asm_full_simp_tac}, \bold{100}, 105
  \item {\tt asm_full_simp_tac}, 22, 105, \bold{106}, 109
  \item {\tt asm_rl} theorem, 21
  \item {\tt Asm_simp_tac}, \bold{100}, 105, 107
  \item {\tt asm_simp_tac}, 105, \bold{106}, 116
  \item associative-commutative operators, 110
  \item {\tt assume}, \bold{42}
  \item {\tt assume_ax}, 8, \bold{55}
  \item {\tt assume_tac}, \bold{17}, 122
  \item {\tt assumption}, \bold{45}
  \item assumptions
    \subitem contradictory, 129
    \subitem deleting, 22
    \subitem in simplification, 99, 104
    \subitem inserting, 19
    \subitem negated, 120
    \subitem of main goal, 7--9, 14
    \subitem reordering, 109
    \subitem rotating, 22
    \subitem substitution in, 96
    \subitem tactics for, 17
  \item ASTs, 79--84
    \subitem made from parse trees, 80
    \subitem made from terms, 82
  \item {\tt atac}, \bold{19}
  \item {\tt Auto_tac}, \bold{128}
  \item {\tt axclass} section, 51
  \item axiomatic type class, 51
  \item axioms
    \subitem extracting, 55
  \item {\tt axioms_of}, \bold{56}

  \indexspace

  \item {\tt ba}, \bold{11}
  \item {\tt back}, \bold{9}
  \item batch execution, 12
  \item {\tt bd}, \bold{11}
  \item {\tt bds}, \bold{11}
  \item {\tt be}, \bold{11}
  \item {\tt bes}, \bold{11}
  \item {\tt BEST_FIRST}, \bold{31}, 32
  \item {\tt Best_tac}, \bold{128}
  \item {\tt best_tac}, \bold{127}
  \item {\tt beta_conversion}, \bold{43}
  \item {\tt bicompose}, \bold{46}
  \item {\tt bimatch_tac}, \bold{23}
  \item {\tt bind_thm}, \bold{8}, 9, 37
  \item binders, \bold{74}
  \item {\tt biresolution}, \bold{45}
  \item {\tt biresolve_tac}, \bold{23}, 129
  \item {\tt Blast.depth_tac}, \bold{126}
  \item {\tt Blast.trace}, \bold{126}
  \item {\tt Blast_tac}, \bold{128}
  \item {\tt blast_tac}, \bold{126}
  \item {\tt Bound}, \bold{57}, 80, 82, 83
  \item {\tt bound_hyp_subst_tac}, \bold{96}
  \item {\tt br}, \bold{11}
  \item {\tt BREADTH_FIRST}, \bold{31}
  \item {\tt brs}, \bold{11}
  \item {\tt bw}, \bold{12}
  \item {\tt bws}, \bold{12}
  \item {\tt by}, \bold{7}, 9, 10, 15
  \item {\tt byev}, \bold{7}

  \indexspace

  \item {\tt cd}, \bold{3}, 53
  \item {\tt cert_axm}, \bold{59}
  \item {\tt CHANGED}, \bold{30}
  \item {\tt chop}, \bold{9}, 13
  \item {\tt choplev}, \bold{9}
  \item {\tt Clarify_step_tac}, \bold{128}
  \item {\tt clarify_step_tac}, \bold{125}
  \item {\tt Clarify_tac}, \bold{128}
  \item {\tt clarify_tac}, \bold{125}
  \item claset
    \subitem current, 128
  \item {\tt claset} ML type, 122
  \item classes
    \subitem context conditions, 52
  \item classical reasoner, 118--130
    \subitem setting up, 129
    \subitem tactics, 125
  \item classical sets, 122
  \item {\tt ClassicalFun}, 130
  \item {\tt combination}, \bold{44}
  \item {\tt commit}, \bold{2}
  \item {\tt COMP}, \bold{46}
  \item {\tt compose}, \bold{46}
  \item {\tt compose_tac}, \bold{23}
  \item {\tt compSWrapper}, \bold{124}
  \item {\tt compWrapper}, \bold{124}
  \item {\tt concl_of}, \bold{39}
  \item {\tt COND}, \bold{32}
  \item congruence rules, 102
  \item {\tt Const}, \bold{57}, 82, 92
  \item {\tt Constant}, 79, 92
  \item constants, \bold{57}
    \subitem for translations, 69
    \subitem syntactic, 84
  \item {\tt contr_tac}, \bold{129}
  \item {\tt could_unify}, \bold{24}
  \item {\tt CPure} theory, 49
  \item {\tt CPure.thy}, \bold{55}
  \item {\tt cterm} ML type, 59
  \item {\tt cterm_instantiate}, \bold{38}
  \item {\tt cterm_of}, 7, 13, \bold{59}
  \item {\tt ctyp}, \bold{60}
  \item {\tt ctyp_of}, \bold{61}
  \item {\tt cut_facts_tac}, 7, \bold{19}, 97
  \item {\tt cut_inst_tac}, \bold{19}
  \item {\tt cut_rl} theorem, 21

  \indexspace

  \item {\tt datatype}, 100
  \item {\tt Deepen_tac}, \bold{128}
  \item {\tt deepen_tac}, \bold{127}
  \item {\tt defer_tac}, \bold{20}
  \item definitions, \see{rewriting, meta-level}{1}, 20, \bold{51}
    \subitem unfolding, 7, 8
  \item {\tt delcongs}, 103
  \item {\tt deleqcongs}, 103, 105
  \item {\tt delete_tmpfiles}, \bold{53}
  \item delimiters, \bold{66}, 69, 70, 72
  \item {\tt delrules}, \bold{123}
  \item {\tt Delsimps}, \bold{100}, 105, 106
  \item {\tt delsimps}, 105, 106
  \item {\tt dependent_tr'}, 90, \bold{92}
  \item {\tt DEPTH_FIRST}, \bold{31}
  \item {\tt DEPTH_SOLVE}, \bold{31}
  \item {\tt DEPTH_SOLVE_1}, \bold{31}
  \item {\tt depth_tac}, \bold{127}
  \item {\tt Deriv.drop}, \bold{48}
  \item {\tt Deriv.linear}, \bold{48}
  \item {\tt Deriv.size}, \bold{48}
  \item {\tt Deriv.tree}, \bold{48}
  \item {\tt dest_eq}, \bold{97}
  \item {\tt dest_state}, \bold{39}
  \item destruct-resolution, 17
  \item {\tt DETERM}, \bold{32}
  \item discrimination nets, \bold{24}
  \item {\tt distinct_subgoals_tac}, \bold{22}
  \item {\tt dmatch_tac}, \bold{17}
  \item {\tt dres_inst_tac}, \bold{18}
  \item {\tt dresolve_tac}, \bold{17}
  \item {\tt dtac}, \bold{19}
  \item {\tt dummyT}, 82, 83, 93
  \item duplicate subgoals
    \subitem removing, 22

  \indexspace

  \item elim-resolution, 16
  \item {\tt ematch_tac}, \bold{17}
  \item {\tt empty} constant, 88
  \item {\tt empty_cs}, \bold{122}
  \item {\tt empty_ss}, 105, 116
  \item {\tt eq_assume_tac}, \bold{17}, 122
  \item {\tt eq_assumption}, \bold{45}
  \item {\tt eq_mp_tac}, \bold{129}
  \item {\tt eq_reflection} theorem, \bold{97}, 113
  \item {\tt eq_thm}, \bold{32}
  \item {\tt equal_elim}, \bold{43}
  \item {\tt equal_intr}, \bold{43}
  \item equality, 95--98
  \item {\tt eres_inst_tac}, \bold{18}
  \item {\tt eresolve_tac}, \bold{16}
  \item {\tt eta_contract}, \bold{4}, 86
  \item {\tt etac}, \bold{19}
  \item {\tt EVERY}, \bold{29}
  \item {\tt EVERY'}, 35
  \item {\tt EVERY1}, \bold{35}
  \item examples
    \subitem of logic definitions, 76
    \subitem of macros, 88, 89
    \subitem of mixfix declarations, 71
    \subitem of simplification, 106
    \subitem of translations, 92
  \item exceptions
    \subitem printing of, 5
  \item {\tt exit}, \bold{2}
  \item {\tt extensional}, \bold{43}

  \indexspace

  \item {\tt fa}, \bold{11}
  \item {\tt Fast_tac}, \bold{128}
  \item {\tt fast_tac}, \bold{127}
  \item {\tt fd}, \bold{11}
  \item {\tt fds}, \bold{11}
  \item {\tt fe}, \bold{11}
  \item {\tt fes}, \bold{11}
  \item files
    \subitem reading, 3, 52
  \item {\tt filt_resolve_tac}, \bold{24}
  \item {\tt FILTER}, \bold{30}
  \item {\tt filter_goal}, \bold{15}
  \item {\tt filter_thms}, \bold{25}
  \item {\tt findE}, \bold{9}
  \item {\tt findEs}, \bold{9}
  \item {\tt findI}, \bold{9}
  \item {\tt FIRST}, \bold{29}
  \item {\tt FIRST'}, 35
  \item {\tt FIRST1}, \bold{35}
  \item {\tt FIRSTGOAL}, \bold{34}
  \item flex-flex constraints, 22, 39, 47
  \item {\tt flexflex_rule}, \bold{47}
  \item {\tt flexflex_tac}, \bold{22}
  \item {\tt fold_goals_tac}, \bold{20}
  \item {\tt fold_tac}, \bold{20}
  \item {\tt forall_elim}, \bold{44}
  \item {\tt forall_elim_list}, \bold{44}
  \item {\tt forall_elim_var}, \bold{44}
  \item {\tt forall_elim_vars}, \bold{44}
  \item {\tt forall_intr}, \bold{44}
  \item {\tt forall_intr_frees}, \bold{44}
  \item {\tt forall_intr_list}, \bold{44}
  \item {\tt force_strip_shyps}, \bold{40}
  \item {\tt forw_inst_tac}, \bold{18}
  \item forward proof, 17, 37
  \item {\tt forward_tac}, \bold{17}
  \item {\tt fr}, \bold{11}
  \item {\tt Free}, \bold{57}, 82
  \item {\tt freezeT}, \bold{45}
  \item {\tt frs}, \bold{11}
  \item {\tt Full_simp_tac}, \bold{100}, 105
  \item {\tt full_simp_tac}, 105, \bold{106}
  \item {\textit {fun}} type, 60
  \item function applications, \bold{57}

  \indexspace

  \item {\tt get_axiom}, \bold{55}
  \item {\tt get_thm}, \bold{55}
  \item {\tt getgoal}, \bold{15}
  \item {\tt gethyps}, \bold{15}, 33
  \item {\tt goal}, \bold{7}, 13
  \item {\tt goals_limit}, \bold{10}
  \item {\tt goalw}, \bold{7}
  \item {\tt goalw_cterm}, \bold{7}

  \indexspace

  \item {\tt has_fewer_prems}, \bold{32}
  \item higher-order pattern, \bold{102}
  \item {\tt hyp_subst_tac}, \bold{96}
  \item {\tt hyp_subst_tacs}, \bold{130}
  \item {\tt HypsubstFun}, 97, 130

  \indexspace

  \item {\tt id} nonterminal, \bold{66}, 80, 87
  \item identifiers, 66
  \item {\tt idt} nonterminal, 86
  \item {\tt idts} nonterminal, \bold{66}, 74
  \item {\tt IF_UNSOLVED}, \bold{32}
  \item {\tt iff_reflection} theorem, 113
  \item {\tt imp_intr} theorem, \bold{97}
  \item {\tt implies_elim}, \bold{43}
  \item {\tt implies_elim_list}, \bold{43}
  \item {\tt implies_intr}, \bold{42}
  \item {\tt implies_intr_hyps}, \bold{42}
  \item {\tt implies_intr_list}, \bold{42}
  \item {\tt incr_boundvars}, \bold{58}, 92
  \item {\tt indexname} ML type, 57, 67
  \item infixes, \bold{73}
  \item {\tt insert} constant, 88
  \item {\tt inst_step_tac}, \bold{128}
  \item {\tt instance} section, 51
  \item {\tt instantiate}, \bold{45}
  \item instantiation, 17, 38, 45
  \item {\tt INTLEAVE}, \bold{28}, 30
  \item {\tt INTLEAVE'}, 35
  \item {\tt invoke_oracle}, \bold{61}
  \item {\tt is} nonterminal, 88

  \indexspace

  \item {\tt joinrules}, \bold{129}

  \indexspace

  \item {\tt keep_derivs}, \bold{48}

  \indexspace

  \item $\lambda$-abstractions, 24, \bold{57}
  \item $\lambda$-calculus, 42, 43, 66
  \item {\tt lessb}, \bold{23}
  \item lexer, \bold{66}
  \item {\tt lift_rule}, \bold{46}
  \item lifting, 46
  \item {\tt loadpath}, \bold{53}
  \item {\tt logic} class, 66, 71
  \item {\tt logic} nonterminal, \bold{66}
  \item {\tt Logic.auto_rename}, \bold{21}
  \item {\tt Logic.set_rename_prefix}, \bold{21}
  \item {\tt loose_bnos}, \bold{58}, 93

  \indexspace

  \item macros, 84--90
  \item {\tt make_elim}, \bold{39}, 123
  \item {\tt Match} exception, 91, 97
  \item {\tt match_tac}, \bold{17}, 122
  \item {\tt max_pri}, 64, \bold{70}
  \item {\tt merge_ss}, 105
  \item {\tt merge_theories}, \bold{55}
  \item meta-assumptions, 33, 41, 42, 45
    \subitem printing of, 4
  \item meta-equality, 41, 43
  \item meta-implication, 41, 42
  \item meta-quantifiers, 42, 44
  \item meta-rewriting, 7, 12, 13, \bold{20}, 
		\seealso{tactics, theorems}{131}
    \subitem in theorems, 38
  \item meta-rules, \see{meta-rules}{1}, 41--47
  \item {\tt METAHYPS}, 15, \bold{33}
  \item mixfix declarations, 50, 69--74
  \item {\tt mk_case_split_tac}, \bold{116}
  \item {\tt ML} section, 51, 91, 93
  \item model checkers, 75
  \item {\tt mp} theorem, \bold{130}
  \item {\tt mp_tac}, \bold{129}
  \item {\tt MRL}, \bold{37}
  \item {\tt MRS}, \bold{37}

  \indexspace

  \item name tokens, \bold{66}
  \item {\tt net_bimatch_tac}, \bold{24}
  \item {\tt net_biresolve_tac}, \bold{24}
  \item {\tt net_match_tac}, \bold{24}
  \item {\tt net_resolve_tac}, \bold{24}
  \item {\tt no_tac}, \bold{30}
  \item {\tt None}, \bold{26}
  \item {\tt not_elim} theorem, \bold{130}
  \item {\tt nprems_of}, \bold{39}
  \item numerals, 66

  \indexspace

  \item {\textit {o}} type, 76
  \item {\tt op} symbol, 73
  \item {\tt option} ML type, 26
  \item oracles, 61--62
  \item {\tt ORELSE}, \bold{28}, 30, 34
  \item {\tt ORELSE'}, 35

  \indexspace

  \item parameters
    \subitem removing unused, 22
    \subitem renaming, 12, 21, 46
  \item {\tt parents_of}, \bold{56}
  \item parse trees, 79
  \item {\tt parse_ast_translation}, 91
  \item {\tt parse_rules}, 86
  \item {\tt parse_translation}, 91
  \item pattern, higher-order, \bold{102}
  \item {\tt pause_tac}, \bold{25}
  \item Poly/{\ML} compiler, 5
  \item {\tt pop_proof}, \bold{14}
  \item {\tt pr}, \bold{10}
  \item {\tt premises}, \bold{7}, 14
  \item {\tt prems_of}, \bold{39}
  \item {\tt prems_of_ss}, 105
  \item pretty printing, 70, 72--73, 89
  \item {\tt Pretty.setdepth}, \bold{3}
  \item {\tt Pretty.setmargin}, \bold{4}
  \item {\tt PRIMITIVE}, \bold{25}
  \item {\tt primrec}, 100
  \item {\tt prin}, 5, \bold{14}
  \item print mode, 50, 93
  \item print modes, 74--75
  \item {\tt print_ast_translation}, 91
  \item {\tt print_cs}, \bold{122}
  \item {\tt print_depth}, \bold{4}
  \item {\tt print_exn}, \bold{5}, 36
  \item {\tt print_goals}, \bold{37}
  \item {\tt print_mode}, 74
  \item {\tt print_modes}, 69
  \item {\tt print_rules}, 86
  \item {\tt print_syntax}, \bold{56}, \bold{68}
  \item {\tt print_tac}, \bold{26}
  \item {\tt print_theory}, \bold{56}
  \item {\tt print_thm}, \bold{37}
  \item {\tt print_translation}, 91
  \item printing control, 3--4
  \item {\tt printyp}, \bold{14}
  \item priorities, 63, \bold{70}
  \item priority grammars, 63--64
  \item {\tt prlev}, \bold{10}
  \item {\tt prlim}, \bold{10}
  \item productions, 63, 69, 70
    \subitem copy, \bold{69}, 70, 81
  \item {\tt proof} ML type, 14
  \item proof objects, 47--48
  \item proof state, 6
    \subitem printing of, 10
  \item {\tt proof_timing}, \bold{10}
  \item proofs, 6--15
    \subitem inspecting the state, 15
    \subitem managing multiple, 13
    \subitem saving and restoring, 14
    \subitem stacking, 13
    \subitem starting, 6
    \subitem timing, 10
  \item {\tt PROP} symbol, 65
  \item {\textit {prop}} type, 60, 66
  \item {\tt prop} nonterminal, \bold{64}, 76
  \item {\tt prove_goal}, 10, \bold{13}
  \item {\tt prove_goalw}, \bold{13}
  \item {\tt prove_goalw_cterm}, \bold{13}
  \item {\tt prth}, \bold{36}
  \item {\tt prthq}, \bold{37}
  \item {\tt prths}, \bold{37}
  \item {\tt prune_params_tac}, \bold{22}
  \item {\tt pttrn} nonterminal, \bold{66}
  \item {\tt pttrns} nonterminal, \bold{66}
  \item {\tt Pure} theory, 49, 64, 68
  \item {\tt Pure.thy}, \bold{55}
  \item {\tt push_proof}, \bold{14}
  \item {\tt pwd}, \bold{3}

  \indexspace

  \item {\tt qed}, \bold{8}, 9
  \item {\tt qed_goal}, \bold{13}
  \item {\tt qed_goalw}, \bold{13}
  \item quantifiers, 74
  \item {\tt quit}, \bold{2}

  \indexspace

  \item {\tt read}, \bold{14}
  \item {\tt read_axm}, \bold{59}
  \item {\tt read_cterm}, \bold{59}
  \item {\tt read_instantiate}, \bold{38}
  \item {\tt read_instantiate_sg}, \bold{38}
  \item reading
    \subitem axioms, \see{{\tt assume_ax}}{49}
    \subitem goals, \see{proofs, starting}{6}
  \item {\tt reflexive}, \bold{43}
  \item {\tt ren}, \bold{12}
  \item {\tt rename_last_tac}, \bold{21}
  \item {\tt rename_params_rule}, \bold{46}
  \item {\tt rename_tac}, \bold{21}
  \item {\tt rep_cterm}, \bold{59}
  \item {\tt rep_ctyp}, \bold{61}
  \item {\tt rep_ss}, 105
  \item {\tt rep_thm}, \bold{40}
  \item {\tt REPEAT}, \bold{29, 30}
  \item {\tt REPEAT1}, \bold{29}
  \item {\tt REPEAT_DETERM}, \bold{29}
  \item {\tt REPEAT_FIRST}, \bold{34}
  \item {\tt REPEAT_SOME}, \bold{34}
  \item {\tt res_inst_tac}, \bold{18}, 22
  \item reserved words, 66, 89
  \item {\tt reset}, 3
  \item resolution, 37, 45
    \subitem tactics, 16
    \subitem without lifting, 46
  \item {\tt resolve_tac}, \bold{16}, 122
  \item {\tt restore_proof}, \bold{14}
  \item {\tt result}, \bold{8}, 15, 55
  \item {\tt rev_mp} theorem, \bold{97}
  \item rewrite rules, 101--102
    \subitem permutative, 110--113
  \item {\tt rewrite_goals_rule}, \bold{38}
  \item {\tt rewrite_goals_tac}, \bold{20}, 38
  \item {\tt rewrite_rule}, \bold{38}
  \item {\tt rewrite_tac}, 8, \bold{20}
  \item rewriting
    \subitem object-level, \see{simplification}{1}
    \subitem ordered, 110
    \subitem syntactic, 84--90
  \item {\tt rewtac}, \bold{19}
  \item {\tt RL}, \bold{37}
  \item {\tt RLN}, \bold{37}
  \item {\tt rotate_proof}, \bold{14}
  \item {\tt rotate_tac}, \bold{22}
  \item {\tt RS}, \bold{37}
  \item {\tt RSN}, \bold{37}
  \item {\tt rtac}, \bold{19}
  \item {\tt rule_by_tactic}, 22, \bold{39}
  \item rules
    \subitem converting destruction to elimination, 39

  \indexspace

  \item {\tt safe_asm_full_simp_tac}, \bold{104}, 105
  \item {\tt Safe_step_tac}, \bold{128}
  \item {\tt safe_step_tac}, 123, \bold{127}
  \item {\tt Safe_tac}, \bold{128}
  \item {\tt safe_tac}, \bold{127}
  \item {\tt save_proof}, \bold{14}
  \item saving your work, \bold{1}
  \item search, 28
    \subitem tacticals, 30--32
  \item {\tt SELECT_GOAL}, 20, \bold{33}
  \item {\tt Sequence.seq} ML type, 25
  \item sequences (lazy lists), \bold{26}
  \item sequent calculus, 119
  \item sessions, 1--5
  \item {\tt set}, 3
  \item {\tt set_current_thy}, 101
  \item {\tt set_oracle}, \bold{61}
  \item {\tt setloop}, 104, 105
  \item {\tt setmksimps}, 102, 105, 116
  \item {\tt setSolver}, 104, 105, 116
  \item {\tt setSSolver}, 104, 105, 116
  \item {\tt setsubgoaler}, 103, 105, 116
  \item {\tt setSWrapper}, \bold{124}
  \item {\tt setWrapper}, \bold{124}
  \item shortcuts
    \subitem for tactics, 18
    \subitem for {\tt by} commands, 10
  \item {\tt show_brackets}, \bold{4}
  \item {\tt show_hyps}, \bold{4}
  \item {\tt show_sorts}, \bold{4}, 83
  \item {\tt show_types}, \bold{4}, 83, 86, 93
  \item {\tt Sign.sg} ML type, 49
  \item {\tt Sign.string_of_term}, \bold{59}
  \item {\tt Sign.string_of_typ}, \bold{60}
  \item {\tt sign_of}, 7, 13, \bold{56}
  \item signatures, \bold{49}, 56, 58, 59, 61
  \item {\tt Simp_tac}, \bold{99}, 105
  \item {\tt simp_tac}, 105, \bold{106}
  \item simplification, 99--117
    \subitem from classical reasoner, 124
    \subitem setting up, 113
    \subitem tactics, 106
  \item simplification sets, 101
  \item simpset
    \subitem current, 99, 101, 106
  \item {\tt simpset}, 105
  \item {\tt simpset} ML type, 105
  \item {\tt simpset} ML value, 101
  \item {\tt simpset_of}, 106
  \item {\tt size_of_thm}, 31, \bold{32}, 130
  \item {\tt sizef}, \bold{130}
  \item {\tt slow_best_tac}, \bold{127}
  \item {\tt slow_step_tac}, 124, \bold{128}
  \item {\tt slow_tac}, \bold{127}
  \item {\tt Some}, \bold{26}
  \item {\tt SOMEGOAL}, \bold{34}
  \item {\tt sort} nonterminal, \bold{66}
  \item sort constraints, 65
  \item sort hypotheses, 40
  \item sorts
    \subitem printing of, 4
  \item {\tt split_tac}, \bold{116}
  \item {\tt ssubst} theorem, \bold{95}
  \item {\tt stac}, \bold{96}
  \item stamps, 39, \bold{49}, 56
  \item {\tt stamps_of_thm}, \bold{39}
  \item {\tt stamps_of_thy}, \bold{56}
  \item {\tt standard}, \bold{39}
  \item starting up, \bold{1}
  \item {\tt Step_tac}, \bold{128}
  \item {\tt step_tac}, 124, \bold{128}
  \item {\tt store_thm}, \bold{8}
  \item {\tt string_of_cterm}, \bold{59}
  \item {\tt string_of_ctyp}, \bold{60}
  \item {\tt string_of_thm}, \bold{37}
  \item strings, 66
  \item {\tt SUBGOAL}, \bold{25}
  \item subgoal module, 6--15
  \item {\tt subgoal_tac}, \bold{19}
  \item {\tt subgoals_of_brl}, \bold{23}
  \item {\tt subgoals_tac}, \bold{19}
  \item {\tt subst} theorem, 95, \bold{97}
  \item substitution
    \subitem rules, 95
  \item {\tt swap} theorem, \bold{130}
  \item {\tt swap_res_tac}, \bold{129}
  \item {\tt swapify}, \bold{129}
  \item {\tt sym} theorem, 96, \bold{97}
  \item {\tt symmetric}, \bold{43}
  \item {\tt syn_of}, \bold{68}
  \item syntax
    \subitem Pure, 64--69
    \subitem transformations, 79--93
  \item {\tt syntax} section, 50
  \item {\tt Syntax.ast} ML type, 79
  \item {\tt Syntax.mark_boundT}, 93
  \item {\tt Syntax.print_gram}, \bold{68}
  \item {\tt Syntax.print_syntax}, \bold{68}
  \item {\tt Syntax.print_trans}, \bold{68}
  \item {\tt Syntax.stat_norm_ast}, 88
  \item {\tt Syntax.syntax} ML type, 68
  \item {\tt Syntax.test_read}, 72, 88
  \item {\tt Syntax.trace_norm_ast}, 88
  \item {\tt Syntax.variant_abs'}, 93

  \indexspace

  \item {\tt tactic} ML type, 16
  \item tacticals, 28--35
    \subitem conditional, 32
    \subitem deterministic, 32
    \subitem for filtering, 30
    \subitem for restriction to a subgoal, 33
    \subitem identities for, 29
    \subitem joining a list of tactics, 29
    \subitem joining tactic functions, 35
    \subitem joining two tactics, 28
    \subitem repetition, 29
    \subitem scanning for subgoals, 34
    \subitem searching, 31
  \item tactics, 16--27
    \subitem assumption, \bold{17}, 18
    \subitem commands for applying, 7
    \subitem debugging, 14
    \subitem filtering results of, 30
    \subitem for composition, 22
    \subitem for contradiction, 129
    \subitem for inserting facts, 19
    \subitem for Modus Ponens, 129
    \subitem instantiation, 17
    \subitem matching, 17
    \subitem meta-rewriting, 18, \bold{20}
    \subitem primitives for coding, 25
    \subitem resolution, \bold{16}, 18, 23, 24
    \subitem restricting to a subgoal, 33
    \subitem simplification, 106
    \subitem substitution, 95--98
    \subitem tracing, 25
  \item {\tt TERM}, 59
  \item {\tt term} ML type, 57, 82
  \item terms, \bold{57}
    \subitem certified, \bold{58}
    \subitem made from ASTs, 82
    \subitem printing of, 14, 59
    \subitem reading of, 14
  \item {\tt TFree}, \bold{60}
  \item {\tt THEN}, \bold{28}, 30, 34
  \item {\tt THEN'}, 35
  \item {\tt THEN_BEST_FIRST}, \bold{31}
  \item theorems, 36--48
    \subitem equality of, 32
    \subitem extracting, 55
    \subitem extracting proved, 8
    \subitem joining by resolution, 37
    \subitem of pure theory, 20
    \subitem printing of, 36
    \subitem retrieving, 9
    \subitem size of, 32
    \subitem standardizing, 38
    \subitem storing, 8
    \subitem taking apart, 39
  \item theories, 49--62
    \subitem axioms of, 55
    \subitem constructing, \bold{55}
    \subitem inspecting, \bold{56}
    \subitem loading, 52
    \subitem parent, \bold{49}
    \subitem pseudo, \bold{54}
    \subitem reloading, \bold{53}
    \subitem removing, \bold{54}
    \subitem theorems of, 55
  \item {\tt THEORY} exception, 49, 55
  \item {\tt theory} ML type, 49
  \item {\tt theory_of_thm}, \bold{39}
  \item {\tt thin_tac}, \bold{22}
  \item {\tt THM} exception, 36, 37, 41, 46
  \item {\tt thm} ML type, 36
  \item {\tt thms_containing}, \bold{9}
  \item {\tt thms_of}, \bold{56}
  \item {\tt tid} nonterminal, \bold{66}, 80, 87
  \item {\tt time_use}, \bold{3}
  \item {\tt time_use_thy}, \bold{53}
  \item timing statistics, 10
  \item {\tt toggle}, 3
  \item token class, 93
  \item token translations, 93--94
  \item token_translation, 94
  \item {\tt token_translation}, 94
  \item {\tt topthm}, \bold{15}
  \item {\tt tpairs_of}, \bold{39}
  \item {\tt trace_BEST_FIRST}, \bold{31}
  \item {\tt trace_DEPTH_FIRST}, \bold{31}
  \item {\tt trace_goalno_tac}, \bold{34}
  \item {\tt trace_REPEAT}, \bold{29}
  \item {\tt trace_simp}, 100, 107
  \item tracing
    \subitem of classical prover, 126
    \subitem of macros, 88
    \subitem of searching tacticals, 31
    \subitem of simplification, 100, 107--108
    \subitem of tactics, 25
    \subitem of unification, 40
  \item {\tt transitive}, \bold{43}
  \item translations, 90--93
    \subitem parse, 74, 82
    \subitem parse AST, \bold{80}, 81
    \subitem print, 74
    \subitem print AST, \bold{83}
  \item {\tt translations} section, 85
  \item {\tt trivial}, \bold{46}
  \item {\tt Trueprop} constant, 76
  \item {\tt TRY}, \bold{29, 30}
  \item {\tt TRYALL}, \bold{34}
  \item {\tt TVar}, \bold{60}
  \item {\tt tvar} nonterminal, \bold{66, 67}, 80, 87
  \item {\tt typ} ML type, 60
  \item {\tt Type}, \bold{60}
  \item {\textit {type}} type, 71
  \item {\tt type} nonterminal, \bold{66}
  \item type constraints, 66, 74, 83
  \item type constructors, \bold{60}
  \item type identifiers, 66
  \item type synonyms, \bold{50}
  \item type unknowns, \bold{60}, 66
    \subitem freezing/thawing of, 45
  \item type variables, \bold{60}
  \item types, \bold{60}
    \subitem certified, \bold{60}
    \subitem printing of, 4, 14, 60

  \indexspace

  \item {\tt undo}, 6, \bold{9}, 13
  \item unknowns, \bold{57}, 66
  \item {\tt unlink_thy}, \bold{54}
  \item {\tt update}, \bold{54}
  \item {\tt uresult}, \bold{8}, 15, 55
  \item {\tt use}, \bold{3}
  \item {\tt use_thy}, \bold{52}, 53

  \indexspace

  \item {\tt Var}, \bold{57}, 82
  \item {\tt var} nonterminal, \bold{66, 67}, 80, 87
  \item {\tt Variable}, 79
  \item variables
    \subitem bound, \bold{57}
    \subitem free, \bold{57}
  \item {\tt variant_abs}, \bold{58}
  \item {\tt varifyT}, \bold{45}

  \indexspace

  \item {\tt xnum} nonterminal, \bold{66}, 80, 87
  \item {\tt xstr} nonterminal, \bold{66}, 80, 87

  \indexspace

  \item {\tt zero_var_indexes}, \bold{39}

\end{theindex}