author  kleing 
Mon, 05 May 2003 13:42:16 +0200  
changeset 13953  65b76920e108 
parent 13938  b033b53d0c1e 
child 13954  2e989faba65a 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

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

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

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

6 

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

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

8 

13618  9 
* Provers/simplifier: 
10 

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

14 
the order of assumptions. 

15 

16 
Potential INCOMPATIBILITY: 

17 

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

13618  20 

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

22 

13781  23 
now gives rise to the infinite reduction sequence 
24 

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

26 

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

28 
kind of problem. 

29 

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

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

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

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

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

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

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

13618  37 

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

39 

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

42 
conditions before applying the rewrite rule): 

43 
ML "simp_depth_limit := n" 

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

45 
the simplifier would diverge. 

46 

13835
12b2ffbe543a
Change to meta simplifier: congruence rules may now have frees as head of term.
ballarin
parents:
13829
diff
changeset

47 
 Accepts free variables as head terms in congruence rules. Useful in Isar. 
13829  48 

13938  49 
 No longer aborts on failed congruence proof. Instead, the 
50 
congruence is ignored. 

51 

13868  52 
* Pure: The main goal of the proof state is no longer shown by default, only 
53 
the subgoals. This behaviour is controlled by a new flag. 

13835
12b2ffbe543a
Change to meta simplifier: congruence rules may now have frees as head of term.
ballarin
parents:
13829
diff
changeset

54 
PG menu: Isabelle/Isar > Settings > Show Main Goal 
13815  55 
(ML: Proof.show_main_goal). 
56 

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

58 
rules whose conclusion matches subgoal 1: 

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

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

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

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

63 
(ML: ProofGeneral.print_intros()) 

64 

65 
* Pure: New flag trace_unify_fail causes unification to print 

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

68 
assumption failed. 

69 

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

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

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

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

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

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

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

77 

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

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

79 
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

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

81 

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

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

83 
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

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

87 
be given (the default is 40); 

88 

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

90 
(batchmode only); 

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

91 

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

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

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

94 
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

95 

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

98 
for slight decrease in efficiency; 

99 

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

102 

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

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

104 
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

105 

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

106 

13158  107 
*** HOL *** 
108 

13899  109 
* arith(_tac) 
110 

111 
 Produces a counter example if it cannot prove a goal. 

112 
Note that the counter example may be spurious if the goal is not a formula 

113 
of quantifierfree linear arithmetic. 

114 
In ProofGeneral the counter example appears in the trace buffer. 

115 

116 
 Knows about div k and mod k where k is a numeral of type nat or int. 

117 

118 
 Calls full Presburger arithmetic (by Amine Chaieb) if quantifierfree 

119 
linear arithmetic fails. This takes account of quantifiers and divisibility. 

120 
Presburger arithmetic can also be called explicitly via presburger(_tac). 

121 

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

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

124 

125 
* simp reduces "m*(n div m) + n mod m" to n, even if the two summands 

126 
are distributed over a sum of terms; 

127 

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

130 
"<=", "<" and "="). 

131 

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

134 

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

137 

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

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

139 
Finite_Set); 
13492  140 

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

143 

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

146 

13899  147 
* Map: `empty' is no longer a constant but a syntactic abbreviation for 
148 
%x. None. Warning: empty_def now refers to the previously hidden definition 

149 
of the empty set. 

150 

13549  151 
* Real/HahnBanach: updated and adapted to locales; 
152 

13872  153 
* GroupTheory: converted to Isar theories, using locales with implicit 
154 
structures. Also a new, experimental summation operator for abelian groups; 

155 

156 
* NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad, Gray and 

157 
Kramer); 

158 

159 
* UNITY: added the MeierSanders theory of progress sets; 

160 

13549  161 

162 
*** ZF *** 

163 

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

165 
universe, etc.); 

166 

13872  167 
* Main ZF: virtually all theories converted to newstyle format; 
13518  168 

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

169 

13478  170 
*** ML *** 
171 

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

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

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

175 

176 
* Pure: improved error reporting of simprocs; 

177 

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

179 
up simprocs; 

180 

181 

13953  182 
*** Document preparation *** 
183 

184 
* uses \par instead of \\ for line breaks in theory text. This may 

185 
shift some page breaks in large documents. To get the old behaviour 

186 
use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex. 

187 

188 
* minimized dependencies of isabelle.sty and isabellesym.sty on 

189 
other packages 

190 

191 
* \<euro> now needs package babel/greek instead of marvosym (which 

192 
broke \Rightarrow) 

193 

194 
* normal size for \<0>...\<9> (uses \mathbf instead of textcomp package) 

195 

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

196 

12984  197 
New in Isabelle2002 (March 2002) 
198 
 

11474  199 

11572  200 
*** Document preparation *** 
201 

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

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

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

204 
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

205 
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

206 
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

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

208 

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

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

210 
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

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

212 

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

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

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

215 

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

218 

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

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

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

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

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

227 
isatool document copies the Isabelle style files to the target 

228 
location; 

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

229 

11572  230 

11633  231 
*** Isar *** 
232 

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

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

236 
 'induct' method divinates rule instantiation from the inductive 

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

238 
instantiation of cases; 

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

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

241 
rules without further ado; 

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

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

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

245 
statement becomes is included in the hypothesis, avoiding the 

246 
slightly cumbersome show "PROP ?case" form; 

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

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

249 
rules stemming from inductive sets to be applied in unstructured 

250 
scripts, while still benefitting from proper handling of nonatomic 

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

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

253 
 'induct' proper support for mutual induction involving nonatomic 

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

255 
below); 

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

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

258 
 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

259 
 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

260 
 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

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

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

263 
 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

264 

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

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

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

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

268 
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

269 
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

270 
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

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

272 

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

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

274 

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

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

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

277 

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

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

279 
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

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

284 
some examples; 

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

285 

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

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

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

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

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

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

291 

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

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

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

296 
the context elements being discharged in the obvious way; 

297 

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

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

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

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

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

303 

11722  304 
* Pure: renamed "antecedent" case to "rule_context"; 
305 

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

308 
use hardwired "Trueprop"; 

309 

11738  310 
* Pure: added 'corollary' command; 
311 

11722  312 
* Pure: fixed 'token_translation' command; 
313 

11899  314 
* Pure: removed obsolete 'exported' attribute; 
315 

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

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

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

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

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

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

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

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

325 

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

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

327 
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

328 
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

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

330 

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

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

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

333 

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

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

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

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

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

338 

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

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

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

341 

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

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

343 
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

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

345 

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

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

347 
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

348 
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

349 

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

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

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

352 
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

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

354 
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

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

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

357 

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

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

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

360 

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

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

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

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

364 

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

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

366 

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

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

372 

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

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

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

375 

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

376 

11474  377 
*** HOL *** 
378 

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

381 

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

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

384 

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

386 
binary representation internally; 

387 

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

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

390 

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

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

392 
are some hints on converting existing sources: 
11702  393 

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

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

396 
to be spaced properly; 

397 

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

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

400 

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

402 

403 
 remove all special provisions on numerals in proofs; 

404 

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

12736  408 
* HOL: symbolic syntax for x^2 (numeral 2); 
409 

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

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

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

412 
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

413 
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

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

415 

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

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

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

420 
declared as simp by default; 

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

421 
 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

422 
qualified)  potential INCOMPATIBILITY; 
12280  423 
 removed "make_scheme" operations (use "make" with "extend")  
424 
INCOMPATIBILITY; 

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

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

431 

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

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

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

434 
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

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

436 

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

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

441 
String.thy has been absorbed into List.thy 

442 

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

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

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

445 

11657  446 
* HOL: linorder_less_split superseded by linorder_cases; 
447 

12917  448 
* HOL/List: "nodups" renamed to "distinct"; 
12889  449 

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

11437  453 

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

456 

457 
delSWrapper "split_all_tac" 

458 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

459 

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

11474  461 
MAY FAIL; 
11361  462 

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

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

466 
necessary to attach explicit type constraints; 

11307  467 

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

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

12489  471 

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

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

473 
expressions; 
11474  474 

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

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

476 
of "lam"  INCOMPATIBILITY; 
11474  477 

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

480 
renamed "Product_Type.unit"; 

11611  481 

12564  482 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
483 

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

486 

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

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

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

489 

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

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

491 
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

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

493 

12734  494 
* HOLReal: added Complex_Numbers (by Gertrud Bauer); 
495 

12690  496 
* HOLHyperreal is now a logic image; 
497 

11611  498 

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

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

500 

12622  501 
* Isar: consts/constdefs supports mixfix syntax for continuous 
502 
operations; 

503 

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

505 
HOLCF/ex/Dnat.thy; 

506 

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

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

510 

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

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

512 

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

513 

11474  514 
*** ZF *** 
515 

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

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

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

520 

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

522 
your theory on Main_ZFC; 

523 

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

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

12563  526 

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

529 

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

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

532 

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

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

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

536 

13025  537 
* ZF: many new theorems about lists, ordinals, etc.; 
12850  538 

11474  539 

540 
*** General *** 

541 

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

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

545 
also ref manual for further ML interfaces; 

546 

547 
* Pure/axclass: removed obsolete ML interface 

548 
goal_subclass/goal_arity; 

549 

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

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

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

553 
properly; 

554 

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

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

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

557 

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

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

559 
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

560 
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

561 
type variable); 
12280  562 

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

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

565 
"type_brackets"; 

566 

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

11817  568 
tokens into AST constants; 
11474  569 

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

572 
multiple declarations for same syntax element constant; 

573 

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

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

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

576 

12280  577 
* Provers/classical: renamed addaltern to addafter, addSaltern to 
578 
addSafter; 

579 

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

581 
as well; 

12253  582 

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

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

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

587 
support requires further installations, e.g. from 

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

589 

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

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

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

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

594 

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

597 

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

600 
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

601 

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

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

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

11551  607 

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

610 
isolatin characters may now be used; the related isatools 

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

612 

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

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

615 
terminal); 

616 

11314  617 

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

618 

11062  619 
New in Isabelle992 (February 2001) 
620 
 

621 

10224  622 
*** Overview of INCOMPATIBILITIES *** 
623 

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

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

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

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

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

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

632 

10998  633 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
634 
gfp_Tarski to gfp_unfold; 

10224  635 

10288  636 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
637 

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

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

10793  641 

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

644 

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

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

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

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

650 
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

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

652 

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

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

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

655 

10224  656 

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

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

658 

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

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

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

663 
typewriter); 

664 

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

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

666 
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

667 

10858  668 
* some more standard symbols; see Appendix A of the system manual for 
11062  669 
the complete list of symbols defined in isabellesym.sty; 
10858  670 

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

673 
definitions); 

674 

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

677 
actual humanreadable proof documents. Please do not include goal 

678 
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

679 

11062  680 
* proper indentation of antiquoted output with proportional LaTeX 
681 
fonts; 

10862  682 

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

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

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

685 

11062  686 
* isatool unsymbolize tunes sources for plain ASCII communication; 
687 

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

688 

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

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

690 

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

693 
documents, due to unpredictable outcome and noncompositional proof 

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

695 
for Prologstyle synthesis of proven results; 

696 

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

699 

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

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

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

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

704 

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

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

707 

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

709 
statements as well; 

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

710 

11097  711 
* Pure: more robust selection of calculational rules; 
712 

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

715 

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

717 
lemmas, using the graph browser tool; 

718 

10944  719 
* Pure: predict failure of "show" in interactive mode; 
720 

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

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

722 

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

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

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

725 

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

729 

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

732 
the result to be shown in each case; 

733 

10770  734 
* HOL: added 'recdef_tc' command; 
735 

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

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

737 

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

738 

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

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

740 

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

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

742 
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

743 
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

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

746 

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

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

750 

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

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

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

755 
literature; 

756 

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

760 

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

763 

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

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

765 
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

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

767 

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

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

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

770 

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

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

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

773 

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

776 
functions for the reals; 

10756  777 

11094  778 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  779 

10858  780 

10474  781 
*** CTT *** 
782 

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

10474  785 

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

788 

10474  789 

10391  790 
*** General *** 
791 

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

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

795 
the Isabelle inference kernel has been greatly improved; 

796 

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

799 

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

802 

11124  803 
* system: support Poly/ML 4.0; 
804 

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

806 

10391  807 

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

808 

10103  809 
New in Isabelle991 (October 2000) 
810 
 

8015  811 

10003  812 
*** Overview of INCOMPATIBILITIES *** 
8014  813 

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

816 
issue the following ML commands: 

817 

818 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

819 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  820 

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

10003  823 

824 
* HOL: nat_less_induct renamed to less_induct; 

825 

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

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

8967  828 

10003  829 
select_equality > some_equality 
830 
select_eq_Ex > some_eq_ex 

831 
selectI2EX > someI2_ex 

832 
selectI2 > someI2 

833 
selectI > someI 

834 
select1_equality > some1_equality 

835 
Eps_sym_eq > some_sym_eq_trivial 

836 
Eps_eq > some_eq_trivial 

837 

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

839 

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

841 
instead); 

842 

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

844 
f.simps instead of f.rules; 

845 

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

847 

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

849 
sometimes be needed; 

850 

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

8014  852 

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

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

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

856 
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

857 
now "<*lex*>" instead of "**"; 
8705  858 

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

9971  861 

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

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

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

864 

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

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

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

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

868 

8848  869 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
870 

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

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

872 
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

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

874 

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

9908  877 

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

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

880 

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

9542  883 

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

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

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

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

888 

9612  889 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
890 

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

891 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  892 

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

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

895 

8014  896 

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

898 

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

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

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

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

903 

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

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

906 

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

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

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

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

910 

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

8566  914 

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

916 

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

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

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

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

920 

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

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

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

924 

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

925 

8184  926 
*** Isar *** 
927 

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

930 
accommodates incremental typeinference very nicely; 

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

931 

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

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

934 

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

937 
useful to collect intermediate results without explicit name 

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

939 
premises; 

8184  940 

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

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

944 
to theorems as "tags"; 

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

945 

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

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

948 

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

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

951 

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

953 

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

956 

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

959 
with the version in Provers/classical; 

9612  960 

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

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

963 

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

966 

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

9612  969 

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

971 
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

972 
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

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

974 

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

977 

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

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

980 
well (including splits); 

981 

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

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

984 

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

986 
of Simplifier and Classical reasoner); 

987 

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

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

990 
recdef) support case names and properly name parameters; 

9612  991 

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

994 
calculations; 

995 

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

997 
method anyway; 

998 

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

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

1001 
foo.split foo.split_asm for each datatype; 

1002 

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

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

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

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

1007 

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

1009 

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

1011 

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

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

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

1014 
proof states; 
8487  1015 

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

8487  1019 

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

1023 
(for HOL datatypes); 

8534  1024 

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

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

1028 

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

1030 

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

1033 
(print_commands, print_methods etc.); 

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

1034 

10003  1035 
* Isar: added 'nothing'  the empty list of theorems; 
9239  1036 

8184  1037 

8014  1038 
*** HOL *** 
1039 

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

1042 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

1046 

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

8014  1049 

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

1050 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  1051 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
1052 
Rasmussen; 

8570  1053 

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

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

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

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

1057 
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

1058 
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

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

1060 

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

9542  1063 

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

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

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

1066 

10003  1067 
* HOL/Lambda: converted into newstyle theory and document; 
9542  1068 

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

1071 
representation; very useful in avoiding lifting of operations; 

8848  1072 

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

1075 
well; admit "r" as field name; 

9542  1076 

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

1079 

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

1081 
Types nat and int belong to this axclass; 

1082 

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

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

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

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

8736  1090 

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

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

9835  1094 

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

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

1098 

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

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

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

8603  1104 

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

1107 
termination conditions are proved automatically, these simplification 

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

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

1110 
each equation; 

1111 

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

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

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

1114 
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

1115 
invariant proof rule for while is applied. 
9457  1116 

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

8925  1119 

8848  1120 
* HOL: theorems impI, allI, ballI bound as "strip"; 
1121 

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

1125 

10003  1126 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  1127 

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

8626  1130 

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

1133 

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

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

1137 
bogus); 

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

1138 

8412  1139 

9542  1140 
*** ZF *** 
1141 

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

9542  1144 

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

1147 
making the algebraic laws unconditional; 

9542  1148 

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

9542  1151 

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

9542  1154 

10003  1155 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
1156 
simplification; 

9388  1157 

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

9388  1160 

1161 

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

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

1163 

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

1166 

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

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

1169 

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

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

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

1172 

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

1175 
use instead the strong form, 

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

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

1178 
from destructrules; 

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

1179 

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

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

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

1182 

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

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

1184 

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

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

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

1187 

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

1190 
situations; 

1191 

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

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

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

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

1195 

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

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

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

1198 

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

1199 
* system: provide TAGS file for Isabelle sources; 
9052  1200 

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

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

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

1203 

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

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

1205 
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

1206 

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

1209 

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

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

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

1212 

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

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

1215 

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

1216 

8015  1217 

7986  1218 
New in Isabelle99 (October 1999) 
1219 
 

4649  1220 

5931  1221 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
1222 

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

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

7215  1226 

1227 
Delcongs [if_weak_cong]; 

6922  1228 

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

5931  1231 

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

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

1236 

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

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

1238 
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

1239 

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

6057  1242 

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

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

6141  1246 

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

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

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

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

1253 
mk_solver: string > (thm list > int > tactic) > solver 
7619  1254 
where the string argument is only a comment. 
6057  1255 

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

1256 

6069  1257 
*** Proof tools *** 
1258 

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

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

6069  1263 

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

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

1267 
matching. 

6069  1268 

7593  1269 

6014  1270 
*** General *** 
1271 

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

1275 
readable proof documents (Isar == Intelligible semiautomated 

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

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

1278 

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

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

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

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

7215  1284 

7252  1285 
* native support for Proof General, both for classic Isabelle and 
7986  1286 
Isabelle/Isar; 
7215  1287 

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

1290 

6751  1291 
* Isabelle manuals now also available as PDF; 
1292 

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

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

6449  1298 

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

1301 

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

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

1304 

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

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

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

1308 

7215  1309 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
1310 

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

5973  1313 

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

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

1316 

6343  1317 
* new print_mode "HTML"; 
1318 

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

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

1321 

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

1324 

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

1326 
244c244 

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

1328 
 

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

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

1333 
 

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

1335 

7450  1336 
* function bind_thms stores lists of theorems (cf. bind_thm); 
1337 

7593  1338 
* new shorthand tactics ftac, eatac, datac, fatac; 
1339 

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

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

7593  1343 

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

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

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

1346 

6028  1347 

6057  1348 
*** HOL *** 
1349 

7215  1350 
** HOL arithmetic ** 
1351 

6343  1352 
* There are now decision procedures for linear arithmetic over nat and 
1353 
int: 

6131  1354 

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

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

1358 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  1363 

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

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

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

1368 
simplifier. 

6131  1369 

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

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

6028  1373 

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

1378 
type constraints; 

1379 

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

1381 
arguments; 

7157  1382 

7215  1383 
* many properties of integer multiplication, division and remainder 
1384 
are now available; 

6922  1385 

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

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

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

1390 
invocation of the underlying oracle). For SVC see 

7444  1391 
http://verify.stanford.edu/SVC 
6922  1392 

7125  1393 
* IsaMakefile: the HOLReal target now builds an actual image; 
1394 

7215  1395 

1396 
** HOL misc ** 

1397 

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

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

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

1400 

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

1403 

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

1406 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 
