author  paulson 
Tue, 10 Feb 2004 12:02:11 +0100  
changeset 14378  69c4d5997669 
parent 14375  a545da363b23 
child 14380  04b603a6f17d 
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 

14171
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset

7 
*** General *** 
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset

8 

0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset

9 
* Pure: Greek letters (except small lambda, \<lambda>), as well as gothic 
14173  10 
(\<aa>...\<zz>\<AA>...\<ZZ>), caligraphic (\<A>...\<Z>), and euler 
11 
(\<a>...\<z>), are now considered normal letters, and can therefore 

12 
be used anywhere where an ASCII letter (a...zA...Z) has until 

13 
now. COMPATIBILITY: This obviously changes the parsing of some 

14 
terms, especially where a symbol has been used as a binder, say 

15 
'\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed 

16 
as an identifier. Fix it by inserting a space around former 

17 
symbols. Call 'isatool fixgreek' to try to fix parsing errors in 

18 
existing theory and ML files. 

14171
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset

19 

14237  20 
* Pure: Macintosh and Windows linebreaks are now allowed in theory files. 
21 

14234
9590df3c5f2a
use \<^isub> and \<^isup> in identifiers instead of just \<^sub> (avoid
kleing
parents:
14233
diff
changeset

22 
* Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now 
9590df3c5f2a
use \<^isub> and \<^isup> in identifiers instead of just \<^sub> (avoid
kleing
parents:
14233
diff
changeset

23 
allowed in identifiers. Similar to greek letters \<^isub> is now considered 
9590df3c5f2a
use \<^isub> and \<^isup> in identifiers instead of just \<^sub> (avoid
kleing
parents:
14233
diff
changeset

24 
a normal (but invisible) letter. For multiple letter subscripts repeat 
9590df3c5f2a
use \<^isub> and \<^isup> in identifiers instead of just \<^sub> (avoid
kleing
parents:
14233
diff
changeset

25 
\<^isub> like this: x\<^isub>1\<^isub>2. 
14233  26 

14333  27 
* Pure: There are now sub/superscripts that can span more than one 
28 
character. Text between \<^bsub> and \<^esub> is set in subscript in 

29 
PG and LaTeX, text between \<^bsup> and \<^esup> in superscript. The 

30 
new control characters are not identifier parts. 

31 

14361
ad2f5da643b4
* Support for raw latex output in control symbols: \<^raw...>
schirmer
parents:
14333
diff
changeset

32 
* Pure: Controlsymbols of the form \<^raw...> will literally print the 
ad2f5da643b4
* Support for raw latex output in control symbols: \<^raw...>
schirmer
parents:
14333
diff
changeset

33 
content of ... to the latex file instead of \isacntrl... . The ... 
ad2f5da643b4
* Support for raw latex output in control symbols: \<^raw...>
schirmer
parents:
14333
diff
changeset

34 
accepts all printable characters excluding the end bracket >. 
ad2f5da643b4
* Support for raw latex output in control symbols: \<^raw...>
schirmer
parents:
14333
diff
changeset

35 

ad2f5da643b4
* Support for raw latex output in control symbols: \<^raw...>
schirmer
parents:
14333
diff
changeset

36 
* Pure: Symbols may only start with one backslash: \<...>. \\<...> is no 
ad2f5da643b4
* Support for raw latex output in control symbols: \<^raw...>
schirmer
parents:
14333
diff
changeset

37 
longer accepted by the scanner. 
ad2f5da643b4
* Support for raw latex output in control symbols: \<^raw...>
schirmer
parents:
14333
diff
changeset

38 

14237  39 
* Pure: Using new Isar command "finalconsts" (or the ML functions 
40 
Theory.add_finals or Theory.add_finals_i) it is now possible to 

41 
declare constants "final", which prevents their being given a definition 

42 
later. It is useful for constants whose behaviour is fixed axiomatically 

14224  43 
rather than definitionally, such as the metalogic connectives. 
44 

14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

45 
*** Isar *** 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

46 

dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

47 
* Tactic emulation methods ?rule_tac, cut_tac, subgoal_tac and thin_tac: 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

48 
 Now understand static (Isar) contexts. As a consequence, users of Isar 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

49 
locales are no longer forced to write Isar proof scripts. 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

50 
For details see Isar Reference Manual, paragraph 4.3.2: Further tactic 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

51 
emulations. 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

52 
 INCOMPATIBILITY: names of variables to be instantiated may no 
14211
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

53 
longer be enclosed in quotes. Instead, precede variable name with `?'. 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

54 
This is consistent with the instantiation attribute "where". 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

55 

14257
a7ef3f7588c5
Type inference bug in Isar attributes "where" and "of" fixed.
ballarin
parents:
14255
diff
changeset

56 
* Attributes "where" and "of": 
14285
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset

57 
 Now take type variables of instantiated theorem into account when reading 
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset

58 
the instantiation string. This fixes a bug that caused instantiated 
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset

59 
theorems to have too special types in some circumstances. 
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset

60 
 "where" permits explicit instantiations of type variables. 
14257
a7ef3f7588c5
Type inference bug in Isar attributes "where" and "of" fixed.
ballarin
parents:
14255
diff
changeset

61 

14283  62 
* Calculation commands "moreover" and "also": 
63 
Do not reset facts ("this") any more. 

64 

14211
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

65 
* Locales: 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

66 
 Goal statements involving the context element "includes" no longer 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

67 
generate theorems with internal delta predicates (those ending on 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

68 
"_axioms") in the premise. 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

69 
Resolve particular premise with <locale>.intro to obtain old form. 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

70 
 Fixed bug in type inference ("unify_frozen") that prevented mix of target 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

71 
specification and "includes" elements in goal statement. 
14254
342634f38451
Isar/Locales: <loc>.intro and <loc>.axioms no longer intro? and elim? by
ballarin
parents:
14243
diff
changeset

72 
 Rule sets <locale>.intro and <locale>.axioms no longer declared as 
342634f38451
Isar/Locales: <loc>.intro and <loc>.axioms no longer intro? and elim? by
ballarin
parents:
14243
diff
changeset

73 
[intro?] and [elim?] (respectively) by default. 
14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

74 

dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

75 
* HOL: Tactic emulation methods induct_tac and case_tac understand static 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

76 
(Isar) contexts. 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

77 

14136  78 
*** HOL *** 
79 

14255  80 
* Records: 
81 
 Record types are now by default printed with their type abbreviation 

82 
instead of the list of all field types. This can be configured via 

83 
the reference "print_record_type_abbr". 

84 
 Simproc "record_upd_simproc" for simplification of multiple updates added 

85 
(not enabled by default). 

86 
 Tactic "record_split_simp_tac" to split and simplify records added. 

87 

14136  88 
* 'specification' command added, allowing for definition by 
14224  89 
specification. There is also an 'ax_specification' command that 
90 
introduces the new constants axiomatically. 

14136  91 

14375  92 

93 
* arith(_tac) is now able to generate counterexamples for reals as well. 

94 

14199  95 
* SETProtocol: formalization and verification of the SET protocol suite; 
96 

14243  97 
* HOLex: InductiveInvariant_examples illustrates advanced recursive function 
98 
defintions, thanks to Sava Krsti\'{c} and John Matthews. 

14136  99 

100 
New in Isabelle2003 (May 2003) 

101 
 

102 

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

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

104 

13618  105 
* Provers/simplifier: 
106 

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

110 
the order of assumptions. 

111 

112 
Potential INCOMPATIBILITY: 

113 

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

13618  116 

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

118 

13781  119 
now gives rise to the infinite reduction sequence 
120 

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

122 

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

124 
kind of problem. 

125 

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

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

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

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

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

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

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

13618  133 

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

135 

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

138 
conditions before applying the rewrite rule): 

139 
ML "simp_depth_limit := n" 

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

141 
the simplifier would diverge. 

142 

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

143 
 Accepts free variables as head terms in congruence rules. Useful in Isar. 
13829  144 

13938  145 
 No longer aborts on failed congruence proof. Instead, the 
146 
congruence is ignored. 

147 

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

150 
as HOL/Extraction for some case studies. 

151 

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

154 
PG menu: Isabelle/Isar > Settings > Show Main Goal 
13815  155 
(ML: Proof.show_main_goal). 
156 

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

158 
rules whose conclusion matches subgoal 1: 

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

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

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

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

163 
(ML: ProofGeneral.print_intros()) 

164 

165 
* Pure: New flag trace_unify_fail causes unification to print 

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

168 
assumption failed. 

169 

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

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

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

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

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

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

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

177 

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

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

179 
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

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

181 

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

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

183 
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

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

187 
be given (the default is 40); 

188 

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

190 
(batchmode only); 

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

191 

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

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

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

194 
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

195 

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

198 
for slight decrease in efficiency; 

199 

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

202 

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

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

204 
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

205 

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

206 

13158  207 
*** HOL *** 
208 

13899  209 
* arith(_tac) 
210 

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

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

213 
of quantifierfree linear arithmetic. 

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

215 

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

217 

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

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

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

221 

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

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

224 

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

226 
are distributed over a sum of terms; 

227 

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

230 
"<=", "<" and "="). 

231 

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

234 

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

237 

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

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

239 
Finite_Set); 
13492  240 

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

243 

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

246 

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

249 
of the empty set. 

250 

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

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

254 
Univariate Polynomials). Contributions welcome; 

13960  255 

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

257 

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

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

259 
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

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

261 

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

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

263 

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

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

265 
Fleuriot); 
13960  266 

13549  267 
* Real/HahnBanach: updated and adapted to locales; 
268 

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

13872  271 

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

273 

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

276 

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

279 
classes, interfaces, objects,virtual methods, static methods, 

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

281 
assignment, exceptions. 

13549  282 

14011  283 

13549  284 
*** ZF *** 
285 

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

287 
universe, etc.); 

288 

13872  289 
* Main ZF: virtually all theories converted to newstyle format; 
13518  290 

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

291 

13478  292 
*** ML *** 
293 

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

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

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

297 

298 
* Pure: improved error reporting of simprocs; 

299 

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

301 
up simprocs; 

302 

303 

13953  304 
*** Document preparation *** 
305 

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

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

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

309 

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

311 
other packages 

312 

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

314 
broke \Rightarrow) 

315 

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

13953  318 

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

319 

12984  320 
New in Isabelle2002 (March 2002) 
321 
 

11474  322 

11572  323 
*** Document preparation *** 
324 

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

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

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

327 
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

328 
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

329 
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

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

331 

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

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

333 
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

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

335 

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

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

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

338 

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

341 

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

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

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

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

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

350 
isatool document copies the Isabelle style files to the target 

351 
location; 

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

352 

11572  353 

11633  354 
*** Isar *** 
355 

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

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

359 
 'induct' method divinates rule instantiation from the inductive 

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

361 
instantiation of cases; 

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

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

364 
rules without further ado; 

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

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

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

368 
statement becomes is included in the hypothesis, avoiding the 

369 
slightly cumbersome show "PROP ?case" form; 

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

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

372 
rules stemming from inductive sets to be applied in unstructured 

373 
scripts, while still benefitting from proper handling of nonatomic 

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

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

376 
 'induct' proper support for mutual induction involving nonatomic 

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

378 
below); 

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

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

381 
 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

382 
 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

383 
 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

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

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

386 
 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

387 

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

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

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

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

391 
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

392 
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

393 
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

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

395 

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

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

397 

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

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

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

400 

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

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

402 
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

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

407 
some examples; 

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

408 

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

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

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

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

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

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

414 

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

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

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

419 
the context elements being discharged in the obvious way; 

420 

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

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

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

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

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

426 

11722  427 
* Pure: renamed "antecedent" case to "rule_context"; 
428 

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

431 
use hardwired "Trueprop"; 

432 

11738  433 
* Pure: added 'corollary' command; 
434 

11722  435 
* Pure: fixed 'token_translation' command; 
436 

11899  437 
* Pure: removed obsolete 'exported' attribute; 
438 

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

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

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

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

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

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

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

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

448 

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

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

450 
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

451 
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

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

453 

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

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

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

456 

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

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

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

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

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

461 

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

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

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

464 

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

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

466 
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

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

468 

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

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

470 
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

471 
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

472 

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

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

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

475 
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

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

477 
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

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

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

480 

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

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

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

483 

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

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

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

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

487 

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

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

489 

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

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

495 

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

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

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

498 

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

499 

11474  500 
*** HOL *** 
501 

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

504 

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

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

507 

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

509 
binary representation internally; 

510 

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

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

513 

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

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

515 
are some hints on converting existing sources: 
11702  516 

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

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

519 
to be spaced properly; 

520 

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

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

523 

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

525 

526 
 remove all special provisions on numerals in proofs; 

527 

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

12736  531 
* HOL: symbolic syntax for x^2 (numeral 2); 
532 

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

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

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

535 
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

536 
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

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

538 

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

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

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

543 
declared as simp by default; 

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

544 
 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

545 
qualified)  potential INCOMPATIBILITY; 
12280  546 
 removed "make_scheme" operations (use "make" with "extend")  
547 
INCOMPATIBILITY; 

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

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

554 

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

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

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

557 
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

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

559 

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

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

564 
String.thy has been absorbed into List.thy 

565 

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

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

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

568 

11657  569 
* HOL: linorder_less_split superseded by linorder_cases; 
570 

12917  571 
* HOL/List: "nodups" renamed to "distinct"; 
12889  572 

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

11437  576 

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

579 

580 
delSWrapper "split_all_tac" 

581 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

582 

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

11474  584 
MAY FAIL; 
11361  585 

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

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

589 
necessary to attach explicit type constraints; 

11307  590 

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

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

12489  594 

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

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

596 
expressions; 
11474  597 

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

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

599 
of "lam"  INCOMPATIBILITY; 
11474  600 

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

603 
renamed "Product_Type.unit"; 

11611  604 

12564  605 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
606 

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

609 

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

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

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

612 

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

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

614 
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

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

616 

12734  617 
* HOLReal: added Complex_Numbers (by Gertrud Bauer); 
618 

12690  619 
* HOLHyperreal is now a logic image; 
620 

11611  621 

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

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

623 

12622  624 
* Isar: consts/constdefs supports mixfix syntax for continuous 
625 
operations; 

626 

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

628 
HOLCF/ex/Dnat.thy; 

629 

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

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

633 

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

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

635 

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

636 

11474  637 
*** ZF *** 
638 

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

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

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

643 

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

645 
your theory on Main_ZFC; 

646 

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

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

12563  649 

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

652 

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

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

655 

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

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

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

659 

13025  660 
* ZF: many new theorems about lists, ordinals, etc.; 
12850  661 

11474  662 

663 
*** General *** 

664 

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

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

668 
also ref manual for further ML interfaces; 

669 

670 
* Pure/axclass: removed obsolete ML interface 

671 
goal_subclass/goal_arity; 

672 

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

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

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

676 
properly; 

677 

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

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

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

680 

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

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

682 
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

683 
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

684 
type variable); 
12280  685 

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

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

688 
"type_brackets"; 

689 

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

11817  691 
tokens into AST constants; 
11474  692 

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

695 
multiple declarations for same syntax element constant; 

696 

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

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

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

699 

12280  700 
* Provers/classical: renamed addaltern to addafter, addSaltern to 
701 
addSafter; 

702 

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

704 
as well; 

12253  705 

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

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

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

710 
support requires further installations, e.g. from 

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

712 

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

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

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

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

717 

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

720 

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

723 
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

724 

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

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

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

11551  730 

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

733 
isolatin characters may now be used; the related isatools 

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

735 

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

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

738 
terminal); 

739 

11314  740 

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

741 

11062  742 
New in Isabelle992 (February 2001) 
743 
 

744 

10224  745 
*** Overview of INCOMPATIBILITIES *** 
746 

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

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

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

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

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

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

755 

10998  756 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
757 
gfp_Tarski to gfp_unfold; 

10224  758 

10288  759 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
760 

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

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

10793  764 

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

767 

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

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

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

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

773 
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

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

775 

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

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

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

778 

10224  779 

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

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

781 

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

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

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

786 
typewriter); 

787 

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

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

789 
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

790 

10858  791 
* some more standard symbols; see Appendix A of the system manual for 
11062  792 
the complete list of symbols defined in isabellesym.sty; 
10858  793 

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

796 
definitions); 

797 

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

800 
actual humanreadable proof documents. Please do not include goal 

801 
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

802 

11062  803 
* proper indentation of antiquoted output with proportional LaTeX 
804 
fonts; 

10862  805 

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

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

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

808 

11062  809 
* isatool unsymbolize tunes sources for plain ASCII communication; 
810 

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

811 

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

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

813 

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

816 
documents, due to unpredictable outcome and noncompositional proof 

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

818 
for Prologstyle synthesis of proven results; 

819 

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

822 

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

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

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

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

827 

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

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

830 

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

832 
statements as well; 

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

833 

11097  834 
* Pure: more robust selection of calculational rules; 
835 

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

838 

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

840 
lemmas, using the graph browser tool; 

841 

10944  842 
* Pure: predict failure of "show" in interactive mode; 
843 

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

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

845 

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

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

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

848 

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

852 

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

855 
the result to be shown in each case; 

856 

10770  857 
* HOL: added 'recdef_tc' command; 
858 

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

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

860 

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

861 

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

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

863 

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

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

865 
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

866 
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

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

869 

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

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

873 

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

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

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

878 
literature; 

879 

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

883 

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

886 

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

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

888 
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

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

890 

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

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

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

893 

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

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

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

896 

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

899 
functions for the reals; 

10756  900 

11094  901 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  902 

10858  903 

10474  904 
*** CTT *** 
905 

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

10474  908 

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

911 

10474  912 

10391  913 
*** General *** 
914 

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

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

918 
the Isabelle inference kernel has been greatly improved; 

919 

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

922 

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

925 

11124  926 
* system: support Poly/ML 4.0; 
927 

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

929 

10391  930 

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

931 

10103  932 
New in Isabelle991 (October 2000) 
933 
 

8015  934 

10003  935 
*** Overview of INCOMPATIBILITIES *** 
8014  936 

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

939 
issue the following ML commands: 

940 

941 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

942 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  943 

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

10003  946 

947 
* HOL: nat_less_induct renamed to less_induct; 

948 

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

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

8967  951 

10003  952 
select_equality > some_equality 
953 
select_eq_Ex > some_eq_ex 

954 
selectI2EX > someI2_ex 

955 
selectI2 > someI2 

956 
selectI > someI 

957 
select1_equality > some1_equality 

958 
Eps_sym_eq > some_sym_eq_trivial 

959 
Eps_eq > some_eq_trivial 

960 

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

962 

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

964 
instead); 

965 

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

967 
f.simps instead of f.rules; 

968 

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

970 

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

972 
sometimes be needed; 

973 

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

8014  975 

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

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

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

979 
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

980 
now "<*lex*>" instead of "**"; 
8705  981 

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

9971  984 

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

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

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

987 

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

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

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

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

991 

8848  992 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
993 

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

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

995 
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

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

997 

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

9908  1000 

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

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

1003 

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

9542  1006 

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

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

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

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

1011 

9612  1012 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
1013 

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

1014 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  1015 

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

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

1018 

8014  1019 

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

1021 

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

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

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

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

1026 

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

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

1029 

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

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

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

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

1033 

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

8566  1037 

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

1039 

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

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

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

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

1043 

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

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

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

1047 

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

1048 

8184  1049 
*** Isar *** 
1050 

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

1053 
accommodates incremental typeinference very nicely; 

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

1054 

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

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

1057 

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

1060 
useful to collect intermediate results without explicit name 

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

1062 
premises; 

8184  1063 

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

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

1067 
to theorems as "tags"; 

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

1068 

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

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

1071 

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

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

1074 

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

1076 

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

1079 

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

1082 
with the version in Provers/classical; 

9612  1083 

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

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

1086 

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

1089 

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

9612  1092 

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

1094 
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

1095 
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

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

1097 

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

1100 

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

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

1103 
well (including splits); 

1104 

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

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

1107 

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

1109 
of Simplifier and Classical reasoner); 

1110 

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

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

1113 
recdef) support case names and properly name parameters; 

9612  1114 

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

1117 
calculations; 

1118 

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

1120 
method anyway; 

1121 

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

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

1124 
foo.split foo.split_asm for each datatype; 

1125 

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

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

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

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

1130 

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

1132 

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

1134 

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

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

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

1137 
proof states; 
8487  1138 

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

8487  1142 

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

1146 
(for HOL datatypes); 

8534  1147 

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

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

1151 

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

1153 

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

1156 
(print_commands, print_methods etc.); 

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

1157 

10003  1158 
* Isar: added 'nothing'  the empty list of theorems; 
9239  1159 

8184  1160 

8014  1161 
*** HOL *** 
1162 

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

1165 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

1169 

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

8014  1172 

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

1173 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  1174 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
1175 
Rasmussen; 

8570  1176 

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

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

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

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

1180 
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

1181 
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

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

1183 

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

9542  1186 

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

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

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

1189 

10003  1190 
* HOL/Lambda: converted into newstyle theory and document; 
9542  1191 

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

1194 
representation; very useful in avoiding lifting of operations; 

8848  1195 

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

1198 
well; admit "r" as field name; 

9542  1199 

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

1202 

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

1204 
Types nat and int belong to this axclass; 

1205 

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

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

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

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

8736  1213 

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

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

9835  1217 

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

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

1221 

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

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

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

8603  1227 

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

1230 
termination conditions are proved automatically, these simplification 

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

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

1233 
each equation; 

1234 

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

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

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

1237 
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

1238 
invariant proof rule for while is applied. 
9457  1239 

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

8925  1242 

8848  1243 
* HOL: theorems impI, allI, ballI bound as "strip"; 
1244 

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

1248 

10003  1249 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  1250 

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

8626  1253 

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

1256 

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

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

1260 
bogus); 

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

1261 

8412  1262 

9542  1263 
*** ZF *** 
1264 

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

9542  1267 

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

1270 
making the algebraic laws unconditional; 

9542  1271 

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

9542  1274 

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

9542  1277 

10003  1278 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
1279 
simplification; 

9388  1280 

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

9388  1283 

1284 

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

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

1286 

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

1289 

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

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

1292 

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

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

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

1295 

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

1298 
use instead the strong form, 

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

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

1301 
from destructrules; 

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

1302 

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

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

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

1305 

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

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

1307 

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

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

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

1310 

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

1313 
situations; 

1314 

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

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

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

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

1318 

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

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

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

1321 

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

1322 
* system: provide TAGS file for Isabelle sources; 
9052  1323 

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

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

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

1326 

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

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

1328 
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

1329 

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

1332 

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

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

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

1335 

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

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

1338 

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

1339 

8015  1340 

7986  1341 
New in Isabelle99 (October 1999) 
1342 
 

4649  1343 

5931  1344 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
1345 

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

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

7215  1349 

1350 
Delcongs [if_weak_cong]; 

6922  1351 

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

5931  1354 

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

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

1359 

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

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

1361 
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

1362 

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

6057  1365 

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

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

6141  1369 

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

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

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

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

1376 
mk_solver: string > (thm list > int > tactic) > solver 
7619  1377 
where the string argument is only a comment. 
6057  1378 

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

1379 

6069  1380 
*** Proof tools *** 
1381 

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

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

6069  1386 

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

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

1390 
matching. 

6069  1391 

7593  1392 

6014  1393 
*** General *** 
1394 

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

1398 
readable proof documents (Isar == Intelligible semiautomated 

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

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

1401 

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

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

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

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

7215  1407 

7252  1408 
* native support for Proof General, both for classic Isabelle and 
7986  1409 
Isabelle/Isar; 
7215
1379275df5cd
tuned;
wen&# 