author  wenzelm 
Thu, 11 Oct 2001 21:25:45 +0200  
changeset 11722  78cf55fd57c6 
parent 11712  deb8cac87063 
child 11738  7c7a902a5c65 
permissions  rwrr 
11437  1 

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

2553  4 

11474  5 
New in Isabelle2001 (?? 2001) 
6 
 

7 

11572  8 
*** Document preparation *** 
9 

10 
* support bold style (for single symbols only), input syntax is like 

11 
this: "\<^bold>\<alpha>" or "\<^bold>A"; 

12 

13 
* \<bullet> is no output as bold \cdot by default, which looks much 

14 
better in printed text; 

15 

11712
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset

16 
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>; 
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset

17 
note that these symbols are currently unavailable in Proof General / 
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset

18 
XSymbol; 
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset

19 

11572  20 

11633  21 
*** Isar *** 
22 

11690  23 
* improved proof by cases and induction: 
24 
 moved induct/cases attributes to Pure; 

25 
 added 'print_induct_rules' (covered by help item in Proof General > 3.3); 

26 
 generic setup instantiated for FOL and HOL; 

27 
 removed obsolete "(simplified)" and "(stripped)" options; 

28 

11722  29 
* Pure: renamed "antecedent" case to "rule_context"; 
30 

31 
* Pure: fixed 'token_translation' command; 

32 

11690  33 
* HOL: 'recdef' now fails on unfinished automated proofs, use 
11633  34 
"(permissive)" option to recover old behavior; 
35 

11690  36 
* HOL: 'inductive' now longer features separate (collective) 
11633  37 
attributes for 'intros'; 
38 

39 

11474  40 
*** HOL *** 
41 

11702  42 
* HOL: moved over to sane numeral syntax; the new policy is as 
43 
follows: 

44 

45 
 0 and 1 are polymorphic constants, which are defined on any 

46 
numeric type (nat, int, real etc.); 

47 

48 
 2, 3, 4, ... and 1, 2, 3, ... are polymorphic numerals, based 

49 
binary representation internally; 

50 

51 
 type nat has special constructor Suc, and generally prefers Suc 0 

52 
over 1::nat and Suc (Suc 0) over 2::nat; 

53 

54 
This change may cause significant INCOMPATIBILITIES; here are some 

55 
hints on converting existing sources: 

56 

57 
 due to the new "num" token, "0" and "1" etc. are now atomic 

58 
entities, so expressions involving "" (unary or binary minus) need 

59 
to be spaced properly; 

60 

61 
 existing occurrences of "1" may need to be constraint "1::nat" or 

62 
even replaced by Suc 0; similar for old "2"; 

63 

64 
 replace "#nnn" by "nnn", and "#nnn" by "nnn"; 

65 

66 
 remove all special provisions on numerals in proofs; 

67 

11657  68 
* HOL: linorder_less_split superseded by linorder_cases; 
69 

11633  70 
* HOL: added "The" definite description operator; move Hilbert's "Eps" 
71 
to peripheral theory "Hilbert_Choice"; 

11437  72 

11572  73 
* HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so 
74 
in this (rare) case use: 

75 

76 
delSWrapper "split_all_tac" 

77 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

78 

79 
* HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS 

11474  80 
MAY FAIL; 
11361  81 

11572  82 
* HOL: introduced f^n = f o ... o f; warning: due to the limits of 
83 
Isabelle's type classes, ^ on functions and relations has too general 

84 
a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be 

85 
necessary to attach explicit type constraints; 

11307  86 

11487
95071c9e85a3
* HOL: syntax translations now work properly with numerals and records
wenzelm
parents:
11475
diff
changeset

87 
* HOL: syntax translations now work properly with numerals and records 
95071c9e85a3
* HOL: syntax translations now work properly with numerals and records
wenzelm
parents:
11475
diff
changeset

88 
expressions; 
11474  89 

90 
* HOL/GroupTheory: group theory examples including Sylow's theorem, by 

11475  91 
Florian Kammüller; 
11474  92 

11611  93 
* HOL: eliminated global items 
94 

95 
const "()" > "Product_Type.Unity" 

96 
type "unit" > "Product_Type.unit" 

97 

98 

11474  99 
*** ZF *** 
100 

101 
* ZF: the integer library now covers quotients and remainders, with 

102 
many laws relating division to addition, multiplication, etc.; 

103 

104 

105 
*** General *** 

106 

11633  107 
* Metalevel proof terms (by Stefan Berghofer), see also ref manual; 
108 

11700  109 
* new token syntax "num" for plain numerals (without "#" of "xnum"); 
110 
potential INCOMPATIBILITY, since 0, 1 etc. are now separate tokens, 

111 
so expressions involving minus need to be spaced properly; 

112 

11474  113 
* Classical reasoner: renamed addaltern to addafter, addSaltern to 
114 
addSafter; 

115 

11657  116 
* syntax: support nonoriented infixes; 
117 

11474  118 
* print modes "type_brackets" and "no_type_brackets" control output of 
11572  119 
nested => (types); the default behavior is "brackets"; 
11474  120 

11572  121 
* system: support Poly/ML 4.1.1 (now able to manage large heaps); 
11551  122 

11633  123 
* system: Proof General keywords specification is now part of the 
124 
Isabelle distribution (see etc/isarkeywords.el); 

125 

11551  126 
* system: smart selection of Isabelle process versus Isabelle 
11572  127 
interface, accommodates caseinsensitive file systems (e.g. HFS+); may 
128 
run both "isabelle" and "Isabelle" even if file names are badly 

129 
damaged (executable inspects the case of the first letter of its own 

130 
name); added separate "isabelleprocess" and "isabelleinterface"; 

11551  131 

11314  132 

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

133 

11062  134 
New in Isabelle992 (February 2001) 
135 
 

136 

10224  137 
*** Overview of INCOMPATIBILITIES *** 
138 

11241  139 
* HOL: please note that theories in the Library and elsewhere often use the 
140 
newstyle (Isar) format; to refer to their theorems in an ML script you must 

141 
bind them to ML identifers by e.g. val thm_name = thm "thm_name"; 

142 

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

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

144 
but only as far as specified by the introductions given; the old 
11130  145 
format may be recovered via ML function complete_split_rule or attribute 
11043
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset

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

147 

10998  148 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
149 
gfp_Tarski to gfp_unfold; 

10224  150 

10288  151 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
152 

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

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

10793  156 

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

159 

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

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

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

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

165 
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

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

167 

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

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

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

170 

10224  171 

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

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

173 

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

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

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

178 
typewriter); 

179 

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

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

181 
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

182 

10858  183 
* some more standard symbols; see Appendix A of the system manual for 
11062  184 
the complete list of symbols defined in isabellesym.sty; 
10858  185 

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

188 
definitions); 

189 

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

192 
actual humanreadable proof documents. Please do not include goal 

193 
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

194 

11062  195 
* proper indentation of antiquoted output with proportional LaTeX 
196 
fonts; 

10862  197 

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

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

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

200 

11062  201 
* isatool unsymbolize tunes sources for plain ASCII communication; 
202 

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

203 

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

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

205 

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

208 
documents, due to unpredictable outcome and noncompositional proof 

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

210 
for Prologstyle synthesis of proven results; 

211 

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

214 

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

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

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

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

219 

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

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

222 

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

224 
statements as well; 

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

225 

11097  226 
* Pure: more robust selection of calculational rules; 
227 

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

230 

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

232 
lemmas, using the graph browser tool; 

233 

10944  234 
* Pure: predict failure of "show" in interactive mode; 
235 

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

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

237 

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

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

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

240 

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

244 

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

247 
the result to be shown in each case; 

248 

10770  249 
* HOL: added 'recdef_tc' command; 
250 

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

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

252 

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

253 

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

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

255 

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

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

257 
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

258 
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

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

261 

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

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

265 

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

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

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

270 
literature; 

271 

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

275 

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

278 

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

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

280 
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

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

282 

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

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

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

285 

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

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

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

288 

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

10756  291 

11094  292 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  293 

10858  294 

10474  295 
*** CTT *** 
296 

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

10474  299 

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

302 

10474  303 

10391  304 
*** General *** 
305 

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

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

309 
the Isabelle inference kernel has been greatly improved; 

310 

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

313 

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

316 

11124  317 
* system: support Poly/ML 4.0; 
318 

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

320 

10391  321 

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

322 

10103  323 
New in Isabelle991 (October 2000) 
324 
 

8015  325 

10003  326 
*** Overview of INCOMPATIBILITIES *** 
8014  327 

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

330 
issue the following ML commands: 

331 

332 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

333 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  334 

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

10003  337 

338 
* HOL: nat_less_induct renamed to less_induct; 

339 

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

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

8967  342 

10003  343 
select_equality > some_equality 
344 
select_eq_Ex > some_eq_ex 

345 
selectI2EX > someI2_ex 

346 
selectI2 > someI2 

347 
selectI > someI 

348 
select1_equality > some1_equality 

349 
Eps_sym_eq > some_sym_eq_trivial 

350 
Eps_eq > some_eq_trivial 

351 

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

353 

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

355 
instead); 

356 

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

358 
f.simps instead of f.rules; 

359 

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

361 

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

363 
sometimes be needed; 

364 

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

8014  366 

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

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

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

370 
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

371 
now "<*lex*>" instead of "**"; 
8705  372 

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

9971  375 

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

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

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

378 

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

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

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

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

382 

8848  383 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
384 

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

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

386 
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

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

388 

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

9908  391 

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

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

394 

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

9542  397 

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

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

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

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

402 

9612  403 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
404 

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

405 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  406 

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

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

409 

8014  410 

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

412 

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

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

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

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

417 

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

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

420 

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

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

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

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

424 

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

8566  428 

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

430 

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

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

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

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

434 

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

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

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

438 

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

439 

8184  440 
*** Isar *** 
441 

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

444 
accommodates incremental typeinference very nicely; 

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

445 

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

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

448 

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

451 
useful to collect intermediate results without explicit name 

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

453 
premises; 

8184  454 

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

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

458 
to theorems as "tags"; 

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

459 

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

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

462 

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

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

465 

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

467 

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

470 

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

473 
with the version in Provers/classical; 

9612  474 

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

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

477 

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

480 

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

9612  483 

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

485 
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

486 
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

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

488 

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

491 

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

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

494 
well (including splits); 

495 

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

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

498 

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

500 
of Simplifier and Classical reasoner); 

501 

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

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

504 
recdef) support case names and properly name parameters; 

9612  505 

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

508 
calculations; 

509 

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

511 
method anyway; 

512 

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

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

515 
foo.split foo.split_asm for each datatype; 

516 

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

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

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

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

521 

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

523 

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

525 

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

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

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

528 
proof states; 
8487  529 

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

8487  533 

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

537 
(for HOL datatypes); 

8534  538 

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

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

542 

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

544 

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

547 
(print_commands, print_methods etc.); 

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

548 

10003  549 
* Isar: added 'nothing'  the empty list of theorems; 
9239  550 

8184  551 

8014  552 
*** HOL *** 
553 

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

556 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

560 

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

8014  563 

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

564 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  565 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
566 
Rasmussen; 

8570  567 

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

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

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

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

571 
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

572 
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

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

574 

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

9542  577 

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

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

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

580 

10003  581 
* HOL/Lambda: converted into newstyle theory and document; 
9542  582 

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

585 
representation; very useful in avoiding lifting of operations; 

8848  586 

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

589 
well; admit "r" as field name; 

9542  590 

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

593 

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

595 
Types nat and int belong to this axclass; 

596 

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

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

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

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

8736  604 

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

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

9835  608 

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

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

612 

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

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

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

8603  618 

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

621 
termination conditions are proved automatically, these simplification 

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

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

624 
each equation; 

625 

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

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

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

628 
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

629 
invariant proof rule for while is applied. 
9457  630 

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

8925  633 

8848  634 
* HOL: theorems impI, allI, ballI bound as "strip"; 
635 

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

639 

10003  640 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  641 

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

8626  644 

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

647 

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

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

651 
bogus); 

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

652 

8412  653 

9542  654 
*** ZF *** 
655 

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

9542  658 

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

661 
making the algebraic laws unconditional; 

9542  662 

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

9542  665 

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

9542  668 

10003  669 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
670 
simplification; 

9388  671 

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

9388  674 

675 

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

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

677 

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

680 

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

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

683 

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

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

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

686 

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

689 
use instead the strong form, 

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

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

692 
from destructrules; 

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

693 

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

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

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

696 

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

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

698 

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

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

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

701 

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

704 
situations; 

705 

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

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

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

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

709 

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

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

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

712 

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

713 
* system: provide TAGS file for Isabelle sources; 
9052  714 

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

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

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

717 

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

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

719 
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

720 

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

723 

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

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

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

726 

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

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

729 

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

730 

8015  731 

7986  732 
New in Isabelle99 (October 1999) 
733 
 

4649  734 

5931  735 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
736 

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

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

7215  740 

741 
Delcongs [if_weak_cong]; 

6922  742 

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

5931  745 

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

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

750 

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

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

752 
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

753 

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

6057  756 

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

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

6141  760 

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

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

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

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

767 
mk_solver: string > (thm list > int > tactic) > solver 
7619  768 
where the string argument is only a comment. 
6057  769 

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

770 

6069  771 
*** Proof tools *** 
772 

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

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

6069  777 

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

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

781 
matching. 

6069  782 

7593  783 

6014  784 
*** General *** 
785 

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

789 
readable proof documents (Isar == Intelligible semiautomated 

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

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

792 

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

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

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

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

7215  798 

7252  799 
* native support for Proof General, both for classic Isabelle and 
7986  800 
Isabelle/Isar; 
7215  801 

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

804 

6751  805 
* Isabelle manuals now also available as PDF; 
806 

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

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

6449  812 

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

815 

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

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

818 

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

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

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

822 

7215  823 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
824 

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

5973  827 

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

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

830 

6343  831 
* new print_mode "HTML"; 
832 

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

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

835 

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

838 

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

840 
244c244 

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

842 
 

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

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

847 
 

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

849 

7450  850 
* function bind_thms stores lists of theorems (cf. bind_thm); 
851 

7593  852 
* new shorthand tactics ftac, eatac, datac, fatac; 
853 

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

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

7593  857 

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

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

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

860 

6028  861 

6057  862 
*** HOL *** 
863 

7215  864 
** HOL arithmetic ** 
865 

6343  866 
* There are now decision procedures for linear arithmetic over nat and 
867 
int: 

6131  868 

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

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

872 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  877 

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

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

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

882 
simplifier. 

6131  883 

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

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

6028  887 

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

892 
type constraints; 

893 

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

895 
arguments; 

7157  896 

7215  897 
* many properties of integer multiplication, division and remainder 
898 
are now available; 

6922  899 

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

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

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

904 
invocation of the underlying oracle). For SVC see 

7444  905 
http://verify.stanford.edu/SVC 
6922  906 

7125  907 
* IsaMakefile: the HOLReal target now builds an actual image; 
908 

7215  909 

910 
** HOL misc ** 

911 

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

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

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

914 

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

917 

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

920 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

921 
changed syntax and (many) tactics; 

922 

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

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

926 
"mono" attribute); 

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

927 

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

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

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

930 

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

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

932 

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

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

7326  937 

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

939 
Delsimprocs [record_simproc] 

940 

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

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

942 
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

943 

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

946 

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

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

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

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

6563  951 

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

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

955 

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

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

957 
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

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

959 

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

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

961 
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

962 

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

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

964 
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

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

966 

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

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

971 

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

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

973 
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

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

975 

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

7492  978 

7215  979 

7113  980 
*** LK *** 
981 

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

7113  984 

985 
* the simplifier is now installed 

986 

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

987 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  988 

989 
* the classical reasoner now has a default rule database 

990 

991 

6064  992 
*** ZF *** 
993 

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

6269  995 
directly (as in HOL) over datatypes and the natural numbers; 
6064  996 

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

6064  999 

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

1001 

6141  1002 
* simplification automatically does freeness reasoning for datatype 
6269  1003 
constructors; 
6141  1004 

6269  1005 
* automatic typeinference, with AddTCs command to insert new 
1006 
typechecking rules; 

6155  1007 

6269  1008 
* datatype introduction rules are now added as Safe Introduction rules 
1009 
to the claset; 

6155  1010 

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

1013 

6069  1014 

6343  1015 
*** Internal programming interfaces *** 
1016 

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

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

1018 

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

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

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

1021 

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

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

1023 

6343  1024 
* tuned current_goals_markers semantics: begin / end goal avoids 
1025 
printing empty lines; 

1026 

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

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

1029 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

1031 

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

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

1034 
mode to get Isabelle font glyphs as before; 

1035 

1036 
* refined token_translation interface; INCOMPATIBILITY: output length 

1037 
now of type real instead of int; 

1038 

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

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

1042 
opposed to intratheory data slots offered via TheoryDataFun; 

1043 

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

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

1045 
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

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

1049 

6343  1050 

6064  1051 

5781  1052 
New in Isabelle981 (October 1998) 
1053 
 

1054 

5127  1055 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  1056 

5726  1057 
* several changes of automated proof tools; 
5373  1058 

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

5214  1061 

5726  1062 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  1063 
called `inj_on'; 
5160  1064 

5275  1065 
* HOL: removed duplicate thms in Arith: 
1066 
less_imp_add_less should be replaced by trans_less_add1 

1067 
le_imp_add_le should be replaced by trans_le_add1 

5160  1068 

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

5490  1071 

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

1074 
now taken as an integer constant. 

5541  1075 

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

1077 

5363  1078 

5127  1079 
*** Proof tools *** 
4880  1080 

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

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

1082 
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

1083 
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

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

1085 
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

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

1087 
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

1088 
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

1089 
2. The simplifier now knows a little bit about natarithmetic. 
4880  1090 

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

1093 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

1096 
one (emitting a warning). 

4824  1097 
type wrapper = (int > tactic) > (int > tactic) 
4649  1098 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  1099 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
1100 
delWrapper, delSWrapper: claset * string > claset 

4649  1101 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
1102 

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

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

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

1107 
by Force_tac; 

5524  1108 

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

5524  1111 

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

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

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

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

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

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

1120 
split_all_tac for record fields. 

5127  1121 

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

1124 
Addsimps. They can be removed via Delsplits just like 

1125 
Delsimps. Lowercase versions are also available. 

5127  1126 

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

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

1130 
either remove split_if completely from the default simpset by 

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

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

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

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

1135 
t is the name of the datatype). 

5127  1136 

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

5726  1140 
aimed to solve the given subgoal completely. 
5127  1141 

1142 

1143 
*** General *** 

1144 

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

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

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

4842  1151 

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

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

1157 

5127  1158 
* new theory section 'nonterminals' for purely syntactic types; 
4858  1159 

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

4869  1162 

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

1165 

5363  1166 
* isatool install  install binaries with absolute references to 
1167 
ISABELLE_HOME/bin; 

1168 

5572  1169 
* isatool logo  create instances of the Isabelle logo (as EPS); 
1170 

5407  1171 
* print mode 'emacs' reserved for Isamode; 
1172 

5726  1173 
* support multiple print (ast) translations per constant name; 
1174 

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

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

1176 

4711  1177 

4661  1178 
*** HOL *** 
1179 

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

5217  1182 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  1183 
definitions such as 
5217  1184 

1185 
inductive EVEN ODD 

1186 
intrs 

1187 
null "0 : EVEN" 

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

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

1190 

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

1192 
recursive sets; inductive definitions now handle disjunctive premises 

1193 
correctly (also ZF); 

5214  1194 

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

1197 
contained in "induct"; 

1198 

1199 

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

5267  1201 
supports mutually recursive datatypes such as 
5217  1202 

1203 
datatype 

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

1205 
 SUM ('a aexp) ('a aexp) 

1206 
 DIFF ('a aexp) ('a aexp) 

1207 
 NUM 'a 

1208 
and 

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

1210 
 AND ('a bexp) ('a bexp) 

1211 
 OR ('a bexp) ('a bexp) 

1212 

5267  1213 
as well as indirectly recursive datatypes such as 
5214  1214 

5217  1215 
datatype 
1216 
('a, 'b) term = Var 'a 

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

5214  1218 

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

1221 

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

1223 
<function_name>.simps. 

1224 

1225 
INCOMPATIBILITIES: 

5214  1226 

5217  1227 
 Theories using datatypes must now have theory Datatype as an 
1228 
ancestor. 

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

1230 
generic induct_tac instead. 

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

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

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

1238 
some datatype definitions may have to be annotated with explicit 

1239 
sort constraints. 

1240 
 Primrec definitions no longer require function name and type 

1241 
of recursive argument. 

5214  1242 

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

1245 

1246 

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

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

1250 
support is as follows: 

1251 

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

1253 
constructor terms) are part of the standard simpset; 

1254 

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

1256 
made part of standard simpset and claset via addIffs; 

1257 

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

1259 
the standard claset (addSWrapper); 

1260 

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

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

1263 
the name of your record type. 

1264 

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

1266 

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

1268 

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

1270 
blow up into some record constructor term, consequently the 

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

1272 
solve record problems automatically. 

1273 

5214  1274 

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

1277 

5650  1278 
* automatic simplification of integer sums and comparisons, using cancellation; 
1279 

5526  1280 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  1281 

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

1283 

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

1285 

1286 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

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

1288 
with add/delsplits); 

5125  1289 

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

1292 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

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

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

1296 
%u.f(); 

5125  1297 

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

5109  1300 

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

1303 
disjointness reasoning but breaking a few old proofs. 

5267  1304 

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

1307 
literature); 

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

1308 

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

4838  1311 

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

1314 
release ONLY. 

1315 

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

1318 
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

1319 

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

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

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

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

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

5282  1328 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  1329 

5127  1330 
* HOL/Arith: 
1331 
 removed 'pred' (predecessor) function; 

1332 
 generalized some theorems about n1; 

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

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

4766  1335 

5127  1336 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  1337 
instead of "inverse"; 
4711  1338 

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

1341 

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

5127  1345 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  1346 

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

1349 

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

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

1353 

5363  1354 

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

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

1356 

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

5160  1359 

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

1362 
disjointness reasoning but breaking a few old proofs. 

5267  1363 

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

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

1367 

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

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

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

5308  1372 
Now rew can involve either definitions or equalities (either == or =). 
5142  1373 

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

1376 

4842  1377 

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

1379 

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

5207  1382 

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

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

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

1387 

5251  1388 
* removed global_names compatibility flag  all theory declarations 
1389 
are qualified by default; 

1390 

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

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

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

1394 

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

1397 

5207  1398 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
1399 
subgoal; 

5142  1400 

5251  1401 
* Display.print_goals function moved to Locale.print_goals; 
1402 

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

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

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

1407 
for example; 

1408 

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

1409 

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

1410 

4410  1411 
New in Isabelle98 (January 1998) 
1412 
 

1413 

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

1415 

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

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

1418 

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

1420 
simpset / simpset_ref; 

1421 

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

1423 
implicit merge of thms' signatures; 

1424 

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

1426 
