author  ballarin 
Thu, 28 Nov 2002 10:50:42 +0100  
changeset 13735  7de9342aca7a 
parent 13648  610cedff5538 
child 13745  a31e04831dd1 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

4 
New in this Isabelle release 
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

5 
 
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

6 

306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

7 
*** General *** 
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

8 

13735  9 
* Provers/linorder: New generic prover for transitivity reasoning over 
10 
linear orders. Note: this prover is not efficient! 

11 

13618  12 
* Provers/simplifier: 
13 

14 
 Completely reimplemented Asm_full_simp_tac: 

15 
Assumptions are now subject to complete mutual simplification, 

16 
not just from left to right. The simplifier now preserves 

17 
the order of assumptions. 

18 

19 
Potential INCOMPATIBILITY: 

20 

21 
 Asm_full_simp_tac sometimes diverges where the old version did 

22 
not, e.g. invoking Asm_full_simp_tac on the goal 

23 

24 
[ P (f x); y = x; f x = f y ] ==> Q 

25 

26 
now gives rise to the infinite reduction sequence 

27 

28 
P (f x) (f x = f y)> P (f y) (y = x)> P (f x) (f x = f y)> ... 

29 

30 
Using Asm_lr_simp_tac (or "simp (asm_lr)" in Isabelle/Isar) instead 

31 
often solves this kind of problem. 

32 

33 
 Tactics combining classical reasoner and simplification (such 

34 
as auto) are also affected by this change, because many of them 

35 
rely on Asm_full_simp_tac. They may sometimes diverge as well 

36 
or yield a different numbers of subgoals. Try to use e.g. force, 

37 
fastsimp, or safe instead of auto in case of problems. Sometimes 

38 
subsequent calls to the classical reasoner will fail because a 

39 
preceeding call to the simplifier too eagerly simplified the 

40 
goal, e.g. deleted redundant premises. 

41 

42 
 The simplifier trace now shows the names of the applied rewrite rules 

43 

13644  44 
* Pure: new flag trace_unify_fail causes unification to print 
45 
diagnostic information (PG: in trace buffer) when it fails. This is 

46 
useful for figuring out why single step proofs like rule, erule or 

47 
assumption failed. 

48 

13648  49 
* Pure: you can find all matching introduction rules for subgoal 1, 
50 
i.e. all rules whose conclusion matches subgoal 1, by executing 

51 
ML"ProofGeneral.print_intros()" 

52 
The rules are ordered by how closely they match the subgoal. 

53 
In particular, rules that solve a subgoal outright are displayed first 

54 
(or rather last, the way it is printed). 

55 
TODO: integration with PG 

56 

13410
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

57 
* Pure: locale specifications now produce predicate definitions 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

58 
according to the body of text (covering assumptions modulo local 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

59 
definitions); predicate "loc_axioms" covers newly introduced text, 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

60 
while "loc" is cumulative wrt. all included locale expressions; the 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

61 
latter view is presented only on export into the global theory 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

62 
context; potential INCOMPATIBILITY, use "(open)" option to fall back 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

63 
on the old view without predicates; 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

64 

13459
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset

65 
* Pure: predefined locales "var" and "struct" are useful for sharing 
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset

66 
parameters (as in CASL, for example); just specify something like 
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset

67 
``var x + var y + struct M'' as import; 
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset

68 

13463
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

69 
* Pure: improved thms_containing: proper indexing of facts instead of 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

70 
raw theorems; check validity of results wrt. current name space; 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

71 
include local facts of proof configuration (also covers active 
13541  72 
locales), cover fixed variables in index; may use "_" in term 
73 
specification; an optional limit for the number of printed facts may 

74 
be given (the default is 40); 

75 

76 
* Pure: disallow duplicate fact bindings within newstyle theory files 

77 
(batchmode only); 

13540
aede0306e214
* Pure: disallow duplicate fact bindings within newstyle theory files;
wenzelm
parents:
13522
diff
changeset

78 

13463
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

79 
* Provers: improved induct method: assumptions introduced by case 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

80 
"foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

81 
the goal statement); "foo" still refers to all facts collectively; 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

82 

13550  83 
* Provers: the function blast.overloaded has been removed: all constants 
84 
are regarded as potentially overloaded, which improves robustness in exchange 

85 
for slight decrease in efficiency; 

86 

13522
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset

87 
* Isar: preview of problems to finish 'show' now produce an error 
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset

88 
rather than just a warning (in interactive mode); 
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset

89 

13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

90 

13158  91 
*** HOL *** 
92 

13735  93 
* New tactic "trans_tac" and method "trans" instantiate 
94 
Provers/linorder.ML for axclasses "order" and "linorder" (predicates 

95 
"<=", "<" and "="). 

96 

13587  97 
* function INCOMPATIBILITIES: Pisets have been redefined and moved from main 
98 
HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp"; 

99 

13443  100 
* 'typedef' command has new option "open" to suppress the set 
101 
definition; 

102 

13522
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset

103 
* functions Min and Max on finite sets have been introduced (theory 
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset

104 
Finite_Set); 
13492  105 

13443  106 
* attribute [symmetric] now works for relations as well; it turns 
107 
(x,y) : R^1 into (y,x) : R, and vice versa; 

108 

13500  109 
* arith(_tac) now produces a counter example if it cannot prove a theorem. 
110 
In ProofGeneral the counter example appears in the trace buffer. 

111 

13443  112 
* arith(_tac) does now know about div k and mod k where k is a numeral 
113 
of type nat or int. It can solve simple goals like 

114 

13344  115 
"0 < n ==> n div 2 < (n::nat)" 
13443  116 

117 
but fails if divisibility plays a role like in 

118 

119 
"n div 2 + (n+1) div 2 = (n::nat)" 

120 

121 
* simp's arithmetic capabilities have been enhanced a bit: it now 

122 
takes ~= in premises into account (by performing a case split); 

13158  123 

13549  124 
* simp reduces "m*(n div m) + n mod m" to n, even if the two summands 
125 
are distributed over a sum of terms; 

126 

13613  127 
* induct over a !!quantified statement (say !!x1..xn): 
128 
each "case" automatically performs "fix x1 .. xn" with exactly those names. 

129 

13587  130 
* GroupTheory: converted to Isar theories, using locales with implicit structures; 
131 

13549  132 
* Real/HahnBanach: updated and adapted to locales; 
133 

134 

135 
*** ZF *** 

136 

137 
* ZF/Constructible: consistency proof for AC (Gödel's constructible 

138 
universe, etc.); 

139 

140 
* Main ZF: many theories converted to newstyle format; 

13518  141 

13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

142 

13478  143 
*** ML *** 
144 

145 
* Pure: Tactic.prove provides sane interface for internal proofs; 

146 
omits the infamous "standard" operation, so this is more appropriate 

147 
than prove_goalw_cterm in many situations (e.g. in simprocs); 

148 

149 
* Pure: improved error reporting of simprocs; 

150 

151 
* Provers: Simplifier.simproc(_i) provides sane interface for setting 

152 
up simprocs; 

153 

154 

13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

155 

12984  156 
New in Isabelle2002 (March 2002) 
157 
 

11474  158 

11572  159 
*** Document preparation *** 
160 

11842
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

161 
* greatly simplified document preparation setup, including more 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

162 
graceful interpretation of isatool usedir i/d/D options, and more 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

163 
instructive isatool mkdir; users should basically be able to get 
12899
7d5b690253ee
"isatool usedir D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset

164 
started with "isatool mkdir HOL Test && isatool make"; alternatively, 
7d5b690253ee
"isatool usedir D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset

165 
users may run a separate document processing stage manually like this: 
7d5b690253ee
"isatool usedir D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset

166 
"isatool usedir D output HOL Test && isatool document Test/output"; 
11842
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

167 

b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

168 
* theory dependency graph may now be incorporated into documents; 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

169 
isatool usedir g true will produce session_graph.eps/.pdf for use 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

170 
with \includegraphics of LaTeX; 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

171 

11864
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset

172 
* proper spacing of consecutive markup elements, especially text 
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset

173 
blocks after section headings; 
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset

174 

11572  175 
* support bold style (for single symbols only), input syntax is like 
176 
this: "\<^bold>\<alpha>" or "\<^bold>A"; 

177 

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

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

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

182 
note that these symbols are currently unavailable in Proof General / 
12769  183 
XSymbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>; 
12690  184 

185 
* isatool latex no longer depends on changed TEXINPUTS, instead 

186 
isatool document copies the Isabelle style files to the target 

187 
location; 

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

188 

11572  189 

11633  190 
*** Isar *** 
191 

12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

192 
* Pure/Provers: improved proof by cases and induction; 
12280  193 
 'case' command admits impromptu naming of parameters (such as 
194 
"case (Suc n)"); 

195 
 'induct' method divinates rule instantiation from the inductive 

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

197 
instantiation of cases; 

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

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

200 
rules without further ado; 

201 
 'induct' method now derives symbolic cases from the *rulified* 

202 
rule (before it used to rulify cases stemming from the internal 

203 
atomized version); this means that the context of a nonatomic 

204 
statement becomes is included in the hypothesis, avoiding the 

205 
slightly cumbersome show "PROP ?case" form; 

206 
 'induct' may now use elimstyle induction rules without chaining 

207 
facts, using ``missing'' premises from the goal state; this allows 

208 
rules stemming from inductive sets to be applied in unstructured 

209 
scripts, while still benefitting from proper handling of nonatomic 

210 
statements; NB: major inductive premises need to be put first, all 

211 
the rest of the goal is passed through the induction; 

212 
 'induct' proper support for mutual induction involving nonatomic 

213 
rule statements (uses the new concept of simultaneous goals, see 

214 
below); 

12853  215 
 append all possible rule selections, but only use the first 
216 
success (no backtracking); 

11995
4a622f5fb164
 'induct' may now use elimstyle induction rules without chaining
wenzelm
parents:
11986
diff
changeset

217 
 removed obsolete "(simplified)" and "(stripped)" options of methods; 
12754
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset

218 
 undeclared rule case names default to numbers 1, 2, 3, ...; 
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset

219 
 added 'print_induct_rules' (covered by help item in recent Proof 
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset

220 
General versions); 
11995
4a622f5fb164
 'induct' may now use elimstyle induction rules without chaining
wenzelm
parents:
11986
diff
changeset

221 
 moved induct/cases attributes to Pure, methods to Provers; 
4a622f5fb164
 'induct' may now use elimstyle induction rules without chaining
wenzelm
parents:
11986
diff
changeset

222 
 generic method setup instantiated for FOL and HOL; 
11986
26b95a6f3f79
 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset

223 

12163
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

224 
* Pure: support multiple simultaneous goal statements, for example 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

225 
"have a: A and b: B" (same for 'theorem' etc.); being a pure 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

226 
metalevel mechanism, this acts as if several individual goals had 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

227 
been stated separately; in particular common proof methods need to be 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

228 
repeated in order to cover all claims; note that a single elimination 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

229 
step is *not* sufficient to establish the two conjunctions, so this 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

230 
fails: 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

231 

04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

232 
assume "A & B" then have A and B .. (*".." fails*) 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

233 

04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

234 
better use "obtain" in situations as above; alternative refer to 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

235 
multistep methods like 'auto', 'simp_all', 'blast+' etc.; 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

236 

12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset

237 
* Pure: proper integration with ``locales''; unlike the original 
12210
2f510d8d8291
* ZF: newstyle theory commands '(co)inductive', '(co)datatype',
wenzelm
parents:
12177
diff
changeset

238 
version by Florian Kammüller, Isar locales package highlevel proof 
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset

239 
contexts rather than raw logical ones (e.g. we admit to include 
12280  240 
attributes everywhere); operations on locales include merge and 
12964  241 
rename; support for implicit arguments (``structures''); simultaneous 
242 
typeinference over imports and text; see also HOL/ex/Locales.thy for 

243 
some examples; 

12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset

244 

12707
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

245 
* Pure: the following commands have been ``localized'', supporting a 
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

246 
target locale specification "(in name)": 'lemma', 'theorem', 
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

247 
'corollary', 'lemmas', 'theorems', 'declare'; the results will be 
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

248 
stored both within the locale and at the theory level (exported and 
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

249 
qualified by the locale name); 
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

250 

12964  251 
* Pure: theory goals may now be specified in ``long'' form, with 
252 
adhoc contexts consisting of arbitrary locale elements. for example 

253 
``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and 

254 
definitions may be given, too); the result is a metalevel rule with 

255 
the context elements being discharged in the obvious way; 

256 

257 
* Pure: new proof command 'using' allows to augment currently used 

258 
facts after a goal statement ('using' is syntactically analogous to 

259 
'apply', but acts on the goal's facts only); this allows chained facts 

260 
to be separated into parts given before and after a claim, as in 

261 
``from a and b have C using d and e <proof>''; 

12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset

262 

11722  263 
* Pure: renamed "antecedent" case to "rule_context"; 
264 

12964  265 
* Pure: new 'judgment' command records explicit information about the 
266 
objectlogic embedding (used by several tools internally); no longer 

267 
use hardwired "Trueprop"; 

268 

11738  269 
* Pure: added 'corollary' command; 
270 

11722  271 
* Pure: fixed 'token_translation' command; 
272 

11899  273 
* Pure: removed obsolete 'exported' attribute; 
274 

11933  275 
* Pure: dummy pattern "_" in is/let is now automatically lifted over 
276 
bound variables: "ALL x. P x > Q x" (is "ALL x. _ > ?C x") 

11899  277 
supersedes more cumbersome ... (is "ALL x. _ x > ?C x"); 
278 

11952
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

279 
* Pure: method 'atomize' presents local goal premises as objectlevel 
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

280 
statements (atomic metalevel propositions); setup controlled via 
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

281 
rewrite rules declarations of 'atomize' attribute; example 
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

282 
application: 'induct' method with proper rule statements in improper 
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

283 
proof *scripts*; 
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

284 

12106
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

285 
* Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.) 
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

286 
now consider the syntactic context of assumptions, giving a better 
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

287 
chance to get typeinference of the arguments right (this is 
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

288 
especially important for locales); 
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

289 

12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

290 
* Pure: "sorry" no longer requires quick_and_dirty in interactive 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

291 
mode; 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

292 

12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

293 
* Pure/obtain: the formal conclusion "thesis", being marked as 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

294 
``internal'', may no longer be reference directly in the text; 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

295 
potential INCOMPATIBILITY, may need to use "?thesis" in rare 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

296 
situations; 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

297 

9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

298 
* Pure: generic 'sym' attribute which declares a rule both as pure 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

299 
'elim?' and for the 'symmetric' operation; 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

300 

12877
b9635eb8a448
* Isar/Pure: marginal comments ``'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset

301 
* Pure: marginal comments ``'' may now occur just anywhere in the 
b9635eb8a448
* Isar/Pure: marginal comments ``'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset

302 
text; the fixed correlation with particular command syntax has been 
b9635eb8a448
* Isar/Pure: marginal comments ``'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset

303 
discontinued; 
b9635eb8a448
* Isar/Pure: marginal comments ``'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset

304 

13023
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

305 
* Pure: new method 'rules' is particularly wellsuited for proof 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

306 
search in intuitionistic logic; a bit slower than 'blast' or 'fast', 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

307 
but often produces more compact proof terms with less detours; 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

308 

12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

309 
* Pure/Provers/classical: simplified integration with pure rule 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

310 
attributes and methods; the classical "intro?/elim?/dest?" 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

311 
declarations coincide with the pure ones; the "rule" method no longer 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

312 
includes classically swapped intros; "intro" and "elim" methods no 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

313 
longer pick rules from the context; also got rid of ML declarations 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

314 
AddXIs/AddXEs/AddXDs; all of this has some potential for 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

315 
INCOMPATIBILITY; 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

316 

12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

317 
* Provers/classical: attribute 'swapped' produces classical inversions 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

318 
of introduction rules; 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

319 

12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

320 
* Provers/simplifier: 'simplified' attribute may refer to explicit 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

321 
rules instead of full simplifier context; 'iff' attribute handles 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

322 
conditional rules; 
11936
fef099613354
* Provers: 'simplified' attribute may refer to explicit rules instead
wenzelm
parents:
11933
diff
changeset

323 

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

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

325 

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

11933  329 
* HOL: 'inductive' no longer features separate (collective) attributes 
330 
for 'intros' (was found too confusing); 

331 

12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

332 
* HOL: properly declared induction rules less_induct and 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

333 
wf_induct_rule; 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

334 

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

335 

11474  336 
*** HOL *** 
337 

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

340 

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

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

343 

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

345 
binary representation internally; 

346 

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

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

349 

12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

350 
This change may cause significant problems of INCOMPATIBILITY; here 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

351 
are some hints on converting existing sources: 
11702  352 

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

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

355 
to be spaced properly; 

356 

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

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

359 

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

361 

362 
 remove all special provisions on numerals in proofs; 

363 

13042  364 
* HOL: simp rules nat_number expand numerals on nat to Suc/0 
12837  365 
representation (depends on bin_arith_simps in the default context); 
366 

12736  367 
* HOL: symbolic syntax for x^2 (numeral 2); 
368 

12335
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

369 
* HOL: the class of all HOL types is now called "type" rather than 
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

370 
"term"; INCOMPATIBILITY, need to adapt references to this type class 
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

371 
in axclass/classes, instance/arities, and (usually rare) occurrences 
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

372 
in typings (of consts etc.); internally the class is called 
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

373 
"HOL.type", ML programs should refer to HOLogic.typeS; 
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

374 

12280  375 
* HOL/record package improvements: 
376 
 new derived operations "fields" to build a partial record section, 

377 
"extend" to promote a fixed record to a record scheme, and 

378 
"truncate" for the reverse; cf. theorems "xxx.defs", which are *not* 

379 
declared as simp by default; 

12587
3f3d2ffb5df5
HOL/record: shared operations ("more", "fields", etc.) now need to be
wenzelm
parents:
12564
diff
changeset

380 
 shared operations ("more", "fields", etc.) now need to be always 
3f3d2ffb5df5
HOL/record: shared operations ("more", "fields", etc.) now need to be
wenzelm
parents:
12564
diff
changeset

381 
qualified)  potential INCOMPATIBILITY; 
12280  382 
 removed "make_scheme" operations (use "make" with "extend")  
383 
INCOMPATIBILITY; 

11937  384 
 removed "more" class (simply use "term")  INCOMPATIBILITY; 
12253  385 
 provides cases/induct rules for use with corresponding Isar 
386 
methods (for concrete records, record schemes, concrete more 

12280  387 
parts, and schematic more parts  in that order); 
11930  388 
 internal definitions directly based on a lightweight abstract 
389 
theory of product types over typedef rather than datatype; 

390 

13023
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

391 
* HOL: generic code generator for generating executable ML code from 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

392 
specifications; specific support for HOL constructs such as inductive 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

393 
datatypes and sets, as well as recursive functions; can be invoked 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

394 
via 'generate_code' theory section; 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

395 

11933  396 
* HOL: canonical cases/induct rules for ntuples (n = 3..7); 
397 

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

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

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

400 

11657  401 
* HOL: linorder_less_split superseded by linorder_cases; 
402 

12917  403 
* HOL/List: "nodups" renamed to "distinct"; 
12889  404 

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

11437  407 

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

410 

411 
delSWrapper "split_all_tac" 

412 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

413 

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

11474  415 
MAY FAIL; 
11361  416 

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

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

420 
necessary to attach explicit type constraints; 

11307  421 

12917  422 
* HOL/Relation: the prefix name of the infix "O" has been changed from 
423 
"comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been 

424 
renamed accordingly (eg "compI" > "rel_compI"). 

12489  425 

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

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

427 
expressions; 
11474  428 

12457
cbfc53e45476
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm
parents:
12405
diff
changeset

429 
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead 
cbfc53e45476
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm
parents:
12405
diff
changeset

430 
of "lam"  INCOMPATIBILITY; 
11474  431 

11933  432 
* HOL: got rid of some global declarations (potential INCOMPATIBILITY 
433 
for ML tools): const "()" renamed "Product_Type.Unity", type "unit" 

434 
renamed "Product_Type.unit"; 

11611  435 

12564  436 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
437 

12924  438 
* HOL: removed obsolete theorem "optionE" (use "option.exhaust", or 
439 
the "cases" method); 

440 

12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

441 
* HOL/GroupTheory: group theory examples including Sylow's theorem (by 
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

442 
Florian Kammüller); 
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

443 

12608
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

444 
* HOL/IMP: updated and converted to newstyle theory format; several 
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

445 
parts turned into readable document, with proper Isar proof texts and 
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

446 
some explanations (by Gerwin Klein); 
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

447 

12734  448 
* HOLReal: added Complex_Numbers (by Gertrud Bauer); 
449 

12690  450 
* HOLHyperreal is now a logic image; 
451 

11611  452 

12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset

453 
*** HOLCF *** 
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset

454 

12622  455 
* Isar: consts/constdefs supports mixfix syntax for continuous 
456 
operations; 

457 

458 
* Isar: domain package adapted to newstyle theory format, e.g. see 

459 
HOLCF/ex/Dnat.thy; 

460 

461 
* theory Lift: proper use of rep_datatype lift instead of ML hacks  

12280  462 
potential INCOMPATIBILITY; now use plain induct_tac instead of former 
463 
lift.induct_tac, always use UU instead of Undef; 

12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset

464 

12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

465 
* HOLCF/IMP: updated and converted to newstyle theory; 
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

466 

12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset

467 

11474  468 
*** ZF *** 
469 

12622  470 
* Isar: proper integration of logicspecific tools and packages, 
471 
including theory commands '(co)inductive', '(co)datatype', 

472 
'rep_datatype', 'inductive_cases', as well as methods 'ind_cases', 

473 
'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC'); 

474 

475 
* theory Main no longer includes AC; for the Axiom of Choice, base 

476 
your theory on Main_ZFC; 

477 

478 
* the integer library now covers quotients and remainders, with many 

479 
laws relating division to addition, multiplication, etc.; 

12563  480 

12280  481 
* ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a 
482 
typeless version of the formalism; 

483 

13025  484 
* ZF/AC, Coind, IMP, Resid: updated and converted to newstyle theory 
485 
format; 

12608
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

486 

12280  487 
* ZF/Induct: new directory for examples of inductive definitions, 
12608
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

488 
including theory Multiset for multiset orderings; converted to 
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

489 
newstyle theory format; 
12177
b1c16d685a99
* ZF: newstyle theory commands 'inductive', 'inductive_cases', and
wenzelm
parents:
12163
diff
changeset

490 

13025  491 
* ZF: many new theorems about lists, ordinals, etc.; 
12850  492 

11474  493 

494 
*** General *** 

495 

12280  496 
* Pure/kernel: metalevel proof terms (by Stefan Berghofer); reference 
497 
variable proof controls level of detail: 0 = no proofs (only oracle 

498 
dependencies), 1 = lemma dependencies, 2 = compact proof terms; see 

499 
also ref manual for further ML interfaces; 

500 

501 
* Pure/axclass: removed obsolete ML interface 

502 
goal_subclass/goal_arity; 

503 

504 
* Pure/syntax: new token syntax "num" for plain numerals (without "#" 

505 
of "xnum"); potential INCOMPATIBILITY, since 0, 1 etc. are now 

506 
separate tokens, so expressions involving minus need to be spaced 

507 
properly; 

508 

12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

509 
* Pure/syntax: support nonoriented infixes, using keyword "infix" 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

510 
rather than "infixl" or "infixr"; 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

511 

f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

512 
* Pure/syntax: concrete syntax for dummy type variables admits genuine 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

513 
sort constraint specifications in type inference; e.g. "x::_::foo" 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

514 
ensures that the type of "x" is of sort "foo" (but not necessarily a 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

515 
type variable); 
12280  516 

517 
* Pure/syntax: print modes "type_brackets" and "no_type_brackets" 

518 
control output of nested => (types); the default behavior is 

519 
"type_brackets"; 

520 

521 
* Pure/syntax: builtin parse translation for "_constify" turns valued 

11817  522 
tokens into AST constants; 
11474  523 

12280  524 
* Pure/syntax: prefer later declarations of translations and print 
525 
translation functions; potential INCOMPATIBILITY: need to reverse 

526 
multiple declarations for same syntax element constant; 

527 

12832
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset

528 
* Pure/show_hyps reset by default (in accordance to existing Isar 
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset

529 
practice); 
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset

530 

12280  531 
* Provers/classical: renamed addaltern to addafter, addSaltern to 
532 
addSafter; 

533 

534 
* Provers/clasimp: ``iff'' declarations now handle conditional rules 

535 
as well; 

12253  536 

12538  537 
* system: tested support for MacOS X; should be able to get Isabelle + 
538 
Proof General to work in a plain Terminal after installing Poly/ML 

539 
(e.g. from the Isabelle distribution area) and GNU bash alone 

540 
(e.g. from http://www.apple.com); full X11, XEmacs and XSymbol 

541 
support requires further installations, e.g. from 

542 
http://fink.sourceforge.net/); 

543 

12280  544 
* system: support Poly/ML 4.1.1 (able to manage larger heaps); 
11551  545 

12753
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset

546 
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead 
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset

547 
of 40 MB), cf. ML_OPTIONS; 
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset

548 

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

551 

12728  552 
* system: support for persistent Proof General sessions (refrain from 
553 
outdating all loaded theories on startup); user may create writable 

554 
logic images like this: ``isabelle q HOL Test''; 

12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

555 

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

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

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

11551  561 

12472  562 
* system: refrain from any attempt at filtering input streams; no 
563 
longer support ``8bit'' encoding of old isabelle font, instead proper 

564 
isolatin characters may now be used; the related isatools 

565 
"symbolinput" and "nonascii" have disappeared as well; 

566 

567 
* system: removed old "xterm" interface (the print modes "xterm" and 

568 
"xterm_color" are still available for direct use in a suitable 

569 
terminal); 

570 

11314  571 

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

572 

11062  573 
New in Isabelle992 (February 2001) 
574 
 

575 

10224  576 
*** Overview of INCOMPATIBILITIES *** 
577 

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

12622  580 
bind them to ML identifers by e.g. val thm_name = thm "thm_name"; 
11241  581 

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

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

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

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

586 

10998  587 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
588 
gfp_Tarski to gfp_unfold; 

10224  589 

10288  590 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
591 

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

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

10793  595 

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

598 

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

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

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

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

604 
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

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

606 

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

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

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

609 

10224  610 

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

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

612 

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

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

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

617 
typewriter); 

618 

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

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

620 
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

621 

10858  622 
* some more standard symbols; see Appendix A of the system manual for 
11062  623 
the complete list of symbols defined in isabellesym.sty; 
10858  624 

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

627 
definitions); 

628 

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

631 
actual humanreadable proof documents. Please do not include goal 

632 
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

633 

11062  634 
* proper indentation of antiquoted output with proportional LaTeX 
635 
fonts; 

10862  636 

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

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

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

639 

11062  640 
* isatool unsymbolize tunes sources for plain ASCII communication; 
641 

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

642 

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

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

644 

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

647 
documents, due to unpredictable outcome and noncompositional proof 

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

649 
for Prologstyle synthesis of proven results; 

650 

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

653 

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

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

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

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

658 

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

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

661 

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

663 
statements as well; 

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

664 

11097  665 
* Pure: more robust selection of calculational rules; 
666 

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

669 

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

671 
lemmas, using the graph browser tool; 

672 

10944  673 
* Pure: predict failure of "show" in interactive mode; 
674 

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

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

676 

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

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

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

679 

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

683 

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

686 
the result to be shown in each case; 

687 

10770  688 
* HOL: added 'recdef_tc' command; 
689 

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

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

691 

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

692 

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

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

694 

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

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

696 
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

697 
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

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

700 

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

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

704 

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

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

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

709 
literature; 

710 

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

714 

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

717 

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

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

719 
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

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

721 

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

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

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

724 

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

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

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

727 

12245  728 
* HOLRealHyperreal: this extends HOLReal with the hyperreals 
729 
and Fleuriot's mechanization of analysis, including the transcendental 

730 
functions for the reals; 

10756  731 

11094  732 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  733 

10858  734 

10474  735 
*** CTT *** 
736 

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

10474  739 

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

742 

10474  743 

10391  744 
*** General *** 
745 

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

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

749 
the Isabelle inference kernel has been greatly improved; 

750 

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

753 

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

756 

11124  757 
* system: support Poly/ML 4.0; 
758 

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

760 

10391  761 

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

762 

10103  763 
New in Isabelle991 (October 2000) 
764 
 

8015  765 

10003  766 
*** Overview of INCOMPATIBILITIES *** 
8014  767 

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

770 
issue the following ML commands: 

771 

772 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

773 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  774 

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

10003  777 

778 
* HOL: nat_less_induct renamed to less_induct; 

779 

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

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

8967  782 

10003  783 
select_equality > some_equality 
784 
select_eq_Ex > some_eq_ex 

785 
selectI2EX > someI2_ex 

786 
selectI2 > someI2 

787 
selectI > someI 

788 
select1_equality > some1_equality 

789 
Eps_sym_eq > some_sym_eq_trivial 

790 
Eps_eq > some_eq_trivial 

791 

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

793 

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

795 
instead); 

796 

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

798 
f.simps instead of f.rules; 

799 

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

801 

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

803 
sometimes be needed; 

804 

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

8014  806 

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

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

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

810 
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

811 
now "<*lex*>" instead of "**"; 
8705  812 

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

9971  815 

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

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

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

818 

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

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

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

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

822 

8848  823 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
824 

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

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

826 
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

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

828 

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

9908  831 

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

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

834 

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

9542  837 

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

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

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

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

842 

9612  843 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
844 

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

845 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  846 

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

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

849 

8014  850 

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

852 

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

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

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

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

857 

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

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

860 

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

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

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

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

864 

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

8566  868 

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

870 

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

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

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

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

874 

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

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

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

878 

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

879 

8184  880 
*** Isar *** 
881 

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

884 
accommodates incremental typeinference very nicely; 

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

885 

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

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

888 

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

891 
useful to collect intermediate results without explicit name 

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

893 
premises; 

8184  894 

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

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

898 
to theorems as "tags"; 

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

899 

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

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

902 

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

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

905 

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

907 

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

910 

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

913 
with the version in Provers/classical; 

9612  914 

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

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

917 

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

920 

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

9612  923 

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

925 
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

926 
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

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

928 

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

931 

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

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

934 
well (including splits); 

935 

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

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

938 

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

940 
of Simplifier and Classical reasoner); 

941 

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

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

944 
recdef) support case names and properly name parameters; 

9612  945 

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

948 
calculations; 

949 

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

951 
method anyway; 

952 

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

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

955 
foo.split foo.split_asm for each datatype; 

956 

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

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

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

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

961 

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

963 

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

965 

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

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

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

968 
proof states; 
8487  969 

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

8487  973 

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

977 
(for HOL datatypes); 

8534  978 

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

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

982 

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

984 

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

987 
(print_commands, print_methods etc.); 

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

988 

10003  989 
* Isar: added 'nothing'  the empty list of theorems; 
9239  990 

8184  991 

8014  992 
*** HOL *** 
993 

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

996 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

1000 

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

8014  1003 

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

1004 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  1005 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
1006 
Rasmussen; 

8570  1007 

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

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

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

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

1011 
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

1012 
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

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

1014 

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

9542  1017 

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

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

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

1020 

10003  1021 
* HOL/Lambda: converted into newstyle theory and document; 
9542  1022 

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

1025 
representation; very useful in avoiding lifting of operations; 

8848  1026 

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

1029 
well; admit "r" as field name; 

9542  1030 

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

1033 

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

1035 
Types nat and int belong to this axclass; 

1036 

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

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

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

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

8736  1044 

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

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

9835  1048 

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

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

1052 

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

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

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

8603  1058 

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

1061 
termination conditions are proved automatically, these simplification 

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

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

1064 
each equation; 

1065 

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

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

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

1068 
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

1069 
invariant proof rule for while is applied. 
9457  1070 

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

8925  1073 

8848  1074 
* HOL: theorems impI, allI, ballI bound as "strip"; 
1075 

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

1079 

10003  1080 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  1081 

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

8626  1084 

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

1087 

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

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

1091 
bogus); 

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

1092 

8412  1093 

9542  1094 
*** ZF *** 
1095 

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

9542  1098 

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

1101 
making the algebraic laws unconditional; 

9542  1102 

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

9542  1105 

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

9542  1108 

10003  1109 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
1110 
simplification; 

9388  1111 

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

9388  1114 

1115 

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

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

1117 

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

1120 

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

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

1123 

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

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

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

1126 

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

1129 
use instead the strong form, 

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

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

1132 
from destructrules; 

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

1133 

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

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

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

1136 

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

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

1138 

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

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

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

1141 

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

1144 
situations; 

1145 

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

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

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

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

1149 

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

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

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

1152 

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

1153 
* system: provide TAGS file for Isabelle sources; 
9052  1154 

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

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

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

1157 

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

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

1159 
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

1160 

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

1163 

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

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

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

1166 

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

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

1169 

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

1170 

8015  1171 

7986  1172 
New in Isabelle99 (October 1999) 
1173 
 

4649  1174 

5931  1175 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
1176 

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

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

7215  1180 

1181 
Delcongs [if_weak_cong]; 

6922  1182 

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

5931  1185 

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

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

1190 

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

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

1192 
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

1193 

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

6057  1196 

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

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

6141  1200 

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

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

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

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

1207 
mk_solver: string > (thm list > int > tactic) > solver 
7619  1208 
where the string argument is only a comment. 
6057  1209 

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

1210 

6069  1211 
*** Proof tools *** 
1212 

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

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

6069  1217 

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

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

1221 
matching. 

6069  1222 

7593  1223 

6014  1224 
*** General *** 
1225 

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

1229 
readable proof documents (Isar == Intelligible semiautomated 

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

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

1232 

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

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

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

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

7215  1238 

7252  1239 
* native support for Proof General, both for classic Isabelle and 
7986  1240 
Isabelle/Isar; 
7215  1241 

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

1244 

6751  1245 
* Isabelle manuals now also available as PDF; 
1246 

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

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

6449  1252 

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

1255 

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

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

1258 

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

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

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

1262 

7215  1263 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
1264 

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

5973  1267 

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

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

1270 

6343  1271 
* new print_mode "HTML"; 
1272 

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

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

1275 

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

1278 

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

1280 
244c244 

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

1282 
 

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

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

1287 
 

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

1289 

7450  1290 
* function bind_thms stores lists of theorems (cf. bind_thm); 
1291 

7593  1292 
* new shorthand tactics ftac, eatac, datac, fatac; 
1293 

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

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

7593  1297 

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

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

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

1300 

6028  1301 

6057  1302 
*** HOL *** 
1303 

7215  1304 
** HOL arithmetic ** 
1305 

6343  1306 
* There are now decision procedures for linear arithmetic over nat and 
1307 
int: 

6131  1308 

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

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

1312 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  1317 

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

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

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

1322 
simplifier. 

6131  1323 

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

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

6028  1327 

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

1332 
type constraints; 

1333 

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

1335 
arguments; 

7157  1336 

7215  1337 
* many properties of integer multiplication, division and remainder 
1338 
are now available; 

6922  1339 

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

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

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

1344 
invocation of the underlying oracle). For SVC see 

7444  1345 
http://verify.stanford.edu/SVC 
6922  1346 

7125  1347 
* IsaMakefile: the HOLReal target now builds an actual image; 
1348 

7215  1349 

1350 
** HOL misc ** 

1351 

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

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

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

1354 

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

1357 

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

1360 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

1361 
changed syntax and (many) tactics; 

1362 

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

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

1366 
"mono" attribute); 

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

1367 

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

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

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

1370 

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

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

1372 

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

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

7326  1377 

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

1379 
Delsimprocs [record_simproc] 

1380 

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

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

1382 
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

1383 

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

1386 

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

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

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

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

6563  1391 

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

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

1395 

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

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

1397 
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

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

1399 

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

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

1401 
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

1402 

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

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

1404 
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

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

1406 

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

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

1411 

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

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

1413 
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;
wenzel 