author  paulson 
Tue, 19 Aug 2003 13:53:58 +0200  
changeset 14152  12f6f18e7afc 
parent 14136  9b7a62788dac 
child 14171  0cab06e3bbd0 
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 

14136  7 
*** HOL *** 
8 

9 
* 'specification' command added, allowing for definition by 

10 
specification. 

11 

12 

13 
New in Isabelle2003 (May 2003) 

14 
 

15 

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

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

17 

13618  18 
* Provers/simplifier: 
19 

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

23 
the order of assumptions. 

24 

25 
Potential INCOMPATIBILITY: 

26 

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

13618  29 

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

31 

13781  32 
now gives rise to the infinite reduction sequence 
33 

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

35 

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

37 
kind of problem. 

38 

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

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

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

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

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

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

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

13618  46 

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

48 

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

51 
conditions before applying the rewrite rule): 

52 
ML "simp_depth_limit := n" 

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

54 
the simplifier would diverge. 

55 

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

56 
 Accepts free variables as head terms in congruence rules. Useful in Isar. 
13829  57 

13938  58 
 No longer aborts on failed congruence proof. Instead, the 
59 
congruence is ignored. 

60 

14008  61 
* Pure: New generic framework for extracting programs from constructive 
62 
proofs. See HOL/Extraction.thy for an example instantiation, as well 

63 
as HOL/Extraction for some case studies. 

64 

13868  65 
* Pure: The main goal of the proof state is no longer shown by default, only 
66 
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

67 
PG menu: Isabelle/Isar > Settings > Show Main Goal 
13815  68 
(ML: Proof.show_main_goal). 
69 

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

71 
rules whose conclusion matches subgoal 1: 

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

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

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

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

76 
(ML: ProofGeneral.print_intros()) 

77 

78 
* Pure: New flag trace_unify_fail causes unification to print 

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

81 
assumption failed. 

82 

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

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

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

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

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

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

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

90 

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

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

92 
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

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

94 

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

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

96 
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

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

100 
be given (the default is 40); 

101 

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

103 
(batchmode only); 

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

104 

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

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

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

107 
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

108 

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

111 
for slight decrease in efficiency; 

112 

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

115 

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

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

117 
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

118 

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

119 

13158  120 
*** HOL *** 
121 

13899  122 
* arith(_tac) 
123 

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

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

126 
of quantifierfree linear arithmetic. 

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

128 

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

130 

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

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

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

134 

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

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

137 

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

139 
are distributed over a sum of terms; 

140 

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

143 
"<=", "<" and "="). 

144 

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

147 

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

150 

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

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

152 
Finite_Set); 
13492  153 

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

156 

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

159 

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

162 
of the empty set. 

163 

14018  164 
* Algebra: formalization of classical algebra. Intended as base for 
165 
any algebraic development in Isabelle. Currently covers group theory 

166 
(up to Sylow's theorem) and ring theory (Universal Property of 

167 
Univariate Polynomials). Contributions welcome; 

13960  168 

169 
* GroupTheory: deleted, since its material has been moved to Algebra; 

170 

13966
2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

171 
* Complex: new directory of the complex numbers with numeric constants, 
2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

172 
nonstandard complex numbers, and some complex analysis, standard and 
2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

173 
nonstandard (Jacques Fleuriot); 
2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

174 

2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

175 
* HOLComplex: new image for analysis, replacing HOLReal and HOLHyperreal; 
2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

176 

2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

177 
* Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques 
2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

178 
Fleuriot); 
13960  179 

13549  180 
* Real/HahnBanach: updated and adapted to locales; 
181 

13995  182 
* NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad, 
183 
Gray and Kramer); 

13872  184 

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

186 

14011  187 
* MicroJava: bytecode verifier and lightweight bytecode verifier 
188 
as abstract algorithms, instantiated to the JVM; 

189 

14010  190 
* Bali: Java source language formalization. Type system, operational 
191 
semantics, axiomatic semantics. Supported language features: 

192 
classes, interfaces, objects,virtual methods, static methods, 

193 
static/instance fields, arrays, access modifiers, definite 

194 
assignment, exceptions. 

13549  195 

14011  196 

13549  197 
*** ZF *** 
198 

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

200 
universe, etc.); 

201 

13872  202 
* Main ZF: virtually all theories converted to newstyle format; 
13518  203 

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

204 

13478  205 
*** ML *** 
206 

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

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

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

210 

211 
* Pure: improved error reporting of simprocs; 

212 

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

214 
up simprocs; 

215 

216 

13953  217 
*** Document preparation *** 
218 

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

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

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

222 

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

224 
other packages 

225 

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

227 
broke \Rightarrow) 

228 

13954  229 
* normal size for \<zero>...\<nine> (uses \mathbf instead of 
230 
textcomp package) 

13953  231 

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

232 

12984  233 
New in Isabelle2002 (March 2002) 
234 
 

11474  235 

11572  236 
*** Document preparation *** 
237 

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

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

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

240 
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

241 
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

242 
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

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

244 

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

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

246 
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

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

248 

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

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

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

251 

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

254 

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

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

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

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

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

263 
isatool document copies the Isabelle style files to the target 

264 
location; 

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

265 

11572  266 

11633  267 
*** Isar *** 
268 

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

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

272 
 'induct' method divinates rule instantiation from the inductive 

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

274 
instantiation of cases; 

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

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

277 
rules without further ado; 

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

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

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

281 
statement becomes is included in the hypothesis, avoiding the 

282 
slightly cumbersome show "PROP ?case" form; 

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

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

285 
rules stemming from inductive sets to be applied in unstructured 

286 
scripts, while still benefitting from proper handling of nonatomic 

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

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

289 
 'induct' proper support for mutual induction involving nonatomic 

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

291 
below); 

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

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

294 
 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

295 
 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

296 
 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

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

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

299 
 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

300 

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

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

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

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

304 
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

305 
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

306 
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

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

308 

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

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

310 

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

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

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

313 

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

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

315 
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

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

320 
some examples; 

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

321 

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

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

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

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

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

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

327 

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

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

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

332 
the context elements being discharged in the obvious way; 

333 

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

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

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

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

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

339 

11722  340 
* Pure: renamed "antecedent" case to "rule_context"; 
341 

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

344 
use hardwired "Trueprop"; 

345 

11738  346 
* Pure: added 'corollary' command; 
347 

11722  348 
* Pure: fixed 'token_translation' command; 
349 

11899  350 
* Pure: removed obsolete 'exported' attribute; 
351 

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

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

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

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

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

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

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

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

361 

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

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

363 
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

364 
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

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

366 

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

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

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

369 

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

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

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

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

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

374 

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

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

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

377 

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

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

379 
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

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

381 

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

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

383 
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

384 
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

385 

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

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

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

388 
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

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

390 
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

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

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

393 

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

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

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

396 

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

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

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

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

400 

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

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

402 

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

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

408 

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

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

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

411 

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

412 

11474  413 
*** HOL *** 
414 

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

417 

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

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

420 

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

422 
binary representation internally; 

423 

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

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

426 

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

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

428 
are some hints on converting existing sources: 
11702  429 

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

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

432 
to be spaced properly; 

433 

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

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

436 

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

438 

439 
 remove all special provisions on numerals in proofs; 

440 

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

12736  444 
* HOL: symbolic syntax for x^2 (numeral 2); 
445 

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

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

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

448 
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

449 
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

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

451 

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

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

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

456 
declared as simp by default; 

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

457 
 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

458 
qualified)  potential INCOMPATIBILITY; 
12280  459 
 removed "make_scheme" operations (use "make" with "extend")  
460 
INCOMPATIBILITY; 

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

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

467 

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

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

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

470 
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

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

472 

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

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

477 
String.thy has been absorbed into List.thy 

478 

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

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

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

481 

11657  482 
* HOL: linorder_less_split superseded by linorder_cases; 
483 

12917  484 
* HOL/List: "nodups" renamed to "distinct"; 
12889  485 

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

11437  489 

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

492 

493 
delSWrapper "split_all_tac" 

494 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

495 

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

11474  497 
MAY FAIL; 
11361  498 

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

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

502 
necessary to attach explicit type constraints; 

11307  503 

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

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

12489  507 

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

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

509 
expressions; 
11474  510 

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

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

512 
of "lam"  INCOMPATIBILITY; 
11474  513 

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

516 
renamed "Product_Type.unit"; 

11611  517 

12564  518 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
519 

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

522 

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

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

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

525 

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

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

527 
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

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

529 

12734  530 
* HOLReal: added Complex_Numbers (by Gertrud Bauer); 
531 

12690  532 
* HOLHyperreal is now a logic image; 
533 

11611  534 

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

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

536 

12622  537 
* Isar: consts/constdefs supports mixfix syntax for continuous 
538 
operations; 

539 

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

541 
HOLCF/ex/Dnat.thy; 

542 

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

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

546 

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

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

548 

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

549 

11474  550 
*** ZF *** 
551 

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

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

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

556 

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

558 
your theory on Main_ZFC; 

559 

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

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

12563  562 

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

565 

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

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

568 

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

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

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

572 

13025  573 
* ZF: many new theorems about lists, ordinals, etc.; 
12850  574 

11474  575 

576 
*** General *** 

577 

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

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

581 
also ref manual for further ML interfaces; 

582 

583 
* Pure/axclass: removed obsolete ML interface 

584 
goal_subclass/goal_arity; 

585 

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

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

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

589 
properly; 

590 

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

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

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

593 

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

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

595 
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

596 
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

597 
type variable); 
12280  598 

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

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

601 
"type_brackets"; 

602 

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

11817  604 
tokens into AST constants; 
11474  605 

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

608 
multiple declarations for same syntax element constant; 

609 

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

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

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

612 

12280  613 
* Provers/classical: renamed addaltern to addafter, addSaltern to 
614 
addSafter; 

615 

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

617 
as well; 

12253  618 

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

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

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

623 
support requires further installations, e.g. from 

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

625 

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

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

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

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

630 

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

633 

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

636 
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

637 

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

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

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

11551  643 

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

646 
isolatin characters may now be used; the related isatools 

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

648 

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

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

651 
terminal); 

652 

11314  653 

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

654 

11062  655 
New in Isabelle992 (February 2001) 
656 
 

657 

10224  658 
*** Overview of INCOMPATIBILITIES *** 
659 

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

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

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

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

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

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

668 

10998  669 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
670 
gfp_Tarski to gfp_unfold; 

10224  671 

10288  672 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
673 

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

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

10793  677 

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

680 

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

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

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

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

686 
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

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

688 

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

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

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

691 

10224  692 

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

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

694 

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

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

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

699 
typewriter); 

700 

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

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

702 
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

703 

10858  704 
* some more standard symbols; see Appendix A of the system manual for 
11062  705 
the complete list of symbols defined in isabellesym.sty; 
10858  706 

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

709 
definitions); 

710 

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

713 
actual humanreadable proof documents. Please do not include goal 

714 
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

715 

11062  716 
* proper indentation of antiquoted output with proportional LaTeX 
717 
fonts; 

10862  718 

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

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

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

721 

11062  722 
* isatool unsymbolize tunes sources for plain ASCII communication; 
723 

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

724 

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

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

726 

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

729 
documents, due to unpredictable outcome and noncompositional proof 

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

731 
for Prologstyle synthesis of proven results; 

732 

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

735 

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

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

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

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

740 

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

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

743 

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

745 
statements as well; 

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

746 

11097  747 
* Pure: more robust selection of calculational rules; 
748 

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

751 

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

753 
lemmas, using the graph browser tool; 

754 

10944  755 
* Pure: predict failure of "show" in interactive mode; 
756 

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

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

758 

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

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

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

761 

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

765 

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

768 
the result to be shown in each case; 

769 

10770  770 
* HOL: added 'recdef_tc' command; 
771 

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

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

773 

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

774 

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

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

776 

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

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

778 
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

779 
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

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

782 

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

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

786 

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

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

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

791 
literature; 

792 

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

796 

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

799 

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

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

801 
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

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

803 

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

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

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

806 

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

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

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

809 

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

812 
functions for the reals; 

10756  813 

11094  814 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  815 

10858  816 

10474  817 
*** CTT *** 
818 

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

10474  821 

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

824 

10474  825 

10391  826 
*** General *** 
827 

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

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

831 
the Isabelle inference kernel has been greatly improved; 

832 

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

835 

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

838 

11124  839 
* system: support Poly/ML 4.0; 
840 

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

842 

10391  843 

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

844 

10103  845 
New in Isabelle991 (October 2000) 
846 
 

8015  847 

10003  848 
*** Overview of INCOMPATIBILITIES *** 
8014  849 

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

852 
issue the following ML commands: 

853 

854 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

855 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  856 

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

10003  859 

860 
* HOL: nat_less_induct renamed to less_induct; 

861 

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

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

8967  864 

10003  865 
select_equality > some_equality 
866 
select_eq_Ex > some_eq_ex 

867 
selectI2EX > someI2_ex 

868 
selectI2 > someI2 

869 
selectI > someI 

870 
select1_equality > some1_equality 

871 
Eps_sym_eq > some_sym_eq_trivial 

872 
Eps_eq > some_eq_trivial 

873 

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

875 

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

877 
instead); 

878 

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

880 
f.simps instead of f.rules; 

881 

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

883 

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

885 
sometimes be needed; 

886 

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

8014  888 

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

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

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

892 
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

893 
now "<*lex*>" instead of "**"; 
8705  894 

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

9971  897 

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

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

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

900 

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

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

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

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

904 

8848  905 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
906 

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

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

908 
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

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

910 

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

9908  913 

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

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

916 

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

9542  919 

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

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

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

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

924 

9612  925 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
926 

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

927 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  928 

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

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

931 

8014  932 

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

934 

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

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

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

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

939 

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

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

942 

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

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

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

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

946 

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

8566  950 

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

952 

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

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

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

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

956 

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

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

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

960 

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

961 

8184  962 
*** Isar *** 
963 

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

966 
accommodates incremental typeinference very nicely; 

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

967 

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

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

970 

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

973 
useful to collect intermediate results without explicit name 

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

975 
premises; 

8184  976 

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

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

980 
to theorems as "tags"; 

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

981 

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

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

984 

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

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

987 

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

989 

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

992 

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

995 
with the version in Provers/classical; 

9612  996 

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

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

999 

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

1002 

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

9612  1005 

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

1007 
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

1008 
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

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

1010 

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

1013 

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

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

1016 
well (including splits); 

1017 

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

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

1020 

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

1022 
of Simplifier and Classical reasoner); 

1023 

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

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

1026 
recdef) support case names and properly name parameters; 

9612  1027 

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

1030 
calculations; 

1031 

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

1033 
method anyway; 

1034 

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

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

1037 
foo.split foo.split_asm for each datatype; 

1038 

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

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

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

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

1043 

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

1045 

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

1047 

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

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

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

1050 
proof states; 
8487  1051 

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

8487  1055 

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

1059 
(for HOL datatypes); 

8534  1060 

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

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

1064 

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

1066 

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

1069 
(print_commands, print_methods etc.); 

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

1070 

10003  1071 
* Isar: added 'nothing'  the empty list of theorems; 
9239  1072 

8184  1073 

8014  1074 
*** HOL *** 
1075 

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

1078 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

1082 

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

8014  1085 

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

1086 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  1087 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
1088 
Rasmussen; 

8570  1089 

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

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

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

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

1093 
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

1094 
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

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

1096 

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

9542  1099 

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

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

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

1102 

10003  1103 
* HOL/Lambda: converted into newstyle theory and document; 
9542  1104 

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

1107 
representation; very useful in avoiding lifting of operations; 

8848  1108 

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

1111 
well; admit "r" as field name; 

9542  1112 

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

1115 

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

1117 
Types nat and int belong to this axclass; 

1118 

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

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

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

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

8736  1126 

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

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

9835  1130 

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

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

1134 

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

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

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

8603  1140 

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

1143 
termination conditions are proved automatically, these simplification 

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

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

1146 
each equation; 

1147 

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

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

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

1150 
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

1151 
invariant proof rule for while is applied. 
9457  1152 

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

8925  1155 

8848  1156 
* HOL: theorems impI, allI, ballI bound as "strip"; 
1157 

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

1161 

10003  1162 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  1163 

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

8626  1166 

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

1169 

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

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

1173 
bogus); 

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

1174 

8412  1175 

9542  1176 
*** ZF *** 
1177 

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

9542  1180 

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

1183 
making the algebraic laws unconditional; 

9542  1184 

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

9542  1187 

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

9542  1190 

10003  1191 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
1192 
simplification; 

9388  1193 

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

9388  1196 

1197 

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

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

1199 

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

1202 

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

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

1205 

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

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

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

1208 

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

1211 
use instead the strong form, 

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

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

1214 
from destructrules; 

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

1215 

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

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

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

1218 

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

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

1220 

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

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

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

1223 

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

1226 
situations; 

1227 

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

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

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

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

1231 

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

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

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

1234 

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

1235 
* system: provide TAGS file for Isabelle sources; 
9052  1236 

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

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

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

1239 

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

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

1241 
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

1242 

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

1245 

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

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

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

1248 

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

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

1251 

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

1252 

8015  1253 

7986  1254 
New in Isabelle99 (October 1999) 
1255 
 

4649  1256 

5931  1257 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
1258 

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

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

7215  1262 

1263 
Delcongs [if_weak_cong]; 

6922  1264 

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

5931  1267 

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

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

1272 

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

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

1274 
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

1275 

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

6057  1278 

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

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

6141  1282 

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

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

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

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

1289 
mk_solver: string > (thm list > int > tactic) > solver 
7619  1290 
where the string argument is only a comment. 
6057  1291 

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

1292 

6069  1293 
*** Proof tools *** 
1294 

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

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

6069  1299 

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

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

1303 
matching. 

6069  1304 

7593  1305 

6014  1306 
*** General *** 
1307 

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

1311 
readable proof documents (Isar == Intelligible semiautomated 

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

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

1314 

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

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

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

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

7215  1320 

7252  1321 
* native support for Proof General, both for classic Isabelle and 
7986  1322 
Isabelle/Isar; 
7215  1323 

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

1326 

6751  1327 
* Isabelle manuals now also available as PDF; 
1328 

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

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

6449  1334 

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

1337 

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

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

1340 

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

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

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

1344 

7215  1345 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
1346 

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

5973  1349 

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

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

1352 

6343  1353 
* new print_mode "HTML"; 
1354 

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

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

1357 

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

1360 

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

1362 
244c244 

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

1364 
 

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

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

1369 
 

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

1371 

7450  1372 
* function bind_thms stores lists of theorems (cf. bind_thm); 
1373 

7593  1374 
* new shorthand tactics ftac, eatac, datac, fatac; 
1375 

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

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

7593  1379 

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

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

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

1382 

6028  1383 

6057  1384 
*** HOL *** 
1385 

7215  1386 
** HOL arithmetic ** 
1387 

6343  1388 
* There are now decision procedures for linear arithmetic over nat and 
1389 
int: 

6131  1390 

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

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

1394 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  1399 

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

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

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

1404 
simplifier. 

6131  1405 

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

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

6028  1409 

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

1414 
type constraints; 

1379275df5cd
tuned;
wenz 