author  ballarin 
Sat, 10 Feb 2001 08:48:10 +0100  
changeset 11091  45ffef3d3e75 
parent 11062  e86340dc1d28 
child 11094  b803ef642e60 
permissions  rwrr 
10944  1 

5363  2 
Isabelle NEWS  history userrelevant changes 
3 
============================================== 

2553  4 

11062  5 
New in Isabelle992 (February 2001) 
6 
 

7 

10224  8 
*** Overview of INCOMPATIBILITIES *** 
9 

11091  10 
* HOL/Algebra: special summation operator SUM no longer exists, it has 
11 
been replaced by setsum; infix 'assoc' now has priority 50 (like 'dvd'); 

12 

13 
* HOL/Algebra: axiom 'one_not_zero' has been moved from axclass 'ring' 

14 
to 'domain', this makes the theory consistent with mathematical literature; 

15 

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

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

17 
but only as far as specified by the introductions given; the old 
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset

18 
format may recovered via ML function complete_split_rule or attribute 
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset

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

20 

10998  21 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
22 
gfp_Tarski to gfp_unfold; 

10224  23 

10288  24 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
25 

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

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

10793  29 

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

32 

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

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

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

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

38 
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

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

40 

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

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

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

43 

10224  44 

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

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

46 

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

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

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

51 
typewriter); 

52 

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

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

54 
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

55 

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

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

61 
definitions); 

62 

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

65 
actual humanreadable proof documents. Please do not include goal 

66 
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

67 

11062  68 
* proper indentation of antiquoted output with proportional LaTeX 
69 
fonts; 

10862  70 

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

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

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

73 

11062  74 
* isatool unsymbolize tunes sources for plain ASCII communication; 
75 

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

76 

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

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

78 

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

81 
documents, due to unpredictable outcome and noncompositional proof 

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

83 
for Prologstyle synthesis of proven results; 

84 

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

87 

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

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

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

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

92 

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

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

95 

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

97 
statements as well; 

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

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 

10514  137 
* HOL basics: added overloaded operations "inverse" and "divide" 
10726  138 
(infix "/"), syntax for generic "abs" operation, generic summation 
139 
operator; 

10452
abeefb0a79ae
* added overloaded operations "inverse" and "divide" (infix "/");
wenzelm
parents:
10428
diff
changeset

140 

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

143 

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

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

145 
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

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

147 

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

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

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

150 

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

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

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

153 

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

10756  156 

157 
* HOLReal, HOLHyperreals: improved arithmetic simplification; 

10391  158 

10858  159 

10474  160 
*** CTT *** 
161 

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

10474  164 

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

167 

10474  168 

10391  169 
*** General *** 
170 

10664
da5373fa06de
* print modes "brackets" and "no_brackets" control output of nested =>
wenzelm
parents:
10634
diff
changeset

171 
* print modes "brackets" and "no_brackets" control output of nested => 
da5373fa06de
* print modes "brackets" and "no_brackets" control output of nested =>
wenzelm
parents:
10634
diff
changeset

172 
(types) and ==> (props); the default behaviour is "brackets"; 
da5373fa06de
* print modes "brackets" and "no_brackets" control output of nested =>
wenzelm
parents:
10634
diff
changeset

173 

11062  174 
* system: support Poly/ML 4.0; 
10634  175 

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

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

179 
the Isabelle inference kernel has been greatly improved; 

180 

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

183 

184 

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

185 

10103  186 
New in Isabelle991 (October 2000) 
187 
 

8015  188 

10003  189 
*** Overview of INCOMPATIBILITIES *** 
8014  190 

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

193 
issue the following ML commands: 

194 

195 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

196 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  197 

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

10003  200 

201 
* HOL: nat_less_induct renamed to less_induct; 

202 

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

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

8967  205 

10003  206 
select_equality > some_equality 
207 
select_eq_Ex > some_eq_ex 

208 
selectI2EX > someI2_ex 

209 
selectI2 > someI2 

210 
selectI > someI 

211 
select1_equality > some1_equality 

212 
Eps_sym_eq > some_sym_eq_trivial 

213 
Eps_eq > some_eq_trivial 

214 

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

216 

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

218 
instead); 

219 

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

221 
f.simps instead of f.rules; 

222 

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

224 

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

226 
sometimes be needed; 

227 

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

8014  229 

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

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

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

233 
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

234 
now "<*lex*>" instead of "**"; 
8705  235 

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

9971  238 

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

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

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

241 

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

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

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

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

245 

8848  246 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
247 

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

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

249 
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

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

251 

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

9908  254 

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

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

257 

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

9542  260 

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

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

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

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

265 

9612  266 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
267 

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

268 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  269 

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

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

272 

8014  273 

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

275 

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

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

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

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

280 

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

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

283 

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

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

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

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

287 

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

8566  291 

8518  292 
* 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

293 

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

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

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

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

297 

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

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

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

301 

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

302 

8184  303 
*** Isar *** 
304 

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

307 
accommodates incremental typeinference very nicely; 

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

308 

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

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

311 

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

314 
useful to collect intermediate results without explicit name 

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

316 
premises; 

8184  317 

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

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

321 
to theorems as "tags"; 

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

322 

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

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

325 

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

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

328 

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

330 

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

333 

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

336 
with the version in Provers/classical; 

9612  337 

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

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

340 

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

343 

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

9612  346 

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

348 
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

349 
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

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

351 

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

354 

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

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

357 
well (including splits); 

358 

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

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

361 

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

363 
of Simplifier and Classical reasoner); 

364 

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

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

367 
recdef) support case names and properly name parameters; 

9612  368 

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

371 
calculations; 

372 

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

374 
method anyway; 

375 

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

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

378 
foo.split foo.split_asm for each datatype; 

379 

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

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

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

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

384 

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

386 

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

388 

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

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

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

391 
proof states; 
8487  392 

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

8487  396 

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

400 
(for HOL datatypes); 

8534  401 

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

404 
'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

405 

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

407 

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

410 
(print_commands, print_methods etc.); 

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

411 

10003  412 
* Isar: added 'nothing'  the empty list of theorems; 
9239  413 

8184  414 

8014  415 
*** HOL *** 
416 

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

419 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

423 

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

8014  426 

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

427 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  428 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
429 
Rasmussen; 

8570  430 

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

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

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

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

434 
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

435 
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

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

437 

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

9542  440 

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

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

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

443 

10003  444 
* HOL/Lambda: converted into newstyle theory and document; 
9542  445 

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

448 
representation; very useful in avoiding lifting of operations; 

8848  449 

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

452 
well; admit "r" as field name; 

9542  453 

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

456 

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

458 
Types nat and int belong to this axclass; 

459 

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

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

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

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

8736  467 

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

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

9835  471 

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

473 
"exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer 
8518  474 
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

475 

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

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

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

8603  481 

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

484 
termination conditions are proved automatically, these simplification 

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

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

487 
each equation; 

488 

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

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

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

491 
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

492 
invariant proof rule for while is applied. 
9457  493 

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

8925  496 

8848  497 
* HOL: theorems impI, allI, ballI bound as "strip"; 
498 

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

502 

10003  503 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  504 

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

8626  507 

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

510 

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

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

514 
bogus); 

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

515 

8412  516 

9542  517 
*** ZF *** 
518 

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

9542  521 

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

524 
making the algebraic laws unconditional; 

9542  525 

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

9542  528 

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

9542  531 

10003  532 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
533 
simplification; 

9388  534 

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

9388  537 

538 

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

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

540 

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

543 

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

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

546 

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

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

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

549 

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

552 
use instead the strong form, 

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

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

555 
from destructrules; 

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

556 

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

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

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

559 

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

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

561 

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

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

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

564 

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

567 
situations; 

568 

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

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

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

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

572 

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

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

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

575 

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

576 
* system: provide TAGS file for Isabelle sources; 
9052  577 

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

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

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

580 

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

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

582 
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

583 

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

586 

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

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

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

589 

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

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

592 

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

593 

8015  594 

7986  595 
New in Isabelle99 (October 1999) 
596 
 

4649  597 

5931  598 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
599 

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

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

7215  603 

604 
Delcongs [if_weak_cong]; 

6922  605 

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

5931  608 

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

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

613 

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

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

615 
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

616 

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

6057  619 

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

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

6141  623 

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

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

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

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

630 
mk_solver: string > (thm list > int > tactic) > solver 
7619  631 
where the string argument is only a comment. 
6057  632 

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

633 

6069  634 
*** Proof tools *** 
635 

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

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

6069  640 

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

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

644 
matching. 

6069  645 

7593  646 

6014  647 
*** General *** 
648 

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

652 
readable proof documents (Isar == Intelligible semiautomated 

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

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

655 

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

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

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

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

7215  661 

7252  662 
* native support for Proof General, both for classic Isabelle and 
7986  663 
Isabelle/Isar; 
7215  664 

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

667 

6751  668 
* Isabelle manuals now also available as PDF; 
669 

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

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

6449  675 

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

678 

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

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

681 

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

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

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

685 

7215  686 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
687 

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

5973  690 

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

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

693 

6343  694 
* new print_mode "HTML"; 
695 

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

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

698 

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

701 

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

703 
244c244 

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

705 
 

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

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

710 
 

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

712 

7450  713 
* function bind_thms stores lists of theorems (cf. bind_thm); 
714 

7593  715 
* new shorthand tactics ftac, eatac, datac, fatac; 
716 

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

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

7593  720 

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

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

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

723 

6028  724 

6057  725 
*** HOL *** 
726 

7215  727 
** HOL arithmetic ** 
728 

6343  729 
* There are now decision procedures for linear arithmetic over nat and 
730 
int: 

6131  731 

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

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

735 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  740 

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

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

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

745 
simplifier. 

6131  746 

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

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

6028  750 

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

755 
type constraints; 

756 

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

758 
arguments; 

7157  759 

7215  760 
* many properties of integer multiplication, division and remainder 
761 
are now available; 

6922  762 

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

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

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

767 
invocation of the underlying oracle). For SVC see 

7444  768 
http://verify.stanford.edu/SVC 
6922  769 

7125  770 
* IsaMakefile: the HOLReal target now builds an actual image; 
771 

7215  772 

773 
** HOL misc ** 

774 

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

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

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

777 

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

780 

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

783 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

784 
changed syntax and (many) tactics; 

785 

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

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

789 
"mono" attribute); 

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

790 

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

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

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

793 

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

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

795 

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

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

7326  800 

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

802 
Delsimprocs [record_simproc] 

803 

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

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

805 
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

806 

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

809 

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

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

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

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

6563  814 

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

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

818 

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

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

820 
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

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

822 

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

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

824 
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

825 

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

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

827 
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

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

829 

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

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

834 

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

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

836 
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

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

838 

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

7492  841 

7215  842 

7113  843 
*** LK *** 
844 

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

7113  847 

848 
* the simplifier is now installed 

849 

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

850 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  851 

852 
* the classical reasoner now has a default rule database 

853 

854 

6064  855 
*** ZF *** 
856 

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

6269  858 
directly (as in HOL) over datatypes and the natural numbers; 
6064  859 

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

6064  862 

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

864 

6141  865 
* simplification automatically does freeness reasoning for datatype 
6269  866 
constructors; 
6141  867 

6269  868 
* automatic typeinference, with AddTCs command to insert new 
869 
typechecking rules; 

6155  870 

6269  871 
* datatype introduction rules are now added as Safe Introduction rules 
872 
to the claset; 

6155  873 

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

876 

6069  877 

6343  878 
*** Internal programming interfaces *** 
879 

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

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

881 

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

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

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

884 

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

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

886 

6343  887 
* tuned current_goals_markers semantics: begin / end goal avoids 
888 
printing empty lines; 

889 

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

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

892 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

894 

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

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

897 
mode to get Isabelle font glyphs as before; 

898 

899 
* refined token_translation interface; INCOMPATIBILITY: output length 

900 
now of type real instead of int; 

901 

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

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

905 
opposed to intratheory data slots offered via TheoryDataFun; 

906 

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

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

908 
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

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

912 

6343  913 

6064  914 

5781  915 
New in Isabelle981 (October 1998) 
916 
 

917 

5127  918 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  919 

5726  920 
* several changes of automated proof tools; 
5373  921 

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

5214  924 

5726  925 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  926 
called `inj_on'; 
5160  927 

5275  928 
* HOL: removed duplicate thms in Arith: 
929 
less_imp_add_less should be replaced by trans_less_add1 

930 
le_imp_add_le should be replaced by trans_le_add1 

5160  931 

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

5490  934 

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

937 
now taken as an integer constant. 

5541  938 

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

940 

5363  941 

5127  942 
*** Proof tools *** 
4880  943 

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

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

945 
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

946 
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

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

948 
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

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

950 
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

951 
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

952 
2. The simplifier now knows a little bit about natarithmetic. 
4880  953 

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

956 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

959 
one (emitting a warning). 

4824  960 
type wrapper = (int > tactic) > (int > tactic) 
4649  961 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  962 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
963 
delWrapper, delSWrapper: claset * string > claset 

4649  964 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
965 

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

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

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

970 
by Force_tac; 

5524  971 

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

5524  974 

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

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

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

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

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

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

983 
split_all_tac for record fields. 

5127  984 

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

987 
Addsimps. They can be removed via Delsplits just like 

988 
Delsimps. Lowercase versions are also available. 

5127  989 

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

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

993 
either remove split_if completely from the default simpset by 

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

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

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

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

998 
t is the name of the datatype). 

5127  999 

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

5726  1003 
aimed to solve the given subgoal completely. 
5127  1004 

1005 

1006 
*** General *** 

1007 

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

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

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

4842  1014 

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

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

1020 

5127  1021 
* new theory section 'nonterminals' for purely syntactic types; 
4858  1022 

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

4869  1025 

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

1028 

5363  1029 
* isatool install  install binaries with absolute references to 
1030 
ISABELLE_HOME/bin; 

1031 

5572  1032 
* isatool logo  create instances of the Isabelle logo (as EPS); 
1033 

5407  1034 
* print mode 'emacs' reserved for Isamode; 
1035 

5726  1036 
* support multiple print (ast) translations per constant name; 
1037 

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

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

1039 

4711  1040 

4661  1041 
*** HOL *** 
1042 

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

5217  1045 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  1046 
definitions such as 
5217  1047 

1048 
inductive EVEN ODD 

1049 
intrs 

1050 
null "0 : EVEN" 

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

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

1053 

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

1055 
recursive sets; inductive definitions now handle disjunctive premises 

1056 
correctly (also ZF); 

5214  1057 

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

1060 
contained in "induct"; 

1061 

1062 

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

5267  1064 
supports mutually recursive datatypes such as 
5217  1065 

1066 
datatype 

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

1068 
 SUM ('a aexp) ('a aexp) 

1069 
 DIFF ('a aexp) ('a aexp) 

1070 
 NUM 'a 

1071 
and 

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

1073 
 AND ('a bexp) ('a bexp) 

1074 
 OR ('a bexp) ('a bexp) 

1075 

5267  1076 
as well as indirectly recursive datatypes such as 
5214  1077 

5217  1078 
datatype 
1079 
('a, 'b) term = Var 'a 

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

5214  1081 

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

1084 

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

1086 
<function_name>.simps. 

1087 

1088 
INCOMPATIBILITIES: 

5214  1089 

5217  1090 
 Theories using datatypes must now have theory Datatype as an 
1091 
ancestor. 

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

1093 
generic induct_tac instead. 

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

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

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

1101 
some datatype definitions may have to be annotated with explicit 

1102 
sort constraints. 

1103 
 Primrec definitions no longer require function name and type 

1104 
of recursive argument. 

5214  1105 

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

1108 

1109 

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

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

1113 
support is as follows: 

1114 

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

1116 
constructor terms) are part of the standard simpset; 

1117 

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

1119 
made part of standard simpset and claset via addIffs; 

1120 

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

1122 
the standard claset (addSWrapper); 

1123 

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

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

1126 
the name of your record type. 

1127 

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

1129 

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

1131 

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

1133 
blow up into some record constructor term, consequently the 

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

1135 
solve record problems automatically. 

1136 

5214  1137 

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

1140 

5650  1141 
* automatic simplification of integer sums and comparisons, using cancellation; 
1142 

5526  1143 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  1144 

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

1146 

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

1148 

1149 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

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

1151 
with add/delsplits); 

5125  1152 

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

1155 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

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

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

1159 
%u.f(); 

5125  1160 

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

5109  1163 

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

1166 
disjointness reasoning but breaking a few old proofs. 

5267  1167 

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

1170 
literature); 

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

1171 

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

4838  1174 

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

1177 
release ONLY. 

1178 

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

1181 
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

1182 

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

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

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

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

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

5282  1191 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  1192 

5127  1193 
* HOL/Arith: 
1194 
 removed 'pred' (predecessor) function; 

1195 
 generalized some theorems about n1; 

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

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

4766  1198 

5127  1199 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  1200 
instead of "inverse"; 
4711  1201 

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

1204 

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

5127  1208 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  1209 

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

1212 

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

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

1216 

5363  1217 

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

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

1219 

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

5160  1222 

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

1225 
disjointness reasoning but breaking a few old proofs. 

5267  1226 

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

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

1230 

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

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

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

5308  1235 
Now rew can involve either definitions or equalities (either == or =). 
5142  1236 

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

1239 

4842  1240 

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

1242 

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

5207  1245 

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

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

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

1250 

5251  1251 
* removed global_names compatibility flag  all theory declarations 
1252 
are qualified by default; 

1253 

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

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

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

1257 

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

1260 

5207  1261 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
1262 
subgoal; 

5142  1263 

5251  1264 
* Display.print_goals function moved to Locale.print_goals; 
1265 

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

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

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

1270 
for example; 

1271 

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

1272 

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

1273 

4410  1274 
New in Isabelle98 (January 1998) 
1275 
 

1276 

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

1278 

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

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

1281 

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

1283 
simpset / simpset_ref; 

1284 

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

1286 
implicit merge of thms' signatures; 

1287 

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

1289 

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

1291 

3454  1292 

3715  1293 
*** General Changes *** 
1294 

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

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

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

1302 
backward campatibility problems try setting 'global_names' at compile 

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

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

1305 
section; 

4108  1306 

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

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

1309 
replaced by functions simpset:unit>simpset and 

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

1311 
to patch your ML files accordingly; 

3856  1312 

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

3901  1315 
usedir (see i option, ISABELLE_USEDIR_OPTIONS); 
3857  1316 

3856  1317 
* defs may now be conditional; improved rewrite_goals_tac to handle 
1318 
conditional equations; 

1319 

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

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

4112  1324 
restricted to 'trivial' ones; COMPATIBILITY: one may have to use 
3901  1325 
transfer:theory>thm>thm in (rare) cases; 
1326 

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

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

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

1329 

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

1332 

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

1334 
show_types); 

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

1335 

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

1337 

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

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

1339 

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

1341 

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

1343 

3715  1344 
* removed obsolete init_pps and init_database; 
1345 

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

1347 
fun STATE tacfun st = tacfun st st; 

1348 

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

4269  1351 

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

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

1354 
qualified references to the Sequence structure only!); 

1355 

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

4269  1358 

3715  1359 

1360 
*** Classical Reasoner *** 

1361 

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

1364 
splitting it into several subgoals; 

3715  1365 

3719  1366 
* Safe_tac: like safe_tac but uses the default claset; 
1367 

3715  1368 

1369 
*** Simplifier *** 

1370 

1371 
* added simplification meta rules: 

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

1373 

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

1375 
logics (again); 

1376 

1377 
* added prems argument to simplification procedures; 

1378 

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

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

1382 

3715  1383 

1384 
*** Syntax *** 

1385 

4174  1386 
* TYPE('a) syntax for type reflection terms; 
1387 

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

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

3846  1391 

3715  1392 
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; 
1393 

1394 

1395 
*** HOL *** 

1396 

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

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

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

4035  1403 
protocol TLS; 
3985  1404 

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

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

1409 
differences; simplification procedures nat_cancel_factor for 

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

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

4335  1413 

3580  1414 
* HOL/simplifier: terms of the form 
4325  1415 
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x) 
3580  1416 
are rewritten to 
4035  1417 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)', 
1418 
and those of the form 

4325  1419 
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) > R(x)' (or t=x) 
4035  1420 
are rewritten to 
1421 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) > R(t)', 

1422 

1423 
* HOL/datatype 

1424 
Each datatype `t' now comes with a theorem `split_t_case' of the form 

3580 