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