11414
|
1 |
\begin{theindex}
|
|
2 |
|
|
3 |
\item \ttall, \bold{189}
|
11457
|
4 |
\item \texttt{?}, \bold{189}
|
11450
|
5 |
\item \isasymuniqex, \bold{189}
|
11414
|
6 |
\item \ttuniquex, \bold{189}
|
|
7 |
\item {\texttt {\&}}, \bold{189}
|
|
8 |
\item \verb$~$, \bold{189}
|
|
9 |
\item \verb$~=$, \bold{189}
|
|
10 |
\item \ttor, \bold{189}
|
|
11 |
\item \texttt{[]}, \bold{7}
|
|
12 |
\item \texttt{\#}, \bold{7}
|
11431
|
13 |
\item \texttt{\at}, \bold{8}, 189
|
11414
|
14 |
\item \isasymnotin, \bold{189}
|
|
15 |
\item \verb$~:$, \bold{189}
|
|
16 |
\item \isasymInter, \bold{189}
|
|
17 |
\item \isasymUnion, \bold{189}
|
|
18 |
\item \isasyminverse, \bold{189}
|
|
19 |
\item \verb$^-1$, \bold{189}
|
|
20 |
\item \isactrlsup{\isacharasterisk}, \bold{189}
|
|
21 |
\item \verb$^$\texttt{*}, \bold{189}
|
|
22 |
\item \isasymAnd, \bold{10}, \bold{189}
|
|
23 |
\item \ttAnd, \bold{189}
|
11457
|
24 |
\item \isasymrightleftharpoons, 24
|
|
25 |
\item \isasymrightharpoonup, 24
|
|
26 |
\item \isasymleftharpoondown, 24
|
|
27 |
\item \emph {$\Rightarrow $}, \bold{3}
|
11414
|
28 |
\item \ttlbr, \bold{189}
|
|
29 |
\item \ttrbr, \bold{189}
|
|
30 |
\item \texttt {\%}, \bold{189}
|
|
31 |
\item \texttt {;}, \bold{5}
|
11457
|
32 |
\item \isa {()} (constant), 22
|
11431
|
33 |
\item \isa {+} (tactical), 83
|
11414
|
34 |
\item \isa {<*lex*>}, \see{lexicographic product}{1}
|
11431
|
35 |
\item \isa {?} (tactical), 83
|
|
36 |
\item \texttt{|} (tactical), 83
|
11414
|
37 |
|
|
38 |
\indexspace
|
|
39 |
|
11431
|
40 |
\item \isa {0} (constant), 20, 21, 133
|
|
41 |
\item \isa {1} (symbol), 133
|
|
42 |
\item \isa {2} (symbol), 133
|
11414
|
43 |
|
|
44 |
\indexspace
|
|
45 |
|
11428
|
46 |
\item abandoning a proof, \bold{11}
|
|
47 |
\item abandoning a theory, \bold{14}
|
11431
|
48 |
\item \isa {abs} (constant), 135
|
11414
|
49 |
\item \texttt {abs}, \bold{189}
|
11431
|
50 |
\item absolute value, 135
|
11458
|
51 |
\item \isa {add} (modifier), 27
|
11414
|
52 |
\item \isa {add_assoc} (theorem), \bold{134}
|
|
53 |
\item \isa {add_commute} (theorem), \bold{134}
|
|
54 |
\item \isa {add_mult_distrib} (theorem), \bold{133}
|
|
55 |
\item \texttt {ALL}, \bold{189}
|
11431
|
56 |
\item \isa {All} (constant), 93
|
11414
|
57 |
\item \isa {allE} (theorem), \bold{65}
|
|
58 |
\item \isa {allI} (theorem), \bold{64}
|
11457
|
59 |
\item append function, 8--12
|
11431
|
60 |
\item \isacommand {apply} (command), 13
|
11414
|
61 |
\item \isa {arg_cong} (theorem), \bold{80}
|
11431
|
62 |
\item \isa {arith} (method), 21, 131
|
11457
|
63 |
\item arithmetic operations
|
|
64 |
\subitem for \protect\isa{nat}, 21
|
11414
|
65 |
\item \textsc {ascii} symbols, \bold{189}
|
11431
|
66 |
\item associative-commutative function, 158
|
|
67 |
\item \isa {assumption} (method), 53
|
11414
|
68 |
\item assumptions
|
11457
|
69 |
\subitem of subgoal, 10
|
11431
|
70 |
\subitem renaming, 66--67
|
|
71 |
\subitem reusing, 67
|
11458
|
72 |
\item \isa {auto} (method), 35, 76
|
11431
|
73 |
\item \isa {axclass}, 144--150
|
|
74 |
\item axiom of choice, 70
|
|
75 |
\item axiomatic type classes, 144--150
|
11414
|
76 |
|
|
77 |
\indexspace
|
|
78 |
|
11431
|
79 |
\item \isacommand {back} (command), 62
|
|
80 |
\item \isa {Ball} (constant), 93
|
11414
|
81 |
\item \isa {ballI} (theorem), \bold{92}
|
11458
|
82 |
\item \isa {best} (method), 76
|
11431
|
83 |
\item \isa {Bex} (constant), 93
|
11414
|
84 |
\item \isa {bexE} (theorem), \bold{92}
|
|
85 |
\item \isa {bexI} (theorem), \bold{92}
|
|
86 |
\item \isa {bij_def} (theorem), \bold{94}
|
11431
|
87 |
\item bijections, 94
|
11457
|
88 |
\item binary trees, 16
|
11431
|
89 |
\item binomial coefficients, 93
|
|
90 |
\item bisimulations, 100
|
11458
|
91 |
\item \isa {blast} (method), 73--74, 76
|
11431
|
92 |
\item \isa {bool} (type), 2, 3
|
11457
|
93 |
\item boolean expressions example, 18--20
|
11414
|
94 |
\item \isa {bspec} (theorem), \bold{92}
|
11431
|
95 |
\item \isacommand{by} (command), 57
|
11414
|
96 |
|
|
97 |
\indexspace
|
|
98 |
|
11431
|
99 |
\item \isa {card} (constant), 93
|
11414
|
100 |
\item \isa {card_Pow} (theorem), \bold{93}
|
|
101 |
\item \isa {card_Un_Int} (theorem), \bold{93}
|
11431
|
102 |
\item cardinality, 93
|
11457
|
103 |
\item \isa {case} (symbol), 30, 31
|
|
104 |
\item \isa {case} expressions, 3, 4, 16
|
|
105 |
\item case distinctions, 17
|
11414
|
106 |
\item case splits, \bold{29}
|
11431
|
107 |
\item \isa {case_tac} (method), 17, 85
|
11458
|
108 |
\item \isa {clarify} (method), 75, 76
|
11431
|
109 |
\item \isa {clarsimp} (method), 75, 76
|
11414
|
110 |
\item \isa {classical} (theorem), \bold{57}
|
|
111 |
\item coinduction, \bold{100}
|
11431
|
112 |
\item \isa {Collect} (constant), 93
|
11414
|
113 |
\item \isa {comp_def} (theorem), \bold{96}
|
11458
|
114 |
\item compiling expressions example, 34--36
|
11414
|
115 |
\item \isa {Compl_iff} (theorem), \bold{90}
|
|
116 |
\item complement
|
11431
|
117 |
\subitem of a set, 89
|
11414
|
118 |
\item composition
|
|
119 |
\subitem of functions, \bold{94}
|
|
120 |
\subitem of relations, \bold{96}
|
11457
|
121 |
\item conclusion
|
|
122 |
\subitem of subgoal, 10
|
11450
|
123 |
\item conditional expressions, \see{\isa{if} expressions}{1}
|
11458
|
124 |
\item conditional simplification rules, 29
|
|
125 |
\item \isa {cong} (attribute), 158
|
11414
|
126 |
\item congruence rules, \bold{157}
|
|
127 |
\item \isa {conjE} (theorem), \bold{55}
|
|
128 |
\item \isa {conjI} (theorem), \bold{52}
|
11431
|
129 |
\item \isa {Cons} (constant), 7
|
|
130 |
\item \isacommand {constdefs} (command), 23
|
11457
|
131 |
\item \isacommand {consts} (command), 8
|
11431
|
132 |
\item contrapositives, 57
|
11414
|
133 |
\item converse
|
|
134 |
\subitem of a relation, \bold{96}
|
|
135 |
\item \isa {converse_iff} (theorem), \bold{96}
|
11431
|
136 |
\item CTL, 100--110
|
11414
|
137 |
|
|
138 |
\indexspace
|
|
139 |
|
11458
|
140 |
\item \isacommand {datatype} (command), 7, 36--41
|
11457
|
141 |
\item datatypes, 15--20
|
11458
|
142 |
\subitem and nested recursion, 38
|
|
143 |
\subitem mutually recursive, 36
|
11431
|
144 |
\item \isacommand {defer} (command), 14, 84
|
11457
|
145 |
\item Definitional Approach, 24
|
11428
|
146 |
\item definitions, \bold{23}
|
11414
|
147 |
\subitem unfolding, \bold{28}
|
11431
|
148 |
\item \isacommand {defs} (command), 23
|
11458
|
149 |
\item \isa {del} (modifier), 27
|
|
150 |
\item description operators, 69--71
|
11414
|
151 |
\item descriptions
|
11431
|
152 |
\subitem definite, 69
|
|
153 |
\subitem indefinite, 70
|
|
154 |
\item \isa {dest} (attribute), 86
|
|
155 |
\item destruction rules, 55
|
11414
|
156 |
\item \isa {diff_mult_distrib} (theorem), \bold{133}
|
|
157 |
\item difference
|
|
158 |
\subitem of sets, \bold{90}
|
|
159 |
\item \isa {disjCI} (theorem), \bold{58}
|
|
160 |
\item \isa {disjE} (theorem), \bold{54}
|
11457
|
161 |
\item \isa {div} (symbol), 21
|
11458
|
162 |
\item divides relation, 68, 79, 85--88, 134
|
11424
|
163 |
\item division
|
11431
|
164 |
\subitem by negative numbers, 135
|
|
165 |
\subitem by zero, 134
|
|
166 |
\subitem for type \protect\isa{nat}, 133
|
11414
|
167 |
\item domain
|
11431
|
168 |
\subitem of a relation, 96
|
11414
|
169 |
\item \isa {Domain_iff} (theorem), \bold{96}
|
11431
|
170 |
\item \isacommand {done} (command), 11
|
|
171 |
\item \isa {drule_tac} (method), 60, 80
|
11424
|
172 |
\item \isa {dvd_add} (theorem), \bold{134}
|
11414
|
173 |
\item \isa {dvd_anti_sym} (theorem), \bold{134}
|
11424
|
174 |
\item \isa {dvd_def} (theorem), \bold{134}
|
11414
|
175 |
|
|
176 |
\indexspace
|
|
177 |
|
11431
|
178 |
\item \isa {elim!} (attribute), 115
|
|
179 |
\item elimination rules, 53--54
|
11457
|
180 |
\item \isacommand {end} (command), 12
|
11431
|
181 |
\item \isa {Eps} (constant), 93
|
11450
|
182 |
\item equality, 3
|
11414
|
183 |
\subitem of functions, \bold{93}
|
11431
|
184 |
\subitem of records, 143
|
11414
|
185 |
\subitem of sets, \bold{90}
|
|
186 |
\item \isa {equalityE} (theorem), \bold{90}
|
|
187 |
\item \isa {equalityI} (theorem), \bold{90}
|
11431
|
188 |
\item \isa {erule} (method), 54
|
|
189 |
\item \isa {erule_tac} (method), 60
|
11458
|
190 |
\item Euclid's algorithm, 85--88
|
11414
|
191 |
\item even numbers
|
11431
|
192 |
\subitem defining inductively, 111--115
|
11414
|
193 |
\item \texttt {EX}, \bold{189}
|
11431
|
194 |
\item \isa {Ex} (constant), 93
|
11414
|
195 |
\item \isa {exE} (theorem), \bold{66}
|
|
196 |
\item \isa {exI} (theorem), \bold{66}
|
|
197 |
\item \isa {ext} (theorem), \bold{93}
|
|
198 |
\item extensionality
|
|
199 |
\subitem for functions, \bold{93, 94}
|
11431
|
200 |
\subitem for records, 143
|
11414
|
201 |
\subitem for sets, \bold{90}
|
|
202 |
\item \ttEXU, \bold{189}
|
|
203 |
|
|
204 |
\indexspace
|
|
205 |
|
11431
|
206 |
\item \isa {False} (constant), 3
|
11458
|
207 |
\item \isa {fast} (method), 76
|
|
208 |
\item Fibonacci function, 44
|
11431
|
209 |
\item \isa {finite} (symbol), 93
|
|
210 |
\item \isa {Finites} (constant), 93
|
|
211 |
\item fixed points, 100
|
|
212 |
\item flags, 3, 4, 31
|
|
213 |
\subitem setting and resetting, 3
|
|
214 |
\item \isa {force} (method), 75, 76
|
11450
|
215 |
\item formulae, 3
|
11431
|
216 |
\item forward proof, 76--82
|
|
217 |
\item \isa {frule} (method), 67
|
|
218 |
\item \isa {frule_tac} (method), 60
|
11457
|
219 |
\item \isa {fst} (constant), 22
|
11450
|
220 |
\item function types, 3
|
11431
|
221 |
\item functions, 93--95
|
11458
|
222 |
\subitem total, 9, 44--50
|
11431
|
223 |
\subitem underdefined, 165
|
11414
|
224 |
|
|
225 |
\indexspace
|
|
226 |
|
11458
|
227 |
\item \isa {gcd} (constant), 77--78, 85--88
|
11431
|
228 |
\item generalizing for induction, 113
|
11458
|
229 |
\item generalizing induction formulae, 32
|
11414
|
230 |
\item Girard, Jean-Yves, \fnote{55}
|
11450
|
231 |
\item Gordon, Mike, 1
|
11431
|
232 |
\item ground terms example, 119--124
|
11414
|
233 |
|
|
234 |
\indexspace
|
|
235 |
|
11458
|
236 |
\item \isa {hd} (constant), 15, 35
|
11414
|
237 |
\item higher-order pattern, \bold{159}
|
11458
|
238 |
\item Hilbert's $\varepsilon$-operator, 70
|
|
239 |
\item HOLCF, 41
|
11431
|
240 |
\item \isa {hypreal} (type), 137
|
11414
|
241 |
|
|
242 |
\indexspace
|
|
243 |
|
|
244 |
\item \isa {Id_def} (theorem), \bold{96}
|
|
245 |
\item \isa {id_def} (theorem), \bold{94}
|
11457
|
246 |
\item identifiers, \bold{4}
|
11414
|
247 |
\subitem qualified, \bold{2}
|
|
248 |
\item identity function, \bold{94}
|
|
249 |
\item identity relation, \bold{96}
|
11450
|
250 |
\item \isa {if} expressions, 3, 4
|
11458
|
251 |
\subitem simplification of, 31
|
|
252 |
\subitem splitting of, 29
|
11450
|
253 |
\item if-and-only-if, 3
|
11458
|
254 |
\item \isa {iff} (attribute), 74, 86, 114
|
11414
|
255 |
\item \isa {iffD1} (theorem), \bold{78}
|
|
256 |
\item \isa {iffD2} (theorem), \bold{78}
|
|
257 |
\item image
|
|
258 |
\subitem under a function, \bold{95}
|
|
259 |
\subitem under a relation, \bold{96}
|
|
260 |
\item \isa {image_def} (theorem), \bold{95}
|
|
261 |
\item \isa {Image_iff} (theorem), \bold{96}
|
|
262 |
\item \isa {impI} (theorem), \bold{56}
|
11431
|
263 |
\item implication, 56--57
|
|
264 |
\item \isa {induct_tac} (method), 10, 17, 50, 172
|
|
265 |
\item induction, 168--175
|
|
266 |
\subitem recursion, 49--50
|
11457
|
267 |
\subitem structural, 17
|
11431
|
268 |
\subitem well-founded, 99
|
11458
|
269 |
\item induction heuristics, 31--33
|
11431
|
270 |
\item \isacommand {inductive} (command), 111
|
11428
|
271 |
\item inductive definition
|
11431
|
272 |
\subitem simultaneous, 125
|
|
273 |
\item inductive definitions, 111--129
|
|
274 |
\item \isacommand {inductive\_cases} (command), 115, 123
|
11458
|
275 |
\item infinitely branching trees, 40
|
11431
|
276 |
\item \isacommand{infixr} (annotation), 8
|
11414
|
277 |
\item \isa {inj_on_def} (theorem), \bold{94}
|
11431
|
278 |
\item injections, 94
|
|
279 |
\item \isa {insert} (constant), 91
|
11458
|
280 |
\item \isa {insert} (method), 81--82
|
11414
|
281 |
\item instance, \bold{145}
|
|
282 |
\item \texttt {INT}, \bold{189}
|
|
283 |
\item \texttt {Int}, \bold{189}
|
11431
|
284 |
\item \isa {int} (type), 135
|
11414
|
285 |
\item \isa {INT_iff} (theorem), \bold{92}
|
|
286 |
\item \isa {IntD1} (theorem), \bold{89}
|
|
287 |
\item \isa {IntD2} (theorem), \bold{89}
|
11431
|
288 |
\item integers, 135
|
|
289 |
\item \isa {INTER} (constant), 93
|
11414
|
290 |
\item \texttt {Inter}, \bold{189}
|
|
291 |
\item \isa {Inter_iff} (theorem), \bold{92}
|
11431
|
292 |
\item intersection, 89
|
|
293 |
\subitem indexed, 92
|
11414
|
294 |
\item \isa {IntI} (theorem), \bold{89}
|
11431
|
295 |
\item \isa {intro} (method), 58
|
|
296 |
\item \isa {intro!} (attribute), 112
|
|
297 |
\item introduction rules, 52--53
|
|
298 |
\item \isa {inv} (constant), 70
|
11414
|
299 |
\item \isa {inv_image_def} (theorem), \bold{99}
|
|
300 |
\item inverse
|
|
301 |
\subitem of a function, \bold{94}
|
|
302 |
\subitem of a relation, \bold{96}
|
|
303 |
\item inverse image
|
11431
|
304 |
\subitem of a function, 95
|
|
305 |
\subitem of a relation, 98
|
11458
|
306 |
\item \isa {itrev} (constant), 32
|
11414
|
307 |
|
|
308 |
\indexspace
|
|
309 |
|
11431
|
310 |
\item \isacommand {kill} (command), 14
|
11414
|
311 |
|
|
312 |
\indexspace
|
|
313 |
|
11450
|
314 |
\item $\lambda$ expressions, 3
|
11458
|
315 |
\item LCF, 41
|
11431
|
316 |
\item \isa {LEAST} (symbol), 21, 69
|
11428
|
317 |
\item least number operator, \see{\protect\isa{LEAST}}{69}
|
11431
|
318 |
\item \isacommand {lemma} (command), 11
|
|
319 |
\item \isacommand {lemmas} (command), 77, 86
|
11457
|
320 |
\item \isa {length} (symbol), 16
|
11414
|
321 |
\item \isa {length_induct}, \bold{172}
|
11431
|
322 |
\item \isa {less_than} (constant), 98
|
11414
|
323 |
\item \isa {less_than_iff} (theorem), \bold{98}
|
11458
|
324 |
\item \isa {let} expressions, 3, 4, 29
|
|
325 |
\item \isa {Let_def} (theorem), 29
|
11414
|
326 |
\item \isa {lex_prod_def} (theorem), \bold{99}
|
11431
|
327 |
\item lexicographic product, \bold{99}, 160
|
11414
|
328 |
\item {\texttt{lfp}}
|
|
329 |
\subitem applications of, \see{CTL}{100}
|
11458
|
330 |
\item linear arithmetic, 20--22, 131
|
11431
|
331 |
\item \isa {List} (theory), 15
|
|
332 |
\item \isa {list} (type), 2, 7, 15
|
11458
|
333 |
\item \isa {list.split} (theorem), 30
|
11414
|
334 |
\item \isa {lists_mono} (theorem), \bold{121}
|
11431
|
335 |
\item Lowe, Gavin, 178--179
|
11414
|
336 |
|
|
337 |
\indexspace
|
|
338 |
|
11431
|
339 |
\item \isa {Main} (theory), 2
|
11414
|
340 |
\item major premise, \bold{59}
|
11457
|
341 |
\item \isa {max} (constant), 21, 22
|
11414
|
342 |
\item measure function, \bold{45}, \bold{98}
|
|
343 |
\item \isa {measure_def} (theorem), \bold{99}
|
|
344 |
\item meta-logic, \bold{64}
|
11424
|
345 |
\item methods, \bold{14}
|
11457
|
346 |
\item \isa {min} (constant), 21, 22
|
|
347 |
\item \isa {mod} (symbol), 21
|
11424
|
348 |
\item \isa {mod_div_equality} (theorem), \bold{133}
|
11414
|
349 |
\item \isa {mod_mult_distrib} (theorem), \bold{133}
|
11431
|
350 |
\item \emph{modus ponens}, 51, 56
|
11414
|
351 |
\item \isa {mono_def} (theorem), \bold{100}
|
11431
|
352 |
\item monotone functions, \bold{100}, 123
|
|
353 |
\subitem and inductive definitions, 121--122
|
|
354 |
\item \isa {more} (constant), 140--142
|
11414
|
355 |
\item \isa {mp} (theorem), \bold{56}
|
|
356 |
\item multiset ordering, \bold{99}
|
|
357 |
|
|
358 |
\indexspace
|
|
359 |
|
11431
|
360 |
\item \isa {nat} (type), 2, 20, 133--134
|
|
361 |
\item natural deduction, 51--52
|
11457
|
362 |
\item natural numbers, 20, 133--134
|
11431
|
363 |
\item Needham-Schroeder protocol, 177--179
|
|
364 |
\item negation, 57--59
|
|
365 |
\item \isa {Nil} (constant), 7
|
11458
|
366 |
\item \isa {no_asm} (modifier), 27
|
|
367 |
\item \isa {no_asm_simp} (modifier), 27
|
|
368 |
\item \isa {no_asm_use} (modifier), 27
|
11431
|
369 |
\item non-standard reals, 137
|
11428
|
370 |
\item \isa {None} (constant), \bold{22}
|
11414
|
371 |
\item \isa {notE} (theorem), \bold{57}
|
|
372 |
\item \isa {notI} (theorem), \bold{57}
|
11431
|
373 |
\item numeric literals, 132
|
|
374 |
\subitem for type \protect\isa{nat}, 133
|
|
375 |
\subitem for type \protect\isa{real}, 136
|
11414
|
376 |
|
|
377 |
\indexspace
|
|
378 |
|
11431
|
379 |
\item \isa {O} (symbol), 96
|
11414
|
380 |
\item \texttt {o}, \bold{189}
|
|
381 |
\item \isa {o_def} (theorem), \bold{94}
|
11458
|
382 |
\item \isa {OF} (attribute), 79--80
|
|
383 |
\item \isa {of} (attribute), 77, 80
|
|
384 |
\item \isa {only} (modifier), 27
|
11431
|
385 |
\item \isacommand {oops} (command), 11
|
11428
|
386 |
\item \isa {option} (type), \bold{22}
|
11414
|
387 |
\item ordered rewriting, \bold{158}
|
11457
|
388 |
\item overloading, 21, 144--146
|
11431
|
389 |
\subitem and arithmetic, 132
|
11414
|
390 |
|
|
391 |
\indexspace
|
|
392 |
|
11457
|
393 |
\item pairs and tuples, 22, 137--140
|
11450
|
394 |
\item parent theories, \bold{2}
|
11431
|
395 |
\item partial function, 164
|
11414
|
396 |
\item pattern, higher-order, \bold{159}
|
11431
|
397 |
\item PDL, 102--105
|
11414
|
398 |
\item permutative rewrite rule, \bold{158}
|
11458
|
399 |
\item \isacommand {pr} (command), 14, 84
|
11431
|
400 |
\item \isacommand {prefer} (command), 14, 84
|
11457
|
401 |
\item primitive recursion, \see{recursion, primitive}{1}
|
11458
|
402 |
\item \isacommand {primrec} (command), 8, 16, 36--41
|
11428
|
403 |
\item product type, \see{pairs and tuples}{1}
|
11414
|
404 |
\item Proof General, \bold{5}
|
11457
|
405 |
\item proof state, 10
|
11414
|
406 |
\item proofs
|
11428
|
407 |
\subitem abandoning, \bold{11}
|
11458
|
408 |
\subitem examples of failing, 71--73
|
11428
|
409 |
\item protocols
|
11431
|
410 |
\subitem security, 177--187
|
11414
|
411 |
|
|
412 |
\indexspace
|
|
413 |
|
11450
|
414 |
\item quantifiers, 3
|
11431
|
415 |
\subitem and inductive definitions, 119--121
|
|
416 |
\subitem existential, 66
|
|
417 |
\subitem for sets, 92
|
|
418 |
\subitem instantiating, 68
|
|
419 |
\subitem universal, 63--66
|
11414
|
420 |
|
|
421 |
\indexspace
|
|
422 |
|
|
423 |
\item \isa {r_into_rtrancl} (theorem), \bold{96}
|
|
424 |
\item \isa {r_into_trancl} (theorem), \bold{97}
|
|
425 |
\item range
|
11431
|
426 |
\subitem of a function, 95
|
|
427 |
\subitem of a relation, 96
|
|
428 |
\item \isa {range} (symbol), 95
|
11414
|
429 |
\item \isa {Range_iff} (theorem), \bold{96}
|
11431
|
430 |
\item \isa {Real} (theory), 137
|
|
431 |
\item \isa {real} (type), 136--137
|
|
432 |
\item real numbers, 136--137
|
11458
|
433 |
\item \isacommand {recdef} (command), 44--50, 98, 160--168
|
11431
|
434 |
\subitem and numeric literals, 132
|
|
435 |
\item \isa {recdef_cong} (attribute), 164
|
11458
|
436 |
\item \isa {recdef_simp} (attribute), 46
|
11431
|
437 |
\item \isa {recdef_wf} (attribute), 162
|
|
438 |
\item \isacommand {record} (command), 140
|
|
439 |
\item \isa {record_split} (method), 143
|
|
440 |
\item records, 140--144
|
|
441 |
\subitem extensible, 141--142
|
11414
|
442 |
\item recursion
|
11457
|
443 |
\subitem primitive, 16
|
11414
|
444 |
\subitem well-founded, \bold{161}
|
11431
|
445 |
\item recursion induction, 49--50
|
|
446 |
\item \isacommand {redo} (command), 14
|
|
447 |
\item reflexive and transitive closure, 96--98
|
|
448 |
\item relations, 95--98
|
|
449 |
\subitem well-founded, 98--99
|
|
450 |
\item \isa {rename_tac} (method), 66--67
|
11458
|
451 |
\item \isa {rev} (constant), 8--12, 32
|
|
452 |
\item rewrite rule
|
11414
|
453 |
\subitem permutative, \bold{158}
|
11458
|
454 |
\item rewrite rules, \bold{25}
|
|
455 |
\item rewriting, \bold{25}
|
11414
|
456 |
\subitem ordered, \bold{158}
|
11431
|
457 |
\item \isa {rotate_tac} (method), 28
|
11414
|
458 |
\item \isa {rtrancl_refl} (theorem), \bold{96}
|
|
459 |
\item \isa {rtrancl_trans} (theorem), \bold{96}
|
11431
|
460 |
\item rule induction, 112--114
|
|
461 |
\item rule inversion, 114--115, 123--124
|
|
462 |
\item \isa {rule_tac} (method), 60
|
|
463 |
\subitem and renaming, 67
|
11414
|
464 |
|
|
465 |
\indexspace
|
|
466 |
|
11431
|
467 |
\item \isa {safe} (method), 75, 76
|
11458
|
468 |
\item safe rules, \bold{74}
|
11431
|
469 |
\item \isa {set} (type), 2, 89
|
|
470 |
\item set comprehensions, 91--92
|
11414
|
471 |
\item \isa {set_ext} (theorem), \bold{90}
|
11431
|
472 |
\item sets, 89--93
|
|
473 |
\subitem finite, 93
|
11414
|
474 |
\subitem notation for finite, \bold{91}
|
11428
|
475 |
\item settings, \see{flags}{1}
|
11431
|
476 |
\item \isa {show_brackets} (flag), 4
|
11457
|
477 |
\item \isa {show_types} (flag), 3, 14
|
|
478 |
\item \isa {simp} (attribute), 9, 26
|
11414
|
479 |
\item \isa {simp} (method), \bold{26}
|
11458
|
480 |
\item \isa {simp} del (attribute), 26
|
|
481 |
\item \isa {simp_all} (method), 26, 35
|
|
482 |
\item simplification, 25--31, 157--160
|
|
483 |
\subitem of \isa{let}-expressions, 29
|
11414
|
484 |
\subitem ordered, \bold{158}
|
11431
|
485 |
\subitem with definitions, 28
|
|
486 |
\subitem with/of assumptions, 27
|
11458
|
487 |
\item simplification rule, 159--160
|
|
488 |
\item simplification rules, 26
|
|
489 |
\subitem adding and deleting, 27
|
|
490 |
\item \isa {simplified} (attribute), 77, 80
|
11431
|
491 |
\item \isa {size} (constant), 15
|
11457
|
492 |
\item \isa {snd} (constant), 22
|
11458
|
493 |
\item \isa {SOME} (symbol), 70
|
11414
|
494 |
\item \texttt {SOME}, \bold{189}
|
11428
|
495 |
\item \isa {Some} (constant), \bold{22}
|
11458
|
496 |
\item \isa {some_equality} (theorem), \bold{70}
|
11424
|
497 |
\item \isa {someI} (theorem), \bold{70}
|
11414
|
498 |
\item \isa {someI2} (theorem), \bold{70}
|
11424
|
499 |
\item \isa {someI_ex} (theorem), \bold{71}
|
11431
|
500 |
\item sorts, 150
|
11414
|
501 |
\item \isa {spec} (theorem), \bold{64}
|
11458
|
502 |
\item \isa {split} (attribute), 30
|
11414
|
503 |
\item \isa {split} (constant), \bold{137}
|
11458
|
504 |
\item \isa {split} (method), 29
|
11431
|
505 |
\item \isa {split} (method, attr.), 29--31
|
11458
|
506 |
\item \isa {split} (modified), 30
|
11414
|
507 |
\item split rule, \bold{30}
|
11431
|
508 |
\item \isa {split_if} (theorem), 30
|
11458
|
509 |
\item \isa {split_if_asm} (theorem), 30
|
11414
|
510 |
\item \isa {ssubst} (theorem), \bold{61}
|
11457
|
511 |
\item structural induction, \see{induction, structural}{1}
|
11458
|
512 |
\item \isa {subgoal_tac} (method), 82
|
11457
|
513 |
\item subgoals, 10
|
11414
|
514 |
\item subset relation, \bold{90}
|
|
515 |
\item \isa {subsetD} (theorem), \bold{90}
|
|
516 |
\item \isa {subsetI} (theorem), \bold{90}
|
11431
|
517 |
\item \isa {subst} (method), 61
|
|
518 |
\item substitution, 61--63
|
|
519 |
\item \isa {Suc} (constant), 20
|
11414
|
520 |
\item \isa {surj_def} (theorem), \bold{94}
|
11431
|
521 |
\item surjections, 94
|
11458
|
522 |
\item \isa {sym} (theorem), \bold{78}
|
11457
|
523 |
\item syntax, 4, 9
|
|
524 |
\item syntax translations, 24
|
11414
|
525 |
|
|
526 |
\indexspace
|
|
527 |
|
11458
|
528 |
\item tacticals, 83
|
11431
|
529 |
\item tactics, 10
|
|
530 |
\item \isacommand {term} (command), 14
|
11458
|
531 |
\item term rewriting, \bold{25}
|
11428
|
532 |
\item termination, \see{functions, total}{1}
|
11431
|
533 |
\item terms, 3
|
11458
|
534 |
\item \isa {THE} (symbol), 69
|
|
535 |
\item \isa {the_equality} (theorem), \bold{69}
|
|
536 |
\item \isa {THEN} (attribute), \bold{78}, 80, 86
|
11431
|
537 |
\item \isacommand {theorem} (command), \bold{9}, 11
|
|
538 |
\item theories, 2
|
11428
|
539 |
\subitem abandoning, \bold{14}
|
11457
|
540 |
\item \isacommand {theory} (command), 14
|
11431
|
541 |
\item theory files, 2
|
|
542 |
\item \isacommand {thm} (command), 14
|
|
543 |
\item \isa {tl} (constant), 15
|
11457
|
544 |
\item \isa {ToyList} example, 7--13
|
11431
|
545 |
\item \isa {trace_simp} (flag), 31
|
11414
|
546 |
\item tracing the simplifier, \bold{31}
|
|
547 |
\item \isa {trancl_trans} (theorem), \bold{97}
|
11457
|
548 |
\item \isacommand {translations} (command), 24
|
11458
|
549 |
\item tries, 41--44
|
11431
|
550 |
\item \isa {True} (constant), 3
|
11428
|
551 |
\item tuples, \see{pairs and tuples}{1}
|
11431
|
552 |
\item \isacommand {typ} (command), 14
|
11428
|
553 |
\item type constraints, \bold{4}
|
11450
|
554 |
\item type constructors, 2
|
11414
|
555 |
\item type inference, \bold{3}
|
11457
|
556 |
\item type synonyms, 23
|
11450
|
557 |
\item type variables, 3
|
11431
|
558 |
\item \isacommand {typedecl} (command), 150
|
|
559 |
\item \isacommand {typedef} (command), 151--155
|
11450
|
560 |
\item types, 2--3
|
11431
|
561 |
\subitem declaring, 150--151
|
|
562 |
\subitem defining, 151--155
|
11457
|
563 |
\item \isacommand {types} (command), 23
|
11414
|
564 |
|
|
565 |
\indexspace
|
|
566 |
|
|
567 |
\item \texttt {UN}, \bold{189}
|
|
568 |
\item \texttt {Un}, \bold{189}
|
|
569 |
\item \isa {UN_E} (theorem), \bold{92}
|
|
570 |
\item \isa {UN_I} (theorem), \bold{92}
|
|
571 |
\item \isa {UN_iff} (theorem), \bold{92}
|
|
572 |
\item \isa {Un_subset_iff} (theorem), \bold{90}
|
11431
|
573 |
\item \isacommand {undo} (command), 14
|
|
574 |
\item unification, 60--63
|
|
575 |
\item \isa {UNION} (constant), 93
|
11414
|
576 |
\item \texttt {Union}, \bold{189}
|
|
577 |
\item union
|
11431
|
578 |
\subitem indexed, 92
|
11414
|
579 |
\item \isa {Union_iff} (theorem), \bold{92}
|
11431
|
580 |
\item \isa {unit} (type), 22
|
|
581 |
\item unknowns, 4, \bold{52}
|
11458
|
582 |
\item unsafe rules, \bold{74}
|
11414
|
583 |
\item updating a function, \bold{93}
|
|
584 |
|
|
585 |
\indexspace
|
|
586 |
|
11457
|
587 |
\item variables, 4--5
|
11431
|
588 |
\subitem schematic, 4
|
11450
|
589 |
\subitem type, 3
|
11414
|
590 |
\item \isa {vimage_def} (theorem), \bold{95}
|
|
591 |
|
|
592 |
\indexspace
|
|
593 |
|
11450
|
594 |
\item Wenzel, Markus, v
|
11414
|
595 |
\item \isa {wf_induct} (theorem), \bold{99}
|
11431
|
596 |
\item \isa {while} (constant), 167
|
|
597 |
\item \isa {While_Combinator} (theory), 167
|
11414
|
598 |
|
|
599 |
\end{theindex}
|