author  paulson 
Thu, 20 Feb 2003 11:09:48 +0100  
changeset 13824  e4d8dea6dfc2 
parent 13815  0832792725db 
child 13829  af0218406395 
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 

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

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

43 
(ML: Proof.show_main_goal). 

44 

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

46 
rules whose conclusion matches subgoal 1: 

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

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

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

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

51 
(ML: ProofGeneral.print_intros()) 

52 

53 
* Pure: New flag trace_unify_fail causes unification to print 

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

56 
assumption failed. 

57 

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

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

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

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

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

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

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

65 

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

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

67 
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

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

69 

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

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

71 
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

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

75 
be given (the default is 40); 

76 

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

78 
(batchmode only); 

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

79 

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

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

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

82 
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

83 

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

86 
for slight decrease in efficiency; 

87 

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

90 

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

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

92 
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

93 

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

94 

13158  95 
*** HOL *** 
96 

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

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

98 

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

101 
"<=", "<" and "="). 

102 

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

105 

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

108 

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

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

110 
Finite_Set); 
13492  111 

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

114 

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

117 

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

120 

13344  121 
"0 < n ==> n div 2 < (n::nat)" 
13443  122 

123 
but fails if divisibility plays a role like in 

124 

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

126 

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

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

13158  129 

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

132 

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

135 

13587  136 
* GroupTheory: converted to Isar theories, using locales with implicit structures; 
137 

13549  138 
* Real/HahnBanach: updated and adapted to locales; 
139 

140 

141 
*** ZF *** 

142 

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

144 
universe, etc.); 

145 

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

13518  147 

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

148 

13478  149 
*** ML *** 
150 

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

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

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

154 

155 
* Pure: improved error reporting of simprocs; 

156 

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

158 
up simprocs; 

159 

160 

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

161 

12984  162 
New in Isabelle2002 (March 2002) 
163 
 

11474  164 

11572  165 
*** Document preparation *** 
166 

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

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

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

169 
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

170 
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

171 
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

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

173 

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

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

175 
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

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

177 

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

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

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

180 

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

183 

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

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

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

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

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

192 
isatool document copies the Isabelle style files to the target 

193 
location; 

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

194 

11572  195 

11633  196 
*** Isar *** 
197 

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

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

201 
 'induct' method divinates rule instantiation from the inductive 

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

203 
instantiation of cases; 

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

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

206 
rules without further ado; 

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

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

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

210 
statement becomes is included in the hypothesis, avoiding the 

211 
slightly cumbersome show "PROP ?case" form; 

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

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

214 
rules stemming from inductive sets to be applied in unstructured 

215 
scripts, while still benefitting from proper handling of nonatomic 

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

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

218 
 'induct' proper support for mutual induction involving nonatomic 

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

220 
below); 

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

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

223 
 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

224 
 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

225 
 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

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

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

228 
 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

229 

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

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

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

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

233 
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

234 
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

235 
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

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

237 

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

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

239 

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

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

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

242 

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

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

244 
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

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

249 
some examples; 

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

250 

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

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

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

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

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

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

256 

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

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

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

261 
the context elements being discharged in the obvious way; 

262 

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

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

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

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

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

268 

11722  269 
* Pure: renamed "antecedent" case to "rule_context"; 
270 

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

273 
use hardwired "Trueprop"; 

274 

11738  275 
* Pure: added 'corollary' command; 
276 

11722  277 
* Pure: fixed 'token_translation' command; 
278 

11899  279 
* Pure: removed obsolete 'exported' attribute; 
280 

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

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

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

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

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

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

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

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

290 

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

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

292 
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

293 
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

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

295 

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

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

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

298 

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

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

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

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

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

303 

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

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

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

306 

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

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

308 
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

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

310 

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

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

312 
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

313 
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

314 

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

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

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

317 
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

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

319 
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

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

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

322 

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

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

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

325 

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

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

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

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

329 

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

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

331 

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

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

337 

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

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

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

340 

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

341 

11474  342 
*** HOL *** 
343 

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

346 

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

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

349 

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

351 
binary representation internally; 

352 

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

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

355 

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

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

357 
are some hints on converting existing sources: 
11702  358 

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

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

361 
to be spaced properly; 

362 

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

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

365 

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

367 

368 
 remove all special provisions on numerals in proofs; 

369 

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

12736  373 
* HOL: symbolic syntax for x^2 (numeral 2); 
374 

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

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

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

377 
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

378 
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

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

380 

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

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

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

385 
declared as simp by default; 

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

386 
 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

387 
qualified)  potential INCOMPATIBILITY; 
12280  388 
 removed "make_scheme" operations (use "make" with "extend")  
389 
INCOMPATIBILITY; 

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

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

396 

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

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

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

399 
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

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

401 

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

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

406 
String.thy has been absorbed into List.thy 

407 

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

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

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

410 

11657  411 
* HOL: linorder_less_split superseded by linorder_cases; 
412 

12917  413 
* HOL/List: "nodups" renamed to "distinct"; 
12889  414 

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

11437  418 

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

421 

422 
delSWrapper "split_all_tac" 

423 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

424 

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

11474  426 
MAY FAIL; 
11361  427 

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

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

431 
necessary to attach explicit type constraints; 

11307  432 

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

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

12489  436 

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

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

438 
expressions; 
11474  439 

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

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

441 
of "lam"  INCOMPATIBILITY; 
11474  442 

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

445 
renamed "Product_Type.unit"; 

11611  446 

12564  447 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
448 

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

451 

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

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

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

454 

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

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

456 
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

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

458 

12734  459 
* HOLReal: added Complex_Numbers (by Gertrud Bauer); 
460 

12690  461 
* HOLHyperreal is now a logic image; 
462 

11611  463 

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

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

465 

12622  466 
* Isar: consts/constdefs supports mixfix syntax for continuous 
467 
operations; 

468 

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

470 
HOLCF/ex/Dnat.thy; 

471 

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

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

475 

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

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

477 

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

478 

11474  479 
*** ZF *** 
480 

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

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

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

485 

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

487 
your theory on Main_ZFC; 

488 

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

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

12563  491 

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

494 

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

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

497 

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

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

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

501 

13025  502 
* ZF: many new theorems about lists, ordinals, etc.; 
12850  503 

11474  504 

505 
*** General *** 

506 

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

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

510 
also ref manual for further ML interfaces; 

511 

512 
* Pure/axclass: removed obsolete ML interface 

513 
goal_subclass/goal_arity; 

514 

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

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

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

518 
properly; 

519 

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

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

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

522 

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

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

524 
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

525 
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

526 
type variable); 
12280  527 

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

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

530 
"type_brackets"; 

531 

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

11817  533 
tokens into AST constants; 
11474  534 

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

537 
multiple declarations for same syntax element constant; 

538 

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

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

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

541 

12280  542 
* Provers/classical: renamed addaltern to addafter, addSaltern to 
543 
addSafter; 

544 

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

546 
as well; 

12253  547 

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

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

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

552 
support requires further installations, e.g. from 

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

554 

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

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

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

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

559 

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

562 

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

565 
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

566 

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

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

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

11551  572 

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

575 
isolatin characters may now be used; the related isatools 

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

577 

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

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

580 
terminal); 

581 

11314  582 

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

583 

11062  584 
New in Isabelle992 (February 2001) 
585 
 

586 

10224  587 
*** Overview of INCOMPATIBILITIES *** 
588 

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

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

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

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

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

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

597 

10998  598 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
599 
gfp_Tarski to gfp_unfold; 

10224  600 

10288  601 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
602 

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

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

10793  606 

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

609 

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

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

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

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

615 
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

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

617 

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

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

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

620 

10224  621 

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

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

623 

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

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

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

628 
typewriter); 

629 

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

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

631 
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

632 

10858  633 
* some more standard symbols; see Appendix A of the system manual for 
11062  634 
the complete list of symbols defined in isabellesym.sty; 
10858  635 

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

638 
definitions); 

639 

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

642 
actual humanreadable proof documents. Please do not include goal 

643 
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

644 

11062  645 
* proper indentation of antiquoted output with proportional LaTeX 
646 
fonts; 

10862  647 

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

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

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

650 

11062  651 
* isatool unsymbolize tunes sources for plain ASCII communication; 
652 

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

653 

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

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

655 

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

658 
documents, due to unpredictable outcome and noncompositional proof 

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

660 
for Prologstyle synthesis of proven results; 

661 

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

664 

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

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

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

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

669 

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

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

672 

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

674 
statements as well; 

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

675 

11097  676 
* Pure: more robust selection of calculational rules; 
677 

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

680 

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

682 
lemmas, using the graph browser tool; 

683 

10944  684 
* Pure: predict failure of "show" in interactive mode; 
685 

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

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

687 

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

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

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

690 

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

694 

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

697 
the result to be shown in each case; 

698 

10770  699 
* HOL: added 'recdef_tc' command; 
700 

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

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

702 

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

703 

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

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

705 

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

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

707 
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

708 
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

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

711 

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

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

715 

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

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

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

720 
literature; 

721 

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

725 

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

728 

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

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

730 
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

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

732 

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

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

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

735 

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

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

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

738 

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

741 
functions for the reals; 

10756  742 

11094  743 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  744 

10858  745 

10474  746 
*** CTT *** 
747 

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

10474  750 

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

753 

10474  754 

10391  755 
*** General *** 
756 

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

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

760 
the Isabelle inference kernel has been greatly improved; 

761 

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

764 

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

767 

11124  768 
* system: support Poly/ML 4.0; 
769 

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

771 

10391  772 

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

773 

10103  774 
New in Isabelle991 (October 2000) 
775 
 

8015  776 

10003  777 
*** Overview of INCOMPATIBILITIES *** 
8014  778 

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

781 
issue the following ML commands: 

782 

783 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

784 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  785 

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

10003  788 

789 
* HOL: nat_less_induct renamed to less_induct; 

790 

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

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

8967  793 

10003  794 
select_equality > some_equality 
795 
select_eq_Ex > some_eq_ex 

796 
selectI2EX > someI2_ex 

797 
selectI2 > someI2 

798 
selectI > someI 

799 
select1_equality > some1_equality 

800 
Eps_sym_eq > some_sym_eq_trivial 

801 
Eps_eq > some_eq_trivial 

802 

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

804 

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

806 
instead); 

807 

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

809 
f.simps instead of f.rules; 

810 

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

812 

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

814 
sometimes be needed; 

815 

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

8014  817 

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

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

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

821 
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

822 
now "<*lex*>" instead of "**"; 
8705  823 

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

9971  826 

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

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

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

829 

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

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

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

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

833 

8848  834 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
835 

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

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

837 
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

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

839 

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

9908  842 

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

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

845 

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

9542  848 

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

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

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

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

853 

9612  854 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
855 

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

856 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  857 

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

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

860 

8014  861 

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

863 

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

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

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

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

868 

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

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

871 

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

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

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

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

875 

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

8566  879 

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

881 

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

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

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

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

885 

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

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

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

889 

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

890 

8184  891 
*** Isar *** 
892 

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

895 
accommodates incremental typeinference very nicely; 

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

896 

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

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

899 

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

902 
useful to collect intermediate results without explicit name 

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

904 
premises; 

8184  905 

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

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

909 
to theorems as "tags"; 

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

910 

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

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

913 

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

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

916 

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

918 

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

921 

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

924 
with the version in Provers/classical; 

9612  925 

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

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

928 

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

931 

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

9612  934 

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

936 
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

937 
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

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

939 

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

942 

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

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

945 
well (including splits); 

946 

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

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

949 

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

951 
of Simplifier and Classical reasoner); 

952 

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

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

955 
recdef) support case names and properly name parameters; 

9612  956 

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

959 
calculations; 

960 

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

962 
method anyway; 

963 

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

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

966 
foo.split foo.split_asm for each datatype; 

967 

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

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

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

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

972 

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

974 

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

976 

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

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

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

979 
proof states; 
8487  980 

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

8487  984 

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

988 
(for HOL datatypes); 

8534  989 

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

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

993 

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

995 

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

998 
(print_commands, print_methods etc.); 

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

999 

10003  1000 
* Isar: added 'nothing'  the empty list of theorems; 
9239  1001 

8184  1002 

8014  1003 
*** HOL *** 
1004 

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

1007 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

1011 

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

8014  1014 

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

1015 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  1016 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
1017 
Rasmussen; 

8570  1018 

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

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

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

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

1022 
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

1023 
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

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

1025 

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

9542  1028 

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

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

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

1031 

10003  1032 
* HOL/Lambda: converted into newstyle theory and document; 
9542  1033 

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

1036 
representation; very useful in avoiding lifting of operations; 

8848  1037 

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

1040 
well; admit "r" as field name; 

9542  1041 

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

1044 

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

1046 
Types nat and int belong to this axclass; 

1047 

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

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

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

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

8736  1055 

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

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

9835  1059 

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

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

1063 

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

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

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

8603  1069 

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

1072 
termination conditions are proved automatically, these simplification 

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

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

1075 
each equation; 

1076 

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

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

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

1079 
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

1080 
invariant proof rule for while is applied. 
9457  1081 

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

8925  1084 

8848  1085 
* HOL: theorems impI, allI, ballI bound as "strip"; 
1086 

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

1090 

10003  1091 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  1092 

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

8626  1095 

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

1098 

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

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

1102 
bogus); 

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

1103 

8412  1104 

9542  1105 
*** ZF *** 
1106 

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

9542  1109 

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

1112 
making the algebraic laws unconditional; 

9542  1113 

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

9542  1116 

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

9542  1119 

10003  1120 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
1121 
simplification; 

9388  1122 

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

9388  1125 

1126 

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

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

1128 

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

1131 

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

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

1134 

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

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

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

1137 

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

1140 
use instead the strong form, 

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

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

1143 
from destructrules; 

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

1144 

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

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

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

1147 

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

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

1149 

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

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

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

1152 

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

1155 
situations; 

1156 

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

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

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

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

1160 

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

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

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

1163 

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

1164 
* system: provide TAGS file for Isabelle sources; 
9052  1165 

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

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

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

1168 

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

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

1170 
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

1171 

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

1174 

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

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

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

1177 

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

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

1180 

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

1181 

8015  1182 

7986  1183 
New in Isabelle99 (October 1999) 
1184 
 

4649  1185 

5931  1186 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
1187 

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

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

7215  1191 

1192 
Delcongs [if_weak_cong]; 

6922  1193 

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

5931  1196 

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

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

1201 

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

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

1203 
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

1204 

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

6057  1207 

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

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

6141  1211 

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

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

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

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

1218 
mk_solver: string > (thm list > int > tactic) > solver 
7619  1219 
where the string argument is only a comment. 
6057  1220 

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

1221 

6069  1222 
*** Proof tools *** 
1223 

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

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

6069  1228 

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

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

1232 
matching. 

6069  1233 

7593  1234 

6014  1235 
*** General *** 
1236 

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

1240 
readable proof documents (Isar == Intelligible semiautomated 

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

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

1243 

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

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

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

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

7215  1249 

7252  1250 
* native support for Proof General, both for classic Isabelle and 
7986  1251 
Isabelle/Isar; 
7215  1252 

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

1255 

6751  1256 
* Isabelle manuals now also available as PDF; 
1257 

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

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

6449  1263 

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

1266 

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

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

1269 

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

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

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

1273 

7215  1274 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
1275 

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

5973  1278 

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

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

1281 

6343  1282 
* new print_mode "HTML"; 
1283 

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

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

1286 

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

1289 

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

1291 
244c244 

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

1293 
 

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

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

1298 
 

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

1300 

7450  1301 
* function bind_thms stores lists of theorems (cf. bind_thm); 
1302 

7593  1303 
* new shorthand tactics ftac, eatac, datac, fatac; 
1304 

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

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

7593  1308 

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

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

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

1311 

6028  1312 

6057  1313 
*** HOL *** 
1314 

7215  1315 
** HOL arithmetic ** 
1316 

6343  1317 
* There are now decision procedures for linear arithmetic over nat and 
1318 
int: 

6131  1319 

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

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

1323 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  1328 

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

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

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

1333 
simplifier. 

6131  1334 

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

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

6028  1338 

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

1343 
type constraints; 

1344 

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

1346 
arguments; 

7157  1347 

7215  1348 
* many properties of integer multiplication, division and remainder 
1349 
are now available; 

6922  1350 

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

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

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

1355 
invocation of the underlying oracle). For SVC see 

7444  1356 
http://verify.stanford.edu/SVC 
6922  1357 

7125  1358 
* IsaMakefile: the HOLReal target now builds an actual image; 
1359 

7215  1360 

1361 
** HOL misc ** 

1362 

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

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

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

1365 

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

1368 

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

1371 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

1372 
changed syntax and (many) tactics; 

1373 

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

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

1377 
"mono" attribute); 

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

1378 

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

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

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

1381 

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

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

1383 

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

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

7326  1388 

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

1390 
Delsimprocs [record_simproc] 

1391 

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

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

1393 
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

1394 

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

1397 

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

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

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

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

6563  1402 

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

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

1406 

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

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

1408 
disabled by default; run isabelle with option m HOL to get back to 
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset

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

1410 

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

1411 
* HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P, 
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset

1412 
ALL x<=y. P, EX x<y. P, EX x<=y. P; 
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset

1413 

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

1414 