author | huffman |
Wed, 28 Dec 2011 20:05:52 +0100 | |
changeset 46024 | b4dcefaa1721 |
parent 46014 | 2b63c77ba9c3 |
child 46028 | 9f113cdf3d66 |
permissions | -rw-r--r-- |
5363 | 1 |
Isabelle NEWS -- history user-relevant changes |
2 |
============================================== |
|
2553 | 3 |
|
45109 | 4 |
New in this Isabelle version |
5 |
---------------------------- |
|
6 |
||
45593 | 7 |
*** General *** |
8 |
||
45614 | 9 |
* Prover IDE (PIDE) improvements: |
10 |
||
11 |
- markup for bound variables |
|
12 |
- markup for types of term variables (e.g. displayed as tooltips) |
|
13 |
||
45593 | 14 |
* Rule attributes in local theory declarations (e.g. locale or class) |
15 |
are now statically evaluated: the resulting theorem is stored instead |
|
16 |
of the original expression. INCOMPATIBILITY in rare situations, where |
|
17 |
the historic accident of dynamic re-evaluation in interpretations |
|
18 |
etc. was exploited. |
|
19 |
||
45600
1bbbac9a0cb0
'lemmas' / 'theorems' commands allow 'for' fixes and standardize the result before storing;
wenzelm
parents:
45593
diff
changeset
|
20 |
* Commands 'lemmas' and 'theorems' allow local variables using 'for' |
1bbbac9a0cb0
'lemmas' / 'theorems' commands allow 'for' fixes and standardize the result before storing;
wenzelm
parents:
45593
diff
changeset
|
21 |
declaration, and results are standardized before being stored. Thus |
1bbbac9a0cb0
'lemmas' / 'theorems' commands allow 'for' fixes and standardize the result before storing;
wenzelm
parents:
45593
diff
changeset
|
22 |
old-style "standard" after instantiation or composition of facts |
1bbbac9a0cb0
'lemmas' / 'theorems' commands allow 'for' fixes and standardize the result before storing;
wenzelm
parents:
45593
diff
changeset
|
23 |
becomes obsolete. Minor INCOMPATIBILITY, due to potential change of |
1bbbac9a0cb0
'lemmas' / 'theorems' commands allow 'for' fixes and standardize the result before storing;
wenzelm
parents:
45593
diff
changeset
|
24 |
indices of schematic variables. |
1bbbac9a0cb0
'lemmas' / 'theorems' commands allow 'for' fixes and standardize the result before storing;
wenzelm
parents:
45593
diff
changeset
|
25 |
|
45703
c7a13ce60161
renamed inner syntax categories "num" to "num_token" and "xnum" to "xnum_token";
wenzelm
parents:
45625
diff
changeset
|
26 |
* Renamed inner syntax categories "num" to "num_token" and "xnum" to |
c7a13ce60161
renamed inner syntax categories "num" to "num_token" and "xnum" to "xnum_token";
wenzelm
parents:
45625
diff
changeset
|
27 |
"xnum_token", in accordance to existing "float_token". Minor |
c7a13ce60161
renamed inner syntax categories "num" to "num_token" and "xnum" to "xnum_token";
wenzelm
parents:
45625
diff
changeset
|
28 |
INCOMPATIBILITY. Note that in practice "num_const" etc. are mainly |
c7a13ce60161
renamed inner syntax categories "num" to "num_token" and "xnum" to "xnum_token";
wenzelm
parents:
45625
diff
changeset
|
29 |
used instead. |
c7a13ce60161
renamed inner syntax categories "num" to "num_token" and "xnum" to "xnum_token";
wenzelm
parents:
45625
diff
changeset
|
30 |
|
45593 | 31 |
|
45134 | 32 |
*** Pure *** |
33 |
||
34 |
* Obsolete command 'types' has been discontinued. Use 'type_synonym' |
|
35 |
instead. INCOMPATIBILITY. |
|
36 |
||
45191 | 37 |
* Ancient code generator for SML and its commands 'code_module', |
45383 | 38 |
'code_library', 'consts_code', 'types_code' have been discontinued. |
39 |
Use commands of the generic code generator instead. INCOMPATIBILITY. |
|
40 |
||
41 |
* Redundant attribute 'code_inline' has been discontinued. Use |
|
42 |
'code_unfold' instead. INCOMPATIBILITY. |
|
43 |
||
45427
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset
|
44 |
* Sort constraints are now propagated in simultaneous statements, just |
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset
|
45 |
like type constraints. INCOMPATIBILITY in rare situations, where |
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset
|
46 |
distinct sorts used to be assigned accidentally. For example: |
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset
|
47 |
|
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset
|
48 |
lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal" |
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset
|
49 |
|
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset
|
50 |
lemma "P (x::'a)" and "Q (y::'a::bar)" |
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset
|
51 |
-- "now uniform 'a::bar instead of default sort for first occurence (!)" |
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset
|
52 |
|
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset
|
53 |
|
45122 | 54 |
*** HOL *** |
55 |
||
45991 | 56 |
* Finite_Set.fold now qualified. INCOMPATIBILITY. |
57 |
||
45988 | 58 |
* Renamed some facts on canonical fold on lists, in order to avoid problems |
59 |
with interpretation involving corresponding facts on foldl with the same base names: |
|
60 |
||
61 |
fold_set_remdups ~> fold_set_fold_remdups |
|
62 |
fold_set ~> fold_set_fold |
|
63 |
fold1_set ~> fold1_set_fold |
|
64 |
||
65 |
INCOMPATIBILITY. |
|
66 |
||
45983 | 67 |
* 'set' is now a proper type constructor. Definitions mem_def and Collect_def |
68 |
have disappeared. INCOMPATIBILITY, rephrase sets S used as predicates by |
|
69 |
`%x. x : S` and predicates P used as sets by `{x. P x}`. For typical proofs, |
|
70 |
it is often sufficent to prune any tinkering with former theorems mem_def |
|
71 |
and Collect_def. |
|
72 |
||
46014 | 73 |
* Theory HOL/Library/AList has been renamed to AList_Impl. INCOMPATIBILITY. |
45874 | 74 |
|
45839
43a5b86bc102
'datatype' specifications allow explicit sort constraints;
wenzelm
parents:
45810
diff
changeset
|
75 |
* 'datatype' specifications allow explicit sort constraints. |
43a5b86bc102
'datatype' specifications allow explicit sort constraints;
wenzelm
parents:
45810
diff
changeset
|
76 |
|
45748
cf79cc09cab4
remove Library/Diagonalize.thy, because Library/Nat_Bijection.thy includes all the same functionality
huffman
parents:
45707
diff
changeset
|
77 |
* Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY, use |
cf79cc09cab4
remove Library/Diagonalize.thy, because Library/Nat_Bijection.thy includes all the same functionality
huffman
parents:
45707
diff
changeset
|
78 |
theory HOL/Library/Nat_Bijection instead. |
cf79cc09cab4
remove Library/Diagonalize.thy, because Library/Nat_Bijection.thy includes all the same functionality
huffman
parents:
45707
diff
changeset
|
79 |
|
45546
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
80 |
* Session HOL-Word: Discontinued many redundant theorems specific to type |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
81 |
'a word. INCOMPATIBILITY, use the corresponding generic theorems instead. |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
82 |
|
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
83 |
word_sub_alt ~> word_sub_wi |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
84 |
word_add_alt ~> word_add_def |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
85 |
word_mult_alt ~> word_mult_def |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
86 |
word_minus_alt ~> word_minus_def |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
87 |
word_0_alt ~> word_0_wi |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
88 |
word_1_alt ~> word_1_wi |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
89 |
word_add_0 ~> add_0_left |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
90 |
word_add_0_right ~> add_0_right |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
91 |
word_mult_1 ~> mult_1_left |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
92 |
word_mult_1_right ~> mult_1_right |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
93 |
word_add_commute ~> add_commute |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
94 |
word_add_assoc ~> add_assoc |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
95 |
word_add_left_commute ~> add_left_commute |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
96 |
word_mult_commute ~> mult_commute |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
97 |
word_mult_assoc ~> mult_assoc |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
98 |
word_mult_left_commute ~> mult_left_commute |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
99 |
word_left_distrib ~> left_distrib |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
100 |
word_right_distrib ~> right_distrib |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
101 |
word_left_minus ~> left_minus |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
102 |
word_diff_0_right ~> diff_0_right |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
103 |
word_diff_self ~> diff_self |
45957 | 104 |
word_sub_def ~> diff_minus |
45804 | 105 |
word_diff_minus ~> diff_minus |
45546
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
106 |
word_add_ac ~> add_ac |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
107 |
word_mult_ac ~> mult_ac |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
108 |
word_plus_ac0 ~> add_0_left add_0_right add_ac |
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
109 |
word_times_ac1 ~> mult_1_left mult_1_right mult_ac |
45547 | 110 |
word_order_trans ~> order_trans |
111 |
word_order_refl ~> order_refl |
|
112 |
word_order_antisym ~> order_antisym |
|
113 |
word_order_linear ~> linorder_linear |
|
45810 | 114 |
lenw1_zero_neq_one ~> zero_neq_one |
115 |
word_number_of_eq ~> number_of_eq |
|
46013 | 116 |
word_of_int_add_hom ~> wi_hom_add |
117 |
word_of_int_sub_hom ~> wi_hom_sub |
|
118 |
word_of_int_mult_hom ~> wi_hom_mult |
|
119 |
word_of_int_minus_hom ~> wi_hom_neg |
|
120 |
word_of_int_succ_hom ~> wi_hom_succ |
|
121 |
word_of_int_pred_hom ~> wi_hom_pred |
|
122 |
word_of_int_0_hom ~> word_0_wi |
|
123 |
word_of_int_1_hom ~> word_1_wi |
|
45546
6dd3e88de4c2
HOL-Word: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset
|
124 |
|
46014 | 125 |
* Clarified attribute "mono_set": pure declaration without modifying |
45384
dffa657f0aa2
clarified attribute "mono_set": pure declaration, proper export in ML;
wenzelm
parents:
45383
diff
changeset
|
126 |
the result of the fact expression. |
dffa657f0aa2
clarified attribute "mono_set": pure declaration, proper export in ML;
wenzelm
parents:
45383
diff
changeset
|
127 |
|
45383 | 128 |
* "Transitive_Closure.ntrancl": bounded transitive closure on |
129 |
relations. |
|
130 |
||
46014 | 131 |
* Constant "Set.not_member" now qualified. INCOMPATIBILITY. |
45383 | 132 |
|
133 |
* "sublists" moved to theory More_List. INCOMPATIBILITY. |
|
45143 | 134 |
|
45122 | 135 |
* Theory Int: Discontinued many legacy theorems specific to type int. |
45383 | 136 |
INCOMPATIBILITY, use the corresponding generic theorems instead. |
45122 | 137 |
|
138 |
zminus_zminus ~> minus_minus |
|
139 |
zminus_0 ~> minus_zero |
|
140 |
zminus_zadd_distrib ~> minus_add_distrib |
|
141 |
zadd_commute ~> add_commute |
|
142 |
zadd_assoc ~> add_assoc |
|
143 |
zadd_left_commute ~> add_left_commute |
|
45196
78478d938cb8
inlined @{thms} (ML compile-time) allows to get rid of legacy zadd_ac as well (cf. 49e305100097);
wenzelm
parents:
45191
diff
changeset
|
144 |
zadd_ac ~> add_ac |
45122 | 145 |
zmult_ac ~> mult_ac |
146 |
zadd_0 ~> add_0_left |
|
147 |
zadd_0_right ~> add_0_right |
|
148 |
zadd_zminus_inverse2 ~> left_minus |
|
149 |
zmult_zminus ~> mult_minus_left |
|
150 |
zmult_commute ~> mult_commute |
|
151 |
zmult_assoc ~> mult_assoc |
|
152 |
zadd_zmult_distrib ~> left_distrib |
|
153 |
zadd_zmult_distrib2 ~> right_distrib |
|
154 |
zdiff_zmult_distrib ~> left_diff_distrib |
|
155 |
zdiff_zmult_distrib2 ~> right_diff_distrib |
|
156 |
zmult_1 ~> mult_1_left |
|
157 |
zmult_1_right ~> mult_1_right |
|
158 |
zle_refl ~> order_refl |
|
159 |
zle_trans ~> order_trans |
|
160 |
zle_antisym ~> order_antisym |
|
161 |
zle_linear ~> linorder_linear |
|
162 |
zless_linear ~> linorder_less_linear |
|
163 |
zadd_left_mono ~> add_left_mono |
|
164 |
zadd_strict_right_mono ~> add_strict_right_mono |
|
165 |
zadd_zless_mono ~> add_less_le_mono |
|
166 |
int_0_less_1 ~> zero_less_one |
|
167 |
int_0_neq_1 ~> zero_neq_one |
|
168 |
zless_le ~> less_le |
|
169 |
zpower_zadd_distrib ~> power_add |
|
170 |
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff |
|
171 |
zero_le_zpower_abs ~> zero_le_power_abs |
|
172 |
||
45791 | 173 |
* Theory Deriv: Renamed |
174 |
||
175 |
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing |
|
176 |
||
45383 | 177 |
* New "case_product" attribute to generate a case rule doing multiple |
178 |
case distinctions at the same time. E.g. |
|
179 |
||
180 |
list.exhaust [case_product nat.exhaust] |
|
181 |
||
182 |
produces a rule which can be used to perform case distinction on both |
|
183 |
a list and a nat. |
|
184 |
||
45759 | 185 |
* Quickcheck: |
186 |
- Quickcheck returns variable assignments as counterexamples, which |
|
187 |
allows to reveal the underspecification of functions under test. |
|
188 |
For example, refuting "hd xs = x", it presents the variable |
|
189 |
assignment xs = [] and x = a1 as a counterexample, assuming that |
|
190 |
any property is false whenever "hd []" occurs in it. |
|
191 |
These counterexample are marked as potentially spurious, as |
|
192 |
Quickcheck also returns "xs = []" as a counterexample to the |
|
193 |
obvious theorem "hd xs = hd xs". |
|
194 |
After finding a potentially spurious counterexample, Quickcheck |
|
195 |
continues searching for genuine ones. |
|
196 |
By default, Quickcheck shows potentially spurious and genuine |
|
197 |
counterexamples. The option "genuine_only" sets quickcheck to |
|
198 |
only show genuine counterexamples. |
|
45941 | 199 |
|
200 |
- The command 'quickcheck_generator' creates random and exhaustive |
|
201 |
value generators for a given type and operations. |
|
202 |
It generates values by using the operations as if they were |
|
203 |
constructors of that type. |
|
204 |
||
45398
7dbb7b044a11
avoid infinite recursion in peephole optimizer function -- this had a debilitating effect on rationals and reals
blanchet
parents:
45384
diff
changeset
|
205 |
* Nitpick: |
45516 | 206 |
- Fixed infinite loop caused by the 'peephole_optim' option and |
207 |
affecting 'rat' and 'real'. |
|
208 |
||
209 |
* Sledgehammer: |
|
45707
6bf7eec9b153
added "minimize" option for more control over automatic minimization
blanchet
parents:
45706
diff
changeset
|
210 |
- Added "lam_trans" and "minimize" options. |
45706 | 211 |
- Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice"). |
45516 | 212 |
|
213 |
* Metis: |
|
214 |
- Added possibility to specify lambda translations scheme as a |
|
215 |
parenthesized argument (e.g., "by (metis (lam_lifting) ...)"). |
|
45398
7dbb7b044a11
avoid infinite recursion in peephole optimizer function -- this had a debilitating effect on rationals and reals
blanchet
parents:
45384
diff
changeset
|
216 |
|
7dbb7b044a11
avoid infinite recursion in peephole optimizer function -- this had a debilitating effect on rationals and reals
blanchet
parents:
45384
diff
changeset
|
217 |
|
45160 | 218 |
*** FOL *** |
219 |
||
45383 | 220 |
* New "case_product" attribute (see HOL). |
45160 | 221 |
|
45109 | 222 |
|
45128
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset
|
223 |
*** ML *** |
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset
|
224 |
|
45592 | 225 |
* Antiquotation @{attributes [...]} embeds attribute source |
226 |
representation into the ML text, which is particularly useful with |
|
227 |
declarations like Local_Theory.note. |
|
228 |
||
45128
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset
|
229 |
* Structure Proof_Context follows standard naming scheme. Old |
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset
|
230 |
ProofContext has been discontinued. INCOMPATIBILITY. |
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset
|
231 |
|
45293
57def0b39696
refined Local_Theory.declaration {syntax = false, pervasive} semantics: update is applied to auxiliary context as well;
wenzelm
parents:
45233
diff
changeset
|
232 |
* Refined Local_Theory.declaration {syntax, pervasive}, with subtle |
45298
aa35859c8741
uniform treatment of syntax declaration wrt. aux. context (NB: notation avoids duplicate mixfix internally);
wenzelm
parents:
45293
diff
changeset
|
233 |
change of semantics: update is applied to auxiliary local theory |
45293
57def0b39696
refined Local_Theory.declaration {syntax = false, pervasive} semantics: update is applied to auxiliary context as well;
wenzelm
parents:
45233
diff
changeset
|
234 |
context as well. |
57def0b39696
refined Local_Theory.declaration {syntax = false, pervasive} semantics: update is applied to auxiliary context as well;
wenzelm
parents:
45233
diff
changeset
|
235 |
|
45620
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset
|
236 |
* Modernized some old-style infix operations: |
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset
|
237 |
|
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset
|
238 |
addeqcongs ~> Simplifier.add_eqcong |
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset
|
239 |
deleqcongs ~> Simplifier.del_eqcong |
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset
|
240 |
addcongs ~> Simplifier.add_cong |
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset
|
241 |
delcongs ~> Simplifier.del_cong |
45625
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset
|
242 |
setmksimps ~> Simplifier.set_mksimps |
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset
|
243 |
setmkcong ~> Simplifier.set_mkcong |
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset
|
244 |
setmksym ~> Simplifier.set_mksym |
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset
|
245 |
setmkeqTrue ~> Simplifier.set_mkeqTrue |
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset
|
246 |
settermless ~> Simplifier.set_termless |
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset
|
247 |
setsubgoaler ~> Simplifier.set_subgoaler |
45620
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset
|
248 |
addsplits ~> Splitter.add_split |
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset
|
249 |
delsplits ~> Splitter.del_split |
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset
|
250 |
|
45128
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset
|
251 |
|
45109 | 252 |
|
44801 | 253 |
New in Isabelle2011-1 (October 2011) |
254 |
------------------------------------ |
|
41651 | 255 |
|
41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset
|
256 |
*** General *** |
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset
|
257 |
|
44760 | 258 |
* Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as |
44968 | 259 |
"isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line. |
44760 | 260 |
|
44777 | 261 |
- Management of multiple theory files directly from the editor |
44760 | 262 |
buffer store -- bypassing the file-system (no requirement to save |
263 |
files for checking). |
|
264 |
||
44777 | 265 |
- Markup of formal entities within the text buffer, with semantic |
44760 | 266 |
highlighting, tooltips and hyperlinks to jump to defining source |
267 |
positions. |
|
268 |
||
44777 | 269 |
- Improved text rendering, with sub/superscripts in the source |
270 |
buffer (including support for copy/paste wrt. output panel, HTML |
|
271 |
theory output and other non-Isabelle text boxes). |
|
272 |
||
273 |
- Refined scheduling of proof checking and printing of results, |
|
44760 | 274 |
based on interactive editor view. (Note: jEdit folding and |
275 |
narrowing allows to restrict buffer perspectives explicitly.) |
|
276 |
||
44777 | 277 |
- Reduced CPU performance requirements, usable on machines with few |
44760 | 278 |
cores. |
279 |
||
44777 | 280 |
- Reduced memory requirements due to pruning of unused document |
44760 | 281 |
versions (garbage collection). |
282 |
||
283 |
See also ~~/src/Tools/jEdit/README.html for further information, |
|
284 |
including some remaining limitations. |
|
285 |
||
44800 | 286 |
* Theory loader: source files are exclusively located via the master |
287 |
directory of each theory node (where the .thy file itself resides). |
|
288 |
The global load path (such as src/HOL/Library) has been discontinued. |
|
289 |
Note that the path element ~~ may be used to reference theories in the |
|
290 |
Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet". |
|
291 |
INCOMPATIBILITY. |
|
292 |
||
41955
703ea96b13c6
files are identified via SHA1 digests -- discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset
|
293 |
* Theory loader: source files are identified by content via SHA1 |
703ea96b13c6
files are identified via SHA1 digests -- discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset
|
294 |
digests. Discontinued former path/modtime identification and optional |
703ea96b13c6
files are identified via SHA1 digests -- discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset
|
295 |
ISABELLE_FILE_IDENT plugin scripts. |
703ea96b13c6
files are identified via SHA1 digests -- discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset
|
296 |
|
41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset
|
297 |
* Parallelization of nested Isar proofs is subject to |
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset
|
298 |
Goal.parallel_proofs_threshold (default 100). See also isabelle |
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset
|
299 |
usedir option -Q. |
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset
|
300 |
|
42669
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset
|
301 |
* Name space: former unsynchronized references are now proper |
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset
|
302 |
configuration options, with more conventional names: |
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset
|
303 |
|
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset
|
304 |
long_names ~> names_long |
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset
|
305 |
short_names ~> names_short |
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset
|
306 |
unique_names ~> names_unique |
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset
|
307 |
|
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset
|
308 |
Minor INCOMPATIBILITY, need to declare options in context like this: |
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset
|
309 |
|
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset
|
310 |
declare [[names_unique = false]] |
42358
b47d41d9f4b5
Name_Space: proper configuration options long_names, short_names, unique_names instead of former unsynchronized references;
wenzelm
parents:
42290
diff
changeset
|
311 |
|
42502 | 312 |
* Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note |
313 |
that the result needs to be unique, which means fact specifications |
|
314 |
may have to be refined after enriching a proof context. |
|
315 |
||
44800 | 316 |
* Attribute "case_names" has been refined: the assumptions in each case |
317 |
can be named now by following the case name with [name1 name2 ...]. |
|
318 |
||
44968 | 319 |
* Isabelle/Isar reference manual has been updated and extended: |
320 |
- "Synopsis" provides a catalog of main Isar language concepts. |
|
321 |
- Formal references in syntax diagrams, via @{rail} antiquotation. |
|
322 |
- Updated material from classic "ref" manual, notably about |
|
323 |
"Classical Reasoner". |
|
42633 | 324 |
|
41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset
|
325 |
|
41727
ab3f6d76fb23
available_provers ~> supported_provers (for clarity)
blanchet
parents:
41703
diff
changeset
|
326 |
*** HOL *** |
ab3f6d76fb23
available_provers ~> supported_provers (for clarity)
blanchet
parents:
41703
diff
changeset
|
327 |
|
44968 | 328 |
* Class bot and top require underlying partial order rather than |
44800 | 329 |
preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY. |
43815
4f6e2965d821
adjusted to tightened specification of classes bot and top
haftmann
parents:
43752
diff
changeset
|
330 |
|
43940 | 331 |
* Class complete_lattice: generalized a couple of lemmas from sets; |
44800 | 332 |
generalized theorems INF_cong and SUP_cong. New type classes for |
333 |
complete boolean algebras and complete linear orders. Lemmas |
|
334 |
Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in |
|
335 |
class complete_linorder. |
|
336 |
||
337 |
Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def, |
|
338 |
Sup_fun_def, Inf_apply, Sup_apply. |
|
339 |
||
45088 | 340 |
Removed redundant lemmas (the right hand side gives hints how to |
341 |
replace them for (metis ...), or (simp only: ...) proofs): |
|
45041
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
342 |
|
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
343 |
Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right] |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
344 |
Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right] |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
345 |
Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
346 |
Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
347 |
Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
348 |
Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
349 |
Inter_def ~> INF_def, image_def |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
350 |
Union_def ~> SUP_def, image_def |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
351 |
INT_eq ~> INF_def, and image_def |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
352 |
UN_eq ~> SUP_def, and image_def |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
353 |
INF_subset ~> INF_superset_mono [OF _ order_refl] |
44800 | 354 |
|
355 |
More consistent and comprehensive names: |
|
356 |
||
45041
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
357 |
INTER_eq_Inter_image ~> INF_def |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
358 |
UNION_eq_Union_image ~> SUP_def |
43872 | 359 |
INFI_def ~> INF_def |
360 |
SUPR_def ~> SUP_def |
|
44103
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset
|
361 |
INF_leI ~> INF_lower |
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset
|
362 |
INF_leI2 ~> INF_lower2 |
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset
|
363 |
le_INFI ~> INF_greatest |
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset
|
364 |
le_SUPI ~> SUP_upper |
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset
|
365 |
le_SUPI2 ~> SUP_upper2 |
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset
|
366 |
SUP_leI ~> SUP_least |
43873 | 367 |
INFI_bool_eq ~> INF_bool_eq |
368 |
SUPR_bool_eq ~> SUP_bool_eq |
|
369 |
INFI_apply ~> INF_apply |
|
370 |
SUPR_apply ~> SUP_apply |
|
44103
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset
|
371 |
INTER_def ~> INTER_eq |
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset
|
372 |
UNION_def ~> UNION_eq |
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset
|
373 |
|
43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43816
diff
changeset
|
374 |
INCOMPATIBILITY. |
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43816
diff
changeset
|
375 |
|
44973
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle2011-1 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset
|
376 |
* Renamed theory Complete_Lattice to Complete_Lattices. |
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle2011-1 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset
|
377 |
INCOMPATIBILITY. |
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle2011-1 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset
|
378 |
|
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle2011-1 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset
|
379 |
* Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff, |
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle2011-1 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset
|
380 |
INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot, |
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle2011-1 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset
|
381 |
Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image, |
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle2011-1 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset
|
382 |
Sup_insert are now declared as [simp]. INCOMPATIBILITY. |
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle2011-1 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset
|
383 |
|
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle2011-1 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset
|
384 |
* Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff, |
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle2011-1 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset
|
385 |
compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem, |
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle2011-1 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset
|
386 |
sup_inf_absob, sup_left_idem are now declared as [simp]. Minor |
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle2011-1 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset
|
387 |
INCOMPATIBILITY. |
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle2011-1 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset
|
388 |
|
44845 | 389 |
* Added syntactic classes "inf" and "sup" for the respective |
390 |
constants. INCOMPATIBILITY: Changes in the argument order of the |
|
391 |
(mostly internal) locale predicates for some derived classes. |
|
392 |
||
44800 | 393 |
* Theorem collections ball_simps and bex_simps do not contain theorems |
394 |
referring to UNION any longer; these have been moved to collection |
|
395 |
UN_ball_bex_simps. INCOMPATIBILITY. |
|
396 |
||
397 |
* Theory Archimedean_Field: floor now is defined as parameter of a |
|
398 |
separate type class floor_ceiling. |
|
399 |
||
400 |
* Theory Finite_Set: more coherent development of fold_set locales: |
|
42874 | 401 |
|
402 |
locale fun_left_comm ~> locale comp_fun_commute |
|
403 |
locale fun_left_comm_idem ~> locale comp_fun_idem |
|
44800 | 404 |
|
405 |
Both use point-free characterization; interpretation proofs may need |
|
406 |
adjustment. INCOMPATIBILITY. |
|
42874 | 407 |
|
44800 | 408 |
* Theory Limits: Type "'a net" has been renamed to "'a filter", in |
44081
730f7cced3a6
rename type 'a net to 'a filter, following standard mathematical terminology
huffman
parents:
44027
diff
changeset
|
409 |
accordance with standard mathematical terminology. INCOMPATIBILITY. |
730f7cced3a6
rename type 'a net to 'a filter, following standard mathematical terminology
huffman
parents:
44027
diff
changeset
|
410 |
|
44800 | 411 |
* Theory Complex_Main: The locale interpretations for the |
412 |
bounded_linear and bounded_bilinear locales have been removed, in |
|
413 |
order to reduce the number of duplicate lemmas. Users must use the |
|
414 |
original names for distributivity theorems, potential INCOMPATIBILITY. |
|
44282
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset
|
415 |
|
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset
|
416 |
divide.add ~> add_divide_distrib |
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset
|
417 |
divide.diff ~> diff_divide_distrib |
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset
|
418 |
divide.setsum ~> setsum_divide_distrib |
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset
|
419 |
mult.add_right ~> right_distrib |
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset
|
420 |
mult.diff_right ~> right_diff_distrib |
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset
|
421 |
mult_right.setsum ~> setsum_right_distrib |
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset
|
422 |
mult_left.diff ~> left_diff_distrib |
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset
|
423 |
|
44800 | 424 |
* Theory Complex_Main: Several redundant theorems have been removed or |
44568
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
425 |
replaced by more general versions. INCOMPATIBILITY. |
44522
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset
|
426 |
|
45051
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset
|
427 |
real_diff_def ~> minus_real_def |
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset
|
428 |
real_divide_def ~> divide_real_def |
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset
|
429 |
real_less_def ~> less_le |
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset
|
430 |
real_abs_def ~> abs_real_def |
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset
|
431 |
real_sgn_def ~> sgn_real_def |
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset
|
432 |
real_mult_commute ~> mult_commute |
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset
|
433 |
real_mult_assoc ~> mult_assoc |
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset
|
434 |
real_mult_1 ~> mult_1_left |
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset
|
435 |
real_add_mult_distrib ~> left_distrib |
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset
|
436 |
real_zero_not_eq_one ~> zero_neq_one |
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset
|
437 |
real_mult_inverse_left ~> left_inverse |
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset
|
438 |
INVERSE_ZERO ~> inverse_zero |
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset
|
439 |
real_le_refl ~> order_refl |
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset
|
440 |
real_le_antisym ~> order_antisym |
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset
|
441 |
real_le_trans ~> order_trans |
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset
|
442 |
real_le_linear ~> linear |
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset
|
443 |
real_le_eq_diff ~> le_iff_diff_le_0 |
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset
|
444 |
real_add_left_mono ~> add_left_mono |
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset
|
445 |
real_mult_order ~> mult_pos_pos |
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset
|
446 |
real_mult_less_mono2 ~> mult_strict_left_mono |
44822
2690b6de5021
remove duplicate lemma real_of_int_real_of_nat in favor of real_of_int_of_nat_eq
huffman
parents:
44777
diff
changeset
|
447 |
real_of_int_real_of_nat ~> real_of_int_of_nat_eq |
44522
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset
|
448 |
real_0_le_divide_iff ~> zero_le_divide_iff |
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset
|
449 |
realpow_two_disj ~> power2_eq_iff |
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset
|
450 |
real_squared_diff_one_factored ~> square_diff_one_factored |
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset
|
451 |
realpow_two_diff ~> square_diff_square_factored |
44669
8e6cdb9c00a7
remove redundant lemma reals_complete2 in favor of complete_real
huffman
parents:
44666
diff
changeset
|
452 |
reals_complete2 ~> complete_real |
44749
5b1e1432c320
remove redundant lemma real_sum_squared_expand in favor of power2_sum
huffman
parents:
44748
diff
changeset
|
453 |
real_sum_squared_expand ~> power2_sum |
44522
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset
|
454 |
exp_ln_eq ~> ln_unique |
44711 | 455 |
expi_add ~> exp_add |
456 |
expi_zero ~> exp_zero |
|
44522
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset
|
457 |
lemma_DERIV_subst ~> DERIV_cong |
44568
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
458 |
LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
459 |
LIMSEQ_const ~> tendsto_const |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
460 |
LIMSEQ_norm ~> tendsto_norm |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
461 |
LIMSEQ_add ~> tendsto_add |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
462 |
LIMSEQ_minus ~> tendsto_minus |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
463 |
LIMSEQ_minus_cancel ~> tendsto_minus_cancel |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
464 |
LIMSEQ_diff ~> tendsto_diff |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
465 |
bounded_linear.LIMSEQ ~> bounded_linear.tendsto |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
466 |
bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
467 |
LIMSEQ_mult ~> tendsto_mult |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
468 |
LIMSEQ_inverse ~> tendsto_inverse |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
469 |
LIMSEQ_divide ~> tendsto_divide |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
470 |
LIMSEQ_pow ~> tendsto_power |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
471 |
LIMSEQ_setsum ~> tendsto_setsum |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
472 |
LIMSEQ_setprod ~> tendsto_setprod |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
473 |
LIMSEQ_norm_zero ~> tendsto_norm_zero_iff |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
474 |
LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
475 |
LIMSEQ_imp_rabs ~> tendsto_rabs |
44710 | 476 |
LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus] |
477 |
LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const] |
|
478 |
LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const] |
|
44748
7f6838b3474a
remove redundant lemma LIMSEQ_Complex in favor of tendsto_Complex
huffman
parents:
44711
diff
changeset
|
479 |
LIMSEQ_Complex ~> tendsto_Complex |
44568
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
480 |
LIM_ident ~> tendsto_ident_at |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
481 |
LIM_const ~> tendsto_const |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
482 |
LIM_add ~> tendsto_add |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
483 |
LIM_add_zero ~> tendsto_add_zero |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
484 |
LIM_minus ~> tendsto_minus |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
485 |
LIM_diff ~> tendsto_diff |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
486 |
LIM_norm ~> tendsto_norm |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
487 |
LIM_norm_zero ~> tendsto_norm_zero |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
488 |
LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
489 |
LIM_norm_zero_iff ~> tendsto_norm_zero_iff |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
490 |
LIM_rabs ~> tendsto_rabs |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
491 |
LIM_rabs_zero ~> tendsto_rabs_zero |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
492 |
LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
493 |
LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
494 |
LIM_compose ~> tendsto_compose |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
495 |
LIM_mult ~> tendsto_mult |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
496 |
LIM_scaleR ~> tendsto_scaleR |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
497 |
LIM_of_real ~> tendsto_of_real |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
498 |
LIM_power ~> tendsto_power |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
499 |
LIM_inverse ~> tendsto_inverse |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
500 |
LIM_sgn ~> tendsto_sgn |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
501 |
isCont_LIM_compose ~> isCont_tendsto_compose |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
502 |
bounded_linear.LIM ~> bounded_linear.tendsto |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
503 |
bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
504 |
bounded_bilinear.LIM ~> bounded_bilinear.tendsto |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
505 |
bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
506 |
bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
507 |
bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset
|
508 |
LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at] |
44522
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset
|
509 |
|
44967 | 510 |
* Theory Complex_Main: The definition of infinite series was |
511 |
generalized. Now it is defined on the type class {topological_space, |
|
512 |
comm_monoid_add}. Hence it is useable also for extended real numbers. |
|
42484 | 513 |
|
44908 | 514 |
* Theory Complex_Main: The complex exponential function "expi" is now |
515 |
a type-constrained abbreviation for "exp :: complex => complex"; thus |
|
516 |
several polymorphic lemmas about "exp" are now applicable to "expi". |
|
517 |
||
44968 | 518 |
* Code generation: |
519 |
||
520 |
- Theory Library/Code_Char_ord provides native ordering of |
|
521 |
characters in the target language. |
|
522 |
||
523 |
- Commands code_module and code_library are legacy, use export_code |
|
524 |
instead. |
|
525 |
||
526 |
- Method "evaluation" is legacy, use method "eval" instead. |
|
527 |
||
528 |
- Legacy evaluator "SML" is deactivated by default. May be |
|
529 |
reactivated by the following theory command: |
|
530 |
||
531 |
setup {* Value.add_evaluator ("SML", Codegen.eval_term) *} |
|
532 |
||
533 |
* Declare ext [intro] by default. Rare INCOMPATIBILITY. |
|
534 |
||
45088 | 535 |
* New proof method "induction" that gives induction hypotheses the |
536 |
name "IH", thus distinguishing them from further hypotheses that come |
|
537 |
from rule induction. The latter are still called "hyps". Method |
|
538 |
"induction" is a thin wrapper around "induct" and follows the same |
|
539 |
syntax. |
|
540 |
||
44968 | 541 |
* Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is |
542 |
still available as a legacy feature for some time. |
|
543 |
||
544 |
* Nitpick: |
|
545 |
- Added "need" and "total_consts" options. |
|
546 |
- Reintroduced "show_skolems" option by popular demand. |
|
547 |
- Renamed attribute: nitpick_def ~> nitpick_unfold. |
|
548 |
INCOMPATIBILITY. |
|
549 |
||
550 |
* Sledgehammer: |
|
551 |
- Use quasi-sound (and efficient) translations by default. |
|
552 |
- Added support for the following provers: E-ToFoF, LEO-II, |
|
553 |
Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax. |
|
554 |
- Automatically preplay and minimize proofs before showing them if |
|
555 |
this can be done within reasonable time. |
|
556 |
- sledgehammer available_provers ~> sledgehammer supported_provers. |
|
557 |
INCOMPATIBILITY. |
|
558 |
- Added "preplay_timeout", "slicing", "type_enc", "sound", |
|
559 |
"max_mono_iters", and "max_new_mono_instances" options. |
|
560 |
- Removed "explicit_apply" and "full_types" options as well as "Full |
|
561 |
Types" Proof General menu item. INCOMPATIBILITY. |
|
562 |
||
563 |
* Metis: |
|
564 |
- Removed "metisF" -- use "metis" instead. INCOMPATIBILITY. |
|
565 |
- Obsoleted "metisFT" -- use "metis (full_types)" instead. |
|
566 |
INCOMPATIBILITY. |
|
567 |
||
568 |
* Command 'try': |
|
569 |
- Renamed 'try_methods' and added "simp:", "intro:", "dest:", and |
|
570 |
"elim:" options. INCOMPATIBILITY. |
|
571 |
- Introduced 'try' that not only runs 'try_methods' but also |
|
572 |
'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'. |
|
573 |
||
574 |
* Quickcheck: |
|
575 |
- Added "eval" option to evaluate terms for the found counterexample |
|
576 |
(currently only supported by the default (exhaustive) tester). |
|
577 |
- Added post-processing of terms to obtain readable counterexamples |
|
578 |
(currently only supported by the default (exhaustive) tester). |
|
579 |
- New counterexample generator quickcheck[narrowing] enables |
|
580 |
narrowing-based testing. Requires the Glasgow Haskell compiler |
|
581 |
with its installation location defined in the Isabelle settings |
|
582 |
environment as ISABELLE_GHC. |
|
583 |
- Removed quickcheck tester "SML" based on the SML code generator |
|
584 |
(formly in HOL/Library). |
|
585 |
||
586 |
* Function package: discontinued option "tailrec". INCOMPATIBILITY, |
|
587 |
use 'partial_function' instead. |
|
588 |
||
589 |
* Theory Library/Extended_Reals replaces now the positive extended |
|
590 |
reals found in probability theory. This file is extended by |
|
591 |
Multivariate_Analysis/Extended_Real_Limits. |
|
592 |
||
44974 | 593 |
* Theory Library/Old_Recdef: old 'recdef' package has been moved here, |
594 |
from where it must be imported explicitly if it is really required. |
|
595 |
INCOMPATIBILITY. |
|
44968 | 596 |
|
597 |
* Theory Library/Wfrec: well-founded recursion combinator "wfrec" has |
|
598 |
been moved here. INCOMPATIBILITY. |
|
599 |
||
600 |
* Theory Library/Saturated provides type of numbers with saturated |
|
601 |
arithmetic. |
|
602 |
||
603 |
* Theory Library/Product_Lattice defines a pointwise ordering for the |
|
604 |
product type 'a * 'b, and provides instance proofs for various order |
|
605 |
and lattice type classes. |
|
606 |
||
607 |
* Theory Library/Countable now provides the "countable_datatype" proof |
|
608 |
method for proving "countable" class instances for datatypes. |
|
609 |
||
610 |
* Theory Library/Cset_Monad allows do notation for computable sets |
|
611 |
(cset) via the generic monad ad-hoc overloading facility. |
|
612 |
||
613 |
* Library: Theories of common data structures are split into theories |
|
614 |
for implementation, an invariant-ensuring type, and connection to an |
|
615 |
abstract type. INCOMPATIBILITY. |
|
616 |
||
617 |
- RBT is split into RBT and RBT_Mapping. |
|
618 |
- AssocList is split and renamed into AList and AList_Mapping. |
|
619 |
- DList is split into DList_Impl, DList, and DList_Cset. |
|
620 |
- Cset is split into Cset and List_Cset. |
|
621 |
||
622 |
* Theory Library/Nat_Infinity has been renamed to |
|
623 |
Library/Extended_Nat, with name changes of the following types and |
|
624 |
constants: |
|
625 |
||
626 |
type inat ~> type enat |
|
627 |
Fin ~> enat |
|
628 |
Infty ~> infinity (overloaded) |
|
629 |
iSuc ~> eSuc |
|
630 |
the_Fin ~> the_enat |
|
631 |
||
632 |
Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has |
|
633 |
been renamed accordingly. INCOMPATIBILITY. |
|
634 |
||
635 |
* Session Multivariate_Analysis: The euclidean_space type class now |
|
636 |
fixes a constant "Basis :: 'a set" consisting of the standard |
|
637 |
orthonormal basis for the type. Users now have the option of |
|
638 |
quantifying over this set instead of using the "basis" function, e.g. |
|
639 |
"ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)". |
|
640 |
||
641 |
* Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed |
|
642 |
to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants |
|
643 |
"Cart_nth" and "Cart_lambda" have been respectively renamed to |
|
644 |
"vec_nth" and "vec_lambda"; theorems mentioning those names have |
|
645 |
changed to match. Definition theorems for overloaded constants now use |
|
646 |
the standard "foo_vec_def" naming scheme. A few other theorems have |
|
647 |
been renamed as follows (INCOMPATIBILITY): |
|
648 |
||
649 |
Cart_eq ~> vec_eq_iff |
|
650 |
dist_nth_le_cart ~> dist_vec_nth_le |
|
651 |
tendsto_vector ~> vec_tendstoI |
|
652 |
Cauchy_vector ~> vec_CauchyI |
|
653 |
||
654 |
* Session Multivariate_Analysis: Several duplicate theorems have been |
|
655 |
removed, and other theorems have been renamed or replaced with more |
|
656 |
general versions. INCOMPATIBILITY. |
|
657 |
||
658 |
finite_choice ~> finite_set_choice |
|
659 |
eventually_conjI ~> eventually_conj |
|
660 |
eventually_and ~> eventually_conj_iff |
|
661 |
eventually_false ~> eventually_False |
|
662 |
setsum_norm ~> norm_setsum |
|
663 |
Lim_sequentially ~> LIMSEQ_def |
|
664 |
Lim_ident_at ~> LIM_ident |
|
665 |
Lim_const ~> tendsto_const |
|
666 |
Lim_cmul ~> tendsto_scaleR [OF tendsto_const] |
|
667 |
Lim_neg ~> tendsto_minus |
|
668 |
Lim_add ~> tendsto_add |
|
669 |
Lim_sub ~> tendsto_diff |
|
670 |
Lim_mul ~> tendsto_scaleR |
|
671 |
Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const] |
|
672 |
Lim_null_norm ~> tendsto_norm_zero_iff [symmetric] |
|
673 |
Lim_linear ~> bounded_linear.tendsto |
|
674 |
Lim_component ~> tendsto_euclidean_component |
|
675 |
Lim_component_cart ~> tendsto_vec_nth |
|
676 |
Lim_inner ~> tendsto_inner [OF tendsto_const] |
|
677 |
dot_lsum ~> inner_setsum_left |
|
678 |
dot_rsum ~> inner_setsum_right |
|
679 |
continuous_cmul ~> continuous_scaleR [OF continuous_const] |
|
680 |
continuous_neg ~> continuous_minus |
|
681 |
continuous_sub ~> continuous_diff |
|
682 |
continuous_vmul ~> continuous_scaleR [OF _ continuous_const] |
|
683 |
continuous_mul ~> continuous_scaleR |
|
684 |
continuous_inv ~> continuous_inverse |
|
685 |
continuous_at_within_inv ~> continuous_at_within_inverse |
|
686 |
continuous_at_inv ~> continuous_at_inverse |
|
687 |
continuous_at_norm ~> continuous_norm [OF continuous_at_id] |
|
688 |
continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id] |
|
689 |
continuous_at_component ~> continuous_component [OF continuous_at_id] |
|
690 |
continuous_on_neg ~> continuous_on_minus |
|
691 |
continuous_on_sub ~> continuous_on_diff |
|
692 |
continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const] |
|
693 |
continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const] |
|
694 |
continuous_on_mul ~> continuous_on_scaleR |
|
695 |
continuous_on_mul_real ~> continuous_on_mult |
|
696 |
continuous_on_inner ~> continuous_on_inner [OF continuous_on_const] |
|
697 |
continuous_on_norm ~> continuous_on_norm [OF continuous_on_id] |
|
698 |
continuous_on_inverse ~> continuous_on_inv |
|
699 |
uniformly_continuous_on_neg ~> uniformly_continuous_on_minus |
|
700 |
uniformly_continuous_on_sub ~> uniformly_continuous_on_diff |
|
701 |
subset_interior ~> interior_mono |
|
702 |
subset_closure ~> closure_mono |
|
703 |
closure_univ ~> closure_UNIV |
|
704 |
real_arch_lt ~> reals_Archimedean2 |
|
705 |
real_arch ~> reals_Archimedean3 |
|
706 |
real_abs_norm ~> abs_norm_cancel |
|
707 |
real_abs_sub_norm ~> norm_triangle_ineq3 |
|
708 |
norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2 |
|
709 |
||
710 |
* Session HOL-Probability: |
|
711 |
- Caratheodory's extension lemma is now proved for ring_of_sets. |
|
712 |
- Infinite products of probability measures are now available. |
|
713 |
- Sigma closure is independent, if the generator is independent |
|
714 |
- Use extended reals instead of positive extended |
|
715 |
reals. INCOMPATIBILITY. |
|
716 |
||
45049 | 717 |
* Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY. |
718 |
||
719 |
expand_fun_below ~> fun_below_iff |
|
720 |
below_fun_ext ~> fun_belowI |
|
721 |
expand_cfun_eq ~> cfun_eq_iff |
|
722 |
ext_cfun ~> cfun_eqI |
|
723 |
expand_cfun_below ~> cfun_below_iff |
|
724 |
below_cfun_ext ~> cfun_belowI |
|
725 |
monofun_fun_fun ~> fun_belowD |
|
726 |
monofun_fun_arg ~> monofunE |
|
727 |
monofun_lub_fun ~> adm_monofun [THEN admD] |
|
728 |
cont_lub_fun ~> adm_cont [THEN admD] |
|
729 |
cont2cont_Rep_CFun ~> cont2cont_APP |
|
730 |
cont_Rep_CFun_app ~> cont_APP_app |
|
731 |
cont_Rep_CFun_app_app ~> cont_APP_app_app |
|
732 |
cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE] |
|
733 |
cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE] |
|
734 |
contlub_cfun ~> lub_APP [symmetric] |
|
735 |
contlub_LAM ~> lub_LAM [symmetric] |
|
736 |
thelubI ~> lub_eqI |
|
737 |
UU_I ~> bottomI |
|
738 |
lift_distinct1 ~> lift.distinct(1) |
|
739 |
lift_distinct2 ~> lift.distinct(2) |
|
740 |
Def_not_UU ~> lift.distinct(2) |
|
741 |
Def_inject ~> lift.inject |
|
742 |
below_UU_iff ~> below_bottom_iff |
|
743 |
eq_UU_iff ~> eq_bottom_iff |
|
744 |
||
44903 | 745 |
|
41685
e29ea98a76ce
term style 'isub': ad-hoc subscripting of variables that end with digits (x1, x23, ...)
krauss
parents:
41667
diff
changeset
|
746 |
*** Document preparation *** |
e29ea98a76ce
term style 'isub': ad-hoc subscripting of variables that end with digits (x1, x23, ...)
krauss
parents:
41667
diff
changeset
|
747 |
|
44800 | 748 |
* Antiquotation @{rail} layouts railroad syntax diagrams, see also |
749 |
isar-ref manual, both for description and actual application of the |
|
750 |
same. |
|
751 |
||
752 |
* Antiquotation @{value} evaluates the given term and presents its |
|
753 |
result. |
|
754 |
||
755 |
* Antiquotations: term style "isub" provides ad-hoc conversion of |
|
756 |
variables x1, y23 into subscripted form x\<^isub>1, |
|
757 |
y\<^isub>2\<^isub>3. |
|
41651 | 758 |
|
42484 | 759 |
* Predefined LaTeX macros for Isabelle symbols \<bind> and \<then> |
760 |
(e.g. see ~~/src/HOL/Library/Monad_Syntax.thy). |
|
761 |
||
44967 | 762 |
* Localized \isabellestyle switch can be used within blocks or groups |
763 |
like this: |
|
764 |
||
765 |
\isabellestyle{it} %preferred default |
|
766 |
{\isabellestylett @{text "typewriter stuff"}} |
|
767 |
||
768 |
* Discontinued special treatment of hard tabulators. Implicit |
|
769 |
tab-width is now defined as 1. Potential INCOMPATIBILITY for visual |
|
770 |
layouts. |
|
44800 | 771 |
|
41651 | 772 |
|
41944
b97091ae583a
Path.print is the official way to show file-system paths to users -- note that Path.implode often indicates violation of the abstract datatype;
wenzelm
parents:
41886
diff
changeset
|
773 |
*** ML *** |
b97091ae583a
Path.print is the official way to show file-system paths to users -- note that Path.implode often indicates violation of the abstract datatype;
wenzelm
parents:
41886
diff
changeset
|
774 |
|
43731
70072780e095
inner syntax supports inlined YXML according to Term_XML (particularly useful for producing text under program control);
wenzelm
parents:
43709
diff
changeset
|
775 |
* The inner syntax of sort/type/term/prop supports inlined YXML |
70072780e095
inner syntax supports inlined YXML according to Term_XML (particularly useful for producing text under program control);
wenzelm
parents:
43709
diff
changeset
|
776 |
representations within quoted string tokens. By encoding logical |
70072780e095
inner syntax supports inlined YXML according to Term_XML (particularly useful for producing text under program control);
wenzelm
parents:
43709
diff
changeset
|
777 |
entities via Term_XML (in ML or Scala) concrete syntax can be |
70072780e095
inner syntax supports inlined YXML according to Term_XML (particularly useful for producing text under program control);
wenzelm
parents:
43709
diff
changeset
|
778 |
bypassed, which is particularly useful for producing bits of text |
70072780e095
inner syntax supports inlined YXML according to Term_XML (particularly useful for producing text under program control);
wenzelm
parents:
43709
diff
changeset
|
779 |
under external program control. |
70072780e095
inner syntax supports inlined YXML according to Term_XML (particularly useful for producing text under program control);
wenzelm
parents:
43709
diff
changeset
|
780 |
|
43565 | 781 |
* Antiquotations for ML and document preparation are managed as theory |
782 |
data, which requires explicit setup. |
|
783 |
||
42897 | 784 |
* Isabelle_Process.is_active allows tools to check if the official |
785 |
process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop |
|
786 |
(better known as Proof General). |
|
787 |
||
42360 | 788 |
* Structure Proof_Context follows standard naming scheme. Old |
789 |
ProofContext is still available for some time as legacy alias. |
|
790 |
||
42015
7b6e72a1b7dd
NEWS: structure Timing provides various operations for timing;
wenzelm
parents:
41999
diff
changeset
|
791 |
* Structure Timing provides various operations for timing; supersedes |
7b6e72a1b7dd
NEWS: structure Timing provides various operations for timing;
wenzelm
parents:
41999
diff
changeset
|
792 |
former start_timing/end_timing etc. |
7b6e72a1b7dd
NEWS: structure Timing provides various operations for timing;
wenzelm
parents:
41999
diff
changeset
|
793 |
|
41944
b97091ae583a
Path.print is the official way to show file-system paths to users -- note that Path.implode often indicates violation of the abstract datatype;
wenzelm
parents:
41886
diff
changeset
|
794 |
* Path.print is the official way to show file-system paths to users |
b97091ae583a
Path.print is the official way to show file-system paths to users -- note that Path.implode often indicates violation of the abstract datatype;
wenzelm
parents:
41886
diff
changeset
|
795 |
(including quotes etc.). |
b97091ae583a
Path.print is the official way to show file-system paths to users -- note that Path.implode often indicates violation of the abstract datatype;
wenzelm
parents:
41886
diff
changeset
|
796 |
|
42056
160a630b2c7e
enable inner syntax source positions by default (controlled via configuration option);
wenzelm
parents:
42015
diff
changeset
|
797 |
* Inner syntax: identifiers in parse trees of generic categories |
160a630b2c7e
enable inner syntax source positions by default (controlled via configuration option);
wenzelm
parents:
42015
diff
changeset
|
798 |
"logic", "aprop", "idt" etc. carry position information (disguised as |
160a630b2c7e
enable inner syntax source positions by default (controlled via configuration option);
wenzelm
parents:
42015
diff
changeset
|
799 |
type constraints). Occasional INCOMPATIBILITY with non-compliant |
42057
3eba96ff3d3e
more selective strip_positions in case patterns -- reactivate translations based on "case _ of _" in HOL and special patterns in HOLCF;
wenzelm
parents:
42056
diff
changeset
|
800 |
translations that choke on unexpected type constraints. Positions can |
3eba96ff3d3e
more selective strip_positions in case patterns -- reactivate translations based on "case _ of _" in HOL and special patterns in HOLCF;
wenzelm
parents:
42056
diff
changeset
|
801 |
be stripped in ML translations via Syntax.strip_positions / |
3eba96ff3d3e
more selective strip_positions in case patterns -- reactivate translations based on "case _ of _" in HOL and special patterns in HOLCF;
wenzelm
parents:
42056
diff
changeset
|
802 |
Syntax.strip_positions_ast, or via the syntax constant |
3eba96ff3d3e
more selective strip_positions in case patterns -- reactivate translations based on "case _ of _" in HOL and special patterns in HOLCF;
wenzelm
parents:
42056
diff
changeset
|
803 |
"_strip_positions" within parse trees. As last resort, positions can |
3eba96ff3d3e
more selective strip_positions in case patterns -- reactivate translations based on "case _ of _" in HOL and special patterns in HOLCF;
wenzelm
parents:
42056
diff
changeset
|
804 |
be disabled via the configuration option Syntax.positions, which is |
3eba96ff3d3e
more selective strip_positions in case patterns -- reactivate translations based on "case _ of _" in HOL and special patterns in HOLCF;
wenzelm
parents:
42056
diff
changeset
|
805 |
called "syntax_positions" in Isar attribute syntax. |
42056
160a630b2c7e
enable inner syntax source positions by default (controlled via configuration option);
wenzelm
parents:
42015
diff
changeset
|
806 |
|
42290
b1f544c84040
discontinued special treatment of structure Lexicon;
wenzelm
parents:
42284
diff
changeset
|
807 |
* Discontinued special status of various ML structures that contribute |
b1f544c84040
discontinued special treatment of structure Lexicon;
wenzelm
parents:
42284
diff
changeset
|
808 |
to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less |
b1f544c84040
discontinued special treatment of structure Lexicon;
wenzelm
parents:
42284
diff
changeset
|
809 |
pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY, |
b1f544c84040
discontinued special treatment of structure Lexicon;
wenzelm
parents:
42284
diff
changeset
|
810 |
refer directly to Ast.Constant, Lexicon.is_identifier, |
b1f544c84040
discontinued special treatment of structure Lexicon;
wenzelm
parents:
42284
diff
changeset
|
811 |
Syntax_Trans.mk_binder_tr etc. |
42224
578a51fae383
discontinued special treatment of structure Ast: no pervasive content, no inclusion in structure Syntax;
wenzelm
parents:
42180
diff
changeset
|
812 |
|
42247
12fe41a92cd5
typed_print_translation: discontinued show_sorts argument;
wenzelm
parents:
42239
diff
changeset
|
813 |
* Typed print translation: discontinued show_sorts argument, which is |
12fe41a92cd5
typed_print_translation: discontinued show_sorts argument;
wenzelm
parents:
42239
diff
changeset
|
814 |
already available via context of "advanced" translation. |
12fe41a92cd5
typed_print_translation: discontinued show_sorts argument;
wenzelm
parents:
42239
diff
changeset
|
815 |
|
42370 | 816 |
* Refined PARALLEL_GOALS tactical: degrades gracefully for schematic |
817 |
goal states; body tactic needs to address all subgoals uniformly. |
|
818 |
||
42403
38b29c9fc742
slightly more special eq_list/eq_set, with shortcut involving pointer_eq;
wenzelm
parents:
42370
diff
changeset
|
819 |
* Slightly more special eq_list/eq_set, with shortcut involving |
38b29c9fc742
slightly more special eq_list/eq_set, with shortcut involving pointer_eq;
wenzelm
parents:
42370
diff
changeset
|
820 |
pointer equality (assumes that eq relation is reflexive). |
38b29c9fc742
slightly more special eq_list/eq_set, with shortcut involving pointer_eq;
wenzelm
parents:
42370
diff
changeset
|
821 |
|
42793 | 822 |
* Classical tactics use proper Proof.context instead of historic types |
823 |
claset/clasimpset. Old-style declarations like addIs, addEs, addDs |
|
824 |
operate directly on Proof.context. Raw type claset retains its use as |
|
825 |
snapshot of the classical context, which can be recovered via |
|
826 |
(put_claset HOL_cs) etc. Type clasimpset has been discontinued. |
|
827 |
INCOMPATIBILITY, classical tactics and derived proof methods require |
|
828 |
proper Proof.context. |
|
829 |
||
44803 | 830 |
|
831 |
*** System *** |
|
832 |
||
44968 | 833 |
* Discontinued support for Poly/ML 5.2, which was the last version |
834 |
without proper multithreading and TimeLimit implementation. |
|
835 |
||
836 |
* Discontinued old lib/scripts/polyml-platform, which has been |
|
837 |
obsolete since Isabelle2009-2. |
|
838 |
||
44967 | 839 |
* Various optional external tools are referenced more robustly and |
840 |
uniformly by explicit Isabelle settings as follows: |
|
841 |
||
842 |
ISABELLE_CSDP (formerly CSDP_EXE) |
|
843 |
ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH) |
|
844 |
ISABELLE_OCAML (formerly EXEC_OCAML) |
|
845 |
ISABELLE_SWIPL (formerly EXEC_SWIPL) |
|
846 |
ISABELLE_YAP (formerly EXEC_YAP) |
|
847 |
||
848 |
Note that automated detection from the file-system or search path has |
|
849 |
been discontinued. INCOMPATIBILITY. |
|
850 |
||
43752 | 851 |
* Scala layer provides JVM method invocation service for static |
44800 | 852 |
methods of type (String)String, see Invoke_Scala.method in ML. For |
853 |
example: |
|
43752 | 854 |
|
855 |
Invoke_Scala.method "java.lang.System.getProperty" "java.home" |
|
856 |
||
44967 | 857 |
Together with YXML.string_of_body/parse_body and XML.Encode/Decode |
858 |
this allows to pass structured values between ML and Scala. |
|
44800 | 859 |
|
44803 | 860 |
* The IsabelleText fonts includes some further glyphs to support the |
861 |
Prover IDE. Potential INCOMPATIBILITY: users who happen to have |
|
862 |
installed a local copy (which is normally *not* required) need to |
|
863 |
delete or update it from ~~/lib/fonts/. |
|
41944
b97091ae583a
Path.print is the official way to show file-system paths to users -- note that Path.implode often indicates violation of the abstract datatype;
wenzelm
parents:
41886
diff
changeset
|
864 |
|
41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset
|
865 |
|
45089 | 866 |
|
41512 | 867 |
New in Isabelle2011 (January 2011) |
868 |
---------------------------------- |
|
37383 | 869 |
|
37536
c62aa9281101
explicit treatment of UTF8 sequences as Isabelle symbols;
wenzelm
parents:
37484
diff
changeset
|
870 |
*** General *** |
c62aa9281101
explicit treatment of UTF8 sequences as Isabelle symbols;
wenzelm
parents:
37484
diff
changeset
|
871 |
|
41573 | 872 |
* Experimental Prover IDE based on Isabelle/Scala and jEdit (see |
41612 | 873 |
src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with |
874 |
useful tooltips and hyperlinks produced from its static analysis. The |
|
875 |
bundled component provides an executable Isabelle tool that can be run |
|
876 |
like this: |
|
877 |
||
878 |
Isabelle2011/bin/isabelle jedit |
|
41573 | 879 |
|
40948 | 880 |
* Significantly improved Isabelle/Isar implementation manual. |
881 |
||
41594 | 882 |
* System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER |
41595 | 883 |
(and thus refers to something like $HOME/.isabelle/Isabelle2011), |
41594 | 884 |
while the default heap location within that directory lacks that extra |
885 |
suffix. This isolates multiple Isabelle installations from each |
|
886 |
other, avoiding problems with old settings in new versions. |
|
887 |
INCOMPATIBILITY, need to copy/upgrade old user settings manually. |
|
888 |
||
40947 | 889 |
* Source files are always encoded as UTF-8, instead of old-fashioned |
890 |
ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require |
|
40948 | 891 |
the following package declarations: |
40947 | 892 |
|
893 |
\usepackage[utf8]{inputenc} |
|
894 |
\usepackage{textcomp} |
|
895 |
||
41440 | 896 |
* Explicit treatment of UTF-8 sequences as Isabelle symbols, such that |
37536
c62aa9281101
explicit treatment of UTF8 sequences as Isabelle symbols;
wenzelm
parents:
37484
diff
changeset
|
897 |
a Unicode character is treated as a single symbol, not a sequence of |
c62aa9281101
explicit treatment of UTF8 sequences as Isabelle symbols;
wenzelm
parents:
37484
diff
changeset
|
898 |
non-ASCII bytes as before. Since Isabelle/ML string literals may |
c62aa9281101
explicit treatment of UTF8 sequences as Isabelle symbols;
wenzelm
parents:
37484
diff
changeset
|
899 |
contain symbols without further backslash escapes, Unicode can now be |
c62aa9281101
explicit treatment of UTF8 sequences as Isabelle symbols;
wenzelm
parents:
37484
diff
changeset
|
900 |
used here as well. Recall that Symbol.explode in ML provides a |
c62aa9281101
explicit treatment of UTF8 sequences as Isabelle symbols;
wenzelm
parents:
37484
diff
changeset
|
901 |
consistent view on symbols, while raw explode (or String.explode) |
c62aa9281101
explicit treatment of UTF8 sequences as Isabelle symbols;
wenzelm
parents:
37484
diff
changeset
|
902 |
merely give a byte-oriented representation. |
c62aa9281101
explicit treatment of UTF8 sequences as Isabelle symbols;
wenzelm
parents:
37484
diff
changeset
|
903 |
|
41594 | 904 |
* Theory loader: source files are primarily located via the master |
905 |
directory of each theory node (where the .thy file itself resides). |
|
906 |
The global load path is still partially available as legacy feature. |
|
907 |
Minor INCOMPATIBILITY due to subtle change in file lookup: use |
|
908 |
explicit paths, relatively to the theory. |
|
38135
2b9bfa0b44f1
theory loading: only the master source file is looked-up in the implicit load path;
wenzelm
parents:
38110
diff
changeset
|
909 |
|
37939
965537d86fcc
discontinued special treatment of ML files -- no longer complete extensions on demand;
wenzelm
parents:
37868
diff
changeset
|
910 |
* Special treatment of ML file names has been discontinued. |
965537d86fcc
discontinued special treatment of ML files -- no longer complete extensions on demand;
wenzelm
parents:
37868
diff
changeset
|
911 |
Historically, optional extensions .ML or .sml were added on demand -- |
965537d86fcc
discontinued special treatment of ML files -- no longer complete extensions on demand;
wenzelm
parents:
37868
diff
changeset
|
912 |
at the cost of clarity of file dependencies. Recall that Isabelle/ML |
965537d86fcc
discontinued special treatment of ML files -- no longer complete extensions on demand;
wenzelm
parents:
37868
diff
changeset
|
913 |
files exclusively use the .ML extension. Minor INCOMPATIBILTY. |
965537d86fcc
discontinued special treatment of ML files -- no longer complete extensions on demand;
wenzelm
parents:
37868
diff
changeset
|
914 |
|
38980
af73cf0dc31f
turned show_question_marks into proper configuration option;
wenzelm
parents:
38864
diff
changeset
|
915 |
* Various options that affect pretty printing etc. are now properly |
38767
d8da44a8dd25
proper context for various Thy_Output options, via official configuration options in ML and Isar;
wenzelm
parents:
38708
diff
changeset
|
916 |
handled within the context via configuration options, instead of |
40879
ca132ef44944
configuration option "show_abbrevs" supersedes print mode "no_abbrevs", with inverted meaning;
wenzelm
parents:
40878
diff
changeset
|
917 |
unsynchronized references or print modes. There are both ML Config.T |
ca132ef44944
configuration option "show_abbrevs" supersedes print mode "no_abbrevs", with inverted meaning;
wenzelm
parents:
40878
diff
changeset
|
918 |
entities and Isar declaration attributes to access these. |
38767
d8da44a8dd25
proper context for various Thy_Output options, via official configuration options in ML and Isar;
wenzelm
parents:
38708
diff
changeset
|
919 |
|
39125
f45d332a90e3
pretty_goals: turned some global references and function arguments into configuration options (goals_limit = 10, goals_total = true, show_main_goal = false) depending on the context;
wenzelm
parents:
39105
diff
changeset
|
920 |
ML (Config.T) Isar (attribute) |
f45d332a90e3
pretty_goals: turned some global references and function arguments into configuration options (goals_limit = 10, goals_total = true, show_main_goal = false) depending on the context;
wenzelm
parents:
39105
diff
changeset
|
921 |
|
39128
93a7365fb4ee
turned eta_contract into proper configuration option;
wenzelm
parents:
39126
diff
changeset
|
922 |
eta_contract eta_contract |
39137
ccb53edd59f0
turned show_brackets into proper configuration option;
wenzelm
parents:
39134
diff
changeset
|
923 |
show_brackets show_brackets |
39134
917b4b6ba3d2
turned show_sorts/show_types into proper configuration options;
wenzelm
parents:
39128
diff
changeset
|
924 |
show_sorts show_sorts |
917b4b6ba3d2
turned show_sorts/show_types into proper configuration options;
wenzelm
parents:
39128
diff
changeset
|
925 |
show_types show_types |
39126
ee117c5b3b75
configuration options Syntax.ambiguity_enabled (inverse of former Syntax.ambiguity_is_error), Syntax.ambiguity_level (with Isar attribute "syntax_ambiguity_level"), Syntax.ambiguity_limit;
wenzelm
parents:
39125
diff
changeset
|
926 |
show_question_marks show_question_marks |
ee117c5b3b75
configuration options Syntax.ambiguity_enabled (inverse of former Syntax.ambiguity_is_error), Syntax.ambiguity_level (with Isar attribute "syntax_ambiguity_level"), Syntax.ambiguity_limit;
wenzelm
parents:
39125
diff
changeset
|
927 |
show_consts show_consts |
40879
ca132ef44944
configuration option "show_abbrevs" supersedes print mode "no_abbrevs", with inverted meaning;
wenzelm
parents:
40878
diff
changeset
|
928 |
show_abbrevs show_abbrevs |
39126
ee117c5b3b75
configuration options Syntax.ambiguity_enabled (inverse of former Syntax.ambiguity_is_error), Syntax.ambiguity_level (with Isar attribute "syntax_ambiguity_level"), Syntax.ambiguity_limit;
wenzelm
parents:
39125
diff
changeset
|
929 |
|
41379 | 930 |
Syntax.ast_trace syntax_ast_trace |
931 |
Syntax.ast_stat syntax_ast_stat |
|
39126
ee117c5b3b75
configuration options Syntax.ambiguity_enabled (inverse of former Syntax.ambiguity_is_error), Syntax.ambiguity_level (with Isar attribute "syntax_ambiguity_level"), Syntax.ambiguity_limit;
wenzelm
parents:
39125
diff
changeset
|
932 |
Syntax.ambiguity_level syntax_ambiguity_level |
ee117c5b3b75
configuration options Syntax.ambiguity_enabled (inverse of former Syntax.ambiguity_is_error), Syntax.ambiguity_level (with Isar attribute "syntax_ambiguity_level"), Syntax.ambiguity_limit;
wenzelm
parents:
39125
diff
changeset
|
933 |
|
ee117c5b3b75
configuration options Syntax.ambiguity_enabled (inverse of former Syntax.ambiguity_is_error), Syntax.ambiguity_level (with Isar attribute "syntax_ambiguity_level"), Syntax.ambiguity_limit;
wenzelm
parents:
39125
diff
changeset
|
934 |
Goal_Display.goals_limit goals_limit |
ee117c5b3b75
configuration options Syntax.ambiguity_enabled (inverse of former Syntax.ambiguity_is_error), Syntax.ambiguity_level (with Isar attribute "syntax_ambiguity_level"), Syntax.ambiguity_limit;
wenzelm
parents:
39125
diff
changeset
|
935 |
Goal_Display.show_main_goal show_main_goal |
ee117c5b3b75
configuration options Syntax.ambiguity_enabled (inverse of former Syntax.ambiguity_is_error), Syntax.ambiguity_level (with Isar attribute "syntax_ambiguity_level"), Syntax.ambiguity_limit;
wenzelm
parents:
39125
diff
changeset
|
936 |
|
41379 | 937 |
Method.rule_trace rule_trace |
938 |
||
39125
f45d332a90e3
pretty_goals: turned some global references and function arguments into configuration options (goals_limit = 10, goals_total = true, show_main_goal = false) depending on the context;
wenzelm
parents:
39105
diff
changeset
|
939 |
Thy_Output.display thy_output_display |
f45d332a90e3
pretty_goals: turned some global references and function arguments into configuration options (goals_limit = 10, goals_total = true, show_main_goal = false) depending on the context;
wenzelm
parents:
39105
diff
changeset
|
940 |
Thy_Output.quotes thy_output_quotes |
f45d332a90e3
pretty_goals: turned some global references and function arguments into configuration options (goals_limit = 10, goals_total = true, show_main_goal = false) depending on the context;
wenzelm
parents:
39105
diff
changeset
|
941 |
Thy_Output.indent thy_output_indent |
f45d332a90e3
pretty_goals: turned some global references and function arguments into configuration options (goals_limit = 10, goals_total = true, show_main_goal = false) depending on the context;
wenzelm
parents:
39105
diff
changeset
|
942 |
Thy_Output.source thy_output_source |
f45d332a90e3
pretty_goals: turned some global references and function arguments into configuration options (goals_limit = 10, goals_total = true, show_main_goal = false) depending on the context;
wenzelm
parents:
39105
diff
changeset
|
943 |
Thy_Output.break thy_output_break |
f45d332a90e3
pretty_goals: turned some global references and function arguments into configuration options (goals_limit = 10, goals_total = true, show_main_goal = false) depending on the context;
wenzelm
parents:
39105
diff
changeset
|
944 |
|
41440 | 945 |
Note that corresponding "..._default" references in ML may only be |
38767
d8da44a8dd25
proper context for various Thy_Output options, via official configuration options in ML and Isar;
wenzelm
parents:
38708
diff
changeset
|
946 |
changed globally at the ROOT session setup, but *not* within a theory. |
40879
ca132ef44944
configuration option "show_abbrevs" supersedes print mode "no_abbrevs", with inverted meaning;
wenzelm
parents:
40878
diff
changeset
|
947 |
The option "show_abbrevs" supersedes the former print mode |
ca132ef44944
configuration option "show_abbrevs" supersedes print mode "no_abbrevs", with inverted meaning;
wenzelm
parents:
40878
diff
changeset
|
948 |
"no_abbrevs" with inverted meaning. |
38767
d8da44a8dd25
proper context for various Thy_Output options, via official configuration options in ML and Isar;
wenzelm
parents:
38708
diff
changeset
|
949 |
|
40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
40866
diff
changeset
|
950 |
* More systematic naming of some configuration options. |
41294 | 951 |
INCOMPATIBILITY. |
40878
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
40866
diff
changeset
|
952 |
|
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
40866
diff
changeset
|
953 |
trace_simp ~> simp_trace |
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
40866
diff
changeset
|
954 |
debug_simp ~> simp_debug |
7695e4de4d86
renamed trace_simp to simp_trace, and debug_simp to simp_debug;
wenzelm
parents:
40866
diff
changeset
|
955 |
|
40291 | 956 |
* Support for real valued configuration options, using simplistic |
957 |
floating-point notation that coincides with the inner syntax for |
|
958 |
float_token. |
|
959 |
||
41594 | 960 |
* Support for real valued preferences (with approximative PGIP type): |
961 |
front-ends need to accept "pgint" values in float notation. |
|
962 |
INCOMPATIBILITY. |
|
41573 | 963 |
|
964 |
* The IsabelleText font now includes Cyrillic, Hebrew, Arabic from |
|
965 |
DejaVu Sans. |
|
966 |
||
41594 | 967 |
* Discontinued support for Poly/ML 5.0 and 5.1 versions. |
968 |
||
40948 | 969 |
|
970 |
*** Pure *** |
|
971 |
||
41249
26f12f98f50a
Command 'type_synonym' (with single argument) supersedes 'types' (legacy feature);
wenzelm
parents:
41229
diff
changeset
|
972 |
* Command 'type_synonym' (with single argument) replaces somewhat |
26f12f98f50a
Command 'type_synonym' (with single argument) supersedes 'types' (legacy feature);
wenzelm
parents:
41229
diff
changeset
|
973 |
outdated 'types', which is still available as legacy feature for some |
26f12f98f50a
Command 'type_synonym' (with single argument) supersedes 'types' (legacy feature);
wenzelm
parents:
41229
diff
changeset
|
974 |
time. |
26f12f98f50a
Command 'type_synonym' (with single argument) supersedes 'types' (legacy feature);
wenzelm
parents:
41229
diff
changeset
|
975 |
|
26f12f98f50a
Command 'type_synonym' (with single argument) supersedes 'types' (legacy feature);
wenzelm
parents:
41229
diff
changeset
|
976 |
* Command 'nonterminal' (with 'and' separated list of arguments) |
26f12f98f50a
Command 'type_synonym' (with single argument) supersedes 'types' (legacy feature);
wenzelm
parents:
41229
diff
changeset
|
977 |
replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY. |
41229
d797baa3d57c
replaced command 'nonterminals' by slightly modernized version 'nonterminal';
wenzelm
parents:
41228
diff
changeset
|
978 |
|
40965
54b6c9e1c157
command 'notepad' replaces former 'example_proof';
wenzelm
parents:
40959
diff
changeset
|
979 |
* Command 'notepad' replaces former 'example_proof' for |
41020 | 980 |
experimentation in Isar without any result. INCOMPATIBILITY. |
40965
54b6c9e1c157
command 'notepad' replaces former 'example_proof';
wenzelm
parents:
40959
diff
changeset
|
981 |
|
41435 | 982 |
* Locale interpretation commands 'interpret' and 'sublocale' accept |
983 |
lists of equations to map definitions in a locale to appropriate |
|
984 |
entities in the context of the interpretation. The 'interpretation' |
|
985 |
command already provided this functionality. |
|
986 |
||
41594 | 987 |
* Diagnostic command 'print_dependencies' prints the locale instances |
988 |
that would be activated if the specified expression was interpreted in |
|
989 |
the current context. Variant "print_dependencies!" assumes a context |
|
990 |
without interpretations. |
|
38110 | 991 |
|
992 |
* Diagnostic command 'print_interps' prints interpretations in proofs |
|
993 |
in addition to interpretations in theories. |
|
994 |
||
38708
8915e3ce8655
discontinued obsolete 'global' and 'local' commands;
wenzelm
parents:
38656
diff
changeset
|
995 |
* Discontinued obsolete 'global' and 'local' commands to manipulate |
8915e3ce8655
discontinued obsolete 'global' and 'local' commands;
wenzelm
parents:
38656
diff
changeset
|
996 |
the theory name space. Rare INCOMPATIBILITY. The ML functions |
8915e3ce8655
discontinued obsolete 'global' and 'local' commands;
wenzelm
parents:
38656
diff
changeset
|
997 |
Sign.root_path and Sign.local_path may be applied directly where this |
8915e3ce8655
discontinued obsolete 'global' and 'local' commands;
wenzelm
parents:
38656
diff
changeset
|
998 |
feature is still required for historical reasons. |
8915e3ce8655
discontinued obsolete 'global' and 'local' commands;
wenzelm
parents:
38656
diff
changeset
|
999 |
|
40948 | 1000 |
* Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use |
39215 | 1001 |
'definition' instead. |
1002 |
||
41574 | 1003 |
* The "prems" fact, which refers to the accidental collection of |
1004 |
foundational premises in the context, is now explicitly marked as |
|
41594 | 1005 |
legacy feature and will be discontinued soon. Consider using "assms" |
1006 |
of the head statement or reference facts by explicit names. |
|
41574 | 1007 |
|
40801 | 1008 |
* Document antiquotations @{class} and @{type} print classes and type |
1009 |
constructors. |
|
1010 |
||
1011 |
* Document antiquotation @{file} checks file/directory entries within |
|
1012 |
the local file system. |
|
39305
d4fa19eb0822
'class' and 'type' are now antiquoations by default
haftmann
parents:
39277
diff
changeset
|
1013 |
|
38110 | 1014 |
|
37387
3581483cca6c
qualified types "+" and nat; qualified constants Ball, Bex, Suc, curry; modernized some specifications
haftmann
parents:
37383
diff
changeset
|
1015 |
*** HOL *** |
3581483cca6c
qualified types "+" and nat; qualified constants Ball, Bex, Suc, curry; modernized some specifications
haftmann
parents:
37383
diff
changeset
|
1016 |
|
41594 | 1017 |
* Coercive subtyping: functions can be declared as coercions and type |
1018 |
inference will add them as necessary upon input of a term. Theory |
|
1019 |
Complex_Main declares real :: nat => real and real :: int => real as |
|
1020 |
coercions. A coercion function f is declared like this: |
|
40939
2c150063cd4d
setup subtyping/coercions once in HOL.thy, but enable it only later via configuration option;
wenzelm
parents:
40927
diff
changeset
|
1021 |
|
2c150063cd4d
setup subtyping/coercions once in HOL.thy, but enable it only later via configuration option;
wenzelm
parents:
40927
diff
changeset
|
1022 |
declare [[coercion f]] |
40866 | 1023 |
|
41571 | 1024 |
To lift coercions through type constructors (e.g. from nat => real to |
40866 | 1025 |
nat list => real list), map functions can be declared, e.g. |
1026 |
||
40939
2c150063cd4d
setup subtyping/coercions once in HOL.thy, but enable it only later via configuration option;
wenzelm
parents:
40927
diff
changeset
|
1027 |
declare [[coercion_map map]] |
2c150063cd4d
setup subtyping/coercions once in HOL.thy, but enable it only later via configuration option;
wenzelm
parents:
40927
diff
changeset
|
1028 |
|
2c150063cd4d
setup subtyping/coercions once in HOL.thy, but enable it only later via configuration option;
wenzelm
parents:
40927
diff
changeset
|
1029 |
Currently coercion inference is activated only in theories including |
2c150063cd4d
setup subtyping/coercions once in HOL.thy, but enable it only later via configuration option;
wenzelm
parents:
40927
diff
changeset
|
1030 |
real numbers, i.e. descendants of Complex_Main. This is controlled by |
41020 | 1031 |
the configuration option "coercion_enabled", e.g. it can be enabled in |
40939
2c150063cd4d
setup subtyping/coercions once in HOL.thy, but enable it only later via configuration option;
wenzelm
parents:
40927
diff
changeset
|
1032 |
other theories like this: |
2c150063cd4d
setup subtyping/coercions once in HOL.thy, but enable it only later via configuration option;
wenzelm
parents:
40927
diff
changeset
|
1033 |
|
2c150063cd4d
setup subtyping/coercions once in HOL.thy, but enable it only later via configuration option;
wenzelm
parents:
40927
diff
changeset
|
1034 |
declare [[coercion_enabled]] |
40866 | 1035 |
|
41571 | 1036 |
* Command 'partial_function' provides basic support for recursive |
1037 |
function definitions over complete partial orders. Concrete instances |
|
40183 | 1038 |
are provided for i) the option type, ii) tail recursion on arbitrary |
41571 | 1039 |
types, and iii) the heap monad of Imperative_HOL. See |
1040 |
src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy |
|
1041 |
for examples. |
|
40183 | 1042 |
|
41571 | 1043 |
* Function package: f.psimps rules are no longer implicitly declared |
1044 |
as [simp]. INCOMPATIBILITY. |
|
41398 | 1045 |
|
1046 |
* Datatype package: theorems generated for executable equality (class |
|
41571 | 1047 |
"eq") carry proper names and are treated as default code equations. |
1048 |
||
41594 | 1049 |
* Inductive package: now offers command 'inductive_simps' to |
1050 |
automatically derive instantiated and simplified equations for |
|
1051 |
inductive predicates, similar to 'inductive_cases'. |
|
1052 |
||
41571 | 1053 |
* Command 'enriched_type' allows to register properties of the |
1054 |
functorial structure of types. |
|
39771 | 1055 |
|
39644 | 1056 |
* Improved infrastructure for term evaluation using code generator |
1057 |
techniques, in particular static evaluation conversions. |
|
1058 |
||
41594 | 1059 |
* Code generator: Scala (2.8 or higher) has been added to the target |
1060 |
languages. |
|
1061 |
||
41398 | 1062 |
* Code generator: globbing constant expressions "*" and "Theory.*" |
1063 |
have been replaced by the more idiomatic "_" and "Theory._". |
|
1064 |
INCOMPATIBILITY. |
|
1065 |
||
1066 |
* Code generator: export_code without explicit file declaration prints |
|
1067 |
to standard output. INCOMPATIBILITY. |
|
1068 |
||
1069 |
* Code generator: do not print function definitions for case |
|
1070 |
combinators any longer. |
|
1071 |
||
41594 | 1072 |
* Code generator: simplification with rules determined with |
41571 | 1073 |
src/Tools/Code/code_simp.ML and method "code_simp". |
1074 |
||
41594 | 1075 |
* Code generator for records: more idiomatic representation of record |
40948 | 1076 |
types. Warning: records are not covered by ancient SML code |
1077 |
generation any longer. INCOMPATIBILITY. In cases of need, a suitable |
|
1078 |
rep_datatype declaration helps to succeed then: |
|
38537 | 1079 |
|
1080 |
record 'a foo = ... |
|
1081 |
... |
|
1082 |
rep_datatype foo_ext ... |
|
38535 | 1083 |
|
41594 | 1084 |
* Records: logical foundation type for records does not carry a |
1085 |
'_type' suffix any longer (obsolete due to authentic syntax). |
|
1086 |
INCOMPATIBILITY. |
|
1087 |
||
41398 | 1088 |
* Quickcheck now by default uses exhaustive testing instead of random |
41571 | 1089 |
testing. Random testing can be invoked by "quickcheck [random]", |
1090 |
exhaustive testing by "quickcheck [exhaustive]". |
|
41398 | 1091 |
|
1092 |
* Quickcheck instantiates polymorphic types with small finite |
|
1093 |
datatypes by default. This enables a simple execution mechanism to |
|
1094 |
handle quantifiers and function equality over the finite datatypes. |
|
1095 |
||
41571 | 1096 |
* Quickcheck random generator has been renamed from "code" to |
1097 |
"random". INCOMPATIBILITY. |
|
41398 | 1098 |
|
1099 |
* Quickcheck now has a configurable time limit which is set to 30 |
|
1100 |
seconds by default. This can be changed by adding [timeout = n] to the |
|
1101 |
quickcheck command. The time limit for Auto Quickcheck is still set |
|
1102 |
independently. |
|
38461 | 1103 |
|
1104 |
* Quickcheck in locales considers interpretations of that locale for |
|
1105 |
counter example search. |
|
1106 |
||
40059
6ad9081665db
use consistent terminology in Sledgehammer: "prover = ATP or SMT solver or ..."
blanchet
parents:
39993
diff
changeset
|
1107 |
* Sledgehammer: |
41571 | 1108 |
- Added "smt" and "remote_smt" provers based on the "smt" proof |
1109 |
method. See the Sledgehammer manual for details ("isabelle doc |
|
1110 |
sledgehammer"). |
|
40059
6ad9081665db
use consistent terminology in Sledgehammer: "prover = ATP or SMT solver or ..."
blanchet
parents:
39993
diff
changeset
|
1111 |
- Renamed commands: |
6ad9081665db
use consistent terminology in Sledgehammer: "prover = ATP or SMT solver or ..."
blanchet
parents:
39993
diff
changeset
|
1112 |
sledgehammer atp_info ~> sledgehammer running_provers |
6ad9081665db
use consistent terminology in Sledgehammer: "prover = ATP or SMT solver or ..."
blanchet
parents:
39993
diff
changeset
|
1113 |
sledgehammer atp_kill ~> sledgehammer kill_provers |
6ad9081665db
use consistent terminology in Sledgehammer: "prover = ATP or SMT solver or ..."
blanchet
parents:
39993
diff
changeset
|
1114 |
sledgehammer available_atps ~> sledgehammer available_provers |
6ad9081665db
use consistent terminology in Sledgehammer: "prover = ATP or SMT solver or ..."
blanchet
parents:
39993
diff
changeset
|
1115 |
INCOMPATIBILITY. |
6ad9081665db
use consistent terminology in Sledgehammer: "prover = ATP or SMT solver or ..."
blanchet
parents:
39993
diff
changeset
|
1116 |
- Renamed options: |
6ad9081665db
use consistent terminology in Sledgehammer: "prover = ATP or SMT solver or ..."
blanchet
parents:
39993
diff
changeset
|
1117 |
sledgehammer [atps = ...] ~> sledgehammer [provers = ...] |
40062 | 1118 |
sledgehammer [atp = ...] ~> sledgehammer [prover = ...] |
40341
03156257040f
standardize on seconds for Nitpick and Sledgehammer timeouts
blanchet
parents:
40318
diff
changeset
|
1119 |
sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77] |
03156257040f
standardize on seconds for Nitpick and Sledgehammer timeouts
blanchet
parents:
40318
diff
changeset
|
1120 |
(and "ms" and "min" are no longer supported) |
03156257040f
standardize on seconds for Nitpick and Sledgehammer timeouts
blanchet
parents:
40318
diff
changeset
|
1121 |
INCOMPATIBILITY. |
03156257040f
standardize on seconds for Nitpick and Sledgehammer timeouts
blanchet
parents:
40318
diff
changeset
|
1122 |
|
03156257040f
standardize on seconds for Nitpick and Sledgehammer timeouts
blanchet
parents:
40318
diff
changeset
|
1123 |
* Nitpick: |
03156257040f
standardize on seconds for Nitpick and Sledgehammer timeouts
blanchet
parents:
40318
diff
changeset
|
1124 |
- Renamed options: |
03156257040f
standardize on seconds for Nitpick and Sledgehammer timeouts
blanchet
parents:
40318
diff
changeset
|
1125 |
nitpick [timeout = 77 s] ~> nitpick [timeout = 77] |
03156257040f
standardize on seconds for Nitpick and Sledgehammer timeouts
blanchet
parents:
40318
diff
changeset
|
1126 |
nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777] |
40059
6ad9081665db
use consistent terminology in Sledgehammer: "prover = ATP or SMT solver or ..."
blanchet
parents:
39993
diff
changeset
|
1127 |
INCOMPATIBILITY. |
40725 | 1128 |
- Added support for partial quotient types. |
1129 |
- Added local versions of the "Nitpick.register_xxx" functions. |
|
1130 |
- Added "whack" option. |
|
1131 |
- Allow registration of quotient types as codatatypes. |
|
1132 |
- Improved "merge_type_vars" option to merge more types. |
|
1133 |
- Removed unsound "fast_descrs" option. |
|
1134 |
- Added custom symmetry breaking for datatypes, making it possible to reach |
|
1135 |
higher cardinalities. |
|
1136 |
- Prevent the expansion of too large definitions. |
|
39957
2f2d90cc31a2
document latest changes to Meson/Metis/Sledgehammer
blanchet
parents:
39910
diff
changeset
|
1137 |
|
41571 | 1138 |
* Proof methods "metis" and "meson" now have configuration options |
1139 |
"meson_trace", "metis_trace", and "metis_verbose" that can be enabled |
|
1140 |
to diagnose these tools. E.g. |
|
1141 |
||
1142 |
using [[metis_trace = true]] |
|
1143 |
||
41398 | 1144 |
* Auto Solve: Renamed "Auto Solve Direct". The tool is now available |
1145 |
manually as command 'solve_direct'. |
|
1146 |
||
41601 | 1147 |
* The default SMT solver Z3 must be enabled explicitly (due to |
1148 |
licensing issues) by setting the environment variable |
|
41603 | 1149 |
Z3_NON_COMMERCIAL in etc/settings of the component, for example. For |
1150 |
commercial applications, the SMT solver CVC3 is provided as fall-back; |
|
1151 |
changing the SMT solver is done via the configuration option |
|
1152 |
"smt_solver". |
|
41432
3214c39777ab
differentiate between local and remote SMT solvers (e.g., "z3" vs. "remote_z3");
boehmes
parents:
41430
diff
changeset
|
1153 |
|
3214c39777ab
differentiate between local and remote SMT solvers (e.g., "z3" vs. "remote_z3");
boehmes
parents:
41430
diff
changeset
|
1154 |
* Remote SMT solvers need to be referred to by the "remote_" prefix, |
41571 | 1155 |
i.e. "remote_cvc3" and "remote_z3". |
1156 |
||
1157 |
* Added basic SMT support for datatypes, records, and typedefs using |
|
1158 |
the oracle mode (no proofs). Direct support of pairs has been dropped |
|
1159 |
in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT |
|
1160 |
support for a similar behavior). Minor INCOMPATIBILITY. |
|
41432
3214c39777ab
differentiate between local and remote SMT solvers (e.g., "z3" vs. "remote_z3");
boehmes
parents:
41430
diff
changeset
|
1161 |
|
40162
7f58a9a843c2
joined setup of SMT solvers in one place; turned Z3-specific options into SMT options (renamed configuration options from z3_* to smt_*); more detailed SMT exception; improved SMT filter interface
boehmes
parents:
40128
diff
changeset
|
1162 |
* Changed SMT configuration options: |
7f58a9a843c2
joined setup of SMT solvers in one place; turned Z3-specific options into SMT options (renamed configuration options from z3_* to smt_*); more detailed SMT exception; improved SMT filter interface
boehmes
parents:
40128
diff
changeset
|
1163 |
- Renamed: |
41432
3214c39777ab
differentiate between local and remote SMT solvers (e.g., "z3" vs. "remote_z3");
boehmes
parents:
41430
diff
changeset
|
1164 |
z3_proofs ~> smt_oracle (with inverted meaning) |
40162
7f58a9a843c2
joined setup of SMT solvers in one place; turned Z3-specific options into SMT options (renamed configuration options from z3_* to smt_*); more detailed SMT exception; improved SMT filter interface
boehmes
parents:
40128
diff
changeset
|
1165 |
z3_trace_assms ~> smt_trace_used_facts |
7f58a9a843c2
joined setup of SMT solvers in one place; turned Z3-specific options into SMT options (renamed configuration options from z3_* to smt_*); more detailed SMT exception; improved SMT filter interface
boehmes
parents:
40128
diff
changeset
|
1166 |
INCOMPATIBILITY. |
7f58a9a843c2
joined setup of SMT solvers in one place; turned Z3-specific options into SMT options (renamed configuration options from z3_* to smt_*); more detailed SMT exception; improved SMT filter interface
boehmes
parents:
40128
diff
changeset
|
1167 |
- Added: |
40424
7550b2cba1cb
better modularization: moved SMT configuration options and diagnostics as well as SMT failure and exception into separate structures (both of which are loaded first and consequently are available to other SMT structures)
boehmes
parents:
40388
diff
changeset
|
1168 |
smt_verbose |
41432
3214c39777ab
differentiate between local and remote SMT solvers (e.g., "z3" vs. "remote_z3");
boehmes
parents:
41430
diff
changeset
|
1169 |
smt_random_seed |
40424
7550b2cba1cb
better modularization: moved SMT configuration options and diagnostics as well as SMT failure and exception into separate structures (both of which are loaded first and consequently are available to other SMT structures)
boehmes
parents:
40388
diff
changeset
|
1170 |
smt_datatypes |
41432
3214c39777ab
differentiate between local and remote SMT solvers (e.g., "z3" vs. "remote_z3");
boehmes
parents:
41430
diff
changeset
|
1171 |
smt_infer_triggers |
3214c39777ab
differentiate between local and remote SMT solvers (e.g., "z3" vs. "remote_z3");
boehmes
parents:
41430
diff
changeset
|
1172 |
smt_monomorph_limit |
40162
7f58a9a843c2
joined setup of SMT solvers in one place; turned Z3-specific options into SMT options (renamed configuration options from z3_* to smt_*); more detailed SMT exception; improved SMT filter interface
boehmes
parents:
40128
diff
changeset
|
1173 |
cvc3_options |
41432
3214c39777ab
differentiate between local and remote SMT solvers (e.g., "z3" vs. "remote_z3");
boehmes
parents:
41430
diff
changeset
|
1174 |
remote_cvc3_options |
3214c39777ab
differentiate between local and remote SMT solvers (e.g., "z3" vs. "remote_z3");
boehmes
parents:
41430
diff
changeset
|
1175 |
remote_z3_options |
40162
7f58a9a843c2
joined setup of SMT solvers in one place; turned Z3-specific options into SMT options (renamed configuration options from z3_* to smt_*); more detailed SMT exception; improved SMT filter interface
boehmes
parents:
40128
diff
changeset
|
1176 |
yices_options |
39957
2f2d90cc31a2
document latest changes to Meson/Metis/Sledgehammer
blanchet
parents:
39910
diff
changeset
|
1177 |
|
40948 | 1178 |
* Boogie output files (.b2i files) need to be declared in the theory |
1179 |
header. |
|
40580
0592d3a39c08
require the b2i file ending in the boogie_open command (for consistency with the theory header)
boehmes
parents:
40424
diff
changeset
|
1180 |
|
41594 | 1181 |
* Simplification procedure "list_to_set_comprehension" rewrites list |
1182 |
comprehensions applied to List.set to set comprehensions. Occasional |
|
1183 |
INCOMPATIBILITY, may be deactivated like this: |
|
1184 |
||
1185 |
declare [[simproc del: list_to_set_comprehension]] |
|
1186 |
||
41573 | 1187 |
* Removed old version of primrec package. INCOMPATIBILITY. |
41398 | 1188 |
|
1189 |
* Removed simplifier congruence rule of "prod_case", as has for long |
|
1190 |
been the case with "split". INCOMPATIBILITY. |
|
1191 |
||
1192 |
* String.literal is a type, but not a datatype. INCOMPATIBILITY. |
|
1193 |
||
40388
cb9fd7dd641c
abolished obscure goal variant of [split_format] -- unused (cf. d1c14898fd04), unrelated to '(complete)' variant, and not at all canonical
krauss
parents:
40387
diff
changeset
|
1194 |
* Removed [split_format ... and ... and ...] version of |
cb9fd7dd641c
abolished obscure goal variant of [split_format] -- unused (cf. d1c14898fd04), unrelated to '(complete)' variant, and not at all canonical
krauss
parents:
40387
diff
changeset
|
1195 |
[split_format]. Potential INCOMPATIBILITY. |
cb9fd7dd641c
abolished obscure goal variant of [split_format] -- unused (cf. d1c14898fd04), unrelated to '(complete)' variant, and not at all canonical
krauss
parents:
40387
diff
changeset
|
1196 |
|
41571 | 1197 |
* Predicate "sorted" now defined inductively, with nice induction |
1198 |
rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps. |
|
41398 | 1199 |
|
1200 |
* Constant "contents" renamed to "the_elem", to free the generic name |
|
1201 |
contents for other uses. INCOMPATIBILITY. |
|
1202 |
||
1203 |
* Renamed class eq and constant eq (for code generation) to class |
|
1204 |
equal and constant equal, plus renaming of related facts and various |
|
1205 |
tuning. INCOMPATIBILITY. |
|
1206 |
||
1207 |
* Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY. |
|
1208 |
||
41571 | 1209 |
* Removed output syntax "'a ~=> 'b" for "'a => 'b option". |
1210 |
INCOMPATIBILITY. |
|
41398 | 1211 |
|
1212 |
* Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to |
|
1213 |
avoid confusion with finite sets. INCOMPATIBILITY. |
|
1214 |
||
1215 |
* Abandoned locales equiv, congruent and congruent2 for equivalence |
|
1216 |
relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same |
|
1217 |
for congruent(2)). |
|
1218 |
||
1219 |
* Some previously unqualified names have been qualified: |
|
1220 |
||
1221 |
types |
|
1222 |
bool ~> HOL.bool |
|
1223 |
nat ~> Nat.nat |
|
1224 |
||
1225 |
constants |
|
1226 |
Trueprop ~> HOL.Trueprop |
|
1227 |
True ~> HOL.True |
|
1228 |
False ~> HOL.False |
|
1229 |
op & ~> HOL.conj |
|
1230 |
op | ~> HOL.disj |
|
1231 |
op --> ~> HOL.implies |
|
1232 |
op = ~> HOL.eq |
|
1233 |
Not ~> HOL.Not |
|
1234 |
The ~> HOL.The |
|
1235 |
All ~> HOL.All |
|
1236 |
Ex ~> HOL.Ex |
|
1237 |
Ex1 ~> HOL.Ex1 |
|
1238 |
Let ~> HOL.Let |
|
1239 |
If ~> HOL.If |
|
1240 |
Ball ~> Set.Ball |
|
1241 |
Bex ~> Set.Bex |
|
1242 |
Suc ~> Nat.Suc |
|
1243 |
Pair ~> Product_Type.Pair |
|
1244 |
fst ~> Product_Type.fst |
|
1245 |
snd ~> Product_Type.snd |
|
1246 |
curry ~> Product_Type.curry |
|
1247 |
op : ~> Set.member |
|
1248 |
Collect ~> Set.Collect |
|
1249 |
||
1250 |
INCOMPATIBILITY. |
|
1251 |
||
1252 |
* More canonical naming convention for some fundamental definitions: |
|
1253 |
||
1254 |
bot_bool_eq ~> bot_bool_def |
|
1255 |
top_bool_eq ~> top_bool_def |
|
1256 |
inf_bool_eq ~> inf_bool_def |
|
1257 |
sup_bool_eq ~> sup_bool_def |
|
1258 |
bot_fun_eq ~> bot_fun_def |
|
1259 |
top_fun_eq ~> top_fun_def |
|
1260 |
inf_fun_eq ~> inf_fun_def |
|
1261 |
sup_fun_eq ~> sup_fun_def |
|
1262 |
||
1263 |
INCOMPATIBILITY. |
|
1264 |
||
1265 |
* More stylized fact names: |
|
1266 |
||
1267 |
expand_fun_eq ~> fun_eq_iff |
|
1268 |
expand_set_eq ~> set_eq_iff |
|
1269 |
set_ext ~> set_eqI |
|
1270 |
nat_number ~> eval_nat_numeral |
|
1271 |
||
1272 |
INCOMPATIBILITY. |
|
1273 |
||
41571 | 1274 |
* Refactoring of code-generation specific operations in theory List: |
41398 | 1275 |
|
1276 |
constants |
|
1277 |
null ~> List.null |
|
1278 |
||
1279 |
facts |
|
1280 |
mem_iff ~> member_def |
|
1281 |
null_empty ~> null_def |
|
1282 |
||
1283 |
INCOMPATIBILITY. Note that these were not supposed to be used |
|
1284 |
regularly unless for striking reasons; their main purpose was code |
|
1285 |
generation. |
|
1286 |
||
1287 |
Various operations from the Haskell prelude are used for generating |
|
1288 |
Haskell code. |
|
1289 |
||
41571 | 1290 |
* Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term |
1291 |
"surj f" is now an abbreviation of "range f = UNIV". The theorems |
|
1292 |
bij_def and surj_def are unchanged. INCOMPATIBILITY. |
|
41398 | 1293 |
|
1294 |
* Abolished some non-alphabetic type names: "prod" and "sum" replace |
|
1295 |
"*" and "+" respectively. INCOMPATIBILITY. |
|
1296 |
||
1297 |
* Name "Plus" of disjoint sum operator "<+>" is now hidden. Write |
|
41571 | 1298 |
"Sum_Type.Plus" instead. |
41398 | 1299 |
|
1300 |
* Constant "split" has been merged with constant "prod_case"; names of |
|
1301 |
ML functions, facts etc. involving split have been retained so far, |
|
1302 |
though. INCOMPATIBILITY. |
|
1303 |
||
1304 |
* Dropped old infix syntax "_ mem _" for List.member; use "_ : set _" |
|
1305 |
instead. INCOMPATIBILITY. |
|
1306 |
||
41571 | 1307 |
* Removed lemma "Option.is_none_none" which duplicates "is_none_def". |
41398 | 1308 |
INCOMPATIBILITY. |
1309 |
||
41594 | 1310 |
* Former theory Library/Enum is now part of the HOL-Main image. |
1311 |
INCOMPATIBILITY: all constants of the Enum theory now have to be |
|
1312 |
referred to by its qualified name. |
|
1313 |
||
1314 |
enum ~> Enum.enum |
|
1315 |
nlists ~> Enum.nlists |
|
1316 |
product ~> Enum.product |
|
1317 |
||
1318 |
* Theory Library/Monad_Syntax provides do-syntax for monad types. |
|
1319 |
Syntax in Library/State_Monad has been changed to avoid ambiguities. |
|
1320 |
INCOMPATIBILITY. |
|
1321 |
||
1322 |
* Theory Library/SetsAndFunctions has been split into |
|
1323 |
Library/Function_Algebras and Library/Set_Algebras; canonical names |
|
1324 |
for instance definitions for functions; various improvements. |
|
1325 |
INCOMPATIBILITY. |
|
1326 |
||
1327 |
* Theory Library/Multiset provides stable quicksort implementation of |
|
1328 |
sort_key. |
|
1329 |
||
1330 |
* Theory Library/Multiset: renamed empty_idemp ~> empty_neutral. |
|
1331 |
INCOMPATIBILITY. |
|
1332 |
||
1333 |
* Session Multivariate_Analysis: introduced a type class for euclidean |
|
1334 |
space. Most theorems are now stated in terms of euclidean spaces |
|
1335 |
instead of finite cartesian products. |
|
1336 |
||
1337 |
types |
|
1338 |
real ^ 'n ~> 'a::real_vector |
|
1339 |
~> 'a::euclidean_space |
|
1340 |
~> 'a::ordered_euclidean_space |
|
1341 |
(depends on your needs) |
|
1342 |
||
1343 |
constants |
|
1344 |
_ $ _ ~> _ $$ _ |
|
1345 |
\<chi> x. _ ~> \<chi>\<chi> x. _ |
|
1346 |
CARD('n) ~> DIM('a) |
|
1347 |
||
1348 |
Also note that the indices are now natural numbers and not from some |
|
1349 |
finite type. Finite cartesian products of euclidean spaces, products |
|
1350 |
of euclidean spaces the real and complex numbers are instantiated to |
|
1351 |
be euclidean_spaces. INCOMPATIBILITY. |
|
1352 |
||
1353 |
* Session Probability: introduced pextreal as positive extended real |
|
1354 |
numbers. Use pextreal as value for measures. Introduce the |
|
1355 |
Radon-Nikodym derivative, product spaces and Fubini's theorem for |
|
1356 |
arbitrary sigma finite measures. Introduces Lebesgue measure based on |
|
1357 |
the integral in Multivariate Analysis. INCOMPATIBILITY. |
|
1358 |
||
1359 |
* Session Imperative_HOL: revamped, corrected dozens of inadequacies. |
|
1360 |
INCOMPATIBILITY. |
|
1361 |
||
1362 |
* Session SPARK (with image HOL-SPARK) provides commands to load and |
|
1363 |
prove verification conditions generated by the SPARK Ada program |
|
1364 |
verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples. |
|
41567 | 1365 |
|
40621 | 1366 |
|
41433
1b8ff770f02c
Abelian group facts obtained from group facts via interpretation (sublocale).
ballarin
parents:
41432
diff
changeset
|
1367 |
*** HOL-Algebra *** |
1b8ff770f02c
Abelian group facts obtained from group facts via interpretation (sublocale).
ballarin
parents:
41432
diff
changeset
|
1368 |
|
1b8ff770f02c
Abelian group facts obtained from group facts via interpretation (sublocale).
ballarin
parents:
41432
diff
changeset
|
1369 |
* Theorems for additive ring operations (locale abelian_monoid and |
1b8ff770f02c
Abelian group facts obtained from group facts via interpretation (sublocale).
ballarin
parents:
41432
diff
changeset
|
1370 |
descendants) are generated by interpretation from their multiplicative |
41434
710cdb9e0d17
Documentation for 'interpret' and 'sublocale' with mixins.
ballarin
parents:
41433
diff
changeset
|
1371 |
counterparts. Names (in particular theorem names) have the mandatory |
710cdb9e0d17
Documentation for 'interpret' and 'sublocale' with mixins.
ballarin
parents:
41433
diff
changeset
|
1372 |
qualifier 'add'. Previous theorem names are redeclared for |
710cdb9e0d17
Documentation for 'interpret' and 'sublocale' with mixins.
ballarin
parents:
41433
diff
changeset
|
1373 |
compatibility. |
710cdb9e0d17
Documentation for 'interpret' and 'sublocale' with mixins.
ballarin
parents:
41433
diff
changeset
|
1374 |
|
41571 | 1375 |
* Structure "int_ring" is now an abbreviation (previously a |
41434
710cdb9e0d17
Documentation for 'interpret' and 'sublocale' with mixins.
ballarin
parents:
41433
diff
changeset
|
1376 |
definition). This fits more natural with advanced interpretations. |
41433
1b8ff770f02c
Abelian group facts obtained from group facts via interpretation (sublocale).
ballarin
parents:
41432
diff
changeset
|
1377 |
|
1b8ff770f02c
Abelian group facts obtained from group facts via interpretation (sublocale).
ballarin
parents:
41432
diff
changeset
|
1378 |
|
40621 | 1379 |
*** HOLCF *** |
1380 |
||
1381 |
* The domain package now runs in definitional mode by default: The |
|
41571 | 1382 |
former command 'new_domain' is now called 'domain'. To use the domain |
40621 | 1383 |
package in its original axiomatic mode, use 'domain (unsafe)'. |
1384 |
INCOMPATIBILITY. |
|
1385 |
||
41571 | 1386 |
* The new class "domain" is now the default sort. Class "predomain" |
1387 |
is an unpointed version of "domain". Theories can be updated by |
|
1388 |
replacing sort annotations as shown below. INCOMPATIBILITY. |
|
40621 | 1389 |
|
1390 |
'a::type ~> 'a::countable |
|
1391 |
'a::cpo ~> 'a::predomain |
|
1392 |
'a::pcpo ~> 'a::domain |
|
1393 |
||
41571 | 1394 |
* The old type class "rep" has been superseded by class "domain". |
40621 | 1395 |
Accordingly, users of the definitional package must remove any |
41571 | 1396 |
"default_sort rep" declarations. INCOMPATIBILITY. |
40621 | 1397 |
|
41401 | 1398 |
* The domain package (definitional mode) now supports unpointed |
1399 |
predomain argument types, as long as they are marked 'lazy'. (Strict |
|
41571 | 1400 |
arguments must be in class "domain".) For example, the following |
41401 | 1401 |
domain definition now works: |
1402 |
||
1403 |
domain natlist = nil | cons (lazy "nat discr") (lazy "natlist") |
|
1404 |
||
1405 |
* Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class |
|
41571 | 1406 |
instances for types from main HOL: bool, nat, int, char, 'a + 'b, |
1407 |
'a option, and 'a list. Additionally, it configures fixrec and the |
|
1408 |
domain package to work with these types. For example: |
|
41401 | 1409 |
|
1410 |
fixrec isInl :: "('a + 'b) u -> tr" |
|
1411 |
where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF" |
|
1412 |
||
1413 |
domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list") |
|
1414 |
||
41571 | 1415 |
* The "(permissive)" option of fixrec has been replaced with a |
1416 |
per-equation "(unchecked)" option. See |
|
1417 |
src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY. |
|
1418 |
||
1419 |
* The "bifinite" class no longer fixes a constant "approx"; the class |
|
1420 |
now just asserts that such a function exists. INCOMPATIBILITY. |
|
1421 |
||
1422 |
* Former type "alg_defl" has been renamed to "defl". HOLCF no longer |
|
41287
029a6fc1bfb8
type 'defl' takes a type parameter again (cf. b525988432e9)
huffman
parents:
41286
diff
changeset
|
1423 |
defines an embedding of type 'a defl into udom by default; instances |
41571 | 1424 |
of "bifinite" and "domain" classes are available in |
1425 |
src/HOL/HOLCF/Library/Defl_Bifinite.thy. |
|
1426 |
||
1427 |
* The syntax "REP('a)" has been replaced with "DEFL('a)". |
|
1428 |
||
1429 |
* The predicate "directed" has been removed. INCOMPATIBILITY. |
|
1430 |
||
1431 |
* The type class "finite_po" has been removed. INCOMPATIBILITY. |
|
1432 |
||
1433 |
* The function "cprod_map" has been renamed to "prod_map". |
|
41401 | 1434 |
INCOMPATIBILITY. |
1435 |
||
1436 |
* The monadic bind operator on each powerdomain has new binder syntax |
|
41571 | 1437 |
similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents |
1438 |
"upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)". |
|
41401 | 1439 |
|
1440 |
* The infix syntax for binary union on each powerdomain has changed |
|
41571 | 1441 |
from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set |
1442 |
syntax. INCOMPATIBILITY. |
|
1443 |
||
1444 |
* The constant "UU" has been renamed to "bottom". The syntax "UU" is |
|
41429
cf5f025bc3c7
renamed constant 'UU' to 'bottom', keeping 'UU' as alternative input syntax;
huffman
parents:
41414
diff
changeset
|
1445 |
still supported as an input translation. |
cf5f025bc3c7
renamed constant 'UU' to 'bottom', keeping 'UU' as alternative input syntax;
huffman
parents:
41414
diff
changeset
|
1446 |
|
40621 | 1447 |
* Renamed some theorems (the original names are also still available). |
41571 | 1448 |
|
40621 | 1449 |
expand_fun_below ~> fun_below_iff |
1450 |
below_fun_ext ~> fun_belowI |
|
1451 |
expand_cfun_eq ~> cfun_eq_iff |
|
1452 |
ext_cfun ~> cfun_eqI |
|
1453 |
expand_cfun_below ~> cfun_below_iff |
|
1454 |
below_cfun_ext ~> cfun_belowI |
|
1455 |
cont2cont_Rep_CFun ~> cont2cont_APP |
|
1456 |
||
1457 |
* The Abs and Rep functions for various types have changed names. |
|
40948 | 1458 |
Related theorem names have also changed to match. INCOMPATIBILITY. |
41571 | 1459 |
|
40621 | 1460 |
Rep_CFun ~> Rep_cfun |
1461 |
Abs_CFun ~> Abs_cfun |
|
1462 |
Rep_Sprod ~> Rep_sprod |
|
1463 |
Abs_Sprod ~> Abs_sprod |
|
1464 |
Rep_Ssum ~> Rep_ssum |
|
1465 |
Abs_Ssum ~> Abs_ssum |
|
1466 |
||
1467 |
* Lemmas with names of the form *_defined_iff or *_strict_iff have |
|
41571 | 1468 |
been renamed to *_bottom_iff. INCOMPATIBILITY. |
40621 | 1469 |
|
1470 |
* Various changes to bisimulation/coinduction with domain package: |
|
41571 | 1471 |
|
1472 |
- Definitions of "bisim" constants no longer mention definedness. |
|
1473 |
- With mutual recursion, "bisim" predicate is now curried. |
|
40621 | 1474 |
- With mutual recursion, each type gets a separate coind theorem. |
1475 |
- Variable names in bisim_def and coinduct rules have changed. |
|
41571 | 1476 |
|
40621 | 1477 |
INCOMPATIBILITY. |
1478 |
||
41571 | 1479 |
* Case combinators generated by the domain package for type "foo" are |
1480 |
now named "foo_case" instead of "foo_when". INCOMPATIBILITY. |
|
40621 | 1481 |
|
40771 | 1482 |
* Several theorems have been renamed to more accurately reflect the |
41571 | 1483 |
names of constants and types involved. INCOMPATIBILITY. |
1484 |
||
40771 | 1485 |
thelub_const ~> lub_const |
1486 |
lub_const ~> is_lub_const |
|
1487 |
thelubI ~> lub_eqI |
|
1488 |
is_lub_lub ~> is_lubD2 |
|
1489 |
lubI ~> is_lub_lub |
|
1490 |
unique_lub ~> is_lub_unique |
|
1491 |
is_ub_lub ~> is_lub_rangeD1 |
|
1492 |
lub_bin_chain ~> is_lub_bin_chain |
|
41030
ff7d177128ef
rename lub_fun -> is_lub_fun, thelub_fun -> lub_fun
huffman
parents:
40965
diff
changeset
|
1493 |
lub_fun ~> is_lub_fun |
ff7d177128ef
rename lub_fun -> is_lub_fun, thelub_fun -> lub_fun
huffman
parents:
40965
diff
changeset
|
1494 |
thelub_fun ~> lub_fun |
41031 | 1495 |
thelub_cfun ~> lub_cfun |
40771 | 1496 |
thelub_Pair ~> lub_Pair |
1497 |
lub_cprod ~> is_lub_prod |
|
1498 |
thelub_cprod ~> lub_prod |
|
1499 |
minimal_cprod ~> minimal_prod |
|
1500 |
inst_cprod_pcpo ~> inst_prod_pcpo |
|
41430
1aa23e9f2c87
change some lemma names containing 'UU' to 'bottom'
huffman
parents:
41429
diff
changeset
|
1501 |
UU_I ~> bottomI |
1aa23e9f2c87
change some lemma names containing 'UU' to 'bottom'
huffman
parents:
41429
diff
changeset
|
1502 |
compact_UU ~> compact_bottom |
1aa23e9f2c87
change some lemma names containing 'UU' to 'bottom'
huffman
parents:
41429
diff
changeset
|
1503 |
deflation_UU ~> deflation_bottom |
1aa23e9f2c87
change some lemma names containing 'UU' to 'bottom'
huffman
parents:
41429
diff
changeset
|
1504 |
finite_deflation_UU ~> finite_deflation_bottom |
40771 | 1505 |
|
41571 | 1506 |
* Many legacy theorem names have been discontinued. INCOMPATIBILITY. |
1507 |
||
40621 | 1508 |
sq_ord_less_eq_trans ~> below_eq_trans |
1509 |
sq_ord_eq_less_trans ~> eq_below_trans |
|
1510 |
refl_less ~> below_refl |
|
1511 |
trans_less ~> below_trans |
|
1512 |
antisym_less ~> below_antisym |
|
1513 |
antisym_less_inverse ~> po_eq_conv [THEN iffD1] |
|
1514 |
box_less ~> box_below |
|
1515 |
rev_trans_less ~> rev_below_trans |
|
1516 |
not_less2not_eq ~> not_below2not_eq |
|
1517 |
less_UU_iff ~> below_UU_iff |
|
1518 |
flat_less_iff ~> flat_below_iff |
|
1519 |
adm_less ~> adm_below |
|
1520 |
adm_not_less ~> adm_not_below |
|
1521 |
adm_compact_not_less ~> adm_compact_not_below |
|
1522 |
less_fun_def ~> below_fun_def |
|
1523 |
expand_fun_less ~> fun_below_iff |
|
1524 |
less_fun_ext ~> fun_belowI |
|
1525 |
less_discr_def ~> below_discr_def |
|
1526 |
discr_less_eq ~> discr_below_eq |
|
1527 |
less_unit_def ~> below_unit_def |
|
1528 |
less_cprod_def ~> below_prod_def |
|
1529 |
prod_lessI ~> prod_belowI |
|
1530 |
Pair_less_iff ~> Pair_below_iff |
|
1531 |
fst_less_iff ~> fst_below_iff |
|
1532 |
snd_less_iff ~> snd_below_iff |
|
1533 |
expand_cfun_less ~> cfun_below_iff |
|
1534 |
less_cfun_ext ~> cfun_belowI |
|
1535 |
injection_less ~> injection_below |
|
1536 |
less_up_def ~> below_up_def |
|
1537 |
not_Iup_less ~> not_Iup_below |
|
1538 |
Iup_less ~> Iup_below |
|
1539 |
up_less ~> up_below |
|
1540 |
Def_inject_less_eq ~> Def_below_Def |
|
1541 |
Def_less_is_eq ~> Def_below_iff |
|
1542 |
spair_less_iff ~> spair_below_iff |
|
1543 |
less_sprod ~> below_sprod |
|
1544 |
spair_less ~> spair_below |
|
1545 |
sfst_less_iff ~> sfst_below_iff |
|
1546 |
ssnd_less_iff ~> ssnd_below_iff |
|
1547 |
fix_least_less ~> fix_least_below |
|
1548 |
dist_less_one ~> dist_below_one |
|
1549 |
less_ONE ~> below_ONE |
|
1550 |
ONE_less_iff ~> ONE_below_iff |
|
1551 |
less_sinlD ~> below_sinlD |
|
1552 |
less_sinrD ~> below_sinrD |
|
1553 |
||
1554 |
||
40948 | 1555 |
*** FOL and ZF *** |
38522 | 1556 |
|
41310 | 1557 |
* All constant names are now qualified internally and use proper |
1558 |
identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY. |
|
1559 |
||
38522 | 1560 |
|
37868
59eed00bfd8e
ML antiquotations @{theory} and @{theory_ref} refer to the theory ancestry, not any accidental theory loader state;
wenzelm
parents:
37820
diff
changeset
|
1561 |
*** ML *** |
59eed00bfd8e
ML antiquotations @{theory} and @{theory_ref} refer to the theory ancestry, not any accidental theory loader state;
wenzelm
parents:
37820
diff
changeset
|
1562 |
|
41594 | 1563 |
* Antiquotation @{assert} inlines a function bool -> unit that raises |
1564 |
Fail if the argument is false. Due to inlining the source position of |
|
1565 |
failed assertions is included in the error output. |
|
1566 |
||
1567 |
* Discontinued antiquotation @{theory_ref}, which is obsolete since ML |
|
1568 |
text is in practice always evaluated with a stable theory checkpoint. |
|
1569 |
Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead. |
|
1570 |
||
1571 |
* Antiquotation @{theory A} refers to theory A from the ancestry of |
|
1572 |
the current context, not any accidental theory loader state as before. |
|
1573 |
Potential INCOMPATIBILITY, subtle change in semantics. |
|
41228
e1fce873b814
renamed structure MetaSimplifier to raw_Simplifer, to emphasize its meaning;
wenzelm
parents:
41079
diff
changeset
|
1574 |
|
40956 | 1575 |
* Syntax.pretty_priority (default 0) configures the required priority |
1576 |
of pretty-printed output and thus affects insertion of parentheses. |
|
1577 |
||
40959 | 1578 |
* Syntax.default_root (default "any") configures the inner syntax |
1579 |
category (nonterminal symbol) for parsing of terms. |
|
1580 |
||
40722
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40712
diff
changeset
|
1581 |
* Former exception Library.UnequalLengths now coincides with |
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40712
diff
changeset
|
1582 |
ListPair.UnequalLengths. |
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40712
diff
changeset
|
1583 |
|
41594 | 1584 |
* Renamed structure MetaSimplifier to Raw_Simplifier. Note that the |
1585 |
main functionality is provided by structure Simplifier. |
|
1586 |
||
40627
becf5d5187cc
renamed raw "explode" function to "raw_explode" to emphasize its meaning;
wenzelm
parents:
40624
diff
changeset
|
1587 |
* Renamed raw "explode" function to "raw_explode" to emphasize its |
becf5d5187cc
renamed raw "explode" function to "raw_explode" to emphasize its meaning;
wenzelm
parents:
40624
diff
changeset
|
1588 |
meaning. Note that internally to Isabelle, Symbol.explode is used in |
becf5d5187cc
renamed raw "explode" function to "raw_explode" to emphasize its meaning;
wenzelm
parents:
40624
diff
changeset
|
1589 |
almost all situations. |
becf5d5187cc
renamed raw "explode" function to "raw_explode" to emphasize its meaning;
wenzelm
parents:
40624
diff
changeset
|
1590 |
|
40318
035b2afbeb2e
discontinued obsolete function sys_error and exception SYS_ERROR;
wenzelm
parents:
40295
diff
changeset
|
1591 |
* Discontinued obsolete function sys_error and exception SYS_ERROR. |
035b2afbeb2e
discontinued obsolete function sys_error and exception SYS_ERROR;
wenzelm
parents:
40295
diff
changeset
|
1592 |
See implementation manual for further details on exceptions in |
035b2afbeb2e
discontinued obsolete function sys_error and exception SYS_ERROR;
wenzelm
parents:
40295
diff
changeset
|
1593 |
Isabelle/ML. |
035b2afbeb2e
discontinued obsolete function sys_error and exception SYS_ERROR;
wenzelm
parents:
40295
diff
changeset
|
1594 |
|
39616
8052101883c3
renamed setmp_noncritical to Unsynchronized.setmp to emphasize its meaning;
wenzelm
parents:
39557
diff
changeset
|
1595 |
* Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its |
8052101883c3
renamed setmp_noncritical to Unsynchronized.setmp to emphasize its meaning;
wenzelm
parents:
39557
diff
changeset
|
1596 |
meaning. |
8052101883c3
renamed setmp_noncritical to Unsynchronized.setmp to emphasize its meaning;
wenzelm
parents:
39557
diff
changeset
|
1597 |
|
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39513
diff
changeset
|
1598 |
* Renamed structure PureThy to Pure_Thy and moved most of its |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39513
diff
changeset
|
1599 |
operations to structure Global_Theory, to emphasize that this is |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39513
diff
changeset
|
1600 |
rarely-used global-only stuff. |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39513
diff
changeset
|
1601 |
|
39513
fce2202892c4
discontinued Output.debug, which belongs to early PGIP experiments (b6788dbd2ef9) and causes just too many problems (like spamming the message channel if it is used by more than one module);
wenzelm
parents:
39308
diff
changeset
|
1602 |
* Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln |
fce2202892c4
discontinued Output.debug, which belongs to early PGIP experiments (b6788dbd2ef9) and causes just too many problems (like spamming the message channel if it is used by more than one module);
wenzelm
parents:
39308
diff
changeset
|
1603 |
instead (or tracing for high-volume output). |
fce2202892c4
discontinued Output.debug, which belongs to early PGIP experiments (b6788dbd2ef9) and causes just too many problems (like spamming the message channel if it is used by more than one module);
wenzelm
parents:
39308
diff
changeset
|
1604 |
|
38980
af73cf0dc31f
turned show_question_marks into proper configuration option;
wenzelm
parents:
38864
diff
changeset
|
1605 |
* Configuration option show_question_marks only affects regular pretty |
af73cf0dc31f
turned show_question_marks into proper configuration option;
wenzelm
parents:
38864
diff
changeset
|
1606 |
printing of types and terms, not raw Term.string_of_vname. |
af73cf0dc31f
turned show_question_marks into proper configuration option;
wenzelm
parents:
38864
diff
changeset
|
1607 |
|
39164
e7e12555e763
ML_Context.thm and ML_Context.thms no longer pervasive;
wenzelm
parents:
39154
diff
changeset
|
1608 |
* ML_Context.thm and ML_Context.thms are no longer pervasive. Rare |
e7e12555e763
ML_Context.thm and ML_Context.thms no longer pervasive;
wenzelm
parents:
39154
diff
changeset
|
1609 |
INCOMPATIBILITY, superseded by static antiquotations @{thm} and |
e7e12555e763
ML_Context.thm and ML_Context.thms no longer pervasive;
wenzelm
parents:
39154
diff
changeset
|
1610 |
@{thms} for most purposes. |
e7e12555e763
ML_Context.thm and ML_Context.thms no longer pervasive;
wenzelm
parents:
39154
diff
changeset
|
1611 |
|
41594 | 1612 |
* ML structure Unsynchronized is never opened, not even in Isar |
38980
af73cf0dc31f
turned show_question_marks into proper configuration option;
wenzelm
parents:
38864
diff
changeset
|
1613 |
interaction mode as before. Old Unsynchronized.set etc. have been |
af73cf0dc31f
turned show_question_marks into proper configuration option;
wenzelm
parents:
38864
diff
changeset
|
1614 |
discontinued -- use plain := instead. This should be *rare* anyway, |
af73cf0dc31f
turned show_question_marks into proper configuration option;
wenzelm
parents:
38864
diff
changeset
|
1615 |
since modern tools always work via official context data, notably |
af73cf0dc31f
turned show_question_marks into proper configuration option;
wenzelm
parents:
38864
diff
changeset
|
1616 |
configuration options. |
af73cf0dc31f
turned show_question_marks into proper configuration option;
wenzelm
parents:
38864
diff
changeset
|
1617 |
|
39239 | 1618 |
* Parallel and asynchronous execution requires special care concerning |
1619 |
interrupts. Structure Exn provides some convenience functions that |
|
1620 |
avoid working directly with raw Interrupt. User code must not absorb |
|
1621 |
interrupts -- intermediate handling (for cleanup etc.) needs to be |
|
1622 |
followed by re-raising of the original exception. Another common |
|
1623 |
source of mistakes are "handle _" patterns, which make the meaning of |
|
1624 |
the program subject to physical effects of the environment. |
|
1625 |
||
37868
59eed00bfd8e
ML antiquotations @{theory} and @{theory_ref} refer to the theory ancestry, not any accidental theory loader state;
wenzelm
parents:
37820
diff
changeset
|
1626 |
|
59eed00bfd8e
ML antiquotations @{theory} and @{theory_ref} refer to the theory ancestry, not any accidental theory loader state;
wenzelm
parents:
37820
diff
changeset
|
1627 |
|
37144 | 1628 |
New in Isabelle2009-2 (June 2010) |
1629 |
--------------------------------- |
|
33993 | 1630 |
|
35260 | 1631 |
*** General *** |
1632 |
||
35436 | 1633 |
* Authentic syntax for *all* logical entities (type classes, type |
1634 |
constructors, term constants): provides simple and robust |
|
1635 |
correspondence between formal entities and concrete syntax. Within |
|
1636 |
the parse tree / AST representations, "constants" are decorated by |
|
1637 |
their category (class, type, const) and spelled out explicitly with |
|
1638 |
their full internal name. |
|
1639 |
||
1640 |
Substantial INCOMPATIBILITY concerning low-level syntax declarations |
|
1641 |
and translations (translation rules and translation functions in ML). |
|
1642 |
Some hints on upgrading: |
|
35260 | 1643 |
|
1644 |
- Many existing uses of 'syntax' and 'translations' can be replaced |
|
35436 | 1645 |
by more modern 'type_notation', 'notation' and 'abbreviation', |
1646 |
which are independent of this issue. |
|
35260 | 1647 |
|
1648 |
- 'translations' require markup within the AST; the term syntax |
|
1649 |
provides the following special forms: |
|
1650 |
||
1651 |
CONST c -- produces syntax version of constant c from context |
|
35261 | 1652 |
XCONST c -- literally c, checked as constant from context |
1653 |
c -- literally c, if declared by 'syntax' |
|
1654 |
||
1655 |
Plain identifiers are treated as AST variables -- occasionally the |
|
1656 |
system indicates accidental variables via the error "rhs contains |
|
1657 |
extra variables". |
|
35260 | 1658 |
|
35436 | 1659 |
Type classes and type constructors are marked according to their |
1660 |
concrete syntax. Some old translations rules need to be written |
|
1661 |
for the "type" category, using type constructor application |
|
1662 |
instead of pseudo-term application of the default category |
|
1663 |
"logic". |
|
1664 |
||
35260 | 1665 |
- 'parse_translation' etc. in ML may use the following |
1666 |
antiquotations: |
|
1667 |
||
35436 | 1668 |
@{class_syntax c} -- type class c within parse tree / AST |
1669 |
@{term_syntax c} -- type constructor c within parse tree / AST |
|
35260 | 1670 |
@{const_syntax c} -- ML version of "CONST c" above |
1671 |
@{syntax_const c} -- literally c (checked wrt. 'syntax' declarations) |
|
1672 |
||
35436 | 1673 |
- Literal types within 'typed_print_translations', i.e. those *not* |
1674 |
represented as pseudo-terms are represented verbatim. Use @{class |
|
1675 |
c} or @{type_name c} here instead of the above syntax |
|
1676 |
antiquotations. |
|
1677 |
||
35260 | 1678 |
Note that old non-authentic syntax was based on unqualified base |
35436 | 1679 |
names, so all of the above "constant" names would coincide. Recall |
1680 |
that 'print_syntax' and ML_command "set Syntax.trace_ast" help to |
|
1681 |
diagnose syntax problems. |
|
35260 | 1682 |
|
35351
7425aece4ee3
allow general mixfix syntax for type constructors;
wenzelm
parents:
35306
diff
changeset
|
1683 |
* Type constructors admit general mixfix syntax, not just infix. |
7425aece4ee3
allow general mixfix syntax for type constructors;
wenzelm
parents:
35306
diff
changeset
|
1684 |
|
36508
03d2a2d0ee4a
allow concrete syntax for local entities within a proof body, either via regular mixfix annotations to 'fix' etc. or the separate 'write' command;
wenzelm
parents:
36461
diff
changeset
|
1685 |
* Concrete syntax may be attached to local entities without a proof |
03d2a2d0ee4a
allow concrete syntax for local entities within a proof body, either via regular mixfix annotations to 'fix' etc. or the separate 'write' command;
wenzelm
parents:
36461
diff
changeset
|
1686 |
body, too. This works via regular mixfix annotations for 'fix', |
03d2a2d0ee4a
allow concrete syntax for local entities within a proof body, either via regular mixfix annotations to 'fix' etc. or the separate 'write' command;
wenzelm
parents:
36461
diff
changeset
|
1687 |
'def', 'obtain' etc. or via the explicit 'write' command, which is |
03d2a2d0ee4a
allow concrete syntax for local entities within a proof body, either via regular mixfix annotations to 'fix' etc. or the separate 'write' command;
wenzelm
parents:
36461
diff
changeset
|
1688 |
similar to the 'notation' command in theory specifications. |
03d2a2d0ee4a
allow concrete syntax for local entities within a proof body, either via regular mixfix annotations to 'fix' etc. or the separate 'write' command;
wenzelm
parents:
36461
diff
changeset
|
1689 |
|
37351 | 1690 |
* Discontinued unnamed infix syntax (legacy feature for many years) -- |
1691 |
need to specify constant name and syntax separately. Internal ML |
|
1692 |
datatype constructors have been renamed from InfixName to Infix etc. |
|
1693 |
Minor INCOMPATIBILITY. |
|
1694 |
||
1695 |
* Schematic theorem statements need to be explicitly markup as such, |
|
1696 |
via commands 'schematic_lemma', 'schematic_theorem', |
|
1697 |
'schematic_corollary'. Thus the relevance of the proof is made |
|
1698 |
syntactically clear, which impacts performance in a parallel or |
|
1699 |
asynchronous interactive environment. Minor INCOMPATIBILITY. |
|
1700 |
||
35613 | 1701 |
* Use of cumulative prems via "!" in some proof methods has been |
37351 | 1702 |
discontinued (old legacy feature). |
35613 | 1703 |
|
35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset
|
1704 |
* References 'trace_simp' and 'debug_simp' have been replaced by |
36857 | 1705 |
configuration options stored in the context. Enabling tracing (the |
1706 |
case of debugging is similar) in proofs works via |
|
1707 |
||
1708 |
using [[trace_simp = true]] |
|
1709 |
||
1710 |
Tracing is then active for all invocations of the simplifier in |
|
1711 |
subsequent goal refinement steps. Tracing may also still be enabled or |
|
40780
1cabd6f4a718
recovered Isabelle2009-2 NEWS -- published part is read-only;
wenzelm
parents:
40771
diff
changeset
|
1712 |
disabled via the ProofGeneral settings menu. |
35979
12bb31230550
replaced references 'trace_simp' and 'debug_simp' by configuration options stored in the context
boehmes
parents:
35845
diff
changeset
|
1713 |
|
36177
8e0770d2e499
separate commands 'hide_class', 'hide_type', 'hide_const', 'hide_fact';
wenzelm
parents:
36162
diff
changeset
|
1714 |
* Separate commands 'hide_class', 'hide_type', 'hide_const', |
8e0770d2e499
separate commands 'hide_class', 'hide_type', 'hide_const', 'hide_fact';
wenzelm
parents:
36162
diff
changeset
|
1715 |
'hide_fact' replace the former 'hide' KIND command. Minor |
8e0770d2e499
separate commands 'hide_class', 'hide_type', 'hide_const', 'hide_fact';
wenzelm
parents:
36162
diff
changeset
|
1716 |
INCOMPATIBILITY. |
8e0770d2e499
separate commands 'hide_class', 'hide_type', 'hide_const', 'hide_fact';
wenzelm
parents:
36162
diff
changeset
|
1717 |
|
37298
1f3ca94ccb84
improved parallelism of proof term normalization;
wenzelm
parents:
37273
diff
changeset
|
1718 |
* Improved parallelism of proof term normalization: usedir -p2 -q0 is |
1f3ca94ccb84
improved parallelism of proof term normalization;
wenzelm
parents:
37273
diff
changeset
|
1719 |
more efficient than combinations with -q1 or -q2. |
1f3ca94ccb84
improved parallelism of proof term normalization;
wenzelm
parents:
37273
diff
changeset
|
1720 |
|
35260 | 1721 |
|
34170
254ac75e4c38
reduced code generator cache to the baremost minimum; corrected spelling
haftmann
parents:
34076
diff
changeset
|
1722 |
*** Pure *** |
254ac75e4c38
reduced code generator cache to the baremost minimum; corrected spelling
haftmann
parents:
34076
diff
changeset
|
1723 |
|
37351 | 1724 |
* Proofterms record type-class reasoning explicitly, using the |
1725 |
"unconstrain" operation internally. This eliminates all sort |
|
1726 |
constraints from a theorem and proof, introducing explicit |
|
1727 |
OFCLASS-premises. On the proof term level, this operation is |
|
1728 |
automatically applied at theorem boundaries, such that closed proofs |
|
1729 |
are always free of sort constraints. INCOMPATIBILITY for tools that |
|
1730 |
inspect proof terms. |
|
36147
b43b22f63665
theory RBT with abstract type of red-black trees backed by implementation RBT_Impl
haftmann
parents:
36096
diff
changeset
|
1731 |
|
35765
09e238561460
local theory specifications handle hidden polymorphism implicitly;
wenzelm
parents:
35763
diff
changeset
|
1732 |
* Local theory specifications may depend on extra type variables that |
09e238561460
local theory specifications handle hidden polymorphism implicitly;
wenzelm
parents:
35763
diff
changeset
|
1733 |
are not present in the result type -- arguments TYPE('a) :: 'a itself |
09e238561460
local theory specifications handle hidden polymorphism implicitly;
wenzelm
parents:
35763
diff
changeset
|
1734 |
are added internally. For example: |
09e238561460
local theory specifications handle hidden polymorphism implicitly;
wenzelm
parents:
35763
diff
changeset
|
1735 |
|
09e238561460
local theory specifications handle hidden polymorphism implicitly;
wenzelm
parents:
35763
diff
changeset
|
1736 |
definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)" |
09e238561460
local theory specifications handle hidden polymorphism implicitly;
wenzelm
parents:
35763
diff
changeset
|
1737 |
|
37351 | 1738 |
* Predicates of locales introduced by classes carry a mandatory |
1739 |
"class" prefix. INCOMPATIBILITY. |
|
1740 |
||
1741 |
* Vacuous class specifications observe default sort. INCOMPATIBILITY. |
|
1742 |
||
1743 |
* Old 'axclass' command has been discontinued. INCOMPATIBILITY, use |
|
1744 |
'class' instead. |
|
1745 |
||
1746 |
* Command 'code_reflect' allows to incorporate generated ML code into |
|
1747 |
runtime environment; replaces immature code_datatype antiquotation. |
|
1748 |
INCOMPATIBILITY. |
|
1749 |
||
1750 |
* Code generator: simple concept for abstract datatypes obeying |
|
1751 |
invariants. |
|
1752 |
||
36857 | 1753 |
* Code generator: details of internal data cache have no impact on the |
1754 |
user space functionality any longer. |
|
1755 |
||
37351 | 1756 |
* Methods "unfold_locales" and "intro_locales" ignore non-locale |
1757 |
subgoals. This is more appropriate for interpretations with 'where'. |
|
36857 | 1758 |
INCOMPATIBILITY. |
34170
254ac75e4c38
reduced code generator cache to the baremost minimum; corrected spelling
haftmann
parents:
34076
diff
changeset
|
1759 |
|
36356
5ab0f8859f9f
command 'example_proof' opens an empty proof body;
wenzelm
parents:
36348
diff
changeset
|
1760 |
* Command 'example_proof' opens an empty proof body. This allows to |
5ab0f8859f9f
command 'example_proof' opens an empty proof body;
wenzelm
parents:
36348
diff
changeset
|
1761 |
experiment with Isar, without producing any persistent result. |
5ab0f8859f9f
command 'example_proof' opens an empty proof body;
wenzelm
parents:
36348
diff
changeset
|
1762 |
|
35413 | 1763 |
* Commands 'type_notation' and 'no_type_notation' declare type syntax |
1764 |
within a local theory context, with explicit checking of the |
|
1765 |
constructors involved (in contrast to the raw 'syntax' versions). |
|
1766 |
||
36178
0e5c133b48b6
keep localized 'types' as regular non-old-style version -- 'type_abbrev' as 'type' just causes too many problems, e.g. clash with "type" in translations or "type:" argument syntax;
wenzelm
parents:
36177
diff
changeset
|
1767 |
* Commands 'types' and 'typedecl' now work within a local theory |
0e5c133b48b6
keep localized 'types' as regular non-old-style version -- 'type_abbrev' as 'type' just causes too many problems, e.g. clash with "type" in translations or "type:" argument syntax;
wenzelm
parents:
36177
diff
changeset
|
1768 |
context -- without introducing dependencies on parameters or |
0e5c133b48b6
keep localized 'types' as regular non-old-style version -- 'type_abbrev' as 'type' just causes too many problems, e.g. clash with "type" in translations or "type:" argument syntax;
wenzelm
parents:
36177
diff
changeset
|
1769 |
assumptions, which is not possible in Isabelle/Pure. |
35681 | 1770 |
|
36857 | 1771 |
* Command 'defaultsort' has been renamed to 'default_sort', it works |
1772 |
within a local theory context. Minor INCOMPATIBILITY. |
|
36454
f2b5bcc61a8c
command 'defaultsort' is renamed to 'default_sort', it works within a local theory context;
wenzelm
parents:
36446
diff
changeset
|
1773 |
|
34170
254ac75e4c38
reduced code generator cache to the baremost minimum; corrected spelling
haftmann
parents:
34076
diff
changeset
|
1774 |
|
33993 | 1775 |
*** HOL *** |
1776 |
||
37351 | 1777 |
* Command 'typedef' now works within a local theory context -- without |
1778 |
introducing dependencies on parameters or assumptions, which is not |
|
1779 |
possible in Isabelle/Pure/HOL. Note that the logical environment may |
|
1780 |
contain multiple interpretations of local typedefs (with different |
|
1781 |
non-emptiness proofs), even in a global theory context. |
|
1782 |
||
1783 |
* New package for quotient types. Commands 'quotient_type' and |
|
1784 |
'quotient_definition' may be used for defining types and constants by |
|
1785 |
quotient constructions. An example is the type of integers created by |
|
1786 |
quotienting pairs of natural numbers: |
|
37380 | 1787 |
|
37351 | 1788 |
fun |
37380 | 1789 |
intrel :: "(nat * nat) => (nat * nat) => bool" |
37351 | 1790 |
where |
1791 |
"intrel (x, y) (u, v) = (x + v = u + y)" |
|
1792 |
||
37380 | 1793 |
quotient_type int = "nat * nat" / intrel |
37351 | 1794 |
by (auto simp add: equivp_def expand_fun_eq) |
37380 | 1795 |
|
37351 | 1796 |
quotient_definition |
1797 |
"0::int" is "(0::nat, 0::nat)" |
|
1798 |
||
1799 |
The method "lifting" can be used to lift of theorems from the |
|
1800 |
underlying "raw" type to the quotient type. The example |
|
1801 |
src/HOL/Quotient_Examples/FSet.thy includes such a quotient |
|
1802 |
construction and provides a reasoning infrastructure for finite sets. |
|
1803 |
||
1804 |
* Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid |
|
1805 |
clash with new theory Quotient in Main HOL. |
|
1806 |
||
1807 |
* Moved the SMT binding into the main HOL session, eliminating |
|
1808 |
separate HOL-SMT session. |
|
1809 |
||
37020 | 1810 |
* List membership infix mem operation is only an input abbreviation. |
1811 |
INCOMPATIBILITY. |
|
1812 |
||
37144 | 1813 |
* Theory Library/Word.thy has been removed. Use library Word/Word.thy |
1814 |
for future developements; former Library/Word.thy is still present in |
|
1815 |
the AFP entry RSAPPS. |
|
36963
9a017146675f
dropped old Library/Word.thy and toy example ex/Adder.thy
haftmann
parents:
36953
diff
changeset
|
1816 |
|
36857 | 1817 |
* Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no |
1818 |
longer shadowed. INCOMPATIBILITY. |
|
36808
cbeb3484fa07
theorem Presburger.int_induct has been renamed to Int.int_bidirectional_induct
haftmann
parents:
36714
diff
changeset
|
1819 |
|
36836
49156805321c
removed lemma real_sq_order; use power2_le_imp_le instead
huffman
parents:
36830
diff
changeset
|
1820 |
* Dropped theorem duplicate comp_arith; use semiring_norm instead. |
49156805321c
removed lemma real_sq_order; use power2_le_imp_le instead
huffman
parents:
36830
diff
changeset
|
1821 |
INCOMPATIBILITY. |
49156805321c
removed lemma real_sq_order; use power2_le_imp_le instead
huffman
parents:
36830
diff
changeset
|
1822 |
|
49156805321c
removed lemma real_sq_order; use power2_le_imp_le instead
huffman
parents:
36830
diff
changeset
|
1823 |
* Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead. |
49156805321c
removed lemma real_sq_order; use power2_le_imp_le instead
huffman
parents:
36830
diff
changeset
|
1824 |
INCOMPATIBILITY. |
36714 | 1825 |
|
36857 | 1826 |
* Dropped normalizing_semiring etc; use the facts in semiring classes |
1827 |
instead. INCOMPATIBILITY. |
|
1828 |
||
36979
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1829 |
* Dropped several real-specific versions of lemmas about floor and |
37351 | 1830 |
ceiling; use the generic lemmas from theory "Archimedean_Field" |
1831 |
instead. INCOMPATIBILITY. |
|
36979
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1832 |
|
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1833 |
floor_number_of_eq ~> floor_number_of |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1834 |
le_floor_eq_number_of ~> number_of_le_floor |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1835 |
le_floor_eq_zero ~> zero_le_floor |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1836 |
le_floor_eq_one ~> one_le_floor |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1837 |
floor_less_eq_number_of ~> floor_less_number_of |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1838 |
floor_less_eq_zero ~> floor_less_zero |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1839 |
floor_less_eq_one ~> floor_less_one |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1840 |
less_floor_eq_number_of ~> number_of_less_floor |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1841 |
less_floor_eq_zero ~> zero_less_floor |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1842 |
less_floor_eq_one ~> one_less_floor |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1843 |
floor_le_eq_number_of ~> floor_le_number_of |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1844 |
floor_le_eq_zero ~> floor_le_zero |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1845 |
floor_le_eq_one ~> floor_le_one |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1846 |
floor_subtract_number_of ~> floor_diff_number_of |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1847 |
floor_subtract_one ~> floor_diff_one |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1848 |
ceiling_number_of_eq ~> ceiling_number_of |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1849 |
ceiling_le_eq_number_of ~> ceiling_le_number_of |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1850 |
ceiling_le_zero_eq ~> ceiling_le_zero |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1851 |
ceiling_le_eq_one ~> ceiling_le_one |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1852 |
less_ceiling_eq_number_of ~> number_of_less_ceiling |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1853 |
less_ceiling_eq_zero ~> zero_less_ceiling |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1854 |
less_ceiling_eq_one ~> one_less_ceiling |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1855 |
ceiling_less_eq_number_of ~> ceiling_less_number_of |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1856 |
ceiling_less_eq_zero ~> ceiling_less_zero |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1857 |
ceiling_less_eq_one ~> ceiling_less_one |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1858 |
le_ceiling_eq_number_of ~> number_of_le_ceiling |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1859 |
le_ceiling_eq_zero ~> zero_le_ceiling |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1860 |
le_ceiling_eq_one ~> one_le_ceiling |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1861 |
ceiling_subtract_number_of ~> ceiling_diff_number_of |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1862 |
ceiling_subtract_one ~> ceiling_diff_one |
da7c06ab3169
remove several redundant lemmas about floor and ceiling
huffman
parents:
36972
diff
changeset
|
1863 |
|
37144 | 1864 |
* Theory "Finite_Set": various folding_XXX locales facilitate the |
36857 | 1865 |
application of the various fold combinators on finite sets. |
1866 |
||
1867 |
* Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT" |
|
1868 |
provides abstract red-black tree type which is backed by "RBT_Impl" as |
|
1869 |
implementation. INCOMPATIBILTY. |
|
36147
b43b22f63665
theory RBT with abstract type of red-black trees backed by implementation RBT_Impl
haftmann
parents:
36096
diff
changeset
|
1870 |
|
36830 | 1871 |
* Theory Library/Coinductive_List has been removed -- superseded by |
35763
765f8adf10f9
removed obsolete HOL/Library/Coinductive_List.thy, superceded by thys/Coinductive/Coinductive_List.thy in AFP/f2f5727b77d0;
wenzelm
parents:
35745
diff
changeset
|
1872 |
AFP/thys/Coinductive. |
765f8adf10f9
removed obsolete HOL/Library/Coinductive_List.thy, superceded by thys/Coinductive/Coinductive_List.thy in AFP/f2f5727b77d0;
wenzelm
parents:
35745
diff
changeset
|
1873 |
|
36829 | 1874 |
* Theory PReal, including the type "preal" and related operations, has |
1875 |
been removed. INCOMPATIBILITY. |
|
1876 |
||
37380 | 1877 |
* Real: new development using Cauchy Sequences. |
1878 |
||
37351 | 1879 |
* Split off theory "Big_Operators" containing setsum, setprod, |
1880 |
Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY. |
|
36857 | 1881 |
|
1882 |
* Theory "Rational" renamed to "Rat", for consistency with "Nat", |
|
1883 |
"Int" etc. INCOMPATIBILITY. |
|
1884 |
||
37351 | 1885 |
* Constant Rat.normalize needs to be qualified. INCOMPATIBILITY. |
37143 | 1886 |
|
36857 | 1887 |
* New set of rules "ac_simps" provides combined assoc / commute |
1888 |
rewrites for all interpretations of the appropriate generic locales. |
|
1889 |
||
1890 |
* Renamed theory "OrderedGroup" to "Groups" and split theory |
|
1891 |
"Ring_and_Field" into theories "Rings" and "Fields"; for more |
|
1892 |
appropriate and more consistent names suitable for name prefixes |
|
1893 |
within the HOL theories. INCOMPATIBILITY. |
|
35050
9f841f20dca6
renamed OrderedGroup to Groups; split theory Ring_and_Field into Rings Fields
haftmann
parents:
35042
diff
changeset
|
1894 |
|
35084 | 1895 |
* Some generic constants have been put to appropriate theories: |
36857 | 1896 |
- less_eq, less: Orderings |
1897 |
- zero, one, plus, minus, uminus, times, abs, sgn: Groups |
|
1898 |
- inverse, divide: Rings |
|
35084 | 1899 |
INCOMPATIBILITY. |
1900 |
||
36857 | 1901 |
* More consistent naming of type classes involving orderings (and |
1902 |
lattices): |
|
35027
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1903 |
|
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1904 |
lower_semilattice ~> semilattice_inf |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1905 |
upper_semilattice ~> semilattice_sup |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1906 |
|
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1907 |
dense_linear_order ~> dense_linorder |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1908 |
|
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1909 |
pordered_ab_group_add ~> ordered_ab_group_add |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1910 |
pordered_ab_group_add_abs ~> ordered_ab_group_add_abs |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1911 |
pordered_ab_semigroup_add ~> ordered_ab_semigroup_add |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1912 |
pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1913 |
pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1914 |
pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1915 |
pordered_cancel_semiring ~> ordered_cancel_semiring |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1916 |
pordered_comm_monoid_add ~> ordered_comm_monoid_add |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1917 |
pordered_comm_ring ~> ordered_comm_ring |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1918 |
pordered_comm_semiring ~> ordered_comm_semiring |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1919 |
pordered_ring ~> ordered_ring |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1920 |
pordered_ring_abs ~> ordered_ring_abs |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1921 |
pordered_semiring ~> ordered_semiring |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1922 |
|
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1923 |
ordered_ab_group_add ~> linordered_ab_group_add |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1924 |
ordered_ab_semigroup_add ~> linordered_ab_semigroup_add |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1925 |
ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1926 |
ordered_comm_semiring_strict ~> linordered_comm_semiring_strict |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1927 |
ordered_field ~> linordered_field |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1928 |
ordered_field_no_lb ~> linordered_field_no_lb |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1929 |
ordered_field_no_ub ~> linordered_field_no_ub |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1930 |
ordered_field_dense_linear_order ~> dense_linordered_field |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1931 |
ordered_idom ~> linordered_idom |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1932 |
ordered_ring ~> linordered_ring |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1933 |
ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1934 |
ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1935 |
ordered_ring_strict ~> linordered_ring_strict |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1936 |
ordered_semidom ~> linordered_semidom |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1937 |
ordered_semiring ~> linordered_semiring |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1938 |
ordered_semiring_1 ~> linordered_semiring_1 |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1939 |
ordered_semiring_1_strict ~> linordered_semiring_1_strict |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1940 |
ordered_semiring_strict ~> linordered_semiring_strict |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1941 |
|
36857 | 1942 |
The following slightly odd type classes have been moved to a |
37351 | 1943 |
separate theory Library/Lattice_Algebras: |
35032
7efe662e41b4
separate library theory for type classes combining lattices with various algebraic structures
haftmann
parents:
35027
diff
changeset
|
1944 |
|
7efe662e41b4
separate library theory for type classes combining lattices with various algebraic structures
haftmann
parents:
35027
diff
changeset
|
1945 |
lordered_ab_group_add ~> lattice_ab_group_add |
7efe662e41b4
separate library theory for type classes combining lattices with various algebraic structures
haftmann
parents:
35027
diff
changeset
|
1946 |
lordered_ab_group_add_abs ~> lattice_ab_group_add_abs |
7efe662e41b4
separate library theory for type classes combining lattices with various algebraic structures
haftmann
parents:
35027
diff
changeset
|
1947 |
lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add |
7efe662e41b4
separate library theory for type classes combining lattices with various algebraic structures
haftmann
parents:
35027
diff
changeset
|
1948 |
lordered_ab_group_add_join ~> semilattice_sup_ab_group_add |
7efe662e41b4
separate library theory for type classes combining lattices with various algebraic structures
haftmann
parents:
35027
diff
changeset
|
1949 |
lordered_ring ~> lattice_ring |
7efe662e41b4
separate library theory for type classes combining lattices with various algebraic structures
haftmann
parents:
35027
diff
changeset
|
1950 |
|
35027
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1951 |
INCOMPATIBILITY. |
ed7d12bcf8f8
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
1952 |
|
36416 | 1953 |
* Refined field classes: |
36857 | 1954 |
- classes division_ring_inverse_zero, field_inverse_zero, |
1955 |
linordered_field_inverse_zero include rule inverse 0 = 0 -- |
|
1956 |
subsumes former division_by_zero class; |
|
1957 |
- numerous lemmas have been ported from field to division_ring. |
|
1958 |
INCOMPATIBILITY. |
|
36416 | 1959 |
|
1960 |
* Refined algebra theorem collections: |
|
36857 | 1961 |
- dropped theorem group group_simps, use algebra_simps instead; |
1962 |
- dropped theorem group ring_simps, use field_simps instead; |
|
1963 |
- proper theorem collection field_simps subsumes former theorem |
|
1964 |
groups field_eq_simps and field_simps; |
|
1965 |
- dropped lemma eq_minus_self_iff which is a duplicate for |
|
1966 |
equal_neg_zero. |
|
1967 |
INCOMPATIBILITY. |
|
35009 | 1968 |
|
1969 |
* Theory Finite_Set and List: some lemmas have been generalized from |
|
34076
e3daf3c07381
Subgoal.FOCUS (and variants): resulting goal state is normalized as usual for resolution;
wenzelm
parents:
34062
diff
changeset
|
1970 |
sets to lattices: |
e3daf3c07381
Subgoal.FOCUS (and variants): resulting goal state is normalized as usual for resolution;
wenzelm
parents:
34062
diff
changeset
|
1971 |
|
34007
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
33994
diff
changeset
|
1972 |
fun_left_comm_idem_inter ~> fun_left_comm_idem_inf |
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
33994
diff
changeset
|
1973 |
fun_left_comm_idem_union ~> fun_left_comm_idem_sup |
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
33994
diff
changeset
|
1974 |
inter_Inter_fold_inter ~> inf_Inf_fold_inf |
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
33994
diff
changeset
|
1975 |
union_Union_fold_union ~> sup_Sup_fold_sup |
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
33994
diff
changeset
|
1976 |
Inter_fold_inter ~> Inf_fold_inf |
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
33994
diff
changeset
|
1977 |
Union_fold_union ~> Sup_fold_sup |
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
33994
diff
changeset
|
1978 |
inter_INTER_fold_inter ~> inf_INFI_fold_inf |
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
33994
diff
changeset
|
1979 |
union_UNION_fold_union ~> sup_SUPR_fold_sup |
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
33994
diff
changeset
|
1980 |
INTER_fold_inter ~> INFI_fold_inf |
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
33994
diff
changeset
|
1981 |
UNION_fold_union ~> SUPR_fold_sup |
aea892559fc5
tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann
parents:
33994
diff
changeset
|
1982 |
|
44973
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle2011-1 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset
|
1983 |
* Theory "Complete_Lattice": lemmas top_def and bot_def have been |
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle2011-1 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset
|
1984 |
replaced by the more convenient lemmas Inf_empty and Sup_empty. |
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle2011-1 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset
|
1985 |
Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed |
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle2011-1 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset
|
1986 |
by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace |
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle2011-1 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset
|
1987 |
former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right |
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle2011-1 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset
|
1988 |
subsume inf_top and sup_bot respectively. INCOMPATIBILITY. |
36416 | 1989 |
|
36857 | 1990 |
* Reorganized theory Multiset: swapped notation of pointwise and |
1991 |
multiset order: |
|
37351 | 1992 |
|
36857 | 1993 |
- pointwise ordering is instance of class order with standard syntax |
1994 |
<= and <; |
|
1995 |
- multiset ordering has syntax <=# and <#; partial order properties |
|
1996 |
are provided by means of interpretation with prefix |
|
1997 |
multiset_order; |
|
1998 |
- less duplication, less historical organization of sections, |
|
1999 |
conversion from associations lists to multisets, rudimentary code |
|
2000 |
generation; |
|
2001 |
- use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union, |
|
2002 |
if needed. |
|
37351 | 2003 |
|
36903 | 2004 |
Renamed: |
37351 | 2005 |
|
2006 |
multiset_eq_conv_count_eq ~> multiset_ext_iff |
|
2007 |
multi_count_ext ~> multiset_ext |
|
2008 |
diff_union_inverse2 ~> diff_union_cancelR |
|
2009 |
||
36857 | 2010 |
INCOMPATIBILITY. |
36416 | 2011 |
|
36903 | 2012 |
* Theory Permutation: replaced local "remove" by List.remove1. |
2013 |
||
36416 | 2014 |
* Code generation: ML and OCaml code is decorated with signatures. |
2015 |
||
35009 | 2016 |
* Theory List: added transpose. |
2017 |
||
35810 | 2018 |
* Library/Nat_Bijection.thy is a collection of bijective functions |
2019 |
between nat and other types, which supersedes the older libraries |
|
2020 |
Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY. |
|
2021 |
||
2022 |
Constants: |
|
2023 |
Nat_Int_Bij.nat2_to_nat ~> prod_encode |
|
2024 |
Nat_Int_Bij.nat_to_nat2 ~> prod_decode |
|
2025 |
Nat_Int_Bij.int_to_nat_bij ~> int_encode |
|
2026 |
Nat_Int_Bij.nat_to_int_bij ~> int_decode |
|
2027 |
Countable.pair_encode ~> prod_encode |
|
2028 |
NatIso.prod2nat ~> prod_encode |
|
2029 |
NatIso.nat2prod ~> prod_decode |
|
2030 |
NatIso.sum2nat ~> sum_encode |
|
2031 |
NatIso.nat2sum ~> sum_decode |
|
2032 |
NatIso.list2nat ~> list_encode |
|
2033 |
NatIso.nat2list ~> list_decode |
|
2034 |
NatIso.set2nat ~> set_encode |
|
2035 |
NatIso.nat2set ~> set_decode |
|
2036 |
||
2037 |
Lemmas: |
|
2038 |
Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode |
|
2039 |
Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode |
|
2040 |
Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode |
|
2041 |
Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode |
|
2042 |
Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode |
|
2043 |
Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse |
|
2044 |
Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse |
|
2045 |
Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode |
|
2046 |
Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode |
|
2047 |
Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode |
|
2048 |
Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode |
|
2049 |
Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode |
|
2050 |
Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode |
|
2051 |
||
36929 | 2052 |
* Sledgehammer: |
2053 |
- Renamed ATP commands: |
|
2054 |
atp_info ~> sledgehammer running_atps |
|
2055 |
atp_kill ~> sledgehammer kill_atps |
|
2056 |
atp_messages ~> sledgehammer messages |
|
2057 |
atp_minimize ~> sledgehammer minimize |
|
2058 |
print_atps ~> sledgehammer available_atps |
|
2059 |
INCOMPATIBILITY. |
|
2060 |
- Added user's manual ("isabelle doc sledgehammer"). |
|
2061 |
- Added option syntax and "sledgehammer_params" to customize |
|
2062 |
Sledgehammer's behavior. See the manual for details. |
|
2063 |
- Modified the Isar proof reconstruction code so that it produces |
|
2064 |
direct proofs rather than proofs by contradiction. (This feature |
|
2065 |
is still experimental.) |
|
2066 |
- Made Isar proof reconstruction work for SPASS, remote ATPs, and in |
|
2067 |
full-typed mode. |
|
2068 |
- Added support for TPTP syntax for SPASS via the "spass_tptp" ATP. |
|
2069 |
||
36928 | 2070 |
* Nitpick: |
2071 |
- Added and implemented "binary_ints" and "bits" options. |
|
2072 |
- Added "std" option and implemented support for nonstandard models. |
|
2073 |
- Added and implemented "finitize" option to improve the precision |
|
2074 |
of infinite datatypes based on a monotonicity analysis. |
|
2075 |
- Added support for quotient types. |
|
2076 |
- Added support for "specification" and "ax_specification" |
|
2077 |
constructs. |
|
2078 |
- Added support for local definitions (for "function" and |
|
2079 |
"termination" proofs). |
|
2080 |
- Added support for term postprocessors. |
|
2081 |
- Optimized "Multiset.multiset" and "FinFun.finfun". |
|
2082 |
- Improved efficiency of "destroy_constrs" optimization. |
|
2083 |
- Fixed soundness bugs related to "destroy_constrs" optimization and |
|
2084 |
record getters. |
|
37272 | 2085 |
- Fixed soundness bug related to higher-order constructors. |
2086 |
- Fixed soundness bug when "full_descrs" is enabled. |
|
36928 | 2087 |
- Improved precision of set constructs. |
37260
dde817e6dfb1
added "atoms" option to Nitpick (request from Karlsruhe) + wrap Refute. functions to "nitpick_util.ML"
blanchet
parents:
37158
diff
changeset
|
2088 |
- Added "atoms" option. |
36928 | 2089 |
- Added cache to speed up repeated Kodkod invocations on the same |
2090 |
problems. |
|
2091 |
- Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and |
|
2092 |
"SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and |
|
2093 |
"SAT4J_Light". INCOMPATIBILITY. |
|
2094 |
- Removed "skolemize", "uncurry", "sym_break", "flatten_prop", |
|
2095 |
"sharing_depth", and "show_skolems" options. INCOMPATIBILITY. |
|
37264
8b931fb51cc6
removed "nitpick_intro" attribute -- Nitpick noew uses Spec_Rules instead
blanchet
parents:
37260
diff
changeset
|
2096 |
- Removed "nitpick_intro" attribute. INCOMPATIBILITY. |
36928 | 2097 |
|
37361
250f487b3034
Documented changes in induct, cases, and nominal_induct method.
berghofe
parents:
37352
diff
changeset
|
2098 |
* Method "induct" now takes instantiations of the form t, where t is not |
250f487b3034
Documented changes in induct, cases, and nominal_induct method.
berghofe
parents:
37352
diff
changeset
|
2099 |
a variable, as a shorthand for "x == t", where x is a fresh variable. |
250f487b3034
Documented changes in induct, cases, and nominal_induct method.
berghofe
parents:
37352
diff
changeset
|
2100 |
If this is not intended, t has to be enclosed in parentheses. |
250f487b3034
Documented changes in induct, cases, and nominal_induct method.
berghofe
parents:
37352
diff
changeset
|
2101 |
By default, the equalities generated by definitional instantiations |
250f487b3034
Documented changes in induct, cases, and nominal_induct method.
berghofe
parents:
37352
diff
changeset
|
2102 |
are pre-simplified, which may cause parameters of inductive cases |
250f487b3034
Documented changes in induct, cases, and nominal_induct method.
berghofe
parents:
37352
diff
changeset
|
2103 |
to disappear, or may even delete some of the inductive cases. |
250f487b3034
Documented changes in induct, cases, and nominal_induct method.
berghofe
parents:
37352
diff
changeset
|
2104 |
Use "induct (no_simp)" instead of "induct" to restore the old |
250f487b3034
Documented changes in induct, cases, and nominal_induct method.
berghofe
parents:
37352
diff
changeset
|
2105 |
behaviour. The (no_simp) option is also understood by the "cases" |
250f487b3034
Documented changes in induct, cases, and nominal_induct method.
berghofe
parents:
37352
diff
changeset
|
2106 |
and "nominal_induct" methods, which now perform pre-simplification, too. |
250f487b3034
Documented changes in induct, cases, and nominal_induct method.
berghofe
parents:
37352
diff
changeset
|
2107 |
INCOMPATIBILITY. |
250f487b3034
Documented changes in induct, cases, and nominal_induct method.
berghofe
parents:
37352
diff
changeset
|
2108 |
|
33993 | 2109 |
|
36828 | 2110 |
*** HOLCF *** |
2111 |
||
2112 |
* Variable names in lemmas generated by the domain package have |
|
2113 |
changed; the naming scheme is now consistent with the HOL datatype |
|
2114 |
package. Some proof scripts may be affected, INCOMPATIBILITY. |
|
2115 |
||
2116 |
* The domain package no longer defines the function "foo_copy" for |
|
2117 |
recursive domain "foo". The reach lemma is now stated directly in |
|
2118 |
terms of "foo_take". Lemmas and proofs that mention "foo_copy" must |
|
2119 |
be reformulated in terms of "foo_take", INCOMPATIBILITY. |
|
2120 |
||
2121 |
* Most definedness lemmas generated by the domain package (previously |
|
2122 |
of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form |
|
2123 |
like "foo$x = UU <-> x = UU", which works better as a simp rule. |
|
37351 | 2124 |
Proofs that used definedness lemmas as intro rules may break, |
36828 | 2125 |
potential INCOMPATIBILITY. |
2126 |
||
2127 |
* Induction and casedist rules generated by the domain package now |
|
2128 |
declare proper case_names (one called "bottom", and one named for each |
|
2129 |
constructor). INCOMPATIBILITY. |
|
2130 |
||
2131 |
* For mutually-recursive domains, separate "reach" and "take_lemma" |
|
2132 |
rules are generated for each domain, INCOMPATIBILITY. |
|
2133 |
||
2134 |
foo_bar.reach ~> foo.reach bar.reach |
|
2135 |
foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma |
|
2136 |
||
2137 |
* Some lemmas generated by the domain package have been renamed for |
|
2138 |
consistency with the datatype package, INCOMPATIBILITY. |
|
2139 |
||
2140 |
foo.ind ~> foo.induct |
|
2141 |
foo.finite_ind ~> foo.finite_induct |
|
2142 |
foo.coind ~> foo.coinduct |
|
2143 |
foo.casedist ~> foo.exhaust |
|
2144 |
foo.exhaust ~> foo.nchotomy |
|
2145 |
||
2146 |
* For consistency with other definition packages, the fixrec package |
|
2147 |
now generates qualified theorem names, INCOMPATIBILITY. |
|
2148 |
||
2149 |
foo_simps ~> foo.simps |
|
2150 |
foo_unfold ~> foo.unfold |
|
2151 |
foo_induct ~> foo.induct |
|
2152 |
||
37087 | 2153 |
* The "fixrec_simp" attribute has been removed. The "fixrec_simp" |
2154 |
method and internal fixrec proofs now use the default simpset instead. |
|
2155 |
INCOMPATIBILITY. |
|
2156 |
||
36828 | 2157 |
* The "contlub" predicate has been removed. Proof scripts should use |
2158 |
lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY. |
|
2159 |
||
2160 |
* The "admw" predicate has been removed, INCOMPATIBILITY. |
|
2161 |
||
2162 |
* The constants cpair, cfst, and csnd have been removed in favor of |
|
2163 |
Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY. |
|
2164 |
||
2165 |
||
33993 | 2166 |
*** ML *** |
2167 |
||
37351 | 2168 |
* Antiquotations for basic formal entities: |
2169 |
||
2170 |
@{class NAME} -- type class |
|
2171 |
@{class_syntax NAME} -- syntax representation of the above |
|
2172 |
||
2173 |
@{type_name NAME} -- logical type |
|
2174 |
@{type_abbrev NAME} -- type abbreviation |
|
2175 |
@{nonterminal NAME} -- type of concrete syntactic category |
|
2176 |
@{type_syntax NAME} -- syntax representation of any of the above |
|
2177 |
||
2178 |
@{const_name NAME} -- logical constant (INCOMPATIBILITY) |
|
2179 |
@{const_abbrev NAME} -- abbreviated constant |
|
2180 |
@{const_syntax NAME} -- syntax representation of any of the above |
|
2181 |
||
2182 |
* Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw |
|
2183 |
syntax constant (cf. 'syntax' command). |
|
2184 |
||
2185 |
* Antiquotation @{make_string} inlines a function to print arbitrary |
|
2186 |
values similar to the ML toplevel. The result is compiler dependent |
|
2187 |
and may fall back on "?" in certain situations. |
|
2188 |
||
2189 |
* Diagnostic commands 'ML_val' and 'ML_command' may refer to |
|
2190 |
antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure |
|
2191 |
Isar.state() and Isar.goal(), which belong to the old TTY loop and do |
|
2192 |
not work with the asynchronous Isar document model. |
|
2193 |
||
2194 |
* Configuration options now admit dynamic default values, depending on |
|
2195 |
the context or even global references. |
|
2196 |
||
2197 |
* SHA1.digest digests strings according to SHA-1 (see RFC 3174). It |
|
2198 |
uses an efficient external library if available (for Poly/ML). |
|
2199 |
||
37144 | 2200 |
* Renamed some important ML structures, while keeping the old names |
2201 |
for some time as aliases within the structure Legacy: |
|
2202 |
||
2203 |
OuterKeyword ~> Keyword |
|
2204 |
OuterLex ~> Token |
|
2205 |
OuterParse ~> Parse |
|
2206 |
OuterSyntax ~> Outer_Syntax |
|
37216
3165bc303f66
modernized some structure names, keeping a few legacy aliases;
wenzelm
parents:
37158
diff
changeset
|
2207 |
PrintMode ~> Print_Mode |
37144 | 2208 |
SpecParse ~> Parse_Spec |
37216
3165bc303f66
modernized some structure names, keeping a few legacy aliases;
wenzelm
parents:
37158
diff
changeset
|
2209 |
ThyInfo ~> Thy_Info |
3165bc303f66
modernized some structure names, keeping a few legacy aliases;
wenzelm
parents:
37158
diff
changeset
|
2210 |
ThyLoad ~> Thy_Load |
3165bc303f66
modernized some structure names, keeping a few legacy aliases;
wenzelm
parents:
37158
diff
changeset
|
2211 |
ThyOutput ~> Thy_Output |
37145
01aa36932739
renamed structure TypeInfer to Type_Infer, keeping the old name as legacy alias for some time;
wenzelm
parents:
37144
diff
changeset
|
2212 |
TypeInfer ~> Type_Infer |
37144 | 2213 |
|
2214 |
Note that "open Legacy" simplifies porting of sources, but forgetting |
|
2215 |
to remove it again will complicate porting again in the future. |
|
2216 |
||
2217 |
* Most operations that refer to a global context are named |
|
2218 |
accordingly, e.g. Simplifier.global_context or |
|
2219 |
ProofContext.init_global. There are some situations where a global |
|
2220 |
context actually works, but under normal circumstances one needs to |
|
2221 |
pass the proper local context through the code! |
|
2222 |
||
2223 |
* Discontinued old TheoryDataFun with its copy/init operation -- data |
|
2224 |
needs to be pure. Functor Theory_Data_PP retains the traditional |
|
2225 |
Pretty.pp argument to merge, which is absent in the standard |
|
2226 |
Theory_Data version. |
|
36429
9d6b3be996d4
monotonic sort certification: sorts are no longer minimized at the kernel boundary, only when reading input from the end-user;
wenzelm
parents:
36416
diff
changeset
|
2227 |
|
37144 | 2228 |
* Sorts.certify_sort and derived "cert" operations for types and terms |
2229 |
no longer minimize sorts. Thus certification at the boundary of the |
|
2230 |
inference kernel becomes invariant under addition of class relations, |
|
2231 |
which is an important monotonicity principle. Sorts are now minimized |
|
2232 |
in the syntax layer only, at the boundary between the end-user and the |
|
2233 |
system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort |
|
2234 |
explicitly in rare situations. |
|
2235 |
||
35021
c839a4c670c6
renamed old-style Drule.standard to Drule.export_without_context, to emphasize that this is in no way a standard operation;
wenzelm
parents:
35009
diff
changeset
|
2236 |
* Renamed old-style Drule.standard to Drule.export_without_context, to |
c839a4c670c6
renamed old-style Drule.standard to Drule.export_without_context, to emphasize that this is in no way a standard operation;
wenzelm
parents:
35009
diff
changeset
|
2237 |
emphasize that this is in no way a standard operation. |
c839a4c670c6
renamed old-style Drule.standard to Drule.export_without_context, to emphasize that this is in no way a standard operation;
wenzelm
parents:
35009
diff
changeset
|
2238 |
INCOMPATIBILITY. |
c839a4c670c6
renamed old-style Drule.standard to Drule.export_without_context, to emphasize that this is in no way a standard operation;
wenzelm
parents:
35009
diff
changeset
|
2239 |
|
34076
e3daf3c07381
Subgoal.FOCUS (and variants): resulting goal state is normalized as usual for resolution;
wenzelm
parents:
34062
diff
changeset
|
2240 |
* Subgoal.FOCUS (and variants): resulting goal state is normalized as |
e3daf3c07381
Subgoal.FOCUS (and variants): resulting goal state is normalized as usual for resolution;
wenzelm
parents:
34062
diff
changeset
|
2241 |
usual for resolution. Rare INCOMPATIBILITY. |
e3daf3c07381
Subgoal.FOCUS (and variants): resulting goal state is normalized as usual for resolution;
wenzelm
parents:
34062
diff
changeset
|
2242 |
|
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35810
diff
changeset
|
2243 |
* Renamed varify/unvarify operations to varify_global/unvarify_global |
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35810
diff
changeset
|
2244 |
to emphasize that these only work in a global situation (which is |
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35810
diff
changeset
|
2245 |
quite rare). |
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35810
diff
changeset
|
2246 |
|
37144 | 2247 |
* Curried take and drop in library.ML; negative length is interpreted |
2248 |
as infinity (as in chop). Subtle INCOMPATIBILITY. |
|
36961 | 2249 |
|
37351 | 2250 |
* Proof terms: type substitutions on proof constants now use canonical |
2251 |
order of type variables. INCOMPATIBILITY for tools working with proof |
|
2252 |
terms. |
|
2253 |
||
2254 |
* Raw axioms/defs may no longer carry sort constraints, and raw defs |
|
2255 |
may no longer carry premises. User-level specifications are |
|
2256 |
transformed accordingly by Thm.add_axiom/add_def. |
|
2257 |
||
33993 | 2258 |
|
34238 | 2259 |
*** System *** |
2260 |
||
2261 |
* Discontinued special HOL_USEDIR_OPTIONS for the main HOL image; |
|
2262 |
ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that |
|
2263 |
proof terms are enabled unconditionally in the new HOL-Proofs image. |
|
2264 |
||
34255
2dd2547acb41
discontinued old ISABELLE and ISATOOL environment settings;
wenzelm
parents:
34238
diff
changeset
|
2265 |
* Discontinued old ISABELLE and ISATOOL environment settings (legacy |
2dd2547acb41
discontinued old ISABELLE and ISATOOL environment settings;
wenzelm
parents:
34238
diff
changeset
|
2266 |
feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL, |
2dd2547acb41
discontinued old ISABELLE and ISATOOL environment settings;
wenzelm
parents:
34238
diff
changeset
|
2267 |
respectively. |
2dd2547acb41
discontinued old ISABELLE and ISATOOL environment settings;
wenzelm
parents:
34238
diff
changeset
|
2268 |
|
36201
07d4f74abd12
polyml-platform script is superseded by ISABELLE_PLATFORM;
wenzelm
parents:
36178
diff
changeset
|
2269 |
* Old lib/scripts/polyml-platform is superseded by the |
07d4f74abd12
polyml-platform script is superseded by ISABELLE_PLATFORM;
wenzelm
parents:
36178
diff
changeset
|
2270 |
ISABELLE_PLATFORM setting variable, which defaults to the 32 bit |
07d4f74abd12
polyml-platform script is superseded by ISABELLE_PLATFORM;
wenzelm
parents:
36178
diff
changeset
|
2271 |
variant, even on a 64 bit machine. The following example setting |
07d4f74abd12
polyml-platform script is superseded by ISABELLE_PLATFORM;
wenzelm
parents:
36178
diff
changeset
|
2272 |
prefers 64 bit if available: |
07d4f74abd12
polyml-platform script is superseded by ISABELLE_PLATFORM;
wenzelm
parents:
36178
diff
changeset
|
2273 |
|
07d4f74abd12
polyml-platform script is superseded by ISABELLE_PLATFORM;
wenzelm
parents:
36178
diff
changeset
|
2274 |
ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}" |
07d4f74abd12
polyml-platform script is superseded by ISABELLE_PLATFORM;
wenzelm
parents:
36178
diff
changeset
|
2275 |
|
37218 | 2276 |
* The preliminary Isabelle/jEdit application demonstrates the emerging |
2277 |
Isabelle/Scala layer for advanced prover interaction and integration. |
|
2278 |
See src/Tools/jEdit or "isabelle jedit" provided by the properly built |
|
2279 |
component. |
|
2280 |
||
37375 | 2281 |
* "IsabelleText" is a Unicode font derived from Bitstream Vera Mono |
2282 |
and Bluesky TeX fonts. It provides the usual Isabelle symbols, |
|
2283 |
similar to the default assignment of the document preparation system |
|
2284 |
(cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System |
|
2285 |
provides some operations for direct access to the font without asking |
|
2286 |
the user for manual installation. |
|
2287 |
||
34238 | 2288 |
|
33993 | 2289 |
|
33842 | 2290 |
New in Isabelle2009-1 (December 2009) |
2291 |
------------------------------------- |
|
30904 | 2292 |
|
31547 | 2293 |
*** General *** |
2294 |
||
2295 |
* Discontinued old form of "escaped symbols" such as \\<forall>. Only |
|
2296 |
one backslash should be used, even in ML sources. |
|
2297 |
||
2298 |
||
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30949
diff
changeset
|
2299 |
*** Pure *** |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30949
diff
changeset
|
2300 |
|
32846
29941e925c82
News entry: inheritance of mixins; print_interps.
ballarin
parents:
32775
diff
changeset
|
2301 |
* Locale interpretation propagates mixins along the locale hierarchy. |
29941e925c82
News entry: inheritance of mixins; print_interps.
ballarin
parents:
32775
diff
changeset
|
2302 |
The currently only available mixins are the equations used to map |
29941e925c82
News entry: inheritance of mixins; print_interps.
ballarin
parents:
32775
diff
changeset
|
2303 |
local definitions to terms of the target domain of an interpretation. |
29941e925c82
News entry: inheritance of mixins; print_interps.
ballarin
parents:
32775
diff
changeset
|
2304 |
|
33842 | 2305 |
* Reactivated diagnostic command 'print_interps'. Use "print_interps |
2306 |
loc" to print all interpretations of locale "loc" in the theory. |
|
2307 |
Interpretations in proofs are not shown. |
|
32846
29941e925c82
News entry: inheritance of mixins; print_interps.
ballarin
parents:
32775
diff
changeset
|
2308 |
|
32983 | 2309 |
* Thoroughly revised locales tutorial. New section on conditional |
2310 |
interpretation. |
|
2311 |
||
33843 | 2312 |
* On instantiation of classes, remaining undefined class parameters |
2313 |
are formally declared. INCOMPATIBILITY. |
|
2314 |
||
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30949
diff
changeset
|
2315 |
|
33842 | 2316 |
*** Document preparation *** |
2317 |
||
2318 |
* New generalized style concept for printing terms: @{foo (style) ...} |
|
2319 |
instead of @{foo_style style ...} (old form is still retained for |
|
2320 |
backward compatibility). Styles can be also applied for |
|
2321 |
antiquotations prop, term_type and typeof. |
|
32891 | 2322 |
|
2323 |
||
30930 | 2324 |
*** HOL *** |
2325 |
||
33842 | 2326 |
* New proof method "smt" for a combination of first-order logic with |
2327 |
equality, linear and nonlinear (natural/integer/real) arithmetic, and |
|
2328 |
fixed-size bitvectors; there is also basic support for higher-order |
|
2329 |
features (esp. lambda abstractions). It is an incomplete decision |
|
2330 |
procedure based on external SMT solvers using the oracle mechanism; |
|
2331 |
for the SMT solver Z3, this method is proof-producing. Certificates |
|
2332 |
are provided to avoid calling the external solvers solely for |
|
2333 |
re-checking proofs. Due to a remote SMT service there is no need for |
|
2334 |
installing SMT solvers locally. See src/HOL/SMT. |
|
2335 |
||
2336 |
* New commands to load and prove verification conditions generated by |
|
2337 |
the Boogie program verifier or derived systems (e.g. the Verifying C |
|
2338 |
Compiler (VCC) or Spec#). See src/HOL/Boogie. |
|
2339 |
||
2340 |
* New counterexample generator tool 'nitpick' based on the Kodkod |
|
2341 |
relational model finder. See src/HOL/Tools/Nitpick and |
|
2342 |
src/HOL/Nitpick_Examples. |
|
2343 |
||
33860 | 2344 |
* New commands 'code_pred' and 'values' to invoke the predicate |
2345 |
compiler and to enumerate values of inductive predicates. |
|
2346 |
||
2347 |
* A tabled implementation of the reflexive transitive closure. |
|
2348 |
||
2349 |
* New implementation of quickcheck uses generic code generator; |
|
2350 |
default generators are provided for all suitable HOL types, records |
|
2351 |
and datatypes. Old quickcheck can be re-activated importing theory |
|
2352 |
Library/SML_Quickcheck. |
|
2353 |
||
33843 | 2354 |
* New testing tool Mirabelle for automated proof tools. Applies |
2355 |
several tools and tactics like sledgehammer, metis, or quickcheck, to |
|
2356 |
every proof step in a theory. To be used in batch mode via the |
|
2357 |
"mirabelle" utility. |
|
2358 |
||
2359 |
* New proof method "sos" (sum of squares) for nonlinear real |
|
2360 |
arithmetic (originally due to John Harison). It requires theory |
|
2361 |
Library/Sum_Of_Squares. It is not a complete decision procedure but |
|
2362 |
works well in practice on quantifier-free real arithmetic with +, -, |
|
2363 |
*, ^, =, <= and <, i.e. boolean combinations of equalities and |
|
2364 |
inequalities between polynomials. It makes use of external |
|
2365 |
semidefinite programming solvers. Method "sos" generates a |
|
2366 |
certificate that can be pasted into the proof thus avoiding the need |
|
2367 |
to call an external tool every time the proof is checked. See |
|
2368 |
src/HOL/Library/Sum_Of_Squares. |
|
2369 |
||
2370 |
* New method "linarith" invokes existing linear arithmetic decision |
|
2371 |
procedure only. |
|
2372 |
||
2373 |
* New command 'atp_minimal' reduces result produced by Sledgehammer. |
|
2374 |
||
2375 |
* New Sledgehammer option "Full Types" in Proof General settings menu. |
|
2376 |
Causes full type information to be output to the ATPs. This slows |
|
2377 |
ATPs down considerably but eliminates a source of unsound "proofs" |
|
2378 |
that fail later. |
|
2379 |
||
2380 |
* New method "metisFT": A version of metis that uses full type |
|
2381 |
information in order to avoid failures of proof reconstruction. |
|
2382 |
||
2383 |
* New evaluator "approximate" approximates an real valued term using |
|
2384 |
the same method as the approximation method. |
|
2385 |
||
2386 |
* Method "approximate" now supports arithmetic expressions as |
|
2387 |
boundaries of intervals and implements interval splitting and Taylor |
|
2388 |
series expansion. |
|
2389 |
||
2390 |
* ML antiquotation @{code_datatype} inserts definition of a datatype |
|
2391 |
generated by the code generator; e.g. see src/HOL/Predicate.thy. |
|
2392 |
||
33860 | 2393 |
* New theory SupInf of the supremum and infimum operators for sets of |
2394 |
reals. |
|
2395 |
||
2396 |
* New theory Probability, which contains a development of measure |
|
2397 |
theory, eventually leading to Lebesgue integration and probability. |
|
2398 |
||
2399 |
* Extended Multivariate Analysis to include derivation and Brouwer's |
|
2400 |
fixpoint theorem. |
|
33843 | 2401 |
|
33842 | 2402 |
* Reorganization of number theory, INCOMPATIBILITY: |
33873 | 2403 |
- new number theory development for nat and int, in theories Divides |
2404 |
and GCD as well as in new session Number_Theory |
|
2405 |
- some constants and facts now suffixed with _nat and _int |
|
2406 |
accordingly |
|
2407 |
- former session NumberTheory now named Old_Number_Theory, including |
|
2408 |
theories Legacy_GCD and Primes (prefer Number_Theory if possible) |
|
33842 | 2409 |
- moved theory Pocklington from src/HOL/Library to |
2410 |
src/HOL/Old_Number_Theory |
|
32479 | 2411 |
|
33873 | 2412 |
* Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and |
2413 |
lcm of finite and infinite sets. It is shown that they form a complete |
|
32600 | 2414 |
lattice. |
2415 |
||
2416 |
* Class semiring_div requires superclass no_zero_divisors and proof of |
|
2417 |
div_mult_mult1; theorems div_mult_mult1, div_mult_mult2, |
|
2418 |
div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been |
|
2419 |
generalized to class semiring_div, subsuming former theorems |
|
2420 |
zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and |
|
2421 |
zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default. |
|
2422 |
INCOMPATIBILITY. |
|
2423 |
||
32588
5e06a1634e55
Inter and Union are mere abbreviations for Inf and Sup; tuned
haftmann
parents:
32485
diff
changeset
|
2424 |
* Refinements to lattice classes and sets: |
32064 | 2425 |
- less default intro/elim rules in locale variant, more default |
2426 |
intro/elim rules in class variant: more uniformity |
|
33842 | 2427 |
- lemma ge_sup_conv renamed to le_sup_iff, in accordance with |
2428 |
le_inf_iff |
|
2429 |
- dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and |
|
2430 |
sup_aci) |
|
32064 | 2431 |
- renamed ACI to inf_sup_aci |
32600 | 2432 |
- new class "boolean_algebra" |
33842 | 2433 |
- class "complete_lattice" moved to separate theory |
33860 | 2434 |
"Complete_Lattice"; corresponding constants (and abbreviations) |
33842 | 2435 |
renamed and with authentic syntax: |
33860 | 2436 |
Set.Inf ~> Complete_Lattice.Inf |
2437 |
Set.Sup ~> Complete_Lattice.Sup |
|
2438 |
Set.INFI ~> Complete_Lattice.INFI |
|
2439 |
Set.SUPR ~> Complete_Lattice.SUPR |
|
2440 |
Set.Inter ~> Complete_Lattice.Inter |
|
2441 |
Set.Union ~> Complete_Lattice.Union |
|
2442 |
Set.INTER ~> Complete_Lattice.INTER |
|
2443 |
Set.UNION ~> Complete_Lattice.UNION |
|
32600 | 2444 |
- authentic syntax for |
2445 |
Set.Pow |
|
2446 |
Set.image |
|
32588
5e06a1634e55
Inter and Union are mere abbreviations for Inf and Sup; tuned
haftmann
parents:
32485
diff
changeset
|
2447 |
- mere abbreviations: |
5e06a1634e55
Inter and Union are mere abbreviations for Inf and Sup; tuned
haftmann
parents:
32485
diff
changeset
|
2448 |
Set.empty (for bot) |
5e06a1634e55
Inter and Union are mere abbreviations for Inf and Sup; tuned
haftmann
parents:
32485
diff
changeset
|
2449 |
Set.UNIV (for top) |
33860 | 2450 |
Set.inter (for inf, formerly Set.Int) |
2451 |
Set.union (for sup, formerly Set.Un) |
|
32588
5e06a1634e55
Inter and Union are mere abbreviations for Inf and Sup; tuned
haftmann
parents:
32485
diff
changeset
|
2452 |
Complete_Lattice.Inter (for Inf) |
5e06a1634e55
Inter and Union are mere abbreviations for Inf and Sup; tuned
haftmann
parents:
32485
diff
changeset
|
2453 |
Complete_Lattice.Union (for Sup) |
32606
b5c3a8a75772
INTER and UNION are mere abbreviations for INFI and SUPR
haftmann
parents:
32600
diff
changeset
|
2454 |
Complete_Lattice.INTER (for INFI) |
b5c3a8a75772
INTER and UNION are mere abbreviations for INFI and SUPR
haftmann
parents:
32600
diff
changeset
|
2455 |
Complete_Lattice.UNION (for SUPR) |
32600 | 2456 |
- object-logic definitions as far as appropriate |
32217 | 2457 |
|
32691 | 2458 |
INCOMPATIBILITY. Care is required when theorems Int_subset_iff or |
33842 | 2459 |
Un_subset_iff are explicitly deleted as default simp rules; then also |
2460 |
their lattice counterparts le_inf_iff and le_sup_iff have to be |
|
32691 | 2461 |
deleted to achieve the desired effect. |
32064 | 2462 |
|
33842 | 2463 |
* Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp |
2464 |
rules by default any longer; the same applies to min_max.inf_absorb1 |
|
2465 |
etc. INCOMPATIBILITY. |
|
2466 |
||
2467 |
* Rules sup_Int_eq and sup_Un_eq are no longer declared as |
|
2468 |
pred_set_conv by default. INCOMPATIBILITY. |
|
2469 |
||
2470 |
* Power operations on relations and functions are now one dedicated |
|
32706 | 2471 |
constant "compow" with infix syntax "^^". Power operation on |
31547 | 2472 |
multiplicative monoids retains syntax "^" and is now defined generic |
2473 |
in class power. INCOMPATIBILITY. |
|
2474 |
||
33842 | 2475 |
* Relation composition "R O S" now has a more standard argument order: |
2476 |
"R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY, |
|
2477 |
rewrite propositions with "S O R" --> "R O S". Proofs may occasionally |
|
2478 |
break, since the O_assoc rule was not rewritten like this. Fix using |
|
2479 |
O_assoc[symmetric]. The same applies to the curried version "R OO S". |
|
32427 | 2480 |
|
33057 | 2481 |
* Function "Inv" is renamed to "inv_into" and function "inv" is now an |
33842 | 2482 |
abbreviation for "inv_into UNIV". Lemmas are renamed accordingly. |
32988 | 2483 |
INCOMPATIBILITY. |
2484 |
||
33860 | 2485 |
* Most rules produced by inductive and datatype package have mandatory |
2486 |
prefixes. INCOMPATIBILITY. |
|
31790 | 2487 |
|
33842 | 2488 |
* Changed "DERIV_intros" to a dynamic fact, which can be augmented by |
2489 |
the attribute of the same name. Each of the theorems in the list |
|
2490 |
DERIV_intros assumes composition with an additional function and |
|
2491 |
matches a variable to the derivative, which has to be solved by the |
|
2492 |
Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative |
|
33873 | 2493 |
of most elementary terms. Former Maclauren.DERIV_tac and |
2494 |
Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros). |
|
2495 |
INCOMPATIBILITY. |
|
33860 | 2496 |
|
2497 |
* Code generator attributes follow the usual underscore convention: |
|
2498 |
code_unfold replaces code unfold |
|
2499 |
code_post replaces code post |
|
2500 |
etc. |
|
2501 |
INCOMPATIBILITY. |
|
31900 | 2502 |
|
33471 | 2503 |
* Renamed methods: |
2504 |
sizechange -> size_change |
|
2505 |
induct_scheme -> induction_schema |
|
33860 | 2506 |
INCOMPATIBILITY. |
33673 | 2507 |
|
33843 | 2508 |
* Discontinued abbreviation "arbitrary" of constant "undefined". |
2509 |
INCOMPATIBILITY, use "undefined" directly. |
|
2510 |
||
33860 | 2511 |
* Renamed theorems: |
2512 |
Suc_eq_add_numeral_1 -> Suc_eq_plus1 |
|
2513 |
Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left |
|
2514 |
Suc_plus1 -> Suc_eq_plus1 |
|
2515 |
*anti_sym -> *antisym* |
|
2516 |
vector_less_eq_def -> vector_le_def |
|
2517 |
INCOMPATIBILITY. |
|
2518 |
||
2519 |
* Added theorem List.map_map as [simp]. Removed List.map_compose. |
|
2520 |
INCOMPATIBILITY. |
|
2521 |
||
2522 |
* Removed predicate "M hassize n" (<--> card M = n & finite M). |
|
2523 |
INCOMPATIBILITY. |
|
2524 |
||
31812 | 2525 |
|
33825 | 2526 |
*** HOLCF *** |
2527 |
||
33842 | 2528 |
* Theory Representable defines a class "rep" of domains that are |
2529 |
representable (via an ep-pair) in the universal domain type "udom". |
|
33825 | 2530 |
Instances are provided for all type constructors defined in HOLCF. |
2531 |
||
2532 |
* The 'new_domain' command is a purely definitional version of the |
|
2533 |
domain package, for representable domains. Syntax is identical to the |
|
2534 |
old domain package. The 'new_domain' package also supports indirect |
|
2535 |
recursion using previously-defined type constructors. See |
|
33842 | 2536 |
src/HOLCF/ex/New_Domain.thy for examples. |
2537 |
||
2538 |
* Method "fixrec_simp" unfolds one step of a fixrec-defined constant |
|
33825 | 2539 |
on the left-hand side of an equation, and then performs |
2540 |
simplification. Rewriting is done using rules declared with the |
|
33842 | 2541 |
"fixrec_simp" attribute. The "fixrec_simp" method is intended as a |
2542 |
replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples. |
|
33825 | 2543 |
|
2544 |
* The pattern-match compiler in 'fixrec' can now handle constructors |
|
2545 |
with HOL function types. Pattern-match combinators for the Pair |
|
2546 |
constructor are pre-configured. |
|
2547 |
||
2548 |
* The 'fixrec' package now produces better fixed-point induction rules |
|
2549 |
for mutually-recursive definitions: Induction rules have conclusions |
|
2550 |
of the form "P foo bar" instead of "P <foo, bar>". |
|
2551 |
||
2552 |
* The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has |
|
2553 |
been renamed to "below". The name "below" now replaces "less" in many |
|
33842 | 2554 |
theorem names. (Legacy theorem names using "less" are still supported |
2555 |
as well.) |
|
33825 | 2556 |
|
2557 |
* The 'fixrec' package now supports "bottom patterns". Bottom |
|
2558 |
patterns can be used to generate strictness rules, or to make |
|
2559 |
functions more strict (much like the bang-patterns supported by the |
|
33873 | 2560 |
Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for |
2561 |
examples. |
|
33825 | 2562 |
|
2563 |
||
31304 | 2564 |
*** ML *** |
2565 |
||
33843 | 2566 |
* Support for Poly/ML 5.3.0, with improved reporting of compiler |
2567 |
errors and run-time exceptions, including detailed source positions. |
|
2568 |
||
2569 |
* Structure Name_Space (formerly NameSpace) now manages uniquely |
|
2570 |
identified entries, with some additional information such as source |
|
2571 |
position, logical grouping etc. |
|
2572 |
||
33524
a08e6c1cbc04
updated functor Theory_Data, Proof_Data, Generic_Data;
wenzelm
parents:
33472
diff
changeset
|
2573 |
* Theory and context data is now introduced by the simplified and |
a08e6c1cbc04
updated functor Theory_Data, Proof_Data, Generic_Data;
wenzelm
parents:
33472
diff
changeset
|
2574 |
modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs |
a08e6c1cbc04
updated functor Theory_Data, Proof_Data, Generic_Data;
wenzelm
parents:
33472
diff
changeset
|
2575 |
to be pure, but the old TheoryDataFun for mutable data (with explicit |
a08e6c1cbc04
updated functor Theory_Data, Proof_Data, Generic_Data;
wenzelm
parents:
33472
diff
changeset
|
2576 |
copy operation) is still available for some time. |
a08e6c1cbc04
updated functor Theory_Data, Proof_Data, Generic_Data;
wenzelm
parents:
33472
diff
changeset
|
2577 |
|
32742 | 2578 |
* Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML) |
2579 |
provides a high-level programming interface to synchronized state |
|
2580 |
variables with atomic update. This works via pure function |
|
2581 |
application within a critical section -- its runtime should be as |
|
2582 |
short as possible; beware of deadlocks if critical code is nested, |
|
2583 |
either directly or indirectly via other synchronized variables! |
|
2584 |
||
2585 |
* Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML) |
|
2586 |
wraps raw ML references, explicitly indicating their non-thread-safe |
|
2587 |
behaviour. The Isar toplevel keeps this structure open, to |
|
2588 |
accommodate Proof General as well as quick and dirty interactive |
|
2589 |
experiments with references. |
|
2590 |
||
32365 | 2591 |
* PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for |
2592 |
parallel tactical reasoning. |
|
2593 |
||
32427 | 2594 |
* Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS |
2595 |
are similar to SUBPROOF, but are slightly more flexible: only the |
|
2596 |
specified parts of the subgoal are imported into the context, and the |
|
2597 |
body tactic may introduce new subgoals and schematic variables. |
|
2598 |
||
2599 |
* Old tactical METAHYPS, which does not observe the proof context, has |
|
2600 |
been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF |
|
2601 |
or Subgoal.FOCUS etc. |
|
32216 | 2602 |
|
31971
8c1b845ed105
renamed functor TableFun to Table, and GraphFun to Graph;
wenzelm
parents:
31901
diff
changeset
|
2603 |
* Renamed functor TableFun to Table, and GraphFun to Graph. (Since |
8c1b845ed105
renamed functor TableFun to Table, and GraphFun to Graph;
wenzelm
parents:
31901
diff
changeset
|
2604 |
functors have their own ML name space there is no point to mark them |
8c1b845ed105
renamed functor TableFun to Table, and GraphFun to Graph;
wenzelm
parents:
31901
diff
changeset
|
2605 |
separately.) Minor INCOMPATIBILITY. |
8c1b845ed105
renamed functor TableFun to Table, and GraphFun to Graph;
wenzelm
parents:
31901
diff
changeset
|
2606 |
|
31901 | 2607 |
* Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY. |
2608 |
||
33842 | 2609 |
* Renamed several structures FooBar to Foo_Bar. Occasional, |
2610 |
INCOMPATIBILITY. |
|
2611 |
||
33843 | 2612 |
* Operations of structure Skip_Proof no longer require quick_and_dirty |
2613 |
mode, which avoids critical setmp. |
|
2614 |
||
31306
a74ee84288a0
eliminated old Attrib.add_attributes (and Attrib.syntax);
wenzelm
parents:
31304
diff
changeset
|
2615 |
* Eliminated old Attrib.add_attributes, Method.add_methods and related |
33842 | 2616 |
combinators for "args". INCOMPATIBILITY, need to use simplified |
31306
a74ee84288a0
eliminated old Attrib.add_attributes (and Attrib.syntax);
wenzelm
parents:
31304
diff
changeset
|
2617 |
Attrib/Method.setup introduced in Isabelle2009. |
31304 | 2618 |
|
32151
2f65c45c2e7e
Proper context for simpset_of, claset_of, clasimpset_of.
wenzelm
parents:
32136
diff
changeset
|
2619 |
* Proper context for simpset_of, claset_of, clasimpset_of. May fall |
2f65c45c2e7e
Proper context for simpset_of, claset_of, clasimpset_of.
wenzelm
parents:
32136
diff
changeset
|
2620 |
back on global_simpset_of, global_claset_of, global_clasimpset_of as |
2f65c45c2e7e
Proper context for simpset_of, claset_of, clasimpset_of.
wenzelm
parents:
32136
diff
changeset
|
2621 |
last resort. INCOMPATIBILITY. |
2f65c45c2e7e
Proper context for simpset_of, claset_of, clasimpset_of.
wenzelm
parents:
32136
diff
changeset
|
2622 |
|
32092
6a5995438266
Display.pretty_thm now requires a proper context;
wenzelm
parents:
32079
diff
changeset
|
2623 |
* Display.pretty_thm now requires a proper context (cf. former |
6a5995438266
Display.pretty_thm now requires a proper context;
wenzelm
parents:
32079
diff
changeset
|
2624 |
ProofContext.pretty_thm). May fall back on Display.pretty_thm_global |
6a5995438266
Display.pretty_thm now requires a proper context;
wenzelm
parents:
32079
diff
changeset
|
2625 |
or even Display.pretty_thm_without_context as last resort. |
6a5995438266
Display.pretty_thm now requires a proper context;
wenzelm
parents:
32079
diff
changeset
|
2626 |
INCOMPATIBILITY. |
6a5995438266
Display.pretty_thm now requires a proper context;
wenzelm
parents:
32079
diff
changeset
|
2627 |
|
32433 | 2628 |
* Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use |
2629 |
Syntax.pretty_typ/term directly, preferably with proper context |
|
2630 |
instead of global theory. |
|
2631 |
||
31304 | 2632 |
|
31308 | 2633 |
*** System *** |
2634 |
||
33842 | 2635 |
* Further fine tuning of parallel proof checking, scales up to 8 cores |
2636 |
(max. speedup factor 5.0). See also Goal.parallel_proofs in ML and |
|
2637 |
usedir option -q. |
|
2638 |
||
32326 | 2639 |
* Support for additional "Isabelle components" via etc/components, see |
2640 |
also the system manual. |
|
2641 |
||
2642 |
* The isabelle makeall tool now operates on all components with |
|
2643 |
IsaMakefile, not just hardwired "logics". |
|
2644 |
||
33842 | 2645 |
* Removed "compress" option from isabelle-process and isabelle usedir; |
2646 |
this is always enabled. |
|
33818 | 2647 |
|
31308 | 2648 |
* Discontinued support for Poly/ML 4.x versions. |
2649 |
||
33842 | 2650 |
* Isabelle tool "wwwfind" provides web interface for 'find_theorems' |
2651 |
on a given logic image. This requires the lighttpd webserver and is |
|
2652 |
currently supported on Linux only. |
|
32061
11f8ee55662d
parallel_proofs: more fine-grained control with optional parallel checking of nested Isar proofs;
wenzelm
parents:
31997
diff
changeset
|
2653 |
|
31308 | 2654 |
|
31304 | 2655 |
|
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2656 |
New in Isabelle2009 (April 2009) |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2657 |
-------------------------------- |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
2658 |
|
27599 | 2659 |
*** General *** |
2660 |
||
28504
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
2661 |
* Simplified main Isabelle executables, with less surprises on |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
2662 |
case-insensitive file-systems (such as Mac OS). |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
2663 |
|
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
2664 |
- The main Isabelle tool wrapper is now called "isabelle" instead of |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
2665 |
"isatool." |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
2666 |
|
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
2667 |
- The former "isabelle" alias for "isabelle-process" has been |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
2668 |
removed (should rarely occur to regular users). |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
2669 |
|
28915
0642cbb60c98
removed obsolete isabelle-interface executable and ISABELLE_INTERFACE setting;
wenzelm
parents:
28914
diff
changeset
|
2670 |
- The former "isabelle-interface" and its alias "Isabelle" have been |
0642cbb60c98
removed obsolete isabelle-interface executable and ISABELLE_INTERFACE setting;
wenzelm
parents:
28914
diff
changeset
|
2671 |
removed (interfaces are now regular Isabelle tools). |
28504
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
2672 |
|
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
2673 |
Within scripts and make files, the Isabelle environment variables |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
2674 |
ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE, |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
2675 |
respectively. (The latter are still available as legacy feature.) |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
2676 |
|
28915
0642cbb60c98
removed obsolete isabelle-interface executable and ISABELLE_INTERFACE setting;
wenzelm
parents:
28914
diff
changeset
|
2677 |
The old isabelle-interface wrapper could react in confusing ways if |
0642cbb60c98
removed obsolete isabelle-interface executable and ISABELLE_INTERFACE setting;
wenzelm
parents:
28914
diff
changeset
|
2678 |
the interface was uninstalled or changed otherwise. Individual |
0642cbb60c98
removed obsolete isabelle-interface executable and ISABELLE_INTERFACE setting;
wenzelm
parents:
28914
diff
changeset
|
2679 |
interface tool configuration is now more explicit, see also the |
0642cbb60c98
removed obsolete isabelle-interface executable and ISABELLE_INTERFACE setting;
wenzelm
parents:
28914
diff
changeset
|
2680 |
Isabelle system manual. In particular, Proof General is now available |
0642cbb60c98
removed obsolete isabelle-interface executable and ISABELLE_INTERFACE setting;
wenzelm
parents:
28914
diff
changeset
|
2681 |
via "isabelle emacs". |
28504
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
2682 |
|
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
2683 |
INCOMPATIBILITY, need to adapt derivative scripts. Users may need to |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
2684 |
purge installed copies of Isabelle executables and re-run "isabelle |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
2685 |
install -p ...", or use symlinks. |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
2686 |
|
28914
f993cbffc42a
default for ISABELLE_HOME_USER is now ~/.isabelle instead of ~/isabelle;
wenzelm
parents:
28856
diff
changeset
|
2687 |
* The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the |
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2688 |
old ~/isabelle, which was slightly non-standard and apt to cause |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2689 |
surprises on case-insensitive file-systems (such as Mac OS). |
28914
f993cbffc42a
default for ISABELLE_HOME_USER is now ~/.isabelle instead of ~/isabelle;
wenzelm
parents:
28856
diff
changeset
|
2690 |
|
f993cbffc42a
default for ISABELLE_HOME_USER is now ~/.isabelle instead of ~/isabelle;
wenzelm
parents:
28856
diff
changeset
|
2691 |
INCOMPATIBILITY, need to move existing ~/isabelle/etc, |
f993cbffc42a
default for ISABELLE_HOME_USER is now ~/.isabelle instead of ~/isabelle;
wenzelm
parents:
28856
diff
changeset
|
2692 |
~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special |
f993cbffc42a
default for ISABELLE_HOME_USER is now ~/.isabelle instead of ~/isabelle;
wenzelm
parents:
28856
diff
changeset
|
2693 |
care is required when using older releases of Isabelle. Note that |
f993cbffc42a
default for ISABELLE_HOME_USER is now ~/.isabelle instead of ~/isabelle;
wenzelm
parents:
28856
diff
changeset
|
2694 |
ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any |
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2695 |
Isabelle distribution, in order to use the new ~/.isabelle uniformly. |
28914
f993cbffc42a
default for ISABELLE_HOME_USER is now ~/.isabelle instead of ~/isabelle;
wenzelm
parents:
28856
diff
changeset
|
2696 |
|
29161
9903e84a9c9c
* Proofs of are run in parallel on multi-core systems;
wenzelm
parents:
29145
diff
changeset
|
2697 |
* Proofs of fully specified statements are run in parallel on |
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2698 |
multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2699 |
a regular 4-core machine, if the initial heap space is made reasonably |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2700 |
large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.) |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2701 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2702 |
* The main reference manuals ("isar-ref", "implementation", and |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2703 |
"system") have been updated and extended. Formally checked references |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2704 |
as hyperlinks are now available uniformly. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2705 |
|
30163
faf95eb3f375
* New prover for coherent logic (see src/Tools/coherent.ML).
wenzelm
parents:
30106
diff
changeset
|
2706 |
|
27599 | 2707 |
*** Pure *** |
2708 |
||
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2709 |
* Complete re-implementation of locales. INCOMPATIBILITY in several |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2710 |
respects. The most important changes are listed below. See the |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2711 |
Tutorial on Locales ("locales" manual) for details. |
29253 | 2712 |
|
2713 |
- In locale expressions, instantiation replaces renaming. Parameters |
|
2714 |
must be declared in a for clause. To aid compatibility with previous |
|
2715 |
parameter inheritance, in locale declarations, parameters that are not |
|
2716 |
'touched' (instantiation position "_" or omitted) are implicitly added |
|
2717 |
with their syntax at the beginning of the for clause. |
|
2718 |
||
2719 |
- Syntax from abbreviations and definitions in locales is available in |
|
2720 |
locale expressions and context elements. The latter is particularly |
|
2721 |
useful in locale declarations. |
|
2722 |
||
2723 |
- More flexible mechanisms to qualify names generated by locale |
|
2724 |
expressions. Qualifiers (prefixes) may be specified in locale |
|
30728
f0aeca99b5d9
interpretation/interpret: prefixes are mandatory by default;
wenzelm
parents:
30706
diff
changeset
|
2725 |
expressions, and can be marked as mandatory (syntax: "name!:") or |
f0aeca99b5d9
interpretation/interpret: prefixes are mandatory by default;
wenzelm
parents:
30706
diff
changeset
|
2726 |
optional (syntax "name?:"). The default depends for plain "name:" |
f0aeca99b5d9
interpretation/interpret: prefixes are mandatory by default;
wenzelm
parents:
30706
diff
changeset
|
2727 |
depends on the situation where a locale expression is used: in |
f0aeca99b5d9
interpretation/interpret: prefixes are mandatory by default;
wenzelm
parents:
30706
diff
changeset
|
2728 |
commands 'locale' and 'sublocale' prefixes are optional, in |
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2729 |
'interpretation' and 'interpret' prefixes are mandatory. The old |
30728
f0aeca99b5d9
interpretation/interpret: prefixes are mandatory by default;
wenzelm
parents:
30706
diff
changeset
|
2730 |
implicit qualifiers derived from the parameter names of a locale are |
f0aeca99b5d9
interpretation/interpret: prefixes are mandatory by default;
wenzelm
parents:
30706
diff
changeset
|
2731 |
no longer generated. |
30106 | 2732 |
|
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2733 |
- Command "sublocale l < e" replaces "interpretation l < e". The |
30106 | 2734 |
instantiation clause in "interpretation" and "interpret" (square |
2735 |
brackets) is no longer available. Use locale expressions. |
|
29253 | 2736 |
|
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2737 |
- When converting proof scripts, mandatory qualifiers in |
30728
f0aeca99b5d9
interpretation/interpret: prefixes are mandatory by default;
wenzelm
parents:
30706
diff
changeset
|
2738 |
'interpretation' and 'interpret' should be retained by default, even |
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2739 |
if this is an INCOMPATIBILITY compared to former behavior. In the |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2740 |
worst case, use the "name?:" form for non-mandatory ones. Qualifiers |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2741 |
in locale expressions range over a single locale instance only. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2742 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2743 |
- Dropped locale element "includes". This is a major INCOMPATIBILITY. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2744 |
In existing theorem specifications replace the includes element by the |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2745 |
respective context elements of the included locale, omitting those |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2746 |
that are already present in the theorem specification. Multiple |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2747 |
assume elements of a locale should be replaced by a single one |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2748 |
involving the locale predicate. In the proof body, declarations (most |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2749 |
notably theorems) may be regained by interpreting the respective |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2750 |
locales in the proof context as required (command "interpret"). |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2751 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2752 |
If using "includes" in replacement of a target solely because the |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2753 |
parameter types in the theorem are not as general as in the target, |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2754 |
consider declaring a new locale with additional type constraints on |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2755 |
the parameters (context element "constrains"). |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2756 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2757 |
- Discontinued "locale (open)". INCOMPATIBILITY. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2758 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2759 |
- Locale interpretation commands no longer attempt to simplify goal. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2760 |
INCOMPATIBILITY: in rare situations the generated goal differs. Use |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2761 |
methods intro_locales and unfold_locales to clarify. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2762 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2763 |
- Locale interpretation commands no longer accept interpretation |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2764 |
attributes. INCOMPATIBILITY. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2765 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2766 |
* Class declaration: so-called "base sort" must not be given in import |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2767 |
list any longer, but is inferred from the specification. Particularly |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2768 |
in HOL, write |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2769 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2770 |
class foo = ... |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2771 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2772 |
instead of |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2773 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2774 |
class foo = type + ... |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2775 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2776 |
* Class target: global versions of theorems stemming do not carry a |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2777 |
parameter prefix any longer. INCOMPATIBILITY. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2778 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2779 |
* Class 'instance' command no longer accepts attached definitions. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2780 |
INCOMPATIBILITY, use proper 'instantiation' target instead. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2781 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2782 |
* Recovered hiding of consts, which was accidentally broken in |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2783 |
Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2784 |
makes c inaccessible; consider using ``hide (open) const c'' instead. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2785 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2786 |
* Slightly more coherent Pure syntax, with updated documentation in |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2787 |
isar-ref manual. Removed locales meta_term_syntax and |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2788 |
meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent, |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2789 |
INCOMPATIBILITY in rare situations. Note that &&& should not be used |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2790 |
directly in regular applications. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2791 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2792 |
* There is a new syntactic category "float_const" for signed decimal |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2793 |
fractions (e.g. 123.45 or -123.45). |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2794 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2795 |
* Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2796 |
interface with 'setup' command instead. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2797 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2798 |
* Command 'local_setup' is similar to 'setup', but operates on a local |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2799 |
theory context. |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
2800 |
|
28114 | 2801 |
* The 'axiomatization' command now only works within a global theory |
2802 |
context. INCOMPATIBILITY. |
|
2803 |
||
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2804 |
* Goal-directed proof now enforces strict proof irrelevance wrt. sort |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2805 |
hypotheses. Sorts required in the course of reasoning need to be |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2806 |
covered by the constraints in the initial statement, completed by the |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2807 |
type instance information of the background theory. Non-trivial sort |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2808 |
hypotheses, which rarely occur in practice, may be specified via |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2809 |
vacuous propositions of the form SORT_CONSTRAINT('a::c). For example: |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2810 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2811 |
lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ... |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2812 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2813 |
The result contains an implicit sort hypotheses as before -- |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2814 |
SORT_CONSTRAINT premises are eliminated as part of the canonical rule |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2815 |
normalization. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2816 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2817 |
* Generalized Isar history, with support for linear undo, direct state |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2818 |
addressing etc. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2819 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2820 |
* Changed defaults for unify configuration options: |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2821 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2822 |
unify_trace_bound = 50 (formerly 25) |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2823 |
unify_search_bound = 60 (formerly 30) |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2824 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2825 |
* Different bookkeeping for code equations (INCOMPATIBILITY): |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2826 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2827 |
a) On theory merge, the last set of code equations for a particular |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2828 |
constant is taken (in accordance with the policy applied by other |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2829 |
parts of the code generator framework). |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2830 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2831 |
b) Code equations stemming from explicit declarations (e.g. code |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2832 |
attribute) gain priority over default code equations stemming |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2833 |
from definition, primrec, fun etc. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2834 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2835 |
* Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2836 |
|
30965 | 2837 |
* Unified theorem tables for both code generators. Thus [code |
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2838 |
func] has disappeared and only [code] remains. INCOMPATIBILITY. |
30577 | 2839 |
|
2840 |
* Command 'find_consts' searches for constants based on type and name |
|
2841 |
patterns, e.g. |
|
29883 | 2842 |
|
2843 |
find_consts "_ => bool" |
|
2844 |
||
30106 | 2845 |
By default, matching is against subtypes, but it may be restricted to |
30728
f0aeca99b5d9
interpretation/interpret: prefixes are mandatory by default;
wenzelm
parents:
30706
diff
changeset
|
2846 |
the whole type. Searching by name is possible. Multiple queries are |
30106 | 2847 |
conjunctive and queries may be negated by prefixing them with a |
2848 |
hyphen: |
|
29883 | 2849 |
|
2850 |
find_consts strict: "_ => bool" name: "Int" -"int => int" |
|
29861
3c348f5873f3
updated NEWS etc with "solves" criterion and auto_solves
kleing
parents:
29823
diff
changeset
|
2851 |
|
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2852 |
* New 'find_theorems' criterion "solves" matches theorems that |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2853 |
directly solve the current goal (modulo higher-order unification). |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2854 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2855 |
* Auto solve feature for main theorem statements: whenever a new goal |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2856 |
is stated, "find_theorems solves" is called; any theorems that could |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2857 |
solve the lemma directly are listed as part of the goal state. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2858 |
Cf. associated options in Proof General Isabelle settings menu, |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2859 |
enabled by default, with reasonable timeout for pathological cases of |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2860 |
higher-order unification. |
30415
9501af91c4a3
Instead of giving up entirely, arith now ignores all inequalities when there are too many.
webertj
parents:
30399
diff
changeset
|
2861 |
|
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
2862 |
|
27381 | 2863 |
*** Document preparation *** |
2864 |
||
2865 |
* Antiquotation @{lemma} now imitates a regular terminal proof, |
|
27392 | 2866 |
demanding keyword 'by' and supporting the full method expression |
27519
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset
|
2867 |
syntax just like the Isar command 'by'. |
27381 | 2868 |
|
2869 |
||
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
2870 |
*** HOL *** |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
2871 |
|
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2872 |
* Integrated main parts of former image HOL-Complex with HOL. Entry |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2873 |
points Main and Complex_Main remain as before. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2874 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2875 |
* Logic image HOL-Plain provides a minimal HOL with the most important |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2876 |
tools available (inductive, datatype, primrec, ...). This facilitates |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2877 |
experimentation and tool development. Note that user applications |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2878 |
(and library theories) should never refer to anything below theory |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2879 |
Main, as before. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2880 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2881 |
* Logic image HOL-Main stops at theory Main, and thus facilitates |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2882 |
experimentation due to shorter build times. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2883 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2884 |
* Logic image HOL-NSA contains theories of nonstandard analysis which |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2885 |
were previously part of former HOL-Complex. Entry point Hyperreal |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2886 |
remains valid, but theories formerly using Complex_Main should now use |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2887 |
new entry point Hypercomplex. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2888 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2889 |
* Generic ATP manager for Sledgehammer, based on ML threads instead of |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2890 |
Posix processes. Avoids potentially expensive forking of the ML |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2891 |
process. New thread-based implementation also works on non-Unix |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2892 |
platforms (Cygwin). Provers are no longer hardwired, but defined |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2893 |
within the theory via plain ML wrapper functions. Basic Sledgehammer |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2894 |
commands are covered in the isar-ref manual. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2895 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2896 |
* Wrapper scripts for remote SystemOnTPTP service allows to use |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2897 |
sledgehammer without local ATP installation (Vampire etc.). Other |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2898 |
provers may be included via suitable ML wrappers, see also |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2899 |
src/HOL/ATP_Linkup.thy. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2900 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2901 |
* ATP selection (E/Vampire/Spass) is now via Proof General's settings |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2902 |
menu. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2903 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2904 |
* The metis method no longer fails because the theorem is too trivial |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2905 |
(contains the empty clause). |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2906 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2907 |
* The metis method now fails in the usual manner, rather than raising |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2908 |
an exception, if it determines that it cannot prove the theorem. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2909 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2910 |
* Method "coherent" implements a prover for coherent logic (see also |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2911 |
src/Tools/coherent.ML). |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2912 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2913 |
* Constants "undefined" and "default" replace "arbitrary". Usually |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2914 |
"undefined" is the right choice to replace "arbitrary", though |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2915 |
logically there is no difference. INCOMPATIBILITY. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2916 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2917 |
* Command "value" now integrates different evaluation mechanisms. The |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2918 |
result of the first successful evaluation mechanism is printed. In |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2919 |
square brackets a particular named evaluation mechanisms may be |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2920 |
specified (currently, [SML], [code] or [nbe]). See further |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2921 |
src/HOL/ex/Eval_Examples.thy. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2922 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2923 |
* Normalization by evaluation now allows non-leftlinear equations. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2924 |
Declare with attribute [code nbe]. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2925 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2926 |
* Methods "case_tac" and "induct_tac" now refer to the very same rules |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2927 |
as the structured Isar versions "cases" and "induct", cf. the |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2928 |
corresponding "cases" and "induct" attributes. Mutual induction rules |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2929 |
are now presented as a list of individual projections |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2930 |
(e.g. foo_bar.inducts for types foo and bar); the old format with |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2931 |
explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2932 |
rare situations a different rule is selected --- notably nested tuple |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2933 |
elimination instead of former prod.exhaust: use explicit (case_tac t |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2934 |
rule: prod.exhaust) here. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2935 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2936 |
* Attributes "cases", "induct", "coinduct" support "del" option. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2937 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2938 |
* Removed fact "case_split_thm", which duplicates "case_split". |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2939 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2940 |
* The option datatype has been moved to a new theory Option. Renamed |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2941 |
option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2942 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2943 |
* New predicate "strict_mono" classifies strict functions on partial |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2944 |
orders. With strict functions on linear orders, reasoning about |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2945 |
(in)equalities is facilitated by theorems "strict_mono_eq", |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2946 |
"strict_mono_less_eq" and "strict_mono_less". |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2947 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2948 |
* Some set operations are now proper qualified constants with |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2949 |
authentic syntax. INCOMPATIBILITY: |
30304
d8e4cd2ac2a1
set operations Int, Un, INTER, UNION, Inter, Union, empty, UNIV are now proper qualified constants with authentic syntax
haftmann
parents:
30085
diff
changeset
|
2950 |
|
d8e4cd2ac2a1
set operations Int, Un, INTER, UNION, Inter, Union, empty, UNIV are now proper qualified constants with authentic syntax
haftmann
parents:
30085
diff
changeset
|
2951 |
op Int ~> Set.Int |
d8e4cd2ac2a1
set operations Int, Un, INTER, UNION, Inter, Union, empty, UNIV are now proper qualified constants with authentic syntax
haftmann
parents:
30085
diff
changeset
|
2952 |
op Un ~> Set.Un |
d8e4cd2ac2a1
set operations Int, Un, INTER, UNION, Inter, Union, empty, UNIV are now proper qualified constants with authentic syntax
haftmann
parents:
30085
diff
changeset
|
2953 |
INTER ~> Set.INTER |
d8e4cd2ac2a1
set operations Int, Un, INTER, UNION, Inter, Union, empty, UNIV are now proper qualified constants with authentic syntax
haftmann
parents:
30085
diff
changeset
|
2954 |
UNION ~> Set.UNION |
d8e4cd2ac2a1
set operations Int, Un, INTER, UNION, Inter, Union, empty, UNIV are now proper qualified constants with authentic syntax
haftmann
parents:
30085
diff
changeset
|
2955 |
Inter ~> Set.Inter |
d8e4cd2ac2a1
set operations Int, Un, INTER, UNION, Inter, Union, empty, UNIV are now proper qualified constants with authentic syntax
haftmann
parents:
30085
diff
changeset
|
2956 |
Union ~> Set.Union |
d8e4cd2ac2a1
set operations Int, Un, INTER, UNION, Inter, Union, empty, UNIV are now proper qualified constants with authentic syntax
haftmann
parents:
30085
diff
changeset
|
2957 |
{} ~> Set.empty |
d8e4cd2ac2a1
set operations Int, Un, INTER, UNION, Inter, Union, empty, UNIV are now proper qualified constants with authentic syntax
haftmann
parents:
30085
diff
changeset
|
2958 |
UNIV ~> Set.UNIV |
d8e4cd2ac2a1
set operations Int, Un, INTER, UNION, Inter, Union, empty, UNIV are now proper qualified constants with authentic syntax
haftmann
parents:
30085
diff
changeset
|
2959 |
|
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2960 |
* Class complete_lattice with operations Inf, Sup, INFI, SUPR now in |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2961 |
theory Set. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2962 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2963 |
* Auxiliary class "itself" has disappeared -- classes without any |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2964 |
parameter are treated as expected by the 'class' command. |
29797 | 2965 |
|
29823
0ab754d13ccd
session Reflecion renamed to Decision_Procs, moved Dense_Linear_Order there
haftmann
parents:
29810
diff
changeset
|
2966 |
* Leibnitz's Series for Pi and the arcus tangens and logarithm series. |
0ab754d13ccd
session Reflecion renamed to Decision_Procs, moved Dense_Linear_Order there
haftmann
parents:
29810
diff
changeset
|
2967 |
|
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2968 |
* Common decision procedures (Cooper, MIR, Ferrack, Approximation, |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2969 |
Dense_Linear_Order) are now in directory HOL/Decision_Procs. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2970 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2971 |
* Theory src/HOL/Decision_Procs/Approximation provides the new proof |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2972 |
method "approximation". It proves formulas on real values by using |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2973 |
interval arithmetic. In the formulas are also the transcendental |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2974 |
functions sin, cos, tan, atan, ln, exp and the constant pi are |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2975 |
allowed. For examples see |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2976 |
src/HOL/Descision_Procs/ex/Approximation_Ex.thy. |
29823
0ab754d13ccd
session Reflecion renamed to Decision_Procs, moved Dense_Linear_Order there
haftmann
parents:
29810
diff
changeset
|
2977 |
|
0ab754d13ccd
session Reflecion renamed to Decision_Procs, moved Dense_Linear_Order there
haftmann
parents:
29810
diff
changeset
|
2978 |
* Theory "Reflection" now resides in HOL/Library. |
29650 | 2979 |
|
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2980 |
* Entry point to Word library now simply named "Word". |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
2981 |
INCOMPATIBILITY. |
29628 | 2982 |
|
29197
6d4cb27ed19c
adapted HOL source structure to distribution layout
haftmann
parents:
29182
diff
changeset
|
2983 |
* Made source layout more coherent with logical distribution |
6d4cb27ed19c
adapted HOL source structure to distribution layout
haftmann
parents:
29182
diff
changeset
|
2984 |
structure: |
28952
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
2985 |
|
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
2986 |
src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
2987 |
src/HOL/Library/Code_Message.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
2988 |
src/HOL/Library/GCD.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
2989 |
src/HOL/Library/Order_Relation.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
2990 |
src/HOL/Library/Parity.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
2991 |
src/HOL/Library/Univ_Poly.thy ~> src/HOL/ |
30176
78610979b3c6
add news for HOLCF; fixed some typos and inaccuracies
huffman
parents:
30163
diff
changeset
|
2992 |
src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/ |
28952
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
2993 |
src/HOL/Real/Lubs.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
2994 |
src/HOL/Real/PReal.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
2995 |
src/HOL/Real/Rational.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
2996 |
src/HOL/Real/RComplete.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
2997 |
src/HOL/Real/RealDef.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
2998 |
src/HOL/Real/RealPow.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
2999 |
src/HOL/Real/Real.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3000 |
src/HOL/Complex/Complex_Main.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3001 |
src/HOL/Complex/Complex.thy ~> src/HOL/ |
30176
78610979b3c6
add news for HOLCF; fixed some typos and inaccuracies
huffman
parents:
30163
diff
changeset
|
3002 |
src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/ |
78610979b3c6
add news for HOLCF; fixed some typos and inaccuracies
huffman
parents:
30163
diff
changeset
|
3003 |
src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/ |
28952
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3004 |
src/HOL/Hyperreal/Deriv.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3005 |
src/HOL/Hyperreal/Fact.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3006 |
src/HOL/Hyperreal/Integration.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3007 |
src/HOL/Hyperreal/Lim.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3008 |
src/HOL/Hyperreal/Ln.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3009 |
src/HOL/Hyperreal/Log.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3010 |
src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3011 |
src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3012 |
src/HOL/Hyperreal/Series.thy ~> src/HOL/ |
29197
6d4cb27ed19c
adapted HOL source structure to distribution layout
haftmann
parents:
29182
diff
changeset
|
3013 |
src/HOL/Hyperreal/SEQ.thy ~> src/HOL/ |
28952
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3014 |
src/HOL/Hyperreal/Taylor.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3015 |
src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/ |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3016 |
src/HOL/Real/Float ~> src/HOL/Library/ |
29197
6d4cb27ed19c
adapted HOL source structure to distribution layout
haftmann
parents:
29182
diff
changeset
|
3017 |
src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach |
6d4cb27ed19c
adapted HOL source structure to distribution layout
haftmann
parents:
29182
diff
changeset
|
3018 |
src/HOL/Real/RealVector.thy ~> src/HOL/ |
28952
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3019 |
|
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3020 |
src/HOL/arith_data.ML ~> src/HOL/Tools |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3021 |
src/HOL/hologic.ML ~> src/HOL/Tools |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3022 |
src/HOL/simpdata.ML ~> src/HOL/Tools |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3023 |
src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3024 |
src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3025 |
src/HOL/nat_simprocs.ML ~> src/HOL/Tools |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3026 |
src/HOL/Real/float_arith.ML ~> src/HOL/Tools |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3027 |
src/HOL/Real/float_syntax.ML ~> src/HOL/Tools |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3028 |
src/HOL/Real/rat_arith.ML ~> src/HOL/Tools |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3029 |
src/HOL/Real/real_arith.ML ~> src/HOL/Tools |
15a4b2cf8c34
made repository layout more coherent with logical distribution structure; stripped some $Id$s
haftmann
parents:
28915
diff
changeset
|
3030 |
|
29398 | 3031 |
src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL |
3032 |
src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL |
|
3033 |
src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL |
|
3034 |
src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL |
|
3035 |
src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL |
|
3036 |
src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL |
|
3037 |
||
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3038 |
* If methods "eval" and "evaluation" encounter a structured proof |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3039 |
state with !!/==>, only the conclusion is evaluated to True (if |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3040 |
possible), avoiding strange error messages. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3041 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3042 |
* Method "sizechange" automates termination proofs using (a |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3043 |
modification of) the size-change principle. Requires SAT solver. See |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3044 |
src/HOL/ex/Termination.thy for examples. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3045 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3046 |
* Simplifier: simproc for let expressions now unfolds if bound |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3047 |
variable occurs at most once in let expression body. INCOMPATIBILITY. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3048 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3049 |
* Method "arith": Linear arithmetic now ignores all inequalities when |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3050 |
fast_arith_neq_limit is exceeded, instead of giving up entirely. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3051 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3052 |
* New attribute "arith" for facts that should always be used |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3053 |
automatically by arithmetic. It is intended to be used locally in |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3054 |
proofs, e.g. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3055 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3056 |
assumes [arith]: "x > 0" |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3057 |
|
30706 | 3058 |
Global usage is discouraged because of possible performance impact. |
3059 |
||
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3060 |
* New classes "top" and "bot" with corresponding operations "top" and |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3061 |
"bot" in theory Orderings; instantiation of class "complete_lattice" |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3062 |
requires instantiation of classes "top" and "bot". INCOMPATIBILITY. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3063 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3064 |
* Changed definition lemma "less_fun_def" in order to provide an |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3065 |
instance for preorders on functions; use lemma "less_le" instead. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3066 |
INCOMPATIBILITY. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3067 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3068 |
* Theory Orderings: class "wellorder" moved here, with explicit |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3069 |
induction rule "less_induct" as assumption. For instantiation of |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3070 |
"wellorder" by means of predicate "wf", use rule wf_wellorderI. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3071 |
INCOMPATIBILITY. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3072 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3073 |
* Theory Orderings: added class "preorder" as superclass of "order". |
27793 | 3074 |
INCOMPATIBILITY: Instantiation proofs for order, linorder |
3075 |
etc. slightly changed. Some theorems named order_class.* now named |
|
3076 |
preorder_class.*. |
|
3077 |
||
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3078 |
* Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl, |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3079 |
"diag" to "Id_on". |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3080 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3081 |
* Theory Finite_Set: added a new fold combinator of type |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3082 |
|
28855 | 3083 |
('a => 'b => 'b) => 'b => 'a set => 'b |
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3084 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3085 |
Occasionally this is more convenient than the old fold combinator |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3086 |
which is now defined in terms of the new one and renamed to |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3087 |
fold_image. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3088 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3089 |
* Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps" |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3090 |
and "ring_simps" have been replaced by "algebra_simps" (which can be |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3091 |
extended with further lemmas!). At the moment both still exist but |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3092 |
the former will disappear at some point. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3093 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3094 |
* Theory Power: Lemma power_Suc is now declared as a simp rule in |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3095 |
class recpower. Type-specific simp rules for various recpower types |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3096 |
have been removed. INCOMPATIBILITY, rename old lemmas as follows: |
30273
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
30250
diff
changeset
|
3097 |
|
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
30250
diff
changeset
|
3098 |
rat_power_0 -> power_0 |
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
30250
diff
changeset
|
3099 |
rat_power_Suc -> power_Suc |
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
30250
diff
changeset
|
3100 |
realpow_0 -> power_0 |
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
30250
diff
changeset
|
3101 |
realpow_Suc -> power_Suc |
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
30250
diff
changeset
|
3102 |
complexpow_0 -> power_0 |
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
30250
diff
changeset
|
3103 |
complexpow_Suc -> power_Suc |
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
30250
diff
changeset
|
3104 |
power_poly_0 -> power_0 |
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
30250
diff
changeset
|
3105 |
power_poly_Suc -> power_Suc |
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
30250
diff
changeset
|
3106 |
|
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3107 |
* Theories Ring_and_Field and Divides: Definition of "op dvd" has been |
27793 | 3108 |
moved to separate class dvd in Ring_and_Field; a couple of lemmas on |
3109 |
dvd has been generalized to class comm_semiring_1. Likewise a bunch |
|
3110 |
of lemmas from Divides has been generalized from nat to class |
|
3111 |
semiring_div. INCOMPATIBILITY. This involves the following theorem |
|
3112 |
renames resulting from duplicate elimination: |
|
27651
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
3113 |
|
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
3114 |
dvd_def_mod ~> dvd_eq_mod_eq_0 |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
3115 |
zero_dvd_iff ~> dvd_0_left_iff |
28559 | 3116 |
dvd_0 ~> dvd_0_right |
27651
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
3117 |
DIVISION_BY_ZERO_DIV ~> div_by_0 |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
3118 |
DIVISION_BY_ZERO_MOD ~> mod_by_0 |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
3119 |
mult_div ~> div_mult_self2_is_id |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
3120 |
mult_mod ~> mod_mult_self2_is_0 |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
3121 |
|
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3122 |
* Theory IntDiv: removed many lemmas that are instances of class-based |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3123 |
generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY, |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3124 |
rename old lemmas as follows: |
30044 | 3125 |
|
3126 |
dvd_diff -> nat_dvd_diff |
|
3127 |
dvd_zminus_iff -> dvd_minus_iff |
|
30224 | 3128 |
mod_add1_eq -> mod_add_eq |
3129 |
mod_mult1_eq -> mod_mult_right_eq |
|
3130 |
mod_mult1_eq' -> mod_mult_left_eq |
|
3131 |
mod_mult_distrib_mod -> mod_mult_eq |
|
30044 | 3132 |
nat_mod_add_left_eq -> mod_add_left_eq |
3133 |
nat_mod_add_right_eq -> mod_add_right_eq |
|
3134 |
nat_mod_div_trivial -> mod_div_trivial |
|
3135 |
nat_mod_mod_trivial -> mod_mod_trivial |
|
3136 |
zdiv_zadd_self1 -> div_add_self1 |
|
3137 |
zdiv_zadd_self2 -> div_add_self2 |
|
30181 | 3138 |
zdiv_zmult_self1 -> div_mult_self2_is_id |
30044 | 3139 |
zdiv_zmult_self2 -> div_mult_self1_is_id |
3140 |
zdvd_triv_left -> dvd_triv_left |
|
3141 |
zdvd_triv_right -> dvd_triv_right |
|
3142 |
zdvd_zmult_cancel_disj -> dvd_mult_cancel_left |
|
30085 | 3143 |
zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric] |
30044 | 3144 |
zmod_zadd_left_eq -> mod_add_left_eq |
3145 |
zmod_zadd_right_eq -> mod_add_right_eq |
|
3146 |
zmod_zadd_self1 -> mod_add_self1 |
|
3147 |
zmod_zadd_self2 -> mod_add_self2 |
|
30224 | 3148 |
zmod_zadd1_eq -> mod_add_eq |
30044 | 3149 |
zmod_zdiff1_eq -> mod_diff_eq |
3150 |
zmod_zdvd_zmod -> mod_mod_cancel |
|
3151 |
zmod_zmod_cancel -> mod_mod_cancel |
|
3152 |
zmod_zmult_self1 -> mod_mult_self2_is_0 |
|
3153 |
zmod_zmult_self2 -> mod_mult_self1_is_0 |
|
3154 |
zmod_1 -> mod_by_1 |
|
3155 |
zdiv_1 -> div_by_1 |
|
3156 |
zdvd_abs1 -> abs_dvd_iff |
|
3157 |
zdvd_abs2 -> dvd_abs_iff |
|
3158 |
zdvd_refl -> dvd_refl |
|
3159 |
zdvd_trans -> dvd_trans |
|
3160 |
zdvd_zadd -> dvd_add |
|
3161 |
zdvd_zdiff -> dvd_diff |
|
3162 |
zdvd_zminus_iff -> dvd_minus_iff |
|
3163 |
zdvd_zminus2_iff -> minus_dvd_iff |
|
3164 |
zdvd_zmultD -> dvd_mult_right |
|
3165 |
zdvd_zmultD2 -> dvd_mult_left |
|
3166 |
zdvd_zmult_mono -> mult_dvd_mono |
|
3167 |
zdvd_0_right -> dvd_0_right |
|
3168 |
zdvd_0_left -> dvd_0_left_iff |
|
3169 |
zdvd_1_left -> one_dvd |
|
3170 |
zminus_dvd_iff -> minus_dvd_iff |
|
3171 |
||
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3172 |
* Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3173 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3174 |
* The real numbers offer decimal input syntax: 12.34 is translated |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3175 |
into 1234/10^2. This translation is not reversed upon output. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3176 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3177 |
* Theory Library/Polynomial defines an abstract type 'a poly of |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3178 |
univariate polynomials with coefficients of type 'a. In addition to |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3179 |
the standard ring operations, it also supports div and mod. Code |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3180 |
generation is also supported, using list-style constructors. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3181 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3182 |
* Theory Library/Inner_Product defines a class of real_inner for real |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3183 |
inner product spaces, with an overloaded operation inner :: 'a => 'a |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3184 |
=> real. Class real_inner is a subclass of real_normed_vector from |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3185 |
theory RealVector. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3186 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3187 |
* Theory Library/Product_Vector provides instances for the product |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3188 |
type 'a * 'b of several classes from RealVector and Inner_Product. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3189 |
Definitions of addition, subtraction, scalar multiplication, norms, |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3190 |
and inner products are included. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3191 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3192 |
* Theory Library/Bit defines the field "bit" of integers modulo 2. In |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3193 |
addition to the field operations, numerals and case syntax are also |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3194 |
supported. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3195 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3196 |
* Theory Library/Diagonalize provides constructive version of Cantor's |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3197 |
first diagonalization argument. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3198 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3199 |
* Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd, |
27599 | 3200 |
zlcm (for int); carried together from various gcd/lcm developements in |
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3201 |
the HOL Distribution. Constants zgcd and zlcm replace former igcd and |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3202 |
ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY, |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3203 |
may recover tupled syntax as follows: |
27556 | 3204 |
|
3205 |
hide (open) const gcd |
|
3206 |
abbreviation gcd where |
|
3207 |
"gcd == (%(a, b). GCD.gcd a b)" |
|
3208 |
notation (output) |
|
3209 |
GCD.gcd ("gcd '(_, _')") |
|
3210 |
||
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3211 |
The same works for lcm, zgcd, zlcm. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3212 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3213 |
* Theory Library/Nat_Infinity: added addition, numeral syntax and more |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3214 |
instantiations for algebraic structures. Removed some duplicate |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3215 |
theorems. Changes in simp rules. INCOMPATIBILITY. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3216 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3217 |
* ML antiquotation @{code} takes a constant as argument and generates |
27651
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
3218 |
corresponding code in background and inserts name of the corresponding |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
3219 |
resulting ML value/function/datatype constructor binding in place. |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
3220 |
All occurrences of @{code} with a single ML block are generated |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
3221 |
simultaneously. Provides a generic and safe interface for |
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3222 |
instrumentalizing code generation. See |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3223 |
src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3224 |
In future you ought to refrain from ad-hoc compiling generated SML |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3225 |
code on the ML toplevel. Note that (for technical reasons) @{code} |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3226 |
cannot refer to constants for which user-defined serializations are |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3227 |
set. Refer to the corresponding ML counterpart directly in that |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3228 |
cases. |
27122 | 3229 |
|
3230 |
* Command 'rep_datatype': instead of theorem names the command now |
|
3231 |
takes a list of terms denoting the constructors of the type to be |
|
3232 |
represented as datatype. The characteristic theorems have to be |
|
3233 |
proven. INCOMPATIBILITY. Also observe that the following theorems |
|
3234 |
have disappeared in favour of existing ones: |
|
3235 |
||
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
3236 |
unit_induct ~> unit.induct |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
3237 |
prod_induct ~> prod.induct |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
3238 |
sum_induct ~> sum.induct |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
3239 |
Suc_Suc_eq ~> nat.inject |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
3240 |
Suc_not_Zero Zero_not_Suc ~> nat.distinct |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
3241 |
|
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
3242 |
|
27696 | 3243 |
*** HOL-Algebra *** |
3244 |
||
27713
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset
|
3245 |
* New locales for orders and lattices where the equivalence relation |
30106 | 3246 |
is not restricted to equality. INCOMPATIBILITY: all order and lattice |
3247 |
locales use a record structure with field eq for the equivalence. |
|
27713
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset
|
3248 |
|
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset
|
3249 |
* New theory of factorial domains. |
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset
|
3250 |
|
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3251 |
* Units_l_inv and Units_r_inv are now simp rules by default. |
27696 | 3252 |
INCOMPATIBILITY. Simplifier proof that require deletion of l_inv |
3253 |
and/or r_inv will now also require deletion of these lemmas. |
|
3254 |
||
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3255 |
* Renamed the following theorems, INCOMPATIBILITY: |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3256 |
|
27696 | 3257 |
UpperD ~> Upper_memD |
3258 |
LowerD ~> Lower_memD |
|
3259 |
least_carrier ~> least_closed |
|
3260 |
greatest_carrier ~> greatest_closed |
|
3261 |
greatest_Lower_above ~> greatest_Lower_below |
|
27717
21bbd410ba04
Generalised polynomial lemmas from cring to ring.
ballarin
parents:
27713
diff
changeset
|
3262 |
one_zero ~> carrier_one_zero |
21bbd410ba04
Generalised polynomial lemmas from cring to ring.
ballarin
parents:
27713
diff
changeset
|
3263 |
one_not_zero ~> carrier_one_not_zero (collision with assumption) |
27696 | 3264 |
|
27793 | 3265 |
|
30849 | 3266 |
*** HOL-Nominal *** |
3267 |
||
30855 | 3268 |
* Nominal datatypes can now contain type-variables. |
3269 |
||
3270 |
* Commands 'nominal_inductive' and 'equivariance' work with local |
|
3271 |
theory targets. |
|
3272 |
||
3273 |
* Nominal primrec can now works with local theory targets and its |
|
3274 |
specification syntax now conforms to the general format as seen in |
|
3275 |
'inductive' etc. |
|
3276 |
||
3277 |
* Method "perm_simp" honours the standard simplifier attributes |
|
3278 |
(no_asm), (no_asm_use) etc. |
|
3279 |
||
3280 |
* The new predicate #* is defined like freshness, except that on the |
|
3281 |
left hand side can be a set or list of atoms. |
|
3282 |
||
3283 |
* Experimental command 'nominal_inductive2' derives strong induction |
|
3284 |
principles for inductive definitions. In contrast to |
|
3285 |
'nominal_inductive', which can only deal with a fixed number of |
|
3286 |
binders, it can deal with arbitrary expressions standing for sets of |
|
3287 |
atoms to be avoided. The only inductive definition we have at the |
|
3288 |
moment that needs this generalisation is the typing rule for Lets in |
|
3289 |
the algorithm W: |
|
3290 |
||
3291 |
Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma |
|
3292 |
----------------------------------------------------------------- |
|
3293 |
Gamma |- Let x be t1 in t2 : T2 |
|
3294 |
||
3295 |
In this rule one wants to avoid all the binders that are introduced by |
|
3296 |
"close Gamma T1". We are looking for other examples where this |
|
3297 |
feature might be useful. Please let us know. |
|
30849 | 3298 |
|
3299 |
||
30176
78610979b3c6
add news for HOLCF; fixed some typos and inaccuracies
huffman
parents:
30163
diff
changeset
|
3300 |
*** HOLCF *** |
78610979b3c6
add news for HOLCF; fixed some typos and inaccuracies
huffman
parents:
30163
diff
changeset
|
3301 |
|
78610979b3c6
add news for HOLCF; fixed some typos and inaccuracies
huffman
parents:
30163
diff
changeset
|
3302 |
* Reimplemented the simplification procedure for proving continuity |
78610979b3c6
add news for HOLCF; fixed some typos and inaccuracies
huffman
parents:
30163
diff
changeset
|
3303 |
subgoals. The new simproc is extensible; users can declare additional |
78610979b3c6
add news for HOLCF; fixed some typos and inaccuracies
huffman
parents:
30163
diff
changeset
|
3304 |
continuity introduction rules with the attribute [cont2cont]. |
78610979b3c6
add news for HOLCF; fixed some typos and inaccuracies
huffman
parents:
30163
diff
changeset
|
3305 |
|
78610979b3c6
add news for HOLCF; fixed some typos and inaccuracies
huffman
parents:
30163
diff
changeset
|
3306 |
* The continuity simproc now uses a different introduction rule for |
78610979b3c6
add news for HOLCF; fixed some typos and inaccuracies
huffman
parents:
30163
diff
changeset
|
3307 |
solving continuity subgoals on terms with lambda abstractions. In |
78610979b3c6
add news for HOLCF; fixed some typos and inaccuracies
huffman
parents:
30163
diff
changeset
|
3308 |
some rare cases the new simproc may fail to solve subgoals that the |
78610979b3c6
add news for HOLCF; fixed some typos and inaccuracies
huffman
parents:
30163
diff
changeset
|
3309 |
old one could solve, and "simp add: cont2cont_LAM" may be necessary. |
78610979b3c6
add news for HOLCF; fixed some typos and inaccuracies
huffman
parents:
30163
diff
changeset
|
3310 |
Potential INCOMPATIBILITY. |
78610979b3c6
add news for HOLCF; fixed some typos and inaccuracies
huffman
parents:
30163
diff
changeset
|
3311 |
|
30847 | 3312 |
* Command 'fixrec': specification syntax now conforms to the general |
30855 | 3313 |
format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for |
3314 |
examples. INCOMPATIBILITY. |
|
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3315 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3316 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3317 |
*** ZF *** |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3318 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3319 |
* Proof of Zorn's Lemma for partial orders. |
30176
78610979b3c6
add news for HOLCF; fixed some typos and inaccuracies
huffman
parents:
30163
diff
changeset
|
3320 |
|
78610979b3c6
add news for HOLCF; fixed some typos and inaccuracies
huffman
parents:
30163
diff
changeset
|
3321 |
|
27246
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset
|
3322 |
*** ML *** |
28088
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset
|
3323 |
|
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3324 |
* Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3325 |
Poly/ML 5.2.1 or later. Important note: the TimeLimit facility |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3326 |
depends on multithreading, so timouts will not work before Poly/ML |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3327 |
5.2.1! |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3328 |
|
29161
9903e84a9c9c
* Proofs of are run in parallel on multi-core systems;
wenzelm
parents:
29145
diff
changeset
|
3329 |
* High-level support for concurrent ML programming, see |
9903e84a9c9c
* Proofs of are run in parallel on multi-core systems;
wenzelm
parents:
29145
diff
changeset
|
3330 |
src/Pure/Cuncurrent. The data-oriented model of "future values" is |
9903e84a9c9c
* Proofs of are run in parallel on multi-core systems;
wenzelm
parents:
29145
diff
changeset
|
3331 |
particularly convenient to organize independent functional |
9903e84a9c9c
* Proofs of are run in parallel on multi-core systems;
wenzelm
parents:
29145
diff
changeset
|
3332 |
computations. The concept of "synchronized variables" provides a |
9903e84a9c9c
* Proofs of are run in parallel on multi-core systems;
wenzelm
parents:
29145
diff
changeset
|
3333 |
higher-order interface for components with shared state, avoiding the |
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3334 |
delicate details of mutexes and condition variables. (Requires |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3335 |
Poly/ML 5.2.1 or later.) |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3336 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3337 |
* ML bindings produced via Isar commands are stored within the Isar |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3338 |
context (theory or proof). Consequently, commands like 'use' and 'ML' |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3339 |
become thread-safe and work with undo as expected (concerning |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3340 |
top-level bindings, not side-effects on global references). |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3341 |
INCOMPATIBILITY, need to provide proper Isar context when invoking the |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3342 |
compiler at runtime; really global bindings need to be given outside a |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3343 |
theory. (Requires Poly/ML 5.2 or later.) |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3344 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3345 |
* Command 'ML_prf' is analogous to 'ML' but works within a proof |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3346 |
context. Top-level ML bindings are stored within the proof context in |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3347 |
a purely sequential fashion, disregarding the nested proof structure. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3348 |
ML bindings introduced by 'ML_prf' are discarded at the end of the |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3349 |
proof. (Requires Poly/ML 5.2 or later.) |
29161
9903e84a9c9c
* Proofs of are run in parallel on multi-core systems;
wenzelm
parents:
29145
diff
changeset
|
3350 |
|
30530 | 3351 |
* Simplified ML attribute and method setup, cf. functions Attrib.setup |
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3352 |
and Method.setup, as well as Isar commands 'attribute_setup' and |
30547 | 3353 |
'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify |
3354 |
existing code accordingly, or use plain 'setup' together with old |
|
3355 |
Method.add_method. |
|
30530 | 3356 |
|
28294 | 3357 |
* Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm |
3358 |
to 'a -> thm, while results are always tagged with an authentic oracle |
|
3359 |
name. The Isar command 'oracle' is now polymorphic, no argument type |
|
3360 |
is specified. INCOMPATIBILITY, need to simplify existing oracle code |
|
3361 |
accordingly. Note that extra performance may be gained by producing |
|
3362 |
the cterm carefully, avoiding slow Thm.cterm_of. |
|
3363 |
||
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3364 |
* Simplified interface for defining document antiquotations via |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3365 |
ThyOutput.antiquotation, ThyOutput.output, and optionally |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3366 |
ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3367 |
antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3368 |
examples. |
28099
fb16a07d6580
* Generic Toplevel.add_hook interface allows to analyze the result of
wenzelm
parents:
28089
diff
changeset
|
3369 |
|
30395
f3103bd2b167
* More systematic treatment of long names, abstract name bindings, and name space operations.
wenzelm
parents:
30326
diff
changeset
|
3370 |
* More systematic treatment of long names, abstract name bindings, and |
f3103bd2b167
* More systematic treatment of long names, abstract name bindings, and name space operations.
wenzelm
parents:
30326
diff
changeset
|
3371 |
name space operations. Basic operations on qualified names have been |
30399 | 3372 |
move from structure NameSpace to Long_Name, e.g. Long_Name.base_name, |
30395
f3103bd2b167
* More systematic treatment of long names, abstract name bindings, and name space operations.
wenzelm
parents:
30326
diff
changeset
|
3373 |
Long_Name.append. Old type bstring has been mostly replaced by |
f3103bd2b167
* More systematic treatment of long names, abstract name bindings, and name space operations.
wenzelm
parents:
30326
diff
changeset
|
3374 |
abstract type binding (see structure Binding), which supports precise |
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3375 |
qualification by packages and local theory targets, as well as proper |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3376 |
tracking of source positions. INCOMPATIBILITY, need to wrap old |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3377 |
bstring values into Binding.name, or better pass through abstract |
30399 | 3378 |
bindings everywhere. See further src/Pure/General/long_name.ML, |
30395
f3103bd2b167
* More systematic treatment of long names, abstract name bindings, and name space operations.
wenzelm
parents:
30326
diff
changeset
|
3379 |
src/Pure/General/binding.ML and src/Pure/General/name_space.ML |
f3103bd2b167
* More systematic treatment of long names, abstract name bindings, and name space operations.
wenzelm
parents:
30326
diff
changeset
|
3380 |
|
28089
66ae1926482a
* Result facts now refer to the *full* internal name;
wenzelm
parents:
28088
diff
changeset
|
3381 |
* Result facts (from PureThy.note_thms, ProofContext.note_thms, |
66ae1926482a
* Result facts now refer to the *full* internal name;
wenzelm
parents:
28088
diff
changeset
|
3382 |
LocalTheory.note etc.) now refer to the *full* internal name, not the |
66ae1926482a
* Result facts now refer to the *full* internal name;
wenzelm
parents:
28088
diff
changeset
|
3383 |
bstring as before. INCOMPATIBILITY, not detected by ML type-checking! |
66ae1926482a
* Result facts now refer to the *full* internal name;
wenzelm
parents:
28088
diff
changeset
|
3384 |
|
27287 | 3385 |
* Disposed old type and term read functions (Sign.read_def_typ, |
3386 |
Sign.read_typ, Sign.read_def_terms, Sign.read_term, |
|
3387 |
Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should |
|
3388 |
use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global, |
|
27269 | 3389 |
Syntax.read_term_global etc.; see also OldGoals.read_term as last |
3390 |
resort for legacy applications. |
|
3391 |
||
30609
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30577
diff
changeset
|
3392 |
* Disposed old declarations, tactics, tactic combinators that refer to |
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30577
diff
changeset
|
3393 |
the simpset or claset of an implicit theory (such as Addsimps, |
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30577
diff
changeset
|
3394 |
Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in |
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30577
diff
changeset
|
3395 |
embedded ML text, or local_simpset_of with a proper context passed as |
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30577
diff
changeset
|
3396 |
explicit runtime argument. |
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30577
diff
changeset
|
3397 |
|
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3398 |
* Rules and tactics that read instantiations (read_instantiate, |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3399 |
res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3400 |
context, which is required for parsing and type-checking. Moreover, |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3401 |
the variables are specified as plain indexnames, not string encodings |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3402 |
thereof. INCOMPATIBILITY. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3403 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3404 |
* Generic Toplevel.add_hook interface allows to analyze the result of |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3405 |
transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3406 |
for theorem dependency output of transactions resulting in a new |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3407 |
theory state. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3408 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3409 |
* ML antiquotations: block-structured compilation context indicated by |
27391 | 3410 |
\<lbrace> ... \<rbrace>; additional antiquotation forms: |
3411 |
||
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3412 |
@{binding name} - basic name binding |
27519
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset
|
3413 |
@{let ?pat = term} - term abbreviation (HO matching) |
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset
|
3414 |
@{note name = fact} - fact abbreviation |
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset
|
3415 |
@{thm fact} - singleton fact (with attributes) |
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset
|
3416 |
@{thms fact} - general fact (with attributes) |
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset
|
3417 |
@{lemma prop by method} - singleton goal |
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset
|
3418 |
@{lemma prop by meth1 meth2} - singleton goal |
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset
|
3419 |
@{lemma prop1 ... propN by method} - general goal |
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset
|
3420 |
@{lemma prop1 ... propN by meth1 meth2} - general goal |
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset
|
3421 |
@{lemma (open) ...} - open derivation |
27380 | 3422 |
|
27246
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset
|
3423 |
|
27979 | 3424 |
*** System *** |
3425 |
||
28248 | 3426 |
* The Isabelle "emacs" tool provides a specific interface to invoke |
3427 |
Proof General / Emacs, with more explicit failure if that is not |
|
3428 |
installed (the old isabelle-interface script silently falls back on |
|
3429 |
isabelle-process). The PROOFGENERAL_HOME setting determines the |
|
3430 |
installation location of the Proof General distribution. |
|
3431 |
||
27979 | 3432 |
* Isabelle/lib/classes/Pure.jar provides basic support to integrate |
3433 |
the Isabelle process into a JVM/Scala application. See |
|
3434 |
Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java |
|
3435 |
process wrapper has been discontinued.) |
|
3436 |
||
30845
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3437 |
* Added homegrown Isabelle font with unicode layout, see lib/fonts. |
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3438 |
|
9a887484de53
misc cleanup and rearrangements for Isabelle2009 release;
wenzelm
parents:
30741
diff
changeset
|
3439 |
* Various status messages (with exact source position information) are |
27979 | 3440 |
emitted, if proper markup print mode is enabled. This allows |
3441 |
user-interface components to provide detailed feedback on internal |
|
3442 |
prover operations. |
|
3443 |
||
3444 |
||
27143 | 3445 |
|
27008 | 3446 |
New in Isabelle2008 (June 2008) |
3447 |
------------------------------- |
|
25464
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset
|
3448 |
|
25522 | 3449 |
*** General *** |
3450 |
||
27061 | 3451 |
* The Isabelle/Isar Reference Manual (isar-ref) has been reorganized |
3452 |
and updated, with formally checked references as hyperlinks. |
|
3453 |
||
25994 | 3454 |
* Theory loader: use_thy (and similar operations) no longer set the |
3455 |
implicit ML context, which was occasionally hard to predict and in |
|
3456 |
conflict with concurrency. INCOMPATIBILITY, use ML within Isar which |
|
3457 |
provides a proper context already. |
|
3458 |
||
26323
73efc70edeef
theory loader: discontinued *attached* ML scripts;
wenzelm
parents:
26315
diff
changeset
|
3459 |
* Theory loader: old-style ML proof scripts being *attached* to a thy |
73efc70edeef
theory loader: discontinued *attached* ML scripts;
wenzelm
parents:
26315
diff
changeset
|
3460 |
file are no longer supported. INCOMPATIBILITY, regular 'uses' and |
73efc70edeef
theory loader: discontinued *attached* ML scripts;
wenzelm
parents:
26315
diff
changeset
|
3461 |
'use' within a theory file will do the job. |
73efc70edeef
theory loader: discontinued *attached* ML scripts;
wenzelm
parents:
26315
diff
changeset
|
3462 |
|
26650 | 3463 |
* Name space merge now observes canonical order, i.e. the second space |
3464 |
is inserted into the first one, while existing entries in the first |
|
26659 | 3465 |
space take precedence. INCOMPATIBILITY in rare situations, may try to |
26650 | 3466 |
swap theory imports. |
3467 |
||
27067 | 3468 |
* Syntax: symbol \<chi> is now considered a letter. Potential |
3469 |
INCOMPATIBILITY in identifier syntax etc. |
|
3470 |
||
3471 |
* Outer syntax: string tokens no longer admit escaped white space, |
|
3472 |
which was an accidental (undocumented) feature. INCOMPATIBILITY, use |
|
3473 |
white space without escapes. |
|
3474 |
||
3475 |
* Outer syntax: string tokens may contain arbitrary character codes |
|
3476 |
specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for |
|
3477 |
"foo_bar". |
|
3478 |
||
25522 | 3479 |
|
25502 | 3480 |
*** Pure *** |
3481 |
||
26718 | 3482 |
* Context-dependent token translations. Default setup reverts locally |
3483 |
fixed variables, and adds hilite markup for undeclared frees. |
|
3484 |
||
26681 | 3485 |
* Unused theorems can be found using the new command 'unused_thms'. |
3486 |
There are three ways of invoking it: |
|
3487 |
||
3488 |
(1) unused_thms |
|
3489 |
Only finds unused theorems in the current theory. |
|
3490 |
||
3491 |
(2) unused_thms thy_1 ... thy_n - |
|
3492 |
Finds unused theorems in the current theory and all of its ancestors, |
|
3493 |
excluding the theories thy_1 ... thy_n and all of their ancestors. |
|
3494 |
||
3495 |
(3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m |
|
3496 |
Finds unused theorems in the theories thy'_1 ... thy'_m and all of |
|
3497 |
their ancestors, excluding the theories thy_1 ... thy_n and all of |
|
3498 |
their ancestors. |
|
3499 |
||
26718 | 3500 |
In order to increase the readability of the list produced by |
3501 |
unused_thms, theorems that have been created by a particular instance |
|
26874 | 3502 |
of a theory command such as 'inductive' or 'function' are considered |
3503 |
to belong to the same "group", meaning that if at least one theorem in |
|
26718 | 3504 |
this group is used, the other theorems in the same group are no longer |
3505 |
reported as unused. Moreover, if all theorems in the group are |
|
3506 |
unused, only one theorem in the group is displayed. |
|
3507 |
||
3508 |
Note that proof objects have to be switched on in order for |
|
3509 |
unused_thms to work properly (i.e. !proofs must be >= 1, which is |
|
26874 | 3510 |
usually the case when using Proof General with the default settings). |
26681 | 3511 |
|
26650 | 3512 |
* Authentic naming of facts disallows ad-hoc overwriting of previous |
3513 |
theorems within the same name space. INCOMPATIBILITY, need to remove |
|
3514 |
duplicate fact bindings, or even accidental fact duplications. Note |
|
3515 |
that tools may maintain dynamically scoped facts systematically, using |
|
3516 |
PureThy.add_thms_dynamic. |
|
3517 |
||
26660 | 3518 |
* Command 'hide' now allows to hide from "fact" name space as well. |
3519 |
||
26496
49ae9456eba9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26495
diff
changeset
|
3520 |
* Eliminated destructive theorem database, simpset, claset, and |
49ae9456eba9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26495
diff
changeset
|
3521 |
clasimpset. Potential INCOMPATIBILITY, really need to observe linear |
49ae9456eba9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26495
diff
changeset
|
3522 |
update of theories within ML code. |
26479 | 3523 |
|
26955
ebbaa935eae0
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm
parents:
26925
diff
changeset
|
3524 |
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory. |
ebbaa935eae0
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm
parents:
26925
diff
changeset
|
3525 |
INCOMPATIBILITY, object-logics depending on former Pure require |
ebbaa935eae0
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm
parents:
26925
diff
changeset
|
3526 |
additional setup PureThy.old_appl_syntax_setup; object-logics |
ebbaa935eae0
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm
parents:
26925
diff
changeset
|
3527 |
depending on former CPure need to refer to Pure. |
26650 | 3528 |
|
26495 | 3529 |
* Commands 'use' and 'ML' are now purely functional, operating on |
26479 | 3530 |
theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML' |
3531 |
instead. Added 'ML_val' as mere diagnostic replacement for 'ML'. |
|
3532 |
INCOMPATIBILITY. |
|
3533 |
||
26874 | 3534 |
* Command 'setup': discontinued implicit version with ML reference. |
26434 | 3535 |
|
25970
9053fd546501
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs here;
wenzelm
parents:
25961
diff
changeset
|
3536 |
* Instantiation target allows for simultaneous specification of class |
9053fd546501
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs here;
wenzelm
parents:
25961
diff
changeset
|
3537 |
instance operations together with an instantiation proof. |
9053fd546501
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs here;
wenzelm
parents:
25961
diff
changeset
|
3538 |
Type-checking phase allows to refer to class operations uniformly. |
27067 | 3539 |
See src/HOL/Complex/Complex.thy for an Isar example and |
3540 |
src/HOL/Library/Eval.thy for an ML example. |
|
25502 | 3541 |
|
26201
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset
|
3542 |
* Indexing of literal facts: be more serious about including only |
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset
|
3543 |
facts from the visible specification/proof context, but not the |
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset
|
3544 |
background context (locale etc.). Affects `prop` notation and method |
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset
|
3545 |
"fact". INCOMPATIBILITY: need to name facts explicitly in rare |
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset
|
3546 |
situations. |
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset
|
3547 |
|
26925
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset
|
3548 |
* Method "cases", "induct", "coinduct": removed obsolete/undocumented |
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset
|
3549 |
"(open)" option, which used to expose internal bound variables to the |
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset
|
3550 |
proof text. |
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset
|
3551 |
|
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset
|
3552 |
* Isar statements: removed obsolete case "rule_context". |
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset
|
3553 |
INCOMPATIBILITY, better use explicit fixes/assumes. |
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset
|
3554 |
|
26874 | 3555 |
* Locale proofs: default proof step now includes 'unfold_locales'; |
3556 |
hence 'proof' without argument may be used to unfold locale |
|
3557 |
predicates. |
|
26765 | 3558 |
|
3559 |
||
26762 | 3560 |
*** Document preparation *** |
3561 |
||
26914 | 3562 |
* Simplified pdfsetup.sty: color/hyperref is used unconditionally for |
3563 |
both pdf and dvi (hyperlinks usually work in xdvi as well); removed |
|
3564 |
obsolete thumbpdf setup (contemporary PDF viewers do this on the |
|
3565 |
spot); renamed link color from "darkblue" to "linkcolor" (default |
|
26920 | 3566 |
value unchanged, can be redefined via \definecolor); no longer sets |
3567 |
"a4paper" option (unnecessary or even intrusive). |
|
26914 | 3568 |
|
27008 | 3569 |
* Antiquotation @{lemma A method} proves proposition A by the given |
3570 |
method (either a method name or a method name plus (optional) method |
|
3571 |
arguments in parentheses) and prints A just like @{prop A}. |
|
26762 | 3572 |
|
3573 |
||
25464
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset
|
3574 |
*** HOL *** |
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset
|
3575 |
|
27067 | 3576 |
* New primrec package. Specification syntax conforms in style to |
3577 |
definition/function/.... No separate induction rule is provided. The |
|
3578 |
"primrec" command distinguishes old-style and new-style specifications |
|
3579 |
by syntax. The former primrec package is now named OldPrimrecPackage. |
|
3580 |
When adjusting theories, beware: constants stemming from new-style |
|
3581 |
primrec specifications have authentic syntax. |
|
3582 |
||
3583 |
* Metis prover is now an order of magnitude faster, and also works |
|
3584 |
with multithreading. |
|
3585 |
||
3586 |
* Metis: the maximum number of clauses that can be produced from a |
|
3587 |
theorem is now given by the attribute max_clauses. Theorems that |
|
3588 |
exceed this number are ignored, with a warning printed. |
|
3589 |
||
3590 |
* Sledgehammer no longer produces structured proofs by default. To |
|
3591 |
enable, declare [[sledgehammer_full = true]]. Attributes |
|
3592 |
reconstruction_modulus, reconstruction_sorts renamed |
|
3593 |
sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY. |
|
3594 |
||
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
3595 |
* Method "induct_scheme" derives user-specified induction rules |
27067 | 3596 |
from well-founded induction and completeness of patterns. This factors |
3597 |
out some operations that are done internally by the function package |
|
3598 |
and makes them available separately. See |
|
3599 |
src/HOL/ex/Induction_Scheme.thy for examples. |
|
3600 |
||
3601 |
* More flexible generation of measure functions for termination |
|
3602 |
proofs: Measure functions can be declared by proving a rule of the |
|
3603 |
form "is_measure f" and giving it the [measure_function] attribute. |
|
3604 |
The "is_measure" predicate is logically meaningless (always true), and |
|
3605 |
just guides the heuristic. To find suitable measure functions, the |
|
3606 |
termination prover sets up the goal "is_measure ?f" of the appropriate |
|
3607 |
type and generates all solutions by prolog-style backwards proof using |
|
3608 |
the declared rules. |
|
3609 |
||
3610 |
This setup also deals with rules like |
|
3611 |
||
3612 |
"is_measure f ==> is_measure (list_size f)" |
|
3613 |
||
3614 |
which accommodates nested datatypes that recurse through lists. |
|
3615 |
Similar rules are predeclared for products and option types. |
|
3616 |
||
26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3617 |
* Turned the type of sets "'a set" into an abbreviation for "'a => bool" |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3618 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3619 |
INCOMPATIBILITIES: |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3620 |
|
27008 | 3621 |
- Definitions of overloaded constants on sets have to be replaced by |
3622 |
definitions on => and bool. |
|
26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3623 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3624 |
- Some definitions of overloaded operators on sets can now be proved |
27008 | 3625 |
using the definitions of the operators on => and bool. Therefore, |
3626 |
the following theorems have been renamed: |
|
26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3627 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3628 |
subset_def -> subset_eq |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3629 |
psubset_def -> psubset_eq |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3630 |
set_diff_def -> set_diff_eq |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3631 |
Compl_def -> Compl_eq |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3632 |
Sup_set_def -> Sup_set_eq |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3633 |
Inf_set_def -> Inf_set_eq |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3634 |
sup_set_def -> sup_set_eq |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3635 |
inf_set_def -> inf_set_eq |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3636 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3637 |
- Due to the incompleteness of the HO unification algorithm, some |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3638 |
rules such as subst may require manual instantiation, if some of |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3639 |
the unknowns in the rule is a set. |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3640 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3641 |
- Higher order unification and forward proofs: |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3642 |
The proof pattern |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3643 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3644 |
have "P (S::'a set)" <...> |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3645 |
then have "EX S. P S" .. |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3646 |
|
27008 | 3647 |
no longer works (due to the incompleteness of the HO unification |
3648 |
algorithm) and must be replaced by the pattern |
|
26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3649 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3650 |
have "EX S. P S" |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3651 |
proof |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3652 |
show "P S" <...> |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3653 |
qed |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3654 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3655 |
- Calculational reasoning with subst (or similar rules): |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3656 |
The proof pattern |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3657 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3658 |
have "P (S::'a set)" <...> |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3659 |
also have "S = T" <...> |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3660 |
finally have "P T" . |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3661 |
|
27008 | 3662 |
no longer works (for similar reasons as the previous example) and |
3663 |
must be replaced by something like |
|
26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3664 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3665 |
have "P (S::'a set)" <...> |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3666 |
moreover have "S = T" <...> |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3667 |
ultimately have "P T" by simp |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3668 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3669 |
- Tactics or packages written in ML code: |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3670 |
Code performing pattern matching on types via |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3671 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3672 |
Type ("set", [T]) => ... |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3673 |
|
27008 | 3674 |
must be rewritten. Moreover, functions like strip_type or |
3675 |
binder_types no longer return the right value when applied to a |
|
3676 |
type of the form |
|
26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3677 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3678 |
T1 => ... => Tn => U => bool |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3679 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3680 |
rather than |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3681 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3682 |
T1 => ... => Tn => U set |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
3683 |
|
26874 | 3684 |
* Merged theories Wellfounded_Recursion, Accessible_Part and |
27067 | 3685 |
Wellfounded_Relations to theory Wellfounded. |
26748
4d51ddd6aa5c
Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
26724
diff
changeset
|
3686 |
|
26513 | 3687 |
* Explicit class "eq" for executable equality. INCOMPATIBILITY. |
3688 |
||
26874 | 3689 |
* Class finite no longer treats UNIV as class parameter. Use class |
3690 |
enum from theory Library/Enum instead to achieve a similar effect. |
|
26445 | 3691 |
INCOMPATIBILITY. |
3692 |
||
26874 | 3693 |
* Theory List: rule list_induct2 now has explicitly named cases "Nil" |
3694 |
and "Cons". INCOMPATIBILITY. |
|
3695 |
||
26422
d5883907c514
HOL (and FOL): renamed variables in rules imp_elim and swap;
wenzelm
parents:
26401
diff
changeset
|
3696 |
* HOL (and FOL): renamed variables in rules imp_elim and swap. |
d5883907c514
HOL (and FOL): renamed variables in rules imp_elim and swap;
wenzelm
parents:
26401
diff
changeset
|
3697 |
Potential INCOMPATIBILITY. |
d5883907c514
HOL (and FOL): renamed variables in rules imp_elim and swap;
wenzelm
parents:
26401
diff
changeset
|
3698 |
|
26874 | 3699 |
* Theory Product_Type: duplicated lemmas split_Pair_apply and |
3700 |
injective_fst_snd removed, use split_eta and prod_eqI instead. |
|
3701 |
Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY. |
|
26355 | 3702 |
|
26335
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
3703 |
* Theory Nat: removed redundant lemmas that merely duplicate lemmas of |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
3704 |
the same name in theory Orderings: |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
3705 |
|
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
3706 |
less_trans |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
3707 |
less_linear |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
3708 |
le_imp_less_or_eq |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
3709 |
le_less_trans |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
3710 |
less_le_trans |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
3711 |
less_not_sym |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
3712 |
less_asym |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
3713 |
|
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
3714 |
Renamed less_imp_le to less_imp_le_nat, and less_irrefl to |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
3715 |
less_irrefl_nat. Potential INCOMPATIBILITY due to more general types |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
3716 |
and different variable names. |
26315
cb3badaa192e
removed redundant less_trans, less_linear, le_imp_less_or_eq, le_less_trans, less_le_trans (cf. Orderings.thy);
wenzelm
parents:
26231
diff
changeset
|
3717 |
|
26231 | 3718 |
* Library/Option_ord.thy: Canonical order on option type. |
3719 |
||
27008 | 3720 |
* Library/RBT.thy: Red-black trees, an efficient implementation of |
3721 |
finite maps. |
|
26197 | 3722 |
|
26231 | 3723 |
* Library/Countable.thy: Type class for countable types. |
3724 |
||
26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3725 |
* Theory Int: The representation of numerals has changed. The infix |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3726 |
operator BIT and the bit datatype with constructors B0 and B1 have |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3727 |
disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3728 |
place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3729 |
involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1" |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3730 |
accordingly. |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3731 |
|
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3732 |
* Theory Nat: definition of <= and < on natural numbers no longer |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3733 |
depend on well-founded relations. INCOMPATIBILITY. Definitions |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3734 |
le_def and less_def have disappeared. Consider lemmas not_less |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3735 |
[symmetric, where ?'a = nat] and less_eq [symmetric] instead. |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3736 |
|
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3737 |
* Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3738 |
(whose purpose mainly is for various fold_set functionals) have been |
26874 | 3739 |
abandoned in favor of the existing algebraic classes |
26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3740 |
ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult, |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3741 |
lower_semilattice (resp. upper_semilattice) and linorder. |
26139 | 3742 |
INCOMPATIBILITY. |
26041
c2e15e65165f
locales ACf, ACIf, ACIfSL and ACIfSLlin have been abandoned in favour of the existing algebraic classes ab_semigroup_mult, ab_semigroup_idem_mult, lower_semilattice (resp. uper_semilattice) and linorder
haftmann
parents:
26013
diff
changeset
|
3743 |
|
26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3744 |
* Theory Transitive_Closure: induct and cases rules now declare proper |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3745 |
case_names ("base" and "step"). INCOMPATIBILITY. |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3746 |
|
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3747 |
* Theorem Inductive.lfp_ordinal_induct generalized to complete |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3748 |
lattices. The form set-specific version is available as |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3749 |
Inductive.lfp_ordinal_induct_set. |
26013
8764a1f1253b
Theorem Inductive.lfp_ordinal_induct generalized to complete lattices
haftmann
parents:
26006
diff
changeset
|
3750 |
|
26874 | 3751 |
* Renamed theorems "power.simps" to "power_int.simps". |
27067 | 3752 |
INCOMPATIBILITY. |
25961 | 3753 |
|
26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3754 |
* Class semiring_div provides basic abstract properties of semirings |
25942 | 3755 |
with division and modulo operations. Subsumes former class dvd_mod. |
3756 |
||
26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3757 |
* Merged theories IntDef, Numeral and IntArith into unified theory |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3758 |
Int. INCOMPATIBILITY. |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3759 |
|
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3760 |
* Theory Library/Code_Index: type "index" now represents natural |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3761 |
numbers rather than integers. INCOMPATIBILITY. |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3762 |
|
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3763 |
* New class "uminus" with operation "uminus" (split of from class |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
3764 |
"minus" which now only has operation "minus", binary). |
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25900
diff
changeset
|
3765 |
INCOMPATIBILITY. |
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25900
diff
changeset
|
3766 |
|
25522 | 3767 |
* Constants "card", "internal_split", "option_map" now with authentic |
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25900
diff
changeset
|
3768 |
syntax. INCOMPATIBILITY. |
25522 | 3769 |
|
3770 |
* Definitions subset_def, psubset_def, set_diff_def, Compl_def, |
|
3771 |
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def, |
|
3772 |
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def, |
|
3773 |
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def, |
|
3774 |
Sup_set_def, le_def, less_def, option_map_def now with object |
|
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25900
diff
changeset
|
3775 |
equality. INCOMPATIBILITY. |
25464
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset
|
3776 |
|
25705 | 3777 |
* Records. Removed K_record, and replaced it by pure lambda term |
25726
9728f319ffc6
* Metis prover an order of magnitude faster, works with multithreading.
wenzelm
parents:
25712
diff
changeset
|
3778 |
%x. c. The simplifier setup is now more robust against eta expansion. |
25705 | 3779 |
INCOMPATIBILITY: in cases explicitly referring to K_record. |
25464
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset
|
3780 |
|
27067 | 3781 |
* Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}. |
3782 |
||
3783 |
* Library/ListVector: new theory of arithmetic vector operations. |
|
3784 |
||
3785 |
* Library/Order_Relation: new theory of various orderings as sets of |
|
3786 |
pairs. Defines preorders, partial orders, linear orders and |
|
3787 |
well-orders on sets and on types. |
|
26877 | 3788 |
|
25726
9728f319ffc6
* Metis prover an order of magnitude faster, works with multithreading.
wenzelm
parents:
25712
diff
changeset
|
3789 |
|
26197 | 3790 |
*** ZF *** |
3791 |
||
26874 | 3792 |
* Renamed some theories to allow to loading both ZF and HOL in the |
3793 |
same session: |
|
3794 |
||
3795 |
Datatype -> Datatype_ZF |
|
3796 |
Inductive -> Inductive_ZF |
|
3797 |
Int -> Int_ZF |
|
3798 |
IntDiv -> IntDiv_ZF |
|
3799 |
Nat -> Nat_ZF |
|
3800 |
List -> List_ZF |
|
3801 |
Main -> Main_ZF |
|
3802 |
||
3803 |
INCOMPATIBILITY: ZF theories that import individual theories below |
|
3804 |
Main might need to be adapted. Regular theory Main is still |
|
3805 |
available, as trivial extension of Main_ZF. |
|
26197 | 3806 |
|
3807 |
||
25737
84c92fc48e36
``print mode'' is now a thread-local value derived from a global template;
wenzelm
parents:
25726
diff
changeset
|
3808 |
*** ML *** |
84c92fc48e36
``print mode'' is now a thread-local value derived from a global template;
wenzelm
parents:
25726
diff
changeset
|
3809 |
|
27067 | 3810 |
* ML within Isar: antiquotation @{const name} or @{const |
3811 |
name(typargs)} produces statically-checked Const term. |
|
3812 |
||
26401
e7a94081dce7
Functor NamedThmsFun: data is available to the user as dynamic fact;
wenzelm
parents:
26387
diff
changeset
|
3813 |
* Functor NamedThmsFun: data is available to the user as dynamic fact |
26724
ff6ff3a9010e
NamedThmsFun: removed obsolete print command -- facts are accesible via dynamic name;
wenzelm
parents:
26718
diff
changeset
|
3814 |
(of the same name). Removed obsolete print command. |
26401
e7a94081dce7
Functor NamedThmsFun: data is available to the user as dynamic fact;
wenzelm
parents:
26387
diff
changeset
|
3815 |
|
27067 | 3816 |
* Removed obsolete "use_legacy_bindings" function. |
26188 | 3817 |
|
25737
84c92fc48e36
``print mode'' is now a thread-local value derived from a global template;
wenzelm
parents:
25726
diff
changeset
|
3818 |
* The ``print mode'' is now a thread-local value derived from a global |
84c92fc48e36
``print mode'' is now a thread-local value derived from a global template;
wenzelm
parents:
25726
diff
changeset
|
3819 |
template (the former print_mode reference), thus access becomes |
84c92fc48e36
``print mode'' is now a thread-local value derived from a global template;
wenzelm
parents:
25726
diff
changeset
|
3820 |
non-critical. The global print_mode reference is for session |
84c92fc48e36
``print mode'' is now a thread-local value derived from a global template;
wenzelm
parents:
25726
diff
changeset
|
3821 |
management only; user-code should use print_mode_value, |
84c92fc48e36
``print mode'' is now a thread-local value derived from a global template;
wenzelm
parents:
25726
diff
changeset
|
3822 |
print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY. |
84c92fc48e36
``print mode'' is now a thread-local value derived from a global template;
wenzelm
parents:
25726
diff
changeset
|
3823 |
|
26874 | 3824 |
* Functions system/system_out provide a robust way to invoke external |
29161
9903e84a9c9c
* Proofs of are run in parallel on multi-core systems;
wenzelm
parents:
29145
diff
changeset
|
3825 |
shell commands, with propagation of interrupts (requires Poly/ML |
9903e84a9c9c
* Proofs of are run in parallel on multi-core systems;
wenzelm
parents:
29145
diff
changeset
|
3826 |
5.2.1). Do not use OS.Process.system etc. from the basis library! |
26222
edf6473ac9e9
* system/system_out provides a robust way to invoke external shell
wenzelm
parents:
26218
diff
changeset
|
3827 |
|
25737
84c92fc48e36
``print mode'' is now a thread-local value derived from a global template;
wenzelm
parents:
25726
diff
changeset
|
3828 |
|
25626
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset
|
3829 |
*** System *** |
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset
|
3830 |
|
25971 | 3831 |
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs --- |
3832 |
in accordance with Proof General 3.7, which prefers GNU emacs. |
|
25970
9053fd546501
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs here;
wenzelm
parents:
25961
diff
changeset
|
3833 |
|
25626
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset
|
3834 |
* isatool tty runs Isabelle process with plain tty interaction; |
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset
|
3835 |
optional line editor may be specified via ISABELLE_LINE_EDITOR |
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset
|
3836 |
setting, the default settings attempt to locate "ledit" and "rlwrap". |
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset
|
3837 |
|
25651 | 3838 |
* isatool browser now works with Cygwin as well, using general |
3839 |
"javapath" function defined in Isabelle process environment. |
|
3840 |
||
27067 | 3841 |
* YXML notation provides a simple and efficient alternative to |
3842 |
standard XML transfer syntax. See src/Pure/General/yxml.ML and |
|
3843 |
isatool yxml as described in the Isabelle system manual. |
|
25651 | 3844 |
|
25652 | 3845 |
* JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes) |
25651 | 3846 |
provides general wrapper for managing an Isabelle process in a robust |
3847 |
fashion, with ``cooked'' output from stdin/stderr. |
|
3848 |
||
25855 | 3849 |
* Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit), |
3850 |
based on Isabelle/JVM process wrapper (see Isabelle/lib/classes). |
|
3851 |
||
27067 | 3852 |
* Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented |
3853 |
way of changing the user's settings is via |
|
3854 |
ISABELLE_HOME_USER/etc/settings, which is a fully featured bash |
|
3855 |
script. |
|
3856 |
||
3857 |
* Multithreading.max_threads := 0 refers to the number of actual CPU |
|
3858 |
cores of the underlying machine, which is a good starting point for |
|
3859 |
optimal performance tuning. The corresponding usedir option -M allows |
|
3860 |
"max" as an alias for "0". WARNING: does not work on certain versions |
|
3861 |
of Mac OS (with Poly/ML 5.1). |
|
3862 |
||
3863 |
* isabelle-process: non-ML sessions are run with "nice", to reduce the |
|
3864 |
adverse effect of Isabelle flooding interactive front-ends (notably |
|
3865 |
ProofGeneral / XEmacs). |
|
3866 |
||
25626
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset
|
3867 |
|
25464
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset
|
3868 |
|
25429 | 3869 |
New in Isabelle2007 (November 2007) |
3870 |
----------------------------------- |
|
17754
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset
|
3871 |
|
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset
|
3872 |
*** General *** |
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset
|
3873 |
|
22826 | 3874 |
* More uniform information about legacy features, notably a |
3875 |
warning/error of "Legacy feature: ...", depending on the state of the |
|
23367 | 3876 |
tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY: |
3877 |
legacy features will disappear eventually. |
|
22826 | 3878 |
|
17918
93e26302733e
* Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset
|
3879 |
* Theory syntax: the header format ``theory A = B + C:'' has been |
93e26302733e
* Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset
|
3880 |
discontinued in favour of ``theory A imports B C begin''. Use isatool |
93e26302733e
* Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset
|
3881 |
fixheaders to convert existing theory files. INCOMPATIBILITY. |
93e26302733e
* Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset
|
3882 |
|
93e26302733e
* Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset
|
3883 |
* Theory syntax: the old non-Isar theory file format has been |
93e26302733e
* Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset
|
3884 |
discontinued altogether. Note that ML proof scripts may still be used |
93e26302733e
* Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset
|
3885 |
with Isar theories; migration is usually quite simple with the ML |
93e26302733e
* Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset
|
3886 |
function use_legacy_bindings. INCOMPATIBILITY. |
93e26302733e
* Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset
|
3887 |
|
22871 | 3888 |
* Theory syntax: some popular names (e.g. 'class', 'declaration', |
3889 |
'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double |
|
3890 |
quotes. |
|
19814
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset
|
3891 |
|
23888
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset
|
3892 |
* Theory loader: be more serious about observing the static theory |
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset
|
3893 |
header specifications (including optional directories), but not the |
24172
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
3894 |
accidental file locations of previously successful loads. The strict |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
3895 |
update policy of former update_thy is now already performed by |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
3896 |
use_thy, so the former has been removed; use_thys updates several |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
3897 |
theories simultaneously, just as 'imports' within a theory header |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
3898 |
specification, but without merging the results. Potential |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
3899 |
INCOMPATIBILITY: may need to refine theory headers and commands |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
3900 |
ROOT.ML which depend on load order. |
23888
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset
|
3901 |
|
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset
|
3902 |
* Theory loader: optional support for content-based file |
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset
|
3903 |
identification, instead of the traditional scheme of full physical |
23889 | 3904 |
path plus date stamp; configured by the ISABELLE_FILE_IDENT setting |
23888
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset
|
3905 |
(cf. the system manual). The new scheme allows to work with |
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset
|
3906 |
non-finished theories in persistent session images, such that source |
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset
|
3907 |
files may be moved later on without requiring reloads. |
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset
|
3908 |
|
24187
8bdf5ca5871f
* Theory loader: old-style ML proof scripts are considered a legacy feature;
wenzelm
parents:
24172
diff
changeset
|
3909 |
* Theory loader: old-style ML proof scripts being *attached* to a thy |
8bdf5ca5871f
* Theory loader: old-style ML proof scripts are considered a legacy feature;
wenzelm
parents:
24172
diff
changeset
|
3910 |
file (with the same base name as the theory) are considered a legacy |
24800 | 3911 |
feature, which will disappear eventually. Even now, the theory loader |
3912 |
no longer maintains dependencies on such files. |
|
3913 |
||
3914 |
* Syntax: the scope for resolving ambiguities via type-inference is |
|
3915 |
now limited to individual terms, instead of whole simultaneous |
|
24234
4714e04fb8e9
* Syntax: scope for resolving ambiguities via type-inference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset
|
3916 |
specifications as before. This greatly reduces the complexity of the |
4714e04fb8e9
* Syntax: scope for resolving ambiguities via type-inference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset
|
3917 |
syntax module and improves flexibility by separating parsing and |
4714e04fb8e9
* Syntax: scope for resolving ambiguities via type-inference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset
|
3918 |
type-checking. INCOMPATIBILITY: additional type-constraints (explicit |
4714e04fb8e9
* Syntax: scope for resolving ambiguities via type-inference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset
|
3919 |
'fixes' etc.) are required in rare situations. |
4714e04fb8e9
* Syntax: scope for resolving ambiguities via type-inference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset
|
3920 |
|
25034 | 3921 |
* Syntax: constants introduced by new-style packages ('definition', |
3922 |
'abbreviation' etc.) are passed through the syntax module in |
|
3923 |
``authentic mode''. This means that associated mixfix annotations |
|
3924 |
really stick to such constants, independently of potential name space |
|
3925 |
ambiguities introduced later on. INCOMPATIBILITY: constants in parse |
|
3926 |
trees are represented slightly differently, may need to adapt syntax |
|
3927 |
translations accordingly. Use CONST marker in 'translations' and |
|
3928 |
@{const_syntax} antiquotation in 'parse_translation' etc. |
|
3929 |
||
17981
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset
|
3930 |
* Legacy goal package: reduced interface to the bare minimum required |
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset
|
3931 |
to keep existing proof scripts running. Most other user-level |
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset
|
3932 |
functions are now part of the OldGoals structure, which is *not* open |
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset
|
3933 |
by default (consider isatool expandshort before open OldGoals). |
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset
|
3934 |
Removed top_sg, prin, printyp, pprint_term/typ altogether, because |
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset
|
3935 |
these tend to cause confusion about the actual goal (!) context being |
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset
|
3936 |
used here, which is not necessarily the same as the_context(). |
17918
93e26302733e
* Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset
|
3937 |
|
23379
d0e3f790bd73
updated 'find_theorems' -- moved ProofGeneral specifics to ProofGeneral/CHANGES;
wenzelm
parents:
23377
diff
changeset
|
3938 |
* Command 'find_theorems': supports "*" wild-card in "name:" |
d0e3f790bd73
updated 'find_theorems' -- moved ProofGeneral specifics to ProofGeneral/CHANGES;
wenzelm
parents:
23377
diff
changeset
|
3939 |
criterion; "with_dups" option. Certain ProofGeneral versions might |
d0e3f790bd73
updated 'find_theorems' -- moved ProofGeneral specifics to ProofGeneral/CHANGES;
wenzelm
parents:
23377
diff
changeset
|
3940 |
support a specific search form (see ProofGeneral/CHANGES). |
22965 | 3941 |
|
20370 | 3942 |
* The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1 |
3943 |
by default, which means that "prems" (and also "fixed variables") are |
|
3944 |
suppressed from proof state output. Note that the ProofGeneral |
|
3945 |
settings mechanism allows to change and save options persistently, but |
|
3946 |
older versions of Isabelle will fail to start up if a negative prems |
|
3947 |
limit is imposed. |
|
3948 |
||
21308
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset
|
3949 |
* Local theory targets may be specified by non-nested blocks of |
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset
|
3950 |
``context/locale/class ... begin'' followed by ``end''. The body may |
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset
|
3951 |
contain definitions, theorems etc., including any derived mechanism |
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset
|
3952 |
that has been implemented on top of these primitives. This concept |
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset
|
3953 |
generalizes the existing ``theorem (in ...)'' towards more versatility |
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset
|
3954 |
and scalability. |
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset
|
3955 |
|
21960
0574f192b78a
* Proof General: proper undo of final 'end'; discontinued Isabelle/classic;
wenzelm
parents:
21896
diff
changeset
|
3956 |
* Proof General interface: proper undo of final 'end' command; |
0574f192b78a
* Proof General: proper undo of final 'end'; discontinued Isabelle/classic;
wenzelm
parents:
21896
diff
changeset
|
3957 |
discontinued Isabelle/classic mode (ML proof scripts). |
0574f192b78a
* Proof General: proper undo of final 'end'; discontinued Isabelle/classic;
wenzelm
parents:
21896
diff
changeset
|
3958 |
|
17754
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset
|
3959 |
|
17865 | 3960 |
*** Document preparation *** |
3961 |
||
21717 | 3962 |
* Added antiquotation @{theory name} which prints the given name, |
3963 |
after checking that it refers to a valid ancestor theory in the |
|
3964 |
current context. |
|
21339 | 3965 |
|
17869 | 3966 |
* Added antiquotations @{ML_type text} and @{ML_struct text} which |
3967 |
check the given source text as ML type/structure, printing verbatim. |
|
17865 | 3968 |
|
21717 | 3969 |
* Added antiquotation @{abbrev "c args"} which prints the abbreviation |
3970 |
"c args == rhs" given in the current context. (Any number of |
|
21735 | 3971 |
arguments may be given on the LHS.) |
21717 | 3972 |
|
3973 |
||
17779 | 3974 |
*** Pure *** |
3975 |
||
24800 | 3976 |
* The 'class' package offers a combination of axclass and locale to |
25129 | 3977 |
achieve Haskell-like type classes in Isabelle. Definitions and |
3978 |
theorems within a class context produce both relative results (with |
|
3979 |
implicit parameters according to the locale context), and polymorphic |
|
3980 |
constants with qualified polymorphism (according to the class |
|
3981 |
context). Within the body context of a 'class' target, a separate |
|
3982 |
syntax layer ("user space type system") takes care of converting |
|
3983 |
between global polymorphic consts and internal locale representation. |
|
25177 | 3984 |
See src/HOL/ex/Classpackage.thy for examples (as well as main HOL). |
25184 | 3985 |
"isatool doc classes" provides a tutorial. |
20807 | 3986 |
|
25199 | 3987 |
* Generic code generator framework allows to generate executable |
24800 | 3988 |
code for ML and Haskell (including Isabelle classes). A short usage |
3989 |
sketch: |
|
20188
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset
|
3990 |
|
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset
|
3991 |
internal compilation: |
25199 | 3992 |
export_code <list of constants (term syntax)> in SML |
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
3993 |
writing SML code to a file: |
25199 | 3994 |
export_code <list of constants (term syntax)> in SML <filename> |
22735 | 3995 |
writing OCaml code to a file: |
25199 | 3996 |
export_code <list of constants (term syntax)> in OCaml <filename> |
20188
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset
|
3997 |
writing Haskell code to a bunch of files: |
25199 | 3998 |
export_code <list of constants (term syntax)> in Haskell <filename> |
3999 |
||
4000 |
evaluating closed propositions to True/False using code generation: |
|
25184 | 4001 |
method ``eval'' |
4002 |
||
4003 |
Reasonable default setup of framework in HOL. |
|
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
4004 |
|
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
4005 |
Theorem attributs for selecting and transforming function equations theorems: |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
4006 |
|
22845 | 4007 |
[code fun]: select a theorem as function equation for a specific constant |
4008 |
[code fun del]: deselect a theorem as function equation for a specific constant |
|
4009 |
[code inline]: select an equation theorem for unfolding (inlining) in place |
|
4010 |
[code inline del]: deselect an equation theorem for unfolding (inlining) in place |
|
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
4011 |
|
22735 | 4012 |
User-defined serializations (target in {SML, OCaml, Haskell}): |
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
4013 |
|
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
4014 |
code_const <and-list of constants (term syntax)> |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
4015 |
{(target) <and-list of const target syntax>}+ |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
4016 |
|
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
4017 |
code_type <and-list of type constructors> |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
4018 |
{(target) <and-list of type target syntax>}+ |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
4019 |
|
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
4020 |
code_instance <and-list of instances> |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
4021 |
{(target)}+ |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
4022 |
where instance ::= <type constructor> :: <class> |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
4023 |
|
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
4024 |
code_class <and_list of classes> |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
4025 |
{(target) <and-list of class target syntax>}+ |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
4026 |
where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}? |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
4027 |
|
25199 | 4028 |
code_instance and code_class only are effective to target Haskell. |
22735 | 4029 |
|
25177 | 4030 |
For example usage see src/HOL/ex/Codegenerator.thy and |
4031 |
src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code |
|
24800 | 4032 |
generation from Isabelle/HOL theories is available via "isatool doc |
4033 |
codegen". |
|
20188
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset
|
4034 |
|
25129 | 4035 |
* Code generator: consts in 'consts_code' Isar commands are now |
4036 |
referred to by usual term syntax (including optional type |
|
4037 |
annotations). |
|
4038 |
||
19254 | 4039 |
* Command 'no_translations' removes translation rules from theory |
4040 |
syntax. |
|
4041 |
||
19625
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset
|
4042 |
* Overloaded definitions are now actually checked for acyclic |
19714 | 4043 |
dependencies. The overloading scheme is slightly more general than |
4044 |
that of Haskell98, although Isabelle does not demand an exact |
|
4045 |
correspondence to type class and instance declarations. |
|
4046 |
INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more |
|
4047 |
exotic versions of overloading -- at the discretion of the user! |
|
19711 | 4048 |
|
4049 |
Polymorphic constants are represented via type arguments, i.e. the |
|
4050 |
instantiation that matches an instance against the most general |
|
4051 |
declaration given in the signature. For example, with the declaration |
|
4052 |
c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented |
|
4053 |
as c(nat). Overloading is essentially simultaneous structural |
|
4054 |
recursion over such type arguments. Incomplete specification patterns |
|
19714 | 4055 |
impose global constraints on all occurrences, e.g. c('a * 'a) on the |
19715 | 4056 |
LHS means that more general c('a * 'b) will be disallowed on any RHS. |
19714 | 4057 |
Command 'print_theory' outputs the normalized system of recursive |
4058 |
equations, see section "definitions". |
|
19625
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset
|
4059 |
|
24086 | 4060 |
* Configuration options are maintained within the theory or proof |
4061 |
context (with name and type bool/int/string), providing a very simple |
|
4062 |
interface to a poor-man's version of general context data. Tools may |
|
24110
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
4063 |
declare options in ML (e.g. using Attrib.config_int) and then refer to |
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
4064 |
these values using Config.get etc. Users may change options via an |
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
4065 |
associated attribute of the same name. This form of context |
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
4066 |
declaration works particularly well with commands 'declare' or |
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
4067 |
'using', for example ``declare [[foo = 42]]''. Thus it has become |
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
4068 |
very easy to avoid global references, which would not observe Isar |
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
4069 |
toplevel undo/redo and fail to work with multithreading. |
24086 | 4070 |
|
24172
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
4071 |
Various global ML references of Pure and HOL have been turned into |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
4072 |
configuration options: |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
4073 |
|
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
4074 |
Unify.search_bound unify_search_bound |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
4075 |
Unify.trace_bound unify_trace_bound |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
4076 |
Unify.trace_simp unify_trace_simp |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
4077 |
Unify.trace_types unify_trace_types |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
4078 |
Simplifier.simp_depth_limit simp_depth_limit |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
4079 |
Blast.depth_limit blast_depth_limit |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
4080 |
DatatypeProp.dtK datatype_distinctness_limit |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
4081 |
fast_arith_neq_limit fast_arith_neq_limit |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
4082 |
fast_arith_split_limit fast_arith_split_limit |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
4083 |
|
24086 | 4084 |
* Named collections of theorems may be easily installed as context |
24800 | 4085 |
data using the functor NamedThmsFun (see also |
24086 | 4086 |
src/Pure/Tools/named_thms.ML). The user may add or delete facts via |
24110
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
4087 |
attributes; there is also a toplevel print command. This facility is |
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
4088 |
just a common case of general context data, which is the preferred way |
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
4089 |
for anything more complex than just a list of facts in canonical |
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
4090 |
order. |
24086 | 4091 |
|
24032 | 4092 |
* Isar: command 'declaration' augments a local theory by generic |
4093 |
declaration functions written in ML. This enables arbitrary content |
|
4094 |
being added to the context, depending on a morphism that tells the |
|
4095 |
difference of the original declaration context wrt. the application |
|
4096 |
context encountered later on. |
|
4097 |
||
4098 |
* Isar: proper interfaces for simplification procedures. Command |
|
4099 |
'simproc_setup' declares named simprocs (with match patterns, and body |
|
4100 |
text in ML). Attribute "simproc" adds/deletes simprocs in the current |
|
4101 |
context. ML antiquotation @{simproc name} retrieves named simprocs. |
|
4102 |
||
4103 |
* Isar: an extra pair of brackets around attribute declarations |
|
4104 |
abbreviates a theorem reference involving an internal dummy fact, |
|
4105 |
which will be ignored later --- only the effect of the attribute on |
|
4106 |
the background context will persist. This form of in-place |
|
4107 |
declarations is particularly useful with commands like 'declare' and |
|
4108 |
'using', for example ``have A using [[simproc a]] by simp''. |
|
4109 |
||
23369
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
4110 |
* Isar: method "assumption" (and implicit closing of subproofs) now |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
4111 |
takes simple non-atomic goal assumptions into account: after applying |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
4112 |
an assumption as a rule the resulting subgoals are solved by atomic |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
4113 |
assumption steps. This is particularly useful to finish 'obtain' |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
4114 |
goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis", |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
4115 |
without referring to the original premise "!!x. P x ==> thesis" in the |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
4116 |
Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
4117 |
more permissive. |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
4118 |
|
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
4119 |
* Isar: implicit use of prems from the Isar proof context is |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
4120 |
considered a legacy feature. Common applications like ``have A .'' |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
4121 |
may be replaced by ``have A by fact'' or ``note `A`''. In general, |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
4122 |
referencing facts explicitly here improves readability and |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
4123 |
maintainability of proof texts. |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
4124 |
|
17865 | 4125 |
* Isar: improper proof element 'guess' is like 'obtain', but derives |
4126 |
the obtained context from the course of reasoning! For example: |
|
4127 |
||
4128 |
assume "EX x y. A x & B y" -- "any previous fact" |
|
4129 |
then guess x and y by clarify |
|
4130 |
||
4131 |
This technique is potentially adventurous, depending on the facts and |
|
4132 |
proof tools being involved here. |
|
4133 |
||
18020 | 4134 |
* Isar: known facts from the proof context may be specified as literal |
4135 |
propositions, using ASCII back-quote syntax. This works wherever |
|
4136 |
named facts used to be allowed so far, in proof commands, proof |
|
4137 |
methods, attributes etc. Literal facts are retrieved from the context |
|
4138 |
according to unification of type and term parameters. For example, |
|
4139 |
provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known |
|
4140 |
theorems in the current context, then these are valid literal facts: |
|
4141 |
`A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc. |
|
4142 |
||
4143 |
There is also a proof method "fact" which does the same composition |
|
18044 | 4144 |
for explicit goal states, e.g. the following proof texts coincide with |
4145 |
certain special cases of literal facts: |
|
18020 | 4146 |
|
4147 |
have "A" by fact == note `A` |
|
4148 |
have "A ==> B" by fact == note `A ==> B` |
|
4149 |
have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x` |
|
4150 |
have "P a ==> Q a" by fact == note `P a ==> Q a` |
|
4151 |
||
20118
0c1ec587a5a8
* Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents:
20090
diff
changeset
|
4152 |
* Isar: ":" (colon) is no longer a symbolic identifier character in |
0c1ec587a5a8
* Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents:
20090
diff
changeset
|
4153 |
outer syntax. Thus symbolic identifiers may be used without |
0c1ec587a5a8
* Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents:
20090
diff
changeset
|
4154 |
additional white space in declarations like this: ``assume *: A''. |
0c1ec587a5a8
* Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents:
20090
diff
changeset
|
4155 |
|
20013 | 4156 |
* Isar: 'print_facts' prints all local facts of the current context, |
4157 |
both named and unnamed ones. |
|
4158 |
||
18308 | 4159 |
* Isar: 'def' now admits simultaneous definitions, e.g.: |
4160 |
||
4161 |
def x == "t" and y == "u" |
|
4162 |
||
18540 | 4163 |
* Isar: added command 'unfolding', which is structurally similar to |
4164 |
'using', but affects both the goal state and facts by unfolding given |
|
18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
4165 |
rewrite rules. Thus many occurrences of the 'unfold' method or |
18540 | 4166 |
'unfolded' attribute may be replaced by first-class proof text. |
4167 |
||
18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
4168 |
* Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded', |
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
4169 |
and command 'unfolding' now all support object-level equalities |
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
4170 |
(potentially conditional). The underlying notion of rewrite rule is |
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
4171 |
analogous to the 'rule_format' attribute, but *not* that of the |
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
4172 |
Simplifier (which is usually more generous). |
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
4173 |
|
24238 | 4174 |
* Isar: the new attribute [rotated n] (default n = 1) rotates the |
4175 |
premises of a theorem by n. Useful in conjunction with drule. |
|
4176 |
||
19220 | 4177 |
* Isar: the goal restriction operator [N] (default N = 1) evaluates a |
4178 |
method expression within a sandbox consisting of the first N |
|
19240 | 4179 |
sub-goals, which need to exist. For example, ``simp_all [3]'' |
4180 |
simplifies the first three sub-goals, while (rule foo, simp_all)[] |
|
4181 |
simplifies all new goals that emerge from applying rule foo to the |
|
4182 |
originally first one. |
|
19220 | 4183 |
|
19814
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset
|
4184 |
* Isar: schematic goals are no longer restricted to higher-order |
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset
|
4185 |
patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as |
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset
|
4186 |
expected. |
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset
|
4187 |
|
18901 | 4188 |
* Isar: the conclusion of a long theorem statement is now either |
4189 |
'shows' (a simultaneous conjunction, as before), or 'obtains' |
|
4190 |
(essentially a disjunction of cases with local parameters and |
|
4191 |
assumptions). The latter allows to express general elimination rules |
|
18910 | 4192 |
adequately; in this notation common elimination rules look like this: |
18901 | 4193 |
|
4194 |
lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis" |
|
4195 |
assumes "EX x. P x" |
|
4196 |
obtains x where "P x" |
|
4197 |
||
4198 |
lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis" |
|
4199 |
assumes "A & B" |
|
4200 |
obtains A and B |
|
4201 |
||
4202 |
lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis" |
|
4203 |
assumes "A | B" |
|
4204 |
obtains |
|
4205 |
A |
|
4206 |
| B |
|
4207 |
||
18910 | 4208 |
The subsequent classical rules even refer to the formal "thesis" |
18901 | 4209 |
explicitly: |
4210 |
||
4211 |
lemma classical: -- "(~ thesis ==> thesis) ==> thesis" |
|
4212 |
obtains "~ thesis" |
|
4213 |
||
18910 | 4214 |
lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis" |
4215 |
obtains "thesis ==> something" |
|
18901 | 4216 |
|
4217 |
The actual proof of an 'obtains' statement is analogous to that of the |
|
18910 | 4218 |
Isar proof element 'obtain', only that there may be several cases. |
4219 |
Optional case names may be specified in parentheses; these will be |
|
4220 |
available both in the present proof and as annotations in the |
|
4221 |
resulting rule, for later use with the 'cases' method (cf. attribute |
|
4222 |
case_names). |
|
18901 | 4223 |
|
21447
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset
|
4224 |
* Isar: the assumptions of a long theorem statement are available as |
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset
|
4225 |
"assms" fact in the proof context. This is more appropriate than the |
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset
|
4226 |
(historical) "prems", which refers to all assumptions of the current |
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset
|
4227 |
context, including those from the target locale, proof body etc. |
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset
|
4228 |
|
19263 | 4229 |
* Isar: 'print_statement' prints theorems from the current theory or |
4230 |
proof context in long statement form, according to the syntax of a |
|
4231 |
top-level lemma. |
|
4232 |
||
18901 | 4233 |
* Isar: 'obtain' takes an optional case name for the local context |
4234 |
introduction rule (default "that"). |
|
4235 |
||
19587 | 4236 |
* Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use |
4237 |
explicit (is "_ ==> ?foo") in the rare cases where this still happens |
|
4238 |
to occur. |
|
4239 |
||
19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset
|
4240 |
* Pure: syntax "CONST name" produces a fully internalized constant |
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset
|
4241 |
according to the current context. This is particularly useful for |
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset
|
4242 |
syntax translations that should refer to internal constant |
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset
|
4243 |
representations independently of name spaces. |
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset
|
4244 |
|
21537
45b3a85ee548
* Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents:
21471
diff
changeset
|
4245 |
* Pure: syntax constant for foo (binder "FOO ") is called "foo_binder" |
45b3a85ee548
* Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents:
21471
diff
changeset
|
4246 |
instead of "FOO ". This allows multiple binder declarations to coexist |
45b3a85ee548
* Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents:
21471
diff
changeset
|
4247 |
in the same context. INCOMPATIBILITY. |
45b3a85ee548
* Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents:
21471
diff
changeset
|
4248 |
|
21209
dbb8decc36bc
'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents:
21200
diff
changeset
|
4249 |
* Isar/locales: 'notation' provides a robust interface to the 'syntax' |
dbb8decc36bc
'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents:
21200
diff
changeset
|
4250 |
primitive that also works in a locale context (both for constants and |
24950 | 4251 |
fixed variables). Type declaration and internal syntactic representation |
4252 |
of given constants retrieved from the context. Likewise, the |
|
4253 |
'no_notation' command allows to remove given syntax annotations from the |
|
4254 |
current context. |
|
19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset
|
4255 |
|
19665 | 4256 |
* Isar/locales: new derived specification elements 'axiomatization', |
4257 |
'definition', 'abbreviation', which support type-inference, admit |
|
19083 | 4258 |
object-level specifications (equality, equivalence). See also the |
4259 |
isar-ref manual. Examples: |
|
19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset
|
4260 |
|
19665 | 4261 |
axiomatization |
21595 | 4262 |
eq (infix "===" 50) where |
4263 |
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" |
|
4264 |
||
4265 |
definition "f x y = x + y + 1" |
|
4266 |
definition g where "g x = f x x" |
|
19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset
|
4267 |
|
19363 | 4268 |
abbreviation |
21595 | 4269 |
neq (infix "=!=" 50) where |
19363 | 4270 |
"x =!= y == ~ (x === y)" |
19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset
|
4271 |
|
19083 | 4272 |
These specifications may be also used in a locale context. Then the |
4273 |
constants being introduced depend on certain fixed parameters, and the |
|
4274 |
constant name is qualified by the locale base name. An internal |
|
4275 |
abbreviation takes care for convenient input and output, making the |
|
19088 | 4276 |
parameters implicit and using the original short name. See also |
25177 | 4277 |
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic |
19083 | 4278 |
entities from a monomorphic theory. |
4279 |
||
4280 |
Presently, abbreviations are only available 'in' a target locale, but |
|
19363 | 4281 |
not inherited by general import expressions. Also note that |
4282 |
'abbreviation' may be used as a type-safe replacement for 'syntax' + |
|
24735
3a55ee2cae70
* Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm
parents:
24706
diff
changeset
|
4283 |
'translations' in common applications. The "no_abbrevs" print mode |
3a55ee2cae70
* Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm
parents:
24706
diff
changeset
|
4284 |
prevents folding of abbreviations in term output. |
19084 | 4285 |
|
19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset
|
4286 |
Concrete syntax is attached to specified constants in internal form, |
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset
|
4287 |
independently of name spaces. The parse tree representation is |
21209
dbb8decc36bc
'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents:
21200
diff
changeset
|
4288 |
slightly different -- use 'notation' instead of raw 'syntax', and |
19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset
|
4289 |
'translations' with explicit "CONST" markup to accommodate this. |
19665 | 4290 |
|
24800 | 4291 |
* Pure/Isar: unified syntax for new-style specification mechanisms |
4292 |
(e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits |
|
4293 |
full type inference and dummy patterns ("_"). For example: |
|
24735
3a55ee2cae70
* Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm
parents:
24706
diff
changeset
|
4294 |
|
3a55ee2cae70
* Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm
parents:
24706
diff
changeset
|
4295 |
definition "K x _ = x" |
3a55ee2cae70
* Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm
parents:
24706
diff
changeset
|
4296 |
|
24738 | 4297 |
inductive conj for A B |
4298 |
where "A ==> B ==> conj A B" |
|
4299 |
||
21735 | 4300 |
* Pure: command 'print_abbrevs' prints all constant abbreviations of |
4301 |
the current context. Print mode "no_abbrevs" prevents inversion of |
|
4302 |
abbreviations on output. |
|
4303 |
||
24800 | 4304 |
* Isar/locales: improved parameter handling: use of locales "var" and |
4305 |
"struct" no longer necessary; - parameter renamings are no longer |
|
4306 |
required to be injective. For example, this allows to define |
|
4307 |
endomorphisms as locale endom = homom mult mult h. |
|
19783 | 4308 |
|
19931
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset
|
4309 |
* Isar/locales: changed the way locales with predicates are defined. |
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset
|
4310 |
Instead of accumulating the specification, the imported expression is |
22126 | 4311 |
now an interpretation. INCOMPATIBILITY: different normal form of |
4312 |
locale expressions. In particular, in interpretations of locales with |
|
4313 |
predicates, goals repesenting already interpreted fragments are not |
|
4314 |
removed automatically. Use methods `intro_locales' and |
|
4315 |
`unfold_locales'; see below. |
|
4316 |
||
4317 |
* Isar/locales: new methods `intro_locales' and `unfold_locales' |
|
4318 |
provide backward reasoning on locales predicates. The methods are |
|
4319 |
aware of interpretations and discharge corresponding goals. |
|
4320 |
`intro_locales' is less aggressive then `unfold_locales' and does not |
|
4321 |
unfold predicates to assumptions. |
|
19931
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset
|
4322 |
|
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset
|
4323 |
* Isar/locales: the order in which locale fragments are accumulated |
22126 | 4324 |
has changed. This enables to override declarations from fragments due |
4325 |
to interpretations -- for example, unwanted simp rules. |
|
19931
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset
|
4326 |
|
23920 | 4327 |
* Isar/locales: interpretation in theories and proof contexts has been |
4328 |
extended. One may now specify (and prove) equations, which are |
|
4329 |
unfolded in interpreted theorems. This is useful for replacing |
|
4330 |
defined concepts (constants depending on locale parameters) by |
|
4331 |
concepts already existing in the target context. Example: |
|
4332 |
||
4333 |
interpretation partial_order ["op <= :: [int, int] => bool"] |
|
4334 |
where "partial_order.less (op <=) (x::int) y = (x < y)" |
|
4335 |
||
24800 | 4336 |
Typically, the constant `partial_order.less' is created by a |
4337 |
definition specification element in the context of locale |
|
4338 |
partial_order. |
|
4339 |
||
24859 | 4340 |
* Method "induct": improved internal context management to support |
24800 | 4341 |
local fixes and defines on-the-fly. Thus explicit meta-level |
4342 |
connectives !! and ==> are rarely required anymore in inductive goals |
|
4343 |
(using object-logic connectives for this purpose has been long |
|
4344 |
obsolete anyway). Common proof patterns are explained in |
|
25177 | 4345 |
src/HOL/Induct/Common_Patterns.thy, see also |
4346 |
src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic |
|
4347 |
examples. |
|
24606
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset
|
4348 |
|
24859 | 4349 |
* Method "induct": improved handling of simultaneous goals. Instead of |
24606
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset
|
4350 |
introducing object-level conjunction, the statement is now split into |
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset
|
4351 |
several conclusions, while the corresponding symbolic cases are nested |
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset
|
4352 |
accordingly. INCOMPATIBILITY, proofs need to be structured explicitly, |
25177 | 4353 |
see src/HOL/Induct/Common_Patterns.thy, for example. |
24606
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset
|
4354 |
|
24859 | 4355 |
* Method "induct": mutual induction rules are now specified as a list |
24800 | 4356 |
of rule sharing the same induction cases. HOL packages usually provide |
24606
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset
|
4357 |
foo_bar.inducts for mutually defined items foo and bar (e.g. inductive |
24859 | 4358 |
predicates/sets or datatypes). INCOMPATIBILITY, users need to specify |
4359 |
mutual induction rules differently, i.e. like this: |
|
18506
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset
|
4360 |
|
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset
|
4361 |
(induct rule: foo_bar.inducts) |
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset
|
4362 |
(induct set: foo bar) |
24859 | 4363 |
(induct pred: foo bar) |
18506
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset
|
4364 |
(induct type: foo bar) |
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset
|
4365 |
|
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset
|
4366 |
The ML function ProjectRule.projections turns old-style rules into the |
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset
|
4367 |
new format. |
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset
|
4368 |
|
24859 | 4369 |
* Method "coinduct": dual of induction, see |
18399 | 4370 |
src/HOL/Library/Coinductive_List.thy for various examples. |
4371 |
||
24859 | 4372 |
* Method "cases", "induct", "coinduct": the ``(open)'' option is |
4373 |
considered a legacy feature. |
|
4374 |
||
20919
dab803075c62
attribute "symmetric": standardized schematic variables;
wenzelm
parents:
20857
diff
changeset
|
4375 |
* Attribute "symmetric" produces result with standardized schematic |
dab803075c62
attribute "symmetric": standardized schematic variables;
wenzelm
parents:
20857
diff
changeset
|
4376 |
variables (index 0). Potential INCOMPATIBILITY. |
dab803075c62
attribute "symmetric": standardized schematic variables;
wenzelm
parents:
20857
diff
changeset
|
4377 |
|
22126 | 4378 |
* Simplifier: by default the simplifier trace only shows top level |
4379 |
rewrites now. That is, trace_simp_depth_limit is set to 1 by |
|
4380 |
default. Thus there is less danger of being flooded by the trace. The |
|
4381 |
trace indicates where parts have been suppressed. |
|
18674 | 4382 |
|
18536
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
4383 |
* Provers/classical: removed obsolete classical version of elim_format |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
4384 |
attribute; classical elim/dest rules are now treated uniformly when |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
4385 |
manipulating the claset. |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
4386 |
|
18694 | 4387 |
* Provers/classical: stricter checks to ensure that supplied intro, |
4388 |
dest and elim rules are well-formed; dest and elim rules must have at |
|
4389 |
least one premise. |
|
4390 |
||
4391 |
* Provers/classical: attributes dest/elim/intro take an optional |
|
18695 | 4392 |
weight argument for the rule (just as the Pure versions). Weights are |
18696 | 4393 |
ignored by automated tools, but determine the search order of single |
18694 | 4394 |
rule steps. |
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18549
diff
changeset
|
4395 |
|
18536
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
4396 |
* Syntax: input syntax now supports dummy variable binding "%_. b", |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
4397 |
where the body does not mention the bound variable. Note that dummy |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
4398 |
patterns implicitly depend on their context of bounds, which makes |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
4399 |
"{_. _}" match any set comprehension as expected. Potential |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
4400 |
INCOMPATIBILITY -- parse translations need to cope with syntactic |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
4401 |
constant "_idtdummy" in the binding position. |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
4402 |
|
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
4403 |
* Syntax: removed obsolete syntactic constant "_K" and its associated |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
4404 |
parse translation. INCOMPATIBILITY -- use dummy abstraction instead, |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
4405 |
for example "A -> B" => "Pi A (%_. B)". |
17779 | 4406 |
|
20582
ebd0e03c6a9b
* Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents:
20503
diff
changeset
|
4407 |
* Pure: 'class_deps' command visualizes the subclass relation, using |
ebd0e03c6a9b
* Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents:
20503
diff
changeset
|
4408 |
the graph browser tool. |
ebd0e03c6a9b
* Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents:
20503
diff
changeset
|
4409 |
|
24800 | 4410 |
* Pure: 'print_theory' now suppresses certain internal declarations by |
4411 |
default; use '!' option for full details. |
|
20620
8b26f58c5646
* Pure: 'print_theory' now suppresses entities with internal name;
wenzelm
parents:
20607
diff
changeset
|
4412 |
|
17865 | 4413 |
|
17806 | 4414 |
*** HOL *** |
4415 |
||
25129 | 4416 |
* Method "metis" proves goals by applying the Metis general-purpose |
4417 |
resolution prover (see also http://gilith.com/software/metis/). |
|
4418 |
Examples are in the directory MetisExamples. WARNING: the |
|
4419 |
Isabelle/HOL-Metis integration does not yet work properly with |
|
4420 |
multi-threading. |
|
4421 |
||
4422 |
* Command 'sledgehammer' invokes external automatic theorem provers as |
|
4423 |
background processes. It generates calls to the "metis" method if |
|
4424 |
successful. These can be pasted into the proof. Users do not have to |
|
4425 |
wait for the automatic provers to return. WARNING: does not really |
|
4426 |
work with multi-threading. |
|
4427 |
||
24804 | 4428 |
* New "auto_quickcheck" feature tests outermost goal statements for |
4429 |
potential counter-examples. Controlled by ML references |
|
4430 |
auto_quickcheck (default true) and auto_quickcheck_time_limit (default |
|
25129 | 4431 |
5000 milliseconds). Fails silently if statements is outside of |
4432 |
executable fragment, or any other codgenerator problem occurs. |
|
24804 | 4433 |
|
25184 | 4434 |
* New constant "undefined" with axiom "undefined x = undefined". |
4435 |
||
4436 |
* Added class "HOL.eq", allowing for code generation with polymorphic |
|
4437 |
equality. |
|
4438 |
||
4439 |
* Some renaming of class constants due to canonical name prefixing in |
|
4440 |
the new 'class' package: |
|
4441 |
||
4442 |
HOL.abs ~> HOL.abs_class.abs |
|
4443 |
HOL.divide ~> HOL.divide_class.divide |
|
4444 |
0 ~> HOL.zero_class.zero |
|
4445 |
1 ~> HOL.one_class.one |
|
4446 |
op + ~> HOL.plus_class.plus |
|
4447 |
op - ~> HOL.minus_class.minus |
|
4448 |
uminus ~> HOL.minus_class.uminus |
|
4449 |
op * ~> HOL.times_class.times |
|
4450 |
op < ~> HOL.ord_class.less |
|
4451 |
op <= > HOL.ord_class.less_eq |
|
4452 |
Nat.power ~> Power.power_class.power |
|
4453 |
Nat.size ~> Nat.size_class.size |
|
4454 |
Numeral.number_of ~> Numeral.number_class.number_of |
|
4455 |
FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf |
|
4456 |
FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup |
|
4457 |
Orderings.min ~> Orderings.ord_class.min |
|
4458 |
Orderings.max ~> Orderings.ord_class.max |
|
4459 |
Divides.op div ~> Divides.div_class.div |
|
4460 |
Divides.op mod ~> Divides.div_class.mod |
|
4461 |
Divides.op dvd ~> Divides.div_class.dvd |
|
4462 |
||
4463 |
INCOMPATIBILITY. Adaptions may be required in the following cases: |
|
4464 |
||
4465 |
a) User-defined constants using any of the names "plus", "minus", |
|
4466 |
"times", "less" or "less_eq". The standard syntax translations for |
|
4467 |
"+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific |
|
4468 |
names. |
|
4469 |
||
4470 |
b) Variables named "plus", "minus", "times", "less", "less_eq" |
|
4471 |
INCOMPATIBILITY: use more specific names. |
|
4472 |
||
4473 |
c) Permutative equations (e.g. "a + b = b + a") |
|
4474 |
Since the change of names also changes the order of terms, permutative |
|
4475 |
rewrite rules may get applied in a different order. Experience shows |
|
4476 |
that this is rarely the case (only two adaptions in the whole Isabelle |
|
4477 |
distribution). INCOMPATIBILITY: rewrite proofs |
|
4478 |
||
4479 |
d) ML code directly refering to constant names |
|
4480 |
This in general only affects hand-written proof tactics, simprocs and |
|
4481 |
so on. INCOMPATIBILITY: grep your sourcecode and replace names. |
|
4482 |
Consider using @{const_name} antiquotation. |
|
4483 |
||
4484 |
* New class "default" with associated constant "default". |
|
4485 |
||
4486 |
* Function "sgn" is now overloaded and available on int, real, complex |
|
4487 |
(and other numeric types), using class "sgn". Two possible defs of |
|
4488 |
sgn are given as equational assumptions in the classes sgn_if and |
|
4489 |
sgn_div_norm; ordered_idom now also inherits from sgn_if. |
|
4490 |
INCOMPATIBILITY. |
|
4491 |
||
4492 |
* Locale "partial_order" now unified with class "order" (cf. theory |
|
4493 |
Orderings), added parameter "less". INCOMPATIBILITY. |
|
4494 |
||
4495 |
* Renamings in classes "order" and "linorder": facts "refl", "trans" and |
|
4496 |
"cases" to "order_refl", "order_trans" and "linorder_cases", to avoid |
|
4497 |
clashes with HOL "refl" and "trans". INCOMPATIBILITY. |
|
4498 |
||
4499 |
* Classes "order" and "linorder": potential INCOMPATIBILITY due to |
|
4500 |
changed order of proof goals in instance proofs. |
|
4501 |
||
4502 |
* The transitivity reasoner for partial and linear orders is set up |
|
4503 |
for classes "order" and "linorder". Instances of the reasoner are available |
|
4504 |
in all contexts importing or interpreting the corresponding locales. |
|
4505 |
Method "order" invokes the reasoner separately; the reasoner |
|
4506 |
is also integrated with the Simplifier as a solver. Diagnostic |
|
4507 |
command 'print_orders' shows the available instances of the reasoner |
|
4508 |
in the current context. |
|
4509 |
||
4510 |
* Localized monotonicity predicate in theory "Orderings"; integrated |
|
4511 |
lemmas max_of_mono and min_of_mono with this predicate. |
|
4512 |
INCOMPATIBILITY. |
|
4513 |
||
4514 |
* Formulation of theorem "dense" changed slightly due to integration |
|
4515 |
with new class dense_linear_order. |
|
4516 |
||
4517 |
* Uniform lattice theory development in HOL. |
|
4518 |
||
4519 |
constants "meet" and "join" now named "inf" and "sup" |
|
4520 |
constant "Meet" now named "Inf" |
|
4521 |
||
4522 |
classes "meet_semilorder" and "join_semilorder" now named |
|
4523 |
"lower_semilattice" and "upper_semilattice" |
|
4524 |
class "lorder" now named "lattice" |
|
4525 |
class "comp_lat" now named "complete_lattice" |
|
4526 |
||
4527 |
Instantiation of lattice classes allows explicit definitions |
|
4528 |
for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices). |
|
4529 |
||
4530 |
INCOMPATIBILITY. Theorem renames: |
|
4531 |
||
4532 |
meet_left_le ~> inf_le1 |
|
4533 |
meet_right_le ~> inf_le2 |
|
4534 |
join_left_le ~> sup_ge1 |
|
4535 |
join_right_le ~> sup_ge2 |
|
4536 |
meet_join_le ~> inf_sup_ord |
|
4537 |
le_meetI ~> le_infI |
|
4538 |
join_leI ~> le_supI |
|
4539 |
le_meet ~> le_inf_iff |
|
4540 |
le_join ~> ge_sup_conv |
|
4541 |
meet_idempotent ~> inf_idem |
|
4542 |
join_idempotent ~> sup_idem |
|
4543 |
meet_comm ~> inf_commute |
|
4544 |
join_comm ~> sup_commute |
|
4545 |
meet_leI1 ~> le_infI1 |
|
4546 |
meet_leI2 ~> le_infI2 |
|
4547 |
le_joinI1 ~> le_supI1 |
|
4548 |
le_joinI2 ~> le_supI2 |
|
4549 |
meet_assoc ~> inf_assoc |
|
4550 |
join_assoc ~> sup_assoc |
|
4551 |
meet_left_comm ~> inf_left_commute |
|
4552 |
meet_left_idempotent ~> inf_left_idem |
|
4553 |
join_left_comm ~> sup_left_commute |
|
4554 |
join_left_idempotent ~> sup_left_idem |
|
4555 |
meet_aci ~> inf_aci |
|
4556 |
join_aci ~> sup_aci |
|
4557 |
le_def_meet ~> le_iff_inf |
|
4558 |
le_def_join ~> le_iff_sup |
|
4559 |
join_absorp2 ~> sup_absorb2 |
|
4560 |
join_absorp1 ~> sup_absorb1 |
|
4561 |
meet_absorp1 ~> inf_absorb1 |
|
4562 |
meet_absorp2 ~> inf_absorb2 |
|
4563 |
meet_join_absorp ~> inf_sup_absorb |
|
4564 |
join_meet_absorp ~> sup_inf_absorb |
|
4565 |
distrib_join_le ~> distrib_sup_le |
|
4566 |
distrib_meet_le ~> distrib_inf_le |
|
4567 |
||
4568 |
add_meet_distrib_left ~> add_inf_distrib_left |
|
4569 |
add_join_distrib_left ~> add_sup_distrib_left |
|
4570 |
is_join_neg_meet ~> is_join_neg_inf |
|
4571 |
is_meet_neg_join ~> is_meet_neg_sup |
|
4572 |
add_meet_distrib_right ~> add_inf_distrib_right |
|
4573 |
add_join_distrib_right ~> add_sup_distrib_right |
|
4574 |
add_meet_join_distribs ~> add_sup_inf_distribs |
|
4575 |
join_eq_neg_meet ~> sup_eq_neg_inf |
|
4576 |
meet_eq_neg_join ~> inf_eq_neg_sup |
|
4577 |
add_eq_meet_join ~> add_eq_inf_sup |
|
4578 |
meet_0_imp_0 ~> inf_0_imp_0 |
|
4579 |
join_0_imp_0 ~> sup_0_imp_0 |
|
4580 |
meet_0_eq_0 ~> inf_0_eq_0 |
|
4581 |
join_0_eq_0 ~> sup_0_eq_0 |
|
4582 |
neg_meet_eq_join ~> neg_inf_eq_sup |
|
4583 |
neg_join_eq_meet ~> neg_sup_eq_inf |
|
4584 |
join_eq_if ~> sup_eq_if |
|
4585 |
||
4586 |
mono_meet ~> mono_inf |
|
4587 |
mono_join ~> mono_sup |
|
4588 |
meet_bool_eq ~> inf_bool_eq |
|
4589 |
join_bool_eq ~> sup_bool_eq |
|
4590 |
meet_fun_eq ~> inf_fun_eq |
|
4591 |
join_fun_eq ~> sup_fun_eq |
|
4592 |
meet_set_eq ~> inf_set_eq |
|
4593 |
join_set_eq ~> sup_set_eq |
|
4594 |
meet1_iff ~> inf1_iff |
|
4595 |
meet2_iff ~> inf2_iff |
|
4596 |
meet1I ~> inf1I |
|
4597 |
meet2I ~> inf2I |
|
4598 |
meet1D1 ~> inf1D1 |
|
4599 |
meet2D1 ~> inf2D1 |
|
4600 |
meet1D2 ~> inf1D2 |
|
4601 |
meet2D2 ~> inf2D2 |
|
4602 |
meet1E ~> inf1E |
|
4603 |
meet2E ~> inf2E |
|
4604 |
join1_iff ~> sup1_iff |
|
4605 |
join2_iff ~> sup2_iff |
|
4606 |
join1I1 ~> sup1I1 |
|
4607 |
join2I1 ~> sup2I1 |
|
4608 |
join1I1 ~> sup1I1 |
|
4609 |
join2I2 ~> sup1I2 |
|
4610 |
join1CI ~> sup1CI |
|
4611 |
join2CI ~> sup2CI |
|
4612 |
join1E ~> sup1E |
|
4613 |
join2E ~> sup2E |
|
4614 |
||
4615 |
is_meet_Meet ~> is_meet_Inf |
|
4616 |
Meet_bool_def ~> Inf_bool_def |
|
4617 |
Meet_fun_def ~> Inf_fun_def |
|
4618 |
Meet_greatest ~> Inf_greatest |
|
4619 |
Meet_lower ~> Inf_lower |
|
4620 |
Meet_set_def ~> Inf_set_def |
|
4621 |
||
4622 |
Sup_def ~> Sup_Inf |
|
4623 |
Sup_bool_eq ~> Sup_bool_def |
|
4624 |
Sup_fun_eq ~> Sup_fun_def |
|
4625 |
Sup_set_eq ~> Sup_set_def |
|
4626 |
||
4627 |
listsp_meetI ~> listsp_infI |
|
4628 |
listsp_meet_eq ~> listsp_inf_eq |
|
4629 |
||
4630 |
meet_min ~> inf_min |
|
4631 |
join_max ~> sup_max |
|
4632 |
||
4633 |
* Added syntactic class "size"; overloaded constant "size" now has |
|
4634 |
type "'a::size ==> bool" |
|
4635 |
||
24800 | 4636 |
* Internal reorganisation of `size' of datatypes: size theorems |
4637 |
"foo.size" are no longer subsumed by "foo.simps" (but are still |
|
4638 |
simplification rules by default!); theorems "prod.size" now named |
|
25184 | 4639 |
"*.size". |
4640 |
||
4641 |
* Class "div" now inherits from class "times" rather than "type". |
|
4642 |
INCOMPATIBILITY. |
|
24800 | 4643 |
|
4644 |
* HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice, |
|
4645 |
Linorder etc. have disappeared; operations defined in terms of |
|
4646 |
fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY. |
|
4647 |
||
25129 | 4648 |
* HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY. |
4649 |
||
24800 | 4650 |
* HOL-Word: New extensive library and type for generic, fixed size |
4651 |
machine words, with arithemtic, bit-wise, shifting and rotating |
|
4652 |
operations, reflection into int, nat, and bool lists, automation for |
|
4653 |
linear arithmetic (by automatic reflection into nat or int), including |
|
4654 |
lemmas on overflow and monotonicity. Instantiated to all appropriate |
|
4655 |
arithmetic type classes, supporting automatic simplification of |
|
4656 |
numerals on all operations. |
|
24333 | 4657 |
|
4658 |
* Library/Boolean_Algebra: locales for abstract boolean algebras. |
|
4659 |
||
4660 |
* Library/Numeral_Type: numbers as types, e.g. TYPE(32). |
|
4661 |
||
23850 | 4662 |
* Code generator library theories: |
24993 | 4663 |
- Code_Integer represents HOL integers by big integer literals in target |
23850 | 4664 |
languages. |
24993 | 4665 |
- Code_Char represents HOL characters by character literals in target |
23850 | 4666 |
languages. |
24993 | 4667 |
- Code_Char_chr like Code_Char, but also offers treatment of character |
4668 |
codes; includes Code_Integer. |
|
24800 | 4669 |
- Executable_Set allows to generate code for finite sets using lists. |
4670 |
- Executable_Rat implements rational numbers as triples (sign, enumerator, |
|
23850 | 4671 |
denominator). |
24800 | 4672 |
- Executable_Real implements a subset of real numbers, namly those |
23850 | 4673 |
representable by rational numbers. |
24800 | 4674 |
- Efficient_Nat implements natural numbers by integers, which in general will |
23850 | 4675 |
result in higher efficency; pattern matching with 0/Suc is eliminated; |
24993 | 4676 |
includes Code_Integer. |
4677 |
- Code_Index provides an additional datatype index which is mapped to |
|
4678 |
target-language built-in integers. |
|
26355 | 4679 |
- Code_Message provides an additional datatype message_string which is isomorphic to |
24993 | 4680 |
strings; messages are mapped to target-language strings. |
23850 | 4681 |
|
23783
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4682 |
* New package for inductive predicates |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4683 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4684 |
An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4685 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4686 |
inductive |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4687 |
p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4688 |
for z_1 :: U_1 and ... and z_n :: U_m |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4689 |
where |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4690 |
rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4691 |
| ... |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4692 |
|
24800 | 4693 |
with full support for type-inference, rather than |
23783
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4694 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4695 |
consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4696 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4697 |
abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4698 |
where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4699 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4700 |
inductive "s z_1 ... z_m" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4701 |
intros |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4702 |
rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4703 |
... |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4704 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4705 |
For backward compatibility, there is a wrapper allowing inductive |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4706 |
sets to be defined with the new package via |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4707 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4708 |
inductive_set |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4709 |
s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4710 |
for z_1 :: U_1 and ... and z_n :: U_m |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4711 |
where |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4712 |
rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4713 |
| ... |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4714 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4715 |
or |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4716 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4717 |
inductive_set |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4718 |
s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4719 |
and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4720 |
for z_1 :: U_1 and ... and z_n :: U_m |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4721 |
where |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4722 |
"p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4723 |
| rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4724 |
| ... |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4725 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4726 |
if the additional syntax "p ..." is required. |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4727 |
|
25177 | 4728 |
Numerous examples can be found in the subdirectories src/HOL/Auth, |
4729 |
src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava. |
|
23783
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4730 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4731 |
INCOMPATIBILITIES: |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4732 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4733 |
- Since declaration and definition of inductive sets or predicates |
24800 | 4734 |
is no longer separated, abbreviations involving the newly |
4735 |
introduced sets or predicates must be specified together with the |
|
4736 |
introduction rules after the 'where' keyword (see above), rather |
|
4737 |
than before the actual inductive definition. |
|
4738 |
||
4739 |
- The variables in induction and elimination rules are now |
|
4740 |
quantified in the order of their occurrence in the introduction |
|
4741 |
rules, rather than in alphabetical order. Since this may break |
|
4742 |
some proofs, these proofs either have to be repaired, e.g. by |
|
4743 |
reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case' |
|
4744 |
statements of the form |
|
23783
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4745 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4746 |
case (rule_i a_i_1 ... a_i_{k_i}) |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4747 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4748 |
or the old order of quantification has to be restored by explicitly adding |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4749 |
meta-level quantifiers in the introduction rules, i.e. |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4750 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4751 |
| rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4752 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4753 |
- The format of the elimination rules is now |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4754 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4755 |
p z_1 ... z_m x_1 ... x_n ==> |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4756 |
(!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P) |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4757 |
==> ... ==> P |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4758 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4759 |
for predicates and |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4760 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4761 |
(x_1, ..., x_n) : s z_1 ... z_m ==> |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4762 |
(!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P) |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4763 |
==> ... ==> P |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4764 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4765 |
for sets rather than |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4766 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4767 |
x : s z_1 ... z_m ==> |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4768 |
(!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P) |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4769 |
==> ... ==> P |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4770 |
|
24800 | 4771 |
This may require terms in goals to be expanded to n-tuples |
4772 |
(e.g. using case_tac or simplification with the split_paired_all |
|
4773 |
rule) before the above elimination rule is applicable. |
|
4774 |
||
4775 |
- The elimination or case analysis rules for (mutually) inductive |
|
4776 |
sets or predicates are now called "p_1.cases" ... "p_k.cases". The |
|
4777 |
list of rules "p_1_..._p_k.elims" is no longer available. |
|
23783
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
4778 |
|
25198 | 4779 |
* New package "function"/"fun" for general recursive functions, |
4780 |
supporting mutual and nested recursion, definitions in local contexts, |
|
4781 |
more general pattern matching and partiality. See HOL/ex/Fundefs.thy |
|
4782 |
for small examples, and the separate tutorial on the function |
|
4783 |
package. The old recdef "package" is still available as before, but |
|
4784 |
users are encouraged to use the new package. |
|
4785 |
||
4786 |
* Method "lexicographic_order" automatically synthesizes termination |
|
4787 |
relations as lexicographic combinations of size measures. |
|
4788 |
||
24800 | 4789 |
* Case-expressions allow arbitrary constructor-patterns (including |
4790 |
"_") and take their order into account, like in functional |
|
4791 |
programming. Internally, this is translated into nested |
|
4792 |
case-expressions; missing cases are added and mapped to the predefined |
|
4793 |
constant "undefined". In complicated cases printing may no longer show |
|
4794 |
the original input but the internal form. Lambda-abstractions allow |
|
4795 |
the same form of pattern matching: "% pat1 => e1 | ..." is an |
|
4796 |
abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new |
|
4797 |
variable. |
|
23564 | 4798 |
|
23468 | 4799 |
* IntDef: The constant "int :: nat => int" has been removed; now "int" |
24800 | 4800 |
is an abbreviation for "of_nat :: nat => int". The simplification |
4801 |
rules for "of_nat" have been changed to work like "int" did |
|
4802 |
previously. Potential INCOMPATIBILITY: |
|
23468 | 4803 |
- "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1" |
4804 |
- of_nat_diff and of_nat_mult are no longer default simp rules |
|
23377 | 4805 |
|
23295
86e225406859
Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents:
23251
diff
changeset
|
4806 |
* Method "algebra" solves polynomial equations over (semi)rings using |
24800 | 4807 |
Groebner bases. The (semi)ring structure is defined by locales and the |
4808 |
tool setup depends on that generic context. Installing the method for |
|
4809 |
a specific type involves instantiating the locale and possibly adding |
|
4810 |
declarations for computation on the coefficients. The method is |
|
4811 |
already instantiated for natural numbers and for the axiomatic class |
|
4812 |
of idoms with numerals. See also the paper by Chaieb and Wenzel at |
|
4813 |
CALCULEMUS 2007 for the general principles underlying this |
|
4814 |
architecture of context-aware proof-tools. |
|
4815 |
||
25033 | 4816 |
* Method "ferrack" implements quantifier elimination over |
4817 |
special-purpose dense linear orders using locales (analogous to |
|
4818 |
"algebra"). The method is already installed for class |
|
4819 |
{ordered_field,recpower,number_ring} which subsumes real, hyperreal, |
|
4820 |
rat, etc. |
|
4821 |
||
24800 | 4822 |
* Former constant "List.op @" now named "List.append". Use ML |
4823 |
antiquotations @{const_name List.append} or @{term " ... @ ... "} to |
|
4824 |
circumvent possible incompatibilities when working on ML level. |
|
4825 |
||
24996 | 4826 |
* primrec: missing cases mapped to "undefined" instead of "arbitrary". |
22845 | 4827 |
|
24800 | 4828 |
* New function listsum :: 'a list => 'a for arbitrary monoids. |
4829 |
Special syntax: "SUM x <- xs. f x" (and latex variants) |
|
4830 |
||
4831 |
* New syntax for Haskell-like list comprehension (input only), eg. |
|
25177 | 4832 |
[(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy. |
24800 | 4833 |
|
4834 |
* The special syntax for function "filter" has changed from [x : |
|
4835 |
xs. P] to [x <- xs. P] to avoid an ambiguity caused by list |
|
4836 |
comprehension syntax, and for uniformity. INCOMPATIBILITY. |
|
4837 |
||
4838 |
* [a..b] is now defined for arbitrary linear orders. It used to be |
|
4839 |
defined on nat only, as an abbreviation for [a..<Suc b] |
|
4840 |
INCOMPATIBILITY. |
|
4841 |
||
4842 |
* Renamed lemma "set_take_whileD" to "set_takeWhileD". |
|
4843 |
||
25177 | 4844 |
* New functions "sorted" and "sort" in src/HOL/List.thy. |
24800 | 4845 |
|
4846 |
* New lemma collection field_simps (an extension of ring_simps) for |
|
4847 |
manipulating (in)equations involving division. Multiplies with all |
|
4848 |
denominators that can be proved to be non-zero (in equations) or |
|
4849 |
positive/negative (in inequations). |
|
23480 | 4850 |
|
4851 |
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib |
|
24800 | 4852 |
have been improved and renamed to ring_simps, group_simps and |
4853 |
ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field |
|
4854 |
because they were subsumed by lemmas xyz. INCOMPATIBILITY. |
|
4855 |
||
25177 | 4856 |
* Theory Library/Commutative_Ring: switched from recdef to function |
24800 | 4857 |
package; constants add, mul, pow now curried. Infix syntax for |
4858 |
algebraic operations. |
|
22735 | 4859 |
|
24800 | 4860 |
* Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq. |
22218 | 4861 |
INCOMPATIBILITY. |
4862 |
||
24800 | 4863 |
* Dropped redundant lemma if_def2 in favor of if_bool_eq_conj. |
22218 | 4864 |
INCOMPATIBILITY. |
4865 |
||
22126 | 4866 |
* HOL/records: generalised field-update to take a function on the |
4867 |
field rather than the new value: r(|A := x|) is translated to A_update |
|
4868 |
(K x) r The K-combinator that is internally used is called K_record. |
|
21226
a607ae87ee81
field-update in records is generalised to take a function on the field
schirmer
parents:
21215
diff
changeset
|
4869 |
INCOMPATIBILITY: Usage of the plain update functions has to be |
a607ae87ee81
field-update in records is generalised to take a function on the field
schirmer
parents:
21215
diff
changeset
|
4870 |
adapted. |
a607ae87ee81
field-update in records is generalised to take a function on the field
schirmer
parents:
21215
diff
changeset
|
4871 |
|
24800 | 4872 |
* Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0 |
4873 |
* x = 0, which are required for a semiring. Richer structures do not |
|
4874 |
inherit from semiring_0 anymore, because this property is a theorem |
|
4875 |
there, not an axiom. INCOMPATIBILITY: In instances of semiring_0, |
|
4876 |
there is more to prove, but this is mostly trivial. |
|
4877 |
||
4878 |
* Class "recpower" is generalized to arbitrary monoids, not just |
|
4879 |
commutative semirings. INCOMPATIBILITY: may need to incorporate |
|
25163 | 4880 |
commutativity or semiring properties additionally. |
21215
7c9337a0e30a
made locale partial_order compatible with axclass order
haftmann
parents:
21209
diff
changeset
|
4881 |
|
21099 | 4882 |
* Constant "List.list_all2" in List.thy now uses authentic syntax. |
24800 | 4883 |
INCOMPATIBILITY: translations containing list_all2 may go wrong, |
4884 |
better use 'abbreviation'. |
|
4885 |
||
4886 |
* Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY. |
|
4887 |
||
22126 | 4888 |
* Numeral syntax: type 'bin' which was a mere type copy of 'int' has |
24800 | 4889 |
been abandoned in favour of plain 'int'. INCOMPATIBILITY -- |
22126 | 4890 |
significant changes for setting up numeral syntax for types: |
24800 | 4891 |
- New constants Numeral.pred and Numeral.succ instead |
20485 | 4892 |
of former Numeral.bin_pred and Numeral.bin_succ. |
4893 |
- Use integer operations instead of bin_add, bin_mult and so on. |
|
4894 |
- Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps. |
|
4895 |
- ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. |
|
4896 |
||
25177 | 4897 |
See src/HOL/Integ/IntArith.thy for an example setup. |
4898 |
||
4899 |
* Command 'normal_form' computes the normal form of a term that may |
|
4900 |
contain free variables. For example ``normal_form "rev [a, b, c]"'' |
|
4901 |
produces ``[b, c, a]'' (without proof). This command is suitable for |
|
4902 |
heavy-duty computations because the functions are compiled to ML |
|
4903 |
first. Correspondingly, a method "normalization" is provided. See |
|
4904 |
further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML. |
|
19895 | 4905 |
|
17996 | 4906 |
* Alternative iff syntax "A <-> B" for equality on bool (with priority |
4907 |
25 like -->); output depends on the "iff" print_mode, the default is |
|
4908 |
"A = B" (with priority 50). |
|
4909 |
||
21265 | 4910 |
* Relations less (<) and less_eq (<=) are also available on type bool. |
4911 |
Modified syntax to disallow nesting without explicit parentheses, |
|
24800 | 4912 |
e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential |
4913 |
INCOMPATIBILITY. |
|
21265 | 4914 |
|
18674 | 4915 |
* "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only). |
4916 |
||
20716
a6686a8e1b68
Changed precedence of "op O" (relation composition) from 60 to 75.
krauss
parents:
20712
diff
changeset
|
4917 |
* Relation composition operator "op O" now has precedence 75 and binds |
a6686a8e1b68
Changed precedence of "op O" (relation composition) from 60 to 75.
krauss
parents:
20712
diff
changeset
|
4918 |
stronger than union and intersection. INCOMPATIBILITY. |
a6686a8e1b68
Changed precedence of "op O" (relation composition) from 60 to 75.
krauss
parents:
20712
diff
changeset
|
4919 |
|
22126 | 4920 |
* The old set interval syntax "{m..n(}" (and relatives) has been |
4921 |
removed. Use "{m..<n}" (and relatives) instead. |
|
19377 | 4922 |
|
17865 | 4923 |
* In the context of the assumption "~(s = t)" the Simplifier rewrites |
24800 | 4924 |
"t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using |
4925 |
``declare [[simproc del: neq]]''. |
|
4926 |
||
4927 |
* Simplifier: "m dvd n" where m and n are numbers is evaluated to |
|
4928 |
True/False. |
|
4929 |
||
4930 |
* Theorem Cons_eq_map_conv no longer declared as "simp". |
|
19211 | 4931 |
|
19279 | 4932 |
* Theorem setsum_mult renamed to setsum_right_distrib. |
4933 |
||
19211 | 4934 |
* Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the |
22126 | 4935 |
``rule'' method. |
4936 |
||
24800 | 4937 |
* Reimplemented methods "sat" and "satx", with several improvements: |
4938 |
goals no longer need to be stated as "<prems> ==> False", equivalences |
|
4939 |
(i.e. "=" on type bool) are handled, variable names of the form |
|
4940 |
"lit_<n>" are no longer reserved, significant speedup. |
|
4941 |
||
4942 |
* Methods "sat" and "satx" can now replay MiniSat proof traces. |
|
22126 | 4943 |
zChaff is still supported as well. |
4944 |
||
4945 |
* 'inductive' and 'datatype': provide projections of mutual rules, |
|
4946 |
bundled as foo_bar.inducts; |
|
4947 |
||
4948 |
* Library: moved theories Parity, GCD, Binomial, Infinite_Set to |
|
4949 |
Library. |
|
21256 | 4950 |
|
4951 |
* Library: moved theory Accessible_Part to main HOL. |
|
19572
a4b3176f19dd
* Library: theory Accessible_Part has been move to main HOL.
wenzelm
parents:
19508
diff
changeset
|
4952 |
|
18446 | 4953 |
* Library: added theory Coinductive_List of potentially infinite lists |
4954 |
as greatest fixed-point. |
|
18399 | 4955 |
|
19254 | 4956 |
* Library: added theory AssocList which implements (finite) maps as |
19252 | 4957 |
association lists. |
17809
195045659c06
Tactics sat and satx reimplemented, several improvements
webertj
parents:
17806
diff
changeset
|
4958 |
|
24800 | 4959 |
* Method "evaluation" solves goals (i.e. a boolean expression) |
4960 |
efficiently by compiling it to ML. The goal is "proved" (via an |
|
4961 |
oracle) if it evaluates to True. |
|
20807 | 4962 |
|
4963 |
* Linear arithmetic now splits certain operators (e.g. min, max, abs) |
|
24800 | 4964 |
also when invoked by the simplifier. This results in the Simplifier |
4965 |
being more powerful on arithmetic goals. INCOMPATIBILITY. |
|
4966 |
Configuration option fast_arith_split_limit=0 recovers the old |
|
4967 |
behavior. |
|
20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
20188
diff
changeset
|
4968 |
|
22126 | 4969 |
* Support for hex (0x20) and binary (0b1001) numerals. |
19254 | 4970 |
|
20807 | 4971 |
* New method: reify eqs (t), where eqs are equations for an |
4972 |
interpretation I :: 'a list => 'b => 'c and t::'c is an optional |
|
4973 |
parameter, computes a term s::'b and a list xs::'a list and proves the |
|
4974 |
theorem I xs s = t. This is also known as reification or quoting. The |
|
4975 |
resulting theorem is applied to the subgoal to substitute t with I xs |
|
4976 |
s. If t is omitted, the subgoal itself is reified. |
|
4977 |
||
4978 |
* New method: reflection corr_thm eqs (t). The parameters eqs and (t) |
|
4979 |
are as explained above. corr_thm is a theorem for I vs (f t) = I vs t, |
|
4980 |
where f is supposed to be a computable function (in the sense of code |
|
4981 |
generattion). The method uses reify to compute s and xs as above then |
|
4982 |
applies corr_thm and uses normalization by evaluation to "prove" f s = |
|
4983 |
r and finally gets the theorem t = r, which is again applied to the |
|
25177 | 4984 |
subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy. |
4985 |
||
4986 |
* Reflection: Automatic reification now handels binding, an example is |
|
4987 |
available in src/HOL/ex/ReflectionEx.thy |
|
20807 | 4988 |
|
25397 | 4989 |
* HOL-Statespace: ``State Spaces: The Locale Way'' introduces a |
25409 | 4990 |
command 'statespace' that is similar to 'record', but introduces an |
25397 | 4991 |
abstract specification based on the locale infrastructure instead of |
4992 |
HOL types. This leads to extra flexibility in composing state spaces, |
|
4993 |
in particular multiple inheritance and renaming of components. |
|
4994 |
||
4995 |
||
19653 | 4996 |
*** HOL-Complex *** |
4997 |
||
22971 | 4998 |
* Hyperreal: Functions root and sqrt are now defined on negative real |
4999 |
inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x. |
|
5000 |
Nonnegativity side conditions have been removed from many lemmas, so |
|
5001 |
that more subgoals may now be solved by simplification; potential |
|
5002 |
INCOMPATIBILITY. |
|
5003 |
||
24800 | 5004 |
* Real: new type classes formalize real normed vector spaces and |
21791 | 5005 |
algebras, using new overloaded constants scaleR :: real => 'a => 'a |
5006 |
and norm :: 'a => real. |
|
5007 |
||
24800 | 5008 |
* Real: constant of_real :: real => 'a::real_algebra_1 injects from |
5009 |
reals into other types. The overloaded constant Reals :: 'a set is now |
|
5010 |
defined as range of_real; potential INCOMPATIBILITY. |
|
5011 |
||
5012 |
* Real: proper support for ML code generation, including 'quickcheck'. |
|
23013 | 5013 |
Reals are implemented as arbitrary precision rationals. |
5014 |
||
22126 | 5015 |
* Hyperreal: Several constants that previously worked only for the |
5016 |
reals have been generalized, so they now work over arbitrary vector |
|
5017 |
spaces. Type annotations may need to be added in some cases; potential |
|
5018 |
INCOMPATIBILITY. |
|
21791 | 5019 |
|
22972
3e96b98d37c6
generalized sgn function to work on any real normed vector space
huffman
parents:
22971
diff
changeset
|
5020 |
Infinitesimal :: ('a::real_normed_vector) star set |
3e96b98d37c6
generalized sgn function to work on any real normed vector space
huffman
parents:
22971
diff
changeset
|
5021 |
HFinite :: ('a::real_normed_vector) star set |
3e96b98d37c6
generalized sgn function to work on any real normed vector space
huffman
parents:
22971
diff
changeset
|
5022 |
HInfinite :: ('a::real_normed_vector) star set |
21791 | 5023 |
approx :: ('a::real_normed_vector) star => 'a star => bool |
5024 |
monad :: ('a::real_normed_vector) star => 'a star set |
|
5025 |
galaxy :: ('a::real_normed_vector) star => 'a star set |
|
22972
3e96b98d37c6
generalized sgn function to work on any real normed vector space
huffman
parents:
22971
diff
changeset
|
5026 |
(NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool |
21791 | 5027 |
(NS)convergent :: (nat => 'a::real_normed_vector) => bool |
5028 |
(NS)Bseq :: (nat => 'a::real_normed_vector) => bool |
|
5029 |
(NS)Cauchy :: (nat => 'a::real_normed_vector) => bool |
|
5030 |
(NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool |
|
5031 |
is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool |
|
5032 |
deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool |
|
22972
3e96b98d37c6
generalized sgn function to work on any real normed vector space
huffman
parents:
22971
diff
changeset
|
5033 |
sgn :: 'a::real_normed_vector => 'a |
23116 | 5034 |
exp :: 'a::{recpower,real_normed_field,banach} => 'a |
21791 | 5035 |
|
5036 |
* Complex: Some complex-specific constants are now abbreviations for |
|
22126 | 5037 |
overloaded ones: complex_of_real = of_real, cmod = norm, hcmod = |
5038 |
hnorm. Other constants have been entirely removed in favor of the |
|
5039 |
polymorphic versions (INCOMPATIBILITY): |
|
21791 | 5040 |
|
5041 |
approx <-- capprox |
|
5042 |
HFinite <-- CFinite |
|
5043 |
HInfinite <-- CInfinite |
|
5044 |
Infinitesimal <-- CInfinitesimal |
|
5045 |
monad <-- cmonad |
|
5046 |
galaxy <-- cgalaxy |
|
5047 |
(NS)LIM <-- (NS)CLIM, (NS)CRLIM |
|
5048 |
is(NS)Cont <-- is(NS)Contc, is(NS)contCR |
|
5049 |
(ns)deriv <-- (ns)cderiv |
|
5050 |
||
19653 | 5051 |
|
24801 | 5052 |
*** HOL-Algebra *** |
5053 |
||
5054 |
* Formalisation of ideals and the quotient construction over rings. |
|
5055 |
||
5056 |
* Order and lattice theory no longer based on records. |
|
5057 |
INCOMPATIBILITY. |
|
5058 |
||
5059 |
* Renamed lemmas least_carrier -> least_closed and greatest_carrier -> |
|
5060 |
greatest_closed. INCOMPATIBILITY. |
|
5061 |
||
5062 |
* Method algebra is now set up via an attribute. For examples see |
|
5063 |
Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations |
|
5064 |
of algebraic structures. |
|
5065 |
||
5066 |
* Renamed theory CRing to Ring. |
|
5067 |
||
5068 |
||
5069 |
*** HOL-Nominal *** |
|
5070 |
||
25148 | 5071 |
* Substantial, yet incomplete support for nominal datatypes (binding |
25177 | 5072 |
structures) based on HOL-Nominal logic. See src/HOL/Nominal and |
5073 |
src/HOL/Nominal/Examples. Prospective users should consult |
|
25148 | 5074 |
http://isabelle.in.tum.de/nominal/ |
5075 |
||
24801 | 5076 |
|
17878 | 5077 |
*** ML *** |
5078 |
||
24643 | 5079 |
* ML basics: just one true type int, which coincides with IntInf.int |
5080 |
(even on SML/NJ). |
|
5081 |
||
22138 | 5082 |
* ML within Isar: antiquotations allow to embed statically-checked |
5083 |
formal entities in the source, referring to the context available at |
|
5084 |
compile-time. For example: |
|
5085 |
||
25142 | 5086 |
ML {* @{sort "{zero,one}"} *} |
22138 | 5087 |
ML {* @{typ "'a => 'b"} *} |
5088 |
ML {* @{term "%x. x"} *} |
|
5089 |
ML {* @{prop "x == y"} *} |
|
5090 |
ML {* @{ctyp "'a => 'b"} *} |
|
5091 |
ML {* @{cterm "%x. x"} *} |
|
5092 |
ML {* @{cprop "x == y"} *} |
|
5093 |
ML {* @{thm asm_rl} *} |
|
5094 |
ML {* @{thms asm_rl} *} |
|
24692 | 5095 |
ML {* @{type_name c} *} |
25142 | 5096 |
ML {* @{type_syntax c} *} |
22376 | 5097 |
ML {* @{const_name c} *} |
5098 |
ML {* @{const_syntax c} *} |
|
22138 | 5099 |
ML {* @{context} *} |
5100 |
ML {* @{theory} *} |
|
5101 |
ML {* @{theory Pure} *} |
|
24692 | 5102 |
ML {* @{theory_ref} *} |
5103 |
ML {* @{theory_ref Pure} *} |
|
22138 | 5104 |
ML {* @{simpset} *} |
5105 |
ML {* @{claset} *} |
|
5106 |
ML {* @{clasimpset} *} |
|
5107 |
||
22151 | 5108 |
The same works for sources being ``used'' within an Isar context. |
5109 |
||
22152 | 5110 |
* ML in Isar: improved error reporting; extra verbosity with |
24706
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
5111 |
ML_Context.trace enabled. |
22152 | 5112 |
|
19032 | 5113 |
* Pure/General/table.ML: the join operations now works via exceptions |
24706
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
5114 |
DUP/SAME instead of type option. This is simpler in simple cases, and |
19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset
|
5115 |
admits slightly more efficient complex applications. |
18446 | 5116 |
|
24800 | 5117 |
* Pure: 'advanced' translation functions (parse_translation etc.) now |
5118 |
use Context.generic instead of just theory. |
|
5119 |
||
18642 | 5120 |
* Pure: datatype Context.generic joins theory/Proof.context and |
18644 | 5121 |
provides some facilities for code that works in either kind of |
18642 | 5122 |
context, notably GenericDataFun for uniform theory and proof data. |
5123 |
||
18737 | 5124 |
* Pure: simplified internal attribute type, which is now always |
24706
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
5125 |
Context.generic * thm -> Context.generic * thm. Global (theory) vs. |
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
5126 |
local (Proof.context) attributes have been discontinued, while |
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
5127 |
minimizing code duplication. Thm.rule_attribute and |
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
5128 |
Thm.declaration_attribute build canonical attributes; see also structure |
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
5129 |
Context for further operations on Context.generic, notably |
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
5130 |
GenericDataFun. INCOMPATIBILITY, need to adapt attribute type |
19006
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset
|
5131 |
declarations and definitions. |
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset
|
5132 |
|
24800 | 5133 |
* Context data interfaces (Theory/Proof/GenericDataFun): removed |
5134 |
name/print, uninitialized data defaults to ad-hoc copy of empty value, |
|
5135 |
init only required for impure data. INCOMPATIBILITY: empty really need |
|
5136 |
to be empty (no dependencies on theory content!) |
|
5137 |
||
19508 | 5138 |
* Pure/kernel: consts certification ignores sort constraints given in |
24800 | 5139 |
signature declarations. (This information is not relevant to the |
5140 |
logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE, |
|
5141 |
potential INCOMPATIBILITY. |
|
19508 | 5142 |
|
5143 |
* Pure: axiomatic type classes are now purely definitional, with |
|
5144 |
explicit proofs of class axioms and super class relations performed |
|
24706
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
5145 |
internally. See Pure/axclass.ML for the main internal interfaces -- |
36856
b343091e81d8
reverted parts of 7902dc7ea11d -- note that NEWS of published Isabelle releases are essentially read-only;
wenzelm
parents:
36849
diff
changeset
|
5146 |
notably AxClass.define_class supercedes AxClass.add_axclass, and |
24706
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
5147 |
AxClass.axiomatize_class/classrel/arity supersede |
19508 | 5148 |
Sign.add_classes/classrel/arities. |
5149 |
||
19006
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset
|
5150 |
* Pure/Isar: Args/Attrib parsers operate on Context.generic -- |
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset
|
5151 |
global/local versions on theory vs. Proof.context have been |
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset
|
5152 |
discontinued; Attrib.syntax and Method.syntax have been adapted |
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset
|
5153 |
accordingly. INCOMPATIBILITY, need to adapt parser expressions for |
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset
|
5154 |
attributes, methods, etc. |
18642 | 5155 |
|
18446 | 5156 |
* Pure: several functions of signature "... -> theory -> theory * ..." |
5157 |
have been reoriented to "... -> theory -> ... * theory" in order to |
|
5158 |
allow natural usage in combination with the ||>, ||>>, |-> and |
|
5159 |
fold_map combinators. |
|
18051 | 5160 |
|
21647
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset
|
5161 |
* Pure: official theorem names (closed derivations) and additional |
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset
|
5162 |
comments (tags) are now strictly separate. Name hints -- which are |
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset
|
5163 |
maintained as tags -- may be attached any time without affecting the |
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset
|
5164 |
derivation. |
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset
|
5165 |
|
18020 | 5166 |
* Pure: primitive rule lift_rule now takes goal cterm instead of an |
18145 | 5167 |
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to |
18020 | 5168 |
achieve the old behaviour. |
5169 |
||
5170 |
* Pure: the "Goal" constant is now called "prop", supporting a |
|
5171 |
slightly more general idea of ``protecting'' meta-level rule |
|
5172 |
statements. |
|
5173 |
||
20040
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
5174 |
* Pure: Logic.(un)varify only works in a global context, which is now |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
5175 |
enforced instead of silently assumed. INCOMPATIBILITY, may use |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
5176 |
Logic.legacy_(un)varify as temporary workaround. |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
5177 |
|
20090 | 5178 |
* Pure: structure Name provides scalable operations for generating |
5179 |
internal variable names, notably Name.variants etc. This replaces |
|
5180 |
some popular functions from term.ML: |
|
5181 |
||
5182 |
Term.variant -> Name.variant |
|
24800 | 5183 |
Term.variantlist -> Name.variant_list |
20090 | 5184 |
Term.invent_names -> Name.invent_list |
5185 |
||
5186 |
Note that low-level renaming rarely occurs in new code -- operations |
|
5187 |
from structure Variable are used instead (see below). |
|
5188 |
||
20040
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
5189 |
* Pure: structure Variable provides fundamental operations for proper |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
5190 |
treatment of fixed/schematic variables in a context. For example, |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
5191 |
Variable.import introduces fixes for schematics of given facts and |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
5192 |
Variable.export reverses the effect (up to renaming) -- this replaces |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
5193 |
various freeze_thaw operations. |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
5194 |
|
18567 | 5195 |
* Pure: structure Goal provides simple interfaces for |
17981
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset
|
5196 |
init/conclude/finish and tactical prove operations (replacing former |
20040
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
5197 |
Tactic.prove). Goal.prove is the canonical way to prove results |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
5198 |
within a given context; Goal.prove_global is a degraded version for |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
5199 |
theory level goals, including a global Drule.standard. Note that |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
5200 |
OldGoals.prove_goalw_cterm has long been obsolete, since it is |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
5201 |
ill-behaved in a local proof context (e.g. with local fixes/assumes or |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
5202 |
in a locale context). |
17981
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset
|
5203 |
|
24706
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
5204 |
* Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.) |
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
5205 |
and type checking (Syntax.check_term etc.), with common combinations |
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
5206 |
(Syntax.read_term etc.). These supersede former Sign.read_term etc. |
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
5207 |
which are considered legacy and await removal. |
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
5208 |
|
24920 | 5209 |
* Pure/Syntax: generic interfaces for type unchecking |
5210 |
(Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.), |
|
5211 |
with common combinations (Syntax.pretty_term, Syntax.string_of_term |
|
5212 |
etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still |
|
24924 | 5213 |
available for convenience, but refer to the very same operations using |
5214 |
a mere theory instead of a full context. |
|
24920 | 5215 |
|
18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
5216 |
* Isar: simplified treatment of user-level errors, using exception |
18687 | 5217 |
ERROR of string uniformly. Function error now merely raises ERROR, |
18686
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
5218 |
without any side effect on output channels. The Isar toplevel takes |
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
5219 |
care of proper display of ERROR exceptions. ML code may use plain |
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
5220 |
handle/can/try; cat_error may be used to concatenate errors like this: |
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
5221 |
|
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
5222 |
... handle ERROR msg => cat_error msg "..." |
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
5223 |
|
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
5224 |
Toplevel ML code (run directly or through the Isar toplevel) may be |
18687 | 5225 |
embedded into the Isar toplevel with exception display/debug like |
5226 |
this: |
|
18686
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
5227 |
|
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
5228 |
Isar.toplevel (fn () => ...) |
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
5229 |
|
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
5230 |
INCOMPATIBILITY, removed special transform_error facilities, removed |
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
5231 |
obsolete variants of user-level exceptions (ERROR_MESSAGE, |
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
5232 |
Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL) |
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
5233 |
-- use plain ERROR instead. |
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
5234 |
|
18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
5235 |
* Isar: theory setup now has type (theory -> theory), instead of a |
18722
0888eca0f1be
* ML/Isar: theory setup has type (theory -> theory);
wenzelm
parents:
18696
diff
changeset
|
5236 |
list. INCOMPATIBILITY, may use #> to compose setup functions. |
0888eca0f1be
* ML/Isar: theory setup has type (theory -> theory);
wenzelm
parents:
18696
diff
changeset
|
5237 |
|
24706
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
5238 |
* Isar: ML toplevel pretty printer for type Proof.context, subject to |
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
5239 |
ProofContext.debug/verbose flags. |
18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
5240 |
|
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
5241 |
* Isar: Toplevel.theory_to_proof admits transactions that modify the |
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
5242 |
theory before entering a proof state. Transactions now always see a |
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
5243 |
quasi-functional intermediate checkpoint, both in interactive and |
18590
f6a553aa3d81
Pure/Isar: Toplevel.theory_to_proof admits transactions that modify the theory;
wenzelm
parents:
18568
diff
changeset
|
5244 |
batch mode. |
18567 | 5245 |
|
24867 | 5246 |
* Isar: simplified interfaces for outer syntax. Renamed |
5247 |
OuterSyntax.add_keywords to OuterSyntax.keywords. Removed |
|
5248 |
OuterSyntax.add_parsers -- this functionality is now included in |
|
5249 |
OuterSyntax.command etc. INCOMPATIBILITY. |
|
5250 |
||
17878 | 5251 |
* Simplifier: the simpset of a running simplification process now |
5252 |
contains a proof context (cf. Simplifier.the_context), which is the |
|
5253 |
very context that the initial simpset has been retrieved from (by |
|
17890 | 5254 |
simpset_of/local_simpset_of). Consequently, all plug-in components |
17878 | 5255 |
(solver, looper etc.) may depend on arbitrary proof data. |
5256 |
||
5257 |
* Simplifier.inherit_context inherits the proof context (plus the |
|
5258 |
local bounds) of the current simplification process; any simproc |
|
5259 |
etc. that calls the Simplifier recursively should do this! Removed |
|
5260 |
former Simplifier.inherit_bounds, which is already included here -- |
|
17890 | 5261 |
INCOMPATIBILITY. Tools based on low-level rewriting may even have to |
5262 |
specify an explicit context using Simplifier.context/theory_context. |
|
17878 | 5263 |
|
5264 |
* Simplifier/Classical Reasoner: more abstract interfaces |
|
5265 |
change_simpset/claset for modifying the simpset/claset reference of a |
|
5266 |
theory; raw versions simpset/claset_ref etc. have been discontinued -- |
|
5267 |
INCOMPATIBILITY. |
|
5268 |
||
18540 | 5269 |
* Provers: more generic wrt. syntax of object-logics, avoid hardwired |
5270 |
"Trueprop" etc. |
|
5271 |
||
17878 | 5272 |
|
20988
0887d0dd3210
* isabelle-process: option -S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset
|
5273 |
*** System *** |
0887d0dd3210
* isabelle-process: option -S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset
|
5274 |
|
25433 | 5275 |
* settings: the default heap location within ISABELLE_HOME_USER now |
5276 |
includes ISABELLE_IDENTIFIER. This simplifies use of multiple |
|
5277 |
Isabelle installations. |
|
21471
03a5ef1936c5
* settings: ML_IDENTIFIER includes the Isabelle version identifier;
wenzelm
parents:
21462
diff
changeset
|
5278 |
|
20988
0887d0dd3210
* isabelle-process: option -S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset
|
5279 |
* isabelle-process: option -S (secure mode) disables some critical |
0887d0dd3210
* isabelle-process: option -S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset
|
5280 |
operations, notably runtime compilation and evaluation of ML source |
0887d0dd3210
* isabelle-process: option -S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset
|
5281 |
code. |
0887d0dd3210
* isabelle-process: option -S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset
|
5282 |
|
24891 | 5283 |
* Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/. |
5284 |
||
24801 | 5285 |
* Support for parallel execution, using native multicore support of |
24800 | 5286 |
Poly/ML 5.1. The theory loader exploits parallelism when processing |
5287 |
independent theories, according to the given theory header |
|
5288 |
specifications. The maximum number of worker threads is specified via |
|
5289 |
usedir option -M or the "max-threads" setting in Proof General. A |
|
5290 |
speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up |
|
5291 |
to 6 on a 8-core machine. User-code needs to observe certain |
|
5292 |
guidelines for thread-safe programming, see appendix A in the Isar |
|
5293 |
Implementation manual. |
|
24210
a865059c4fcb
* Experimental support for multithreading, using Poly/ML 5.1;
wenzelm
parents:
24187
diff
changeset
|
5294 |
|
17754
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset
|
5295 |
|
25448 | 5296 |
|
17720 | 5297 |
New in Isabelle2005 (October 2005) |
5298 |
---------------------------------- |
|
14655
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset
|
5299 |
|
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset
|
5300 |
*** General *** |
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset
|
5301 |
|
15130 | 5302 |
* Theory headers: the new header syntax for Isar theories is |
5303 |
||
5304 |
theory <name> |
|
16234 | 5305 |
imports <theory1> ... <theoryN> |
5306 |
uses <file1> ... <fileM> |
|
15130 | 5307 |
begin |
5308 |
||
16234 | 5309 |
where the 'uses' part is optional. The previous syntax |
5310 |
||
5311 |
theory <name> = <theory1> + ... + <theoryN>: |
|
5312 |
||
16717 | 5313 |
will disappear in the next release. Use isatool fixheaders to convert |
5314 |
existing theory files. Note that there is no change in ancient |
|
17371 | 5315 |
non-Isar theories now, but these will disappear soon. |
15130 | 5316 |
|
15475
fdf9434b04ea
- Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset
|
5317 |
* Theory loader: parent theories can now also be referred to via |
16234 | 5318 |
relative and absolute paths. |
5319 |
||
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
5320 |
* Command 'find_theorems' searches for a list of criteria instead of a |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
5321 |
list of constants. Known criteria are: intro, elim, dest, name:string, |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
5322 |
simp:term, and any term. Criteria can be preceded by '-' to select |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
5323 |
theorems that do not match. Intro, elim, dest select theorems that |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
5324 |
match the current goal, name:s selects theorems whose fully qualified |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
5325 |
name contain s, and simp:term selects all simplification rules whose |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
5326 |
lhs match term. Any other term is interpreted as pattern and selects |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
5327 |
all theorems matching the pattern. Available in ProofGeneral under |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
5328 |
'ProofGeneral -> Find Theorems' or C-c C-f. Example: |
16234 | 5329 |
|
17275
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
5330 |
C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL." |
16234 | 5331 |
|
5332 |
prints the last 100 theorems matching the pattern "(_::nat) + _ + _", |
|
5333 |
matching the current goal as introduction rule and not having "HOL." |
|
5334 |
in their name (i.e. not being defined in theory HOL). |
|
16013
3010430d894d
removed find_rewrites (superceded by improved thms_containing);
wenzelm
parents:
16000
diff
changeset
|
5335 |
|
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
5336 |
* Command 'thms_containing' has been discontinued in favour of |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
5337 |
'find_theorems'; INCOMPATIBILITY. |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
5338 |
|
17385 | 5339 |
* Communication with Proof General is now 8bit clean, which means that |
5340 |
Unicode text in UTF-8 encoding may be used within theory texts (both |
|
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
5341 |
formal and informal parts). Cf. option -U of the Isabelle Proof |
17538 | 5342 |
General interface. Here are some simple examples (cf. src/HOL/ex): |
5343 |
||
5344 |
http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html |
|
5345 |
http://isabelle.in.tum.de/library/HOL/ex/Chinese.html |
|
17385 | 5346 |
|
17425 | 5347 |
* Improved efficiency of the Simplifier and, to a lesser degree, the |
5348 |
Classical Reasoner. Typical big applications run around 2 times |
|
5349 |
faster. |
|
5350 |
||
15703 | 5351 |
|
5352 |
*** Document preparation *** |
|
5353 |
||
16234 | 5354 |
* Commands 'display_drafts' and 'print_drafts' perform simple output |
5355 |
of raw sources. Only those symbols that do not require additional |
|
5356 |
LaTeX packages (depending on comments in isabellesym.sty) are |
|
5357 |
displayed properly, everything else is left verbatim. isatool display |
|
5358 |
and isatool print are used as front ends (these are subject to the |
|
5359 |
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). |
|
5360 |
||
17047
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
5361 |
* Command tags control specific markup of certain regions of text, |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
5362 |
notably folding and hiding. Predefined tags include "theory" (for |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
5363 |
theory begin and end), "proof" for proof commands, and "ML" for |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
5364 |
commands involving ML code; the additional tags "visible" and |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
5365 |
"invisible" are unused by default. Users may give explicit tag |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
5366 |
specifications in the text, e.g. ''by %invisible (auto)''. The |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
5367 |
interpretation of tags is determined by the LaTeX job during document |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
5368 |
preparation: see option -V of isatool usedir, or options -n and -t of |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
5369 |
isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag, |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
5370 |
\isadroptag. |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
5371 |
|
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
5372 |
Several document versions may be produced at the same time via isatool |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
5373 |
usedir (the generated index.html will link all of them). Typical |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
5374 |
specifications include ''-V document=theory,proof,ML'' to present |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
5375 |
theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
5376 |
proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
5377 |
these parts without any formal replacement text. The Isabelle site |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
5378 |
default settings produce ''document'' and ''outline'' versions as |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
5379 |
specified above. |
16234 | 5380 |
|
17402 | 5381 |
* Several new antiquotations: |
15979 | 5382 |
|
5383 |
@{term_type term} prints a term with its type annotated; |
|
5384 |
||
5385 |
@{typeof term} prints the type of a term; |
|
5386 |
||
16234 | 5387 |
@{const const} is the same as @{term const}, but checks that the |
5388 |
argument is a known logical constant; |
|
15979 | 5389 |
|
5390 |
@{term_style style term} and @{thm_style style thm} print a term or |
|
16234 | 5391 |
theorem applying a "style" to it |
5392 |
||
17117
e2bed9e82454
* The ML antiquotation prints type-checked ML expressions verbatim.
wenzelm
parents:
17097
diff
changeset
|
5393 |
@{ML text} |
e2bed9e82454
* The ML antiquotation prints type-checked ML expressions verbatim.
wenzelm
parents:
17097
diff
changeset
|
5394 |
|
16234 | 5395 |
Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of |
5396 |
definitions, equations, inequations etc., 'concl' printing only the |
|
17393 | 5397 |
conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19' |
16234 | 5398 |
to print the specified premise. TermStyle.add_style provides an ML |
5399 |
interface for introducing further styles. See also the "LaTeX Sugar" |
|
17117
e2bed9e82454
* The ML antiquotation prints type-checked ML expressions verbatim.
wenzelm
parents:
17097
diff
changeset
|
5400 |
document practical applications. The ML antiquotation prints |
e2bed9e82454
* The ML antiquotation prints type-checked ML expressions verbatim.
wenzelm
parents:
17097
diff
changeset
|
5401 |
type-checked ML expressions verbatim. |
16234 | 5402 |
|
17259
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset
|
5403 |
* Markup commands 'chapter', 'section', 'subsection', 'subsubsection', |
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset
|
5404 |
and 'text' support optional locale specification '(in loc)', which |
17269 | 5405 |
specifies the default context for interpreting antiquotations. For |
5406 |
example: 'text (in lattice) {* @{thm inf_assoc}*}'. |
|
17259
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset
|
5407 |
|
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset
|
5408 |
* Option 'locale=NAME' of antiquotations specifies an alternative |
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset
|
5409 |
context interpreting the subsequent argument. For example: @{thm |
17269 | 5410 |
[locale=lattice] inf_assoc}. |
17259
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset
|
5411 |
|
17097
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset
|
5412 |
* Proper output of proof terms (@{prf ...} and @{full_prf ...}) within |
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset
|
5413 |
a proof context. |
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset
|
5414 |
|
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset
|
5415 |
* Proper output of antiquotations for theory commands involving a |
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset
|
5416 |
proof context (such as 'locale' or 'theorem (in loc) ...'). |
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset
|
5417 |
|
17193
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset
|
5418 |
* Delimiters of outer tokens (string etc.) now produce separate LaTeX |
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset
|
5419 |
macros (\isachardoublequoteopen, isachardoublequoteclose etc.). |
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset
|
5420 |
|
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset
|
5421 |
* isatool usedir: new option -C (default true) controls whether option |
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset
|
5422 |
-D should include a copy of the original document directory; -C false |
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset
|
5423 |
prevents unwanted effects such as copying of administrative CVS data. |
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset
|
5424 |
|
16234 | 5425 |
|
5426 |
*** Pure *** |
|
5427 |
||
5428 |
* Considerably improved version of 'constdefs' command. Now performs |
|
5429 |
automatic type-inference of declared constants; additional support for |
|
5430 |
local structure declarations (cf. locales and HOL records), see also |
|
5431 |
isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly |
|
5432 |
sequential dependencies of definitions within a single 'constdefs' |
|
5433 |
section; moreover, the declared name needs to be an identifier. If |
|
5434 |
all fails, consider to fall back on 'consts' and 'defs' separately. |
|
5435 |
||
5436 |
* Improved indexed syntax and implicit structures. First of all, |
|
5437 |
indexed syntax provides a notational device for subscripted |
|
5438 |
application, using the new syntax \<^bsub>term\<^esub> for arbitrary |
|
5439 |
expressions. Secondly, in a local context with structure |
|
5440 |
declarations, number indexes \<^sub>n or the empty index (default |
|
5441 |
number 1) refer to a certain fixed variable implicitly; option |
|
5442 |
show_structs controls printing of implicit structures. Typical |
|
5443 |
applications of these concepts involve record types and locales. |
|
5444 |
||
5445 |
* New command 'no_syntax' removes grammar declarations (and |
|
5446 |
translations) resulting from the given syntax specification, which is |
|
5447 |
interpreted in the same manner as for the 'syntax' command. |
|
5448 |
||
5449 |
* 'Advanced' translation functions (parse_translation etc.) may depend |
|
5450 |
on the signature of the theory context being presently used for |
|
5451 |
parsing/printing, see also isar-ref manual. |
|
5452 |
||
16856 | 5453 |
* Improved 'oracle' command provides a type-safe interface to turn an |
5454 |
ML expression of type theory -> T -> term into a primitive rule of |
|
5455 |
type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle |
|
5456 |
is already included here); see also FOL/ex/IffExample.thy; |
|
5457 |
INCOMPATIBILITY. |
|
5458 |
||
17275
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
5459 |
* axclass: name space prefix for class "c" is now "c_class" (was "c" |
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
5460 |
before); "cI" is no longer bound, use "c.intro" instead. |
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
5461 |
INCOMPATIBILITY. This change avoids clashes of fact bindings for |
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
5462 |
axclasses vs. locales. |
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
5463 |
|
16234 | 5464 |
* Improved internal renaming of symbolic identifiers -- attach primes |
5465 |
instead of base 26 numbers. |
|
5466 |
||
5467 |
* New flag show_question_marks controls printing of leading question |
|
5468 |
marks in schematic variable names. |
|
5469 |
||
5470 |
* In schematic variable names, *any* symbol following \<^isub> or |
|
5471 |
\<^isup> is now treated as part of the base name. For example, the |
|
5472 |
following works without printing of awkward ".0" indexes: |
|
5473 |
||
5474 |
lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1" |
|
5475 |
by simp |
|
5476 |
||
5477 |
* Inner syntax includes (*(*nested*) comments*). |
|
5478 |
||
17548 | 5479 |
* Pretty printer now supports unbreakable blocks, specified in mixfix |
16234 | 5480 |
annotations as "(00...)". |
5481 |
||
5482 |
* Clear separation of logical types and nonterminals, where the latter |
|
5483 |
may only occur in 'syntax' specifications or type abbreviations. |
|
5484 |
Before that distinction was only partially implemented via type class |
|
5485 |
"logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper |
|
5486 |
use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very |
|
5487 |
exotic syntax specifications may require further adaption |
|
17691 | 5488 |
(e.g. Cube/Cube.thy). |
16234 | 5489 |
|
5490 |
* Removed obsolete type class "logic", use the top sort {} instead. |
|
5491 |
Note that non-logical types should be declared as 'nonterminals' |
|
5492 |
rather than 'types'. INCOMPATIBILITY for new object-logic |
|
5493 |
specifications. |
|
5494 |
||
17095 | 5495 |
* Attributes 'induct' and 'cases': type or set names may now be |
5496 |
locally fixed variables as well. |
|
5497 |
||
16234 | 5498 |
* Simplifier: can now control the depth to which conditional rewriting |
5499 |
is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth |
|
5500 |
Limit. |
|
5501 |
||
5502 |
* Simplifier: simplification procedures may now take the current |
|
5503 |
simpset into account (cf. Simplifier.simproc(_i) / mk_simproc |
|
5504 |
interface), which is very useful for calling the Simplifier |
|
5505 |
recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs |
|
5506 |
is gone -- use prems_of_ss on the simpset instead. Moreover, the |
|
5507 |
low-level mk_simproc no longer applies Logic.varify internally, to |
|
5508 |
allow for use in a context of fixed variables. |
|
5509 |
||
5510 |
* thin_tac now works even if the assumption being deleted contains !! |
|
5511 |
or ==>. More generally, erule now works even if the major premise of |
|
5512 |
the elimination rule contains !! or ==>. |
|
5513 |
||
17597 | 5514 |
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. |
17590 | 5515 |
|
16234 | 5516 |
* Reorganized bootstrapping of the Pure theories; CPure is now derived |
5517 |
from Pure, which contains all common declarations already. Both |
|
5518 |
theories are defined via plain Isabelle/Isar .thy files. |
|
5519 |
INCOMPATIBILITY: elements of CPure (such as the CPure.intro / |
|
5520 |
CPure.elim / CPure.dest attributes) now appear in the Pure name space; |
|
5521 |
use isatool fixcpure to adapt your theory and ML sources. |
|
5522 |
||
5523 |
* New syntax 'name(i-j, i-, i, ...)' for referring to specific |
|
5524 |
selections of theorems in named facts via index ranges. |
|
5525 |
||
17097
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset
|
5526 |
* 'print_theorems': in theory mode, really print the difference |
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset
|
5527 |
wrt. the last state (works for interactive theory development only), |
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset
|
5528 |
in proof mode print all local facts (cf. 'print_facts'); |
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset
|
5529 |
|
17397 | 5530 |
* 'hide': option '(open)' hides only base names. |
5531 |
||
17275
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
5532 |
* More efficient treatment of intermediate checkpoints in interactive |
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
5533 |
theory development. |
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
5534 |
|
17663
28be54ff74f8
Added entries for code_module, code_library, and value.
berghofe
parents:
17641
diff
changeset
|
5535 |
* Code generator is now invoked via code_module (incremental code |
17664 | 5536 |
generation) and code_library (modular code generation, ML structures |
5537 |
for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains' |
|
5538 |
must be quoted when used as identifiers. |
|
5539 |
||
5540 |
* New 'value' command for reading, evaluating and printing terms using |
|
5541 |
the code generator. INCOMPATIBILITY: command keyword 'value' must be |
|
5542 |
quoted when used as identifier. |
|
17663
28be54ff74f8
Added entries for code_module, code_library, and value.
berghofe
parents:
17641
diff
changeset
|
5543 |
|
16234 | 5544 |
|
5545 |
*** Locales *** |
|
17095 | 5546 |
|
17385 | 5547 |
* New commands for the interpretation of locale expressions in |
5548 |
theories (1), locales (2) and proof contexts (3). These generate |
|
5549 |
proof obligations from the expression specification. After the |
|
5550 |
obligations have been discharged, theorems of the expression are added |
|
5551 |
to the theory, target locale or proof context. The synopsis of the |
|
5552 |
commands is a follows: |
|
5553 |
||
17095 | 5554 |
(1) interpretation expr inst |
5555 |
(2) interpretation target < expr |
|
5556 |
(3) interpret expr inst |
|
17385 | 5557 |
|
17095 | 5558 |
Interpretation in theories and proof contexts require a parameter |
5559 |
instantiation of terms from the current context. This is applied to |
|
17385 | 5560 |
specifications and theorems of the interpreted expression. |
5561 |
Interpretation in locales only permits parameter renaming through the |
|
5562 |
locale expression. Interpretation is smart in that interpretations |
|
5563 |
that are active already do not occur in proof obligations, neither are |
|
5564 |
instantiated theorems stored in duplicate. Use 'print_interps' to |
|
5565 |
inspect active interpretations of a particular locale. For details, |
|
17436 | 5566 |
see the Isar Reference manual. Examples can be found in |
5567 |
HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy. |
|
16234 | 5568 |
|
5569 |
INCOMPATIBILITY: former 'instantiate' has been withdrawn, use |
|
5570 |
'interpret' instead. |
|
5571 |
||
17385 | 5572 |
* New context element 'constrains' for adding type constraints to |
5573 |
parameters. |
|
5574 |
||
5575 |
* Context expressions: renaming of parameters with syntax |
|
5576 |
redeclaration. |
|
17095 | 5577 |
|
5578 |
* Locale declaration: 'includes' disallowed. |
|
5579 |
||
16234 | 5580 |
* Proper static binding of attribute syntax -- i.e. types / terms / |
5581 |
facts mentioned as arguments are always those of the locale definition |
|
5582 |
context, independently of the context of later invocations. Moreover, |
|
5583 |
locale operations (renaming and type / term instantiation) are applied |
|
5584 |
to attribute arguments as expected. |
|
5585 |
||
5586 |
INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of |
|
5587 |
actual attributes; rare situations may require Attrib.attribute to |
|
5588 |
embed those attributes into Attrib.src that lack concrete syntax. |
|
5589 |
Attribute implementations need to cooperate properly with the static |
|
5590 |
binding mechanism. Basic parsers Args.XXX_typ/term/prop and |
|
5591 |
Attrib.XXX_thm etc. already do the right thing without further |
|
5592 |
intervention. Only unusual applications -- such as "where" or "of" |
|
5593 |
(cf. src/Pure/Isar/attrib.ML), which process arguments depending both |
|
5594 |
on the context and the facts involved -- may have to assign parsed |
|
5595 |
values to argument tokens explicitly. |
|
5596 |
||
5597 |
* Changed parameter management in theorem generation for long goal |
|
5598 |
statements with 'includes'. INCOMPATIBILITY: produces a different |
|
5599 |
theorem statement in rare situations. |
|
5600 |
||
17228 | 5601 |
* Locale inspection command 'print_locale' omits notes elements. Use |
5602 |
'print_locale!' to have them included in the output. |
|
5603 |
||
16234 | 5604 |
|
5605 |
*** Provers *** |
|
5606 |
||
5607 |
* Provers/hypsubst.ML: improved version of the subst method, for |
|
5608 |
single-step rewriting: it now works in bound variable contexts. New is |
|
5609 |
'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may |
|
5610 |
rewrite a different subterm than the original subst method, which is |
|
5611 |
still available as 'simplesubst'. |
|
5612 |
||
5613 |
* Provers/quasi.ML: new transitivity reasoners for transitivity only |
|
5614 |
and quasi orders. |
|
5615 |
||
5616 |
* Provers/trancl.ML: new transitivity reasoner for transitive and |
|
5617 |
reflexive-transitive closure of relations. |
|
5618 |
||
5619 |
* Provers/blast.ML: new reference depth_limit to make blast's depth |
|
5620 |
limit (previously hard-coded with a value of 20) user-definable. |
|
5621 |
||
5622 |
* Provers/simplifier.ML has been moved to Pure, where Simplifier.setup |
|
5623 |
is peformed already. Object-logics merely need to finish their |
|
5624 |
initial simpset configuration as before. INCOMPATIBILITY. |
|
15703 | 5625 |
|
15475
fdf9434b04ea
- Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset
|
5626 |
|
14700
2f885b7e5ba7
reimplementation of HOL records; only one type is created for
schirmer
parents:
14699
diff
changeset
|
5627 |
*** HOL *** |
2f885b7e5ba7
reimplementation of HOL records; only one type is created for
schirmer
parents:
14699
diff
changeset
|
5628 |
|
16234 | 5629 |
* Symbolic syntax of Hilbert Choice Operator is now as follows: |
14878 | 5630 |
|
5631 |
syntax (epsilon) |
|
5632 |
"_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10) |
|
5633 |
||
16234 | 5634 |
The symbol \<some> is displayed as the alternative epsilon of LaTeX |
5635 |
and x-symbol; use option '-m epsilon' to get it actually printed. |
|
5636 |
Moreover, the mathematically important symbolic identifier \<epsilon> |
|
5637 |
becomes available as variable, constant etc. INCOMPATIBILITY, |
|
5638 |
||
5639 |
* "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x". |
|
5640 |
Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >= |
|
17371 | 5641 |
is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to |
17016
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset
|
5642 |
support corresponding Isar calculations. |
16234 | 5643 |
|
5644 |
* "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>" |
|
5645 |
instead of ":". |
|
5646 |
||
5647 |
* theory SetInterval: changed the syntax for open intervals: |
|
5648 |
||
5649 |
Old New |
|
5650 |
{..n(} {..<n} |
|
5651 |
{)n..} {n<..} |
|
5652 |
{m..n(} {m..<n} |
|
5653 |
{)m..n} {m<..n} |
|
5654 |
{)m..n(} {m<..<n} |
|
5655 |
||
5656 |
The old syntax is still supported but will disappear in the next |
|
5657 |
release. For conversion use the following Emacs search and replace |
|
5658 |
patterns (these are not perfect but work quite well): |
|
15046 | 5659 |
|
5660 |
{)\([^\.]*\)\.\. -> {\1<\.\.} |
|
5661 |
\.\.\([^(}]*\)(} -> \.\.<\1} |
|
5662 |
||
17533 | 5663 |
* Theory Commutative_Ring (in Library): method comm_ring for proving |
5664 |
equalities in commutative rings; method 'algebra' provides a generic |
|
5665 |
interface. |
|
17389
b4743198b939
Method comm_ring for proving equalities in commutative rings.
wenzelm
parents:
17385
diff
changeset
|
5666 |
|
b4743198b939
Method comm_ring for proving equalities in commutative rings.
wenzelm
parents:
17385
diff
changeset
|
5667 |
* Theory Finite_Set: changed the syntax for 'setsum', summation over |
16234 | 5668 |
finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is |
17371 | 5669 |
now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can |
17189 | 5670 |
be a tuple pattern. |
16234 | 5671 |
|
5672 |
Some new syntax forms are available: |
|
5673 |
||
5674 |
"\<Sum>x | P. e" for "setsum (%x. e) {x. P}" |
|
5675 |
"\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}" |
|
5676 |
"\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}" |
|
5677 |
"\<Sum>x < k. e" for "setsum (%x. e) {..<k}" |
|
5678 |
||
5679 |
The latter form "\<Sum>x < k. e" used to be based on a separate |
|
5680 |
function "Summation", which has been discontinued. |
|
5681 |
||
5682 |
* theory Finite_Set: in structured induction proofs, the insert case |
|
5683 |
is now 'case (insert x F)' instead of the old counterintuitive 'case |
|
5684 |
(insert F x)'. |
|
5685 |
||
5686 |
* The 'refute' command has been extended to support a much larger |
|
5687 |
fragment of HOL, including axiomatic type classes, constdefs and |
|
5688 |
typedefs, inductive datatypes and recursion. |
|
5689 |
||
17700 | 5690 |
* New tactics 'sat' and 'satx' to prove propositional tautologies. |
5691 |
Requires zChaff with proof generation to be installed. See |
|
5692 |
HOL/ex/SAT_Examples.thy for examples. |
|
17619 | 5693 |
|
16234 | 5694 |
* Datatype induction via method 'induct' now preserves the name of the |
5695 |
induction variable. For example, when proving P(xs::'a list) by |
|
5696 |
induction on xs, the induction step is now P(xs) ==> P(a#xs) rather |
|
5697 |
than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY |
|
5698 |
in unstructured proof scripts. |
|
5699 |
||
5700 |
* Reworked implementation of records. Improved scalability for |
|
5701 |
records with many fields, avoiding performance problems for type |
|
5702 |
inference. Records are no longer composed of nested field types, but |
|
5703 |
of nested extension types. Therefore the record type only grows linear |
|
5704 |
in the number of extensions and not in the number of fields. The |
|
5705 |
top-level (users) view on records is preserved. Potential |
|
5706 |
INCOMPATIBILITY only in strange cases, where the theory depends on the |
|
5707 |
old record representation. The type generated for a record is called |
|
5708 |
<record_name>_ext_type. |
|
5709 |
||
5710 |
Flag record_quick_and_dirty_sensitive can be enabled to skip the |
|
5711 |
proofs triggered by a record definition or a simproc (if |
|
5712 |
quick_and_dirty is enabled). Definitions of large records can take |
|
5713 |
quite long. |
|
5714 |
||
5715 |
New simproc record_upd_simproc for simplification of multiple record |
|
5716 |
updates enabled by default. Moreover, trivial updates are also |
|
5717 |
removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break |
|
5718 |
occasionally, since simplification is more powerful by default. |
|
5719 |
||
17275
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
5720 |
* typedef: proper support for polymorphic sets, which contain extra |
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
5721 |
type-variables in the term. |
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
5722 |
|
16234 | 5723 |
* Simplifier: automatically reasons about transitivity chains |
5724 |
involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics |
|
5725 |
provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY: |
|
5726 |
old proofs break occasionally as simplification may now solve more |
|
5727 |
goals than previously. |
|
5728 |
||
5729 |
* Simplifier: converts x <= y into x = y if assumption y <= x is |
|
5730 |
present. Works for all partial orders (class "order"), in particular |
|
5731 |
numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y |
|
5732 |
just like y <= x. |
|
5733 |
||
5734 |
* Simplifier: new simproc for "let x = a in f x". If a is a free or |
|
5735 |
bound variable or a constant then the let is unfolded. Otherwise |
|
5736 |
first a is simplified to b, and then f b is simplified to g. If |
|
5737 |
possible we abstract b from g arriving at "let x = b in h x", |
|
5738 |
otherwise we unfold the let and arrive at g. The simproc can be |
|
5739 |
enabled/disabled by the reference use_let_simproc. Potential |
|
5740 |
INCOMPATIBILITY since simplification is more powerful by default. |
|
15776 | 5741 |
|
16563 | 5742 |
* Classical reasoning: the meson method now accepts theorems as arguments. |
5743 |
||
17595 | 5744 |
* Prover support: pre-release of the Isabelle-ATP linkup, which runs background |
5745 |
jobs to provide advice on the provability of subgoals. |
|
5746 |
||
16891 | 5747 |
* Theory OrderedGroup and Ring_and_Field: various additions and |
5748 |
improvements to faciliate calculations involving equalities and |
|
5749 |
inequalities. |
|
5750 |
||
5751 |
The following theorems have been eliminated or modified |
|
5752 |
(INCOMPATIBILITY): |
|
16888 | 5753 |
|
5754 |
abs_eq now named abs_of_nonneg |
|
17371 | 5755 |
abs_of_ge_0 now named abs_of_nonneg |
5756 |
abs_minus_eq now named abs_of_nonpos |
|
16888 | 5757 |
imp_abs_id now named abs_of_nonneg |
5758 |
imp_abs_neg_id now named abs_of_nonpos |
|
5759 |
mult_pos now named mult_pos_pos |
|
5760 |
mult_pos_le now named mult_nonneg_nonneg |
|
5761 |
mult_pos_neg_le now named mult_nonneg_nonpos |
|
5762 |
mult_pos_neg2_le now named mult_nonneg_nonpos2 |
|
5763 |
mult_neg now named mult_neg_neg |
|
5764 |
mult_neg_le now named mult_nonpos_nonpos |
|
5765 |
||
23495
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
5766 |
* The following lemmas in Ring_and_Field have been added to the simplifier: |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
5767 |
|
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
5768 |
zero_le_square |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
5769 |
not_square_less_zero |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
5770 |
|
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
5771 |
The following lemmas have been deleted from Real/RealPow: |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
5772 |
|
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
5773 |
realpow_zero_zero |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
5774 |
realpow_two |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
5775 |
realpow_less |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
5776 |
zero_le_power |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
5777 |
realpow_two_le |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
5778 |
abs_realpow_two |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
5779 |
realpow_two_abs |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
5780 |
|
16891 | 5781 |
* Theory Parity: added rules for simplifying exponents. |
5782 |
||
17092 | 5783 |
* Theory List: |
5784 |
||
5785 |
The following theorems have been eliminated or modified |
|
5786 |
(INCOMPATIBILITY): |
|
5787 |
||
5788 |
list_all_Nil now named list_all.simps(1) |
|
5789 |
list_all_Cons now named list_all.simps(2) |
|
5790 |
list_all_conv now named list_all_iff |
|
5791 |
set_mem_eq now named mem_iff |
|
5792 |
||
16929 | 5793 |
* Theories SetsAndFunctions and BigO (see HOL/Library) support |
5794 |
asymptotic "big O" calculations. See the notes in BigO.thy. |
|
5795 |
||
16888 | 5796 |
|
5797 |
*** HOL-Complex *** |
|
5798 |
||
16891 | 5799 |
* Theory RealDef: better support for embedding natural numbers and |
5800 |
integers in the reals. |
|
5801 |
||
5802 |
The following theorems have been eliminated or modified |
|
5803 |
(INCOMPATIBILITY): |
|
5804 |
||
17016
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset
|
5805 |
exp_ge_add_one_self now requires no hypotheses |
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset
|
5806 |
real_of_int_add reversed direction of equality (use [symmetric]) |
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset
|
5807 |
real_of_int_minus reversed direction of equality (use [symmetric]) |
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset
|
5808 |
real_of_int_diff reversed direction of equality (use [symmetric]) |
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset
|
5809 |
real_of_int_mult reversed direction of equality (use [symmetric]) |
16891 | 5810 |
|
5811 |
* Theory RComplete: expanded support for floor and ceiling functions. |
|
16888 | 5812 |
|
16962 | 5813 |
* Theory Ln is new, with properties of the natural logarithm |
5814 |
||
17423 | 5815 |
* Hyperreal: There is a new type constructor "star" for making |
5816 |
nonstandard types. The old type names are now type synonyms: |
|
5817 |
||
5818 |
hypreal = real star |
|
5819 |
hypnat = nat star |
|
5820 |
hcomplex = complex star |
|
5821 |
||
5822 |
* Hyperreal: Many groups of similarly-defined constants have been |
|
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5823 |
replaced by polymorphic versions (INCOMPATIBILITY): |
17423 | 5824 |
|
5825 |
star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex |
|
5826 |
||
5827 |
starset <-- starsetNat, starsetC |
|
5828 |
*s* <-- *sNat*, *sc* |
|
5829 |
starset_n <-- starsetNat_n, starsetC_n |
|
5830 |
*sn* <-- *sNatn*, *scn* |
|
5831 |
InternalSets <-- InternalNatSets, InternalCSets |
|
5832 |
||
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5833 |
starfun <-- starfun{Nat,Nat2,C,RC,CR} |
17423 | 5834 |
*f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR* |
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5835 |
starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n |
17423 | 5836 |
*fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn* |
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5837 |
InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs |
17423 | 5838 |
|
5839 |
* Hyperreal: Many type-specific theorems have been removed in favor of |
|
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5840 |
theorems specific to various axiomatic type classes (INCOMPATIBILITY): |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5841 |
|
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5842 |
add_commute <-- {hypreal,hypnat,hcomplex}_add_commute |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5843 |
add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5844 |
OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5845 |
OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right |
17423 | 5846 |
right_minus <-- hypreal_add_minus |
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5847 |
left_minus <-- {hypreal,hcomplex}_add_minus_left |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5848 |
mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5849 |
mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5850 |
mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left |
17423 | 5851 |
mult_1_right <-- hcomplex_mult_one_right |
5852 |
mult_zero_left <-- hcomplex_mult_zero_left |
|
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5853 |
left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib |
17423 | 5854 |
right_distrib <-- hypnat_add_mult_distrib2 |
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5855 |
zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one |
17423 | 5856 |
right_inverse <-- hypreal_mult_inverse |
5857 |
left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left |
|
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5858 |
order_refl <-- {hypreal,hypnat}_le_refl |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5859 |
order_trans <-- {hypreal,hypnat}_le_trans |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5860 |
order_antisym <-- {hypreal,hypnat}_le_anti_sym |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5861 |
order_less_le <-- {hypreal,hypnat}_less_le |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5862 |
linorder_linear <-- {hypreal,hypnat}_le_linear |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5863 |
add_left_mono <-- {hypreal,hypnat}_add_left_mono |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5864 |
mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2 |
17423 | 5865 |
add_nonneg_nonneg <-- hypreal_le_add_order |
5866 |
||
5867 |
* Hyperreal: Separate theorems having to do with type-specific |
|
5868 |
versions of constants have been merged into theorems that apply to the |
|
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5869 |
new polymorphic constants (INCOMPATIBILITY): |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5870 |
|
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5871 |
STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5872 |
STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5873 |
STAR_Un <-- {STAR,NatStar,STARC}_Un |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5874 |
STAR_Int <-- {STAR,NatStar,STARC}_Int |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5875 |
STAR_Compl <-- {STAR,NatStar,STARC}_Compl |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5876 |
STAR_subset <-- {STAR,NatStar,STARC}_subset |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5877 |
STAR_mem <-- {STAR,NatStar,STARC}_mem |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5878 |
STAR_mem_Compl <-- {STAR,STARC}_mem_Compl |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5879 |
STAR_diff <-- {STAR,STARC}_diff |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5880 |
STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real, |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5881 |
STARC_hcomplex_of_complex}_image_subset |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5882 |
starset_n_Un <-- starset{Nat,C}_n_Un |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5883 |
starset_n_Int <-- starset{Nat,C}_n_Int |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5884 |
starset_n_Compl <-- starset{Nat,C}_n_Compl |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5885 |
starset_n_diff <-- starset{Nat,C}_n_diff |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5886 |
InternalSets_Un <-- Internal{Nat,C}Sets_Un |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5887 |
InternalSets_Int <-- Internal{Nat,C}Sets_Int |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5888 |
InternalSets_Compl <-- Internal{Nat,C}Sets_Compl |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5889 |
InternalSets_diff <-- Internal{Nat,C}Sets_diff |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5890 |
InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5891 |
InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5892 |
starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5893 |
starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C} |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5894 |
starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR} |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5895 |
starfun <-- starfun{Nat,Nat2,C,RC,CR} |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5896 |
starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5897 |
starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5898 |
starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5899 |
starfun_diff <-- starfun{C,RC,CR}_diff |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5900 |
starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5901 |
starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2 |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5902 |
starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5903 |
starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5904 |
starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5905 |
starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff |
17423 | 5906 |
starfun_Id <-- starfunC_Id |
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5907 |
starfun_approx <-- starfun{Nat,CR}_approx |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5908 |
starfun_capprox <-- starfun{C,RC}_capprox |
17423 | 5909 |
starfun_abs <-- starfunNat_rabs |
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5910 |
starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5911 |
starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2 |
17423 | 5912 |
starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox |
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5913 |
starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5914 |
starfun_add_capprox <-- starfun{C,RC}_add_capprox |
17423 | 5915 |
starfun_add_approx <-- starfunCR_add_approx |
5916 |
starfun_inverse_inverse <-- starfunC_inverse_inverse |
|
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5917 |
starfun_divide <-- starfun{C,CR,RC}_divide |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5918 |
starfun_n <-- starfun{Nat,C}_n |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5919 |
starfun_n_mult <-- starfun{Nat,C}_n_mult |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5920 |
starfun_n_add <-- starfun{Nat,C}_n_add |
17423 | 5921 |
starfun_n_add_minus <-- starfunNat_n_add_minus |
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5922 |
starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5923 |
starfun_n_minus <-- starfun{Nat,C}_n_minus |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5924 |
starfun_n_eq <-- starfun{Nat,C}_n_eq |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5925 |
|
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5926 |
star_n_add <-- {hypreal,hypnat,hcomplex}_add |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5927 |
star_n_minus <-- {hypreal,hcomplex}_minus |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5928 |
star_n_diff <-- {hypreal,hcomplex}_diff |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5929 |
star_n_mult <-- {hypreal,hcomplex}_mult |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5930 |
star_n_inverse <-- {hypreal,hcomplex}_inverse |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5931 |
star_n_le <-- {hypreal,hypnat}_le |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5932 |
star_n_less <-- {hypreal,hypnat}_less |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5933 |
star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5934 |
star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num |
17423 | 5935 |
star_n_abs <-- hypreal_hrabs |
5936 |
star_n_divide <-- hcomplex_divide |
|
5937 |
||
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5938 |
star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5939 |
star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus |
17423 | 5940 |
star_of_diff <-- hypreal_of_real_diff |
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5941 |
star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5942 |
star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5943 |
star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5944 |
star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5945 |
star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5946 |
star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5947 |
star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5948 |
star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5949 |
star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5950 |
star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5951 |
star_of_number_of <-- {hypreal,hcomplex}_number_of |
17423 | 5952 |
star_of_number_less <-- number_of_less_hypreal_of_real_iff |
5953 |
star_of_number_le <-- number_of_le_hypreal_of_real_iff |
|
5954 |
star_of_eq_number <-- hypreal_of_real_eq_number_of_iff |
|
5955 |
star_of_less_number <-- hypreal_of_real_less_number_of_iff |
|
5956 |
star_of_le_number <-- hypreal_of_real_le_number_of_iff |
|
5957 |
star_of_power <-- hypreal_of_real_power |
|
5958 |
star_of_eq_0 <-- hcomplex_of_complex_zero_iff |
|
5959 |
||
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5960 |
* Hyperreal: new method "transfer" that implements the transfer |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5961 |
principle of nonstandard analysis. With a subgoal that mentions |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5962 |
nonstandard types like "'a star", the command "apply transfer" |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5963 |
replaces it with an equivalent one that mentions only standard types. |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5964 |
To be successful, all free variables must have standard types; non- |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5965 |
standard variables must have explicit universal quantifiers. |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5966 |
|
17641 | 5967 |
* Hyperreal: A theory of Taylor series. |
5968 |
||
14655
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset
|
5969 |
|
14682
a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset
|
5970 |
*** HOLCF *** |
a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset
|
5971 |
|
17533 | 5972 |
* Discontinued special version of 'constdefs' (which used to support |
5973 |
continuous functions) in favor of the general Pure one with full |
|
5974 |
type-inference. |
|
5975 |
||
5976 |
* New simplification procedure for solving continuity conditions; it |
|
5977 |
is much faster on terms with many nested lambda abstractions (cubic |
|
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5978 |
instead of exponential time). |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5979 |
|
17533 | 5980 |
* New syntax for domain package: selector names are now optional. |
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5981 |
Parentheses should be omitted unless argument is lazy, for example: |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5982 |
|
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5983 |
domain 'a stream = cons "'a" (lazy "'a stream") |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5984 |
|
17533 | 5985 |
* New command 'fixrec' for defining recursive functions with pattern |
5986 |
matching; defining multiple functions with mutual recursion is also |
|
5987 |
supported. Patterns may include the constants cpair, spair, up, sinl, |
|
5988 |
sinr, or any data constructor defined by the domain package. The given |
|
5989 |
equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for |
|
5990 |
syntax and examples. |
|
5991 |
||
5992 |
* New commands 'cpodef' and 'pcpodef' for defining predicate subtypes |
|
5993 |
of cpo and pcpo types. Syntax is exactly like the 'typedef' command, |
|
5994 |
but the proof obligation additionally includes an admissibility |
|
5995 |
requirement. The packages generate instances of class cpo or pcpo, |
|
5996 |
with continuity and strictness theorems for Rep and Abs. |
|
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
5997 |
|
17584 | 5998 |
* HOLCF: Many theorems have been renamed according to a more standard naming |
5999 |
scheme (INCOMPATIBILITY): |
|
6000 |
||
6001 |
foo_inject: "foo$x = foo$y ==> x = y" |
|
6002 |
foo_eq: "(foo$x = foo$y) = (x = y)" |
|
6003 |
foo_less: "(foo$x << foo$y) = (x << y)" |
|
6004 |
foo_strict: "foo$UU = UU" |
|
6005 |
foo_defined: "... ==> foo$x ~= UU" |
|
6006 |
foo_defined_iff: "(foo$x = UU) = (x = UU)" |
|
6007 |
||
14682
a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset
|
6008 |
|
14885 | 6009 |
*** ZF *** |
6010 |
||
16234 | 6011 |
* ZF/ex: theories Group and Ring provide examples in abstract algebra, |
6012 |
including the First Isomorphism Theorem (on quotienting by the kernel |
|
6013 |
of a homomorphism). |
|
15089
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset
|
6014 |
|
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset
|
6015 |
* ZF/Simplifier: install second copy of type solver that actually |
16234 | 6016 |
makes use of TC rules declared to Isar proof contexts (or locales); |
6017 |
the old version is still required for ML proof scripts. |
|
15703 | 6018 |
|
6019 |
||
17445 | 6020 |
*** Cube *** |
6021 |
||
6022 |
* Converted to Isar theory format; use locales instead of axiomatic |
|
6023 |
theories. |
|
6024 |
||
6025 |
||
15703 | 6026 |
*** ML *** |
6027 |
||
21339 | 6028 |
* Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts |
6029 |
for ||>, ||>>, |>>, |
|
6030 |
||
15973 | 6031 |
* Pure/library.ML no longer defines its own option datatype, but uses |
16234 | 6032 |
that of the SML basis, which has constructors NONE and SOME instead of |
6033 |
None and Some, as well as exception Option.Option instead of OPTION. |
|
6034 |
The functions the, if_none, is_some, is_none have been adapted |
|
6035 |
accordingly, while Option.map replaces apsome. |
|
15973 | 6036 |
|
16860
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6037 |
* Pure/library.ML: the exception LIST has been given up in favour of |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6038 |
the standard exceptions Empty and Subscript, as well as |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6039 |
Library.UnequalLengths. Function like Library.hd and Library.tl are |
36856
b343091e81d8
reverted parts of 7902dc7ea11d -- note that NEWS of published Isabelle releases are essentially read-only;
wenzelm
parents:
36849
diff
changeset
|
6040 |
superceded by the standard hd and tl functions etc. |
16860
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6041 |
|
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6042 |
A number of basic list functions are no longer exported to the ML |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6043 |
toplevel, as they are variants of predefined functions. The following |
16234 | 6044 |
suggests how one can translate existing code: |
15973 | 6045 |
|
6046 |
rev_append xs ys = List.revAppend (xs, ys) |
|
6047 |
nth_elem (i, xs) = List.nth (xs, i) |
|
6048 |
last_elem xs = List.last xs |
|
6049 |
flat xss = List.concat xss |
|
16234 | 6050 |
seq fs = List.app fs |
15973 | 6051 |
partition P xs = List.partition P xs |
6052 |
mapfilter f xs = List.mapPartial f xs |
|
6053 |
||
16860
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6054 |
* Pure/library.ML: several combinators for linear functional |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6055 |
transformations, notably reverse application and composition: |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6056 |
|
17371 | 6057 |
x |> f f #> g |
6058 |
(x, y) |-> f f #-> g |
|
16860
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6059 |
|
17495 | 6060 |
* Pure/library.ML: introduced/changed precedence of infix operators: |
6061 |
||
6062 |
infix 1 |> |-> ||> ||>> |>> |>>> #> #->; |
|
6063 |
infix 2 ?; |
|
6064 |
infix 3 o oo ooo oooo; |
|
6065 |
infix 4 ~~ upto downto; |
|
6066 |
||
6067 |
Maybe INCOMPATIBILITY when any of those is used in conjunction with other |
|
6068 |
infix operators. |
|
6069 |
||
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6070 |
* Pure/library.ML: natural list combinators fold, fold_rev, and |
16869 | 6071 |
fold_map support linear functional transformations and nesting. For |
16860
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6072 |
example: |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6073 |
|
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6074 |
fold f [x1, ..., xN] y = |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6075 |
y |> f x1 |> ... |> f xN |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6076 |
|
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6077 |
(fold o fold) f [xs1, ..., xsN] y = |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6078 |
y |> fold f xs1 |> ... |> fold f xsN |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6079 |
|
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6080 |
fold f [x1, ..., xN] = |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6081 |
f x1 #> ... #> f xN |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6082 |
|
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6083 |
(fold o fold) f [xs1, ..., xsN] = |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6084 |
fold f xs1 #> ... #> fold f xsN |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
6085 |
|
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6086 |
* Pure/library.ML: the following selectors on type 'a option are |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6087 |
available: |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6088 |
|
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6089 |
the: 'a option -> 'a (*partial*) |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6090 |
these: 'a option -> 'a where 'a = 'b list |
17402 | 6091 |
the_default: 'a -> 'a option -> 'a |
6092 |
the_list: 'a option -> 'a list |
|
6093 |
||
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6094 |
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6095 |
basic operations for association lists, following natural argument |
17564 | 6096 |
order; moreover the explicit equality predicate passed here avoids |
17495 | 6097 |
potentially expensive polymorphic runtime equality checks. |
6098 |
The old functions may be expressed as follows: |
|
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6099 |
|
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6100 |
assoc = uncurry (AList.lookup (op =)) |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6101 |
assocs = these oo AList.lookup (op =) |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6102 |
overwrite = uncurry (AList.update (op =)) o swap |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6103 |
|
17564 | 6104 |
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides |
6105 |
||
6106 |
val make: ('a -> 'b) -> 'a list -> ('a * 'b) list |
|
6107 |
val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list |
|
6108 |
||
6109 |
replacing make_keylist and keyfilter (occassionally used) |
|
6110 |
Naive rewrites: |
|
6111 |
||
6112 |
make_keylist = AList.make |
|
6113 |
keyfilter = AList.find (op =) |
|
6114 |
||
6115 |
* eq_fst and eq_snd now take explicit equality parameter, thus |
|
6116 |
avoiding eqtypes. Naive rewrites: |
|
6117 |
||
6118 |
eq_fst = eq_fst (op =) |
|
6119 |
eq_snd = eq_snd (op =) |
|
6120 |
||
6121 |
* Removed deprecated apl and apr (rarely used). |
|
6122 |
Naive rewrites: |
|
6123 |
||
6124 |
apl (n, op) =>>= curry op n |
|
6125 |
apr (op, m) =>>= fn n => op (n, m) |
|
6126 |
||
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6127 |
* Pure/General: structure OrdList (cf. Pure/General/ord_list.ML) |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6128 |
provides a reasonably efficient light-weight implementation of sets as |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6129 |
lists. |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6130 |
|
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6131 |
* Pure/General: generic tables (cf. Pure/General/table.ML) provide a |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6132 |
few new operations; existing lookup and update are now curried to |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6133 |
follow natural argument order (for use with fold etc.); |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6134 |
INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort. |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6135 |
|
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6136 |
* Pure/General: output via the Isabelle channels of |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6137 |
writeln/warning/error etc. is now passed through Output.output, with a |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6138 |
hook for arbitrary transformations depending on the print_mode |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6139 |
(cf. Output.add_mode -- the first active mode that provides a output |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6140 |
function wins). Already formatted output may be embedded into further |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6141 |
text via Output.raw; the result of Pretty.string_of/str_of and derived |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6142 |
functions (string_of_term/cterm/thm etc.) is already marked raw to |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6143 |
accommodate easy composition of diagnostic messages etc. Programmers |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6144 |
rarely need to care about Output.output or Output.raw at all, with |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6145 |
some notable exceptions: Output.output is required when bypassing the |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6146 |
standard channels (writeln etc.), or in token translations to produce |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6147 |
properly formatted results; Output.raw is required when capturing |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6148 |
already output material that will eventually be presented to the user |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6149 |
a second time. For the default print mode, both Output.output and |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6150 |
Output.raw have no effect. |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6151 |
|
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6152 |
* Pure/General: Output.time_accumulator NAME creates an operator ('a |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6153 |
-> 'b) -> 'a -> 'b to measure runtime and count invocations; the |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6154 |
cumulative results are displayed at the end of a batch session. |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6155 |
|
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6156 |
* Pure/General: File.sysify_path and File.quote_sysify path have been |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6157 |
replaced by File.platform_path and File.shell_path (with appropriate |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6158 |
hooks). This provides a clean interface for unusual systems where the |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6159 |
internal and external process view of file names are different. |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6160 |
|
16689
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset
|
6161 |
* Pure: more efficient orders for basic syntactic entities: added |
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset
|
6162 |
fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord |
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset
|
6163 |
and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is |
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset
|
6164 |
NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast |
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset
|
6165 |
orders now -- potential INCOMPATIBILITY for code that depends on a |
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset
|
6166 |
particular order for Symtab.keys, Symtab.dest, etc. (consider using |
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset
|
6167 |
Library.sort_strings on result). |
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset
|
6168 |
|
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6169 |
* Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types, |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6170 |
fold_types traverse types/terms from left to right, observing natural |
36856
b343091e81d8
reverted parts of 7902dc7ea11d -- note that NEWS of published Isabelle releases are essentially read-only;
wenzelm
parents:
36849
diff
changeset
|
6171 |
argument order. Supercedes previous foldl_XXX versions, add_frees, |
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6172 |
add_vars etc. have been adapted as well: INCOMPATIBILITY. |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6173 |
|
16151 | 6174 |
* Pure: name spaces have been refined, with significant changes of the |
16234 | 6175 |
internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table) |
36856
b343091e81d8
reverted parts of 7902dc7ea11d -- note that NEWS of published Isabelle releases are essentially read-only;
wenzelm
parents:
36849
diff
changeset
|
6176 |
to extern(_table). The plain name entry path is superceded by a |
16234 | 6177 |
general 'naming' context, which also includes the 'policy' to produce |
6178 |
a fully qualified name and external accesses of a fully qualified |
|
36856
b343091e81d8
reverted parts of 7902dc7ea11d -- note that NEWS of published Isabelle releases are essentially read-only;
wenzelm
parents:
36849
diff
changeset
|
6179 |
name; NameSpace.extend is superceded by context dependent |
16234 | 6180 |
Sign.declare_name. Several theory and proof context operations modify |
6181 |
the naming context. Especially note Theory.restore_naming and |
|
6182 |
ProofContext.restore_naming to get back to a sane state; note that |
|
6183 |
Theory.add_path is no longer sufficient to recover from |
|
6184 |
Theory.absolute_path in particular. |
|
6185 |
||
6186 |
* Pure: new flags short_names (default false) and unique_names |
|
6187 |
(default true) for controlling output of qualified names. If |
|
6188 |
short_names is set, names are printed unqualified. If unique_names is |
|
6189 |
reset, the name prefix is reduced to the minimum required to achieve |
|
6190 |
the original result when interning again, even if there is an overlap |
|
6191 |
with earlier declarations. |
|
16151 | 6192 |
|
16456
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6193 |
* Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6194 |
now 'extend', and 'merge' gets an additional Pretty.pp argument |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6195 |
(useful for printing error messages). INCOMPATIBILITY. |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6196 |
|
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6197 |
* Pure: major reorganization of the theory context. Type Sign.sg and |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6198 |
Theory.theory are now identified, referring to the universal |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6199 |
Context.theory (see Pure/context.ML). Actual signature and theory |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6200 |
content is managed as theory data. The old code and interfaces were |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6201 |
spread over many files and structures; the new arrangement introduces |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6202 |
considerable INCOMPATIBILITY to gain more clarity: |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6203 |
|
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6204 |
Context -- theory management operations (name, identity, inclusion, |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6205 |
parents, ancestors, merge, etc.), plus generic theory data; |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6206 |
|
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6207 |
Sign -- logical signature and syntax operations (declaring consts, |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6208 |
types, etc.), plus certify/read for common entities; |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6209 |
|
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6210 |
Theory -- logical theory operations (stating axioms, definitions, |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6211 |
oracles), plus a copy of logical signature operations (consts, |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6212 |
types, etc.); also a few basic management operations (Theory.copy, |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6213 |
Theory.merge, etc.) |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6214 |
|
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6215 |
The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6216 |
etc.) as well as the sign field in Thm.rep_thm etc. have been retained |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6217 |
for convenience -- they merely return the theory. |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
6218 |
|
36856
b343091e81d8
reverted parts of 7902dc7ea11d -- note that NEWS of published Isabelle releases are essentially read-only;
wenzelm
parents:
36849
diff
changeset
|
6219 |
* Pure: type Type.tsig is superceded by theory in most interfaces. |
17193
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset
|
6220 |
|
16547
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset
|
6221 |
* Pure: the Isar proof context type is already defined early in Pure |
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset
|
6222 |
as Context.proof (note that ProofContext.context and Proof.context are |
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset
|
6223 |
aliases, where the latter is the preferred name). This enables other |
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset
|
6224 |
Isabelle components to refer to that type even before Isar is present. |
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset
|
6225 |
|
16373
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
6226 |
* Pure/sign/theory: discontinued named name spaces (i.e. classK, |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
6227 |
typeK, constK, axiomK, oracleK), but provide explicit operations for |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
6228 |
any of these kinds. For example, Sign.intern typeK is now |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
6229 |
Sign.intern_type, Theory.hide_space Sign.typeK is now |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
6230 |
Theory.hide_types. Also note that former |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
6231 |
Theory.hide_classes/types/consts are now |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
6232 |
Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
6233 |
internalize their arguments! INCOMPATIBILITY. |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
6234 |
|
16506
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset
|
6235 |
* Pure: get_thm interface (of PureThy and ProofContext) expects |
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset
|
6236 |
datatype thmref (with constructors Name and NameSelection) instead of |
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset
|
6237 |
plain string -- INCOMPATIBILITY; |
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset
|
6238 |
|
16151 | 6239 |
* Pure: cases produced by proof methods specify options, where NONE |
16234 | 6240 |
means to remove case bindings -- INCOMPATIBILITY in |
6241 |
(RAW_)METHOD_CASES. |
|
16151 | 6242 |
|
16373
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
6243 |
* Pure: the following operations retrieve axioms or theorems from a |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
6244 |
theory node or theory hierarchy, respectively: |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
6245 |
|
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
6246 |
Theory.axioms_of: theory -> (string * term) list |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
6247 |
Theory.all_axioms_of: theory -> (string * term) list |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
6248 |
PureThy.thms_of: theory -> (string * thm) list |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
6249 |
PureThy.all_thms_of: theory -> (string * thm) list |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
6250 |
|
16718 | 6251 |
* Pure: print_tac now outputs the goal through the trace channel. |
6252 |
||
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6253 |
* Isar toplevel: improved diagnostics, mostly for Poly/ML only. |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6254 |
Reference Toplevel.debug (default false) controls detailed printing |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6255 |
and tracing of low-level exceptions; Toplevel.profiling (default 0) |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6256 |
controls execution profiling -- set to 1 for time and 2 for space |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6257 |
(both increase the runtime). |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6258 |
|
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6259 |
* Isar session: The initial use of ROOT.ML is now always timed, |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6260 |
i.e. the log will show the actual process times, in contrast to the |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6261 |
elapsed wall-clock time that the outer shell wrapper produces. |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6262 |
|
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
6263 |
* Simplifier: improved handling of bound variables (nameless |
16997
7dfc99f62dd9
* Pure/Simplifier: improved handling of bound variables;
wenzelm
parents:
16962
diff
changeset
|
6264 |
representation, avoid allocating new strings). Simprocs that invoke |
7dfc99f62dd9
* Pure/Simplifier: improved handling of bound variables;
wenzelm
parents:
16962
diff
changeset
|
6265 |
the Simplifier recursively should use Simplifier.inherit_bounds to |
17720 | 6266 |
avoid local name clashes. Failure to do so produces warnings |
6267 |
"Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds |
|
6268 |
for further details. |
|
16234 | 6269 |
|
17166 | 6270 |
* ML functions legacy_bindings and use_legacy_bindings produce ML fact |
6271 |
bindings for all theorems stored within a given theory; this may help |
|
6272 |
in porting non-Isar theories to Isar ones, while keeping ML proof |
|
6273 |
scripts for the time being. |
|
6274 |
||
17457 | 6275 |
* ML operator HTML.with_charset specifies the charset begin used for |
6276 |
generated HTML files. For example: |
|
6277 |
||
6278 |
HTML.with_charset "utf-8" use_thy "Hebrew"; |
|
17538 | 6279 |
HTML.with_charset "utf-8" use_thy "Chinese"; |
17457 | 6280 |
|
16234 | 6281 |
|
6282 |
*** System *** |
|
6283 |
||
6284 |
* Allow symlinks to all proper Isabelle executables (Isabelle, |
|
6285 |
isabelle, isatool etc.). |
|
6286 |
||
6287 |
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for |
|
6288 |
isatool doc, isatool mkdir, display_drafts etc.). |
|
6289 |
||
6290 |
* isatool usedir: option -f allows specification of the ML file to be |
|
6291 |
used by Isabelle; default is ROOT.ML. |
|
6292 |
||
16251
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset
|
6293 |
* New isatool version outputs the version identifier of the Isabelle |
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset
|
6294 |
distribution being used. |
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset
|
6295 |
|
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset
|
6296 |
* HOL: new isatool dimacs2hol converts files in DIMACS CNF format |
16234 | 6297 |
(containing Boolean satisfiability problems) into Isabelle/HOL |
6298 |
theories. |
|
15703 | 6299 |
|
6300 |
||
14655
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset
|
6301 |
|
14606 | 6302 |
New in Isabelle2004 (April 2004) |
6303 |
-------------------------------- |
|
13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
6304 |
|
14171
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset
|
6305 |
*** General *** |
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset
|
6306 |
|
14398
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
6307 |
* Provers/order.ML: new efficient reasoner for partial and linear orders. |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
6308 |
Replaces linorder.ML. |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
6309 |
|
14606 | 6310 |
* Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic |
6311 |
(\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler |
|
14173 | 6312 |
(\<a>...\<z>), are now considered normal letters, and can therefore |
6313 |
be used anywhere where an ASCII letter (a...zA...Z) has until |
|
6314 |
now. COMPATIBILITY: This obviously changes the parsing of some |
|
6315 |
terms, especially where a symbol has been used as a binder, say |
|
6316 |
'\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed |
|
6317 |
as an identifier. Fix it by inserting a space around former |
|
6318 |
symbols. Call 'isatool fixgreek' to try to fix parsing errors in |
|
6319 |
existing theory and ML files. |
|
14171
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset
|
6320 |
|
14237 | 6321 |
* Pure: Macintosh and Windows line-breaks are now allowed in theory files. |
6322 |
||
14731 | 6323 |
* Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now |
6324 |
allowed in identifiers. Similar to Greek letters \<^isub> is now considered |
|
6325 |
a normal (but invisible) letter. For multiple letter subscripts repeat |
|
6326 |
\<^isub> like this: x\<^isub>1\<^isub>2. |
|
14233 | 6327 |
|
14333 | 6328 |
* Pure: There are now sub-/superscripts that can span more than one |
6329 |
character. Text between \<^bsub> and \<^esub> is set in subscript in |
|
14606 | 6330 |
ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in |
6331 |
superscript. The new control characters are not identifier parts. |
|
14333 | 6332 |
|
14561
c53396af770e
* raw control symbols are of the form \<^raw:...> now.
schirmer
parents:
14556
diff
changeset
|
6333 |
* Pure: Control-symbols of the form \<^raw:...> will literally print the |
14606 | 6334 |
content of "..." to the latex file instead of \isacntrl... . The "..." |
6335 |
may consist of any printable characters excluding the end bracket >. |
|
14361
ad2f5da643b4
* Support for raw latex output in control symbols: \<^raw...>
schirmer
parents:
14333
diff
changeset
|
6336 |
|
14237 | 6337 |
* Pure: Using new Isar command "finalconsts" (or the ML functions |
6338 |
Theory.add_finals or Theory.add_finals_i) it is now possible to |
|
6339 |
declare constants "final", which prevents their being given a definition |
|
6340 |
later. It is useful for constants whose behaviour is fixed axiomatically |
|
14224 | 6341 |
rather than definitionally, such as the meta-logic connectives. |
6342 |
||
14606 | 6343 |
* Pure: 'instance' now handles general arities with general sorts |
6344 |
(i.e. intersections of classes), |
|
14503
255ad604e08e
Added check that Theory.ML does not occur in the files section of the theory
skalberg
parents:
14480
diff
changeset
|
6345 |
|
14547 | 6346 |
* Presentation: generated HTML now uses a CSS style sheet to make layout |
14731 | 6347 |
(somewhat) independent of content. It is copied from lib/html/isabelle.css. |
14547 | 6348 |
It can be changed to alter the colors/layout of generated pages. |
6349 |
||
14556
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset
|
6350 |
|
14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
6351 |
*** Isar *** |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
6352 |
|
14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset
|
6353 |
* Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac, |
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset
|
6354 |
cut_tac, subgoal_tac and thin_tac: |
14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
6355 |
- Now understand static (Isar) contexts. As a consequence, users of Isar |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
6356 |
locales are no longer forced to write Isar proof scripts. |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
6357 |
For details see Isar Reference Manual, paragraph 4.3.2: Further tactic |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
6358 |
emulations. |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
6359 |
- INCOMPATIBILITY: names of variables to be instantiated may no |
14211
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
6360 |
longer be enclosed in quotes. Instead, precede variable name with `?'. |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
6361 |
This is consistent with the instantiation attribute "where". |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
6362 |
|
14257
a7ef3f7588c5
Type inference bug in Isar attributes "where" and "of" fixed.
ballarin
parents:
14255
diff
changeset
|
6363 |
* Attributes "where" and "of": |
14285
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset
|
6364 |
- Now take type variables of instantiated theorem into account when reading |
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset
|
6365 |
the instantiation string. This fixes a bug that caused instantiated |
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset
|
6366 |
theorems to have too special types in some circumstances. |
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset
|
6367 |
- "where" permits explicit instantiations of type variables. |
14257
a7ef3f7588c5
Type inference bug in Isar attributes "where" and "of" fixed.
ballarin
parents:
14255
diff
changeset
|
6368 |
|
14556
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset
|
6369 |
* Calculation commands "moreover" and "also" no longer interfere with |
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset
|
6370 |
current facts ("this"), admitting arbitrary combinations with "then" |
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset
|
6371 |
and derived forms. |
14283 | 6372 |
|
14211
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
6373 |
* Locales: |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
6374 |
- Goal statements involving the context element "includes" no longer |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
6375 |
generate theorems with internal delta predicates (those ending on |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
6376 |
"_axioms") in the premise. |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
6377 |
Resolve particular premise with <locale>.intro to obtain old form. |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
6378 |
- Fixed bug in type inference ("unify_frozen") that prevented mix of target |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
6379 |
specification and "includes" elements in goal statement. |
14254
342634f38451
Isar/Locales: <loc>.intro and <loc>.axioms no longer intro? and elim? by
ballarin
parents:
14243
diff
changeset
|
6380 |
- Rule sets <locale>.intro and <locale>.axioms no longer declared as |
342634f38451
Isar/Locales: <loc>.intro and <loc>.axioms no longer intro? and elim? by
ballarin
parents:
14243
diff
changeset
|
6381 |
[intro?] and [elim?] (respectively) by default. |
14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset
|
6382 |
- Experimental command for instantiation of locales in proof contexts: |
14551 | 6383 |
instantiate <label>[<attrs>]: <loc> |
14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset
|
6384 |
Instantiates locale <loc> and adds all its theorems to the current context |
14551 | 6385 |
taking into account their attributes. Label and attrs are optional |
6386 |
modifiers, like in theorem declarations. If present, names of |
|
6387 |
instantiated theorems are qualified with <label>, and the attributes |
|
6388 |
<attrs> are applied after any attributes these theorems might have already. |
|
6389 |
If the locale has assumptions, a chained fact of the form |
|
14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset
|
6390 |
"<loc> t1 ... tn" is expected from which instantiations of the parameters |
14551 | 6391 |
are derived. The command does not support old-style locales declared |
6392 |
with "locale (open)". |
|
6393 |
A few (very simple) examples can be found in FOL/ex/LocaleInst.thy. |
|
14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
6394 |
|
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
6395 |
* HOL: Tactic emulation methods induct_tac and case_tac understand static |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
6396 |
(Isar) contexts. |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
6397 |
|
14556
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset
|
6398 |
|
14136 | 6399 |
*** HOL *** |
6400 |
||
14624 | 6401 |
* Proof import: new image HOL4 contains the imported library from |
6402 |
the HOL4 system with about 2500 theorems. It is imported by |
|
6403 |
replaying proof terms produced by HOL4 in Isabelle. The HOL4 image |
|
6404 |
can be used like any other Isabelle image. See |
|
6405 |
HOL/Import/HOL/README for more information. |
|
6406 |
||
14398
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
6407 |
* Simplifier: |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
6408 |
- Much improved handling of linear and partial orders. |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
6409 |
Reasoners for linear and partial orders are set up for type classes |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
6410 |
"linorder" and "order" respectively, and are added to the default simpset |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
6411 |
as solvers. This means that the simplifier can build transitivity chains |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
6412 |
to solve goals from the assumptions. |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
6413 |
- INCOMPATIBILITY: old proofs break occasionally. Typically, applications |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
6414 |
of blast or auto after simplification become unnecessary because the goal |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
6415 |
is solved by simplification already. |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
6416 |
|
14731 | 6417 |
* Numerics: new theory Ring_and_Field contains over 250 basic numerical laws, |
14389 | 6418 |
all proved in axiomatic type classes for semirings, rings and fields. |
6419 |
||
6420 |
* Numerics: |
|
6421 |
- Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are |
|
14731 | 6422 |
now formalized using the Ring_and_Field theory mentioned above. |
14389 | 6423 |
- INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently |
6424 |
than before, because now they are set up once in a generic manner. |
|
14731 | 6425 |
- INCOMPATIBILITY: many type-specific arithmetic laws have gone. |
14480 | 6426 |
Look for the general versions in Ring_and_Field (and Power if they concern |
6427 |
exponentiation). |
|
14389 | 6428 |
|
14401 | 6429 |
* Type "rat" of the rational numbers is now available in HOL-Complex. |
14389 | 6430 |
|
14255 | 6431 |
* Records: |
6432 |
- Record types are now by default printed with their type abbreviation |
|
6433 |
instead of the list of all field types. This can be configured via |
|
6434 |
the reference "print_record_type_abbr". |
|
14731 | 6435 |
- Simproc "record_upd_simproc" for simplification of multiple updates added |
14255 | 6436 |
(not enabled by default). |
14427 | 6437 |
- Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp. |
6438 |
EX x. x = sel r to True (not enabled by default). |
|
14255 | 6439 |
- Tactic "record_split_simp_tac" to split and simplify records added. |
14731 | 6440 |
|
14136 | 6441 |
* 'specification' command added, allowing for definition by |
14224 | 6442 |
specification. There is also an 'ax_specification' command that |
6443 |
introduces the new constants axiomatically. |
|
14136 | 6444 |
|
14375 | 6445 |
* arith(_tac) is now able to generate counterexamples for reals as well. |
6446 |
||
14399
dc677b35e54f
New lemmas about inversion of restricted functions.
ballarin
parents:
14398
diff
changeset
|
6447 |
* HOL-Algebra: new locale "ring" for non-commutative rings. |
dc677b35e54f
New lemmas about inversion of restricted functions.
ballarin
parents:
14398
diff
changeset
|
6448 |
|
14243 | 6449 |
* HOL-ex: InductiveInvariant_examples illustrates advanced recursive function |
14610 | 6450 |
definitions, thanks to Sava Krsti\'{c} and John Matthews. |
6451 |
||
14731 | 6452 |
* HOL-Matrix: a first theory for matrices in HOL with an application of |
14610 | 6453 |
matrix theory to linear programming. |
14136 | 6454 |
|
14380 | 6455 |
* Unions and Intersections: |
15119 | 6456 |
The latex output syntax of UN and INT has been changed |
6457 |
from "\Union x \in A. B" to "\Union_{x \in A} B" |
|
6458 |
i.e. the index formulae has become a subscript. |
|
6459 |
Similarly for "\Union x. B", and for \Inter instead of \Union. |
|
14380 | 6460 |
|
14418 | 6461 |
* Unions and Intersections over Intervals: |
14731 | 6462 |
There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is |
6463 |
also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A" |
|
14418 | 6464 |
like in normal math, and corresponding versions for < and for intersection. |
6465 |
||
15677 | 6466 |
* HOL/List: Ordering "lexico" is renamed "lenlex" and the standard |
6467 |
lexicographic dictonary ordering has been added as "lexord". |
|
6468 |
||
14401 | 6469 |
* ML: the legacy theory structures Int and List have been removed. They had |
6470 |
conflicted with ML Basis Library structures having the same names. |
|
14380 | 6471 |
|
14464 | 6472 |
* 'refute' command added to search for (finite) countermodels. Only works |
6473 |
for a fragment of HOL. The installation of an external SAT solver is |
|
6474 |
highly recommended. See "HOL/Refute.thy" for details. |
|
6475 |
||
14602 | 6476 |
* 'quickcheck' command: Allows to find counterexamples by evaluating |
6477 |
formulae under an assignment of free variables to random values. |
|
6478 |
In contrast to 'refute', it can deal with inductive datatypes, |
|
6479 |
but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy" |
|
6480 |
for examples. |
|
14464 | 6481 |
|
14606 | 6482 |
|
14536 | 6483 |
*** HOLCF *** |
6484 |
||
6485 |
* Streams now come with concatenation and are part of the HOLCF image |
|
6486 |
||
14572 | 6487 |
|
6488 |
||
14136 | 6489 |
New in Isabelle2003 (May 2003) |
14606 | 6490 |
------------------------------ |
14136 | 6491 |
|
13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
6492 |
*** General *** |
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
6493 |
|
13618 | 6494 |
* Provers/simplifier: |
6495 |
||
13781 | 6496 |
- Completely reimplemented method simp (ML: Asm_full_simp_tac): |
13618 | 6497 |
Assumptions are now subject to complete mutual simplification, |
6498 |
not just from left to right. The simplifier now preserves |
|
6499 |
the order of assumptions. |
|
6500 |
||
6501 |
Potential INCOMPATIBILITY: |
|
6502 |
||
13781 | 6503 |
-- simp sometimes diverges where the old version did |
6504 |
not, e.g. invoking simp on the goal |
|
13618 | 6505 |
|
6506 |
[| P (f x); y = x; f x = f y |] ==> Q |
|
6507 |
||
13781 | 6508 |
now gives rise to the infinite reduction sequence |
6509 |
||
6510 |
P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ... |
|
6511 |
||
6512 |
Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this |
|
6513 |
kind of problem. |
|
6514 |
||
6515 |
-- Tactics combining classical reasoner and simplification (such as auto) |
|
6516 |
are also affected by this change, because many of them rely on |
|
6517 |
simp. They may sometimes diverge as well or yield a different numbers |
|
6518 |
of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto |
|
6519 |
in case of problems. Sometimes subsequent calls to the classical |
|
6520 |
reasoner will fail because a preceeding call to the simplifier too |
|
6521 |
eagerly simplified the goal, e.g. deleted redundant premises. |
|
13618 | 6522 |
|
6523 |
- The simplifier trace now shows the names of the applied rewrite rules |
|
6524 |
||
13829 | 6525 |
- You can limit the number of recursive invocations of the simplifier |
6526 |
during conditional rewriting (where the simplifie tries to solve the |
|
6527 |
conditions before applying the rewrite rule): |
|
6528 |
ML "simp_depth_limit := n" |
|
6529 |
where n is an integer. Thus you can force termination where previously |
|
6530 |
the simplifier would diverge. |
|
6531 |
||
13835
12b2ffbe543a
Change to meta simplifier: congruence rules may now have frees as head of term.
ballarin
parents:
13829
diff
changeset
|
6532 |
- Accepts free variables as head terms in congruence rules. Useful in Isar. |
13829 | 6533 |
|
13938 | 6534 |
- No longer aborts on failed congruence proof. Instead, the |
6535 |
congruence is ignored. |
|
6536 |
||
14008 | 6537 |
* Pure: New generic framework for extracting programs from constructive |
6538 |
proofs. See HOL/Extraction.thy for an example instantiation, as well |
|
6539 |
as HOL/Extraction for some case studies. |
|
6540 |
||
13868 | 6541 |
* Pure: The main goal of the proof state is no longer shown by default, only |
6542 |
the subgoals. This behaviour is controlled by a new flag. |
|
13835
12b2ffbe543a
Change to meta simplifier: congruence rules may now have frees as head of term.
ballarin
parents:
13829
diff
changeset
|
6543 |
PG menu: Isabelle/Isar -> Settings -> Show Main Goal |
13815 | 6544 |
(ML: Proof.show_main_goal). |
6545 |
||
6546 |
* Pure: You can find all matching introduction rules for subgoal 1, i.e. all |
|
6547 |
rules whose conclusion matches subgoal 1: |
|
6548 |
PG menu: Isabelle/Isar -> Show me -> matching rules |
|
6549 |
The rules are ordered by how closely they match the subgoal. |
|
6550 |
In particular, rules that solve a subgoal outright are displayed first |
|
6551 |
(or rather last, the way they are printed). |
|
6552 |
(ML: ProofGeneral.print_intros()) |
|
6553 |
||
6554 |
* Pure: New flag trace_unify_fail causes unification to print |
|
13781 | 6555 |
diagnostic information (PG: in trace buffer) when it fails. This is |
6556 |
useful for figuring out why single step proofs like rule, erule or |
|
6557 |
assumption failed. |
|
6558 |
||
13815 | 6559 |
* Pure: Locale specifications now produce predicate definitions |
13410
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
6560 |
according to the body of text (covering assumptions modulo local |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
6561 |
definitions); predicate "loc_axioms" covers newly introduced text, |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
6562 |
while "loc" is cumulative wrt. all included locale expressions; the |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
6563 |
latter view is presented only on export into the global theory |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
6564 |
context; potential INCOMPATIBILITY, use "(open)" option to fall back |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
6565 |
on the old view without predicates; |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
6566 |
|
13459
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset
|
6567 |
* Pure: predefined locales "var" and "struct" are useful for sharing |
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset
|
6568 |
parameters (as in CASL, for example); just specify something like |
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset
|
6569 |
``var x + var y + struct M'' as import; |
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset
|
6570 |
|
13463
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
6571 |
* Pure: improved thms_containing: proper indexing of facts instead of |
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
6572 |
raw theorems; check validity of results wrt. current name space; |
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
6573 |
include local facts of proof configuration (also covers active |
13541 | 6574 |
locales), cover fixed variables in index; may use "_" in term |
6575 |
specification; an optional limit for the number of printed facts may |
|
6576 |
be given (the default is 40); |
|
6577 |
||
6578 |
* Pure: disallow duplicate fact bindings within new-style theory files |
|
6579 |
(batch-mode only); |
|
13540
aede0306e214
* Pure: disallow duplicate fact bindings within new-style theory files;
wenzelm
parents:
13522
diff
changeset
|
6580 |
|
13463
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
6581 |
* Provers: improved induct method: assumptions introduced by case |
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
6582 |
"foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from |
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
6583 |
the goal statement); "foo" still refers to all facts collectively; |
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
6584 |
|
13550 | 6585 |
* Provers: the function blast.overloaded has been removed: all constants |
6586 |
are regarded as potentially overloaded, which improves robustness in exchange |
|
6587 |
for slight decrease in efficiency; |
|
6588 |
||
13781 | 6589 |
* Provers/linorder: New generic prover for transitivity reasoning over |
6590 |
linear orders. Note: this prover is not efficient! |
|
6591 |
||
13522
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset
|
6592 |
* Isar: preview of problems to finish 'show' now produce an error |
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset
|
6593 |
rather than just a warning (in interactive mode); |
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset
|
6594 |
|
13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
6595 |
|
13158 | 6596 |
*** HOL *** |
6597 |
||
13899 | 6598 |
* arith(_tac) |
6599 |
||
6600 |
- Produces a counter example if it cannot prove a goal. |
|
6601 |
Note that the counter example may be spurious if the goal is not a formula |
|
6602 |
of quantifier-free linear arithmetic. |
|
6603 |
In ProofGeneral the counter example appears in the trace buffer. |
|
6604 |
||
6605 |
- Knows about div k and mod k where k is a numeral of type nat or int. |
|
6606 |
||
6607 |
- Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free |
|
6608 |
linear arithmetic fails. This takes account of quantifiers and divisibility. |
|
14731 | 6609 |
Presburger arithmetic can also be called explicitly via presburger(_tac). |
13899 | 6610 |
|
6611 |
* simp's arithmetic capabilities have been enhanced a bit: it now |
|
6612 |
takes ~= in premises into account (by performing a case split); |
|
6613 |
||
6614 |
* simp reduces "m*(n div m) + n mod m" to n, even if the two summands |
|
6615 |
are distributed over a sum of terms; |
|
6616 |
||
13735 | 6617 |
* New tactic "trans_tac" and method "trans" instantiate |
6618 |
Provers/linorder.ML for axclasses "order" and "linorder" (predicates |
|
14731 | 6619 |
"<=", "<" and "="). |
6620 |
||
6621 |
* function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main |
|
13587 | 6622 |
HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp"; |
6623 |
||
13443 | 6624 |
* 'typedef' command has new option "open" to suppress the set |
6625 |
definition; |
|
6626 |
||
13522
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset
|
6627 |
* functions Min and Max on finite sets have been introduced (theory |
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset
|
6628 |
Finite_Set); |
13492 | 6629 |
|
13443 | 6630 |
* attribute [symmetric] now works for relations as well; it turns |
6631 |
(x,y) : R^-1 into (y,x) : R, and vice versa; |
|
6632 |
||
13613 | 6633 |
* induct over a !!-quantified statement (say !!x1..xn): |
6634 |
each "case" automatically performs "fix x1 .. xn" with exactly those names. |
|
6635 |
||
13899 | 6636 |
* Map: `empty' is no longer a constant but a syntactic abbreviation for |
6637 |
%x. None. Warning: empty_def now refers to the previously hidden definition |
|
6638 |
of the empty set. |
|
6639 |
||
14018 | 6640 |
* Algebra: formalization of classical algebra. Intended as base for |
6641 |
any algebraic development in Isabelle. Currently covers group theory |
|
6642 |
(up to Sylow's theorem) and ring theory (Universal Property of |
|
6643 |
Univariate Polynomials). Contributions welcome; |
|
13960 | 6644 |
|
6645 |
* GroupTheory: deleted, since its material has been moved to Algebra; |
|
6646 |
||
14731 | 6647 |
* Complex: new directory of the complex numbers with numeric constants, |
6648 |
nonstandard complex numbers, and some complex analysis, standard and |
|
13966
2160abf7cfe7
removal of the image HOL-Real and merging of HOL-Real-ex with HOL-Complex-ex
paulson
parents:
13960
diff
changeset
|
6649 |
nonstandard (Jacques Fleuriot); |
2160abf7cfe7
removal of the image HOL-Real and merging of HOL-Real-ex with HOL-Complex-ex
paulson
parents:
13960
diff
changeset
|
6650 |
|
2160abf7cfe7
removal of the image HOL-Real and merging of HOL-Real-ex with HOL-Complex-ex
paulson
parents:
13960
diff
changeset
|
6651 |
* HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal; |
2160abf7cfe7
removal of the image HOL-Real and merging of HOL-Real-ex with HOL-Complex-ex
paulson
parents:
13960
diff
changeset
|
6652 |
|
14731 | 6653 |
* Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques |
13966
2160abf7cfe7
removal of the image HOL-Real and merging of HOL-Real-ex with HOL-Complex-ex
paulson
parents:
13960
diff
changeset
|
6654 |
Fleuriot); |
13960 | 6655 |
|
13549 | 6656 |
* Real/HahnBanach: updated and adapted to locales; |
6657 |
||
13995 | 6658 |
* NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad, |
6659 |
Gray and Kramer); |
|
13872 | 6660 |
|
6661 |
* UNITY: added the Meier-Sanders theory of progress sets; |
|
6662 |
||
14011 | 6663 |
* MicroJava: bytecode verifier and lightweight bytecode verifier |
6664 |
as abstract algorithms, instantiated to the JVM; |
|
6665 |
||
14010 | 6666 |
* Bali: Java source language formalization. Type system, operational |
6667 |
semantics, axiomatic semantics. Supported language features: |
|
6668 |
classes, interfaces, objects,virtual methods, static methods, |
|
6669 |
static/instance fields, arrays, access modifiers, definite |
|
6670 |
assignment, exceptions. |
|
13549 | 6671 |
|
14011 | 6672 |
|
13549 | 6673 |
*** ZF *** |
6674 |
||
15154 | 6675 |
* ZF/Constructible: consistency proof for AC (Gdel's constructible |
13549 | 6676 |
universe, etc.); |
6677 |
||
13872 | 6678 |
* Main ZF: virtually all theories converted to new-style format; |
13518 | 6679 |
|
13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
6680 |
|
13478 | 6681 |
*** ML *** |
6682 |
||
6683 |
* Pure: Tactic.prove provides sane interface for internal proofs; |
|
6684 |
omits the infamous "standard" operation, so this is more appropriate |
|
6685 |
than prove_goalw_cterm in many situations (e.g. in simprocs); |
|
6686 |
||
6687 |
* Pure: improved error reporting of simprocs; |
|
6688 |
||
6689 |
* Provers: Simplifier.simproc(_i) provides sane interface for setting |
|
6690 |
up simprocs; |
|
6691 |
||
6692 |
||
13953 | 6693 |
*** Document preparation *** |
6694 |
||
6695 |
* uses \par instead of \\ for line breaks in theory text. This may |
|
6696 |
shift some page breaks in large documents. To get the old behaviour |
|
6697 |
use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex. |
|
6698 |
||
14731 | 6699 |
* minimized dependencies of isabelle.sty and isabellesym.sty on |
13953 | 6700 |
other packages |
6701 |
||
6702 |
* \<euro> now needs package babel/greek instead of marvosym (which |
|
6703 |
broke \Rightarrow) |
|
6704 |
||
14731 | 6705 |
* normal size for \<zero>...\<nine> (uses \mathbf instead of |
13954 | 6706 |
textcomp package) |
13953 | 6707 |
|
13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
6708 |
|
14572 | 6709 |
|
12984 | 6710 |
New in Isabelle2002 (March 2002) |
6711 |
-------------------------------- |
|
11474 | 6712 |
|
11572 | 6713 |
*** Document preparation *** |
6714 |
||
11842
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
6715 |
* greatly simplified document preparation setup, including more |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
6716 |
graceful interpretation of isatool usedir -i/-d/-D options, and more |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
6717 |
instructive isatool mkdir; users should basically be able to get |
12899
7d5b690253ee
"isatool usedir -D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset
|
6718 |
started with "isatool mkdir HOL Test && isatool make"; alternatively, |
7d5b690253ee
"isatool usedir -D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset
|
6719 |
users may run a separate document processing stage manually like this: |
7d5b690253ee
"isatool usedir -D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset
|
6720 |
"isatool usedir -D output HOL Test && isatool document Test/output"; |
11842
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
6721 |
|
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
6722 |
* theory dependency graph may now be incorporated into documents; |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
6723 |
isatool usedir -g true will produce session_graph.eps/.pdf for use |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
6724 |
with \includegraphics of LaTeX; |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
6725 |
|
11864
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset
|
6726 |
* proper spacing of consecutive markup elements, especially text |
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset
|
6727 |
blocks after section headings; |
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset
|
6728 |
|
11572 | 6729 |
* support bold style (for single symbols only), input syntax is like |
6730 |
this: "\<^bold>\<alpha>" or "\<^bold>A"; |
|
6731 |
||
11814 | 6732 |
* \<bullet> is now output as bold \cdot by default, which looks much |
11572 | 6733 |
better in printed text; |
6734 |
||
11712
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset
|
6735 |
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>; |
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset
|
6736 |
note that these symbols are currently unavailable in Proof General / |
12769 | 6737 |
X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>; |
12690 | 6738 |
|
6739 |
* isatool latex no longer depends on changed TEXINPUTS, instead |
|
6740 |
isatool document copies the Isabelle style files to the target |
|
6741 |
location; |
|
11712
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset
|
6742 |
|
11572 | 6743 |
|
11633 | 6744 |
*** Isar *** |
6745 |
||
12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
6746 |
* Pure/Provers: improved proof by cases and induction; |
12280 | 6747 |
- 'case' command admits impromptu naming of parameters (such as |
6748 |
"case (Suc n)"); |
|
6749 |
- 'induct' method divinates rule instantiation from the inductive |
|
6750 |
claim; no longer requires excessive ?P bindings for proper |
|
6751 |
instantiation of cases; |
|
6752 |
- 'induct' method properly enumerates all possibilities of set/type |
|
6753 |
rules; as a consequence facts may be also passed through *type* |
|
6754 |
rules without further ado; |
|
6755 |
- 'induct' method now derives symbolic cases from the *rulified* |
|
6756 |
rule (before it used to rulify cases stemming from the internal |
|
6757 |
atomized version); this means that the context of a non-atomic |
|
6758 |
statement becomes is included in the hypothesis, avoiding the |
|
6759 |
slightly cumbersome show "PROP ?case" form; |
|
6760 |
- 'induct' may now use elim-style induction rules without chaining |
|
6761 |
facts, using ``missing'' premises from the goal state; this allows |
|
6762 |
rules stemming from inductive sets to be applied in unstructured |
|
6763 |
scripts, while still benefitting from proper handling of non-atomic |
|
6764 |
statements; NB: major inductive premises need to be put first, all |
|
6765 |
the rest of the goal is passed through the induction; |
|
6766 |
- 'induct' proper support for mutual induction involving non-atomic |
|
6767 |
rule statements (uses the new concept of simultaneous goals, see |
|
6768 |
below); |
|
12853 | 6769 |
- append all possible rule selections, but only use the first |
6770 |
success (no backtracking); |
|
11995
4a622f5fb164
- 'induct' may now use elim-style induction rules without chaining
wenzelm
parents:
11986
diff
changeset
|
6771 |
- removed obsolete "(simplified)" and "(stripped)" options of methods; |
12754
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset
|
6772 |
- undeclared rule case names default to numbers 1, 2, 3, ...; |
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset
|
6773 |
- added 'print_induct_rules' (covered by help item in recent Proof |
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset
|
6774 |
General versions); |
11995
4a622f5fb164
- 'induct' may now use elim-style induction rules without chaining
wenzelm
parents:
11986
diff
changeset
|
6775 |
- moved induct/cases attributes to Pure, methods to Provers; |
4a622f5fb164
- 'induct' may now use elim-style induction rules without chaining
wenzelm
parents:
11986
diff
changeset
|
6776 |
- generic method setup instantiated for FOL and HOL; |
11986
26b95a6f3f79
- 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset
|
6777 |
|
12163
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
6778 |
* Pure: support multiple simultaneous goal statements, for example |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
6779 |
"have a: A and b: B" (same for 'theorem' etc.); being a pure |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
6780 |
meta-level mechanism, this acts as if several individual goals had |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
6781 |
been stated separately; in particular common proof methods need to be |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
6782 |
repeated in order to cover all claims; note that a single elimination |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
6783 |
step is *not* sufficient to establish the two conjunctions, so this |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
6784 |
fails: |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
6785 |
|
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
6786 |
assume "A & B" then have A and B .. (*".." fails*) |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
6787 |
|
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
6788 |
better use "obtain" in situations as above; alternative refer to |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
6789 |
multi-step methods like 'auto', 'simp_all', 'blast+' etc.; |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
6790 |
|
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
6791 |
* Pure: proper integration with ``locales''; unlike the original |
15154 | 6792 |
version by Florian Kammller, Isar locales package high-level proof |
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
6793 |
contexts rather than raw logical ones (e.g. we admit to include |
12280 | 6794 |
attributes everywhere); operations on locales include merge and |
12964 | 6795 |
rename; support for implicit arguments (``structures''); simultaneous |
6796 |
type-inference over imports and text; see also HOL/ex/Locales.thy for |
|
6797 |
some examples; |
|
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
6798 |
|
12707
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
6799 |
* Pure: the following commands have been ``localized'', supporting a |
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
6800 |
target locale specification "(in name)": 'lemma', 'theorem', |
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
6801 |
'corollary', 'lemmas', 'theorems', 'declare'; the results will be |
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
6802 |
stored both within the locale and at the theory level (exported and |
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
6803 |
qualified by the locale name); |
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
6804 |
|
12964 | 6805 |
* Pure: theory goals may now be specified in ``long'' form, with |
6806 |
ad-hoc contexts consisting of arbitrary locale elements. for example |
|
6807 |
``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and |
|
6808 |
definitions may be given, too); the result is a meta-level rule with |
|
6809 |
the context elements being discharged in the obvious way; |
|
6810 |
||
6811 |
* Pure: new proof command 'using' allows to augment currently used |
|
6812 |
facts after a goal statement ('using' is syntactically analogous to |
|
6813 |
'apply', but acts on the goal's facts only); this allows chained facts |
|
6814 |
to be separated into parts given before and after a claim, as in |
|
6815 |
``from a and b have C using d and e <proof>''; |
|
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
6816 |
|
11722 | 6817 |
* Pure: renamed "antecedent" case to "rule_context"; |
6818 |
||
12964 | 6819 |
* Pure: new 'judgment' command records explicit information about the |
6820 |
object-logic embedding (used by several tools internally); no longer |
|
6821 |
use hard-wired "Trueprop"; |
|
6822 |
||
11738 | 6823 |
* Pure: added 'corollary' command; |
6824 |
||
11722 | 6825 |
* Pure: fixed 'token_translation' command; |
6826 |
||
11899 | 6827 |
* Pure: removed obsolete 'exported' attribute; |
6828 |
||
11933 | 6829 |
* Pure: dummy pattern "_" in is/let is now automatically lifted over |
6830 |
bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x") |
|
11899 | 6831 |
supersedes more cumbersome ... (is "ALL x. _ x --> ?C x"); |
6832 |
||
11952
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
6833 |
* Pure: method 'atomize' presents local goal premises as object-level |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
6834 |
statements (atomic meta-level propositions); setup controlled via |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
6835 |
rewrite rules declarations of 'atomize' attribute; example |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
6836 |
application: 'induct' method with proper rule statements in improper |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
6837 |
proof *scripts*; |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
6838 |
|
12106
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
6839 |
* Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.) |
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
6840 |
now consider the syntactic context of assumptions, giving a better |
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
6841 |
chance to get type-inference of the arguments right (this is |
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
6842 |
especially important for locales); |
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
6843 |
|
12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
6844 |
* Pure: "sorry" no longer requires quick_and_dirty in interactive |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
6845 |
mode; |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
6846 |
|
12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
6847 |
* Pure/obtain: the formal conclusion "thesis", being marked as |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
6848 |
``internal'', may no longer be reference directly in the text; |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
6849 |
potential INCOMPATIBILITY, may need to use "?thesis" in rare |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
6850 |
situations; |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
6851 |
|
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
6852 |
* Pure: generic 'sym' attribute which declares a rule both as pure |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
6853 |
'elim?' and for the 'symmetric' operation; |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
6854 |
|
12877
b9635eb8a448
* Isar/Pure: marginal comments ``--'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset
|
6855 |
* Pure: marginal comments ``--'' may now occur just anywhere in the |
b9635eb8a448
* Isar/Pure: marginal comments ``--'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset
|
6856 |
text; the fixed correlation with particular command syntax has been |
b9635eb8a448
* Isar/Pure: marginal comments ``--'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset
|
6857 |
discontinued; |
b9635eb8a448
* Isar/Pure: marginal comments ``--'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset
|
6858 |
|
13023
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
6859 |
* Pure: new method 'rules' is particularly well-suited for proof |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
6860 |
search in intuitionistic logic; a bit slower than 'blast' or 'fast', |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
6861 |
but often produces more compact proof terms with less detours; |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
6862 |
|
12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
6863 |
* Pure/Provers/classical: simplified integration with pure rule |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
6864 |
attributes and methods; the classical "intro?/elim?/dest?" |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
6865 |
declarations coincide with the pure ones; the "rule" method no longer |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
6866 |
includes classically swapped intros; "intro" and "elim" methods no |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
6867 |
longer pick rules from the context; also got rid of ML declarations |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
6868 |
AddXIs/AddXEs/AddXDs; all of this has some potential for |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
6869 |
INCOMPATIBILITY; |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
6870 |
|
12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
6871 |
* Provers/classical: attribute 'swapped' produces classical inversions |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
6872 |
of introduction rules; |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
6873 |
|
12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
6874 |
* Provers/simplifier: 'simplified' attribute may refer to explicit |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
6875 |
rules instead of full simplifier context; 'iff' attribute handles |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
6876 |
conditional rules; |
11936
fef099613354
* Provers: 'simplified' attribute may refer to explicit rules instead
wenzelm
parents:
11933
diff
changeset
|
6877 |
|
11745
06cd8c3b5487
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm
parents:
11738
diff
changeset
|
6878 |
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms; |
06cd8c3b5487
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm
parents:
11738
diff
changeset
|
6879 |
|
11690 | 6880 |
* HOL: 'recdef' now fails on unfinished automated proofs, use |
11633 | 6881 |
"(permissive)" option to recover old behavior; |
6882 |
||
11933 | 6883 |
* HOL: 'inductive' no longer features separate (collective) attributes |
6884 |
for 'intros' (was found too confusing); |
|
6885 |
||
12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
6886 |
* HOL: properly declared induction rules less_induct and |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
6887 |
wf_induct_rule; |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
6888 |
|
11788
60054fee3c16
canonical 'cases'/'induct' rules for n-tuples (n=3..7)
kleing
parents:
11745
diff
changeset
|
6889 |
|
11474 | 6890 |
*** HOL *** |
6891 |
||
11702 | 6892 |
* HOL: moved over to sane numeral syntax; the new policy is as |
6893 |
follows: |
|
6894 |
||
6895 |
- 0 and 1 are polymorphic constants, which are defined on any |
|
6896 |
numeric type (nat, int, real etc.); |
|
6897 |
||
6898 |
- 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based |
|
6899 |
binary representation internally; |
|
6900 |
||
6901 |
- type nat has special constructor Suc, and generally prefers Suc 0 |
|
6902 |
over 1::nat and Suc (Suc 0) over 2::nat; |
|
6903 |
||
12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
6904 |
This change may cause significant problems of INCOMPATIBILITY; here |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
6905 |
are some hints on converting existing sources: |
11702 | 6906 |
|
6907 |
- due to the new "num" token, "-0" and "-1" etc. are now atomic |
|
6908 |
entities, so expressions involving "-" (unary or binary minus) need |
|
6909 |
to be spaced properly; |
|
6910 |
||
6911 |
- existing occurrences of "1" may need to be constraint "1::nat" or |
|
6912 |
even replaced by Suc 0; similar for old "2"; |
|
6913 |
||
6914 |
- replace "#nnn" by "nnn", and "#-nnn" by "-nnn"; |
|
6915 |
||
6916 |
- remove all special provisions on numerals in proofs; |
|
6917 |
||
13042 | 6918 |
* HOL: simp rules nat_number expand numerals on nat to Suc/0 |
12837 | 6919 |
representation (depends on bin_arith_simps in the default context); |
6920 |
||
12736 | 6921 |
* HOL: symbolic syntax for x^2 (numeral 2); |
6922 |
||
12335
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
6923 |
* HOL: the class of all HOL types is now called "type" rather than |
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
6924 |
"term"; INCOMPATIBILITY, need to adapt references to this type class |
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
6925 |
in axclass/classes, instance/arities, and (usually rare) occurrences |
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
6926 |
in typings (of consts etc.); internally the class is called |
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
6927 |
"HOL.type", ML programs should refer to HOLogic.typeS; |
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
6928 |
|
12280 | 6929 |
* HOL/record package improvements: |
6930 |
- new derived operations "fields" to build a partial record section, |
|
6931 |
"extend" to promote a fixed record to a record scheme, and |
|
6932 |
"truncate" for the reverse; cf. theorems "xxx.defs", which are *not* |
|
6933 |
declared as simp by default; |
|
12587
3f3d2ffb5df5
HOL/record: shared operations ("more", "fields", etc.) now need to be
wenzelm
parents:
12564
diff
changeset
|
6934 |
- shared operations ("more", "fields", etc.) now need to be always |
3f3d2ffb5df5
HOL/record: shared operations ("more", "fields", etc.) now need to be
wenzelm
parents:
12564
diff
changeset
|
6935 |
qualified) --- potential INCOMPATIBILITY; |
12280 | 6936 |
- removed "make_scheme" operations (use "make" with "extend") -- |
6937 |
INCOMPATIBILITY; |
|
11937 | 6938 |
- removed "more" class (simply use "term") -- INCOMPATIBILITY; |
12253 | 6939 |
- provides cases/induct rules for use with corresponding Isar |
6940 |
methods (for concrete records, record schemes, concrete more |
|
12280 | 6941 |
parts, and schematic more parts -- in that order); |
11930 | 6942 |
- internal definitions directly based on a light-weight abstract |
6943 |
theory of product types over typedef rather than datatype; |
|
6944 |
||
13023
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
6945 |
* HOL: generic code generator for generating executable ML code from |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
6946 |
specifications; specific support for HOL constructs such as inductive |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
6947 |
datatypes and sets, as well as recursive functions; can be invoked |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
6948 |
via 'generate_code' theory section; |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
6949 |
|
11933 | 6950 |
* HOL: canonical cases/induct rules for n-tuples (n = 3..7); |
6951 |
||
13824 | 6952 |
* HOL: consolidated and renamed several theories. In particular: |
14731 | 6953 |
Ord.thy has been absorbed into HOL.thy |
6954 |
String.thy has been absorbed into List.thy |
|
6955 |
||
11802
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset
|
6956 |
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A" |
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset
|
6957 |
(beware of argument permutation!); |
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset
|
6958 |
|
11657 | 6959 |
* HOL: linorder_less_split superseded by linorder_cases; |
6960 |
||
12917 | 6961 |
* HOL/List: "nodups" renamed to "distinct"; |
12889 | 6962 |
|
11633 | 6963 |
* HOL: added "The" definite description operator; move Hilbert's "Eps" |
13824 | 6964 |
to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES: |
6965 |
- Ex_def has changed, now need to use some_eq_ex |
|
11437 | 6966 |
|
11572 | 6967 |
* HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so |
6968 |
in this (rare) case use: |
|
6969 |
||
6970 |
delSWrapper "split_all_tac" |
|
6971 |
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) |
|
6972 |
||
6973 |
* HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS |
|
11474 | 6974 |
MAY FAIL; |
11361 | 6975 |
|
11572 | 6976 |
* HOL: introduced f^n = f o ... o f; warning: due to the limits of |
6977 |
Isabelle's type classes, ^ on functions and relations has too general |
|
6978 |
a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be |
|
6979 |
necessary to attach explicit type constraints; |
|
11307 | 6980 |
|
12917 | 6981 |
* HOL/Relation: the prefix name of the infix "O" has been changed from |
6982 |
"comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been |
|
6983 |
renamed accordingly (eg "compI" -> "rel_compI"). |
|
12489 | 6984 |
|
11487
95071c9e85a3
* HOL: syntax translations now work properly with numerals and records
wenzelm
parents:
11475
diff
changeset
|
6985 |
* HOL: syntax translations now work properly with numerals and records |
95071c9e85a3
* HOL: syntax translations now work properly with numerals and records
wenzelm
parents:
11475
diff
changeset
|
6986 |
expressions; |
11474 | 6987 |
|
12457
cbfc53e45476
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm
parents:
12405
diff
changeset
|
6988 |
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead |
cbfc53e45476
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm
parents:
12405
diff
changeset
|
6989 |
of "lam" -- INCOMPATIBILITY; |
11474 | 6990 |
|
11933 | 6991 |
* HOL: got rid of some global declarations (potential INCOMPATIBILITY |
6992 |
for ML tools): const "()" renamed "Product_Type.Unity", type "unit" |
|
6993 |
renamed "Product_Type.unit"; |
|
11611 | 6994 |
|
12564 | 6995 |
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl |
6996 |
||
12924 | 6997 |
* HOL: removed obsolete theorem "optionE" (use "option.exhaust", or |
6998 |
the "cases" method); |
|
6999 |
||
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
7000 |
* HOL/GroupTheory: group theory examples including Sylow's theorem (by |
15154 | 7001 |
Florian Kammller); |
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
7002 |
|
12608
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
7003 |
* HOL/IMP: updated and converted to new-style theory format; several |
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
7004 |
parts turned into readable document, with proper Isar proof texts and |
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
7005 |
some explanations (by Gerwin Klein); |
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
7006 |
|
12734 | 7007 |
* HOL-Real: added Complex_Numbers (by Gertrud Bauer); |
7008 |
||
12690 | 7009 |
* HOL-Hyperreal is now a logic image; |
7010 |
||
11611 | 7011 |
|
12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
7012 |
*** HOLCF *** |
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
7013 |
|
12622 | 7014 |
* Isar: consts/constdefs supports mixfix syntax for continuous |
7015 |
operations; |
|
7016 |
||
7017 |
* Isar: domain package adapted to new-style theory format, e.g. see |
|
7018 |
HOLCF/ex/Dnat.thy; |
|
7019 |
||
7020 |
* theory Lift: proper use of rep_datatype lift instead of ML hacks -- |
|
12280 | 7021 |
potential INCOMPATIBILITY; now use plain induct_tac instead of former |
7022 |
lift.induct_tac, always use UU instead of Undef; |
|
12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
7023 |
|
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
7024 |
* HOLCF/IMP: updated and converted to new-style theory; |
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
7025 |
|
12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
7026 |
|
11474 | 7027 |
*** ZF *** |
7028 |
||
12622 | 7029 |
* Isar: proper integration of logic-specific tools and packages, |
7030 |
including theory commands '(co)inductive', '(co)datatype', |
|
7031 |
'rep_datatype', 'inductive_cases', as well as methods 'ind_cases', |
|
7032 |
'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC'); |
|
7033 |
||
7034 |
* theory Main no longer includes AC; for the Axiom of Choice, base |
|
7035 |
your theory on Main_ZFC; |
|
7036 |
||
7037 |
* the integer library now covers quotients and remainders, with many |
|
7038 |
laws relating division to addition, multiplication, etc.; |
|
12563 | 7039 |
|
12280 | 7040 |
* ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a |
7041 |
typeless version of the formalism; |
|
7042 |
||
13025 | 7043 |
* ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory |
7044 |
format; |
|
12608
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
7045 |
|
12280 | 7046 |
* ZF/Induct: new directory for examples of inductive definitions, |
12608
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
7047 |
including theory Multiset for multiset orderings; converted to |
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
7048 |
new-style theory format; |
12177
b1c16d685a99
* ZF: new-style theory commands 'inductive', 'inductive_cases', and
wenzelm
parents:
12163
diff
changeset
|
7049 |
|
13025 | 7050 |
* ZF: many new theorems about lists, ordinals, etc.; |
12850 | 7051 |
|
11474 | 7052 |
|
7053 |
*** General *** |
|
7054 |
||
12280 | 7055 |
* Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference |
7056 |
variable proof controls level of detail: 0 = no proofs (only oracle |
|
7057 |
dependencies), 1 = lemma dependencies, 2 = compact proof terms; see |
|
7058 |
also ref manual for further ML interfaces; |
|
7059 |
||
7060 |
* Pure/axclass: removed obsolete ML interface |
|
7061 |
goal_subclass/goal_arity; |
|
7062 |
||
7063 |
* Pure/syntax: new token syntax "num" for plain numerals (without "#" |
|
7064 |
of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now |
|
7065 |
separate tokens, so expressions involving minus need to be spaced |
|
7066 |
properly; |
|
7067 |
||
12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
7068 |
* Pure/syntax: support non-oriented infixes, using keyword "infix" |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
7069 |
rather than "infixl" or "infixr"; |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
7070 |
|
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
7071 |
* Pure/syntax: concrete syntax for dummy type variables admits genuine |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
7072 |
sort constraint specifications in type inference; e.g. "x::_::foo" |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
7073 |
ensures that the type of "x" is of sort "foo" (but not necessarily a |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
7074 |
type variable); |
12280 | 7075 |
|
7076 |
* Pure/syntax: print modes "type_brackets" and "no_type_brackets" |
|
7077 |
control output of nested => (types); the default behavior is |
|
7078 |
"type_brackets"; |
|
7079 |
||
7080 |
* Pure/syntax: builtin parse translation for "_constify" turns valued |
|
11817 | 7081 |
tokens into AST constants; |
11474 | 7082 |
|
12280 | 7083 |
* Pure/syntax: prefer later declarations of translations and print |
7084 |
translation functions; potential INCOMPATIBILITY: need to reverse |
|
7085 |
multiple declarations for same syntax element constant; |
|
7086 |
||
12832
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset
|
7087 |
* Pure/show_hyps reset by default (in accordance to existing Isar |
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset
|
7088 |
practice); |
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset
|
7089 |
|
12280 | 7090 |
* Provers/classical: renamed addaltern to addafter, addSaltern to |
7091 |
addSafter; |
|
7092 |
||
7093 |
* Provers/clasimp: ``iff'' declarations now handle conditional rules |
|
7094 |
as well; |
|
12253 | 7095 |
|
12538 | 7096 |
* system: tested support for MacOS X; should be able to get Isabelle + |
7097 |
Proof General to work in a plain Terminal after installing Poly/ML |
|
7098 |
(e.g. from the Isabelle distribution area) and GNU bash alone |
|
7099 |
(e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol |
|
7100 |
support requires further installations, e.g. from |
|
7101 |
http://fink.sourceforge.net/); |
|
7102 |
||
12280 | 7103 |
* system: support Poly/ML 4.1.1 (able to manage larger heaps); |
11551 | 7104 |
|
12753
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset
|
7105 |
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead |
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset
|
7106 |
of 40 MB), cf. ML_OPTIONS; |
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset
|
7107 |
|
11633 | 7108 |
* system: Proof General keywords specification is now part of the |
7109 |
Isabelle distribution (see etc/isar-keywords.el); |
|
7110 |
||
12728 | 7111 |
* system: support for persistent Proof General sessions (refrain from |
7112 |
outdating all loaded theories on startup); user may create writable |
|
7113 |
logic images like this: ``isabelle -q HOL Test''; |
|
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
7114 |
|
11551 | 7115 |
* system: smart selection of Isabelle process versus Isabelle |
11572 | 7116 |
interface, accommodates case-insensitive file systems (e.g. HFS+); may |
7117 |
run both "isabelle" and "Isabelle" even if file names are badly |
|
7118 |
damaged (executable inspects the case of the first letter of its own |
|
7119 |
name); added separate "isabelle-process" and "isabelle-interface"; |
|
11551 | 7120 |
|
12472 | 7121 |
* system: refrain from any attempt at filtering input streams; no |
7122 |
longer support ``8bit'' encoding of old isabelle font, instead proper |
|
7123 |
iso-latin characters may now be used; the related isatools |
|
7124 |
"symbolinput" and "nonascii" have disappeared as well; |
|
7125 |
||
7126 |
* system: removed old "xterm" interface (the print modes "xterm" and |
|
7127 |
"xterm_color" are still available for direct use in a suitable |
|
7128 |
terminal); |
|
7129 |
||
11314 | 7130 |
|
11169
98c2f741e32b
made split_all_tac safe introducing safe_full_simp_tac, EXISTING PROOFS MAY FAIL
oheimb
parents:
11130
diff
changeset
|
7131 |
|
11062 | 7132 |
New in Isabelle99-2 (February 2001) |
7133 |
----------------------------------- |
|
7134 |
||
10224 | 7135 |
*** Overview of INCOMPATIBILITIES *** |
7136 |
||
11241 | 7137 |
* HOL: please note that theories in the Library and elsewhere often use the |
7138 |
new-style (Isar) format; to refer to their theorems in an ML script you must |
|
12622 | 7139 |
bind them to ML identifers by e.g. val thm_name = thm "thm_name"; |
11241 | 7140 |
|
11043
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset
|
7141 |
* HOL: inductive package no longer splits induction rule aggressively, |
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset
|
7142 |
but only as far as specified by the introductions given; the old |
11130 | 7143 |
format may be recovered via ML function complete_split_rule or attribute |
11043
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset
|
7144 |
'split_rule (complete)'; |
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset
|
7145 |
|
10998 | 7146 |
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, |
7147 |
gfp_Tarski to gfp_unfold; |
|
10224 | 7148 |
|
10288 | 7149 |
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; |
7150 |
||
10858 | 7151 |
* HOL: infix "dvd" now has priority 50 rather than 70 (because it is a |
7152 |
relation); infix "^^" has been renamed "``"; infix "``" has been |
|
7153 |
renamed "`"; "univalent" has been renamed "single_valued"; |
|
10793 | 7154 |
|
10998 | 7155 |
* HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse" |
7156 |
operation; |
|
7157 |
||
10868 | 7158 |
* HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>; |
10856 | 7159 |
|
10391 | 7160 |
* Isar: 'obtain' no longer declares "that" fact as simp/intro; |
7161 |
||
10401
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
7162 |
* Isar/HOL: method 'induct' now handles non-atomic goals; as a |
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
7163 |
consequence, it is no longer monotonic wrt. the local goal context |
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
7164 |
(which is now passed through the inductive cases); |
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
7165 |
|
10976
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset
|
7166 |
* Document preparation: renamed standard symbols \<ll> to \<lless> and |
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset
|
7167 |
\<gg> to \<ggreater>; |
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset
|
7168 |
|
10224 | 7169 |
|
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
7170 |
*** Document preparation *** |
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
7171 |
|
10858 | 7172 |
* \isabellestyle{NAME} selects version of Isabelle output (currently |
7173 |
available: are "it" for near math-mode best-style output, "sl" for |
|
7174 |
slanted text style, and "tt" for plain type-writer; if no |
|
7175 |
\isabellestyle command is given, output is according to slanted |
|
7176 |
type-writer); |
|
7177 |
||
10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset
|
7178 |
* support sub/super scripts (for single symbols only), input syntax is |
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset
|
7179 |
like this: "A\<^sup>*" or "A\<^sup>\<star>"; |
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset
|
7180 |
|
10858 | 7181 |
* some more standard symbols; see Appendix A of the system manual for |
11062 | 7182 |
the complete list of symbols defined in isabellesym.sty; |
10858 | 7183 |
|
10998 | 7184 |
* improved isabelle style files; more abstract symbol implementation |
7185 |
(should now use \isamath{...} and \isatext{...} in custom symbol |
|
7186 |
definitions); |
|
7187 |
||
10634 | 7188 |
* antiquotation @{goals} and @{subgoals} for output of *dynamic* goals |
7189 |
state; Note that presentation of goal states does not conform to |
|
7190 |
actual human-readable proof documents. Please do not include goal |
|
7191 |
states into document output unless you really know what you are doing! |
|
10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset
|
7192 |
|
11062 | 7193 |
* proper indentation of antiquoted output with proportional LaTeX |
7194 |
fonts; |
|
10862 | 7195 |
|
11050
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset
|
7196 |
* no_document ML operator temporarily disables LaTeX document |
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset
|
7197 |
generation; |
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset
|
7198 |
|
11062 | 7199 |
* isatool unsymbolize tunes sources for plain ASCII communication; |
7200 |
||
10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset
|
7201 |
|
10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset
|
7202 |
*** Isar *** |
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset
|
7203 |
|
10547 | 7204 |
* Pure: Isar now suffers initial goal statements to contain unbound |
7205 |
schematic variables (this does not conform to actual readable proof |
|
7206 |
documents, due to unpredictable outcome and non-compositional proof |
|
7207 |
checking); users who know what they are doing may use schematic goals |
|
7208 |
for Prolog-style synthesis of proven results; |
|
7209 |
||
10391 | 7210 |
* Pure: assumption method (an implicit finishing) now handles actual |
7211 |
rules as well; |
|
7212 |
||
7213 |
* Pure: improved 'obtain' --- moved to Pure, insert "that" into |
|
7214 |
initial goal, declare "that" only as Pure intro (only for single |
|
7215 |
steps); the "that" rule assumption may now be involved in implicit |
|
7216 |
finishing, thus ".." becomes a feasible for trivial obtains; |
|
7217 |
||
7218 |
* Pure: default proof step now includes 'intro_classes'; thus trivial |
|
7219 |
instance proofs may be performed by ".."; |
|
7220 |
||
7221 |
* Pure: ?thesis / ?this / "..." now work for pure meta-level |
|
7222 |
statements as well; |
|
10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset
|
7223 |
|
11097 | 7224 |
* Pure: more robust selection of calculational rules; |
7225 |
||
10858 | 7226 |
* Pure: the builtin notion of 'finished' goal now includes the ==-refl |
7227 |
rule (as well as the assumption rule); |
|
7228 |
||
7229 |
* Pure: 'thm_deps' command visualizes dependencies of theorems and |
|
7230 |
lemmas, using the graph browser tool; |
|
7231 |
||
10944 | 7232 |
* Pure: predict failure of "show" in interactive mode; |
7233 |
||
11016
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset
|
7234 |
* Pure: 'thms_containing' now takes actual terms as arguments; |
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset
|
7235 |
|
10401
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
7236 |
* HOL: improved method 'induct' --- now handles non-atomic goals |
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
7237 |
(potential INCOMPATIBILITY); tuned error handling; |
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
7238 |
|
10557 | 7239 |
* HOL: cases and induct rules now provide explicit hints about the |
10547 | 7240 |
number of facts to be consumed (0 for "type" and 1 for "set" rules); |
7241 |
any remaining facts are inserted into the goal verbatim; |
|
7242 |
||
10858 | 7243 |
* HOL: local contexts (aka cases) may now contain term bindings as |
7244 |
well; the 'cases' and 'induct' methods new provide a ?case binding for |
|
7245 |
the result to be shown in each case; |
|
7246 |
||
10770 | 7247 |
* HOL: added 'recdef_tc' command; |
7248 |
||
11016
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset
|
7249 |
* isatool convert assists in eliminating legacy ML scripts; |
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset
|
7250 |
|
10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset
|
7251 |
|
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
7252 |
*** HOL *** |
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
7253 |
|
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
7254 |
* HOL/Library: a collection of generic theories to be used together |
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
7255 |
with main HOL; the theory loader path already includes this directory |
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
7256 |
by default; the following existing theories have been moved here: |
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
7257 |
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While |
10337 | 7258 |
(as While_Combinator), HOL/Lex/Prefix (as List_Prefix); |
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
7259 |
|
10966 | 7260 |
* HOL/Unix: "Some aspects of Unix file-system security", a typical |
7261 |
modelling and verification task performed in Isabelle/HOL + |
|
7262 |
Isabelle/Isar + Isabelle document preparation (by Markus Wenzel). |
|
7263 |
||
11094 | 7264 |
* HOL/Algebra: special summation operator SUM no longer exists, it has |
7265 |
been replaced by setsum; infix 'assoc' now has priority 50 (like |
|
7266 |
'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to |
|
7267 |
'domain', this makes the theory consistent with mathematical |
|
7268 |
literature; |
|
7269 |
||
10514 | 7270 |
* HOL basics: added overloaded operations "inverse" and "divide" |
10726 | 7271 |
(infix "/"), syntax for generic "abs" operation, generic summation |
11094 | 7272 |
operator \<Sum>; |
10452
abeefb0a79ae
* added overloaded operations "inverse" and "divide" (infix "/");
wenzelm
parents:
10428
diff
changeset
|
7273 |
|
10391 | 7274 |
* HOL/typedef: simplified package, provide more useful rules (see also |
7275 |
HOL/subset.thy); |
|
7276 |
||
10915
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
7277 |
* HOL/datatype: induction rule for arbitrarily branching datatypes is |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
7278 |
now expressed as a proper nested rule (old-style tactic scripts may |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
7279 |
require atomize_strip_tac to cope with non-atomic premises); |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
7280 |
|
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
7281 |
* HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
7282 |
to "split_conv" (old name still available for compatibility); |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
7283 |
|
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
7284 |
* HOL: improved concrete syntax for strings (e.g. allows translation |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
7285 |
rules with string literals); |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
7286 |
|
12245 | 7287 |
* HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals |
7288 |
and Fleuriot's mechanization of analysis, including the transcendental |
|
7289 |
functions for the reals; |
|
10756 | 7290 |
|
11094 | 7291 |
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; |
10391 | 7292 |
|
10858 | 7293 |
|
10474 | 7294 |
*** CTT *** |
7295 |
||
10547 | 7296 |
* CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that |
7297 |
"lam" is displayed as TWO lambda-symbols |
|
10474 | 7298 |
|
10547 | 7299 |
* CTT: theory Main now available, containing everything (that is, Bool |
7300 |
and Arith); |
|
7301 |
||
10474 | 7302 |
|
10391 | 7303 |
*** General *** |
7304 |
||
10547 | 7305 |
* Pure: the Simplifier has been implemented properly as a derived rule |
7306 |
outside of the actual kernel (at last!); the overall performance |
|
7307 |
penalty in practical applications is about 50%, while reliability of |
|
7308 |
the Isabelle inference kernel has been greatly improved; |
|
7309 |
||
11112 | 7310 |
* print modes "brackets" and "no_brackets" control output of nested => |
7311 |
(types) and ==> (props); the default behaviour is "brackets"; |
|
7312 |
||
10391 | 7313 |
* Provers: fast_tac (and friends) now handle actual object-logic rules |
7314 |
as assumptions as well; |
|
7315 |
||
11124 | 7316 |
* system: support Poly/ML 4.0; |
7317 |
||
7318 |
* system: isatool install handles KDE version 1 or 2; |
|
7319 |
||
10391 | 7320 |
|
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
7321 |
|
10103 | 7322 |
New in Isabelle99-1 (October 2000) |
7323 |
---------------------------------- |
|
8015 | 7324 |
|
10003 | 7325 |
*** Overview of INCOMPATIBILITIES *** |
8014 | 7326 |
|
8848 | 7327 |
* HOL: simplification of natural numbers is much changed; to partly |
7328 |
recover the old behaviour (e.g. to prevent n+n rewriting to #2*n) |
|
7329 |
issue the following ML commands: |
|
7330 |
||
7331 |
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; |
|
7332 |
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; |
|
8788 | 7333 |
|
10129 | 7334 |
* HOL: simplification no longer dives into case-expressions; this is |
7335 |
controlled by "t.weak_case_cong" for each datatype t; |
|
10003 | 7336 |
|
7337 |
* HOL: nat_less_induct renamed to less_induct; |
|
7338 |
||
7339 |
* HOL: systematic renaming of the SOME (Eps) rules, may use isatool |
|
7340 |
fixsome to patch .thy and .ML sources automatically; |
|
8967 | 7341 |
|
10003 | 7342 |
select_equality -> some_equality |
7343 |
select_eq_Ex -> some_eq_ex |
|
7344 |
selectI2EX -> someI2_ex |
|
7345 |
selectI2 -> someI2 |
|
7346 |
selectI -> someI |
|
7347 |
select1_equality -> some1_equality |
|
7348 |
Eps_sym_eq -> some_sym_eq_trivial |
|
7349 |
Eps_eq -> some_eq_trivial |
|
7350 |
||
36856
b343091e81d8
reverted parts of 7902dc7ea11d -- note that NEWS of published Isabelle releases are essentially read-only;
wenzelm
parents:
36849
diff
changeset
|
7351 |
* HOL: exhaust_tac on datatypes superceded by new generic case_tac; |
10003 | 7352 |
|
7353 |
* HOL: removed obsolete theorem binding expand_if (refer to split_if |
|
7354 |
instead); |
|
7355 |
||
7356 |
* HOL: the recursion equations generated by 'recdef' are now called |
|
7357 |
f.simps instead of f.rules; |
|
7358 |
||
7359 |
* HOL: qed_spec_mp now also handles bounded ALL as well; |
|
7360 |
||
7361 |
* HOL: 0 is now overloaded, so the type constraint ":: nat" may |
|
7362 |
sometimes be needed; |
|
7363 |
||
7364 |
* HOL: the constant for "f``x" is now "image" rather than "op ``"; |
|
8014 | 7365 |
|
10065 | 7366 |
* HOL: the constant for "f-``x" is now "vimage" rather than "op -``"; |
7367 |
||
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
7368 |
* HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
7369 |
product is now "<*>" instead of "Times"; the lexicographic product is |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
7370 |
now "<*lex*>" instead of "**"; |
8705 | 7371 |
|
10003 | 7372 |
* HOL: theory Sexp is now in HOL/Induct examples (it used to be part |
7373 |
of main HOL, but was unused); better use HOL's datatype package; |
|
9971 | 7374 |
|
10137
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
7375 |
* HOL: removed "symbols" syntax for constant "override" of theory Map; |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
7376 |
the old syntax may be recovered as follows: |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
7377 |
|
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
7378 |
syntax (symbols) |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
7379 |
override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)" |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
7380 |
(infixl "\\<oplus>" 100) |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
7381 |
|
8848 | 7382 |
* HOL/Real: "rabs" replaced by overloaded "abs" function; |
7383 |
||
8887
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset
|
7384 |
* HOL/ML: even fewer consts are declared as global (see theories Ord, |
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset
|
7385 |
Lfp, Gfp, WF); this only affects ML packages that refer to const names |
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset
|
7386 |
internally; |
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset
|
7387 |
|
10003 | 7388 |
* HOL and ZF: syntax for quotienting wrt an equivalence relation |
7389 |
changed from A/r to A//r; |
|
9908 | 7390 |
|
10003 | 7391 |
* ZF: new treatment of arithmetic (nat & int) may break some old |
7392 |
proofs; |
|
8921
7c04c98132c4
* Pure: changed syntax of local blocks from {{ }} to { };
wenzelm
parents:
8887
diff
changeset
|
7393 |
|
10003 | 7394 |
* Isar: renamed some attributes (RS -> THEN, simplify -> simplified, |
7395 |
rulify -> rule_format, elimify -> elim_format, ...); |
|
9542 | 7396 |
|
9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
7397 |
* Isar/Provers: intro/elim/dest attributes changed; renamed |
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
7398 |
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one |
9937 | 7399 |
should have to change intro!! to intro? only); replaced "delrule" by |
7400 |
"rule del"; |
|
9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset
|
7401 |
|
9612 | 7402 |
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; |
7403 |
||
9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset
|
7404 |
* Provers: strengthened force_tac by using new first_best_tac; |
9402 | 7405 |
|
10003 | 7406 |
* LaTeX document preparation: several changes of isabelle.sty (see |
7407 |
lib/texinputs); |
|
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
7408 |
|
8014 | 7409 |
|
8487 | 7410 |
*** Document preparation *** |
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
7411 |
|
9198
0ab3c81e9425
* formal comments (text blocks etc.) in new-style theories may now
wenzelm
parents:
9185
diff
changeset
|
7412 |
* formal comments (text blocks etc.) in new-style theories may now |
9753 | 7413 |
contain antiquotations of thm/prop/term/typ/text to be presented |
7414 |
according to latex print mode; concrete syntax is like this: |
|
7415 |
@{term[show_types] "f(x) = a + x"}; |
|
9198
0ab3c81e9425
* formal comments (text blocks etc.) in new-style theories may now
wenzelm
parents:
9185
diff
changeset
|
7416 |
|
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
7417 |
* isatool mkdir provides easy setup of Isabelle session directories, |
8518 | 7418 |
including proper document sources; |
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
7419 |
|
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
7420 |
* generated LaTeX sources are now deleted after successful run |
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
7421 |
(isatool document -c); may retain a copy somewhere else via -D option |
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
7422 |
of isatool usedir; |
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
7423 |
|
8566 | 7424 |
* isatool usedir -D now lets isatool latex -o sty update the Isabelle |
10003 | 7425 |
style files, achieving self-contained LaTeX sources and simplifying |
7426 |
LaTeX debugging; |
|
8566 | 7427 |
|
8518 | 7428 |
* old-style theories now produce (crude) LaTeX output as well; |
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
7429 |
|
9057
af1ca1acf292
* browser info session directories are now self-contained (may be put
wenzelm
parents:
9052
diff
changeset
|
7430 |
* browser info session directories are now self-contained (may be put |
9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset
|
7431 |
on WWW server seperately); improved graphs of nested sessions; removed |
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset
|
7432 |
graph for 'all sessions'; |
9057
af1ca1acf292
* browser info session directories are now self-contained (may be put
wenzelm
parents:
9052
diff
changeset
|
7433 |
|
10003 | 7434 |
* several improvements in isabelle style files; \isabellestyle{it} |
7435 |
produces fake math mode output; \isamarkupheader is now \section by |
|
7436 |
default; see lib/texinputs/isabelle.sty etc.; |
|
9489
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
7437 |
|
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
7438 |
|
8184 | 7439 |
*** Isar *** |
7440 |
||
10003 | 7441 |
* Isar/Pure: local results and corresponding term bindings are now |
7442 |
subject to Hindley-Milner polymorphism (similar to ML); this |
|
7443 |
accommodates incremental type-inference very nicely; |
|
8283
0a319c5746eb
* Pure now provides its own version of intro/elim/dest attributes;
wenzelm
parents:
8271
diff
changeset
|
7444 |
|
10003 | 7445 |
* Isar/Pure: new derived language element 'obtain' supports |
7446 |
generalized existence reasoning; |
|
8621
8ba0f90f6f35
* Isar/Pure: local results and corresponding term bindings are now
wenzelm
parents:
8603
diff
changeset
|
7447 |
|
10003 | 7448 |
* Isar/Pure: new calculational elements 'moreover' and 'ultimately' |
7449 |
support accumulation of results, without applying any rules yet; |
|
7450 |
useful to collect intermediate results without explicit name |
|
7451 |
references, and for use with transitivity rules with more than 2 |
|
7452 |
premises; |
|
8184 | 7453 |
|
10003 | 7454 |
* Isar/Pure: scalable support for case-analysis type proofs: new |
7455 |
'case' language element refers to local contexts symbolically, as |
|
7456 |
produced by certain proof methods; internally, case names are attached |
|
7457 |
to theorems as "tags"; |
|
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
7458 |
|
10003 | 7459 |
* Isar/Pure: theory command 'hide' removes declarations from |
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
7460 |
class/type/const name spaces; |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
7461 |
|
10003 | 7462 |
* Isar/Pure: theory command 'defs' supports option "(overloaded)" to |
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
7463 |
indicate potential overloading; |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
7464 |
|
10003 | 7465 |
* Isar/Pure: changed syntax of local blocks from {{ }} to { }; |
8621
8ba0f90f6f35
* Isar/Pure: local results and corresponding term bindings are now
wenzelm
parents:
8603
diff
changeset
|
7466 |
|
10003 | 7467 |
* Isar/Pure: syntax of sorts made 'inner', i.e. have to write |
7468 |
"{a,b,c}" instead of {a,b,c}; |
|
9011
0cfc347f8d19
Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms to
wenzelm
parents:
8994
diff
changeset
|
7469 |
|
10003 | 7470 |
* Isar/Pure now provides its own version of intro/elim/dest |
7471 |
attributes; useful for building new logics, but beware of confusion |
|
7472 |
with the version in Provers/classical; |
|
9612 | 7473 |
|
10003 | 7474 |
* Isar/Pure: the local context of (non-atomic) goals is provided via |
7475 |
case name 'antecedent'; |
|
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
7476 |
|
10003 | 7477 |
* Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms |
7478 |
to the current context is now done automatically); |
|
9383
c21fa1c48de0
* HOL: removed obsolete expand_if = split_if; theorems if_splits =
wenzelm
parents:
9349
diff
changeset
|
7479 |
|
10003 | 7480 |
* Isar/Pure: theory command 'method_setup' provides a simple interface |
7481 |
for definining proof methods in ML; |
|
9612 | 7482 |
|
10003 | 7483 |
* Isar/Provers: intro/elim/dest attributes changed; renamed |
9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
7484 |
intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in |
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
7485 |
most cases, one should have to change intro!! to intro? only); |
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
7486 |
replaced "delrule" by "rule del"; |
8283
0a319c5746eb
* Pure now provides its own version of intro/elim/dest attributes;
wenzelm
parents:
8271
diff
changeset
|
7487 |
|
10003 | 7488 |
* Isar/Provers: new 'hypsubst' method, plain 'subst' method and |
36856
b343091e81d8
reverted parts of 7902dc7ea11d -- note that NEWS of published Isabelle releases are essentially read-only;
wenzelm
parents:
36849
diff
changeset
|
7489 |
'symmetric' attribute (the latter supercedes [RS sym]); |
10003 | 7490 |
|
7491 |
* Isar/Provers: splitter support (via 'split' attribute and 'simp' |
|
7492 |
method modifier); 'simp' method: 'only:' modifier removes loopers as |
|
7493 |
well (including splits); |
|
7494 |
||
7495 |
* Isar/Provers: Simplifier and Classical methods now support all kind |
|
7496 |
of modifiers used in the past, including 'cong', 'iff', etc. |
|
7497 |
||
7498 |
* Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination |
|
7499 |
of Simplifier and Classical reasoner); |
|
7500 |
||
7501 |
* Isar/HOL: new proof method 'cases' and improved version of 'induct' |
|
7502 |
now support named cases; major packages (inductive, datatype, primrec, |
|
7503 |
recdef) support case names and properly name parameters; |
|
9612 | 7504 |
|
10003 | 7505 |
* Isar/HOL: new transitivity rules for substitution in inequalities -- |
7506 |
monotonicity conditions are extracted to be proven at end of |
|
7507 |
calculations; |
|
7508 |
||
7509 |
* Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof |
|
7510 |
method anyway; |
|
7511 |
||
7512 |
* Isar/HOL: removed old expand_if = split_if; theorems if_splits = |
|
7513 |
split_if split_if_asm; datatype package provides theorems foo.splits = |
|
7514 |
foo.split foo.split_asm for each datatype; |
|
7515 |
||
7516 |
* Isar/HOL: tuned inductive package, rename "intrs" to "intros" |
|
7517 |
(potential INCOMPATIBILITY), emulation of mk_cases feature for proof |
|
7518 |
scripts: new 'inductive_cases' command and 'ind_cases' method; (Note: |
|
7519 |
use "(cases (simplified))" method in proper proof texts); |
|
7520 |
||
7521 |
* Isar/HOL: added global 'arith_split' attribute for 'arith' method; |
|
7522 |
||
7523 |
* Isar: names of theorems etc. may be natural numbers as well; |
|
7524 |
||
7525 |
* Isar: 'pr' command: optional arguments for goals_limit and |
|
9724
2030c5d63741
* 'pr' command: optional argument for ProofContext.prems_limit;
wenzelm
parents:
9709
diff
changeset
|
7526 |
ProofContext.prems_limit; no longer prints theory contexts, but only |
2030c5d63741
* 'pr' command: optional argument for ProofContext.prems_limit;
wenzelm
parents:
9709
diff
changeset
|
7527 |
proof states; |
8487 | 7528 |
|
10003 | 7529 |
* Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit |
8518 | 7530 |
additional print modes to be specified; e.g. "pr(latex)" will print |
7531 |
proof state according to the Isabelle LaTeX style; |
|
8487 | 7532 |
|
10003 | 7533 |
* Isar: improved support for emulating tactic scripts, including proof |
9612 | 7534 |
methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac', |
7535 |
'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac' |
|
7536 |
(for HOL datatypes); |
|
8534 | 7537 |
|
10003 | 7538 |
* Isar: simplified (more robust) goal selection of proof methods: 1st |
7539 |
goal, all goals, or explicit goal specifier (tactic emulation); thus |
|
7540 |
'proof method scripts' have to be in depth-first order; |
|
8673
987ea1a559d0
Isar: simplified (more robust) goal selection of proof methods;
wenzelm
parents:
8655
diff
changeset
|
7541 |
|
10003 | 7542 |
* Isar: tuned 'let' syntax: replaced 'as' keyword by 'and'; |
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
7543 |
|
10003 | 7544 |
* Isar: removed 'help' command, which hasn't been too helpful anyway; |
7545 |
should instead use individual commands for printing items |
|
7546 |
(print_commands, print_methods etc.); |
|
9224
0da360494917
* Isar: removed 'help' command, which hasn't been too helpful anyway;
wenzelm
parents:
9198
diff
changeset
|
7547 |
|
10003 | 7548 |
* Isar: added 'nothing' --- the empty list of theorems; |
9239 | 7549 |
|
8184 | 7550 |
|
8014 | 7551 |
*** HOL *** |
7552 |
||
10080 | 7553 |
* HOL/MicroJava: formalization of a fragment of Java, together with a |
7554 |
corresponding virtual machine and a specification of its bytecode |
|
7555 |
verifier and a lightweight bytecode verifier, including proofs of |
|
7556 |
type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and |
|
7557 |
Cornelia Pusch (see also the homepage of project Bali at |
|
7558 |
http://isabelle.in.tum.de/Bali/); |
|
7559 |
||
8518 | 7560 |
* HOL/Algebra: new theory of rings and univariate polynomials, by |
7561 |
Clemens Ballarin; |
|
8014 | 7562 |
|
10157
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
7563 |
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese |
10003 | 7564 |
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M |
7565 |
Rasmussen; |
|
8570 | 7566 |
|
10157
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
7567 |
* HOL/Lattice: fundamental concepts of lattice theory and order |
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
7568 |
structures, including duals, properties of bounds versus algebraic |
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
7569 |
laws, lattice operations versus set-theoretic ones, the Knaster-Tarski |
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
7570 |
Theorem for complete lattices etc.; may also serve as a demonstration |
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
7571 |
for abstract algebraic reasoning using axiomatic type classes, and |
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
7572 |
mathematics-style proof in Isabelle/Isar; by Markus Wenzel; |
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
7573 |
|
10003 | 7574 |
* HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David |
7575 |
von Oheimb; |
|
9542 | 7576 |
|
10164
c240747082aa
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm
parents:
10157
diff
changeset
|
7577 |
* HOL/IMPP: extension of IMP with local variables and mutually |
c240747082aa
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm
parents:
10157
diff
changeset
|
7578 |
recursive procedures, by David von Oheimb; |
c240747082aa
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm
parents:
10157
diff
changeset
|
7579 |
|
10003 | 7580 |
* HOL/Lambda: converted into new-style theory and document; |
9542 | 7581 |
|
10003 | 7582 |
* HOL/ex/Multiquote: example of multiple nested quotations and |
7583 |
anti-quotations -- basically a generalized version of de-Bruijn |
|
7584 |
representation; very useful in avoiding lifting of operations; |
|
8848 | 7585 |
|
9612 | 7586 |
* HOL/record: added general record equality rule to simpset; fixed |
7587 |
select-update simplification procedure to handle extended records as |
|
7588 |
well; admit "r" as field name; |
|
9542 | 7589 |
|
8967 | 7590 |
* HOL: 0 is now overloaded over the new sort "zero", allowing its use with |
7591 |
other numeric types and also as the identity of groups, rings, etc.; |
|
7592 |
||
7593 |
* HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity. |
|
7594 |
Types nat and int belong to this axclass; |
|
7595 |
||
10003 | 7596 |
* HOL: greatly improved simplification involving numerals of type nat, int, real: |
8788 | 7597 |
(i + #8 + j) = Suc k simplifies to #7 + (i + j) = k |
8832 | 7598 |
i*j + k + j*#3*i simplifies to #4*(i*j) + k |
7599 |
two terms #m*u and #n*u are replaced by #(m+n)*u |
|
7600 |
(where #m, #n and u can implicitly be 1; this is simproc combine_numerals) |
|
7601 |
and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y |
|
7602 |
or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals); |
|
8736 | 7603 |
|
10003 | 7604 |
* HOL: meson_tac is available (previously in ex/meson.ML); it is a |
7605 |
powerful prover for predicate logic but knows nothing of clasets; see |
|
7606 |
ex/mesontest.ML and ex/mesontest2.ML for example applications; |
|
9835 | 7607 |
|
8848 | 7608 |
* HOL: new version of "case_tac" subsumes both boolean case split and |
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
7609 |
"exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer |
8518 | 7610 |
exists, may define val exhaust_tac = case_tac for ad-hoc portability; |
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
7611 |
|
8848 | 7612 |
* HOL: simplification no longer dives into case-expressions: only the |
10129 | 7613 |
selector expression is simplified, but not the remaining arms; to |
7614 |
enable full simplification of case-expressions for datatype t, you may |
|
7615 |
remove t.weak_case_cong from the simpset, either globally (Delcongs |
|
7616 |
[thm"t.weak_case_cong"];) or locally (delcongs [...]). |
|
8603 | 7617 |
|
8848 | 7618 |
* HOL/recdef: the recursion equations generated by 'recdef' for |
7619 |
function 'f' are now called f.simps instead of f.rules; if all |
|
7620 |
termination conditions are proved automatically, these simplification |
|
7621 |
rules are added to the simpset, as in primrec; rules may be named |
|
7622 |
individually as well, resulting in a separate list of theorems for |
|
7623 |
each equation; |
|
7624 |
||
9489
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
7625 |
* HOL/While is a new theory that provides a while-combinator. It |
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
7626 |
permits the definition of tail-recursive functions without the |
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
7627 |
provision of a termination measure. The latter is necessary once the |
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
7628 |
invariant proof rule for while is applied. |
9457 | 7629 |
|
10003 | 7630 |
* HOL: new (overloaded) notation for the set of elements below/above |
7631 |
some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval. |
|
8925 | 7632 |
|
8848 | 7633 |
* HOL: theorems impI, allI, ballI bound as "strip"; |
7634 |
||
10003 | 7635 |
* HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic |
9746 | 7636 |
induct_tac th "x1 ... xn" expects th to have a conclusion of the form |
7637 |
P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th; |
|
7638 |
||
10003 | 7639 |
* HOL/Real: "rabs" replaced by overloaded "abs" function; |
9737 | 7640 |
|
10003 | 7641 |
* HOL: theory Sexp now in HOL/Induct examples (it used to be part of |
7642 |
main HOL, but was unused); |
|
8626 | 7643 |
|
10003 | 7644 |
* HOL: fewer consts declared as global (e.g. have to refer to |
7645 |
"Lfp.lfp" instead of "lfp" internally; affects ML packages only); |
|
8887
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset
|
7646 |
|
10003 | 7647 |
* HOL: tuned AST representation of nested pairs, avoiding bogus output |
7648 |
in case of overlap with user translations (e.g. judgements over |
|
7649 |
tuples); (note that the underlying logical represenation is still |
|
7650 |
bogus); |
|
9349
d43669fb423d
* tuned AST representation of nested pairs, avoiding bogus output in
wenzelm
parents:
9335
diff
changeset
|
7651 |
|
8412 | 7652 |
|
9542 | 7653 |
*** ZF *** |
7654 |
||
10003 | 7655 |
* ZF: simplification automatically cancels common terms in arithmetic |
7656 |
expressions over nat and int; |
|
9542 | 7657 |
|
10003 | 7658 |
* ZF: new treatment of nat to minimize type-checking: all operators |
7659 |
coerce their operands to a natural number using the function natify, |
|
7660 |
making the algebraic laws unconditional; |
|
9542 | 7661 |
|
10003 | 7662 |
* ZF: as above, for int: operators coerce their operands to an integer |
7663 |
using the function intify; |
|
9542 | 7664 |
|
10003 | 7665 |
* ZF: the integer library now contains many of the usual laws for the |
7666 |
orderings, including $<=, and monotonicity laws for $+ and $*; |
|
9542 | 7667 |
|
10003 | 7668 |
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic |
7669 |
simplification; |
|
9388 | 7670 |
|
10003 | 7671 |
* FOL and ZF: AddIffs now available, giving theorems of the form P<->Q |
7672 |
to the simplifier and classical reasoner simultaneously; |
|
9388 | 7673 |
|
7674 |
||
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
7675 |
*** General *** |
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
7676 |
|
10003 | 7677 |
* Provers: blast_tac now handles actual object-logic rules as |
7678 |
assumptions; note that auto_tac uses blast_tac internally as well; |
|
7679 |
||
7680 |
* Provers: new functions rulify/rulify_no_asm: thm -> thm for turning |
|
7681 |
outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm; |
|
7682 |
||
9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
7683 |
* Provers: delrules now handles destruct rules as well (no longer need |
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
7684 |
explicit make_elim); |
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
7685 |
|
10003 | 7686 |
* Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g. |
7687 |
[| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W |
|
7688 |
use instead the strong form, |
|
7689 |
[| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W |
|
7690 |
in HOL, FOL and ZF the function cla_make_elim will create such rules |
|
7691 |
from destruct-rules; |
|
9489
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
7692 |
|
9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
7693 |
* Provers: Simplifier.easy_setup provides a fast path to basic |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
7694 |
Simplifier setup for new object-logics; |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
7695 |
|
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
7696 |
* Pure: AST translation rules no longer require constant head on LHS; |
9349
d43669fb423d
* tuned AST representation of nested pairs, avoiding bogus output in
wenzelm
parents:
9335
diff
changeset
|
7697 |
|
9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
7698 |
* Pure: improved name spaces: ambiguous output is qualified; support |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
7699 |
for hiding of names; |
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
7700 |
|
10003 | 7701 |
* system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and |
7702 |
XSYMBOL_HOME; no longer need to do manual configuration in most |
|
7703 |
situations; |
|
7704 |
||
9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
7705 |
* system: compression of ML heaps images may now be controlled via -c |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
7706 |
option of isabelle and isatool usedir (currently only observed by |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
7707 |
Poly/ML); |
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
7708 |
|
9981
01a0c4772c18
system: isatool installfonts may handle X-Symbol fonts as well;
wenzelm
parents:
9971
diff
changeset
|
7709 |
* system: isatool installfonts may handle X-Symbol fonts as well (very |
01a0c4772c18
system: isatool installfonts may handle X-Symbol fonts as well;
wenzelm
parents:
9971
diff
changeset
|
7710 |
useful for remote X11); |
01a0c4772c18
system: isatool installfonts may handle X-Symbol fonts as well;
wenzelm
parents:
9971
diff
changeset
|
7711 |
|
9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
7712 |
* system: provide TAGS file for Isabelle sources; |
9052 | 7713 |
|
9288
06a55195741b
infix 'OF' is a version of 'MRS' with more appropriate argument order;
wenzelm
parents:
9239
diff
changeset
|
7714 |
* ML: infix 'OF' is a version of 'MRS' with more appropriate argument |
06a55195741b
infix 'OF' is a version of 'MRS' with more appropriate argument order;
wenzelm
parents:
9239
diff
changeset
|
7715 |
order; |
06a55195741b
infix 'OF' is a version of 'MRS' with more appropriate argument order;
wenzelm
parents:
9239
diff
changeset
|
7716 |
|
8994
803533fbb3ec
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
wenzelm
parents:
8991
diff
changeset
|
7717 |
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global |
803533fbb3ec
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
wenzelm
parents:
8991
diff
changeset
|
7718 |
timing flag supersedes proof_timing and Toplevel.trace; |
803533fbb3ec
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
wenzelm
parents:
8991
diff
changeset
|
7719 |
|
10003 | 7720 |
* ML: new combinators |>> and |>>> for incremental transformations |
7721 |
with secondary results (e.g. certain theory extensions): |
|
7722 |
||
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
7723 |
* ML: PureThy.add_defs gets additional argument to indicate potential |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
7724 |
overloading (usually false); |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
7725 |
|
10003 | 7726 |
* ML: PureThy.add_thms/add_axioms/add_defs now return theorems as |
7727 |
results; |
|
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
7728 |
|
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
7729 |
|
8015 | 7730 |
|
7986 | 7731 |
New in Isabelle99 (October 1999) |
7732 |
-------------------------------- |
|
4649 | 7733 |
|
5931 | 7734 |
*** Overview of INCOMPATIBILITIES (see below for more details) *** |
7735 |
||
6922 | 7736 |
* HOL: The THEN and ELSE parts of conditional expressions (if P then x else y) |
7737 |
are no longer simplified. (This allows the simplifier to unfold recursive |
|
7738 |
functional programs.) To restore the old behaviour, declare |
|
7215 | 7739 |
|
7740 |
Delcongs [if_weak_cong]; |
|
6922 | 7741 |
|
6269 | 7742 |
* HOL: Removed the obsolete syntax "Compl A"; use -A for set |
7743 |
complement; |
|
5931 | 7744 |
|
6269 | 7745 |
* HOL: the predicate "inj" is now defined by translation to "inj_on"; |
6174 | 7746 |
|
7847 | 7747 |
* HOL/datatype: mutual_induct_tac no longer exists -- |
7748 |
use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"] |
|
7749 |
||
6386
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
7750 |
* HOL/typedef: fixed type inference for representing set; type |
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
7751 |
arguments now have to occur explicitly on the rhs as type constraints; |
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
7752 |
|
6269 | 7753 |
* ZF: The con_defs part of an inductive definition may no longer refer |
7754 |
to constants declared in the same theory; |
|
6057 | 7755 |
|
6269 | 7756 |
* HOL, ZF: the function mk_cases, generated by the inductive |
7757 |
definition package, has lost an argument. To simplify its result, it |
|
7758 |
uses the default simpset instead of a supplied list of theorems. |
|
6141 | 7759 |
|
7215 | 7760 |
* HOL/List: the constructors of type list are now Nil and Cons; |
7761 |
||
7619 | 7762 |
* Simplifier: the type of the infix ML functions |
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
7763 |
setSSolver addSSolver setSolver addSolver |
7619 | 7764 |
is now simpset * solver -> simpset where `solver' is a new abstract type |
7765 |
for packaging solvers. A solver is created via |
|
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
7766 |
mk_solver: string -> (thm list -> int -> tactic) -> solver |
7619 | 7767 |
where the string argument is only a comment. |
6057 | 7768 |
|
7647
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset
|
7769 |
|
6069 | 7770 |
*** Proof tools *** |
7771 |
||
6343 | 7772 |
* Provers/Arith/fast_lin_arith.ML contains a functor for creating a |
7773 |
decision procedure for linear arithmetic. Currently it is used for |
|
7593 | 7774 |
types `nat', `int', and `real' in HOL (see below); it can, should and |
7775 |
will be instantiated for other types and logics as well. |
|
6069 | 7776 |
|
7324 | 7777 |
* The simplifier now accepts rewrite rules with flexible heads, eg |
7778 |
hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y |
|
7779 |
They are applied like any rule with a non-pattern lhs, i.e. by first-order |
|
7780 |
matching. |
|
6069 | 7781 |
|
7593 | 7782 |
|
6014 | 7783 |
*** General *** |
7784 |
||
7986 | 7785 |
* New Isabelle/Isar subsystem provides an alternative to traditional |
7215 | 7786 |
tactical theorem proving; together with the ProofGeneral/isar user |
7787 |
interface it offers an interactive environment for developing human |
|
7788 |
readable proof documents (Isar == Intelligible semi-automated |
|
7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
7789 |
reasoning); for further information see isatool doc isar-ref, |
7986 | 7790 |
src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/ |
7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
7791 |
|
9612 | 7792 |
* improved and simplified presentation of theories: better HTML markup |
7793 |
(including colors), graph views in several sizes; isatool usedir now |
|
7794 |
provides a proper interface for user theories (via -P option); actual |
|
7795 |
document preparation based on (PDF)LaTeX is available as well (for |
|
7796 |
new-style theories only); see isatool doc system for more information; |
|
7215 | 7797 |
|
7252 | 7798 |
* native support for Proof General, both for classic Isabelle and |
7986 | 7799 |
Isabelle/Isar; |
7215 | 7800 |
|
7791 | 7801 |
* ML function thm_deps visualizes dependencies of theorems and lemmas, |
7802 |
using the graph browser tool; |
|
7803 |
||
6751 | 7804 |
* Isabelle manuals now also available as PDF; |
7805 |
||
6449 | 7806 |
* theory loader rewritten from scratch (may not be fully |
7807 |
bug-compatible); old loadpath variable has been replaced by show_path, |
|
6671 | 7808 |
add_path, del_path, reset_path functions; new operations such as |
7593 | 7809 |
update_thy, touch_thy, remove_thy, use/update_thy_only (see also |
7810 |
isatool doc ref); |
|
6449 | 7811 |
|
7215 | 7812 |
* improved isatool install: option -k creates KDE application icon, |
7813 |
option -p DIR installs standalone binaries; |
|
7814 |
||
7815 |
* added ML_PLATFORM setting (useful for cross-platform installations); |
|
7816 |
more robust handling of platform specific ML images for SML/NJ; |
|
7817 |
||
7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
7818 |
* the settings environment is now statically scoped, i.e. it is never |
7986 | 7819 |
created again in sub-processes invoked from isabelle, isatool, or |
7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
7820 |
Isabelle; |
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
7821 |
|
7215 | 7822 |
* path element specification '~~' refers to '$ISABELLE_HOME'; |
7823 |
||
6343 | 7824 |
* in locales, the "assumes" and "defines" parts may be omitted if |
7825 |
empty; |
|
5973 | 7826 |
|
6269 | 7827 |
* new print_mode "xsymbols" for extended symbol support (e.g. genuine |
7828 |
long arrows); |
|
6259
488bdc1bd11a
path element specification '~~' refers to '$ISABELLE_HOME';
wenzelm
parents:
6174
diff
changeset
|
7829 |
|
6343 | 7830 |
* new print_mode "HTML"; |
7831 |
||
7832 |
* new flag show_tags controls display of tags of theorems (which are |
|
7833 |
basically just comments that may be attached by some tools); |
|
7834 |
||
6461 | 7835 |
* Isamode 2.6 requires patch to accomodate change of Isabelle font |
7836 |
mode and goal output format: |
|
7837 |
||
7838 |
diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el |
|
7839 |
244c244 |
|
7840 |
< (list (isa-getenv "ISABELLE") "-msymbols" logic-name) |
|
7841 |
--- |
|
6533 | 7842 |
> (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name) |
6461 | 7843 |
diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el |
7844 |
181c181 |
|
7845 |
< (defconst proofstate-proofstart-regexp "^Level [0-9]+$" |
|
7846 |
--- |
|
7847 |
> (defconst proofstate-proofstart-regexp "^Level [0-9]+" |
|
7848 |
||
7450 | 7849 |
* function bind_thms stores lists of theorems (cf. bind_thm); |
7850 |
||
7593 | 7851 |
* new shorthand tactics ftac, eatac, datac, fatac; |
7852 |
||
7853 |
* qed (and friends) now accept "" as result name; in that case the |
|
7986 | 7854 |
theorem is not stored, but proper checks and presentation of the |
7855 |
result still apply; |
|
7593 | 7856 |
|
7805
0ae9ddc36fe0
theorem database now also indexes constants "Trueprop", "all",
wenzelm
parents:
7791
diff
changeset
|
7857 |
* theorem database now also indexes constants "Trueprop", "all", |
0ae9ddc36fe0
theorem database now also indexes constants "Trueprop", "all",
wenzelm
parents:
7791
diff
changeset
|
7858 |
"==>", "=="; thus thms_containing, findI etc. may retrieve more rules; |
0ae9ddc36fe0
theorem database now also indexes constants "Trueprop", "all",
wenzelm
parents:
7791
diff
changeset
|
7859 |
|
6028 | 7860 |
|
6057 | 7861 |
*** HOL *** |
7862 |
||
7215 | 7863 |
** HOL arithmetic ** |
7864 |
||
6343 | 7865 |
* There are now decision procedures for linear arithmetic over nat and |
7866 |
int: |
|
6131 | 7867 |
|
6343 | 7868 |
1. arith_tac copes with arbitrary formulae involving `=', `<', `<=', |
7869 |
`+', `-', `Suc', `min', `max' and numerical constants; other subterms |
|
7870 |
are treated as atomic; subformulae not involving type `nat' or `int' |
|
7871 |
are ignored; quantified subformulae are ignored unless they are |
|
7872 |
positive universal or negative existential. The tactic has to be |
|
7873 |
invoked by hand and can be a little bit slow. In particular, the |
|
7874 |
running time is exponential in the number of occurrences of `min' and |
|
7875 |
`max', and `-' on `nat'. |
|
6131 | 7876 |
|
6343 | 7877 |
2. fast_arith_tac is a cut-down version of arith_tac: it only takes |
7878 |
(negated) (in)equalities among the premises and the conclusion into |
|
7879 |
account (i.e. no compound formulae) and does not know about `min' and |
|
7880 |
`max', and `-' on `nat'. It is fast and is used automatically by the |
|
7881 |
simplifier. |
|
6131 | 7882 |
|
6343 | 7883 |
NB: At the moment, these decision procedures do not cope with mixed |
7884 |
nat/int formulae where the two parts interact, such as `m < n ==> |
|
7885 |
int(m) < int(n)'. |
|
6028 | 7886 |
|
7215 | 7887 |
* HOL/Numeral provides a generic theory of numerals (encoded |
7313 | 7888 |
efficiently as bit strings); setup for types nat/int/real is in place; |
7215 | 7889 |
INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than |
7890 |
int, existing theories and proof scripts may require a few additional |
|
7891 |
type constraints; |
|
7892 |
||
7893 |
* integer division and remainder can now be performed on constant |
|
7894 |
arguments; |
|
7157 | 7895 |
|
7215 | 7896 |
* many properties of integer multiplication, division and remainder |
7897 |
are now available; |
|
6922 | 7898 |
|
7287 | 7899 |
* An interface to the Stanford Validity Checker (SVC) is available through the |
7900 |
tactic svc_tac. Propositional tautologies and theorems of linear arithmetic |
|
7901 |
are proved automatically. SVC must be installed separately, and its results |
|
7902 |
must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any |
|
7903 |
invocation of the underlying oracle). For SVC see |
|
7444 | 7904 |
http://verify.stanford.edu/SVC |
6922 | 7905 |
|
7125 | 7906 |
* IsaMakefile: the HOL-Real target now builds an actual image; |
7907 |
||
7215 | 7908 |
|
7909 |
** HOL misc ** |
|
7910 |
||
7595
5f5d575ddac3
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
wenzelm
parents:
7593
diff
changeset
|
7911 |
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces |
5f5d575ddac3
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
wenzelm
parents:
7593
diff
changeset
|
7912 |
(in Isabelle/Isar) -- by Gertrud Bauer; |
5f5d575ddac3
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
wenzelm
parents:
7593
diff
changeset
|
7913 |
|
7691 | 7914 |
* HOL/BCV: generic model of bytecode verification, i.e. data-flow |
7915 |
analysis for assembly languages with subtypes; |
|
7916 |
||
6278 | 7917 |
* HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization |
7918 |
-- avoids syntactic ambiguities and treats state, transition, and |
|
7919 |
temporal levels more uniformly; introduces INCOMPATIBILITIES due to |
|
7920 |
changed syntax and (many) tactics; |
|
7921 |
||
7791 | 7922 |
* HOL/inductive: Now also handles more general introduction rules such |
7923 |
as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity |
|
7924 |
theorems are now maintained within the theory (maintained via the |
|
7925 |
"mono" attribute); |
|
7780
099742c562aa
Documented changes to HOL/inductive and function thm_deps.
berghofe
parents:
7691
diff
changeset
|
7926 |
|
7238
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
7927 |
* HOL/datatype: Now also handles arbitrarily branching datatypes |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
7928 |
(using function types) such as |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
7929 |
|
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
7930 |
datatype 'a tree = Atom 'a | Branch "nat => 'a tree" |
7047
d103b875ef1d
Datatype package now handles arbitrarily branching datatypes.
berghofe
parents:
6925
diff
changeset
|
7931 |
|
7326 | 7932 |
* HOL/record: record_simproc (part of the default simpset) takes care |
7933 |
of selectors applied to updated records; record_split_tac is no longer |
|
7327 | 7934 |
part of the default claset; update_defs may now be removed from the |
7935 |
simpset in many cases; COMPATIBILITY: old behavior achieved by |
|
7326 | 7936 |
|
7937 |
claset_ref () := claset() addSWrapper record_split_wrapper; |
|
7938 |
Delsimprocs [record_simproc] |
|
7939 |
||
6386
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
7940 |
* HOL/typedef: fixed type inference for representing set; type |
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
7941 |
arguments now have to occur explicitly on the rhs as type constraints; |
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
7942 |
|
7287 | 7943 |
* HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem |
7944 |
names rather than an ML expression; |
|
7945 |
||
7946 |
* HOL/defer_recdef (TFL): like recdef but the well-founded relation can be |
|
7947 |
supplied later. Program schemes can be defined, such as |
|
7948 |
"While B C s = (if B s then While B C (C s) else s)" |
|
7949 |
where the well-founded relation can be chosen after B and C have been given. |
|
6563 | 7950 |
|
7215 | 7951 |
* HOL/List: the constructors of type list are now Nil and Cons; |
7952 |
INCOMPATIBILITY: while [] and infix # syntax is still there, of |
|
7953 |
course, ML tools referring to List.list.op # etc. have to be adapted; |
|
7954 |
||
7238
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
7955 |
* HOL_quantifiers flag superseded by "HOL" print mode, which is |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
7956 |
disabled by default; run isabelle with option -m HOL to get back to |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
7957 |
the original Gordon/HOL-style output; |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
7958 |
|
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
7959 |
* HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P, |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
7960 |
ALL x<=y. P, EX x<y. P, EX x<=y. P; |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
7961 |
|
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
7962 |
* HOL basic syntax simplified (more orthogonal): all variants of |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
7963 |
All/Ex now support plain / symbolic / HOL notation; plain syntax for |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
7964 |
Eps operator is provided as well: "SOME x. P[x]"; |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
7965 |
|
7320 | 7966 |
* HOL/Sum.thy: sum_case has been moved to HOL/Datatype; |
7261 | 7967 |
|
7280 | 7968 |
* HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made |
7969 |
thus available for user theories; |
|
7970 |
||
7300
8439bf404c28
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with HOL/List;
wenzelm
parents:
7287
diff
changeset
|
7971 |
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with |
8439bf404c28
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with HOL/List;
wenzelm
parents:
7287
diff
changeset
|
7972 |
HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the |
8439bf404c28
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with HOL/List;
wenzelm
parents:
7287
diff
changeset
|
7973 |
time; |
8439bf404c28
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with HOL/List;
wenzelm
parents:
7287
diff
changeset
|
7974 |
|
7986 | 7975 |
* HOL: new tactic smp_tac: int -> int -> tactic, which applies spec |
7976 |
several times and then mp; |
|
7492 | 7977 |
|
7215 | 7978 |
|
7113 | 7979 |
*** LK *** |
7980 |
||
7215 | 7981 |
* the notation <<...>> is now available as a notation for sequences of |
7982 |
formulas; |
|
7113 | 7983 |
|
7984 |
* the simplifier is now installed |
|
7985 |
||
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
7986 |
* the axiom system has been generalized (thanks to Soren Heilmann) |
7113 | 7987 |
|
7988 |
* the classical reasoner now has a default rule database |
|
7989 |
||
7990 |
||
6064 | 7991 |
*** ZF *** |
7992 |
||
7993 |
* new primrec section allows primitive recursive functions to be given |
|
6269 | 7994 |
directly (as in HOL) over datatypes and the natural numbers; |
6064 | 7995 |
|
6269 | 7996 |
* new tactics induct_tac and exhaust_tac for induction (or case |
7997 |
analysis) over datatypes and the natural numbers; |
|
6064 | 7998 |
|
7999 |
* the datatype declaration of type T now defines the recursor T_rec; |
|
8000 |
||
6141 | 8001 |
* simplification automatically does freeness reasoning for datatype |
6269 | 8002 |
constructors; |
6141 | 8003 |
|
6269 | 8004 |
* automatic type-inference, with AddTCs command to insert new |
8005 |
type-checking rules; |
|
6155 | 8006 |
|
6269 | 8007 |
* datatype introduction rules are now added as Safe Introduction rules |
8008 |
to the claset; |
|
6155 | 8009 |
|
6269 | 8010 |
* the syntax "if P then x else y" is now available in addition to |
8011 |
if(P,x,y); |
|
8012 |
||
6069 | 8013 |
|
6343 | 8014 |
*** Internal programming interfaces *** |
8015 |
||
7919
35c18affc1d8
tuned simplifier trace output; new flag debug_simp
wenzelm
parents:
7886
diff
changeset
|
8016 |
* tuned simplifier trace output; new flag debug_simp; |
35c18affc1d8
tuned simplifier trace output; new flag debug_simp
wenzelm
parents:
7886
diff
changeset
|
8017 |
|
7420
cba45c114f3b
structures Vartab / Termtab (instances of TableFun);
wenzelm
parents:
7327
diff
changeset
|
8018 |
* structures Vartab / Termtab (instances of TableFun) offer efficient |
cba45c114f3b
structures Vartab / Termtab (instances of TableFun);
wenzelm
parents:
7327
diff
changeset
|
8019 |
tables indexed by indexname_ord / term_ord (compatible with aconv); |
cba45c114f3b
structures Vartab / Termtab (instances of TableFun);
wenzelm
parents:
7327
diff
changeset
|
8020 |
|
6386
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
8021 |
* AxClass.axclass_tac lost the theory argument; |
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
8022 |
|
6343 | 8023 |
* tuned current_goals_markers semantics: begin / end goal avoids |
8024 |
printing empty lines; |
|
8025 |
||
8026 |
* removed prs and prs_fn hook, which was broken because it did not |
|
8027 |
include \n in its semantics, forcing writeln to add one |
|
8028 |
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: |
|
8029 |
string -> unit if you really want to output text without newline; |
|
8030 |
||
8031 |
* Symbol.output subject to print mode; INCOMPATIBILITY: defaults to |
|
8032 |
plain output, interface builders may have to enable 'isabelle_font' |
|
8033 |
mode to get Isabelle font glyphs as before; |
|
8034 |
||
8035 |
* refined token_translation interface; INCOMPATIBILITY: output length |
|
8036 |
now of type real instead of int; |
|
8037 |
||
7196 | 8038 |
* theory loader actions may be traced via new ThyInfo.add_hook |
8039 |
interface (see src/Pure/Thy/thy_info.ML); example application: keep |
|
8040 |
your own database of information attached to *whole* theories -- as |
|
8041 |
opposed to intra-theory data slots offered via TheoryDataFun; |
|
8042 |
||
7647
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset
|
8043 |
* proper handling of dangling sort hypotheses (at last!); |
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset
|
8044 |
Thm.strip_shyps and Drule.strip_shyps_warning take care of removing |
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset
|
8045 |
extra sort hypotheses that can be witnessed from the type signature; |
7986 | 8046 |
the force_strip_shyps flag is gone, any remaining shyps are simply |
8047 |
left in the theorem (with a warning issued by strip_shyps_warning); |
|
7647
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset
|
8048 |
|
6343 | 8049 |
|
6064 | 8050 |
|
5781 | 8051 |
New in Isabelle98-1 (October 1998) |
8052 |
---------------------------------- |
|
8053 |
||
5127 | 8054 |
*** Overview of INCOMPATIBILITIES (see below for more details) *** |
4842 | 8055 |
|
5726 | 8056 |
* several changes of automated proof tools; |
5373 | 8057 |
|
5726 | 8058 |
* HOL: major changes to the inductive and datatype packages, including |
8059 |
some minor incompatibilities of theory syntax; |
|
5214 | 8060 |
|
5726 | 8061 |
* HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now |
5217 | 8062 |
called `inj_on'; |
5160 | 8063 |
|
5275 | 8064 |
* HOL: removed duplicate thms in Arith: |
8065 |
less_imp_add_less should be replaced by trans_less_add1 |
|
8066 |
le_imp_add_le should be replaced by trans_le_add1 |
|
5160 | 8067 |
|
5726 | 8068 |
* HOL: unary minus is now overloaded (new type constraints may be |
8069 |
required); |
|
5490 | 8070 |
|
5726 | 8071 |
* HOL and ZF: unary minus for integers is now #- instead of #~. In |
8072 |
ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is |
|
8073 |
now taken as an integer constant. |
|
5541 | 8074 |
|
5726 | 8075 |
* Pure: ML function 'theory_of' renamed to 'theory'; |
5397
034ed25535b9
* Pure: ML function 'theory_of' replaced by 'theory';
wenzelm
parents:
5373
diff
changeset
|
8076 |
|
5363 | 8077 |
|
5127 | 8078 |
*** Proof tools *** |
4880 | 8079 |
|
5657
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
8080 |
* Simplifier: |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
8081 |
1. Asm_full_simp_tac is now more aggressive. |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
8082 |
1. It will sometimes reorient premises if that increases their power to |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
8083 |
simplify. |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
8084 |
2. It does no longer proceed strictly from left to right but may also |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
8085 |
rotate premises to achieve further simplification. |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
8086 |
For compatibility reasons there is now Asm_lr_simp_tac which is like the |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
8087 |
old Asm_full_simp_tac in that it does not rotate premises. |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
8088 |
2. The simplifier now knows a little bit about nat-arithmetic. |
4880 | 8089 |
|
5127 | 8090 |
* Classical reasoner: wrapper mechanism for the classical reasoner now |
8091 |
allows for selected deletion of wrappers, by introduction of names for |
|
8092 |
wrapper functionals. This implies that addbefore, addSbefore, |
|
8093 |
addaltern, and addSaltern now take a pair (name, tactic) as argument, |
|
8094 |
and that adding two tactics with the same name overwrites the first |
|
8095 |
one (emitting a warning). |
|
4824 | 8096 |
type wrapper = (int -> tactic) -> (int -> tactic) |
4649 | 8097 |
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by |
4824 | 8098 |
addWrapper, addSWrapper: claset * (string * wrapper) -> claset |
8099 |
delWrapper, delSWrapper: claset * string -> claset |
|
4649 | 8100 |
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; |
8101 |
||
5705
56f2030c46c6
tuned (all proofs are INSTABLE by David's definition of instability);
wenzelm
parents:
5671
diff
changeset
|
8102 |
* Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE |
5726 | 8103 |
semantics; addbefore now affects only the unsafe part of step_tac |
8104 |
etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY |
|
8105 |
FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac |
|
8106 |
by Force_tac; |
|
5524 | 8107 |
|
5726 | 8108 |
* Classical reasoner: setwrapper to setWrapper and compwrapper to |
8109 |
compWrapper; added safe wrapper (and access functions for it); |
|
5524 | 8110 |
|
5127 | 8111 |
* HOL/split_all_tac is now much faster and fails if there is nothing |
5726 | 8112 |
to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order |
8113 |
and the names of the automatically generated variables have changed. |
|
8114 |
split_all_tac has moved within claset() from unsafe wrappers to safe |
|
8115 |
wrappers, which means that !!-bound variables are split much more |
|
8116 |
aggressively, and safe_tac and clarify_tac now split such variables. |
|
8117 |
If this splitting is not appropriate, use delSWrapper "split_all_tac". |
|
8118 |
Note: the same holds for record_split_tac, which does the job of |
|
8119 |
split_all_tac for record fields. |
|
5127 | 8120 |
|
5726 | 8121 |
* HOL/Simplifier: Rewrite rules for case distinctions can now be added |
8122 |
permanently to the default simpset using Addsplits just like |
|
8123 |
Addsimps. They can be removed via Delsplits just like |
|
8124 |
Delsimps. Lower-case versions are also available. |
|
5127 | 8125 |
|
5726 | 8126 |
* HOL/Simplifier: The rule split_if is now part of the default |
8127 |
simpset. This means that the simplifier will eliminate all occurrences |
|
8128 |
of if-then-else in the conclusion of a goal. To prevent this, you can |
|
8129 |
either remove split_if completely from the default simpset by |
|
8130 |
`Delsplits [split_if]' or remove it in a specific call of the |
|
8131 |
simplifier using `... delsplits [split_if]'. You can also add/delete |
|
8132 |
other case splitting rules to/from the default simpset: every datatype |
|
8133 |
generates suitable rules `split_t_case' and `split_t_case_asm' (where |
|
8134 |
t is the name of the datatype). |
|
5127 | 8135 |
|
5726 | 8136 |
* Classical reasoner / Simplifier combination: new force_tac (and |
5127 | 8137 |
derivatives Force_tac, force) combines rewriting and classical |
8138 |
reasoning (and whatever other tools) similarly to auto_tac, but is |
|
5726 | 8139 |
aimed to solve the given subgoal completely. |
5127 | 8140 |
|
8141 |
||
8142 |
*** General *** |
|
8143 |
||
5217 | 8144 |
* new top-level commands `Goal' and `Goalw' that improve upon `goal' |
5127 | 8145 |
and `goalw': the theory is no longer needed as an explicit argument - |
8146 |
the current theory context is used; assumptions are no longer returned |
|
8147 |
at the ML-level unless one of them starts with ==> or !!; it is |
|
5217 | 8148 |
recommended to convert to these new commands using isatool fixgoal |
8149 |
(backup your sources first!); |
|
4842 | 8150 |
|
5217 | 8151 |
* new top-level commands 'thm' and 'thms' for retrieving theorems from |
5207 | 8152 |
the current theory context, and 'theory' to lookup stored theories; |
4806 | 8153 |
|
5722 | 8154 |
* new theory section 'locale' for declaring constants, assumptions and |
8155 |
definitions that have local scope; |
|
8156 |
||
5127 | 8157 |
* new theory section 'nonterminals' for purely syntactic types; |
4858 | 8158 |
|
5127 | 8159 |
* new theory section 'setup' for generic ML setup functions |
8160 |
(e.g. package initialization); |
|
4869 | 8161 |
|
5131 | 8162 |
* the distribution now includes Isabelle icons: see |
8163 |
lib/logo/isabelle-{small,tiny}.xpm; |
|
8164 |
||
5363 | 8165 |
* isatool install - install binaries with absolute references to |
8166 |
ISABELLE_HOME/bin; |
|
8167 |
||
5572 | 8168 |
* isatool logo -- create instances of the Isabelle logo (as EPS); |
8169 |
||
5407 | 8170 |
* print mode 'emacs' reserved for Isamode; |
8171 |
||
5726 | 8172 |
* support multiple print (ast) translations per constant name; |
8173 |
||
6925
8d4d45ec6a3d
theorems involving oracles are now printed with a suffixed [!];
wenzelm
parents:
6922
diff
changeset
|
8174 |
* theorems involving oracles are now printed with a suffixed [!]; |
8d4d45ec6a3d
theorems involving oracles are now printed with a suffixed [!];
wenzelm
parents:
6922
diff
changeset
|
8175 |
|
4711 | 8176 |
|
4661 | 8177 |
*** HOL *** |
8178 |
||
5710 | 8179 |
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial'); |
5709 | 8180 |
|
5217 | 8181 |
* HOL/inductive package reorganized and improved: now supports mutual |
5267 | 8182 |
definitions such as |
5217 | 8183 |
|
8184 |
inductive EVEN ODD |
|
8185 |
intrs |
|
8186 |
null "0 : EVEN" |
|
8187 |
oddI "n : EVEN ==> Suc n : ODD" |
|
8188 |
evenI "n : ODD ==> Suc n : EVEN" |
|
8189 |
||
8190 |
new theorem list "elims" contains an elimination rule for each of the |
|
8191 |
recursive sets; inductive definitions now handle disjunctive premises |
|
8192 |
correctly (also ZF); |
|
5214 | 8193 |
|
5217 | 8194 |
INCOMPATIBILITIES: requires Inductive as an ancestor; component |
8195 |
"mutual_induct" no longer exists - the induction rule is always |
|
8196 |
contained in "induct"; |
|
8197 |
||
8198 |
||
8199 |
* HOL/datatype package re-implemented and greatly improved: now |
|
5267 | 8200 |
supports mutually recursive datatypes such as |
5217 | 8201 |
|
8202 |
datatype |
|
8203 |
'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp) |
|
8204 |
| SUM ('a aexp) ('a aexp) |
|
8205 |
| DIFF ('a aexp) ('a aexp) |
|
8206 |
| NUM 'a |
|
8207 |
and |
|
8208 |
'a bexp = LESS ('a aexp) ('a aexp) |
|
8209 |
| AND ('a bexp) ('a bexp) |
|
8210 |
| OR ('a bexp) ('a bexp) |
|
8211 |
||
5267 | 8212 |
as well as indirectly recursive datatypes such as |
5214 | 8213 |
|
5217 | 8214 |
datatype |
8215 |
('a, 'b) term = Var 'a |
|
8216 |
| App 'b ((('a, 'b) term) list) |
|
5214 | 8217 |
|
5217 | 8218 |
The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs |
8219 |
induction on mutually / indirectly recursive datatypes. |
|
8220 |
||
8221 |
Primrec equations are now stored in theory and can be accessed via |
|
8222 |
<function_name>.simps. |
|
8223 |
||
8224 |
INCOMPATIBILITIES: |
|
5214 | 8225 |
|
5217 | 8226 |
- Theories using datatypes must now have theory Datatype as an |
8227 |
ancestor. |
|
8228 |
- The specific <typename>.induct_tac no longer exists - use the |
|
8229 |
generic induct_tac instead. |
|
5226 | 8230 |
- natE has been renamed to nat.exhaust - use exhaust_tac |
5217 | 8231 |
instead of res_inst_tac ... natE. Note that the variable |
5226 | 8232 |
names in nat.exhaust differ from the names in natE, this |
5217 | 8233 |
may cause some "fragile" proofs to fail. |
8234 |
- The theorems split_<typename>_case and split_<typename>_case_asm |
|
8235 |
have been renamed to <typename>.split and <typename>.split_asm. |
|
8236 |
- Since default sorts of type variables are now handled correctly, |
|
8237 |
some datatype definitions may have to be annotated with explicit |
|
8238 |
sort constraints. |
|
8239 |
- Primrec definitions no longer require function name and type |
|
8240 |
of recursive argument. |
|
5214 | 8241 |
|
5217 | 8242 |
Consider using isatool fixdatatype to adapt your theories and proof |
8243 |
scripts to the new package (backup your sources first!). |
|
8244 |
||
8245 |
||
5726 | 8246 |
* HOL/record package: considerably improved implementation; now |
8247 |
includes concrete syntax for record types, terms, updates; theorems |
|
8248 |
for surjective pairing and splitting !!-bound record variables; proof |
|
8249 |
support is as follows: |
|
8250 |
||
8251 |
1) standard conversions (selectors or updates applied to record |
|
8252 |
constructor terms) are part of the standard simpset; |
|
8253 |
||
8254 |
2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are |
|
8255 |
made part of standard simpset and claset via addIffs; |
|
8256 |
||
8257 |
3) a tactic for record field splitting (record_split_tac) is part of |
|
8258 |
the standard claset (addSWrapper); |
|
8259 |
||
8260 |
To get a better idea about these rules you may retrieve them via |
|
8261 |
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is |
|
8262 |
the name of your record type. |
|
8263 |
||
8264 |
The split tactic 3) conceptually simplifies by the following rule: |
|
8265 |
||
8266 |
"(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))" |
|
8267 |
||
8268 |
Thus any record variable that is bound by meta-all will automatically |
|
8269 |
blow up into some record constructor term, consequently the |
|
8270 |
simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall |
|
8271 |
solve record problems automatically. |
|
8272 |
||
5214 | 8273 |
|
5125 | 8274 |
* reorganized the main HOL image: HOL/Integ and String loaded by |
8275 |
default; theory Main includes everything; |
|
8276 |
||
5650 | 8277 |
* automatic simplification of integer sums and comparisons, using cancellation; |
8278 |
||
5526 | 8279 |
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; |
5127 | 8280 |
|
8281 |
* added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset; |
|
8282 |
||
8283 |
* many new identities for unions, intersections, set difference, etc.; |
|
8284 |
||
8285 |
* expand_if, expand_split, expand_sum_case and expand_nat_case are now |
|
8286 |
called split_if, split_split, split_sum_case and split_nat_case (to go |
|
8287 |
with add/delsplits); |
|
5125 | 8288 |
|
5127 | 8289 |
* HOL/Prod introduces simplification procedure unit_eq_proc rewriting |
8290 |
(?x::unit) = (); this is made part of the default simpset, which COULD |
|
8291 |
MAKE EXISTING PROOFS FAIL under rare circumstances (consider |
|
5207 | 8292 |
'Delsimprocs [unit_eq_proc];' as last resort); also note that |
8293 |
unit_abs_eta_conv is added in order to counter the effect of |
|
8294 |
unit_eq_proc on (%u::unit. f u), replacing it by f rather than by |
|
8295 |
%u.f(); |
|
5125 | 8296 |
|
5217 | 8297 |
* HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which |
8298 |
makes more sense); |
|
5109 | 8299 |
|
5475 | 8300 |
* HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule; |
8301 |
It and 'sym RS equals0D' are now in the default claset, giving automatic |
|
8302 |
disjointness reasoning but breaking a few old proofs. |
|
5267 | 8303 |
|
5217 | 8304 |
* HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1 |
8305 |
to 'converse' from 'inverse' (for compatibility with ZF and some |
|
8306 |
literature); |
|
5085
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset
|
8307 |
|
5127 | 8308 |
* HOL/recdef can now declare non-recursive functions, with {} supplied as |
8309 |
the well-founded relation; |
|
4838 | 8310 |
|
5490 | 8311 |
* HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of |
8312 |
Compl A. The "Compl" syntax remains available as input syntax for this |
|
8313 |
release ONLY. |
|
8314 |
||
5127 | 8315 |
* HOL/Update: new theory of function updates: |
8316 |
f(a:=b) == %x. if x=a then b else f x |
|
8317 |
may also be iterated as in f(a:=b,c:=d,...); |
|
5077
71043526295f
* HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents:
5075
diff
changeset
|
8318 |
|
5127 | 8319 |
* HOL/Vimage: new theory for inverse image of a function, syntax f-``B; |
4899 | 8320 |
|
5282 | 8321 |
* HOL/List: |
8322 |
- new function list_update written xs[i:=v] that updates the i-th |
|
8323 |
list position. May also be iterated as in xs[i:=a,j:=b,...]. |
|
5428 | 8324 |
- new function `upt' written [i..j(] which generates the list |
8325 |
[i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper |
|
8326 |
bound write [i..j], which is a shorthand for [i..j+1(]. |
|
5282 | 8327 |
- new lexicographic orderings and corresponding wellfoundedness theorems. |
4779 | 8328 |
|
5127 | 8329 |
* HOL/Arith: |
8330 |
- removed 'pred' (predecessor) function; |
|
8331 |
- generalized some theorems about n-1; |
|
8332 |
- many new laws about "div" and "mod"; |
|
8333 |
- new laws about greatest common divisors (see theory ex/Primes); |
|
4766 | 8334 |
|
5127 | 8335 |
* HOL/Relation: renamed the relational operator r^-1 "converse" |
4842 | 8336 |
instead of "inverse"; |
4711 | 8337 |
|
5651 | 8338 |
* HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness |
8339 |
of the multiset ordering; |
|
8340 |
||
5127 | 8341 |
* directory HOL/Real: a construction of the reals using Dedekind cuts |
5651 | 8342 |
(not included by default); |
4835 | 8343 |
|
5127 | 8344 |
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; |
4711 | 8345 |
|
5651 | 8346 |
* directory HOL/Hoare: a new version of Hoare logic which permits many-sorted |
8347 |
programs, i.e. different program variables may have different types. |
|
8348 |
||
5142 | 8349 |
* calling (stac rew i) now fails if "rew" has no effect on the goal |
8350 |
[previously, this check worked only if the rewrite rule was unconditional] |
|
5308 | 8351 |
Now rew can involve either definitions or equalities (either == or =). |
5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset
|
8352 |
|
5363 | 8353 |
|
4879
58656c6a3551
"let" is no longer restricted to FOL terms and allows any logical terms
paulson
parents:
4869
diff
changeset
|
8354 |
*** ZF *** |
58656c6a3551
"let" is no longer restricted to FOL terms and allows any logical terms
paulson
parents:
4869
diff
changeset
|
8355 |
|
5332 | 8356 |
* theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains |
8357 |
only the theorems proved on ZF.ML; |
|
5160 | 8358 |
|
5475 | 8359 |
* ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule; |
8360 |
It and 'sym RS equals0D' are now in the default claset, giving automatic |
|
8361 |
disjointness reasoning but breaking a few old proofs. |
|
5267 | 8362 |
|
5160 | 8363 |
* ZF/Update: new theory of function updates |
8364 |
with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z) |
|
8365 |
may also be iterated as in f(a:=b,c:=d,...); |
|
8366 |
||
4879
58656c6a3551
"let" is no longer restricted to FOL terms and allows any logical terms
paulson
parents:
4869
diff
changeset
|
8367 |
* in let x=t in u(x), neither t nor u(x) has to be an FOL term. |
4649 | 8368 |
|
5142 | 8369 |
* calling (stac rew i) now fails if "rew" has no effect on the goal |
8370 |
[previously, this check worked only if the rewrite rule was unconditional] |
|
5308 | 8371 |
Now rew can involve either definitions or equalities (either == or =). |
5142 | 8372 |
|
5160 | 8373 |
* case_tac provided for compatibility with HOL |
8374 |
(like the old excluded_middle_tac, but with subgoals swapped) |
|
8375 |
||
4842 | 8376 |
|
5127 | 8377 |
*** Internal programming interfaces *** |
5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset
|
8378 |
|
5251 | 8379 |
* Pure: several new basic modules made available for general use, see |
8380 |
also src/Pure/README; |
|
5207 | 8381 |
|
5008 | 8382 |
* improved the theory data mechanism to support encapsulation (data |
8383 |
kind name replaced by private Object.kind, acting as authorization |
|
5373 | 8384 |
key); new type-safe user interface via functor TheoryDataFun; generic |
8385 |
print_data function becomes basically useless; |
|
5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset
|
8386 |
|
5251 | 8387 |
* removed global_names compatibility flag -- all theory declarations |
8388 |
are qualified by default; |
|
8389 |
||
5085
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset
|
8390 |
* module Pure/Syntax now offers quote / antiquote translation |
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset
|
8391 |
functions (useful for Hoare logic etc. with implicit dependencies); |
5373 | 8392 |
see HOL/ex/Antiquote for an example use; |
5085
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset
|
8393 |
|
5127 | 8394 |
* Simplifier now offers conversions (asm_)(full_)rewrite: simpset -> |
8395 |
cterm -> thm; |
|
8396 |
||
5207 | 8397 |
* new tactical CHANGED_GOAL for checking that a tactic modifies a |
8398 |
subgoal; |
|
5142 | 8399 |
|
5251 | 8400 |
* Display.print_goals function moved to Locale.print_goals; |
8401 |
||
5731 | 8402 |
* standard print function for goals supports current_goals_markers |
8403 |
variable for marking begin of proof, end of proof, start of goal; the |
|
8404 |
default is ("", "", ""); setting current_goals_markers := ("<proof>", |
|
8405 |
"</proof>", "<goal>") causes SGML like tagged proof state printing, |
|
8406 |
for example; |
|
8407 |
||
5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset
|
8408 |
|
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset
|
8409 |
|
4410 | 8410 |
New in Isabelle98 (January 1998) |
8411 |
-------------------------------- |
|
8412 |
||
8413 |
*** Overview of INCOMPATIBILITIES (see below for more details) *** |
|
8414 |
||
8415 |
* changed lexical syntax of terms / types: dots made part of long |
|
8416 |
identifiers, e.g. "%x.x" no longer possible, should be "%x. x"; |
|
8417 |
||
8418 |
* simpset (and claset) reference variable replaced by functions |
|
8419 |
simpset / simpset_ref; |
|
8420 |
||
8421 |
* no longer supports theory aliases (via merge) and non-trivial |
|
8422 |
implicit merge of thms' signatures; |
|
8423 |
||
8424 |
* most internal names of constants changed due to qualified names; |
|
8425 |
||
8426 |
* changed Pure/Sequence interface (see Pure/seq.ML); |
|
8427 |
||
3454 | 8428 |
|
3715 | 8429 |
*** General Changes *** |
8430 |
||
4174 | 8431 |
* hierachically structured name spaces (for consts, types, axms, thms |
3943 | 8432 |
etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of |
4108 | 8433 |
old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY: |
8434 |
isatool fixdots ensures space after dots (e.g. "%x. x"); set |
|
4174 | 8435 |
long_names for fully qualified output names; NOTE: ML programs |
8436 |
(special tactics, packages etc.) referring to internal names may have |
|
8437 |
to be adapted to cope with fully qualified names; in case of severe |
|
8438 |
backward campatibility problems try setting 'global_names' at compile |
|
8439 |
time to have enrything declared within a flat name space; one may also |
|
8440 |
fine tune name declarations in theories via the 'global' and 'local' |
|
8441 |
section; |
|
4108 | 8442 |
|
8443 |
* reimplemented the implicit simpset and claset using the new anytype |
|
8444 |
data filed in signatures; references simpset:simpset ref etc. are |
|
8445 |
replaced by functions simpset:unit->simpset and |
|
8446 |
simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp |
|
8447 |
to patch your ML files accordingly; |
|
3856 | 8448 |
|
3857 | 8449 |
* HTML output now includes theory graph data for display with Java |
8450 |
applet or isatool browser; data generated automatically via isatool |
|
3901 | 8451 |
usedir (see -i option, ISABELLE_USEDIR_OPTIONS); |
3857 | 8452 |
|
3856 | 8453 |
* defs may now be conditional; improved rewrite_goals_tac to handle |
8454 |
conditional equations; |
|
8455 |
||
4174 | 8456 |
* defs now admits additional type arguments, using TYPE('a) syntax; |
8457 |
||
3901 | 8458 |
* theory aliases via merge (e.g. M=A+B+C) no longer supported, always |
8459 |
creates a new theory node; implicit merge of thms' signatures is |
|
4112 | 8460 |
restricted to 'trivial' ones; COMPATIBILITY: one may have to use |
3901 | 8461 |
transfer:theory->thm->thm in (rare) cases; |
8462 |
||
3968
ec138de716d9
improved handling of draft signatures / theories; draft thms (and
wenzelm
parents:
3964
diff
changeset
|
8463 |
* improved handling of draft signatures / theories; draft thms (and |
ec138de716d9
improved handling of draft signatures / theories; draft thms (and
wenzelm
parents:
3964
diff
changeset
|
8464 |
ctyps, cterms) are automatically promoted to real ones; |
ec138de716d9
improved handling of draft signatures / theories; draft thms (and
wenzelm
parents:
3964
diff
changeset
|
8465 |
|
3901 | 8466 |
* slightly changed interfaces for oracles: admit many per theory, named |
8467 |
(e.g. oracle foo = mlfun), additional name argument for invoke_oracle; |
|
8468 |
||
8469 |
* print_goals: optional output of const types (set show_consts and |
|
8470 |
show_types); |
|
3851
fe9932a7cd46
print_goals: optional output of const types (set show_consts);
wenzelm
parents:
3846
diff
changeset
|
8471 |
|
4388 | 8472 |
* improved output of warnings (###) and errors (***); |
3697
c5833dfcc2cc
Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
wenzelm
parents:
3671
diff
changeset
|
8473 |
|
4178
e64ff1c1bc70
subgoal_tac displays a warning if the new subgoal has type variables
paulson
parents:
4174
diff
changeset
|
8474 |
* subgoal_tac displays a warning if the new subgoal has type variables; |
e64ff1c1bc70
subgoal_tac displays a warning if the new subgoal has type variables
paulson
parents:
4174
diff
changeset
|
8475 |
|
3715 | 8476 |
* removed old README and Makefiles; |
3697
c5833dfcc2cc
Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
wenzelm
parents:
3671
diff
changeset
|
8477 |
|
3856 | 8478 |
* replaced print_goals_ref hook by print_current_goals_fn and result_error_fn; |
3670
9fea3562f8c7
replaced print_goals_ref hook by print_current_goals_fn and
wenzelm
parents:
3658
diff
changeset
|
8479 |
|
3715 | 8480 |
* removed obsolete init_pps and init_database; |
8481 |
||
8482 |
* deleted the obsolete tactical STATE, which was declared by |
|
8483 |
fun STATE tacfun st = tacfun st st; |
|
8484 |
||
4388 | 8485 |
* cd and use now support path variables, e.g. $ISABELLE_HOME, or ~ |
8486 |
(which abbreviates $HOME); |
|
4269 | 8487 |
|
8488 |
* changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY: |
|
8489 |
use isatool fixseq to adapt your ML programs (this works for fully |
|
8490 |
qualified references to the Sequence structure only!); |
|
8491 |
||
4381 | 8492 |
* use_thy no longer requires writable current directory; it always |
8493 |
reloads .ML *and* .thy file, if either one is out of date; |
|
4269 | 8494 |
|
3715 | 8495 |
|
8496 |
*** Classical Reasoner *** |
|
8497 |
||
3744 | 8498 |
* Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new |
8499 |
tactics that use classical reasoning to simplify a subgoal without |
|
8500 |
splitting it into several subgoals; |
|
3715 | 8501 |
|
3719 | 8502 |
* Safe_tac: like safe_tac but uses the default claset; |
8503 |
||
3715 | 8504 |
|
8505 |
*** Simplifier *** |
|
8506 |
||
8507 |
* added simplification meta rules: |
|
8508 |
(asm_)(full_)simplify: simpset -> thm -> thm; |
|
8509 |
||
8510 |
* simplifier.ML no longer part of Pure -- has to be loaded by object |
|
8511 |
logics (again); |
|
8512 |
||
8513 |
* added prems argument to simplification procedures; |
|
8514 |
||
4325 | 8515 |
* HOL, FOL, ZF: added infix function `addsplits': |
8516 |
instead of `<simpset> setloop (split_tac <thms>)' |
|
8517 |
you can simply write `<simpset> addsplits <thms>' |
|
8518 |
||
3715 | 8519 |
|
8520 |
*** Syntax *** |
|
8521 |
||
4174 | 8522 |
* TYPE('a) syntax for type reflection terms; |
8523 |
||
3985 | 8524 |
* no longer handles consts with name "" -- declare as 'syntax' instead; |
3856 | 8525 |
|
8526 |
* pretty printer: changed order of mixfix annotation preference (again!); |
|
3846 | 8527 |
|
3715 | 8528 |
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; |
8529 |
||
8530 |
||
8531 |
*** HOL *** |
|
8532 |
||
5726 | 8533 |
* HOL: there is a new splitter `split_asm_tac' that can be used e.g. |
4189 | 8534 |
with `addloop' of the simplifier to faciliate case splitting in premises. |
8535 |
||
4035 | 8536 |
* HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions; |
3985 | 8537 |
|
8538 |
* HOL/Auth: new protocol proofs including some for the Internet |
|
4035 | 8539 |
protocol TLS; |
3985 | 8540 |
|
4125 | 8541 |
* HOL/Map: new theory of `maps' a la VDM; |
3982 | 8542 |
|
4335 | 8543 |
* HOL/simplifier: simplification procedures nat_cancel_sums for |
8544 |
cancelling out common nat summands from =, <, <= (in)equalities, or |
|
8545 |
differences; simplification procedures nat_cancel_factor for |
|
8546 |
cancelling common factor from =, <, <= (in)equalities over natural |
|
4373 | 8547 |
sums; nat_cancel contains both kinds of procedures, it is installed by |
8548 |
default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL; |
|
4335 | 8549 |
|
3580 | 8550 |
* HOL/simplifier: terms of the form |
4325 | 8551 |
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x) |
3580 | 8552 |
are rewritten to |
4035 | 8553 |
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)', |
8554 |
and those of the form |
|
4325 | 8555 |
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x) |
4035 | 8556 |
are rewritten to |
8557 |
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)', |
|
8558 |
||
8559 |
* HOL/datatype |
|
8560 |
Each datatype `t' now comes with a theorem `split_t_case' of the form |
|
3580 | 8561 |
|
4035 | 8562 |
P(t_case f1 ... fn x) = |
8563 |
( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) & |
|
8564 |
... |
|
4189 | 8565 |
(!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn)) |
4035 | 8566 |
) |
8567 |
||
4930
89271bc4e7ed
extended addsplits and delsplits to handle also split rules for assumptions
oheimb
parents:
4915
diff
changeset
|
8568 |
and a theorem `split_t_case_asm' of the form |
4189 | 8569 |
|
8570 |
P(t_case f1 ... fn x) = |
|
8571 |
~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) | |
|
8572 |
... |
|
8573 |
(? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn)) |
|
8574 |
) |
|
4930
89271bc4e7ed
extended addsplits and delsplits to handle also split rules for assumptions
oheimb
parents:
4915
diff
changeset
|
8575 |
which can be added to a simpset via `addsplits'. The existing theorems |
89271bc4e7ed
extended addsplits and delsplits to handle also split rules for assumptions
oheimb
parents:
4915
diff
changeset
|
8576 |
expand_list_case and expand_option_case have been renamed to |
89271bc4e7ed
extended addsplits and delsplits to handle also split rules for assumptions
oheimb
parents:
4915
diff
changeset
|
8577 |
split_list_case and split_option_case. |
4189 | 8578 |
|
4361 | 8579 |
* HOL/Arithmetic: |
8580 |
- `pred n' is automatically converted to `n-1'. |
|
8581 |
Users are strongly encouraged not to use `pred' any longer, |
|
8582 |
because it will disappear altogether at some point. |
|
8583 |
- Users are strongly encouraged to write "0 < n" rather than |
|
8584 |
"n ~= 0". Theorems and proof tools have been modified towards this |
|
8585 |
`standard'. |
|
4357 | 8586 |
|
4502 | 8587 |
* HOL/Lists: |
8588 |
the function "set_of_list" has been renamed "set" (and its theorems too); |
|
8589 |
the function "nth" now takes its arguments in the reverse order and |
|
8590 |
has acquired the infix notation "!" as in "xs!n". |
|
3570 | 8591 |
|
4154 | 8592 |
* HOL/Set: UNIV is now a constant and is no longer translated to Compl{}; |
8593 |
||
8594 |
* HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its |
|
8595 |
specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x); |
|
8596 |
||
4575 | 8597 |
* HOL/record: extensible records with schematic structural subtyping |
8598 |
(single inheritance); EXPERIMENTAL version demonstrating the encoding, |
|
8599 |
still lacks various theorems and concrete record syntax; |
|
8600 |
||
4125 | 8601 |
|
3715 | 8602 |
*** HOLCF *** |
3535 | 8603 |
|
4125 | 8604 |
* removed "axioms" and "generated by" sections; |
8605 |
||
4123 | 8606 |
* replaced "ops" section by extended "consts" section, which is capable of |
4125 | 8607 |
handling the continuous function space "->" directly; |
8608 |
||
8609 |
* domain package: |
|
8610 |
. proves theorems immediately and stores them in the theory, |
|
8611 |
. creates hierachical name space, |
|
8612 |
. now uses normal mixfix annotations (instead of cinfix...), |
|
8613 |
. minor changes to some names and values (for consistency), |
|
8614 |
. e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas, |
|
8615 |
. separator between mutual domain defs: changed "," to "and", |
|
8616 |
. improved handling of sort constraints; now they have to |
|
8617 |
appear on the left-hand side of the equations only; |
|
4123 | 8618 |
|
8619 |
* fixed LAM <x,y,zs>.b syntax; |
|
3567 | 8620 |
|
3744 | 8621 |
* added extended adm_tac to simplifier in HOLCF -- can now discharge |
8622 |
adm (%x. P (t x)), where P is chainfinite and t continuous; |
|
3579 | 8623 |
|
8624 |
||
3719 | 8625 |
*** FOL and ZF *** |
8626 |
||
5726 | 8627 |
* FOL: there is a new splitter `split_asm_tac' that can be used e.g. |
4189 | 8628 |
with `addloop' of the simplifier to faciliate case splitting in premises. |
8629 |
||
3744 | 8630 |
* qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as |
8631 |
in HOL, they strip ALL and --> from proved theorems; |
|
8632 |
||
3719 | 8633 |
|
3579 | 8634 |
|
3006 | 8635 |
New in Isabelle94-8 (May 1997) |
8636 |
------------------------------ |
|
2654 | 8637 |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8638 |
*** General Changes *** |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8639 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8640 |
* new utilities to build / run / maintain Isabelle etc. (in parts |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8641 |
still somewhat experimental); old Makefiles etc. still functional; |
2971 | 8642 |
|
3205 | 8643 |
* new 'Isabelle System Manual'; |
8644 |
||
2825 | 8645 |
* INSTALL text, together with ./configure and ./build scripts; |
2773 | 8646 |
|
3006 | 8647 |
* reimplemented type inference for greater efficiency, better error |
8648 |
messages and clean internal interface; |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8649 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8650 |
* prlim command for dealing with lots of subgoals (an easier way of |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8651 |
setting goals_limit); |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8652 |
|
3006 | 8653 |
|
8654 |
*** Syntax *** |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8655 |
|
3116 | 8656 |
* supports alternative (named) syntax tables (parser and pretty |
8657 |
printer); internal interface is provided by add_modesyntax(_i); |
|
8658 |
||
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8659 |
* Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8660 |
be used in conjunction with the Isabelle symbol font; uses the |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8661 |
"symbols" syntax table; |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8662 |
|
2705 | 8663 |
* added token_translation interface (may translate name tokens in |
2756 | 8664 |
arbitrary ways, dependent on their type (free, bound, tfree, ...) and |
3116 | 8665 |
the current print_mode); IMPORTANT: user print translation functions |
8666 |
are responsible for marking newly introduced bounds |
|
8667 |
(Syntax.mark_boundT); |
|
2705 | 8668 |
|
2730 | 8669 |
* token translations for modes "xterm" and "xterm_color" that display |
3006 | 8670 |
names in bold, underline etc. or colors (which requires a color |
8671 |
version of xterm); |
|
2730 | 8672 |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8673 |
* infixes may now be declared with names independent of their syntax; |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8674 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8675 |
* added typed_print_translation (like print_translation, but may |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8676 |
access type of constant); |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8677 |
|
3006 | 8678 |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8679 |
*** Classical Reasoner *** |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8680 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8681 |
Blast_tac: a new tactic! It is often more powerful than fast_tac, but has |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8682 |
some limitations. Blast_tac... |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8683 |
+ ignores addss, addbefore, addafter; this restriction is intrinsic |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8684 |
+ ignores elimination rules that don't have the correct format |
5726 | 8685 |
(the conclusion MUST be a formula variable) |
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8686 |
+ ignores types, which can make HOL proofs fail |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8687 |
+ rules must not require higher-order unification, e.g. apply_type in ZF |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8688 |
[message "Function Var's argument not a bound variable" relates to this] |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8689 |
+ its proof strategy is more general but can actually be slower |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8690 |
|
3107 | 8691 |
* substitution with equality assumptions no longer permutes other |
8692 |
assumptions; |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8693 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8694 |
* minor changes in semantics of addafter (now called addaltern); renamed |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8695 |
setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper |
3107 | 8696 |
(and access functions for it); |
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8697 |
|
5726 | 8698 |
* improved combination of classical reasoner and simplifier: |
3317 | 8699 |
+ functions for handling clasimpsets |
8700 |
+ improvement of addss: now the simplifier is called _after_ the |
|
8701 |
safe steps. |
|
8702 |
+ safe variant of addss called addSss: uses safe simplifications |
|
5726 | 8703 |
_during_ the safe steps. It is more complete as it allows multiple |
3317 | 8704 |
instantiations of unknowns (e.g. with slow_tac). |
3006 | 8705 |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8706 |
*** Simplifier *** |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8707 |
|
3006 | 8708 |
* added interface for simplification procedures (functions that |
8709 |
produce *proven* rewrite rules on the fly, depending on current |
|
8710 |
redex); |
|
8711 |
||
8712 |
* ordering on terms as parameter (used for ordered rewriting); |
|
8713 |
||
3107 | 8714 |
* new functions delcongs, deleqcongs, and Delcongs. richer rep_ss; |
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8715 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8716 |
* the solver is now split into a safe and an unsafe part. |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8717 |
This should be invisible for the normal user, except that the |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8718 |
functions setsolver and addsolver have been renamed to setSolver and |
3107 | 8719 |
addSolver; added safe_asm_full_simp_tac; |
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8720 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8721 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8722 |
*** HOL *** |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8723 |
|
3042 | 8724 |
* a generic induction tactic `induct_tac' which works for all datatypes and |
3107 | 8725 |
also for type `nat'; |
3042 | 8726 |
|
3316 | 8727 |
* a generic case distinction tactic `exhaust_tac' which works for all |
8728 |
datatypes and also for type `nat'; |
|
8729 |
||
8730 |
* each datatype comes with a function `size'; |
|
8731 |
||
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8732 |
* patterns in case expressions allow tuple patterns as arguments to |
3107 | 8733 |
constructors, for example `case x of [] => ... | (x,y,z)#ps => ...'; |
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8734 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8735 |
* primrec now also works with type nat; |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8736 |
|
3338 | 8737 |
* recdef: a new declaration form, allows general recursive functions to be |
8738 |
defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify. |
|
8739 |
||
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8740 |
* the constant for negation has been renamed from "not" to "Not" to |
3107 | 8741 |
harmonize with FOL, ZF, LK, etc.; |
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8742 |
|
3107 | 8743 |
* HOL/ex/LFilter theory of a corecursive "filter" functional for |
8744 |
infinite lists; |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8745 |
|
3227 | 8746 |
* HOL/Modelcheck demonstrates invocation of model checker oracle; |
8747 |
||
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8748 |
* HOL/ex/Ring.thy declares cring_simp, which solves equational |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8749 |
problems in commutative rings, using axiomatic type classes for + and *; |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8750 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8751 |
* more examples in HOL/MiniML and HOL/Auth; |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8752 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8753 |
* more default rewrite rules for quantifiers, union/intersection; |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8754 |
|
3321 | 8755 |
* a new constant `arbitrary == @x.False'; |
8756 |
||
3107 | 8757 |
* HOLCF/IOA replaces old HOL/IOA; |
8758 |
||
5726 | 8759 |
* HOLCF changes: derived all rules and arities |
8760 |
+ axiomatic type classes instead of classes |
|
2653
f1a6997cdc06
described changes for HOLCF-Version without rules and arities
slotosch
parents:
2649
diff
changeset
|
8761 |
+ typedef instead of faking type definitions |
2747 | 8762 |
+ eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc. |
2730 | 8763 |
+ new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po |
2653
f1a6997cdc06
described changes for HOLCF-Version without rules and arities
slotosch
parents:
2649
diff
changeset
|
8764 |
+ eliminated the types void, one, tr |
f1a6997cdc06
described changes for HOLCF-Version without rules and arities
slotosch
parents:
2649
diff
changeset
|
8765 |
+ use unit lift and bool lift (with translations) instead of one and tr |
f1a6997cdc06
described changes for HOLCF-Version without rules and arities
slotosch
parents:
2649
diff
changeset
|
8766 |
+ eliminated blift from Lift3.thy (use Def instead of blift) |
3107 | 8767 |
all eliminated rules are derived as theorems --> no visible changes ; |
2649 | 8768 |
|
3006 | 8769 |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
8770 |
*** ZF *** |
2553 | 8771 |
|
2865 | 8772 |
* ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default |
8773 |
rewrite rule; this may affect some proofs. eq_cs is gone but can be put back |
|
8774 |
as ZF_cs addSIs [equalityI]; |
|
2553 | 8775 |
|
2554 | 8776 |
|
2732 | 8777 |
|
2553 | 8778 |
New in Isabelle94-7 (November 96) |
8779 |
--------------------------------- |
|
8780 |
||
8781 |
* allowing negative levels (as offsets) in prlev and choplev; |
|
8782 |
||
2554 | 8783 |
* super-linear speedup for large simplifications; |
8784 |
||
8785 |
* FOL, ZF and HOL now use miniscoping: rewriting pushes |
|
8786 |
quantifications in as far as possible (COULD MAKE EXISTING PROOFS |
|
8787 |
FAIL); can suppress it using the command Delsimps (ex_simps @ |
|
8788 |
all_simps); De Morgan laws are also now included, by default; |
|
8789 |
||
8790 |
* improved printing of ==> : ~: |
|
8791 |
||
8792 |
* new object-logic "Sequents" adds linear logic, while replacing LK |
|
8793 |
and Modal (thanks to Sara Kalvala); |
|
8794 |
||
8795 |
* HOL/Auth: correctness proofs for authentication protocols; |
|
8796 |
||
8797 |
* HOL: new auto_tac combines rewriting and classical reasoning (many |
|
8798 |
examples on HOL/Auth); |
|
8799 |
||
8800 |
* HOL: new command AddIffs for declaring theorems of the form P=Q to |
|
8801 |
the rewriter and classical reasoner simultaneously; |
|
8802 |
||
8803 |
* function uresult no longer returns theorems in "standard" format; |
|
8804 |
regain previous version by: val uresult = standard o uresult; |
|
8805 |
||
8806 |
||
8807 |
||
8808 |
New in Isabelle94-6 |
|
8809 |
------------------- |
|
8810 |
||
8811 |
* oracles -- these establish an interface between Isabelle and trusted |
|
8812 |
external reasoners, which may deliver results as theorems; |
|
8813 |
||
8814 |
* proof objects (in particular record all uses of oracles); |
|
8815 |
||
8816 |
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset; |
|
8817 |
||
8818 |
* "constdefs" section in theory files; |
|
8819 |
||
8820 |
* "primrec" section (HOL) no longer requires names; |
|
8821 |
||
8822 |
* internal type "tactic" now simply "thm -> thm Sequence.seq"; |
|
8823 |
||
8824 |
||
8825 |
||
8826 |
New in Isabelle94-5 |
|
8827 |
------------------- |
|
8828 |
||
8829 |
* reduced space requirements; |
|
8830 |
||
8831 |
* automatic HTML generation from theories; |
|
8832 |
||
8833 |
* theory files no longer require "..." (quotes) around most types; |
|
8834 |
||
8835 |
* new examples, including two proofs of the Church-Rosser theorem; |
|
8836 |
||
8837 |
* non-curried (1994) version of HOL is no longer distributed; |
|
8838 |
||
2553 | 8839 |
|
2557 | 8840 |
|
8841 |
New in Isabelle94-4 |
|
8842 |
------------------- |
|
8843 |
||
2747 | 8844 |
* greatly reduced space requirements; |
2557 | 8845 |
|
8846 |
* theory files (.thy) no longer require \...\ escapes at line breaks; |
|
8847 |
||
5726 | 8848 |
* searchable theorem database (see the section "Retrieving theorems" on |
2557 | 8849 |
page 8 of the Reference Manual); |
8850 |
||
8851 |
* new examples, including Grabczewski's monumental case study of the |
|
8852 |
Axiom of Choice; |
|
8853 |
||
8854 |
* The previous version of HOL renamed to Old_HOL; |
|
8855 |
||
5726 | 8856 |
* The new version of HOL (previously called CHOL) uses a curried syntax |
2557 | 8857 |
for functions. Application looks like f a b instead of f(a,b); |
8858 |
||
8859 |
* Mutually recursive inductive definitions finally work in HOL; |
|
8860 |
||
8861 |
* In ZF, pattern-matching on tuples is now available in all abstractions and |
|
8862 |
translates to the operator "split"; |
|
8863 |
||
8864 |
||
8865 |
||
8866 |
New in Isabelle94-3 |
|
8867 |
------------------- |
|
8868 |
||
5726 | 8869 |
* new infix operator, addss, allowing the classical reasoner to |
2557 | 8870 |
perform simplification at each step of its search. Example: |
5726 | 8871 |
fast_tac (cs addss ss) |
2557 | 8872 |
|
5726 | 8873 |
* a new logic, CHOL, the same as HOL, but with a curried syntax |
8874 |
for functions. Application looks like f a b instead of f(a,b). Also pairs |
|
2557 | 8875 |
look like (a,b) instead of <a,b>; |
8876 |
||
8877 |
* PLEASE NOTE: CHOL will eventually replace HOL! |
|
8878 |
||
8879 |
* In CHOL, pattern-matching on tuples is now available in all abstractions. |
|
8880 |
It translates to the operator "split". A new theory of integers is available; |
|
8881 |
||
8882 |
* In ZF, integer numerals now denote two's-complement binary integers. |
|
8883 |
Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML; |
|
8884 |
||
5726 | 8885 |
* Many new examples: I/O automata, Church-Rosser theorem, equivalents |
2557 | 8886 |
of the Axiom of Choice; |
8887 |
||
8888 |
||
8889 |
||
8890 |
New in Isabelle94-2 |
|
8891 |
------------------- |
|
8892 |
||
5726 | 8893 |
* Significantly faster resolution; |
2557 | 8894 |
|
8895 |
* the different sections in a .thy file can now be mixed and repeated |
|
8896 |
freely; |
|
8897 |
||
8898 |
* Database of theorems for FOL, HOL and ZF. New |
|
8899 |
commands including qed, qed_goal and bind_thm store theorems in the database. |
|
8900 |
||
8901 |
* Simple database queries: return a named theorem (get_thm) or all theorems of |
|
8902 |
a given theory (thms_of), or find out what theory a theorem was proved in |
|
8903 |
(theory_of_thm); |
|
8904 |
||
8905 |
* Bugs fixed in the inductive definition and datatype packages; |
|
8906 |
||
8907 |
* The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs |
|
8908 |
and HOL_dup_cs obsolete; |
|
8909 |
||
8910 |
* Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1 |
|
8911 |
have been removed; |
|
8912 |
||
8913 |
* Simpler definition of function space in ZF; |
|
8914 |
||
8915 |
* new results about cardinal and ordinal arithmetic in ZF; |
|
8916 |
||
8917 |
* 'subtype' facility in HOL for introducing new types as subsets of existing |
|
8918 |
types; |
|
8919 |
||
24213 | 8920 |
:mode=text:wrap=hard:maxLineLen=72: |