author  wenzelm 
Tue, 16 Oct 2001 22:59:30 +0200  
changeset 11814  1de4a3321976 
parent 11802  1d5f5d2427d2 
child 11817  875ee0c20da2 
permissions  rwrr 
11437  1 

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

2553  4 

11474  5 
New in Isabelle2001 (?? 2001) 
6 
 

7 

11572  8 
*** Document preparation *** 
9 

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

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

12 

11814  13 
* \<bullet> is now output as bold \cdot by default, which looks much 
11572  14 
better in printed text; 
15 

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

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

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

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

19 

11572  20 

11633  21 
*** Isar *** 
22 

11690  23 
* improved proof by cases and induction: 
11797  24 
 'case' command admits impromptu naming of parameters (such as 
25 
"case (Suc n)"); 

26 
 'induct' method divinates rule instantiation from the inductive 

27 
claim; no longer requires excessive ?P bindings for proper 

28 
instantiation of cases; 

29 
 'induct' method properly enumerates all possibilities of set/type 

30 
rules; as a consequence facts may be also passed through *type* 

31 
rules without further ado; 

32 
 removed obsolete "(simplified)" and "(stripped)" options of methods; 

11690  33 
 added 'print_induct_rules' (covered by help item in Proof General > 3.3); 
11797  34 
 moved induct/cases attributes to Pure, methods to Provers; 
35 
 generic method setup instantiated for FOL and HOL; 

11690  36 

11722  37 
* Pure: renamed "antecedent" case to "rule_context"; 
38 

11738  39 
* Pure: added 'corollary' command; 
40 

11722  41 
* Pure: fixed 'token_translation' command; 
42 

11745
06cd8c3b5487
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm
parents:
11738
diff
changeset

43 
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms; 
06cd8c3b5487
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm
parents:
11738
diff
changeset

44 

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

11690  48 
* HOL: 'inductive' now longer features separate (collective) 
11633  49 
attributes for 'intros'; 
50 

11797  51 
* HOL: canonical cases/induct rules for ntuples (n = 3..7); 
11788
60054fee3c16
canonical 'cases'/'induct' rules for ntuples (n=3..7)
kleing
parents:
11745
diff
changeset

52 

11633  53 

11474  54 
*** HOL *** 
55 

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

58 

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

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

61 

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

63 
binary representation internally; 

64 

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

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

67 

68 
This change may cause significant INCOMPATIBILITIES; here are some 

69 
hints on converting existing sources: 

70 

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

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

73 
to be spaced properly; 

74 

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

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

77 

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

79 

80 
 remove all special provisions on numerals in proofs; 

81 

11802
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset

82 
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A" 
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset

83 
(beware of argument permutation!); 
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset

84 

11657  85 
* HOL: linorder_less_split superseded by linorder_cases; 
86 

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

11437  89 

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

92 

93 
delSWrapper "split_all_tac" 

94 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

95 

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

11474  97 
MAY FAIL; 
11361  98 

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

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

102 
necessary to attach explicit type constraints; 

11307  103 

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

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

105 
expressions; 
11474  106 

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

11475  108 
Florian Kammüller; 
11474  109 

11611  110 
* HOL: eliminated global items 
111 

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

113 
type "unit" > "Product_Type.unit" 

114 

115 

11474  116 
*** ZF *** 
117 

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

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

120 

121 

122 
*** General *** 

123 

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

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

128 
so expressions involving minus need to be spaced properly; 

129 

11474  130 
* Classical reasoner: renamed addaltern to addafter, addSaltern to 
131 
addSafter; 

132 

11657  133 
* syntax: support nonoriented infixes; 
134 

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

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

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

142 

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

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

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

11551  148 

11314  149 

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

150 

11062  151 
New in Isabelle992 (February 2001) 
152 
 

153 

10224  154 
*** Overview of INCOMPATIBILITIES *** 
155 

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

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

159 

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

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

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

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

164 

10998  165 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
166 
gfp_Tarski to gfp_unfold; 

10224  167 

10288  168 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
169 

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

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

10793  173 

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

176 

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

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

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

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

182 
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

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

184 

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

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

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

187 

10224  188 

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

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

190 

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

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

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

195 
typewriter); 

196 

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

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

198 
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

199 

10858  200 
* some more standard symbols; see Appendix A of the system manual for 
11062  201 
the complete list of symbols defined in isabellesym.sty; 
10858  202 

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

205 
definitions); 

206 

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

209 
actual humanreadable proof documents. Please do not include goal 

210 
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

211 

11062  212 
* proper indentation of antiquoted output with proportional LaTeX 
213 
fonts; 

10862  214 

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

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

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

217 

11062  218 
* isatool unsymbolize tunes sources for plain ASCII communication; 
219 

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

220 

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

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

222 

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

225 
documents, due to unpredictable outcome and noncompositional proof 

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

227 
for Prologstyle synthesis of proven results; 

228 

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

231 

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

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

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

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

236 

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

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

239 

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

241 
statements as well; 

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

242 

11097  243 
* Pure: more robust selection of calculational rules; 
244 

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

247 

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

249 
lemmas, using the graph browser tool; 

250 

10944  251 
* Pure: predict failure of "show" in interactive mode; 
252 

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

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

254 

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

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

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

257 

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

261 

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

264 
the result to be shown in each case; 

265 

10770  266 
* HOL: added 'recdef_tc' command; 
267 

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

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

269 

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

270 

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

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

272 

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

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

274 
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

275 
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

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

278 

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

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

282 

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

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

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

287 
literature; 

288 

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

292 

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

295 

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

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

297 
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

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

299 

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

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

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

302 

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

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

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

305 

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

10756  308 

11094  309 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  310 

10858  311 

10474  312 
*** CTT *** 
313 

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

10474  316 

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

319 

10474  320 

10391  321 
*** General *** 
322 

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

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

326 
the Isabelle inference kernel has been greatly improved; 

327 

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

330 

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

333 

11124  334 
* system: support Poly/ML 4.0; 
335 

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

337 

10391  338 

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

339 

10103  340 
New in Isabelle991 (October 2000) 
341 
 

8015  342 

10003  343 
*** Overview of INCOMPATIBILITIES *** 
8014  344 

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

347 
issue the following ML commands: 

348 

349 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

350 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  351 

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

10003  354 

355 
* HOL: nat_less_induct renamed to less_induct; 

356 

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

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

8967  359 

10003  360 
select_equality > some_equality 
361 
select_eq_Ex > some_eq_ex 

362 
selectI2EX > someI2_ex 

363 
selectI2 > someI2 

364 
selectI > someI 

365 
select1_equality > some1_equality 

366 
Eps_sym_eq > some_sym_eq_trivial 

367 
Eps_eq > some_eq_trivial 

368 

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

370 

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

372 
instead); 

373 

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

375 
f.simps instead of f.rules; 

376 

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

378 

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

380 
sometimes be needed; 

381 

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

8014  383 

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

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

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

387 
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

388 
now "<*lex*>" instead of "**"; 
8705  389 

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

9971  392 

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

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

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

395 

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

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

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

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

399 

8848  400 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
401 

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

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

403 
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

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

405 

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

9908  408 

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

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

411 

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

9542  414 

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

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

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

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

419 

9612  420 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
421 

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

422 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  423 

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

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

426 

8014  427 

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

429 

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

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

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

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

434 

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

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

437 

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

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

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

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

441 

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

8566  445 

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

447 

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

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

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

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

451 

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

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

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

455 

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

456 

8184  457 
*** Isar *** 
458 

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

461 
accommodates incremental typeinference very nicely; 

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

462 

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

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

465 

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

468 
useful to collect intermediate results without explicit name 

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

470 
premises; 

8184  471 

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

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

475 
to theorems as "tags"; 

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

476 

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

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

479 

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

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

482 

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

484 

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

487 

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

490 
with the version in Provers/classical; 

9612  491 

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

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

494 

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

497 

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

9612  500 

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

502 
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

503 
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

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

505 

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

508 

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

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

511 
well (including splits); 

512 

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

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

515 

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

517 
of Simplifier and Classical reasoner); 

518 

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

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

521 
recdef) support case names and properly name parameters; 

9612  522 

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

525 
calculations; 

526 

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

528 
method anyway; 

529 

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

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

532 
foo.split foo.split_asm for each datatype; 

533 

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

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

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

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

538 

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

540 

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

542 

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

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

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

545 
proof states; 
8487  546 

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

8487  550 

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

554 
(for HOL datatypes); 

8534  555 

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

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

559 

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

561 

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

564 
(print_commands, print_methods etc.); 

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

565 

10003  566 
* Isar: added 'nothing'  the empty list of theorems; 
9239  567 

8184  568 

8014  569 
*** HOL *** 
570 

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

573 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

577 

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

8014  580 

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

581 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  582 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
583 
Rasmussen; 

8570  584 

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

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

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

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

588 
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

589 
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

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

591 

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

9542  594 

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

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

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

597 

10003  598 
* HOL/Lambda: converted into newstyle theory and document; 
9542  599 

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

602 
representation; very useful in avoiding lifting of operations; 

8848  603 

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

606 
well; admit "r" as field name; 

9542  607 

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

610 

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

612 
Types nat and int belong to this axclass; 

613 

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

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

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

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

8736  621 

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

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

9835  625 

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

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

629 

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

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

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

8603  635 

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

638 
termination conditions are proved automatically, these simplification 

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

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

641 
each equation; 

642 

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

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

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

645 
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

646 
invariant proof rule for while is applied. 
9457  647 

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

8925  650 

8848  651 
* HOL: theorems impI, allI, ballI bound as "strip"; 
652 

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

656 

10003  657 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  658 

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

8626  661 

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

664 

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

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

668 
bogus); 

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

669 

8412  670 

9542  671 
*** ZF *** 
672 

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

9542  675 

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

678 
making the algebraic laws unconditional; 

9542  679 

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

9542  682 

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

9542  685 

10003  686 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
687 
simplification; 

9388  688 

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

9388  691 

692 

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

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

694 

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

697 

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

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

700 

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

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

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

703 

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

706 
use instead the strong form, 

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

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

709 
from destructrules; 

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

710 

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

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

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

713 

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

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

715 

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

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

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

718 

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

721 
situations; 

722 

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

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

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

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

726 

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

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

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

729 

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

730 
* system: provide TAGS file for Isabelle sources; 
9052  731 

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

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

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

734 

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

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

736 
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

737 

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

740 

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

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

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

743 

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

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

746 

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

747 

8015  748 

7986  749 
New in Isabelle99 (October 1999) 
750 
 

4649  751 

5931  752 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
753 

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

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

7215  757 

758 
Delcongs [if_weak_cong]; 

6922  759 

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

5931  762 

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

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

767 

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

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

769 
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

770 

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

6057  773 

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

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

6141  777 

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

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

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

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

784 
mk_solver: string > (thm list > int > tactic) > solver 
7619  785 
where the string argument is only a comment. 
6057  786 

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

787 

6069  788 
*** Proof tools *** 
789 

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

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

6069  794 

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

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

798 
matching. 

6069  799 

7593  800 

6014  801 
*** General *** 
802 

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

806 
readable proof documents (Isar == Intelligible semiautomated 

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

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

809 

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

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

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

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

7215  815 

7252  816 
* native support for Proof General, both for classic Isabelle and 
7986  817 
Isabelle/Isar; 
7215  818 

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

821 

6751  822 
* Isabelle manuals now also available as PDF; 
823 

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

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

6449  829 

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

832 

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

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

835 

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

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

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

839 

7215  840 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
841 

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

5973  844 

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

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

847 

6343  848 
* new print_mode "HTML"; 
849 

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

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

852 

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

855 

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

857 
244c244 

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

859 
 

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

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

864 
 

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

866 

7450  867 
* function bind_thms stores lists of theorems (cf. bind_thm); 
868 

7593  869 
* new shorthand tactics ftac, eatac, datac, fatac; 
870 

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

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

7593  874 

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

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

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

877 

6028  878 

6057  879 
*** HOL *** 
880 

7215  881 
** HOL arithmetic ** 
882 

6343  883 
* There are now decision procedures for linear arithmetic over nat and 
884 
int: 

6131  885 

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

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

889 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  894 

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

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

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

899 
simplifier. 

6131  900 

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

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

6028  904 

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

909 
type constraints; 

910 

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

912 
arguments; 

7157  913 

7215  914 
* many properties of integer multiplication, division and remainder 
915 
are now available; 

6922  916 

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

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

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

921 
invocation of the underlying oracle). For SVC see 

7444  922 
http://verify.stanford.edu/SVC 
6922  923 

7125  924 
* IsaMakefile: the HOLReal target now builds an actual image; 
925 

7215  926 

927 
** HOL misc ** 

928 

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

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

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

931 

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

934 

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

937 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

938 
changed syntax and (many) tactics; 

939 

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

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

943 
"mono" attribute); 

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

944 

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

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

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

947 

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

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

949 

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

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

7326  954 

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

956 
Delsimprocs [record_simproc] 

957 

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

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

959 
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

960 

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

963 

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

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

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

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

6563  968 

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

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

972 

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

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

974 
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

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

976 

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

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

978 
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

979 

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

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

981 
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

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

983 

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

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

988 

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

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

990 
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

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

992 

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

7492  995 

7215  996 

7113  997 
*** LK *** 
998 

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

7113  1001 

1002 
* the simplifier is now installed 

1003 

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

1004 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  1005 

1006 
* the classical reasoner now has a default rule database 

1007 

1008 

6064  1009 
*** ZF *** 
1010 

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

6269  1012 
directly (as in HOL) over datatypes and the natural numbers; 
6064  1013 

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

6064  1016 

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

1018 

6141  1019 
* simplification automatically does freeness reasoning for datatype 
6269  1020 
constructors; 
6141  1021 

6269  1022 
* automatic typeinference, with AddTCs command to insert new 
1023 
typechecking rules; 

6155  1024 

6269  1025 
* datatype introduction rules are now added as Safe Introduction rules 
1026 
to the claset; 

6155  1027 

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

1030 

6069  1031 

6343  1032 
*** Internal programming interfaces *** 
1033 

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

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

1035 

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

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

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

1038 

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

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

1040 

6343  1041 
* tuned current_goals_markers semantics: begin / end goal avoids 
1042 
printing empty lines; 

1043 

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

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

1046 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

1048 

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

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

1051 
mode to get Isabelle font glyphs as before; 

1052 

1053 
* refined token_translation interface; INCOMPATIBILITY: output length 

1054 
now of type real instead of int; 

1055 

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

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

1059 
opposed to intratheory data slots offered via TheoryDataFun; 

1060 

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

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

1062 
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

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

1066 

6343  1067 

6064  1068 

5781  1069 
New in Isabelle981 (October 1998) 
1070 
 

1071 

5127  1072 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  1073 

5726  1074 
* several changes of automated proof tools; 
5373  1075 

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

5214  1078 

5726  1079 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  1080 
called `inj_on'; 
5160  1081 

5275  1082 
* HOL: removed duplicate thms in Arith: 
1083 
less_imp_add_less should be replaced by trans_less_add1 

1084 
le_imp_add_le should be replaced by trans_le_add1 

5160  1085 

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

5490  1088 

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

1091 
now taken as an integer constant. 

5541  1092 

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

1094 

5363  1095 

5127  1096 
*** Proof tools *** 
4880  1097 

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

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

1099 
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

1100 
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

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

1102 
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

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

1104 
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

1105 
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

1106 
2. The simplifier now knows a little bit about natarithmetic. 
4880  1107 

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

1110 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

1113 
one (emitting a warning). 

4824  1114 
type wrapper = (int > tactic) > (int > tactic) 
4649  1115 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  1116 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
1117 
delWrapper, delSWrapper: claset * string > claset 

4649  1118 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
1119 

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

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

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

1124 
by Force_tac; 

5524  1125 

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

5524  1128 

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

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

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

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

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

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

1137 
split_all_tac for record fields. 

5127  1138 

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

1141 
Addsimps. They can be removed via Delsplits just like 

1142 
Delsimps. Lowercase versions are also available. 

5127  1143 

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

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

1147 
either remove split_if completely from the default simpset by 

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

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

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

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

1152 
t is the name of the datatype). 

5127  1153 

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

5726  1157 
aimed to solve the given subgoal completely. 
5127  1158 

1159 

1160 
*** General *** 

1161 

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

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

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

4842  1168 

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

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

1174 

5127  1175 
* new theory section 'nonterminals' for purely syntactic types; 
4858  1176 

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

4869  1179 

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

1182 

5363  1183 
* isatool install  install binaries with absolute references to 
1184 
ISABELLE_HOME/bin; 

1185 

5572  1186 
* isatool logo  create instances of the Isabelle logo (as EPS); 
1187 

5407  1188 
* print mode 'emacs' reserved for Isamode; 
1189 

5726  1190 
* support multiple print (ast) translations per constant name; 
1191 

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

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

1193 

4711  1194 

4661  1195 
*** HOL *** 
1196 

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

5217  1199 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  1200 
definitions such as 
5217  1201 

1202 
inductive EVEN ODD 

1203 
intrs 

1204 
null "0 : EVEN" 

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

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

1207 

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

1209 
recursive sets; inductive definitions now handle disjunctive premises 

1210 
correctly (also ZF); 

5214  1211 

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

1214 
contained in "induct"; 

1215 

1216 

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

5267  1218 
supports mutually recursive datatypes such as 
5217  1219 

1220 
datatype 

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

1222 
 SUM ('a aexp) ('a aexp) 

1223 
 DIFF ('a aexp) ('a aexp) 

1224 
 NUM 'a 

1225 
and 

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

1227 
 AND ('a bexp) ('a bexp) 

1228 
 OR ('a bexp) ('a bexp) 

1229 

5267  1230 
as well as indirectly recursive datatypes such as 
5214  1231 

5217  1232 
datatype 
1233 
('a, 'b) term = Var 'a 

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

5214  1235 

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

1238 

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

1240 
<function_name>.simps. 

1241 

1242 
INCOMPATIBILITIES: 

5214  1243 

5217  1244 
 Theories using datatypes must now have theory Datatype as an 
1245 
ancestor. 

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

1247 
generic induct_tac instead. 

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

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

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

1255 
some datatype definitions may have to be annotated with explicit 

1256 
sort constraints. 

1257 
 Primrec definitions no longer require function name and type 

1258 
of recursive argument. 

5214  1259 

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

1262 

1263 

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

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

1267 
support is as follows: 

1268 

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

1270 
constructor terms) are part of the standard simpset; 

1271 

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

1273 
made part of standard simpset and claset via addIffs; 

1274 

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

1276 
the standard claset (addSWrapper); 

1277 

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

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

1280 
the name of your record type. 

1281 

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

1283 

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

1285 

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

1287 
blow up into some record constructor term, consequently the 

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

1289 
solve record problems automatically. 

1290 

5214  1291 

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

1294 

5650  1295 
* automatic simplification of integer sums and comparisons, using cancellation; 
1296 

5526  1297 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  1298 

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

1300 

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

1302 

1303 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

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

1305 
with add/delsplits); 

5125  1306 

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

1309 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

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

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

1313 
%u.f(); 

5125  1314 

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

5109  1317 

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

1320 
disjointness reasoning but breaking a few old proofs. 

5267  1321 

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

1324 
literature); 

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

1325 

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

4838  1328 

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

1331 
release ONLY. 

1332 

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

1335 
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

1336 

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

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

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

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

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

5282  1345 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  1346 

5127  1347 
* HOL/Arith: 
1348 
 removed 'pred' (predecessor) function; 

1349 
 generalized some theorems about n1; 

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

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

4766  1352 

5127  1353 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  1354 
instead of "inverse"; 
4711  1355 

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

1358 

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

5127  1362 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  1363 

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

1366 

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

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

1370 

5363  1371 

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

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

1373 

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

5160  1376 

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

1379 
disjointness reasoning but breaking a few old proofs. 

5267  1380 

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

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

1384 

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

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

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

5308  1389 
Now rew can involve either definitions or equalities (either == or =). 
5142  1390 

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

1393 

4842  1394 

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

1396 

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

5207  1399 

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

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

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

1404 

5251  1405 
* removed global_names compatibility flag  all theory declarations 
1406 
are qualified by default; 

1407 

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

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

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

1411 

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

1414 

5207  1415 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
1416 
subgoal; 

5142  1417 

5251  1418 
* Display.print_goals function moved to Locale.print_goals; 
1419 

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

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

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

1424 
for example; 

1425</ 