author | paulson |
Wed, 27 May 1998 12:19:35 +0200 | |
changeset 4969 | 61fd5c1d733f |
parent 4671 | c45cdc1b5e09 |
child 5166 | 94b63faae1c9 |
permissions | -rw-r--r-- |
2665 | 1 |
\begin{theindex} |
2 |
||
4543 | 3 |
\item {\tt !!} symbol, 69 |
4316 | 4 |
\subitem in main goal, 8 |
4543 | 5 |
\item {\tt\$}, \bold{60}, 86 |
6 |
\item {\tt\%} symbol, 69 |
|
7 |
\item {\tt ::} symbol, 69, 70 |
|
8 |
\item {\tt ==} symbol, 69 |
|
9 |
\item {\tt ==>} symbol, 69 |
|
10 |
\item {\tt =>} symbol, 69 |
|
11 |
\item {\tt =?=} symbol, 69 |
|
12 |
\item {\tt\at Enum} constant, 92 |
|
13 |
\item {\tt\at Finset} constant, 92, 93 |
|
14 |
\item {\tt [} symbol, 69 |
|
15 |
\item {\tt [|} symbol, 69 |
|
16 |
\item {\tt ]} symbol, 69 |
|
17 |
\item {\tt _K} constant, 94, 96 |
|
18 |
\item \verb'{}' symbol, 92 |
|
19 |
\item {\tt\ttlbrace} symbol, 69 |
|
20 |
\item {\tt\ttrbrace} symbol, 69 |
|
21 |
\item {\tt |]} symbol, 69 |
|
2665 | 22 |
|
23 |
\indexspace |
|
24 |
||
4543 | 25 |
\item {\tt Abs}, \bold{60}, 86 |
4394 | 26 |
\item {\tt abstract_over}, \bold{61} |
4316 | 27 |
\item {\tt abstract_rule}, \bold{45} |
4394 | 28 |
\item {\tt aconv}, \bold{61} |
4671 | 29 |
\item {\tt addaltern}, \bold{134} |
4969 | 30 |
\item {\tt addbefore}, \bold{133} |
4543 | 31 |
\item {\tt Addcongs}, \bold{105} |
32 |
\item {\tt addcongs}, \bold{109}, 124, 125 |
|
4671 | 33 |
\item {\tt AddDs}, \bold{138} |
4543 | 34 |
\item {\tt addDs}, \bold{132} |
35 |
\item {\tt addeqcongs}, \bold{109}, 124 |
|
4671 | 36 |
\item {\tt AddEs}, \bold{138} |
4543 | 37 |
\item {\tt addEs}, \bold{132} |
4671 | 38 |
\item {\tt AddIs}, \bold{138} |
4543 | 39 |
\item {\tt addIs}, \bold{132} |
40 |
\item {\tt addloop}, \bold{112} |
|
41 |
\item {\tt addSaltern}, \bold{133} |
|
42 |
\item {\tt addSbefore}, \bold{133} |
|
4671 | 43 |
\item {\tt AddSDs}, \bold{138} |
4543 | 44 |
\item {\tt addSDs}, \bold{132} |
4671 | 45 |
\item {\tt AddSEs}, \bold{138} |
4543 | 46 |
\item {\tt addSEs}, \bold{132} |
47 |
\item {\tt Addsimprocs}, \bold{105} |
|
48 |
\item {\tt addsimprocs}, \bold{108} |
|
49 |
\item {\tt Addsimps}, \bold{105} |
|
4671 | 50 |
\item {\tt addsimps}, \bold{108}, 125 |
51 |
\item {\tt AddSIs}, \bold{138} |
|
4543 | 52 |
\item {\tt addSIs}, \bold{132} |
53 |
\item {\tt addSolver}, \bold{111} |
|
4557 | 54 |
\item {\tt addsplits}, \bold{112}, 124, 126 |
4969 | 55 |
\item {\tt addss}, \bold{134}, 135 |
4543 | 56 |
\item {\tt addSSolver}, \bold{111} |
4969 | 57 |
\item {\tt addSWrapper}, \bold{133} |
58 |
\item {\tt addWrapper}, \bold{133} |
|
4316 | 59 |
\item {\tt all_tac}, \bold{31} |
4543 | 60 |
\item {\tt ALLGOALS}, \bold{35}, 116, 119 |
2665 | 61 |
\item ambiguity |
4543 | 62 |
\subitem of parsed expressions, 79 |
4316 | 63 |
\item {\tt ancestors_of}, \bold{59} |
4543 | 64 |
\item {\tt any} nonterminal, \bold{68} |
4316 | 65 |
\item {\tt APPEND}, \bold{29}, 31 |
66 |
\item {\tt APPEND'}, 36 |
|
4543 | 67 |
\item {\tt Appl}, 83 |
68 |
\item {\tt aprop} nonterminal, \bold{70} |
|
4316 | 69 |
\item {\tt ares_tac}, \bold{20} |
4543 | 70 |
\item {\tt args} nonterminal, 93 |
71 |
\item {\tt Arith} theory, 118 |
|
2665 | 72 |
\item arities |
4316 | 73 |
\subitem context conditions, 54 |
4543 | 74 |
\item {\tt Asm_full_simp_tac}, \bold{104} |
75 |
\item {\tt asm_full_simp_tac}, 23, \bold{112}, 117 |
|
76 |
\item {\tt asm_full_simplify}, 113 |
|
4316 | 77 |
\item {\tt asm_rl} theorem, 22 |
4543 | 78 |
\item {\tt Asm_simp_tac}, \bold{103}, 114 |
79 |
\item {\tt asm_simp_tac}, \bold{112}, 125 |
|
80 |
\item {\tt asm_simplify}, 113 |
|
81 |
\item associative-commutative operators, 118 |
|
4608 | 82 |
\item {\tt assume}, \bold{44} |
4316 | 83 |
\item {\tt assume_ax}, 9, \bold{57} |
4543 | 84 |
\item {\tt assume_tac}, \bold{18}, 131 |
4316 | 85 |
\item {\tt assumption}, \bold{47} |
2665 | 86 |
\item assumptions |
4543 | 87 |
\subitem contradictory, 138 |
4316 | 88 |
\subitem deleting, 23 |
4543 | 89 |
\subitem in simplification, 103, 111 |
4316 | 90 |
\subitem inserting, 20 |
4543 | 91 |
\subitem negated, 129 |
4316 | 92 |
\subitem of main goal, 8--10, 15 |
4543 | 93 |
\subitem reordering, 117 |
4316 | 94 |
\subitem rotating, 23 |
4543 | 95 |
\subitem substitution in, 100 |
4316 | 96 |
\subitem tactics for, 18 |
4543 | 97 |
\item ASTs, 83--88 |
98 |
\subitem made from parse trees, 84 |
|
99 |
\subitem made from terms, 86 |
|
4316 | 100 |
\item {\tt atac}, \bold{20} |
4671 | 101 |
\item {\tt Auto_tac}, \bold{138} |
4969 | 102 |
\item {\tt auto_tac} $(cs,ss)$, \bold{136} |
4316 | 103 |
\item {\tt axclass} section, 53 |
104 |
\item axiomatic type class, 53 |
|
2665 | 105 |
\item axioms |
4316 | 106 |
\subitem extracting, 57 |
107 |
\item {\tt axioms_of}, \bold{57} |
|
2665 | 108 |
|
109 |
\indexspace |
|
110 |
||
4316 | 111 |
\item {\tt ba}, \bold{12} |
112 |
\item {\tt back}, \bold{10} |
|
113 |
\item batch execution, 13 |
|
114 |
\item {\tt bd}, \bold{12} |
|
115 |
\item {\tt bds}, \bold{12} |
|
116 |
\item {\tt be}, \bold{12} |
|
117 |
\item {\tt bes}, \bold{12} |
|
118 |
\item {\tt BEST_FIRST}, \bold{32}, 33 |
|
4671 | 119 |
\item {\tt Best_tac}, \bold{138} |
4543 | 120 |
\item {\tt best_tac}, \bold{136} |
4316 | 121 |
\item {\tt beta_conversion}, \bold{45} |
4608 | 122 |
\item {\tt bicompose}, \bold{48} |
4316 | 123 |
\item {\tt bimatch_tac}, \bold{24} |
124 |
\item {\tt bind_thm}, \bold{9}, 10, 38 |
|
4543 | 125 |
\item binders, \bold{78} |
4316 | 126 |
\item {\tt biresolution}, \bold{47} |
4671 | 127 |
\item {\tt biresolve_tac}, \bold{24}, 139 |
4543 | 128 |
\item {\tt Blast.depth_tac}, \bold{135} |
129 |
\item {\tt Blast.trace}, \bold{135} |
|
4671 | 130 |
\item {\tt Blast_tac}, \bold{138} |
4543 | 131 |
\item {\tt blast_tac}, \bold{135} |
132 |
\item {\tt Bound}, \bold{60}, 84, 86, 87 |
|
133 |
\item {\tt bound_hyp_subst_tac}, \bold{100} |
|
4316 | 134 |
\item {\tt br}, \bold{12} |
135 |
\item {\tt BREADTH_FIRST}, \bold{32} |
|
136 |
\item {\tt brs}, \bold{12} |
|
137 |
\item {\tt bw}, \bold{13} |
|
138 |
\item {\tt bws}, \bold{13} |
|
139 |
\item {\tt by}, \bold{8}, 10, 11, 16 |
|
140 |
\item {\tt byev}, \bold{8} |
|
2665 | 141 |
|
142 |
\indexspace |
|
143 |
||
4543 | 144 |
\item {\tt cd}, \bold{3} |
4394 | 145 |
\item {\tt cert_axm}, \bold{62} |
4316 | 146 |
\item {\tt CHANGED}, \bold{31} |
147 |
\item {\tt chop}, \bold{10}, 14 |
|
148 |
\item {\tt choplev}, \bold{10} |
|
4671 | 149 |
\item {\tt Clarify_step_tac}, \bold{138} |
4543 | 150 |
\item {\tt clarify_step_tac}, \bold{134} |
4671 | 151 |
\item {\tt Clarify_tac}, \bold{138} |
4543 | 152 |
\item {\tt clarify_tac}, \bold{134} |
2665 | 153 |
\item claset |
4969 | 154 |
\subitem current, 138 |
4543 | 155 |
\item {\tt claset} ML type, 131 |
2665 | 156 |
\item classes |
4316 | 157 |
\subitem context conditions, 54 |
4671 | 158 |
\item classical reasoner, 127--140 |
159 |
\subitem setting up, 139 |
|
4543 | 160 |
\subitem tactics, 134 |
161 |
\item classical sets, 131 |
|
162 |
\item {\tt ClassicalFun}, 139 |
|
4316 | 163 |
\item {\tt combination}, \bold{45} |
3108 | 164 |
\item {\tt commit}, \bold{2} |
4316 | 165 |
\item {\tt COMP}, \bold{47} |
166 |
\item {\tt compose}, \bold{47} |
|
167 |
\item {\tt compose_tac}, \bold{24} |
|
4608 | 168 |
\item {\tt concl_of}, \bold{41} |
4316 | 169 |
\item {\tt COND}, \bold{33} |
4557 | 170 |
\item congruence rules, 109 |
4543 | 171 |
\item {\tt Const}, \bold{60}, 86, 96 |
172 |
\item {\tt Constant}, 83, 96 |
|
4394 | 173 |
\item constants, \bold{60} |
4543 | 174 |
\subitem for translations, 73 |
175 |
\subitem syntactic, 88 |
|
176 |
\item {\tt context}, 103 |
|
177 |
\item {\tt contr_tac}, \bold{138} |
|
4316 | 178 |
\item {\tt could_unify}, \bold{26} |
4608 | 179 |
\item {\tt cprems_of}, \bold{41} |
4316 | 180 |
\item {\tt cprop_of}, \bold{40} |
181 |
\item {\tt CPure} theory, 51 |
|
182 |
\item {\tt CPure.thy}, \bold{58} |
|
183 |
\item {\tt crep_thm}, \bold{41} |
|
4394 | 184 |
\item {\tt cterm} ML type, 62 |
4316 | 185 |
\item {\tt cterm_instantiate}, \bold{39} |
4394 | 186 |
\item {\tt cterm_of}, 8, 14, \bold{62} |
187 |
\item {\tt ctyp}, \bold{63} |
|
188 |
\item {\tt ctyp_of}, \bold{64} |
|
4543 | 189 |
\item {\tt cut_facts_tac}, 8, \bold{20}, 101 |
4316 | 190 |
\item {\tt cut_inst_tac}, \bold{20} |
191 |
\item {\tt cut_rl} theorem, 22 |
|
2665 | 192 |
|
193 |
\indexspace |
|
194 |
||
4543 | 195 |
\item {\tt datatype}, 105 |
4671 | 196 |
\item {\tt Deepen_tac}, \bold{138} |
4969 | 197 |
\item {\tt deepen_tac}, \bold{137} |
4316 | 198 |
\item {\tt defer_tac}, \bold{21} |
4543 | 199 |
\item definitions, \see{rewriting, meta-level}{1}, 21, \bold{54} |
4316 | 200 |
\subitem unfolding, 8, 9 |
4543 | 201 |
\item {\tt Delcongs}, \bold{105} |
202 |
\item {\tt delcongs}, \bold{109} |
|
203 |
\item {\tt deleqcongs}, \bold{109} |
|
4316 | 204 |
\item {\tt delete_tmpfiles}, \bold{55} |
4543 | 205 |
\item delimiters, \bold{70}, 73, 74, 76 |
206 |
\item {\tt delrules}, \bold{132} |
|
207 |
\item {\tt Delsimprocs}, \bold{105} |
|
208 |
\item {\tt delsimprocs}, \bold{108} |
|
209 |
\item {\tt Delsimps}, \bold{105} |
|
4671 | 210 |
\item {\tt delsimps}, \bold{108} |
4969 | 211 |
\item {\tt delSWrapper}, \bold{133} |
212 |
\item {\tt delWrapper}, \bold{134} |
|
4543 | 213 |
\item {\tt dependent_tr'}, 94, \bold{96} |
4316 | 214 |
\item {\tt DEPTH_FIRST}, \bold{32} |
215 |
\item {\tt DEPTH_SOLVE}, \bold{32} |
|
216 |
\item {\tt DEPTH_SOLVE_1}, \bold{32} |
|
4969 | 217 |
\item {\tt depth_tac}, \bold{137} |
4316 | 218 |
\item {\tt Deriv.drop}, \bold{49} |
219 |
\item {\tt Deriv.linear}, \bold{49} |
|
220 |
\item {\tt Deriv.size}, \bold{49} |
|
221 |
\item {\tt Deriv.tree}, \bold{49} |
|
4543 | 222 |
\item {\tt dest_eq}, \bold{101} |
4597
a0bdee64194c
Fixed a lot of overfull and underfull lines (hboxes)
paulson
parents:
4561
diff
changeset
|
223 |
\item {\tt dest_imp}, \bold{101} |
4316 | 224 |
\item {\tt dest_state}, \bold{41} |
4597
a0bdee64194c
Fixed a lot of overfull and underfull lines (hboxes)
paulson
parents:
4561
diff
changeset
|
225 |
\item {\tt dest_Trueprop}, \bold{101} |
4316 | 226 |
\item destruct-resolution, 18 |
227 |
\item {\tt DETERM}, \bold{33} |
|
228 |
\item discrimination nets, \bold{25} |
|
229 |
\item {\tt distinct_subgoals_tac}, \bold{23} |
|
230 |
\item {\tt dmatch_tac}, \bold{18} |
|
4597
a0bdee64194c
Fixed a lot of overfull and underfull lines (hboxes)
paulson
parents:
4561
diff
changeset
|
231 |
\item {\tt domain_type}, \bold{102} |
4316 | 232 |
\item {\tt dres_inst_tac}, \bold{19} |
233 |
\item {\tt dresolve_tac}, \bold{18} |
|
234 |
\item {\tt dtac}, \bold{20} |
|
4543 | 235 |
\item {\tt dummyT}, 86, 87, 97 |
3498 | 236 |
\item duplicate subgoals |
4316 | 237 |
\subitem removing, 23 |
2665 | 238 |
|
239 |
\indexspace |
|
240 |
||
4316 | 241 |
\item elim-resolution, 17 |
242 |
\item {\tt ematch_tac}, \bold{18} |
|
4543 | 243 |
\item {\tt empty} constant, 92 |
4671 | 244 |
\item {\tt empty_cs}, \bold{132} |
4969 | 245 |
\item {\tt empty_ss}, \bold{107} |
4543 | 246 |
\item {\tt eq_assume_tac}, \bold{18}, 131 |
4316 | 247 |
\item {\tt eq_assumption}, \bold{47} |
4969 | 248 |
\item {\tt eq_mp_tac}, \bold{139} |
4597
a0bdee64194c
Fixed a lot of overfull and underfull lines (hboxes)
paulson
parents:
4561
diff
changeset
|
249 |
\item {\tt eq_reflection} theorem, \bold{102}, 122 |
4316 | 250 |
\item {\tt eq_thm}, \bold{33} |
4394 | 251 |
\item {\tt eq_thy}, \bold{58} |
4316 | 252 |
\item {\tt equal_elim}, \bold{44} |
253 |
\item {\tt equal_intr}, \bold{44} |
|
4543 | 254 |
\item equality, 99--102 |
4316 | 255 |
\item {\tt eres_inst_tac}, \bold{19} |
256 |
\item {\tt eresolve_tac}, \bold{17} |
|
4608 | 257 |
\subitem on other than first premise, 40 |
4316 | 258 |
\item {\tt ERROR}, 5 |
259 |
\item {\tt error}, 5 |
|
260 |
\item error messages, 5 |
|
4543 | 261 |
\item {\tt eta_contract}, \bold{5}, 90 |
4316 | 262 |
\item {\tt etac}, \bold{20} |
263 |
\item {\tt EVERY}, \bold{30} |
|
264 |
\item {\tt EVERY'}, 36 |
|
265 |
\item {\tt EVERY1}, \bold{36} |
|
2665 | 266 |
\item examples |
4543 | 267 |
\subitem of logic definitions, 80 |
268 |
\subitem of macros, 92, 93 |
|
269 |
\subitem of mixfix declarations, 75 |
|
4671 | 270 |
\subitem of simplification, 114 |
4543 | 271 |
\subitem of translations, 96 |
2665 | 272 |
\item exceptions |
3202 | 273 |
\subitem printing of, 5 |
3108 | 274 |
\item {\tt exit}, \bold{2} |
4316 | 275 |
\item {\tt extensional}, \bold{45} |
2665 | 276 |
|
277 |
\indexspace |
|
278 |
||
4316 | 279 |
\item {\tt fa}, \bold{12} |
4671 | 280 |
\item {\tt Fast_tac}, \bold{138} |
4543 | 281 |
\item {\tt fast_tac}, \bold{136} |
4316 | 282 |
\item {\tt fd}, \bold{12} |
283 |
\item {\tt fds}, \bold{12} |
|
284 |
\item {\tt fe}, \bold{12} |
|
285 |
\item {\tt fes}, \bold{12} |
|
2665 | 286 |
\item files |
4543 | 287 |
\subitem reading, 3, 55 |
4316 | 288 |
\item {\tt filt_resolve_tac}, \bold{26} |
289 |
\item {\tt FILTER}, \bold{31} |
|
290 |
\item {\tt filter_goal}, \bold{16} |
|
291 |
\item {\tt filter_thms}, \bold{26} |
|
292 |
\item {\tt findE}, \bold{10} |
|
293 |
\item {\tt findEs}, \bold{10} |
|
294 |
\item {\tt findI}, \bold{10} |
|
295 |
\item {\tt FIRST}, \bold{30} |
|
296 |
\item {\tt FIRST'}, 36 |
|
297 |
\item {\tt FIRST1}, \bold{36} |
|
298 |
\item {\tt FIRSTGOAL}, \bold{35} |
|
299 |
\item flex-flex constraints, 23, 40, 48 |
|
300 |
\item {\tt flexflex_rule}, \bold{48} |
|
301 |
\item {\tt flexflex_tac}, \bold{23} |
|
4543 | 302 |
\item {\tt FOL_basic_ss}, \bold{125} |
303 |
\item {\tt FOL_ss}, \bold{125} |
|
4316 | 304 |
\item {\tt fold_goals_tac}, \bold{21} |
305 |
\item {\tt fold_tac}, \bold{21} |
|
306 |
\item {\tt forall_elim}, \bold{46} |
|
307 |
\item {\tt forall_elim_list}, \bold{46} |
|
308 |
\item {\tt forall_elim_var}, \bold{46} |
|
309 |
\item {\tt forall_elim_vars}, \bold{46} |
|
310 |
\item {\tt forall_intr}, \bold{45} |
|
4608 | 311 |
\item {\tt forall_intr_frees}, \bold{46} |
312 |
\item {\tt forall_intr_list}, \bold{46} |
|
4316 | 313 |
\item {\tt force_strip_shyps}, \bold{41} |
4969 | 314 |
\item {\tt Force_tac}, \bold{138} |
315 |
\item {\tt force_tac}, \bold{136} |
|
4316 | 316 |
\item {\tt forw_inst_tac}, \bold{19} |
317 |
\item forward proof, 18, 38 |
|
318 |
\item {\tt forward_tac}, \bold{18} |
|
319 |
\item {\tt fr}, \bold{12} |
|
4543 | 320 |
\item {\tt Free}, \bold{60}, 86 |
4316 | 321 |
\item {\tt freezeT}, \bold{46} |
322 |
\item {\tt frs}, \bold{12} |
|
4543 | 323 |
\item {\tt Full_simp_tac}, \bold{103} |
324 |
\item {\tt full_simp_tac}, \bold{112} |
|
325 |
\item {\tt full_simplify}, 113 |
|
4394 | 326 |
\item {\textit {fun}} type, 63 |
4316 | 327 |
\item function applications, \bold{60} |
2665 | 328 |
|
329 |
\indexspace |
|
330 |
||
4316 | 331 |
\item {\tt get_axiom}, \bold{57} |
332 |
\item {\tt get_thm}, \bold{57} |
|
333 |
\item {\tt get_thms}, \bold{57} |
|
334 |
\item {\tt getgoal}, \bold{16} |
|
335 |
\item {\tt gethyps}, \bold{16}, 34 |
|
336 |
\item {\tt goal}, \bold{8}, 14 |
|
337 |
\item {\tt goals_limit}, \bold{11} |
|
338 |
\item {\tt goalw}, \bold{8} |
|
339 |
\item {\tt goalw_cterm}, \bold{8} |
|
2665 | 340 |
|
341 |
\indexspace |
|
342 |
||
4316 | 343 |
\item {\tt has_fewer_prems}, \bold{33} |
4543 | 344 |
\item higher-order pattern, \bold{108} |
4969 | 345 |
\item {\tt HOL_basic_ss}, \bold{107} |
4543 | 346 |
\item {\tt hyp_subst_tac}, \bold{100} |
4671 | 347 |
\item {\tt hyp_subst_tacs}, \bold{140} |
348 |
\item {\tt HypsubstFun}, 101, 140 |
|
2665 | 349 |
|
350 |
\indexspace |
|
351 |
||
4543 | 352 |
\item {\tt id} nonterminal, \bold{70}, 84, 91 |
353 |
\item identifiers, 70 |
|
354 |
\item {\tt idt} nonterminal, 90 |
|
355 |
\item {\tt idts} nonterminal, \bold{70}, 78 |
|
4316 | 356 |
\item {\tt IF_UNSOLVED}, \bold{33} |
4543 | 357 |
\item {\tt iff_reflection} theorem, 122 |
358 |
\item {\tt IFOL_ss}, \bold{125} |
|
4597
a0bdee64194c
Fixed a lot of overfull and underfull lines (hboxes)
paulson
parents:
4561
diff
changeset
|
359 |
\item {\tt imp_intr} theorem, \bold{102} |
4316 | 360 |
\item {\tt implies_elim}, \bold{44} |
361 |
\item {\tt implies_elim_list}, \bold{44} |
|
362 |
\item {\tt implies_intr}, \bold{44} |
|
363 |
\item {\tt implies_intr_hyps}, \bold{44} |
|
364 |
\item {\tt implies_intr_list}, \bold{44} |
|
4543 | 365 |
\item {\tt incr_boundvars}, \bold{61}, 96 |
366 |
\item {\tt indexname} ML type, 60, 71 |
|
367 |
\item infixes, \bold{77} |
|
368 |
\item {\tt insert} constant, 92 |
|
369 |
\item {\tt inst_step_tac}, \bold{137} |
|
4316 | 370 |
\item {\tt instance} section, 53 |
371 |
\item {\tt instantiate}, \bold{46} |
|
4383 | 372 |
\item {\tt instantiate'}, \bold{39}, 46 |
4608 | 373 |
\item instantiation, 19, 39, 46 |
4316 | 374 |
\item {\tt INTLEAVE}, \bold{29}, 31 |
375 |
\item {\tt INTLEAVE'}, 36 |
|
4394 | 376 |
\item {\tt invoke_oracle}, \bold{64} |
4543 | 377 |
\item {\tt is} nonterminal, 92 |
2665 | 378 |
|
379 |
\indexspace |
|
380 |
||
4671 | 381 |
\item {\tt joinrules}, \bold{139} |
2665 | 382 |
|
383 |
\indexspace |
|
384 |
||
4316 | 385 |
\item {\tt keep_derivs}, \bold{49} |
2665 | 386 |
|
387 |
\indexspace |
|
388 |
||
4394 | 389 |
\item $\lambda$-abstractions, 25, \bold{60} |
4543 | 390 |
\item $\lambda$-calculus, 43, 45, 70 |
4316 | 391 |
\item {\tt lessb}, \bold{25} |
4543 | 392 |
\item lexer, \bold{70} |
4316 | 393 |
\item {\tt lift_rule}, \bold{48} |
394 |
\item lifting, 48 |
|
395 |
\item {\tt loadpath}, \bold{55} |
|
4543 | 396 |
\item {\tt logic} class, 70, 75 |
397 |
\item {\tt logic} nonterminal, \bold{70} |
|
4316 | 398 |
\item {\tt Logic.auto_rename}, \bold{23} |
399 |
\item {\tt Logic.set_rename_prefix}, \bold{22} |
|
4543 | 400 |
\item {\tt long_names}, \bold{4} |
401 |
\item {\tt loose_bnos}, \bold{61}, 97 |
|
2665 | 402 |
|
403 |
\indexspace |
|
404 |
||
4543 | 405 |
\item macros, 88--94 |
406 |
\item {\tt make_elim}, \bold{40}, 132 |
|
4597
a0bdee64194c
Fixed a lot of overfull and underfull lines (hboxes)
paulson
parents:
4561
diff
changeset
|
407 |
\item {\tt Match} exception, 95 |
4543 | 408 |
\item {\tt match_tac}, \bold{18}, 131 |
409 |
\item {\tt max_pri}, 68, \bold{74} |
|
4671 | 410 |
\item {\tt merge_ss}, \bold{107} |
4316 | 411 |
\item {\tt merge_theories}, \bold{58} |
4608 | 412 |
\item meta-assumptions, 34, 42, 44, 47 |
3108 | 413 |
\subitem printing of, 4 |
4608 | 414 |
\item meta-equality, 43--45 |
4316 | 415 |
\item meta-implication, 43, 44 |
416 |
\item meta-quantifiers, 43, 45 |
|
417 |
\item meta-rewriting, 8, 13, 14, \bold{21}, |
|
4671 | 418 |
\seealso{tactics, theorems}{141} |
4316 | 419 |
\subitem in theorems, 39 |
420 |
\item meta-rules, \see{meta-rules}{1}, 42--48 |
|
421 |
\item {\tt METAHYPS}, 16, \bold{34} |
|
4543 | 422 |
\item mixfix declarations, 52, 73--78 |
4557 | 423 |
\item {\tt mk_case_split_tac}, \bold{125} |
4543 | 424 |
\item {\tt mk_simproc}, \bold{120} |
425 |
\item {\tt ML} section, 53, 95, 97 |
|
426 |
\item model checkers, 79 |
|
427 |
\item {\tt mp} theorem, \bold{139} |
|
4969 | 428 |
\item {\tt mp_tac}, \bold{139} |
4316 | 429 |
\item {\tt MRL}, \bold{38} |
430 |
\item {\tt MRS}, \bold{38} |
|
2665 | 431 |
|
432 |
\indexspace |
|
433 |
||
4543 | 434 |
\item name tokens, \bold{70} |
4969 | 435 |
\item {\tt nat_cancel}, \bold{109} |
4316 | 436 |
\item {\tt net_bimatch_tac}, \bold{25} |
437 |
\item {\tt net_biresolve_tac}, \bold{25} |
|
438 |
\item {\tt net_match_tac}, \bold{25} |
|
439 |
\item {\tt net_resolve_tac}, \bold{25} |
|
440 |
\item {\tt no_tac}, \bold{31} |
|
441 |
\item {\tt None}, \bold{27} |
|
4969 | 442 |
\item {\tt not_elim} theorem, \bold{140} |
4316 | 443 |
\item {\tt nprems_of}, \bold{41} |
4543 | 444 |
\item numerals, 70 |
2665 | 445 |
|
446 |
\indexspace |
|
447 |
||
4543 | 448 |
\item {\textit {o}} type, 80 |
4394 | 449 |
\item {\tt object}, 64 |
4543 | 450 |
\item {\tt op} symbol, 77 |
4316 | 451 |
\item {\tt option} ML type, 27 |
4543 | 452 |
\item oracles, 64--66 |
4316 | 453 |
\item {\tt ORELSE}, \bold{29}, 31, 35 |
454 |
\item {\tt ORELSE'}, 36 |
|
2665 | 455 |
|
456 |
\indexspace |
|
457 |
||
458 |
\item parameters |
|
4316 | 459 |
\subitem removing unused, 23 |
460 |
\subitem renaming, 13, 22, 48 |
|
461 |
\item {\tt parents_of}, \bold{59} |
|
4543 | 462 |
\item parse trees, 83 |
463 |
\item {\tt parse_rules}, 90 |
|
464 |
\item pattern, higher-order, \bold{108} |
|
4316 | 465 |
\item {\tt pause_tac}, \bold{27} |
3108 | 466 |
\item Poly/{\ML} compiler, 5 |
4316 | 467 |
\item {\tt pop_proof}, \bold{15} |
468 |
\item {\tt pr}, \bold{11} |
|
469 |
\item {\tt premises}, \bold{8}, 15 |
|
4608 | 470 |
\item {\tt prems_of}, \bold{41} |
4543 | 471 |
\item {\tt prems_of_ss}, \bold{110} |
472 |
\item pretty printing, 74, 76--77, 93 |
|
4275 | 473 |
\item {\tt Pretty.setdepth}, \bold{4} |
3202 | 474 |
\item {\tt Pretty.setmargin}, \bold{4} |
4316 | 475 |
\item {\tt PRIMITIVE}, \bold{26} |
4543 | 476 |
\item {\tt primrec}, 105 |
4316 | 477 |
\item {\tt prin}, 6, \bold{15} |
4543 | 478 |
\item print mode, 52, 97 |
479 |
\item print modes, 78--79 |
|
4671 | 480 |
\item {\tt print_cs}, \bold{132} |
4394 | 481 |
\item {\tt print_data}, \bold{59} |
3108 | 482 |
\item {\tt print_depth}, \bold{4} |
4316 | 483 |
\item {\tt print_exn}, \bold{6}, 37 |
484 |
\item {\tt print_goals}, \bold{38} |
|
4543 | 485 |
\item {\tt print_mode}, 78 |
486 |
\item {\tt print_modes}, 73 |
|
487 |
\item {\tt print_rules}, 90 |
|
488 |
\item {\tt print_simpset}, \bold{107} |
|
489 |
\item {\tt print_ss}, \bold{106} |
|
490 |
\item {\tt print_syntax}, \bold{59}, \bold{72} |
|
4316 | 491 |
\item {\tt print_tac}, \bold{27} |
4394 | 492 |
\item {\tt print_theory}, \bold{59} |
4316 | 493 |
\item {\tt print_thm}, \bold{38} |
494 |
\item printing control, 3--5 |
|
495 |
\item {\tt printyp}, \bold{15} |
|
4543 | 496 |
\item priorities, 67, \bold{74} |
497 |
\item priority grammars, 67--68 |
|
4316 | 498 |
\item {\tt prlev}, \bold{11} |
499 |
\item {\tt prlim}, \bold{11} |
|
4543 | 500 |
\item productions, 67, 73, 74 |
501 |
\subitem copy, \bold{73}, 74, 85 |
|
4316 | 502 |
\item {\tt proof} ML type, 15 |
503 |
\item proof objects, 48--50 |
|
504 |
\item proof state, 7 |
|
505 |
\subitem printing of, 11 |
|
506 |
\item {\tt proof_timing}, \bold{11} |
|
507 |
\item proofs, 7--16 |
|
508 |
\subitem inspecting the state, 16 |
|
509 |
\subitem managing multiple, 14 |
|
510 |
\subitem saving and restoring, 15 |
|
511 |
\subitem stacking, 14 |
|
512 |
\subitem starting, 7 |
|
513 |
\subitem timing, 11 |
|
4543 | 514 |
\item {\tt PROP} symbol, 69 |
515 |
\item {\textit {prop}} type, 63, 70 |
|
516 |
\item {\tt prop} nonterminal, \bold{68}, 80 |
|
4316 | 517 |
\item {\tt ProtoPure.thy}, \bold{58} |
518 |
\item {\tt prove_goal}, 11, \bold{14} |
|
519 |
\item {\tt prove_goalw}, \bold{14} |
|
520 |
\item {\tt prove_goalw_cterm}, \bold{14} |
|
521 |
\item {\tt prth}, \bold{37} |
|
522 |
\item {\tt prthq}, \bold{38} |
|
523 |
\item {\tt prths}, \bold{38} |
|
524 |
\item {\tt prune_params_tac}, \bold{23} |
|
4543 | 525 |
\item {\tt pttrn} nonterminal, \bold{70} |
526 |
\item {\tt pttrns} nonterminal, \bold{70} |
|
527 |
\item {\tt Pure} theory, 51, 68, 72 |
|
4316 | 528 |
\item {\tt Pure.thy}, \bold{58} |
529 |
\item {\tt push_proof}, \bold{15} |
|
3108 | 530 |
\item {\tt pwd}, \bold{3} |
2665 | 531 |
|
532 |
\indexspace |
|
533 |
||
4316 | 534 |
\item {\tt qed}, \bold{9}, 10, 57 |
535 |
\item {\tt qed_goal}, \bold{14} |
|
536 |
\item {\tt qed_goalw}, \bold{14} |
|
4543 | 537 |
\item quantifiers, 78 |
3108 | 538 |
\item {\tt quit}, \bold{2} |
2665 | 539 |
|
540 |
\indexspace |
|
541 |
||
4316 | 542 |
\item {\tt read}, \bold{15} |
4394 | 543 |
\item {\tt read_axm}, \bold{62} |
544 |
\item {\tt read_cterm}, \bold{62} |
|
4316 | 545 |
\item {\tt read_instantiate}, \bold{39} |
546 |
\item {\tt read_instantiate_sg}, \bold{39} |
|
2665 | 547 |
\item reading |
4316 | 548 |
\subitem axioms, \see{{\tt assume_ax}}{51} |
549 |
\subitem goals, \see{proofs, starting}{7} |
|
4608 | 550 |
\item {\tt reflexive}, \bold{45} |
4316 | 551 |
\item {\tt ren}, \bold{13} |
552 |
\item {\tt rename_last_tac}, \bold{22} |
|
553 |
\item {\tt rename_params_rule}, \bold{48} |
|
554 |
\item {\tt rename_tac}, \bold{22} |
|
4671 | 555 |
\item {\tt rep_cs}, \bold{132} |
4316 | 556 |
\item {\tt rep_cterm}, \bold{62} |
4394 | 557 |
\item {\tt rep_ctyp}, \bold{64} |
4671 | 558 |
\item {\tt rep_ss}, \bold{106} |
4316 | 559 |
\item {\tt rep_thm}, \bold{41} |
560 |
\item {\tt REPEAT}, \bold{30, 31} |
|
561 |
\item {\tt REPEAT1}, \bold{30} |
|
562 |
\item {\tt REPEAT_DETERM}, \bold{30} |
|
563 |
\item {\tt REPEAT_FIRST}, \bold{35} |
|
564 |
\item {\tt REPEAT_SOME}, \bold{35} |
|
565 |
\item {\tt res_inst_tac}, \bold{19}, 23, 24 |
|
4543 | 566 |
\item reserved words, 70, 93 |
3108 | 567 |
\item {\tt reset}, 3 |
4316 | 568 |
\item resolution, 38, 47 |
569 |
\subitem tactics, 17 |
|
570 |
\subitem without lifting, 47 |
|
4543 | 571 |
\item {\tt resolve_tac}, \bold{17}, 131 |
4316 | 572 |
\item {\tt restore_proof}, \bold{15} |
573 |
\item {\tt result}, \bold{9}, 16, 57 |
|
4597
a0bdee64194c
Fixed a lot of overfull and underfull lines (hboxes)
paulson
parents:
4561
diff
changeset
|
574 |
\item {\tt rev_mp} theorem, \bold{102} |
4543 | 575 |
\item rewrite rules, 107--108 |
576 |
\subitem permutative, 117--120 |
|
4316 | 577 |
\item {\tt rewrite_goals_rule}, \bold{39} |
578 |
\item {\tt rewrite_goals_tac}, \bold{21}, 39 |
|
579 |
\item {\tt rewrite_rule}, \bold{39} |
|
580 |
\item {\tt rewrite_tac}, 9, \bold{21} |
|
2665 | 581 |
\item rewriting |
3108 | 582 |
\subitem object-level, \see{simplification}{1} |
4543 | 583 |
\subitem ordered, 117 |
584 |
\subitem syntactic, 88--94 |
|
4316 | 585 |
\item {\tt rewtac}, \bold{20} |
586 |
\item {\tt RL}, \bold{38} |
|
587 |
\item {\tt RLN}, \bold{38} |
|
4608 | 588 |
\item {\tt rotate_prems}, \bold{40} |
4316 | 589 |
\item {\tt rotate_proof}, \bold{15} |
590 |
\item {\tt rotate_tac}, \bold{23} |
|
591 |
\item {\tt RS}, \bold{38} |
|
592 |
\item {\tt RSN}, \bold{38} |
|
593 |
\item {\tt rtac}, \bold{20} |
|
594 |
\item {\tt rule_by_tactic}, 23, \bold{40} |
|
2665 | 595 |
\item rules |
4316 | 596 |
\subitem converting destruction to elimination, 40 |
2665 | 597 |
|
598 |
\indexspace |
|
599 |
||
4671 | 600 |
\item {\tt safe_asm_full_simp_tac}, \bold{113} |
601 |
\item {\tt Safe_step_tac}, \bold{138} |
|
602 |
\item {\tt safe_step_tac}, 133, \bold{137} |
|
603 |
\item {\tt Safe_tac}, \bold{138} |
|
604 |
\item {\tt safe_tac}, \bold{137} |
|
4316 | 605 |
\item {\tt save_proof}, \bold{15} |
2665 | 606 |
\item saving your work, \bold{1} |
4316 | 607 |
\item search, 29 |
608 |
\subitem tacticals, 31--33 |
|
609 |
\item {\tt SELECT_GOAL}, 21, \bold{34} |
|
610 |
\item {\tt Seq.seq} ML type, 26 |
|
611 |
\item sequences (lazy lists), \bold{27} |
|
4543 | 612 |
\item sequent calculus, 128 |
4316 | 613 |
\item sessions, 1--6 |
3108 | 614 |
\item {\tt set}, 3 |
4543 | 615 |
\item {\tt setloop}, \bold{112} |
4969 | 616 |
\item {\tt setmksimps}, 108, \bold{123}, 125 |
4543 | 617 |
\item {\tt setSolver}, \bold{111}, 125 |
618 |
\item {\tt setSSolver}, \bold{111}, 125 |
|
619 |
\item {\tt setsubgoaler}, \bold{110}, 125 |
|
620 |
\item {\tt settermless}, \bold{117} |
|
2665 | 621 |
\item shortcuts |
4608 | 622 |
\subitem for tactics, 20 |
4316 | 623 |
\subitem for {\tt by} commands, 11 |
3108 | 624 |
\item {\tt show_brackets}, \bold{4} |
4316 | 625 |
\item {\tt show_consts}, \bold{4} |
3108 | 626 |
\item {\tt show_hyps}, \bold{4} |
4543 | 627 |
\item {\tt show_sorts}, \bold{4}, 87, 95 |
628 |
\item {\tt show_types}, \bold{4}, 87, 90, 97 |
|
629 |
\item {\tt Sign.certify_term}, \bold{62} |
|
630 |
\item {\tt Sign.certify_typ}, \bold{64} |
|
4316 | 631 |
\item {\tt Sign.sg} ML type, 51 |
632 |
\item {\tt Sign.stamp_names_of}, \bold{59} |
|
4394 | 633 |
\item {\tt Sign.string_of_term}, \bold{62} |
634 |
\item {\tt Sign.string_of_typ}, \bold{63} |
|
4316 | 635 |
\item {\tt sign_of}, 8, 14, \bold{59} |
636 |
\item {\tt sign_of_thm}, \bold{41} |
|
4394 | 637 |
\item signatures, \bold{51}, 59, 61, 62, 64 |
4543 | 638 |
\item {\tt Simp_tac}, \bold{103} |
639 |
\item {\tt simp_tac}, \bold{112} |
|
640 |
\item simplification, 103--126 |
|
641 |
\subitem forward rules, 113 |
|
4969 | 642 |
\subitem from classical reasoner, 134 |
4557 | 643 |
\subitem setting up, 121 |
4543 | 644 |
\subitem tactics, 112 |
645 |
\item simplification sets, 106 |
|
646 |
\item {\tt simplify}, 113 |
|
4671 | 647 |
\item {\tt SIMPSET}, \bold{113} |
2665 | 648 |
\item simpset |
4543 | 649 |
\subitem current, 103, 107 |
650 |
\item {\tt simpset}, \bold{107} |
|
4671 | 651 |
\item {\tt SIMPSET'}, \bold{113} |
4543 | 652 |
\item {\tt simpset_of}, \bold{107} |
653 |
\item {\tt simpset_ref}, \bold{107} |
|
654 |
\item {\tt simpset_ref_of}, \bold{107} |
|
655 |
\item {\tt simpset_thy_data}, \bold{126} |
|
4969 | 656 |
\item {\tt size_of_thm}, 32, \bold{33}, 140 |
657 |
\item {\tt sizef}, \bold{140} |
|
4543 | 658 |
\item {\tt slow_best_tac}, \bold{136} |
659 |
\item {\tt slow_step_tac}, 133, \bold{137} |
|
660 |
\item {\tt slow_tac}, \bold{136} |
|
4316 | 661 |
\item {\tt Some}, \bold{27} |
662 |
\item {\tt SOMEGOAL}, \bold{35} |
|
4543 | 663 |
\item {\tt sort} nonterminal, \bold{70} |
664 |
\item sort constraints, 69 |
|
4316 | 665 |
\item sort hypotheses, 41 |
2665 | 666 |
\item sorts |
3108 | 667 |
\subitem printing of, 4 |
4557 | 668 |
\item {\tt split_tac}, \bold{125} |
4543 | 669 |
\item {\tt ssubst} theorem, \bold{99} |
670 |
\item {\tt stac}, \bold{100} |
|
4316 | 671 |
\item stamps, \bold{51}, 59 |
672 |
\item {\tt standard}, \bold{40} |
|
2665 | 673 |
\item starting up, \bold{1} |
4671 | 674 |
\item {\tt Step_tac}, \bold{138} |
4543 | 675 |
\item {\tt step_tac}, 133, \bold{137} |
4316 | 676 |
\item {\tt store_thm}, \bold{9} |
4394 | 677 |
\item {\tt string_of_cterm}, \bold{62} |
678 |
\item {\tt string_of_ctyp}, \bold{63} |
|
4316 | 679 |
\item {\tt string_of_thm}, \bold{38} |
4543 | 680 |
\item strings, 70 |
4316 | 681 |
\item {\tt SUBGOAL}, \bold{26} |
682 |
\item subgoal module, 7--16 |
|
683 |
\item {\tt subgoal_tac}, \bold{20} |
|
684 |
\item {\tt subgoals_of_brl}, \bold{24} |
|
4608 | 685 |
\item {\tt subgoals_tac}, \bold{21} |
4597
a0bdee64194c
Fixed a lot of overfull and underfull lines (hboxes)
paulson
parents:
4561
diff
changeset
|
686 |
\item {\tt subst} theorem, 99, \bold{102} |
2665 | 687 |
\item substitution |
4543 | 688 |
\subitem rules, 99 |
4394 | 689 |
\item {\tt subthy}, \bold{58} |
4969 | 690 |
\item {\tt swap} theorem, \bold{140} |
691 |
\item {\tt swap_res_tac}, \bold{139} |
|
4671 | 692 |
\item {\tt swapify}, \bold{139} |
4597
a0bdee64194c
Fixed a lot of overfull and underfull lines (hboxes)
paulson
parents:
4561
diff
changeset
|
693 |
\item {\tt sym} theorem, 100, \bold{102} |
4608 | 694 |
\item {\tt symmetric}, \bold{45} |
4543 | 695 |
\item {\tt syn_of}, \bold{72} |
2665 | 696 |
\item syntax |
4543 | 697 |
\subitem Pure, 68--73 |
698 |
\subitem transformations, 83--97 |
|
4316 | 699 |
\item {\tt syntax} section, 52 |
4543 | 700 |
\item {\tt Syntax.ast} ML type, 83 |
701 |
\item {\tt Syntax.mark_boundT}, 97 |
|
702 |
\item {\tt Syntax.print_gram}, \bold{72} |
|
703 |
\item {\tt Syntax.print_syntax}, \bold{72} |
|
704 |
\item {\tt Syntax.print_trans}, \bold{72} |
|
705 |
\item {\tt Syntax.stat_norm_ast}, 92 |
|
706 |
\item {\tt Syntax.syntax} ML type, 72 |
|
707 |
\item {\tt Syntax.test_read}, 76, 92 |
|
708 |
\item {\tt Syntax.trace_norm_ast}, 92 |
|
709 |
\item {\tt Syntax.variant_abs'}, 97 |
|
2665 | 710 |
|
711 |
\indexspace |
|
712 |
||
4316 | 713 |
\item {\tt tactic} ML type, 17 |
714 |
\item tacticals, 29--36 |
|
715 |
\subitem conditional, 33 |
|
716 |
\subitem deterministic, 33 |
|
717 |
\subitem for filtering, 31 |
|
718 |
\subitem for restriction to a subgoal, 34 |
|
719 |
\subitem identities for, 30 |
|
720 |
\subitem joining a list of tactics, 30 |
|
721 |
\subitem joining tactic functions, 36 |
|
722 |
\subitem joining two tactics, 29 |
|
723 |
\subitem repetition, 30 |
|
724 |
\subitem scanning for subgoals, 35 |
|
725 |
\subitem searching, 32 |
|
726 |
\item tactics, 17--28 |
|
4608 | 727 |
\subitem assumption, \bold{18}, 20 |
4316 | 728 |
\subitem commands for applying, 8 |
729 |
\subitem debugging, 15 |
|
730 |
\subitem filtering results of, 31 |
|
731 |
\subitem for composition, 24 |
|
4543 | 732 |
\subitem for contradiction, 138 |
4316 | 733 |
\subitem for inserting facts, 20 |
4543 | 734 |
\subitem for Modus Ponens, 138 |
4608 | 735 |
\subitem instantiation, 19 |
4316 | 736 |
\subitem matching, 18 |
4608 | 737 |
\subitem meta-rewriting, 20, \bold{21} |
4316 | 738 |
\subitem primitives for coding, 26 |
4608 | 739 |
\subitem resolution, \bold{17}, 20, 24, 25 |
4316 | 740 |
\subitem restricting to a subgoal, 34 |
4543 | 741 |
\subitem simplification, 112 |
742 |
\subitem substitution, 99--102 |
|
4316 | 743 |
\subitem tracing, 27 |
4394 | 744 |
\item {\tt TERM}, 62 |
4543 | 745 |
\item {\tt term} ML type, 60, 86 |
4394 | 746 |
\item terms, \bold{60} |
4316 | 747 |
\subitem certified, \bold{61} |
4543 | 748 |
\subitem made from ASTs, 86 |
4394 | 749 |
\subitem printing of, 15, 62 |
4316 | 750 |
\subitem reading of, 15 |
4394 | 751 |
\item {\tt TFree}, \bold{63} |
4316 | 752 |
\item {\tt THEN}, \bold{29}, 31, 35 |
753 |
\item {\tt THEN'}, 36 |
|
754 |
\item {\tt THEN_BEST_FIRST}, \bold{32} |
|
755 |
\item theorems, 37--50 |
|
756 |
\subitem equality of, 33 |
|
757 |
\subitem extracting, 57 |
|
758 |
\subitem extracting proved, 9 |
|
759 |
\subitem joining by resolution, 38 |
|
760 |
\subitem of pure theory, 22 |
|
761 |
\subitem printing of, 37 |
|
762 |
\subitem retrieving, 10 |
|
763 |
\subitem size of, 33 |
|
764 |
\subitem standardizing, 40 |
|
765 |
\subitem storing, 9 |
|
766 |
\subitem taking apart, 40 |
|
4543 | 767 |
\item theories, 51--66 |
4316 | 768 |
\subitem axioms of, 57 |
769 |
\subitem constructing, \bold{58} |
|
4394 | 770 |
\subitem inspecting, \bold{59} |
4543 | 771 |
\subitem loading, 55 |
4316 | 772 |
\subitem parent, \bold{51} |
773 |
\subitem pseudo, \bold{56} |
|
774 |
\subitem reloading, \bold{55} |
|
775 |
\subitem removing, \bold{56} |
|
776 |
\subitem theorems of, 57 |
|
777 |
\item {\tt THEORY} exception, 51, 57 |
|
778 |
\item {\tt theory} ML type, 51 |
|
4394 | 779 |
\item {\tt Theory.add_oracle}, \bold{64} |
4316 | 780 |
\item {\tt theory_of_thm}, \bold{41} |
4597
a0bdee64194c
Fixed a lot of overfull and underfull lines (hboxes)
paulson
parents:
4561
diff
changeset
|
781 |
\item {\tt thin_refl} theorem, \bold{102} |
4316 | 782 |
\item {\tt thin_tac}, \bold{23} |
783 |
\item {\tt THM} exception, 37, 38, 42, 47 |
|
784 |
\item {\tt thm} ML type, 37 |
|
785 |
\item {\tt thms_containing}, \bold{10} |
|
786 |
\item {\tt thms_of}, \bold{57} |
|
4543 | 787 |
\item {\tt thy_data}, \bold{126} |
788 |
\item {\tt tid} nonterminal, \bold{70}, 84, 91 |
|
3108 | 789 |
\item {\tt time_use}, \bold{3} |
4316 | 790 |
\item {\tt time_use_thy}, \bold{55} |
791 |
\item timing statistics, 11 |
|
3108 | 792 |
\item {\tt toggle}, 3 |
4543 | 793 |
\item token class, 97 |
794 |
\item token translations, 97--98 |
|
795 |
\item token_translation, 98 |
|
796 |
\item {\tt token_translation}, 98 |
|
4316 | 797 |
\item {\tt topthm}, \bold{16} |
798 |
\item {\tt tpairs_of}, \bold{41} |
|
799 |
\item {\tt trace_BEST_FIRST}, \bold{32} |
|
800 |
\item {\tt trace_DEPTH_FIRST}, \bold{32} |
|
801 |
\item {\tt trace_goalno_tac}, \bold{35} |
|
802 |
\item {\tt trace_REPEAT}, \bold{30} |
|
4543 | 803 |
\item {\tt trace_simp}, \bold{104}, 115 |
2665 | 804 |
\item tracing |
4543 | 805 |
\subitem of classical prover, 135 |
806 |
\subitem of macros, 92 |
|
4316 | 807 |
\subitem of searching tacticals, 32 |
4969 | 808 |
\subitem of simplification, 105, 115--116 |
4316 | 809 |
\subitem of tactics, 27 |
810 |
\subitem of unification, 42 |
|
4394 | 811 |
\item {\tt transfer}, \bold{58} |
812 |
\item {\tt transfer_sg}, \bold{58} |
|
4316 | 813 |
\item {\tt transitive}, \bold{45} |
4543 | 814 |
\item translations, 94--97 |
815 |
\subitem parse, 78, 86 |
|
816 |
\subitem parse AST, \bold{84}, 85 |
|
817 |
\subitem print, 78 |
|
818 |
\subitem print AST, \bold{87} |
|
819 |
\item {\tt translations} section, 89 |
|
4316 | 820 |
\item {\tt trivial}, \bold{48} |
4543 | 821 |
\item {\tt Trueprop} constant, 80 |
4316 | 822 |
\item {\tt TRY}, \bold{30, 31} |
823 |
\item {\tt TRYALL}, \bold{35} |
|
4394 | 824 |
\item {\tt TVar}, \bold{63} |
4543 | 825 |
\item {\tt tvar} nonterminal, \bold{70, 71}, 84, 91 |
4394 | 826 |
\item {\tt typ} ML type, 63 |
827 |
\item {\tt Type}, \bold{63} |
|
4543 | 828 |
\item {\textit {type}} type, 75 |
829 |
\item {\tt type} nonterminal, \bold{70} |
|
830 |
\item type constraints, 70, 78, 87 |
|
4394 | 831 |
\item type constructors, \bold{63} |
4543 | 832 |
\item type identifiers, 70 |
4316 | 833 |
\item type synonyms, \bold{52} |
4543 | 834 |
\item type unknowns, \bold{63}, 70 |
4316 | 835 |
\subitem freezing/thawing of, 46 |
4394 | 836 |
\item type variables, \bold{63} |
837 |
\item types, \bold{63} |
|
838 |
\subitem certified, \bold{63} |
|
839 |
\subitem printing of, 4, 15, 63 |
|
2665 | 840 |
|
841 |
\indexspace |
|
842 |
||
4316 | 843 |
\item {\tt undo}, 7, \bold{10}, 14 |
4543 | 844 |
\item unknowns, \bold{60}, 70 |
4316 | 845 |
\item {\tt unlink_thy}, \bold{56} |
846 |
\item {\tt update}, \bold{56} |
|
847 |
\item {\tt uresult}, \bold{9}, 16, 57 |
|
3108 | 848 |
\item {\tt use}, \bold{3} |
4543 | 849 |
\item {\tt use_thy}, \bold{55} |
2665 | 850 |
|
851 |
\indexspace |
|
852 |
||
4543 | 853 |
\item {\tt Var}, \bold{60}, 86 |
854 |
\item {\tt var} nonterminal, \bold{70, 71}, 84, 91 |
|
855 |
\item {\tt Variable}, 83 |
|
2665 | 856 |
\item variables |
4394 | 857 |
\subitem bound, \bold{60} |
858 |
\subitem free, \bold{60} |
|
859 |
\item {\tt variant_abs}, \bold{61} |
|
4316 | 860 |
\item {\tt varifyT}, \bold{46} |
2665 | 861 |
|
862 |
\indexspace |
|
863 |
||
4316 | 864 |
\item {\tt warning}, 5 |
865 |
\item warnings, 5 |
|
866 |
\item {\tt writeln}, 5 |
|
2665 | 867 |
|
868 |
\indexspace |
|
869 |
||
4543 | 870 |
\item {\tt xnum} nonterminal, \bold{70}, 84, 91 |
871 |
\item {\tt xstr} nonterminal, \bold{70}, 84, 91 |
|
4316 | 872 |
|
873 |
\indexspace |
|
874 |
||
875 |
\item {\tt zero_var_indexes}, \bold{40} |
|
2665 | 876 |
|
877 |
\end{theindex} |