author  nipkow 
Tue, 25 Feb 2003 19:08:15 +0100  
changeset 13829  af0218406395 
parent 13824  e4d8dea6dfc2 
child 13835  12b2ffbe543a 
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 

13618  9 
* Provers/simplifier: 
10 

13781  11 
 Completely reimplemented method simp (ML: Asm_full_simp_tac): 
13618  12 
Assumptions are now subject to complete mutual simplification, 
13 
not just from left to right. The simplifier now preserves 

14 
the order of assumptions. 

15 

16 
Potential INCOMPATIBILITY: 

17 

13781  18 
 simp sometimes diverges where the old version did 
19 
not, e.g. invoking simp on the goal 

13618  20 

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

22 

13781  23 
now gives rise to the infinite reduction sequence 
24 

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

26 

27 
Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this 

28 
kind of problem. 

29 

30 
 Tactics combining classical reasoner and simplification (such as auto) 

31 
are also affected by this change, because many of them rely on 

32 
simp. They may sometimes diverge as well or yield a different numbers 

33 
of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto 

34 
in case of problems. Sometimes subsequent calls to the classical 

35 
reasoner will fail because a preceeding call to the simplifier too 

36 
eagerly simplified the goal, e.g. deleted redundant premises. 

13618  37 

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

39 

13829  40 
 You can limit the number of recursive invocations of the simplifier 
41 
during conditional rewriting (where the simplifie tries to solve the 

42 
conditions before applying the rewrite rule): 

43 
ML "simp_depth_limit := n" 

44 
where n is an integer. Thus you can force termination where previously 

45 
the simplifier would diverge. 

46 

47 

13815  48 
* Pure: New flag for triggering if the overall goal of a proof state should 
49 
be printed: 

50 
PG menu: Isabelle/Isar > Settigs > Show Main Goal 

51 
(ML: Proof.show_main_goal). 

52 

53 
* Pure: You can find all matching introduction rules for subgoal 1, i.e. all 

54 
rules whose conclusion matches subgoal 1: 

55 
PG menu: Isabelle/Isar > Show me > matching rules 

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

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

58 
(or rather last, the way they are printed). 

59 
(ML: ProofGeneral.print_intros()) 

60 

61 
* Pure: New flag trace_unify_fail causes unification to print 

13781  62 
diagnostic information (PG: in trace buffer) when it fails. This is 
63 
useful for figuring out why single step proofs like rule, erule or 

64 
assumption failed. 

65 

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

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

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

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

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

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

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

73 

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

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

75 
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

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

77 

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

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

79 
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

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

83 
be given (the default is 40); 

84 

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

86 
(batchmode only); 

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

87 

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

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

89 
"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

90 
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

91 

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

94 
for slight decrease in efficiency; 

95 

13781  96 
* Provers/linorder: New generic prover for transitivity reasoning over 
97 
linear orders. Note: this prover is not efficient! 

98 

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

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

100 
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

101 

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

102 

13158  103 
*** HOL *** 
104 

13745
a31e04831dd1
HOL/GroupTheory/Summation.thy added: summation operator for abelian groups.
ballarin
parents:
13735
diff
changeset

105 
* GroupTheory: new, experimental summation operator for abelian groups. 
a31e04831dd1
HOL/GroupTheory/Summation.thy added: summation operator for abelian groups.
ballarin
parents:
13735
diff
changeset

106 

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

109 
"<=", "<" and "="). 

110 

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

113 

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

116 

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

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

118 
Finite_Set); 
13492  119 

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

122 

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

125 

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

128 

13344  129 
"0 < n ==> n div 2 < (n::nat)" 
13443  130 

131 
but fails if divisibility plays a role like in 

132 

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

134 

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

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

13158  137 

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

140 

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

143 

13587  144 
* GroupTheory: converted to Isar theories, using locales with implicit structures; 
145 

13549  146 
* Real/HahnBanach: updated and adapted to locales; 
147 

148 

149 
*** ZF *** 

150 

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

152 
universe, etc.); 

153 

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

13518  155 

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

156 

13478  157 
*** ML *** 
158 

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

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

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

162 

163 
* Pure: improved error reporting of simprocs; 

164 

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

166 
up simprocs; 

167 

168 

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

169 

12984  170 
New in Isabelle2002 (March 2002) 
171 
 

11474  172 

11572  173 
*** Document preparation *** 
174 

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

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

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

177 
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

178 
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

179 
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

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

181 

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

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

183 
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

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

185 

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

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

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

188 

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

191 

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

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

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

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

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

200 
isatool document copies the Isabelle style files to the target 

201 
location; 

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

202 

11572  203 

11633  204 
*** Isar *** 
205 

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

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

209 
 'induct' method divinates rule instantiation from the inductive 

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

211 
instantiation of cases; 

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

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

214 
rules without further ado; 

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

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

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

218 
statement becomes is included in the hypothesis, avoiding the 

219 
slightly cumbersome show "PROP ?case" form; 

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

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

222 
rules stemming from inductive sets to be applied in unstructured 

223 
scripts, while still benefitting from proper handling of nonatomic 

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

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

226 
 'induct' proper support for mutual induction involving nonatomic 

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

228 
below); 

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

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

231 
 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

232 
 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

233 
 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

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

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

236 
 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

237 

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

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

239 
"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

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

241 
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

242 
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

243 
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

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

245 

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

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

247 

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

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

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

250 

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

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

252 
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

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

257 
some examples; 

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

258 

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

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

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

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

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

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

264 

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

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

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

269 
the context elements being discharged in the obvious way; 

270 

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

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

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

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

275 
``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

276 

11722  277 
* Pure: renamed "antecedent" case to "rule_context"; 
278 

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

281 
use hardwired "Trueprop"; 

282 

11738  283 
* Pure: added 'corollary' command; 
284 

11722  285 
* Pure: fixed 'token_translation' command; 
286 

11899  287 
* Pure: removed obsolete 'exported' attribute; 
288 

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

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

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

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

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

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

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

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

298 

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

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

300 
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

301 
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

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

303 

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

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

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

306 

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

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

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

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

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

311 

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

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

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

314 

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

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

316 
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

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

318 

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

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

320 
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

321 
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

322 

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

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

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

325 
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

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

327 
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

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

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

330 

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

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

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

333 

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

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

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

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

337 

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

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

339 

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

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

345 

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

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

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

348 

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

349 

11474  350 
*** HOL *** 
351 

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

354 

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

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

357 

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

359 
binary representation internally; 

360 

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

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

363 

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

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

365 
are some hints on converting existing sources: 
11702  366 

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

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

369 
to be spaced properly; 

370 

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

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

373 

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

375 

376 
 remove all special provisions on numerals in proofs; 

377 

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

12736  381 
* HOL: symbolic syntax for x^2 (numeral 2); 
382 

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

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

384 
"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

385 
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

386 
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

387 
"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

388 

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

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

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

393 
declared as simp by default; 

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

394 
 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

395 
qualified)  potential INCOMPATIBILITY; 
12280  396 
 removed "make_scheme" operations (use "make" with "extend")  
397 
INCOMPATIBILITY; 

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

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

404 

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

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

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

407 
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

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

409 

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

13824  412 
* HOL: consolidated and renamed several theories. In particular: 
413 
Ord.thy has been absorbed into HOL.thy 

414 
String.thy has been absorbed into List.thy 

415 

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

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

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

418 

11657  419 
* HOL: linorder_less_split superseded by linorder_cases; 
420 

12917  421 
* HOL/List: "nodups" renamed to "distinct"; 
12889  422 

11633  423 
* HOL: added "The" definite description operator; move Hilbert's "Eps" 
13824  424 
to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES: 
425 
 Ex_def has changed, now need to use some_eq_ex 

11437  426 

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

429 

430 
delSWrapper "split_all_tac" 

431 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

432 

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

11474  434 
MAY FAIL; 
11361  435 

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

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

439 
necessary to attach explicit type constraints; 

11307  440 

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

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

12489  444 

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

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

446 
expressions; 
11474  447 

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

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

449 
of "lam"  INCOMPATIBILITY; 
11474  450 

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

453 
renamed "Product_Type.unit"; 

11611  454 

12564  455 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
456 

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

459 

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

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

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

462 

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

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

464 
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

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

466 

12734  467 
* HOLReal: added Complex_Numbers (by Gertrud Bauer); 
468 

12690  469 
* HOLHyperreal is now a logic image; 
470 

11611  471 

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

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

473 

12622  474 
* Isar: consts/constdefs supports mixfix syntax for continuous 
475 
operations; 

476 

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

478 
HOLCF/ex/Dnat.thy; 

479 

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

12280  481 
potential INCOMPATIBILITY; now use plain induct_tac instead of former 
482 
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

483 

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

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

485 

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

486 

11474  487 
*** ZF *** 
488 

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

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

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

493 

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

495 
your theory on Main_ZFC; 

496 

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

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

12563  499 

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

502 

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

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

505 

12280  506 
* 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

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

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

509 

13025  510 
* ZF: many new theorems about lists, ordinals, etc.; 
12850  511 

11474  512 

513 
*** General *** 

514 

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

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

518 
also ref manual for further ML interfaces; 

519 

520 
* Pure/axclass: removed obsolete ML interface 

521 
goal_subclass/goal_arity; 

522 

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

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

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

526 
properly; 

527 

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

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

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

530 

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

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

532 
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

533 
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

534 
type variable); 
12280  535 

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

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

538 
"type_brackets"; 

539 

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

11817  541 
tokens into AST constants; 
11474  542 

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

545 
multiple declarations for same syntax element constant; 

546 

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

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

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

549 

12280  550 
* Provers/classical: renamed addaltern to addafter, addSaltern to 
551 
addSafter; 

552 

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

554 
as well; 

12253  555 

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

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

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

560 
support requires further installations, e.g. from 

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

562 

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

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

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

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

567 

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

570 

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

573 
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

574 

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

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

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

11551  580 

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

583 
isolatin characters may now be used; the related isatools 

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

585 

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

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

588 
terminal); 

589 

11314  590 

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

591 

11062  592 
New in Isabelle992 (February 2001) 
593 
 

594 

10224  595 
*** Overview of INCOMPATIBILITIES *** 
596 

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

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

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

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

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

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

605 

10998  606 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
607 
gfp_Tarski to gfp_unfold; 

10224  608 

10288  609 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
610 

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

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

10793  614 

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

617 

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

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

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

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

623 
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

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

625 

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

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

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

628 

10224  629 

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

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

631 

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

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

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

636 
typewriter); 

637 

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

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

639 
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

640 

10858  641 
* some more standard symbols; see Appendix A of the system manual for 
11062  642 
the complete list of symbols defined in isabellesym.sty; 
10858  643 

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

646 
definitions); 

647 

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

650 
actual humanreadable proof documents. Please do not include goal 

651 
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

652 

11062  653 
* proper indentation of antiquoted output with proportional LaTeX 
654 
fonts; 

10862  655 

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

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

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

658 

11062  659 
* isatool unsymbolize tunes sources for plain ASCII communication; 
660 

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

661 

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

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

663 

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

666 
documents, due to unpredictable outcome and noncompositional proof 

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

668 
for Prologstyle synthesis of proven results; 

669 

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

672 

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

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

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

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

677 

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

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

680 

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

682 
statements as well; 

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

683 

11097  684 
* Pure: more robust selection of calculational rules; 
685 

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

688 

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

690 
lemmas, using the graph browser tool; 

691 

10944  692 
* Pure: predict failure of "show" in interactive mode; 
693 

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

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

695 

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

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

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

698 

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

702 

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

705 
the result to be shown in each case; 

706 

10770  707 
* HOL: added 'recdef_tc' command; 
708 

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

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

710 

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

711 

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

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

713 

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

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

715 
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

716 
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

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

719 

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

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

723 

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

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

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

728 
literature; 

729 

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

733 

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

736 

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

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

738 
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

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

740 

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

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

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

743 

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

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

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

746 

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

749 
functions for the reals; 

10756  750 

11094  751 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  752 

10858  753 

10474  754 
*** CTT *** 
755 

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

10474  758 

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

761 

10474  762 

10391  763 
*** General *** 
764 

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

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

768 
the Isabelle inference kernel has been greatly improved; 

769 

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

772 

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

775 

11124  776 
* system: support Poly/ML 4.0; 
777 

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

779 

10391  780 

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

781 

10103  782 
New in Isabelle991 (October 2000) 
783 
 

8015  784 

10003  785 
*** Overview of INCOMPATIBILITIES *** 
8014  786 

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

789 
issue the following ML commands: 

790 

791 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

792 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  793 

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

10003  796 

797 
* HOL: nat_less_induct renamed to less_induct; 

798 

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

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

8967  801 

10003  802 
select_equality > some_equality 
803 
select_eq_Ex > some_eq_ex 

804 
selectI2EX > someI2_ex 

805 
selectI2 > someI2 

806 
selectI > someI 

807 
select1_equality > some1_equality 

808 
Eps_sym_eq > some_sym_eq_trivial 

809 
Eps_eq > some_eq_trivial 

810 

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

812 

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

814 
instead); 

815 

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

817 
f.simps instead of f.rules; 

818 

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

820 

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

822 
sometimes be needed; 

823 

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

8014  825 

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

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

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

829 
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

830 
now "<*lex*>" instead of "**"; 
8705  831 

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

9971  834 

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

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

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

837 

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

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

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

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

841 

8848  842 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
843 

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

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

845 
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

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

847 

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

9908  850 

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

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

853 

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

9542  856 

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

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

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

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

861 

9612  862 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
863 

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

864 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  865 

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

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

868 

8014  869 

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

871 

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

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

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

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

876 

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

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

879 

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

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

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

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

883 

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

8566  887 

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

889 

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

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

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

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

893 

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

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

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

897 

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

898 

8184  899 
*** Isar *** 
900 

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

903 
accommodates incremental typeinference very nicely; 

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

904 

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

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

907 

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

910 
useful to collect intermediate results without explicit name 

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

912 
premises; 

8184  913 

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

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

917 
to theorems as "tags"; 

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

918 

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

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

921 

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

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

924 

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

926 

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

929 

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

932 
with the version in Provers/classical; 

9612  933 

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

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

936 

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

939 

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

9612  942 

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

944 
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

945 
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

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

947 

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

950 

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

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

953 
well (including splits); 

954 

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

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

957 

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

959 
of Simplifier and Classical reasoner); 

960 

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

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

963 
recdef) support case names and properly name parameters; 

9612  964 

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

967 
calculations; 

968 

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

970 
method anyway; 

971 

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

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

974 
foo.split foo.split_asm for each datatype; 

975 

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

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

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

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

980 

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

982 

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

984 

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

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

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

987 
proof states; 
8487  988 

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

8487  992 

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

996 
(for HOL datatypes); 

8534  997 

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

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

1001 

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

1003 

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

1006 
(print_commands, print_methods etc.); 

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

1007 

10003  1008 
* Isar: added 'nothing'  the empty list of theorems; 
9239  1009 

8184  1010 

8014  1011 
*** HOL *** 
1012 

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

1015 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

1019 

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

8014  1022 

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

1023 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  1024 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
1025 
Rasmussen; 

8570  1026 

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

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

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

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

1030 
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

1031 
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

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

1033 

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

9542  1036 

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

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

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

1039 

10003  1040 
* HOL/Lambda: converted into newstyle theory and document; 
9542  1041 

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

1044 
representation; very useful in avoiding lifting of operations; 

8848  1045 

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

1048 
well; admit "r" as field name; 

9542  1049 

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

1052 

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

1054 
Types nat and int belong to this axclass; 

1055 

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

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

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

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

8736  1063 

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

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

9835  1067 

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

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

1071 

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

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

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

8603  1077 

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

1080 
termination conditions are proved automatically, these simplification 

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

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

1083 
each equation; 

1084 

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

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

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

1087 
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

1088 
invariant proof rule for while is applied. 
9457  1089 

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

8925  1092 

8848  1093 
* HOL: theorems impI, allI, ballI bound as "strip"; 
1094 

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

1098 

10003  1099 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  1100 

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

8626  1103 

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

1106 

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

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

1110 
bogus); 

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

1111 

8412  1112 

9542  1113 
*** ZF *** 
1114 

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

9542  1117 

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

1120 
making the algebraic laws unconditional; 

9542  1121 

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

9542  1124 

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

9542  1127 

10003  1128 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
1129 
simplification; 

9388  1130 

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

9388  1133 

1134 

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

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

1136 

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

1139 

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

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

1142 

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

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

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

1145 

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

1148 
use instead the strong form, 

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

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

1151 
from destructrules; 

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

1152 

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

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

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

1155 

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

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

1157 

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

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

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

1160 

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

1163 
situations; 

1164 

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

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

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

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

1168 

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

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

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

1171 

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

1172 
* system: provide TAGS file for Isabelle sources; 
9052  1173 

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

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

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

1176 

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

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

1178 
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

1179 

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

1182 

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

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

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

1185 

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

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

1188 

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

1189 

8015  1190 

7986  1191 
New in Isabelle99 (October 1999) 
1192 
 

4649  1193 

5931  1194 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
1195 

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

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

7215  1199 

1200 
Delcongs [if_weak_cong]; 

6922  1201 

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

5931  1204 

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

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

1209 

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

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

1211 
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

1212 

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

6057  1215 

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

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

6141  1219 

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

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

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

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

1226 
mk_solver: string > (thm list > int > tactic) > solver 
7619  1227 
where the string argument is only a comment. 
6057  1228 

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

1229 

6069  1230 
*** Proof tools *** 
1231 

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

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

6069  1236 

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

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

1240 
matching. 

6069  1241 

7593  1242 

6014  1243 
*** General *** 
1244 

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

1248 
readable proof documents (Isar == Intelligible semiautomated 

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

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

1251 

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

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

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

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

7215  1257 

7252  1258 
* native support for Proof General, both for classic Isabelle and 
7986  1259 
Isabelle/Isar; 
7215  1260 

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

1263 

6751  1264 
* Isabelle manuals now also available as PDF; 
1265 

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

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

6449  1271 

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

1274 

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

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

1277 

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

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

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

1281 

7215  1282 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
1283 

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

5973  1286 

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

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

1289 

6343  1290 
* new print_mode "HTML"; 
1291 

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

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

1294 

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

1297 

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

1299 
244c244 

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

1301 
 

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

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

1306 
 

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

1308 

7450  1309 
* function bind_thms stores lists of theorems (cf. bind_thm); 
1310 

7593  1311 
* new shorthand tactics ftac, eatac, datac, fatac; 
1312 

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

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

7593  1316 

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

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

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

1319 

6028  1320 

6057  1321 
*** HOL *** 
1322 

7215  1323 
** HOL arithmetic ** 
1324 

6343  1325 
* There are now decision procedures for linear arithmetic over nat and 
1326 
int: 

6131  1327 

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

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

1331 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  1336 

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

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

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

1341 
simplifier. 

6131  1342 

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

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

6028  1346 

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

1351 
type constraints; 

1352 

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

1354 
arguments; 

7157  1355 

7215  1356 
* many properties of integer multiplication, division and remainder 
1357 
are now available; 

6922  1358 

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

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

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

1363 
invocation of the underlying oracle). For SVC see 

7444  1364 
http://verify.stanford.edu/SVC 
6922  1365 

7125  1366 
* IsaMakefile: the HOLReal target now builds an actual image; 
1367 

7215  1368 

1369 
** HOL misc ** 

1370 

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

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

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

1373 

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

1376 

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

1379 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

1380 
changed syntax and (many) tactics; 

1381 

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

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

1385 
"mono" attribute); 

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

1386 

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

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

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

1389 

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

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

1391 

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

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

7326  1396 

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

1398 
Delsimprocs [record_simproc] 

1399 

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

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

1401 
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

1402 

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

1405 
