author  wenzelm 
Thu, 04 Oct 2001 11:28:30 +0200  
changeset 11663  8a86409108fe 
parent 11657  03c4a5c08a79 
child 11690  cb64368fb405 
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 

11663
8a86409108fe
* moved induct/cases attributes to Pure, added 'print_induct_rules' command;
wenzelm
parents:
11657
diff
changeset

27 
* moved induct/cases attributes to Pure, added 'print_induct_rules' 
8a86409108fe
* moved induct/cases attributes to Pure, added 'print_induct_rules' command;
wenzelm
parents:
11657
diff
changeset

28 
command; 
8a86409108fe
* moved induct/cases attributes to Pure, added 'print_induct_rules' command;
wenzelm
parents:
11657
diff
changeset

29 

11633  30 

11474  31 
*** HOL *** 
32 

11657  33 
* HOL: linorder_less_split superseded by linorder_cases; 
34 

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

11437  37 

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

40 

41 
delSWrapper "split_all_tac" 

42 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

43 

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

11474  45 
MAY FAIL; 
11361  46 

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

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

50 
necessary to attach explicit type constraints; 

11307  51 

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

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

53 
expressions; 
11474  54 

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

11475  56 
Florian Kammüller; 
11474  57 

11611  58 
* HOL: eliminated global items 
59 

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

61 
type "unit" > "Product_Type.unit" 

62 

63 

11474  64 
*** ZF *** 
65 

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

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

68 

69 

70 
*** General *** 

71 

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

11474  74 
* Classical reasoner: renamed addaltern to addafter, addSaltern to 
75 
addSafter; 

76 

11657  77 
* syntax: support nonoriented infixes; 
78 

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

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

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

86 

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

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

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

11551  92 

11314  93 

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

94 

11062  95 
New in Isabelle992 (February 2001) 
96 
 

97 

10224  98 
*** Overview of INCOMPATIBILITIES *** 
99 

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

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

103 

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

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

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

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

108 

10998  109 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
110 
gfp_Tarski to gfp_unfold; 

10224  111 

10288  112 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
113 

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

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

10793  117 

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

120 

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

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

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

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

126 
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

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

128 

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

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

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

131 

10224  132 

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

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

134 

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

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

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

139 
typewriter); 

140 

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

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

142 
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

143 

10858  144 
* some more standard symbols; see Appendix A of the system manual for 
11062  145 
the complete list of symbols defined in isabellesym.sty; 
10858  146 

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

149 
definitions); 

150 

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

153 
actual humanreadable proof documents. Please do not include goal 

154 
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

155 

11062  156 
* proper indentation of antiquoted output with proportional LaTeX 
157 
fonts; 

10862  158 

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

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

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

161 

11062  162 
* isatool unsymbolize tunes sources for plain ASCII communication; 
163 

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

164 

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

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

166 

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

169 
documents, due to unpredictable outcome and noncompositional proof 

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

171 
for Prologstyle synthesis of proven results; 

172 

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

175 

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

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

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

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

180 

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

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

183 

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

185 
statements as well; 

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

186 

11097  187 
* Pure: more robust selection of calculational rules; 
188 

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

191 

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

193 
lemmas, using the graph browser tool; 

194 

10944  195 
* Pure: predict failure of "show" in interactive mode; 
196 

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

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

198 

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

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

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

201 

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

205 

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

208 
the result to be shown in each case; 

209 

10770  210 
* HOL: added 'recdef_tc' command; 
211 

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

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

213 

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

214 

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

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

216 

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

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

218 
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

219 
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

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

222 

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

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

226 

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

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

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

231 
literature; 

232 

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

236 

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

239 

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

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

241 
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

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

243 

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

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

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

246 

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

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

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

249 

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

10756  252 

11094  253 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  254 

10858  255 

10474  256 
*** CTT *** 
257 

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

10474  260 

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

263 

10474  264 

10391  265 
*** General *** 
266 

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

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

270 
the Isabelle inference kernel has been greatly improved; 

271 

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

274 

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

277 

11124  278 
* system: support Poly/ML 4.0; 
279 

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

281 

10391  282 

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

283 

10103  284 
New in Isabelle991 (October 2000) 
285 
 

8015  286 

10003  287 
*** Overview of INCOMPATIBILITIES *** 
8014  288 

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

291 
issue the following ML commands: 

292 

293 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

294 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  295 

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

10003  298 

299 
* HOL: nat_less_induct renamed to less_induct; 

300 

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

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

8967  303 

10003  304 
select_equality > some_equality 
305 
select_eq_Ex > some_eq_ex 

306 
selectI2EX > someI2_ex 

307 
selectI2 > someI2 

308 
selectI > someI 

309 
select1_equality > some1_equality 

310 
Eps_sym_eq > some_sym_eq_trivial 

311 
Eps_eq > some_eq_trivial 

312 

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

314 

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

316 
instead); 

317 

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

319 
f.simps instead of f.rules; 

320 

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

322 

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

324 
sometimes be needed; 

325 

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

8014  327 

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

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

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

331 
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

332 
now "<*lex*>" instead of "**"; 
8705  333 

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

9971  336 

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

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

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

339 

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

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

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

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

343 

8848  344 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
345 

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

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

347 
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

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

349 

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

9908  352 

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

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

355 

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

9542  358 

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

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

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

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

363 

9612  364 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
365 

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

366 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  367 

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

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

370 

8014  371 

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

373 

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

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

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

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

378 

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

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

381 

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

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

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

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

385 

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

8566  389 

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

391 

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

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

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

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

395 

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

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

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

399 

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

400 

8184  401 
*** Isar *** 
402 

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

405 
accommodates incremental typeinference very nicely; 

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

406 

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

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

409 

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

412 
useful to collect intermediate results without explicit name 

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

414 
premises; 

8184  415 

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

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

419 
to theorems as "tags"; 

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

420 

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

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

423 

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

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

426 

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

428 

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

431 

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

434 
with the version in Provers/classical; 

9612  435 

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

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

438 

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

441 

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

9612  444 

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

446 
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

447 
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

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

449 

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

452 

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

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

455 
well (including splits); 

456 

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

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

459 

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

461 
of Simplifier and Classical reasoner); 

462 

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

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

465 
recdef) support case names and properly name parameters; 

9612  466 

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

469 
calculations; 

470 

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

472 
method anyway; 

473 

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

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

476 
foo.split foo.split_asm for each datatype; 

477 

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

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

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

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

482 

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

484 

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

486 

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

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

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

489 
proof states; 
8487  490 

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

8487  494 

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

498 
(for HOL datatypes); 

8534  499 

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

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

503 

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

505 

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

508 
(print_commands, print_methods etc.); 

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

509 

10003  510 
* Isar: added 'nothing'  the empty list of theorems; 
9239  511 

8184  512 

8014  513 
*** HOL *** 
514 

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

517 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

521 

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

8014  524 

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

525 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  526 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
527 
Rasmussen; 

8570  528 

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

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

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

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

532 
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

533 
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

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

535 

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

9542  538 

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

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

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

541 

10003  542 
* HOL/Lambda: converted into newstyle theory and document; 
9542  543 

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

546 
representation; very useful in avoiding lifting of operations; 

8848  547 

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

550 
well; admit "r" as field name; 

9542  551 

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

554 

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

556 
Types nat and int belong to this axclass; 

557 

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

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

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

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

8736  565 

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

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

9835  569 

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

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

573 

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

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

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

8603  579 

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

582 
termination conditions are proved automatically, these simplification 

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

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

585 
each equation; 

586 

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

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

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

589 
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

590 
invariant proof rule for while is applied. 
9457  591 

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

8925  594 

8848  595 
* HOL: theorems impI, allI, ballI bound as "strip"; 
596 

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

600 

10003  601 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  602 

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

8626  605 

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

608 

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

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

612 
bogus); 

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

613 

8412  614 

9542  615 
*** ZF *** 
616 

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

9542  619 

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

622 
making the algebraic laws unconditional; 

9542  623 

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

9542  626 

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

9542  629 

10003  630 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
631 
simplification; 

9388  632 

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

9388  635 

636 

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

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

638 

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

641 

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

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

644 

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

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

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

647 

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

650 
use instead the strong form, 

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

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

653 
from destructrules; 

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

654 

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

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

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

657 

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

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

659 

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

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

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

662 

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

665 
situations; 

666 

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

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

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

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

670 

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

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

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

673 

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

674 
* system: provide TAGS file for Isabelle sources; 
9052  675 

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

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

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

678 

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

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

680 
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

681 

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

684 

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

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

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

687 

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

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

690 

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

691 

8015  692 

7986  693 
New in Isabelle99 (October 1999) 
694 
 

4649  695 

5931  696 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
697 

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

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

7215  701 

702 
Delcongs [if_weak_cong]; 

6922  703 

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

5931  706 

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

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

711 

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

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

713 
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

714 

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

6057  717 

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

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

6141  721 

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

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

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

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

728 
mk_solver: string > (thm list > int > tactic) > solver 
7619  729 
where the string argument is only a comment. 
6057  730 

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

731 

6069  732 
*** Proof tools *** 
733 

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

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

6069  738 

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

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

742 
matching. 

6069  743 

7593  744 

6014  745 
*** General *** 
746 

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

750 
readable proof documents (Isar == Intelligible semiautomated 

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

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

753 

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

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

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

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

7215  759 

7252  760 
* native support for Proof General, both for classic Isabelle and 
7986  761 
Isabelle/Isar; 
7215  762 

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

765 

6751  766 
* Isabelle manuals now also available as PDF; 
767 

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

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

6449  773 

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

776 

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

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

779 

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

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

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

783 

7215  784 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
785 

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

5973  788 

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

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

791 

6343  792 
* new print_mode "HTML"; 
793 

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

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

796 

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

799 

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

801 
244c244 

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

803 
 

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

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

808 
 

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

810 

7450  811 
* function bind_thms stores lists of theorems (cf. bind_thm); 
812 

7593  813 
* new shorthand tactics ftac, eatac, datac, fatac; 
814 

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

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

7593  818 

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

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

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

821 

6028  822 

6057  823 
*** HOL *** 
824 

7215  825 
** HOL arithmetic ** 
826 

6343  827 
* There are now decision procedures for linear arithmetic over nat and 
828 
int: 

6131  829 

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

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

833 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  838 

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

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

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

843 
simplifier. 

6131  844 

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

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

6028  848 

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

853 
type constraints; 

854 

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

856 
arguments; 

7157  857 

7215  858 
* many properties of integer multiplication, division and remainder 
859 
are now available; 

6922  860 

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

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

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

865 
invocation of the underlying oracle). For SVC see 

7444  866 
http://verify.stanford.edu/SVC 
6922  867 

7125  868 
* IsaMakefile: the HOLReal target now builds an actual image; 
869 

7215  870 

871 
** HOL misc ** 

872 

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

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

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

875 

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

878 

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

881 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

882 
changed syntax and (many) tactics; 

883 

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

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

887 
"mono" attribute); 

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

888 

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

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

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

891 

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

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

893 

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

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

7326  898 

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

900 
Delsimprocs [record_simproc] 

901 

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

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

903 
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

904 

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

907 

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

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

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

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

6563  912 

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

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

916 

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

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

918 
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

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

920 

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

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

922 
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

923 

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

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

925 
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

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

927 

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

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

932 

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

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

934 
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

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

936 

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

7492  939 

7215  940 

7113  941 
*** LK *** 
942 

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

7113  945 

946 
* the simplifier is now installed 

947 

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

948 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  949 

950 
* the classical reasoner now has a default rule database 

951 

952 

6064  953 
*** ZF *** 
954 

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

6269  956 
directly (as in HOL) over datatypes and the natural numbers; 
6064  957 

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

6064  960 

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

962 

6141  963 
* simplification automatically does freeness reasoning for datatype 
6269  964 
constructors; 
6141  965 

6269  966 
* automatic typeinference, with AddTCs command to insert new 
967 
typechecking rules; 

6155  968 

6269  969 
* datatype introduction rules are now added as Safe Introduction rules 
970 
to the claset; 

6155  971 

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

974 

6069  975 

6343  976 
*** Internal programming interfaces *** 
977 

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

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

979 

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

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

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

982 

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

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

984 

6343  985 
* tuned current_goals_markers semantics: begin / end goal avoids 
986 
printing empty lines; 

987 

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

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

990 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

992 

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

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

995 
mode to get Isabelle font glyphs as before; 

996 

997 
* refined token_translation interface; INCOMPATIBILITY: output length 

998 
now of type real instead of int; 

999 

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

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

1003 
opposed to intratheory data slots offered via TheoryDataFun; 

1004 

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

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

1006 
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

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

1010 

6343  1011 

6064  1012 

5781  1013 
New in Isabelle981 (October 1998) 
1014 
 

1015 

5127  1016 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  1017 

5726  1018 
* several changes of automated proof tools; 
5373  1019 

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

5214  1022 

5726  1023 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  1024 
called `inj_on'; 
5160  1025 

5275  1026 
* HOL: removed duplicate thms in Arith: 
1027 
less_imp_add_less should be replaced by trans_less_add1 

1028 
le_imp_add_le should be replaced by trans_le_add1 

5160  1029 

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

5490  1032 

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

1035 
now taken as an integer constant. 

5541  1036 

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

1038 

5363  1039 

5127  1040 
*** Proof tools *** 
4880  1041 

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

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

1043 
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

1044 
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

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

1046 
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

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

1048 
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

1049 
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

1050 
2. The simplifier now knows a little bit about natarithmetic. 
4880  1051 

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

1054 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

1057 
one (emitting a warning). 

4824  1058 
type wrapper = (int > tactic) > (int > tactic) 
4649  1059 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  1060 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
1061 
delWrapper, delSWrapper: claset * string > claset 

4649  1062 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
1063 

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

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

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

1068 
by Force_tac; 

5524  1069 

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

5524  1072 

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

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

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

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

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

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

1081 
split_all_tac for record fields. 

5127  1082 

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

1085 
Addsimps. They can be removed via Delsplits just like 

1086 
Delsimps. Lowercase versions are also available. 

5127  1087 

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

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

1091 
either remove split_if completely from the default simpset by 

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

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

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

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

1096 
t is the name of the datatype). 

5127  1097 

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

5726  1101 
aimed to solve the given subgoal completely. 
5127  1102 

1103 

1104 
*** General *** 

1105 

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

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

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

4842  1112 

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

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

1118 

5127  1119 
* new theory section 'nonterminals' for purely syntactic types; 
4858  1120 

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

4869  1123 

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

1126 

5363  1127 
* isatool install  install binaries with absolute references to 
1128 
ISABELLE_HOME/bin; 

1129 

5572  1130 
* isatool logo  create instances of the Isabelle logo (as EPS); 
1131 

5407  1132 
* print mode 'emacs' reserved for Isamode; 
1133 

5726  1134 
* support multiple print (ast) translations per constant name; 
1135 

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

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

1137 

4711  1138 

4661  1139 
*** HOL *** 
1140 

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

5217  1143 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  1144 
definitions such as 
5217  1145 

1146 
inductive EVEN ODD 

1147 
intrs 

1148 
null "0 : EVEN" 

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

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

1151 

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

1153 
recursive sets; inductive definitions now handle disjunctive premises 

1154 
correctly (also ZF); 

5214  1155 

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

1158 
contained in "induct"; 

1159 

1160 

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

5267  1162 
supports mutually recursive datatypes such as 
5217  1163 

1164 
datatype 

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

1166 
 SUM ('a aexp) ('a aexp) 

1167 
 DIFF ('a aexp) ('a aexp) 

1168 
 NUM 'a 

1169 
and 

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

1171 
 AND ('a bexp) ('a bexp) 

1172 
 OR ('a bexp) ('a bexp) 

1173 

5267  1174 
as well as indirectly recursive datatypes such as 
5214  1175 

5217  1176 
datatype 
1177 
('a, 'b) term = Var 'a 

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

5214  1179 

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

1182 

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

1184 
<function_name>.simps. 

1185 

1186 
INCOMPATIBILITIES: 

5214  1187 

5217  1188 
 Theories using datatypes must now have theory Datatype as an 
1189 
ancestor. 

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

1191 
generic induct_tac instead. 

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

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

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

1199 
some datatype definitions may have to be annotated with explicit 

1200 
sort constraints. 

1201 
 Primrec definitions no longer require function name and type 

1202 
of recursive argument. 

5214  1203 

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

1206 

1207 

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

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

1211 
support is as follows: 

1212 

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

1214 
constructor terms) are part of the standard simpset; 

1215 

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

1217 
made part of standard simpset and claset via addIffs; 

1218 

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

1220 
the standard claset (addSWrapper); 

1221 

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

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

1224 
the name of your record type. 

1225 

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

1227 

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

1229 

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

1231 
blow up into some record constructor term, consequently the 

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

1233 
solve record problems automatically. 

1234 

5214  1235 

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

1238 

5650  1239 
* automatic simplification of integer sums and comparisons, using cancellation; 
1240 

5526  1241 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  1242 

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

1244 

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

1246 

1247 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

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

1249 
with add/delsplits); 

5125  1250 

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

1253 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

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

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

1257 
%u.f(); 

5125  1258 

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

5109  1261 

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

1264 
disjointness reasoning but breaking a few old proofs. 

5267  1265 

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

1268 
literature); 

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

1269 

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

4838  1272 

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

1275 
release ONLY. 

1276 

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

1279 
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

1280 

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

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

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

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

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

5282  1289 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  1290 

5127  1291 
* HOL/Arith: 
1292 
 removed 'pred' (predecessor) function; 

1293 
 generalized some theorems about n1; 

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

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

4766  1296 

5127  1297 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  1298 
instead of "inverse"; 
4711  1299 

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

1302 

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

5127  1306 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  1307 

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

1310 

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

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

1314 

5363  1315 

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

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

1317 

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

5160  1320 

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

1323 
disjointness reasoning but breaking a few old proofs. 

5267  1324 

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

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

1328 

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

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

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

5308  1333 
Now rew can involve either definitions or equalities (either == or =). 
5142  1334 

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

1337 

4842  1338 

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

1340 

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

5207  1343 

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

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

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

1348 

5251  1349 
* removed global_names compatibility flag  all theory declarations 
1350 
are qualified by default; 

1351 

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

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

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

1355 

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

1358 

5207  1359 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
1360 
subgoal; 

5142  1361 

5251  1362 
* Display.print_goals function moved to Locale.print_goals; 
1363 

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

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

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

1368 
for example; 

1369 

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

1370 

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

1371 

4410  1372 
New in Isabelle98 (January 1998) 
1373 
 

1374 

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

1376 

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

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

1379 

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

1381 
simpset / simpset_ref; 

1382 

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

1384 
implicit merge of thms' signatures; 

1385 

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

1387 

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

1389 

3454  1390 

3715  1391 
*** General Changes *** 
1392 

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

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

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

1400 
backward campatibility problems try setting 'global_names' at compile 

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

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

1403 
section; 

4108  1404 

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

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

1407 
replaced by functions simpset:unit>simpset and 

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

1409 
to patch your ML files accordingly; 

3856  1410 

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

3901  1413 
usedir (see i option, ISABELLE_USEDIR_OPTIONS); 
3857  1414 

3856  1415 
* defs may now be conditional; improved rewrite_goals_tac to handle 
1416 
conditional equations; 

1417 

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

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

4112  1422 
restricted to 'trivial' ones; COMPATIBILITY: one may have to use 
3901  1423 
transfer:theory>thm>thm in (rare) cases; 
1424 

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

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

1426 
ctyps, cterms) are automatically promoted to real ones; 
ec138de716d9
improved handling of draft signatures / theories; draft thms (and
wenzelm
