author  paulson 
Mon, 06 Aug 2001 12:42:43 +0200  
changeset 11461  ffeac9aa1967 
parent 11437  2338bce575ae 
child 11474  d15bb7695339 
permissions  rwrr 
11437  1 

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

2553  4 

11437  5 
* HOL: added "The" definite description operator; 
6 

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

8 
nested => (types); the default behaviour is "brackets"; 

9 

10 
* Classical reasoner: renamed addaltern to addafter, addSaltern to 

11 
addSafter; 

11361  12 

11307  13 
* HOL: introduced f^n = f o ... o f 
14 
WARNING: due to the limits of Isabelle's type classes, ^ on functions and 

15 
relations has too general a domain, namely ('a * 'b)set and 'a => 'b. 

16 
This means that it may be necessary to attach explicit type constraints. 

17 

11437  18 
* HOL: added safe wrapper "split_conv_tac" to claset. EXISTING PROOFS 
19 
MAY FAIL; 

11172
3c82b641b642
added split_conv_tac (also to claset()) as an optimization
oheimb
parents:
11169
diff
changeset

20 

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

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

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

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

24 

11397  25 
* HOL/GroupTheory: group theory examples including Sylow's theorem, by Florian 
26 
Kammueller; 

27 

11314  28 
* ZF: the integer library now covers quotients and remainders, with many laws 
29 
relating division to addition, multiplication, etc.; 

30 

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

31 

11062  32 
New in Isabelle992 (February 2001) 
33 
 

34 

10224  35 
*** Overview of INCOMPATIBILITIES *** 
36 

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

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

40 

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

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

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

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

45 

10998  46 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
47 
gfp_Tarski to gfp_unfold; 

10224  48 

10288  49 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
50 

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

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

10793  54 

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

57 

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

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

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

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

63 
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

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

65 

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

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

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

68 

10224  69 

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

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

71 

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

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

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

76 
typewriter); 

77 

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

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

79 
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

80 

10858  81 
* some more standard symbols; see Appendix A of the system manual for 
11062  82 
the complete list of symbols defined in isabellesym.sty; 
10858  83 

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

86 
definitions); 

87 

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

90 
actual humanreadable proof documents. Please do not include goal 

91 
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

92 

11062  93 
* proper indentation of antiquoted output with proportional LaTeX 
94 
fonts; 

10862  95 

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

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

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

98 

11062  99 
* isatool unsymbolize tunes sources for plain ASCII communication; 
100 

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

101 

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

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

103 

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

106 
documents, due to unpredictable outcome and noncompositional proof 

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

108 
for Prologstyle synthesis of proven results; 

109 

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

112 

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

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

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

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

117 

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

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

120 

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

122 
statements as well; 

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

123 

11097  124 
* Pure: more robust selection of calculational rules; 
125 

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

128 

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

130 
lemmas, using the graph browser tool; 

131 

10944  132 
* Pure: predict failure of "show" in interactive mode; 
133 

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

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

135 

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

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

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

138 

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

142 

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

145 
the result to be shown in each case; 

146 

10770  147 
* HOL: added 'recdef_tc' command; 
148 

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

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

150 

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

151 

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

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

153 

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

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

155 
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

156 
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

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

159 

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

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

163 

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

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

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

168 
literature; 

169 

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

173 

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

176 

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

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

178 
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

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

180 

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

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

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

183 

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

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

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

186 

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

10756  189 

11094  190 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  191 

10858  192 

10474  193 
*** CTT *** 
194 

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

10474  197 

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

200 

10474  201 

10391  202 
*** General *** 
203 

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

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

207 
the Isabelle inference kernel has been greatly improved; 

208 

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

211 

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

214 

11124  215 
* system: support Poly/ML 4.0; 
216 

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

218 

10391  219 

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

220 

10103  221 
New in Isabelle991 (October 2000) 
222 
 

8015  223 

10003  224 
*** Overview of INCOMPATIBILITIES *** 
8014  225 

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

228 
issue the following ML commands: 

229 

230 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

231 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  232 

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

10003  235 

236 
* HOL: nat_less_induct renamed to less_induct; 

237 

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

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

8967  240 

10003  241 
select_equality > some_equality 
242 
select_eq_Ex > some_eq_ex 

243 
selectI2EX > someI2_ex 

244 
selectI2 > someI2 

245 
selectI > someI 

246 
select1_equality > some1_equality 

247 
Eps_sym_eq > some_sym_eq_trivial 

248 
Eps_eq > some_eq_trivial 

249 

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

251 

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

253 
instead); 

254 

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

256 
f.simps instead of f.rules; 

257 

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

259 

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

261 
sometimes be needed; 

262 

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

8014  264 

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

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

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

268 
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

269 
now "<*lex*>" instead of "**"; 
8705  270 

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

9971  273 

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

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

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

276 

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

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

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

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

280 

8848  281 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
282 

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

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

284 
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

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

286 

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

9908  289 

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

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

292 

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

9542  295 

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

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

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

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

300 

9612  301 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
302 

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

303 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  304 

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

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

307 

8014  308 

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

310 

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

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

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

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

315 

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

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

318 

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

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

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

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

322 

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

8566  326 

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

328 

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

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

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

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

332 

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

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

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

336 

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

337 

8184  338 
*** Isar *** 
339 

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

342 
accommodates incremental typeinference very nicely; 

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

343 

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

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

346 

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

349 
useful to collect intermediate results without explicit name 

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

351 
premises; 

8184  352 

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

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

356 
to theorems as "tags"; 

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

357 

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

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

360 

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

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

363 

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

365 

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

368 

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

371 
with the version in Provers/classical; 

9612  372 

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

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

375 

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

378 

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

9612  381 

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

383 
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

384 
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

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

386 

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

389 

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

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

392 
well (including splits); 

393 

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

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

396 

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

398 
of Simplifier and Classical reasoner); 

399 

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

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

402 
recdef) support case names and properly name parameters; 

9612  403 

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

406 
calculations; 

407 

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

409 
method anyway; 

410 

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

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

413 
foo.split foo.split_asm for each datatype; 

414 

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

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

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

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

419 

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

421 

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

423 

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

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

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

426 
proof states; 
8487  427 

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

8487  431 

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

435 
(for HOL datatypes); 

8534  436 

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

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

440 

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

442 

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

445 
(print_commands, print_methods etc.); 

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

446 

10003  447 
* Isar: added 'nothing'  the empty list of theorems; 
9239  448 

8184  449 

8014  450 
*** HOL *** 
451 

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

454 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

458 

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

8014  461 

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

462 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  463 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
464 
Rasmussen; 

8570  465 

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

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

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

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

469 
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

470 
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

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

472 

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

9542  475 

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

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

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

478 

10003  479 
* HOL/Lambda: converted into newstyle theory and document; 
9542  480 

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

483 
representation; very useful in avoiding lifting of operations; 

8848  484 

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

487 
well; admit "r" as field name; 

9542  488 

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

491 

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

493 
Types nat and int belong to this axclass; 

494 

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

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

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

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

8736  502 

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

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

9835  506 

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

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

510 

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

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

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

8603  516 

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

519 
termination conditions are proved automatically, these simplification 

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

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

522 
each equation; 

523 

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

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

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

526 
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

527 
invariant proof rule for while is applied. 
9457  528 

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

8925  531 

8848  532 
* HOL: theorems impI, allI, ballI bound as "strip"; 
533 

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

537 

10003  538 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  539 

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

8626  542 

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

545 

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

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

549 
bogus); 

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

550 

8412  551 

9542  552 
*** ZF *** 
553 

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

9542  556 

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

559 
making the algebraic laws unconditional; 

9542  560 

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

9542  563 

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

9542  566 

10003  567 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
568 
simplification; 

9388  569 

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

9388  572 

573 

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

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

575 

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

578 

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

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

581 

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

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

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

584 

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

587 
use instead the strong form, 

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

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

590 
from destructrules; 

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

591 

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

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

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

594 

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

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

596 

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

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

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

599 

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

602 
situations; 

603 

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

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

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

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

607 

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

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

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

610 

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

611 
* system: provide TAGS file for Isabelle sources; 
9052  612 

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

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

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

615 

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

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

617 
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

618 

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

621 

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

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

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

624 

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

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

627 

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

628 

8015  629 

7986  630 
New in Isabelle99 (October 1999) 
631 
 

4649  632 

5931  633 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
634 

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

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

7215  638 

639 
Delcongs [if_weak_cong]; 

6922  640 

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

5931  643 

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

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

648 

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

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

650 
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

651 

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

6057  654 

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

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

6141  658 

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

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

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

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

665 
mk_solver: string > (thm list > int > tactic) > solver 
7619  666 
where the string argument is only a comment. 
6057  667 

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

668 

6069  669 
*** Proof tools *** 
670 

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

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

6069  675 

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

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

679 
matching. 

6069  680 

7593  681 

6014  682 
*** General *** 
683 

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

687 
readable proof documents (Isar == Intelligible semiautomated 

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

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

690 

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

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

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

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

7215  696 

7252  697 
* native support for Proof General, both for classic Isabelle and 
7986  698 
Isabelle/Isar; 
7215  699 

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

702 

6751  703 
* Isabelle manuals now also available as PDF; 
704 

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

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

6449  710 

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

713 

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

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

716 

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

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

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

720 

7215  721 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
722 

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

5973  725 

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

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

728 

6343  729 
* new print_mode "HTML"; 
730 

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

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

733 

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

736 

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

738 
244c244 

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

740 
 

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

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

745 
 

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

747 

7450  748 
* function bind_thms stores lists of theorems (cf. bind_thm); 
749 

7593  750 
* new shorthand tactics ftac, eatac, datac, fatac; 
751 

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

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

7593  755 

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

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

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

758 

6028  759 

6057  760 
*** HOL *** 
761 

7215  762 
** HOL arithmetic ** 
763 

6343  764 
* There are now decision procedures for linear arithmetic over nat and 
765 
int: 

6131  766 

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

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

770 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  775 

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

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

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

780 
simplifier. 

6131  781 

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

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

6028  785 

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

790 
type constraints; 

791 

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

793 
arguments; 

7157  794 

7215  795 
* many properties of integer multiplication, division and remainder 
796 
are now available; 

6922  797 

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

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

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

802 
invocation of the underlying oracle). For SVC see 

7444  803 
http://verify.stanford.edu/SVC 
6922  804 

7125  805 
* IsaMakefile: the HOLReal target now builds an actual image; 
806 

7215  807 

808 
** HOL misc ** 

809 

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

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

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

812 

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

815 

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

818 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

819 
changed syntax and (many) tactics; 

820 

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

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

824 
"mono" attribute); 

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

825 

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

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

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

828 

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

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

830 

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

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

7326  835 

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

837 
Delsimprocs [record_simproc] 

838 

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

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

840 
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

841 

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

844 

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

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

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

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

6563  849 

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

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

853 

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

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

855 
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

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

857 

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

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

859 
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

860 

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

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

862 
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

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

864 

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

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

869 

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

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

871 
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

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

873 

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

7492  876 

7215  877 

7113  878 
*** LK *** 
879 

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

7113  882 

883 
* the simplifier is now installed 

884 

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

885 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  886 

887 
* the classical reasoner now has a default rule database 

888 

889 

6064  890 
*** ZF *** 
891 

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

6269  893 
directly (as in HOL) over datatypes and the natural numbers; 
6064  894 

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

6064  897 

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

899 

6141  900 
* simplification automatically does freeness reasoning for datatype 
6269  901 
constructors; 
6141  902 

6269  903 
* automatic typeinference, with AddTCs command to insert new 
904 
typechecking rules; 

6155  905 

6269  906 
* datatype introduction rules are now added as Safe Introduction rules 
907 
to the claset; 

6155  908 

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

911 

6069  912 

6343  913 
*** Internal programming interfaces *** 
914 

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

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

916 

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

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

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

919 

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

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

921 

6343  922 
* tuned current_goals_markers semantics: begin / end goal avoids 
923 
printing empty lines; 

924 

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

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

927 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

929 

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

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

932 
mode to get Isabelle font glyphs as before; 

933 

934 
* refined token_translation interface; INCOMPATIBILITY: output length 

935 
now of type real instead of int; 

936 

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

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

940 
opposed to intratheory data slots offered via TheoryDataFun; 

941 

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

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

943 
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

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

947 

6343  948 

6064  949 

5781  950 
New in Isabelle981 (October 1998) 
951 
 

952 

5127  953 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  954 

5726  955 
* several changes of automated proof tools; 
5373  956 

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

5214  959 

5726  960 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  961 
called `inj_on'; 
5160  962 

5275  963 
* HOL: removed duplicate thms in Arith: 
964 
less_imp_add_less should be replaced by trans_less_add1 

965 
le_imp_add_le should be replaced by trans_le_add1 

5160  966 

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

5490  969 

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

972 
now taken as an integer constant. 

5541  973 

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

975 

5363  976 

5127  977 
*** Proof tools *** 
4880  978 

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

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

980 
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

981 
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

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

983 
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

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

985 
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

986 
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

987 
2. The simplifier now knows a little bit about natarithmetic. 
4880  988 

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

991 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

994 
one (emitting a warning). 

4824  995 
type wrapper = (int > tactic) > (int > tactic) 
4649  996 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  997 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
998 
delWrapper, delSWrapper: claset * string > claset 

4649  999 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
1000 

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

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

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

1005 
by Force_tac; 

5524  1006 

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

5524  1009 

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

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

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

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

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

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

1018 
split_all_tac for record fields. 

5127  1019 

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

1022 
Addsimps. They can be removed via Delsplits just like 

1023 
Delsimps. Lowercase versions are also available. 

5127  1024 

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

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

1028 
either remove split_if completely from the default simpset by 

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

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

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

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

1033 
t is the name of the datatype). 

5127  1034 

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

5726  1038 
aimed to solve the given subgoal completely. 
5127  1039 

1040 

1041 
*** General *** 

1042 

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

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

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

4842  1049 

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

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

1055 

5127  1056 
* new theory section 'nonterminals' for purely syntactic types; 
4858  1057 

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

4869  1060 

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

1063 

5363  1064 
* isatool install  install binaries with absolute references to 
1065 
ISABELLE_HOME/bin; 

1066 

5572  1067 
* isatool logo  create instances of the Isabelle logo (as EPS); 
1068 

5407  1069 
* print mode 'emacs' reserved for Isamode; 
1070 

5726  1071 
* support multiple print (ast) translations per constant name; 
1072 

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

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

1074 

4711  1075 

4661  1076 
*** HOL *** 
1077 

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

5217  1080 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  1081 
definitions such as 
5217  1082 

1083 
inductive EVEN ODD 

1084 
intrs 

1085 
null "0 : EVEN" 

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

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

1088 

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

1090 
recursive sets; inductive definitions now handle disjunctive premises 

1091 
correctly (also ZF); 

5214  1092 

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

1095 
contained in "induct"; 

1096 

1097 

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

5267  1099 
supports mutually recursive datatypes such as 
5217  1100 

1101 
datatype 

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

1103 
 SUM ('a aexp) ('a aexp) 

1104 
 DIFF ('a aexp) ('a aexp) 

1105 
 NUM 'a 

1106 
and 

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

1108 
 AND ('a bexp) ('a bexp) 

1109 
 OR ('a bexp) ('a bexp) 

1110 

5267  1111 
as well as indirectly recursive datatypes such as 
5214  1112 

5217  1113 
datatype 
1114 
('a, 'b) term = Var 'a 

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

5214  1116 

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

1119 

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

1121 
<function_name>.simps. 

1122 

1123 
INCOMPATIBILITIES: 

5214  1124 

5217  1125 
 Theories using datatypes must now have theory Datatype as an 
1126 
ancestor. 

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

1128 
generic induct_tac instead. 

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

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

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

1136 
some datatype definitions may have to be annotated with explicit 

1137 
sort constraints. 

1138 
 Primrec definitions no longer require function name and type 

1139 
of recursive argument. 

5214  1140 

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

1143 

1144 

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

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

1148 
support is as follows: 

1149 

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

1151 
constructor terms) are part of the standard simpset; 

1152 

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

1154 
made part of standard simpset and claset via addIffs; 

1155 

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

1157 
the standard claset (addSWrapper); 

1158 

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

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

1161 
the name of your record type. 

1162 

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

1164 

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

1166 

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

1168 
blow up into some record constructor term, consequently the 

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

1170 
solve record problems automatically. 

1171 

5214  1172 

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

1175 

5650  1176 
* automatic simplification of integer sums and comparisons, using cancellation; 
1177 

5526  1178 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  1179 

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

1181 

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

1183 

1184 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

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

1186 
with add/delsplits); 

5125  1187 

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

1190 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

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

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

1194 
%u.f(); 

5125  1195 

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

5109  1198 

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

1201 
disjointness reasoning but breaking a few old proofs. 

5267  1202 

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

1205 
literature); 

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

1206 

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

4838  1209 

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

1212 
release ONLY. 

1213 

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

1216 
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

1217 

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

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

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

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

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

5282  1226 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  1227 

5127  1228 
* HOL/Arith: 
1229 
 removed 'pred' (predecessor) function; 

1230 
 generalized some theorems about n1; 

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

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

4766  1233 

5127  1234 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  1235 
instead of "inverse"; 
4711  1236 

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

1239 

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

5127  1243 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  1244 

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

1247 

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

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

1251 

5363  1252 

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

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

1254 

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

5160  1257 

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

1260 
disjointness reasoning but breaking a few old proofs. 

5267  1261 

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

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

1265 

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

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

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

5308  1270 
Now rew can involve either definitions or equalities (either == or =). 
5142  1271 

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

1274 

4842  1275 

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

1277 

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

5207  1280 

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

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

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

1285 

5251  1286 
* removed global_names compatibility flag  all theory declarations 
1287 
are qualified by default; 

1288 

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

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

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

1292 

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

1295 

5207  1296 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
1297 
subgoal; 

5142  1298 

5251  1299 
* Display.print_goals function moved to Locale.print_goals; 
1300 

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

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

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

1305 
for example; 

1306 

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

1307 

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

1308 

4410  1309 
New in Isabelle98 (January 1998) 
1310 
 

1311 

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

1313 

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

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

1316 

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

1318 
simpset / simpset_ref; 

1319 

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

1321 
implicit merge of thms' signatures; 

1322 

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

1324 

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

1326 

3454  1327 

3715  1328 
*** General Changes *** 
1329 

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

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

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

1337 
backward campatibility problems try setting 'global_names' at compile 

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

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

1340 
section; 

4108  1341 

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

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

1344 
replaced by functions simpset:unit>simpset and 

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

1346 
to patch your ML files accordingly; 

3856  1347 

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

3901  1350 
usedir (see i option, ISABELLE_USEDIR_OPTIONS); 
3857  1351 

3856  1352 
* defs may now be conditional; improved rewrite_goals_tac to handle 
1353 
conditional equations; 

1354 

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

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

4112  1359 
restricted to 'trivial' ones; COMPATIBILITY: one may have to use 
3901  1360 
transfer:theory>thm>thm in (rare) cases; 
1361 

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

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

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

1364 

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

1367 

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

1369 
show_types); 

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

1370 

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

1372 

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

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

1374 

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

1376 

3856  1377 
* replaced print_goals_ref hook by print_current_goals_fn and result_error_fn; 
3670
9fea3562f8c7
replaced print_goals_ref hook by print_current_goals_fn and
wenzelm
parents:
3658
diff
changeset

1378 

3715  1379 
* removed obsolete init_pps and init_database; 
1380 

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

1382 
fun STATE tacfun st = tacfun st st; 

1383 

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

4269  1386 

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

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

1389 
qualified references to the Sequence structure only!); 

1390 

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

4269  1393 

3715  1394 

1395 
*** Classical Reasoner *** 

1396 

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

1399 
splitting it into several subgoals; 

3715  1400 

3719  1401 
* Safe_tac: like safe_tac but uses the default claset; 
1402 

3715  1403 

1404 
*** Simplifier *** 

1405 

1406 
* added simplification meta rules: 

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

1408 

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

1410 
logics (again); 

1411 

1412 
* added prems argument to simplification procedures; 

1413 

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

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

1417 

3715  1418 

1419 
*** Syntax *** 

1420 

4174  1421 
* TYPE('a) syntax for type reflection terms; 
1422 

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

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