author  oheimb 
Tue, 20 Feb 2001 18:47:34 +0100  
changeset 11169  98c2f741e32b 
parent 11130  d14fd58615b9 
child 11172  3c82b641b642 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

11169
98c2f741e32b
made split_all_tac safe introducing safe_full_simp_tac, EXISTING PROOFS MAY FAIL
oheimb
parents:
11130
diff
changeset

4 
* HOL: made split_all_tac safe. EXISTING PROOFS MAY FAIL OR LOOP, so in this 
98c2f741e32b
made split_all_tac safe introducing safe_full_simp_tac, EXISTING PROOFS MAY FAIL
oheimb
parents:
11130
diff
changeset

5 
(rare) case use delSWrapper "split_all_tac" addSbefore 
98c2f741e32b
made split_all_tac safe introducing safe_full_simp_tac, EXISTING PROOFS MAY FAIL
oheimb
parents:
11130
diff
changeset

6 
("unsafe_split_all_tac", unsafe_split_all_tac) 
98c2f741e32b
made split_all_tac safe introducing safe_full_simp_tac, EXISTING PROOFS MAY FAIL
oheimb
parents:
11130
diff
changeset

7 

98c2f741e32b
made split_all_tac safe introducing safe_full_simp_tac, EXISTING PROOFS MAY FAIL
oheimb
parents:
11130
diff
changeset

8 

11062  9 
New in Isabelle992 (February 2001) 
10 
 

11 

10224  12 
*** Overview of INCOMPATIBILITIES *** 
13 

11043
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset

14 
* HOL: inductive package no longer splits induction rule aggressively, 
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset

15 
but only as far as specified by the introductions given; the old 
11130  16 
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

17 
'split_rule (complete)'; 
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset

18 

10998  19 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
20 
gfp_Tarski to gfp_unfold; 

10224  21 

10288  22 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
23 

10858  24 
* HOL: infix "dvd" now has priority 50 rather than 70 (because it is a 
25 
relation); infix "^^" has been renamed "``"; infix "``" has been 

26 
renamed "`"; "univalent" has been renamed "single_valued"; 

10793  27 

10998  28 
* HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse" 
29 
operation; 

30 

10868  31 
* HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>; 
10856  32 

10391  33 
* Isar: 'obtain' no longer declares "that" fact as simp/intro; 
34 

10401
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

35 
* Isar/HOL: method 'induct' now handles nonatomic goals; as a 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

36 
consequence, it is no longer monotonic wrt. the local goal context 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

37 
(which is now passed through the inductive cases); 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

38 

10976
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset

39 
* Document preparation: renamed standard symbols \<ll> to \<lless> and 
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset

40 
\<gg> to \<ggreater>; 
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset

41 

10224  42 

10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

43 
*** Document preparation *** 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

44 

10858  45 
* \isabellestyle{NAME} selects version of Isabelle output (currently 
46 
available: are "it" for near mathmode beststyle output, "sl" for 

47 
slanted text style, and "tt" for plain typewriter; if no 

48 
\isabellestyle command is given, output is according to slanted 

49 
typewriter); 

50 

10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

51 
* 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

52 
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

53 

10858  54 
* some more standard symbols; see Appendix A of the system manual for 
11062  55 
the complete list of symbols defined in isabellesym.sty; 
10858  56 

10998  57 
* improved isabelle style files; more abstract symbol implementation 
58 
(should now use \isamath{...} and \isatext{...} in custom symbol 

59 
definitions); 

60 

10634  61 
* antiquotation @{goals} and @{subgoals} for output of *dynamic* goals 
62 
state; Note that presentation of goal states does not conform to 

63 
actual humanreadable proof documents. Please do not include goal 

64 
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

65 

11062  66 
* proper indentation of antiquoted output with proportional LaTeX 
67 
fonts; 

10862  68 

11050
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset

69 
* no_document ML operator temporarily disables LaTeX document 
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset

70 
generation; 
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset

71 

11062  72 
* isatool unsymbolize tunes sources for plain ASCII communication; 
73 

10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

74 

10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

75 
*** Isar *** 
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

76 

10547  77 
* Pure: Isar now suffers initial goal statements to contain unbound 
78 
schematic variables (this does not conform to actual readable proof 

79 
documents, due to unpredictable outcome and noncompositional proof 

80 
checking); users who know what they are doing may use schematic goals 

81 
for Prologstyle synthesis of proven results; 

82 

10391  83 
* Pure: assumption method (an implicit finishing) now handles actual 
84 
rules as well; 

85 

86 
* Pure: improved 'obtain'  moved to Pure, insert "that" into 

87 
initial goal, declare "that" only as Pure intro (only for single 

88 
steps); the "that" rule assumption may now be involved in implicit 

89 
finishing, thus ".." becomes a feasible for trivial obtains; 

90 

91 
* Pure: default proof step now includes 'intro_classes'; thus trivial 

92 
instance proofs may be performed by ".."; 

93 

94 
* Pure: ?thesis / ?this / "..." now work for pure metalevel 

95 
statements as well; 

10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

96 

11097  97 
* Pure: more robust selection of calculational rules; 
98 

10858  99 
* Pure: the builtin notion of 'finished' goal now includes the ==refl 
100 
rule (as well as the assumption rule); 

101 

102 
* Pure: 'thm_deps' command visualizes dependencies of theorems and 

103 
lemmas, using the graph browser tool; 

104 

10944  105 
* Pure: predict failure of "show" in interactive mode; 
106 

11016
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset

107 
* Pure: 'thms_containing' now takes actual terms as arguments; 
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset

108 

10401
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

109 
* HOL: improved method 'induct'  now handles nonatomic goals 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

110 
(potential INCOMPATIBILITY); tuned error handling; 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

111 

10557  112 
* HOL: cases and induct rules now provide explicit hints about the 
10547  113 
number of facts to be consumed (0 for "type" and 1 for "set" rules); 
114 
any remaining facts are inserted into the goal verbatim; 

115 

10858  116 
* HOL: local contexts (aka cases) may now contain term bindings as 
117 
well; the 'cases' and 'induct' methods new provide a ?case binding for 

118 
the result to be shown in each case; 

119 

10770  120 
* HOL: added 'recdef_tc' command; 
121 

11016
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset

122 
* isatool convert assists in eliminating legacy ML scripts; 
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset

123 

10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

124 

10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

125 
*** HOL *** 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

126 

87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

127 
* 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

128 
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

129 
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

130 
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While 
10337  131 
(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

132 

10966  133 
* HOL/Unix: "Some aspects of Unix filesystem security", a typical 
134 
modelling and verification task performed in Isabelle/HOL + 

135 
Isabelle/Isar + Isabelle document preparation (by Markus Wenzel). 

136 

11094  137 
* HOL/Algebra: special summation operator SUM no longer exists, it has 
138 
been replaced by setsum; infix 'assoc' now has priority 50 (like 

139 
'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to 

140 
'domain', this makes the theory consistent with mathematical 

141 
literature; 

142 

10514  143 
* HOL basics: added overloaded operations "inverse" and "divide" 
10726  144 
(infix "/"), syntax for generic "abs" operation, generic summation 
11094  145 
operator \<Sum>; 
10452
abeefb0a79ae
* added overloaded operations "inverse" and "divide" (infix "/");
wenzelm
parents:
10428
diff
changeset

146 

10391  147 
* HOL/typedef: simplified package, provide more useful rules (see also 
148 
HOL/subset.thy); 

149 

10915
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

150 
* HOL/datatype: induction rule for arbitrarily branching datatypes is 
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

151 
now expressed as a proper nested rule (oldstyle tactic scripts may 
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

152 
require atomize_strip_tac to cope with nonatomic premises); 
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

153 

6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

154 
* 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

155 
to "split_conv" (old name still available for compatibility); 
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

156 

6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

157 
* 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

158 
rules with string literals); 
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

159 

10944  160 
* HOLHyperreal: a new target, extending HOLReal with the hyperreals 
161 
and Fleuriot's mechanization of analysis; 

10756  162 

11094  163 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  164 

10858  165 

10474  166 
*** CTT *** 
167 

10547  168 
* CTT: xsymbol support for Pi, Sigma, >, : (membership); note that 
169 
"lam" is displayed as TWO lambdasymbols 

10474  170 

10547  171 
* CTT: theory Main now available, containing everything (that is, Bool 
172 
and Arith); 

173 

10474  174 

10391  175 
*** General *** 
176 

10547  177 
* Pure: the Simplifier has been implemented properly as a derived rule 
178 
outside of the actual kernel (at last!); the overall performance 

179 
penalty in practical applications is about 50%, while reliability of 

180 
the Isabelle inference kernel has been greatly improved; 

181 

11112  182 
* print modes "brackets" and "no_brackets" control output of nested => 
183 
(types) and ==> (props); the default behaviour is "brackets"; 

184 

10391  185 
* Provers: fast_tac (and friends) now handle actual objectlogic rules 
186 
as assumptions as well; 

187 

11124  188 
* system: support Poly/ML 4.0; 
189 

190 
* system: isatool install handles KDE version 1 or 2; 

191 

10391  192 

10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

193 

10103  194 
New in Isabelle991 (October 2000) 
195 
 

8015  196 

10003  197 
*** Overview of INCOMPATIBILITIES *** 
8014  198 

8848  199 
* HOL: simplification of natural numbers is much changed; to partly 
200 
recover the old behaviour (e.g. to prevent n+n rewriting to #2*n) 

201 
issue the following ML commands: 

202 

203 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

204 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  205 

10129  206 
* HOL: simplification no longer dives into caseexpressions; this is 
207 
controlled by "t.weak_case_cong" for each datatype t; 

10003  208 

209 
* HOL: nat_less_induct renamed to less_induct; 

210 

211 
* HOL: systematic renaming of the SOME (Eps) rules, may use isatool 

212 
fixsome to patch .thy and .ML sources automatically; 

8967  213 

10003  214 
select_equality > some_equality 
215 
select_eq_Ex > some_eq_ex 

216 
selectI2EX > someI2_ex 

217 
selectI2 > someI2 

218 
selectI > someI 

219 
select1_equality > some1_equality 

220 
Eps_sym_eq > some_sym_eq_trivial 

221 
Eps_eq > some_eq_trivial 

222 

223 
* HOL: exhaust_tac on datatypes superceded by new generic case_tac; 

224 

225 
* HOL: removed obsolete theorem binding expand_if (refer to split_if 

226 
instead); 

227 

228 
* HOL: the recursion equations generated by 'recdef' are now called 

229 
f.simps instead of f.rules; 

230 

231 
* HOL: qed_spec_mp now also handles bounded ALL as well; 

232 

233 
* HOL: 0 is now overloaded, so the type constraint ":: nat" may 

234 
sometimes be needed; 

235 

236 
* HOL: the constant for "f``x" is now "image" rather than "op ``"; 

8014  237 

10065  238 
* HOL: the constant for "f``x" is now "vimage" rather than "op ``"; 
239 

9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset

240 
* 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

241 
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

242 
now "<*lex*>" instead of "**"; 
8705  243 

10003  244 
* HOL: theory Sexp is now in HOL/Induct examples (it used to be part 
245 
of main HOL, but was unused); better use HOL's datatype package; 

9971  246 

10137
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

247 
* HOL: removed "symbols" syntax for constant "override" of theory Map; 
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

248 
the old syntax may be recovered as follows: 
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

249 

d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

250 
syntax (symbols) 
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

251 
override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)" 
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

252 
(infixl "\\<oplus>" 100) 
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

253 

8848  254 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
255 

8887
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset

256 
* 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

257 
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

258 
internally; 
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset

259 

10003  260 
* HOL and ZF: syntax for quotienting wrt an equivalence relation 
261 
changed from A/r to A//r; 

9908  262 

10003  263 
* ZF: new treatment of arithmetic (nat & int) may break some old 
264 
proofs; 

8921
7c04c98132c4
* Pure: changed syntax of local blocks from {{ }} to { };
wenzelm
parents:
8887
diff
changeset

265 

10003  266 
* Isar: renamed some attributes (RS > THEN, simplify > simplified, 
267 
rulify > rule_format, elimify > elim_format, ...); 

9542  268 

9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset

269 
* Isar/Provers: intro/elim/dest attributes changed; renamed 
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset

270 
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one 
9937  271 
should have to change intro!! to intro? only); replaced "delrule" by 
272 
"rule del"; 

9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset

273 

9612  274 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
275 

9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset

276 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  277 

10003  278 
* LaTeX document preparation: several changes of isabelle.sty (see 
279 
lib/texinputs); 

8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset

280 

8014  281 

8487  282 
*** Document preparation *** 
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

283 

9198
0ab3c81e9425
* formal comments (text blocks etc.) in newstyle theories may now
wenzelm
parents:
9185
diff
changeset

284 
* formal comments (text blocks etc.) in newstyle theories may now 
9753  285 
contain antiquotations of thm/prop/term/typ/text to be presented 
286 
according to latex print mode; concrete syntax is like this: 

287 
@{term[show_types] "f(x) = a + x"}; 

9198
0ab3c81e9425
* formal comments (text blocks etc.) in newstyle theories may now
wenzelm
parents:
9185
diff
changeset

288 

8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

289 
* isatool mkdir provides easy setup of Isabelle session directories, 
8518  290 
including proper document sources; 
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

291 

a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

292 
* generated LaTeX sources are now deleted after successful run 
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

293 
(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

294 
of isatool usedir; 
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

295 

8566  296 
* isatool usedir D now lets isatool latex o sty update the Isabelle 
10003  297 
style files, achieving selfcontained LaTeX sources and simplifying 
298 
LaTeX debugging; 

8566  299 

8518  300 
* oldstyle theories now produce (crude) LaTeX output as well; 
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

301 

9057
af1ca1acf292
* browser info session directories are now selfcontained (may be put
wenzelm
parents:
9052
diff
changeset

302 
* browser info session directories are now selfcontained (may be put 
9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset

303 
on WWW server seperately); improved graphs of nested sessions; removed 
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset

304 
graph for 'all sessions'; 
9057
af1ca1acf292
* browser info session directories are now selfcontained (may be put
wenzelm
parents:
9052
diff
changeset

305 

10003  306 
* several improvements in isabelle style files; \isabellestyle{it} 
307 
produces fake math mode output; \isamarkupheader is now \section by 

308 
default; see lib/texinputs/isabelle.sty etc.; 

9489
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

309 

8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

310 

8184  311 
*** Isar *** 
312 

10003  313 
* Isar/Pure: local results and corresponding term bindings are now 
314 
subject to HindleyMilner polymorphism (similar to ML); this 

315 
accommodates incremental typeinference very nicely; 

8283
0a319c5746eb
* Pure now provides its own version of intro/elim/dest attributes;
wenzelm
parents:
8271
diff
changeset

316 

10003  317 
* Isar/Pure: new derived language element 'obtain' supports 
318 
generalized existence reasoning; 

8621
8ba0f90f6f35
* Isar/Pure: local results and corresponding term bindings are now
wenzelm
parents:
8603
diff
changeset

319 

10003  320 
* Isar/Pure: new calculational elements 'moreover' and 'ultimately' 
321 
support accumulation of results, without applying any rules yet; 

322 
useful to collect intermediate results without explicit name 

323 
references, and for use with transitivity rules with more than 2 

324 
premises; 

8184  325 

10003  326 
* Isar/Pure: scalable support for caseanalysis type proofs: new 
327 
'case' language element refers to local contexts symbolically, as 

328 
produced by certain proof methods; internally, case names are attached 

329 
to theorems as "tags"; 

8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset

330 

10003  331 
* Isar/Pure: theory command 'hide' removes declarations from 
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset

332 
class/type/const name spaces; 
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset

333 

10003  334 
* 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

335 
indicate potential overloading; 
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset

336 

10003  337 
* 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

338 

10003  339 
* Isar/Pure: syntax of sorts made 'inner', i.e. have to write 
340 
"{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

341 

10003  342 
* Isar/Pure now provides its own version of intro/elim/dest 
343 
attributes; useful for building new logics, but beware of confusion 

344 
with the version in Provers/classical; 

9612  345 

10003  346 
* Isar/Pure: the local context of (nonatomic) goals is provided via 
347 
case name 'antecedent'; 

8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset

348 

10003  349 
* Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms 
350 
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

351 

10003  352 
* Isar/Pure: theory command 'method_setup' provides a simple interface 
353 
for definining proof methods in ML; 

9612  354 

10003  355 
* 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

356 
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

357 
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

358 
replaced "delrule" by "rule del"; 
8283
0a319c5746eb
* Pure now provides its own version of intro/elim/dest attributes;
wenzelm
parents:
8271
diff
changeset

359 

10003  360 
* Isar/Provers: new 'hypsubst' method, plain 'subst' method and 
361 
'symmetric' attribute (the latter supercedes [RS sym]); 

362 

363 
* Isar/Provers: splitter support (via 'split' attribute and 'simp' 

364 
method modifier); 'simp' method: 'only:' modifier removes loopers as 

365 
well (including splits); 

366 

367 
* Isar/Provers: Simplifier and Classical methods now support all kind 

368 
of modifiers used in the past, including 'cong', 'iff', etc. 

369 

370 
* Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination 

371 
of Simplifier and Classical reasoner); 

372 

373 
* Isar/HOL: new proof method 'cases' and improved version of 'induct' 

374 
now support named cases; major packages (inductive, datatype, primrec, 

375 
recdef) support case names and properly name parameters; 

9612  376 

10003  377 
* Isar/HOL: new transitivity rules for substitution in inequalities  
378 
monotonicity conditions are extracted to be proven at end of 

379 
calculations; 

380 

381 
* Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof 

382 
method anyway; 

383 

384 
* Isar/HOL: removed old expand_if = split_if; theorems if_splits = 

385 
split_if split_if_asm; datatype package provides theorems foo.splits = 

386 
foo.split foo.split_asm for each datatype; 

387 

388 
* Isar/HOL: tuned inductive package, rename "intrs" to "intros" 

389 
(potential INCOMPATIBILITY), emulation of mk_cases feature for proof 

390 
scripts: new 'inductive_cases' command and 'ind_cases' method; (Note: 

391 
use "(cases (simplified))" method in proper proof texts); 

392 

393 
* Isar/HOL: added global 'arith_split' attribute for 'arith' method; 

394 

395 
* Isar: names of theorems etc. may be natural numbers as well; 

396 

397 
* Isar: 'pr' command: optional arguments for goals_limit and 

9724
2030c5d63741
* 'pr' command: optional argument for ProofContext.prems_limit;
wenzelm
parents:
9709
diff
changeset

398 
ProofContext.prems_limit; no longer prints theory contexts, but only 
2030c5d63741
* 'pr' command: optional argument for ProofContext.prems_limit;
wenzelm
parents:
9709
diff
changeset

399 
proof states; 
8487  400 

10003  401 
* Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit 
8518  402 
additional print modes to be specified; e.g. "pr(latex)" will print 
403 
proof state according to the Isabelle LaTeX style; 

8487  404 

10003  405 
* Isar: improved support for emulating tactic scripts, including proof 
9612  406 
methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac', 
407 
'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac' 

408 
(for HOL datatypes); 

8534  409 

10003  410 
* Isar: simplified (more robust) goal selection of proof methods: 1st 
411 
goal, all goals, or explicit goal specifier (tactic emulation); thus 

412 
'proof method scripts' have to be in depthfirst order; 

8673
987ea1a559d0
Isar: simplified (more robust) goal selection of proof methods;
wenzelm
parents:
8655
diff
changeset

413 

10003  414 
* 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

415 

10003  416 
* Isar: removed 'help' command, which hasn't been too helpful anyway; 
417 
should instead use individual commands for printing items 

418 
(print_commands, print_methods etc.); 

9224
0da360494917
* Isar: removed 'help' command, which hasn't been too helpful anyway;
wenzelm
parents:
9198
diff
changeset

419 

10003  420 
* Isar: added 'nothing'  the empty list of theorems; 
9239  421 

8184  422 

8014  423 
*** HOL *** 
424 

10080  425 
* HOL/MicroJava: formalization of a fragment of Java, together with a 
426 
corresponding virtual machine and a specification of its bytecode 

427 
verifier and a lightweight bytecode verifier, including proofs of 

428 
typesafety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and 

429 
Cornelia Pusch (see also the homepage of project Bali at 

430 
http://isabelle.in.tum.de/Bali/); 

431 

8518  432 
* HOL/Algebra: new theory of rings and univariate polynomials, by 
433 
Clemens Ballarin; 

8014  434 

10157
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

435 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  436 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
437 
Rasmussen; 

8570  438 

10157
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

439 
* 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

440 
structures, including duals, properties of bounds versus algebraic 
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

441 
laws, lattice operations versus settheoretic ones, the KnasterTarski 
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

442 
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

443 
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

444 
mathematicsstyle proof in Isabelle/Isar; by Markus Wenzel; 
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

445 

10003  446 
* HOL/Prolog: a (barebones) implementation of LambdaProlog, by David 
447 
von Oheimb; 

9542  448 

10164
c240747082aa
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm
parents:
10157
diff
changeset

449 
* 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

450 
recursive procedures, by David von Oheimb; 
c240747082aa
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm
parents:
10157
diff
changeset

451 

10003  452 
* HOL/Lambda: converted into newstyle theory and document; 
9542  453 

10003  454 
* HOL/ex/Multiquote: example of multiple nested quotations and 
455 
antiquotations  basically a generalized version of deBruijn 

456 
representation; very useful in avoiding lifting of operations; 

8848  457 

9612  458 
* HOL/record: added general record equality rule to simpset; fixed 
459 
selectupdate simplification procedure to handle extended records as 

460 
well; admit "r" as field name; 

9542  461 

8967  462 
* HOL: 0 is now overloaded over the new sort "zero", allowing its use with 
463 
other numeric types and also as the identity of groups, rings, etc.; 

464 

465 
* HOL: new axclass plus_ac0 for addition with the AClaws and 0 as identity. 

466 
Types nat and int belong to this axclass; 

467 

10003  468 
* HOL: greatly improved simplification involving numerals of type nat, int, real: 
8788  469 
(i + #8 + j) = Suc k simplifies to #7 + (i + j) = k 
8832  470 
i*j + k + j*#3*i simplifies to #4*(i*j) + k 
471 
two terms #m*u and #n*u are replaced by #(m+n)*u 

472 
(where #m, #n and u can implicitly be 1; this is simproc combine_numerals) 

473 
and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(mn)+x ~~ y 

474 
or x ~~ #(nm)+y, where ~~ is one of = < <= or  (simproc cancel_numerals); 

8736  475 

10003  476 
* HOL: meson_tac is available (previously in ex/meson.ML); it is a 
477 
powerful prover for predicate logic but knows nothing of clasets; see 

478 
ex/mesontest.ML and ex/mesontest2.ML for example applications; 

9835  479 

8848  480 
* 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

481 
"exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer 
8518  482 
exists, may define val exhaust_tac = case_tac for adhoc portability; 
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset

483 

8848  484 
* HOL: simplification no longer dives into caseexpressions: only the 
10129  485 
selector expression is simplified, but not the remaining arms; to 
486 
enable full simplification of caseexpressions for datatype t, you may 

487 
remove t.weak_case_cong from the simpset, either globally (Delcongs 

488 
[thm"t.weak_case_cong"];) or locally (delcongs [...]). 

8603  489 

8848  490 
* HOL/recdef: the recursion equations generated by 'recdef' for 
491 
function 'f' are now called f.simps instead of f.rules; if all 

492 
termination conditions are proved automatically, these simplification 

493 
rules are added to the simpset, as in primrec; rules may be named 

494 
individually as well, resulting in a separate list of theorems for 

495 
each equation; 

496 

9489
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

497 
* HOL/While is a new theory that provides a whilecombinator. It 
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

498 
permits the definition of tailrecursive functions without the 
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

499 
provision of a termination measure. The latter is necessary once the 
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

500 
invariant proof rule for while is applied. 
9457  501 

10003  502 
* HOL: new (overloaded) notation for the set of elements below/above 
503 
some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval. 

8925  504 

8848  505 
* HOL: theorems impI, allI, ballI bound as "strip"; 
506 

10003  507 
* HOL: new tactic induct_thm_tac: thm > string > int > tactic 
9746  508 
induct_tac th "x1 ... xn" expects th to have a conclusion of the form 
509 
P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th; 

510 

10003  511 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  512 

10003  513 
* HOL: theory Sexp now in HOL/Induct examples (it used to be part of 
514 
main HOL, but was unused); 

8626  515 

10003  516 
* HOL: fewer consts declared as global (e.g. have to refer to 
517 
"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

518 

10003  519 
* HOL: tuned AST representation of nested pairs, avoiding bogus output 
520 
in case of overlap with user translations (e.g. judgements over 

521 
tuples); (note that the underlying logical represenation is still 

522 
bogus); 

9349
d43669fb423d
* tuned AST representation of nested pairs, avoiding bogus output in
wenzelm
parents:
9335
diff
changeset

523 

8412  524 

9542  525 
*** ZF *** 
526 

10003  527 
* ZF: simplification automatically cancels common terms in arithmetic 
528 
expressions over nat and int; 

9542  529 

10003  530 
* ZF: new treatment of nat to minimize typechecking: all operators 
531 
coerce their operands to a natural number using the function natify, 

532 
making the algebraic laws unconditional; 

9542  533 

10003  534 
* ZF: as above, for int: operators coerce their operands to an integer 
535 
using the function intify; 

9542  536 

10003  537 
* ZF: the integer library now contains many of the usual laws for the 
538 
orderings, including $<=, and monotonicity laws for $+ and $*; 

9542  539 

10003  540 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
541 
simplification; 

9388  542 

10003  543 
* FOL and ZF: AddIffs now available, giving theorems of the form P<>Q 
544 
to the simplifier and classical reasoner simultaneously; 

9388  545 

546 

8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

547 
*** General *** 
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

548 

10003  549 
* Provers: blast_tac now handles actual objectlogic rules as 
550 
assumptions; note that auto_tac uses blast_tac internally as well; 

551 

552 
* Provers: new functions rulify/rulify_no_asm: thm > thm for turning 

553 
outer >/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm; 

554 

9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset

555 
* 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

556 
explicit make_elim); 
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset

557 

10003  558 
* Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g. 
559 
[ inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W ] ==> ?W 

560 
use instead the strong form, 

561 
[ inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W ] ==> ?W 

562 
in HOL, FOL and ZF the function cla_make_elim will create such rules 

563 
from destructrules; 

9489
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

564 

9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset

565 
* Provers: Simplifier.easy_setup provides a fast path to basic 
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset

566 
Simplifier setup for new objectlogics; 
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset

567 

2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset

568 
* 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

569 

9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset

570 
* Pure: improved name spaces: ambiguous output is qualified; support 
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset

571 
for hiding of names; 
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset

572 

10003  573 
* system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and 
574 
XSYMBOL_HOME; no longer need to do manual configuration in most 

575 
situations; 

576 

9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset

577 
* 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

578 
option of isabelle and isatool usedir (currently only observed by 
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset

579 
Poly/ML); 
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

580 

9981
01a0c4772c18
system: isatool installfonts may handle XSymbol fonts as well;
wenzelm
parents:
9971
diff
changeset

581 
* system: isatool installfonts may handle XSymbol fonts as well (very 
01a0c4772c18
system: isatool installfonts may handle XSymbol fonts as well;
wenzelm
parents:
9971
diff
changeset

582 
useful for remote X11); 
01a0c4772c18
system: isatool installfonts may handle XSymbol fonts as well;
wenzelm
parents:
9971
diff
changeset

583 

9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset

584 
* system: provide TAGS file for Isabelle sources; 
9052  585 

9288
06a55195741b
infix 'OF' is a version of 'MRS' with more appropriate argument order;
wenzelm
parents:
9239
diff
changeset

586 
* 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

587 
order; 
06a55195741b
infix 'OF' is a version of 'MRS' with more appropriate argument order;
wenzelm
parents:
9239
diff
changeset

588 

8994
803533fbb3ec
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
wenzelm
parents:
8991
diff
changeset

589 
* 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

590 
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

591 

10003  592 
* ML: new combinators >> and >>> for incremental transformations 
593 
with secondary results (e.g. certain theory extensions): 

594 

9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset

595 
* 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

596 
overloading (usually false); 
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset

597 

10003  598 
* ML: PureThy.add_thms/add_axioms/add_defs now return theorems as 
599 
results; 

8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset

600 

8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

601 

8015  602 

7986  603 
New in Isabelle99 (October 1999) 
604 
 

4649  605 

5931  606 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
607 

6922  608 
* HOL: The THEN and ELSE parts of conditional expressions (if P then x else y) 
609 
are no longer simplified. (This allows the simplifier to unfold recursive 

610 
functional programs.) To restore the old behaviour, declare 

7215  611 

612 
Delcongs [if_weak_cong]; 

6922  613 

6269  614 
* HOL: Removed the obsolete syntax "Compl A"; use A for set 
615 
complement; 

5931  616 

6269  617 
* HOL: the predicate "inj" is now defined by translation to "inj_on"; 
6174  618 

7847  619 
* HOL/datatype: mutual_induct_tac no longer exists  
620 
use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"] 

621 

6386
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset

622 
* HOL/typedef: fixed type inference for representing set; type 
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset

623 
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

624 

6269  625 
* ZF: The con_defs part of an inductive definition may no longer refer 
626 
to constants declared in the same theory; 

6057  627 

6269  628 
* HOL, ZF: the function mk_cases, generated by the inductive 
629 
definition package, has lost an argument. To simplify its result, it 

630 
uses the default simpset instead of a supplied list of theorems. 

6141  631 

7215  632 
* HOL/List: the constructors of type list are now Nil and Cons; 
633 

7619  634 
* Simplifier: the type of the infix ML functions 
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset

635 
setSSolver addSSolver setSolver addSolver 
7619  636 
is now simpset * solver > simpset where `solver' is a new abstract type 
637 
for packaging solvers. A solver is created via 

8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset

638 
mk_solver: string > (thm list > int > tactic) > solver 
7619  639 
where the string argument is only a comment. 
6057  640 

7647
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset

641 

6069  642 
*** Proof tools *** 
643 

6343  644 
* Provers/Arith/fast_lin_arith.ML contains a functor for creating a 
645 
decision procedure for linear arithmetic. Currently it is used for 

7593  646 
types `nat', `int', and `real' in HOL (see below); it can, should and 
647 
will be instantiated for other types and logics as well. 

6069  648 

7324  649 
* The simplifier now accepts rewrite rules with flexible heads, eg 
650 
hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y 

651 
They are applied like any rule with a nonpattern lhs, i.e. by firstorder 

652 
matching. 

6069  653 

7593  654 

6014  655 
*** General *** 
656 

7986  657 
* New Isabelle/Isar subsystem provides an alternative to traditional 
7215  658 
tactical theorem proving; together with the ProofGeneral/isar user 
659 
interface it offers an interactive environment for developing human 

660 
readable proof documents (Isar == Intelligible semiautomated 

7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset

661 
reasoning); for further information see isatool doc isarref, 
7986  662 
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

663 

9612  664 
* improved and simplified presentation of theories: better HTML markup 
665 
(including colors), graph views in several sizes; isatool usedir now 

666 
provides a proper interface for user theories (via P option); actual 

667 
document preparation based on (PDF)LaTeX is available as well (for 

668 
newstyle theories only); see isatool doc system for more information; 

7215  669 

7252  670 
* native support for Proof General, both for classic Isabelle and 
7986  671 
Isabelle/Isar; 
7215  672 

7791  673 
* ML function thm_deps visualizes dependencies of theorems and lemmas, 
674 
using the graph browser tool; 

675 

6751  676 
* Isabelle manuals now also available as PDF; 
677 

6449  678 
* theory loader rewritten from scratch (may not be fully 
679 
bugcompatible); old loadpath variable has been replaced by show_path, 

6671  680 
add_path, del_path, reset_path functions; new operations such as 
7593  681 
update_thy, touch_thy, remove_thy, use/update_thy_only (see also 
682 
isatool doc ref); 

6449  683 

7215  684 
* improved isatool install: option k creates KDE application icon, 
685 
option p DIR installs standalone binaries; 

686 

687 
* added ML_PLATFORM setting (useful for crossplatform installations); 

688 
more robust handling of platform specific ML images for SML/NJ; 

689 

7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset

690 
* the settings environment is now statically scoped, i.e. it is never 
7986  691 
created again in subprocesses invoked from isabelle, isatool, or 
7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset

692 
Isabelle; 
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset

693 

7215  694 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
695 

6343  696 
* in locales, the "assumes" and "defines" parts may be omitted if 
697 
empty; 

5973  698 

6269  699 
* new print_mode "xsymbols" for extended symbol support (e.g. genuine 
700 
long arrows); 

6259
488bdc1bd11a
path element specification '~~' refers to '$ISABELLE_HOME';
wenzelm
parents:
6174
diff
changeset

701 

6343  702 
* new print_mode "HTML"; 
703 

704 
* new flag show_tags controls display of tags of theorems (which are 

705 
basically just comments that may be attached by some tools); 

706 

6461  707 
* Isamode 2.6 requires patch to accomodate change of Isabelle font 
708 
mode and goal output format: 

709 

710 
diff r Isamode2.6/elisp/isaload.el Isamode/elisp/isaload.el 

711 
244c244 

712 
< (list (isagetenv "ISABELLE") "msymbols" logicname) 

713 
 

6533  714 
> (list (isagetenv "ISABELLE") "misabelle_font" "msymbols" logicname) 
6461  715 
diff r Isabelle2.6/elisp/isaproofstate.el Isamode/elisp/isaproofstate.el 
716 
181c181 

717 
< (defconst proofstateproofstartregexp "^Level [09]+$" 

718 
 

719 
> (defconst proofstateproofstartregexp "^Level [09]+" 

720 

7450  721 
* function bind_thms stores lists of theorems (cf. bind_thm); 
722 

7593  723 
* new shorthand tactics ftac, eatac, datac, fatac; 
724 

725 
* qed (and friends) now accept "" as result name; in that case the 

7986  726 
theorem is not stored, but proper checks and presentation of the 
727 
result still apply; 

7593  728 

7805
0ae9ddc36fe0
theorem database now also indexes constants "Trueprop", "all",
wenzelm
parents:
7791
diff
changeset

729 
* theorem database now also indexes constants "Trueprop", "all", 
0ae9ddc36fe0
theorem database now also indexes constants "Trueprop", "all",
wenzelm
parents:
7791
diff
changeset

730 
"==>", "=="; thus thms_containing, findI etc. may retrieve more rules; 
0ae9ddc36fe0
theorem database now also indexes constants "Trueprop", "all",
wenzelm
parents:
7791
diff
changeset

731 

6028  732 

6057  733 
*** HOL *** 
734 

7215  735 
** HOL arithmetic ** 
736 

6343  737 
* There are now decision procedures for linear arithmetic over nat and 
738 
int: 

6131  739 

6343  740 
1. arith_tac copes with arbitrary formulae involving `=', `<', `<=', 
741 
`+', `', `Suc', `min', `max' and numerical constants; other subterms 

742 
are treated as atomic; subformulae not involving type `nat' or `int' 

743 
are ignored; quantified subformulae are ignored unless they are 

744 
positive universal or negative existential. The tactic has to be 

745 
invoked by hand and can be a little bit slow. In particular, the 

746 
running time is exponential in the number of occurrences of `min' and 

747 
`max', and `' on `nat'. 

6131  748 

6343  749 
2. fast_arith_tac is a cutdown version of arith_tac: it only takes 
750 
(negated) (in)equalities among the premises and the conclusion into 

751 
account (i.e. no compound formulae) and does not know about `min' and 

752 
`max', and `' on `nat'. It is fast and is used automatically by the 

753 
simplifier. 

6131  754 

6343  755 
NB: At the moment, these decision procedures do not cope with mixed 
756 
nat/int formulae where the two parts interact, such as `m < n ==> 

757 
int(m) < int(n)'. 

6028  758 

7215  759 
* HOL/Numeral provides a generic theory of numerals (encoded 
7313  760 
efficiently as bit strings); setup for types nat/int/real is in place; 
7215  761 
INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than 
762 
int, existing theories and proof scripts may require a few additional 

763 
type constraints; 

764 

765 
* integer division and remainder can now be performed on constant 

766 
arguments; 

7157  767 

7215  768 
* many properties of integer multiplication, division and remainder 
769 
are now available; 

6922  770 

7287  771 
* An interface to the Stanford Validity Checker (SVC) is available through the 
772 
tactic svc_tac. Propositional tautologies and theorems of linear arithmetic 

773 
are proved automatically. SVC must be installed separately, and its results 

774 
must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any 

775 
invocation of the underlying oracle). For SVC see 

7444  776 
http://verify.stanford.edu/SVC 
6922  777 

7125  778 
* IsaMakefile: the HOLReal target now builds an actual image; 
779 

7215  780 

781 
** HOL misc ** 

782 

7595
5f5d575ddac3
* HOL/Real/HahnBanach: the HahnBanach theorem for real vector spaces
wenzelm
parents:
7593
diff
changeset

783 
* HOL/Real/HahnBanach: the HahnBanach theorem for real vector spaces 
5f5d575ddac3
* HOL/Real/HahnBanach: the HahnBanach theorem for real vector spaces
wenzelm
parents:
7593
diff
changeset

784 
(in Isabelle/Isar)  by Gertrud Bauer; 
5f5d575ddac3
* HOL/Real/HahnBanach: the HahnBanach theorem for real vector spaces
wenzelm
parents:
7593
diff
changeset

785 

7691  786 
* HOL/BCV: generic model of bytecode verification, i.e. dataflow 
787 
analysis for assembly languages with subtypes; 

788 

6278  789 
* HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization 
790 
 avoids syntactic ambiguities and treats state, transition, and 

791 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

792 
changed syntax and (many) tactics; 

793 

7791  794 
* HOL/inductive: Now also handles more general introduction rules such 
795 
as "ALL y. (y, x) : r > y : acc r ==> x : acc r"; monotonicity 

796 
theorems are now maintained within the theory (maintained via the 

797 
"mono" attribute); 

7780
099742c562aa
Documented changes to HOL/inductive and function thm_deps.
berghofe
parents:
7691
diff
changeset

798 

7238
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset

799 
* HOL/datatype: Now also handles arbitrarily branching datatypes 
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset

800 
(using function types) such as 
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset

801 

36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset

802 
datatype 'a tree = Atom 'a  Branch "nat => 'a tree" 
7047
d103b875ef1d
Datatype package now handles arbitrarily branching datatypes.
berghofe
parents:
6925
diff
changeset

803 

7326  804 
* HOL/record: record_simproc (part of the default simpset) takes care 
805 
of selectors applied to updated records; record_split_tac is no longer 

7327  806 
part of the default claset; update_defs may now be removed from the 
807 
simpset in many cases; COMPATIBILITY: old behavior achieved by 

7326  808 

809 
claset_ref () := claset() addSWrapper record_split_wrapper; 

810 
Delsimprocs [record_simproc] 

811 

6386
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset

812 
* HOL/typedef: fixed type inference for representing set; type 
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset

813 
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

814 

7287  815 
* HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem 
816 
names rather than an ML expression; 

817 

818 
* HOL/defer_recdef (TFL): like recdef but the wellfounded relation can be 

819 
supplied later. Program schemes can be defined, such as 

820 
"While B C s = (if B s then While B C (C s) else s)" 

821 
where the wellfounded relation can be chosen after B and C have been given. 

6563  822 

7215  823 
* HOL/List: the constructors of type list are now Nil and Cons; 
824 
INCOMPATIBILITY: while [] and infix # syntax is still there, of 

825 
course, ML tools referring to List.list.op # etc. have to be adapted; 

826 

7238
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset

827 
* HOL_quantifiers flag superseded by "HOL" print mode, which is 
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset

828 
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

829 
the original Gordon/HOLstyle output; 
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset

830 

36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset

831 
* 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

832 
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

833 

36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset

834 
* HOL basic syntax simplified (more orthogonal): all variants of 
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset

835 
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

836 
Eps operator is provided as well: "SOME x. P[x]"; 
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset

837 

7320  838 
* HOL/Sum.thy: sum_case has been moved to HOL/Datatype; 
7261  839 

7280  840 
* HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made 
841 
thus available for user theories; 

842 

7300
8439bf404c28
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with HOL/List;
wenzelm
parents:
7287
diff
changeset

843 
* 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

844 
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

845 
time; 
8439bf404c28
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with HOL/List;
wenzelm
parents:
7287
diff
changeset

846 

7986  847 
* HOL: new tactic smp_tac: int > int > tactic, which applies spec 
848 
several times and then mp; 

7492  849 

7215  850 

7113  851 
*** LK *** 
852 

7215  853 
* the notation <<...>> is now available as a notation for sequences of 
854 
formulas; 

7113  855 

856 
* the simplifier is now installed 

857 

8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset

858 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  859 

860 
* the classical reasoner now has a default rule database 

861 

862 

6064  863 
*** ZF *** 
864 

865 
* new primrec section allows primitive recursive functions to be given 

6269  866 
directly (as in HOL) over datatypes and the natural numbers; 
6064  867 

6269  868 
* new tactics induct_tac and exhaust_tac for induction (or case 
869 
analysis) over datatypes and the natural numbers; 

6064  870 

871 
* the datatype declaration of type T now defines the recursor T_rec; 

872 

6141  873 
* simplification automatically does freeness reasoning for datatype 
6269  874 
constructors; 
6141  875 

6269  876 
* automatic typeinference, with AddTCs command to insert new 
877 
typechecking rules; 

6155  878 

6269  879 
* datatype introduction rules are now added as Safe Introduction rules 
880 
to the claset; 

6155  881 

6269  882 
* the syntax "if P then x else y" is now available in addition to 
883 
if(P,x,y); 

884 

6069  885 

6343  886 
*** Internal programming interfaces *** 
887 

7919
35c18affc1d8
tuned simplifier trace output; new flag debug_simp
wenzelm
parents:
7886
diff
changeset

888 
* tuned simplifier trace output; new flag debug_simp; 
35c18affc1d8
tuned simplifier trace output; new flag debug_simp
wenzelm
parents:
7886
diff
changeset

889 

7420
cba45c114f3b
structures Vartab / Termtab (instances of TableFun);
wenzelm
parents:
7327
diff
changeset

890 
* structures Vartab / Termtab (instances of TableFun) offer efficient 
cba45c114f3b
structures Vartab / Termtab (instances of TableFun);
wenzelm
parents:
7327
diff
changeset

891 
tables indexed by indexname_ord / term_ord (compatible with aconv); 
cba45c114f3b
structures Vartab / Termtab (instances of TableFun);
wenzelm
parents:
7327
diff
changeset

892 

6386
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset

893 
* AxClass.axclass_tac lost the theory argument; 
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset

894 

6343  895 
* tuned current_goals_markers semantics: begin / end goal avoids 
896 
printing empty lines; 

897 

898 
* removed prs and prs_fn hook, which was broken because it did not 

899 
include \n in its semantics, forcing writeln to add one 

900 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

901 
string > unit if you really want to output text without newline; 

902 

903 
* Symbol.output subject to print mode; INCOMPATIBILITY: defaults to 

904 
plain output, interface builders may have to enable 'isabelle_font' 

905 
mode to get Isabelle font glyphs as before; 

906 

907 
* refined token_translation interface; INCOMPATIBILITY: output length 

908 
now of type real instead of int; 

909 

7196  910 
* theory loader actions may be traced via new ThyInfo.add_hook 
911 
interface (see src/Pure/Thy/thy_info.ML); example application: keep 

912 
your own database of information attached to *whole* theories  as 

913 
opposed to intratheory data slots offered via TheoryDataFun; 

914 

7647
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset

915 
* proper handling of dangling sort hypotheses (at last!); 
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset

916 
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

917 
extra sort hypotheses that can be witnessed from the type signature; 
7986  918 
the force_strip_shyps flag is gone, any remaining shyps are simply 
919 
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

920 

6343  921 

6064  922 

5781  923 
New in Isabelle981 (October 1998) 
924 
 

925 

5127  926 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  927 

5726  928 
* several changes of automated proof tools; 
5373  929 

5726  930 
* HOL: major changes to the inductive and datatype packages, including 
931 
some minor incompatibilities of theory syntax; 

5214  932 

5726  933 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  934 
called `inj_on'; 
5160  935 

5275  936 
* HOL: removed duplicate thms in Arith: 
937 
less_imp_add_less should be replaced by trans_less_add1 

938 
le_imp_add_le should be replaced by trans_le_add1 

5160  939 

5726  940 
* HOL: unary minus is now overloaded (new type constraints may be 
941 
required); 

5490  942 

5726  943 
* HOL and ZF: unary minus for integers is now # instead of #~. In 
944 
ZF, expressions such as n#1 must be changed to n# 1, since #1 is 

945 
now taken as an integer constant. 

5541  946 

5726  947 
* Pure: ML function 'theory_of' renamed to 'theory'; 
5397
034ed25535b9
* Pure: ML function 'theory_of' replaced by 'theory';
wenzelm
parents:
5373
diff
changeset

948 

5363  949 

5127  950 
*** Proof tools *** 
4880  951 

5657
1a6c9c6a3f8e
2. The simplifier now knows a little bit about natarithmetic.
nipkow
parents:
5651
diff
changeset

952 
* Simplifier: 
1a6c9c6a3f8e
2. The simplifier now knows a little bit about natarithmetic.
nipkow
parents:
5651
diff
changeset

953 
1. Asm_full_simp_tac is now more aggressive. 
1a6c9c6a3f8e
2. The simplifier now knows a little bit about natarithmetic.
nipkow
parents:
5651
diff
changeset

954 
1. It will sometimes reorient premises if that increases their power to 
1a6c9c6a3f8e
2. The simplifier now knows a little bit about natarithmetic.
nipkow
parents:
5651
diff
changeset

955 
simplify. 
1a6c9c6a3f8e
2. The simplifier now knows a little bit about natarithmetic.
nipkow
parents:
5651
diff
changeset

956 
2. It does no longer proceed strictly from left to right but may also 
1a6c9c6a3f8e
2. The simplifier now knows a little bit about natarithmetic.
nipkow
parents:
5651
diff
changeset

957 
rotate premises to achieve further simplification. 
1a6c9c6a3f8e
2. The simplifier now knows a little bit about natarithmetic.
nipkow
parents:
5651
diff
changeset

958 
For compatibility reasons there is now Asm_lr_simp_tac which is like the 
1a6c9c6a3f8e
2. The simplifier now knows a little bit about natarithmetic.
nipkow
parents:
5651
diff
changeset

959 
old Asm_full_simp_tac in that it does not rotate premises. 
1a6c9c6a3f8e
2. The simplifier now knows a little bit about natarithmetic.
nipkow
parents:
5651
diff
changeset

960 
2. The simplifier now knows a little bit about natarithmetic. 
4880  961 

5127  962 
* Classical reasoner: wrapper mechanism for the classical reasoner now 
963 
allows for selected deletion of wrappers, by introduction of names for 

964 
wrapper functionals. This implies that addbefore, addSbefore, 

965 
addaltern, and addSaltern now take a pair (name, tactic) as argument, 

966 
and that adding two tactics with the same name overwrites the first 

967 
one (emitting a warning). 

4824  968 
type wrapper = (int > tactic) > (int > tactic) 
4649  969 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  970 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
971 
delWrapper, delSWrapper: claset * string > claset 

4649  972 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
973 

5705
56f2030c46c6
tuned (all proofs are INSTABLE by David's definition of instability);
wenzelm
parents:
5671
diff
changeset

974 
* Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE 
5726  975 
semantics; addbefore now affects only the unsafe part of step_tac 
976 
etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY 

977 
FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac 

978 
by Force_tac; 

5524  979 

5726  980 
* Classical reasoner: setwrapper to setWrapper and compwrapper to 
981 
compWrapper; added safe wrapper (and access functions for it); 

5524  982 

5127  983 
* HOL/split_all_tac is now much faster and fails if there is nothing 
5726  984 
to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order 
985 
and the names of the automatically generated variables have changed. 

986 
split_all_tac has moved within claset() from unsafe wrappers to safe 

987 
wrappers, which means that !!bound variables are split much more 

988 
aggressively, and safe_tac and clarify_tac now split such variables. 

989 
If this splitting is not appropriate, use delSWrapper "split_all_tac". 

990 
Note: the same holds for record_split_tac, which does the job of 

991 
split_all_tac for record fields. 

5127  992 

5726  993 
* HOL/Simplifier: Rewrite rules for case distinctions can now be added 
994 
permanently to the default simpset using Addsplits just like 

995 
Addsimps. They can be removed via Delsplits just like 

996 
Delsimps. Lowercase versions are also available. 

5127  997 

5726  998 
* HOL/Simplifier: The rule split_if is now part of the default 
999 
simpset. This means that the simplifier will eliminate all occurrences 

1000 
of ifthenelse in the conclusion of a goal. To prevent this, you can 

1001 
either remove split_if completely from the default simpset by 

1002 
`Delsplits [split_if]' or remove it in a specific call of the 

1003 
simplifier using `... delsplits [split_if]'. You can also add/delete 

1004 
other case splitting rules to/from the default simpset: every datatype 

1005 
generates suitable rules `split_t_case' and `split_t_case_asm' (where 

1006 
t is the name of the datatype). 

5127  1007 

5726  1008 
* Classical reasoner / Simplifier combination: new force_tac (and 
5127  1009 
derivatives Force_tac, force) combines rewriting and classical 
1010 
reasoning (and whatever other tools) similarly to auto_tac, but is 

5726  1011 
aimed to solve the given subgoal completely. 
5127  1012 

1013 

1014 
*** General *** 

1015 

5217  1016 
* new toplevel commands `Goal' and `Goalw' that improve upon `goal' 
5127  1017 
and `goalw': the theory is no longer needed as an explicit argument  
1018 
the current theory context is used; assumptions are no longer returned 

1019 
at the MLlevel unless one of them starts with ==> or !!; it is 

5217  1020 
recommended to convert to these new commands using isatool fixgoal 
1021 
(backup your sources first!); 

4842  1022 

5217  1023 
* new toplevel commands 'thm' and 'thms' for retrieving theorems from 
5207  1024 
the current theory context, and 'theory' to lookup stored theories; 
4806  1025 

5722  1026 
* new theory section 'locale' for declaring constants, assumptions and 
1027 
definitions that have local scope; 

1028 

5127  1029 
* new theory section 'nonterminals' for purely syntactic types; 
4858  1030 

5127  1031 
* new theory section 'setup' for generic ML setup functions 
1032 
(e.g. package initialization); 

4869  1033 

5131  1034 
* the distribution now includes Isabelle icons: see 
1035 
lib/logo/isabelle{small,tiny}.xpm; 

1036 

5363  1037 
* isatool install  install binaries with absolute references to 
1038 
ISABELLE_HOME/bin; 

1039 

5572  1040 
* isatool logo  create instances of the Isabelle logo (as EPS); 
1041 

5407  1042 
* print mode 'emacs' reserved for Isamode; 
1043 

5726  1044 
* support multiple print (ast) translations per constant name; 
1045 

6925
8d4d45ec6a3d
theorems involving oracles are now printed with a suffixed [!];
wenzelm
parents:
6922
diff
changeset

1046 
* theorems involving oracles are now printed with a suffixed [!]; 
8d4d45ec6a3d
theorems involving oracles are now printed with a suffixed [!];
wenzelm
parents:
6922
diff
changeset

1047 

4711  1048 

4661  1049 
*** HOL *** 
1050 

5710  1051 
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial'); 
5709  1052 

5217  1053 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  1054 
definitions such as 
5217  1055 

1056 
inductive EVEN ODD 

1057 
intrs 

1058 
null "0 : EVEN" 

1059 
oddI "n : EVEN ==> Suc n : ODD" 

1060 
evenI "n : ODD ==> Suc n : EVEN" 

1061 

1062 
new theorem list "elims" contains an elimination rule for each of the 

1063 
recursive sets; inductive definitions now handle disjunctive premises 

1064 
correctly (also ZF); 

5214  1065 

5217  1066 
INCOMPATIBILITIES: requires Inductive as an ancestor; component 
1067 
"mutual_induct" no longer exists  the induction rule is always 

1068 
contained in "induct"; 

1069 

1070 

1071 
* HOL/datatype package reimplemented and greatly improved: now 

5267  1072 
supports mutually recursive datatypes such as 
5217  1073 

1074 
datatype 

1075 
'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp) 

1076 
 SUM ('a aexp) ('a aexp) 

1077 
 DIFF ('a aexp) ('a aexp) 

1078 
 NUM 'a 

1079 
and 

1080 
'a bexp = LESS ('a aexp) ('a aexp) 

1081 
 AND ('a bexp) ('a bexp) 

1082 
 OR ('a bexp) ('a bexp) 

1083 

5267  1084 
as well as indirectly recursive datatypes such as 
5214  1085 

5217  1086 
datatype 
1087 
('a, 'b) term = Var 'a 

1088 
 App 'b ((('a, 'b) term) list) 

5214  1089 

5217  1090 
The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs 
1091 
induction on mutually / indirectly recursive datatypes. 

1092 

1093 
Primrec equations are now stored in theory and can be accessed via 

1094 
<function_name>.simps. 

1095 

1096 
INCOMPATIBILITIES: 

5214  1097 

5217  1098 
 Theories using datatypes must now have theory Datatype as an 
1099 
ancestor. 

1100 
 The specific <typename>.induct_tac no longer exists  use the 

1101 
generic induct_tac instead. 

5226  1102 
 natE has been renamed to nat.exhaust  use exhaust_tac 
5217  1103 
instead of res_inst_tac ... natE. Note that the variable 
5226  1104 
names in nat.exhaust differ from the names in natE, this 
5217  1105 
may cause some "fragile" proofs to fail. 
1106 
 The theorems split_<typename>_case and split_<typename>_case_asm 

1107 
have been renamed to <typename>.split and <typename>.split_asm. 

1108 
 Since default sorts of type variables are now handled correctly, 

1109 
some datatype definitions may have to be annotated with explicit 

1110 
sort constraints. 

1111 
 Primrec definitions no longer require function name and type 

1112 
of recursive argument. 

5214  1113 

5217  1114 
Consider using isatool fixdatatype to adapt your theories and proof 
1115 
scripts to the new package (backup your sources first!). 

1116 

1117 

5726  1118 
* HOL/record package: considerably improved implementation; now 
1119 
includes concrete syntax for record types, terms, updates; theorems 

1120 
for surjective pairing and splitting !!bound record variables; proof 

1121 
support is as follows: 

1122 

1123 
1) standard conversions (selectors or updates applied to record 

1124 
constructor terms) are part of the standard simpset; 

1125 

1126 
2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are 

1127 
made part of standard simpset and claset via addIffs; 

1128 

1129 
3) a tactic for record field splitting (record_split_tac) is part of 

1130 
the standard claset (addSWrapper); 

1131 

1132 
To get a better idea about these rules you may retrieve them via 

1133 
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is 

1134 
the name of your record type. 

1135 

1136 
The split tactic 3) conceptually simplifies by the following rule: 

1137 

1138 
"(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))" 

1139 

1140 
Thus any record variable that is bound by metaall will automatically 

1141 
blow up into some record constructor term, consequently the 

1142 
simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall 

1143 
solve record problems automatically. 

1144 

5214  1145 

5125  1146 
* reorganized the main HOL image: HOL/Integ and String loaded by 
1147 
default; theory Main includes everything; 

1148 

5650  1149 
* automatic simplification of integer sums and comparisons, using cancellation; 
1150 

5526  1151 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  1152 

1153 
* added disj_not1 = "(~P  Q) = (P > Q)" to the default simpset; 

1154 

1155 
* many new identities for unions, intersections, set difference, etc.; 

1156 

1157 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

1158 
called split_if, split_split, split_sum_case and split_nat_case (to go 

1159 
with add/delsplits); 

5125  1160 

5127  1161 
* HOL/Prod introduces simplification procedure unit_eq_proc rewriting 
1162 
(?x::unit) = (); this is made part of the default simpset, which COULD 

1163 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

5207  1164 
'Delsimprocs [unit_eq_proc];' as last resort); also note that 
1165 
unit_abs_eta_conv is added in order to counter the effect of 

1166 
unit_eq_proc on (%u::unit. f u), replacing it by f rather than by 

1167 
%u.f(); 

5125  1168 

5217  1169 
* HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which 
1170 
makes more sense); 

5109  1171 

5475  1172 
* HOL/Set INCOMPATIBILITY: rule `equals0D' is now a wellformed destruct rule; 
1173 
It and 'sym RS equals0D' are now in the default claset, giving automatic 

1174 
disjointness reasoning but breaking a few old proofs. 

5267  1175 

5217  1176 
* HOL/Relation INCOMPATIBILITY: renamed the relational operator r^1 
1177 
to 'converse' from 'inverse' (for compatibility with ZF and some 

1178 
literature); 

5085
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset

1179 

5127  1180 
* HOL/recdef can now declare nonrecursive functions, with {} supplied as 
1181 
the wellfounded relation; 

4838  1182 

5490  1183 
* HOL/Set INCOMPATIBILITY: the complement of set A is now written A instead of 
1184 
Compl A. The "Compl" syntax remains available as input syntax for this 

1185 
release ONLY. 

1186 

5127  1187 
* HOL/Update: new theory of function updates: 
1188 
f(a:=b) == %x. if x=a then b else f x 

1189 
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 ith
nipkow
parents:
5075
diff
changeset

1190 

5127  1191 
* HOL/Vimage: new theory for inverse image of a function, syntax f``B; 
4899  1192 

5282  1193 
* HOL/List: 
1194 
 new function list_update written xs[i:=v] that updates the ith 

1195 
list position. May also be iterated as in xs[i:=a,j:=b,...]. 

5428  1196 
 new function `upt' written [i..j(] which generates the list 
1197 
[i,i+1,...,j1], i.e. the upper bound is excluded. To include the upper 

1198 
bound write [i..j], which is a shorthand for [i..j+1(]. 

5282  1199 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  1200 

5127  1201 
* HOL/Arith: 
1202 
 removed 'pred' (predecessor) function; 

1203 
 generalized some theorems about n1; 

1204 
 many new laws about "div" and "mod"; 

1205 
 new laws about greatest common divisors (see theory ex/Primes); 

4766  1206 

5127  1207 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  1208 
instead of "inverse"; 
4711  1209 

5651  1210 
* HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness 
1211 
of the multiset ordering; 

1212 

5127  1213 
* directory HOL/Real: a construction of the reals using Dedekind cuts 
5651  1214 
(not included by default); 
4835  1215 

5127  1216 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  1217 

5651  1218 
* directory HOL/Hoare: a new version of Hoare logic which permits manysorted 
1219 
programs, i.e. different program variables may have different types. 

1220 

5142  1221 
* calling (stac rew i) now fails if "rew" has no effect on the goal 
1222 
[previously, this check worked only if the rewrite rule was unconditional] 

5308  1223 
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

1224 

5363  1225 

4879
58656c6a3551
"let" is no longer restricted to FOL terms and allows any logical terms
paulson
parents:
4869
diff
changeset

1226 
*** ZF *** 
58656c6a3551
"let" is no longer restricted to FOL terms and allows any logical terms
paulson
parents:
4869
diff
changeset

1227 

5332  1228 
* theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains 
1229 
only the theorems proved on ZF.ML; 

5160  1230 

5475  1231 
* ZF INCOMPATIBILITY: rule `equals0D' is now a wellformed destruct rule; 
1232 
It and 'sym RS equals0D' are now in the default claset, giving automatic 

1233 
disjointness reasoning but breaking a few old proofs. 

5267  1234 

5160  1235 
* ZF/Update: new theory of function updates 
1236 
with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z) 

1237 
may also be iterated as in f(a:=b,c:=d,...); 

1238 

4879
58656c6a3551
"let" is no longer restricted to FOL terms and allows any logical terms
paulson
parents:
4869
diff
changeset

1239 
* in let x=t in u(x), neither t nor u(x) has to be an FOL term. 
4649  1240 

5142  1241 
* calling (stac rew i) now fails if "rew" has no effect on the goal 
1242 
[previously, this check worked only if the rewrite rule was unconditional] 

5308  1243 
Now rew can involve either definitions or equalities (either == or =). 
5142  1244 

5160  1245 
* case_tac provided for compatibility with HOL 
1246 
(like the old excluded_middle_tac, but with subgoals swapped) 

1247 

4842  1248 

5127  1249 
*** Internal programming interfaces *** 
5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset

1250 

5251  1251 
* Pure: several new basic modules made available for general use, see 
1252 
also src/Pure/README; 

5207  1253 

5008  1254 
* improved the theory data mechanism to support encapsulation (data 
1255 
kind name replaced by private Object.kind, acting as authorization 

5373  1256 
key); new typesafe user interface via functor TheoryDataFun; generic 
1257 
print_data function becomes basically useless; 

5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset

1258 

5251  1259 
* removed global_names compatibility flag  all theory declarations 
1260 
are qualified by default; 

1261 

5085
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset

1262 
* module Pure/Syntax now offers quote / antiquote translation 
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset

1263 
functions (useful for Hoare logic etc. with implicit dependencies); 
5373  1264 
see HOL/ex/Antiquote for an example use; 
5085
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset

1265 

5127  1266 
* Simplifier now offers conversions (asm_)(full_)rewrite: simpset > 
1267 
cterm > thm; 

1268 

5207  1269 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
1270 
subgoal; 

5142  1271 

5251  1272 
* Display.print_goals function moved to Locale.print_goals; 
1273 

5731  1274 
* standard print function for goals supports current_goals_markers 
1275 
variable for marking begin of proof, end of proof, start of goal; the 

1276 
default is ("", "", ""); setting current_goals_markers := ("<proof>", 

1277 
"</proof>", "<goal>") causes SGML like tagged proof state printing, 

1278 
for example; 

1279 

5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset

1280 

7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset

1281 

4410  1282 
New in Isabelle98 (January 1998) 
1283 
 

1284 

1285 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 

1286 

1287 
* changed lexical syntax of terms / types: dots made part of long 

1288 
identifiers, e.g. "%x.x" no longer possible, should be "%x. x"; 

1289 

1290 
* simpset (and claset) reference variable replaced by functions 

1291 
simpset / simpset_ref; 

1292 

1293 
* no longer supports theory aliases (via merge) and nontrivial 

1294 
implicit merge of thms' signatures; 

1295 

1296 
* most internal names of constants changed due to qualified names; 

1297 

1298 
* changed Pure/Sequence interface (see Pure/seq.ML); 

1299 

3454  1300 

3715  1301 
*** General Changes *** 
1302 

4174  1303 
* hierachically structured name spaces (for consts, types, axms, thms 
3943  1304 
etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of 
4108  1305 
old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY: 
1306 
isatool fixdots ensures space after dots (e.g. "%x. x"); set 

4174  1307 
long_names for fully qualified output names; NOTE: ML programs 
1308 
(special tactics, packages etc.) referring to internal names may have 

1309 
to be adapted to cope with fully qualified names; in case of severe 

1310 
backward campatibility problems try setting 'global_names' at compile 

1311 
time to have enrything declared within a flat name space; one may also 

1312 
fine tune name declarations in theories via the 'global' and 'local' 

1313 
section; 

4108  1314 

1315 
* reimplemented the implicit simpset and claset using the new anytype 

1316 
data filed in signatures; references simpset:simpset ref etc. are 

1317 
replaced by functions simpset:unit>simpset and 

1318 
simpset_ref:unit>simpset ref; COMPATIBILITY: use isatool fixclasimp 

1319 
to patch your ML files accordingly; 

3856  1320 

3857  1321 
* HTML output now includes theory graph data for display with Java 
1322 
applet or isatool browser; data generated automatically via isatool 

3901  1323 
usedir (see i option, ISABELLE_USEDIR_OPTIONS); 
3857  1324 

3856  1325 
* defs may now be conditional; improved rewrite_goals_tac to handle 
1326 
conditional equations; 

1327 

4174  1328 
* defs now admits additional type arguments, using TYPE('a) syntax; 
1329 

3901  1330 
* theory aliases via merge (e.g. M=A+B+C) no longer supported, always 
1331 
creates a new theory node; implicit merge of thms' signatures is 

4112  1332 
restricted to 'trivial' ones; COMPATIBILITY: one may have to use 
3901  1333 
transfer:theory>thm>thm in (rare) cases; 
1334 

3968
ec138de716d9
improved handling of draft signatures / theories; draft thms (and
wenzelm
parents:
3964
diff
changeset

1335 
* improved handling of draft signatures / theories; draft thms (and 
ec138de716d9
improved handling of draft signatures / theories; draft thms (and
wenzelm
parents:
3964
diff
changeset

1336 
ctyps, cterms) are automatically promoted to real ones; 
ec138de716d9
improved handling of draft signatures / theories; draft thms (and
wenzelm
parents:
3964
diff
changeset

1337 

3901  1338 
* slightly changed interfaces for oracles: admit many per theory, named 
1339 
(e.g. oracle foo = mlfun), additional name argument for invoke_oracle; 

1340 

1341 
* print_goals: optional output of const types (set show_consts and 

1342 
show_types); 

3851
fe9932a7cd46
print_goals: optional output of const types (set show_consts);
wenzelm
parents:
3846
diff
changeset

1343 

4388  1344 
* improved output of warnings (###) and errors (***); 
3697
c5833dfcc2cc
Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
wenzelm
parents:
3671
diff
changeset

1345 

4178
e64ff1c1bc70
subgoal_tac displays a warning if the new subgoal has type variables
paulson
parents:
4174
diff
changeset

1346 
* 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

1347 

3715  1348 
* removed old README and Makefiles; 
3697
c5833dfcc2cc
Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
wenzelm
parents:
3671
diff
changeset

1349 

3856  1350 
* 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

1351 

3715  1352 
* removed obsolete init_pps and init_database; 
1353 

1354 
* deleted the obsolete tactical STATE, which was declared by 

1355 
fun STATE tacfun st = tacfun st st; 

1356 

4388  1357 
* cd and use now support path variables, e.g. $ISABELLE_HOME, or ~ 
1358 
(which abbreviates $HOME); 

4269  1359 

1360 
* changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY: 

1361 
use isatool fixseq to adapt your ML programs (this works for fully 

1362 
qualified references to the Sequence structure only!); 

1363 

4381  1364 
* use_thy no longer requires writable current directory; it always 
1365 
reloads .ML *and* .thy file, if either one is out of date; 

4269  1366 

3715  1367 

1368 
*** Classical Reasoner *** 

1369 

3744  1370 
* Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new 
1371 
tactics that use classical reasoning to simplify a subgoal without 

1372 
splitting it into several subgoals; 

3715  1373 

3719  1374 
* Safe_tac: like safe_tac but uses the default claset; 
1375 

3715  1376 

1377 
*** Simplifier *** 

1378 

1379 
* added simplification meta rules: 

1380 
(asm_)(full_)simplify: simpset > thm > thm; 

1381 

1382 
* simplifier.ML no longer part of Pure  has to be loaded by object 

1383 
logics (again); 

1384 

1385 
* added prems argument to simplification procedures; 

1386 

4325  1387 
* HOL, FOL, ZF: added infix function `addsplits': 
1388 
instead of `<simpset> setloop (split_tac <thms>)' 

1389 
you can simply write `<simpset> addsplits <thms>' 

1390 

3715  1391 

1392 
*** Syntax *** 

1393 

4174  1394 
* TYPE('a) syntax for type reflection terms; 
1395 

3985  1396 
* no longer handles consts with name ""  declare as 'syntax' instead; 
3856  1397 

1398 
* pretty printer: changed order of mixfix annotation preference (again!); 

3846  1399 

3715  1400 
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; 
1401 

1402 

1403 
*** HOL *** 

1404 

5726  1405 
* HOL: there is a new splitter `split_asm_tac' that can be used e.g. 
4189  1406 
with `addloop' of the simplifier to faciliate case splitting in premises. 
1407 

4035  1408 
* HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions; 
3985  1409 

1410 
* HOL/Auth: new protocol proofs including some for the Internet 

4035  1411 
protocol TLS; 
3985  1412 

4125  1413 
* HOL/Map: new theory of `maps' a la VDM; 
3982  1414 

4335  1415 
* HOL/simplifier: simplification procedures nat_cancel_sums for 
1416 
cancelling out common nat summands from =, <, <= (in)equalities, or 

1417 
differences; simplification procedures nat_cancel_factor for 

1418 
cancelling common factor from =, <, <= (in)equalities over natural 

4373  1419 
sums; nat_cancel contains both kinds of procedures, it is installed by 
1420 
default in Arith.thy  this COULD MAKE EXISTING PROOFS FAIL; 

4335  1421 

3580  1422 
* HOL/simplifier: terms of the form 
4325  1423 
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x) 
3580  1424 
are rewritten to 
4035 