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