author  wenzelm 
Fri, 28 Sep 2001 19:23:58 +0200  
changeset 11633  c8945e0dc00b 
parent 11611  b0c69f4db64c 
child 11657  03c4a5c08a79 
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 

16 

11633  17 
*** Isar *** 
18 

19 
* Isar/Pure: renamed "antecedent" case to "rule_context"; 

20 

21 
* Isar/HOL: 'recdef' now fails on unfinished automated proofs, use 

22 
"(permissive)" option to recover old behavior; 

23 

24 
* Isar/HOL: 'inductive' now longer features separate (collective) 

25 
attributes for 'intros'; 

26 

27 

11474  28 
*** HOL *** 
29 

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

11437  32 

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

35 

36 
delSWrapper "split_all_tac" 

37 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

38 

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

11474  40 
MAY FAIL; 
11361  41 

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

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

45 
necessary to attach explicit type constraints; 

11307  46 

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

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

48 
expressions; 
11474  49 

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

11475  51 
Florian Kammüller; 
11474  52 

11611  53 
* HOL: eliminated global items 
54 

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

56 
type "unit" > "Product_Type.unit" 

57 

58 

11474  59 
*** ZF *** 
60 

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

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

63 

64 

65 
*** General *** 

66 

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

11474  69 
* Classical reasoner: renamed addaltern to addafter, addSaltern to 
70 
addSafter; 

71 

72 
* print modes "type_brackets" and "no_type_brackets" control output of 

11572  73 
nested => (types); the default behavior is "brackets"; 
11474  74 

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

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

79 

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

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

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

11551  85 

11314  86 

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

87 

11062  88 
New in Isabelle992 (February 2001) 
89 
 

90 

10224  91 
*** Overview of INCOMPATIBILITIES *** 
92 

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

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

96 

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

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

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

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

101 

10998  102 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
103 
gfp_Tarski to gfp_unfold; 

10224  104 

10288  105 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
106 

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

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

10793  110 

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

113 

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

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

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

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

119 
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

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

121 

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

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

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

124 

10224  125 

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

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

127 

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

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

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

132 
typewriter); 

133 

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

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

135 
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

136 

10858  137 
* some more standard symbols; see Appendix A of the system manual for 
11062  138 
the complete list of symbols defined in isabellesym.sty; 
10858  139 

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

142 
definitions); 

143 

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

146 
actual humanreadable proof documents. Please do not include goal 

147 
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

148 

11062  149 
* proper indentation of antiquoted output with proportional LaTeX 
150 
fonts; 

10862  151 

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

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

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

154 

11062  155 
* isatool unsymbolize tunes sources for plain ASCII communication; 
156 

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

157 

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

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

159 

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

162 
documents, due to unpredictable outcome and noncompositional proof 

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

164 
for Prologstyle synthesis of proven results; 

165 

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

168 

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

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

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

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

173 

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

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

176 

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

178 
statements as well; 

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

179 

11097  180 
* Pure: more robust selection of calculational rules; 
181 

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

184 

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

186 
lemmas, using the graph browser tool; 

187 

10944  188 
* Pure: predict failure of "show" in interactive mode; 
189 

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

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

191 

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

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

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

194 

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

198 

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

201 
the result to be shown in each case; 

202 

10770  203 
* HOL: added 'recdef_tc' command; 
204 

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

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

206 

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

207 

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

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

209 

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

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

211 
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

212 
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

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

215 

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

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

219 

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

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

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

224 
literature; 

225 

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

229 

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

232 

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

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

234 
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

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

236 

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

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

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

239 

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

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

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

242 

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

10756  245 

11094  246 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  247 

10858  248 

10474  249 
*** CTT *** 
250 

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

10474  253 

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

256 

10474  257 

10391  258 
*** General *** 
259 

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

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

263 
the Isabelle inference kernel has been greatly improved; 

264 

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

267 

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

270 

11124  271 
* system: support Poly/ML 4.0; 
272 

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

274 

10391  275 

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

276 

10103  277 
New in Isabelle991 (October 2000) 
278 
 

8015  279 

10003  280 
*** Overview of INCOMPATIBILITIES *** 
8014  281 

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

284 
issue the following ML commands: 

285 

286 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

287 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  288 

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

10003  291 

292 
* HOL: nat_less_induct renamed to less_induct; 

293 

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

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

8967  296 

10003  297 
select_equality > some_equality 
298 
select_eq_Ex > some_eq_ex 

299 
selectI2EX > someI2_ex 

300 
selectI2 > someI2 

301 
selectI > someI 

302 
select1_equality > some1_equality 

303 
Eps_sym_eq > some_sym_eq_trivial 

304 
Eps_eq > some_eq_trivial 

305 

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

307 

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

309 
instead); 

310 

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

312 
f.simps instead of f.rules; 

313 

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

315 

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

317 
sometimes be needed; 

318 

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

8014  320 

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

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

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

324 
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

325 
now "<*lex*>" instead of "**"; 
8705  326 

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

9971  329 

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

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

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

332 

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

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

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

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

336 

8848  337 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
338 

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

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

340 
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

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

342 

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

9908  345 

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

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

348 

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

9542  351 

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

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

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

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

356 

9612  357 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
358 

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

359 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  360 

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

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

363 

8014  364 

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

366 

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

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

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

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

371 

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

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

374 

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

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

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

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

378 

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

8566  382 

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

384 

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

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

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

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

388 

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

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

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

392 

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

393 

8184  394 
*** Isar *** 
395 

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

398 
accommodates incremental typeinference very nicely; 

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

399 

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

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

402 

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

405 
useful to collect intermediate results without explicit name 

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

407 
premises; 

8184  408 

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

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

412 
to theorems as "tags"; 

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

413 

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

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

416 

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

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

419 

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

421 

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

424 

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

427 
with the version in Provers/classical; 

9612  428 

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

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

431 

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

434 

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

9612  437 

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

439 
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

440 
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

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

442 

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

445 

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

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

448 
well (including splits); 

449 

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

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

452 

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

454 
of Simplifier and Classical reasoner); 

455 

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

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

458 
recdef) support case names and properly name parameters; 

9612  459 

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

462 
calculations; 

463 

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

465 
method anyway; 

466 

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

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

469 
foo.split foo.split_asm for each datatype; 

470 

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

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

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

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

475 

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

477 

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

479 

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

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

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

482 
proof states; 
8487  483 

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

8487  487 

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

491 
(for HOL datatypes); 

8534  492 

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

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

496 

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

498 

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

501 
(print_commands, print_methods etc.); 

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

502 

10003  503 
* Isar: added 'nothing'  the empty list of theorems; 
9239  504 

8184  505 

8014  506 
*** HOL *** 
507 

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

510 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

514 

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

8014  517 

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

518 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  519 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
520 
Rasmussen; 

8570  521 

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

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

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

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

525 
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

526 
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

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

528 

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

9542  531 

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

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

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

534 

10003  535 
* HOL/Lambda: converted into newstyle theory and document; 
9542  536 

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

539 
representation; very useful in avoiding lifting of operations; 

8848  540 

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

543 
well; admit "r" as field name; 

9542  544 

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

547 

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

549 
Types nat and int belong to this axclass; 

550 

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

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

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

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

8736  558 

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

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

9835  562 

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

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

566 

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

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

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

8603  572 

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

575 
termination conditions are proved automatically, these simplification 

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

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

578 
each equation; 

579 

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

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

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

582 
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

583 
invariant proof rule for while is applied. 
9457  584 

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

8925  587 

8848  588 
* HOL: theorems impI, allI, ballI bound as "strip"; 
589 

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

593 

10003  594 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  595 

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

8626  598 

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

601 

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

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

605 
bogus); 

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

606 

8412  607 

9542  608 
*** ZF *** 
609 

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

9542  612 

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

615 
making the algebraic laws unconditional; 

9542  616 

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

9542  619 

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

9542  622 

10003  623 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
624 
simplification; 

9388  625 

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

9388  628 

629 

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

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

631 

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

634 

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

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

637 

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

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

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

640 

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

643 
use instead the strong form, 

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

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

646 
from destructrules; 

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

647 

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

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

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

650 

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

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

652 

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

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

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

655 

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

658 
situations; 

659 

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

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

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

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

663 

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

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

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

666 

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

667 
* system: provide TAGS file for Isabelle sources; 
9052  668 

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

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

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

671 

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

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

673 
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

674 

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

677 

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

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

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

680 

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

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

683 

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

684 

8015  685 

7986  686 
New in Isabelle99 (October 1999) 
687 
 

4649  688 

5931  689 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
690 

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

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

7215  694 

695 
Delcongs [if_weak_cong]; 

6922  696 

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

5931  699 

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

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

704 

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

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

706 
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

707 

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

6057  710 

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

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

6141  714 

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

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

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

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

721 
mk_solver: string > (thm list > int > tactic) > solver 
7619  722 
where the string argument is only a comment. 
6057  723 

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

724 

6069  725 
*** Proof tools *** 
726 

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

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

6069  731 

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

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

735 
matching. 

6069  736 

7593  737 

6014  738 
*** General *** 
739 

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

743 
readable proof documents (Isar == Intelligible semiautomated 

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

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

746 

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

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

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

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

7215  752 

7252  753 
* native support for Proof General, both for classic Isabelle and 
7986  754 
Isabelle/Isar; 
7215  755 

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

758 

6751  759 
* Isabelle manuals now also available as PDF; 
760 

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

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

6449  766 

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

769 

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

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

772 

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

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

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

776 

7215  777 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
778 

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

5973  781 

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

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

784 

6343  785 
* new print_mode "HTML"; 
786 

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

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

789 

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

792 

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

794 
244c244 

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

796 
 

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

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

801 
 

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

803 

7450  804 
* function bind_thms stores lists of theorems (cf. bind_thm); 
805 

7593  806 
* new shorthand tactics ftac, eatac, datac, fatac; 
807 

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

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

7593  811 

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

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

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

814 

6028  815 

6057  816 
*** HOL *** 
817 

7215  818 
** HOL arithmetic ** 
819 

6343  820 
* There are now decision procedures for linear arithmetic over nat and 
821 
int: 

6131  822 

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

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

826 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  831 

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

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

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

836 
simplifier. 

6131  837 

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

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

6028  841 

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

846 
type constraints; 

847 

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

849 
arguments; 

7157  850 

7215  851 
* many properties of integer multiplication, division and remainder 
852 
are now available; 

6922  853 

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

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

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

858 
invocation of the underlying oracle). For SVC see 

7444  859 
http://verify.stanford.edu/SVC 
6922  860 

7125  861 
* IsaMakefile: the HOLReal target now builds an actual image; 
862 

7215  863 

864 
** HOL misc ** 

865 

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

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

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

868 

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

871 

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

874 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

875 
changed syntax and (many) tactics; 

876 

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

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

880 
"mono" attribute); 

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

881 

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

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

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

884 

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

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

886 

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

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

7326  891 

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

893 
Delsimprocs [record_simproc] 

894 

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

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

896 
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

897 

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

900 

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

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

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

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

6563  905 

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

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

909 

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

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

911 
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

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

913 

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

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

915 
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

916 

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

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

918 
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

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

920 

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

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

925 

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

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

927 
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

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

929 

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

7492  932 

7215  933 

7113  934 
*** LK *** 
935 

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

7113  938 

939 
* the simplifier is now installed 

940 

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

941 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  942 

943 
* the classical reasoner now has a default rule database 

944 

945 

6064  946 
*** ZF *** 
947 

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

6269  949 
directly (as in HOL) over datatypes and the natural numbers; 
6064  950 

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

6064  953 

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

955 

6141  956 
* simplification automatically does freeness reasoning for datatype 
6269  957 
constructors; 
6141  958 

6269  959 
* automatic typeinference, with AddTCs command to insert new 
960 
typechecking rules; 

6155  961 

6269  962 
* datatype introduction rules are now added as Safe Introduction rules 
963 
to the claset; 

6155  964 

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

967 

6069  968 

6343  969 
*** Internal programming interfaces *** 
970 

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

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

972 

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

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

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

975 

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

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

977 

6343  978 
* tuned current_goals_markers semantics: begin / end goal avoids 
979 
printing empty lines; 

980 

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

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

983 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

985 

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

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

988 
mode to get Isabelle font glyphs as before; 

989 

990 
* refined token_translation interface; INCOMPATIBILITY: output length 

991 
now of type real instead of int; 

992 

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

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

996 
opposed to intratheory data slots offered via TheoryDataFun; 

997 

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

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

999 
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

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

1003 

6343  1004 

6064  1005 

5781  1006 
New in Isabelle981 (October 1998) 
1007 
 

1008 

5127  1009 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  1010 

5726  1011 
* several changes of automated proof tools; 
5373  1012 

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

5214  1015 

5726  1016 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  1017 
called `inj_on'; 
5160  1018 

5275  1019 
* HOL: removed duplicate thms in Arith: 
1020 
less_imp_add_less should be replaced by trans_less_add1 

1021 
le_imp_add_le should be replaced by trans_le_add1 

5160  1022 

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

5490  1025 

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

1028 
now taken as an integer constant. 

5541  1029 

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

1031 

5363  1032 

5127  1033 
*** Proof tools *** 
4880  1034 

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

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

1036 
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

1037 
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

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

1039 
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

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

1041 
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

1042 
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

1043 
2. The simplifier now knows a little bit about natarithmetic. 
4880  1044 

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

1047 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

1050 
one (emitting a warning). 

4824  1051 
type wrapper = (int > tactic) > (int > tactic) 
4649  1052 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  1053 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
1054 
delWrapper, delSWrapper: claset * string > claset 

4649  1055 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
1056 

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

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

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

1061 
by Force_tac; 

5524  1062 

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

5524  1065 

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

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

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

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

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

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

1074 
split_all_tac for record fields. 

5127  1075 

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

1078 
Addsimps. They can be removed via Delsplits just like 

1079 
Delsimps. Lowercase versions are also available. 

5127  1080 

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

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

1084 
either remove split_if completely from the default simpset by 

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

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

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

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

1089 
t is the name of the datatype). 

5127  1090 

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

5726  1094 
aimed to solve the given subgoal completely. 
5127  1095 

1096 

1097 
*** General *** 

1098 

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

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

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

4842  1105 

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

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

1111 

5127  1112 
* new theory section 'nonterminals' for purely syntactic types; 
4858  1113 

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

4869  1116 

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

1119 

5363  1120 
* isatool install  install binaries with absolute references to 
1121 
ISABELLE_HOME/bin; 

1122 

5572  1123 
* isatool logo  create instances of the Isabelle logo (as EPS); 
1124 

5407  1125 
* print mode 'emacs' reserved for Isamode; 
1126 

5726  1127 
* support multiple print (ast) translations per constant name; 
1128 

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

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

1130 

4711  1131 

4661  1132 
*** HOL *** 
1133 

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

5217  1136 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  1137 
definitions such as 
5217  1138 

1139 
inductive EVEN ODD 

1140 
intrs 

1141 
null "0 : EVEN" 

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

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

1144 

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

1146 
recursive sets; inductive definitions now handle disjunctive premises 

1147 
correctly (also ZF); 

5214  1148 

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

1151 
contained in "induct"; 

1152 

1153 

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

5267  1155 
supports mutually recursive datatypes such as 
5217  1156 

1157 
datatype 

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

1159 
 SUM ('a aexp) ('a aexp) 

1160 
 DIFF ('a aexp) ('a aexp) 

1161 
 NUM 'a 

1162 
and 

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

1164 
 AND ('a bexp) ('a bexp) 

1165 
 OR ('a bexp) ('a bexp) 

1166 

5267  1167 
as well as indirectly recursive datatypes such as 
5214  1168 

5217  1169 
datatype 
1170 
('a, 'b) term = Var 'a 

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

5214  1172 

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

1175 

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

1177 
<function_name>.simps. 

1178 

1179 
INCOMPATIBILITIES: 

5214  1180 

5217  1181 
 Theories using datatypes must now have theory Datatype as an 
1182 
ancestor. 

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

1184 
generic induct_tac instead. 

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

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

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

1192 
some datatype definitions may have to be annotated with explicit 

1193 
sort constraints. 

1194 
 Primrec definitions no longer require function name and type 

1195 
of recursive argument. 

5214  1196 

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

1199 

1200 

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

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

1204 
support is as follows: 

1205 

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

1207 
constructor terms) are part of the standard simpset; 

1208 

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

1210 
made part of standard simpset and claset via addIffs; 

1211 

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

1213 
the standard claset (addSWrapper); 

1214 

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

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

1217 
the name of your record type. 

1218 

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

1220 

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

1222 

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

1224 
blow up into some record constructor term, consequently the 

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

1226 
solve record problems automatically. 

1227 

5214  1228 

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

1231 

5650  1232 
* automatic simplification of integer sums and comparisons, using cancellation; 
1233 

5526  1234 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  1235 

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

1237 

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

1239 

1240 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

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

1242 
with add/delsplits); 

5125  1243 

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

1246 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

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

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

1250 
%u.f(); 

5125  1251 

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

5109  1254 

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

1257 
disjointness reasoning but breaking a few old proofs. 

5267  1258 

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

1261 
literature); 

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

1262 

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

4838  1265 

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

1268 
release ONLY. 

1269 

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

1272 
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

1273 

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

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

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

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

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

5282  1282 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  1283 

5127  1284 
* HOL/Arith: 
1285 
 removed 'pred' (predecessor) function; 

1286 
 generalized some theorems about n1; 

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

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

4766  1289 

5127  1290 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  1291 
instead of "inverse"; 
4711  1292 

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

1295 

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

5127  1299 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  1300 

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

1303 

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

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

1307 

5363  1308 

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

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

1310 

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

5160  1313 

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

1316 
disjointness reasoning but breaking a few old proofs. 

5267  1317 

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

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

1321 

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

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

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

5308  1326 
Now rew can involve either definitions or equalities (either == or =). 
5142  1327 

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

1330 

4842  1331 

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

1333 

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

5207  1336 

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

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

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

1341 

5251  1342 
* removed global_names compatibility flag  all theory declarations 
1343 
are qualified by default; 

1344 

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

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

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

1348 

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

1351 

5207  1352 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
1353 
subgoal; 

5142  1354 

5251  1355 
* Display.print_goals function moved to Locale.print_goals; 
1356 

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

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

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

1361 
for example; 

1362 

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

1363 

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

1364 

4410  1365 
New in Isabelle98 (January 1998) 
1366 
 

1367 

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

1369 

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

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

1372 

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

1374 
simpset / simpset_ref; 

1375 

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

1377 
implicit merge of thms' signatures; 

1378 

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

1380 

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

1382 

3454  1383 

3715  1384 
*** General Changes *** 
1385 

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

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

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

1393 
backward campatibility problems try setting 'global_names' at compile 

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

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

1396 
section; 

4108  1397 

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

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

1400 
replaced by functions simpset:unit>simpset and 

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

1402 
to patch your ML files accordingly; 

3856  1403 

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

3901  1406 
usedir (see i option, ISABELLE_USEDIR_OPTIONS); 
3857  1407 

3856  1408 
* defs may now be conditional; improved rewrite_goals_tac to handle 
1409 
conditional equations; 

1410 

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

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

4112  1415 
restricted to 'trivial' ones; COMPATIBILITY: one may have to use 
3901  1416 
transfer:theory>thm>thm in (rare) cases; 
1417 

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

1418 
* improved handling of draft signatures / theories; draft thms (and 