author  wenzelm 
Sat, 01 Dec 2001 18:50:41 +0100  
changeset 12335  db4d5f498742 
parent 12312  f0f06950820d 
child 12364  108cdda23ab3 
permissions  rwrr 
11437  1 

5363  2 
Isabelle NEWS  history userrelevant changes 
3 
============================================== 

2553  4 

11474  5 
New in Isabelle2001 (?? 2001) 
6 
 

7 

11572  8 
*** Document preparation *** 
9 

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

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

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

12 
instructive isatool mkdir; users should basically be able to get 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

13 
started with "isatool mkdir Test && isatool make"; 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

14 

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

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

16 
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

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

18 

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

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

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

21 

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

24 

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

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

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

29 
note that these symbols are currently unavailable in Proof General / 
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset

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

31 

11572  32 

11633  33 
*** Isar *** 
34 

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

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

38 
 'induct' method divinates rule instantiation from the inductive 

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

40 
instantiation of cases; 

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

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

43 
rules without further ado; 

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

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

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

47 
statement becomes is included in the hypothesis, avoiding the 

48 
slightly cumbersome show "PROP ?case" form; 

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

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

51 
rules stemming from inductive sets to be applied in unstructured 

52 
scripts, while still benefitting from proper handling of nonatomic 

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

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

55 
 'induct' proper support for mutual induction involving nonatomic 

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

57 
below); 

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

58 
 removed obsolete "(simplified)" and "(stripped)" options of methods; 
4a622f5fb164
 'induct' may now use elimstyle induction rules without chaining
wenzelm
parents:
11986
diff
changeset

59 
 added 'print_induct_rules' (covered by help item in Proof General > 3.3); 
4a622f5fb164
 'induct' may now use elimstyle induction rules without chaining
wenzelm
parents:
11986
diff
changeset

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

61 
 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

62 

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

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

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

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

66 
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

67 
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

68 
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

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

70 

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

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

72 

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

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

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

75 

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

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

77 
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

78 
contexts rather than raw logical ones (e.g. we admit to include 
12280  79 
attributes everywhere); operations on locales include merge and 
80 
rename; e.g. see HOL/ex/Locales.thy; 

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

81 

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

82 
* Pure: theory goals now support adhoc contexts, which are discharged 
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset

83 
in the result, as in ``lemma (assumes A and B) K: A .''; syntax 
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset

84 
coincides with that of a locale body; 
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset

85 

11722  86 
* Pure: renamed "antecedent" case to "rule_context"; 
87 

11738  88 
* Pure: added 'corollary' command; 
89 

11722  90 
* Pure: fixed 'token_translation' command; 
91 

11899  92 
* Pure: removed obsolete 'exported' attribute; 
93 

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

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

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

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

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

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

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

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

103 

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

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

105 
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

106 
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

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

108 

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

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

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

111 

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

112 
* Provers: 'simplified' attribute may refer to explicit rules instead 
fef099613354
* Provers: 'simplified' attribute may refer to explicit rules instead
wenzelm
parents:
11933
diff
changeset

113 
of full simplifier context; 'iff' attribute handles conditional rules; 
fef099613354
* Provers: 'simplified' attribute may refer to explicit rules instead
wenzelm
parents:
11933
diff
changeset

114 

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

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

116 

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

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

122 

12280  123 
* HOLCF: domain package adapted to newstyle theories, e.g. see 
124 
HOLCF/ex/Dnat.thy; 

125 

126 
* ZF: proper integration of logicspecific tools and packages, 

127 
including theory commands '(co)inductive', '(co)datatype', 

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

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

130 

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

131 

11633  132 

11474  133 
*** HOL *** 
134 

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

137 

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

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

140 

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

142 
binary representation internally; 

143 

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

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

146 

147 
This change may cause significant INCOMPATIBILITIES; here are some 

148 
hints on converting existing sources: 

149 

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

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

152 
to be spaced properly; 

153 

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

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

156 

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

158 

159 
 remove all special provisions on numerals in proofs; 

160 

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

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

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

163 
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

164 
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

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

166 

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

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

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

171 
declared as simp by default; 

172 
 removed "make_scheme" operations (use "make" with "extend")  

173 
INCOMPATIBILITY; 

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

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

180 

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

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

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

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

185 

11657  186 
* HOL: linorder_less_split superseded by linorder_cases; 
187 

11633  188 
* HOL: added "The" definite description operator; move Hilbert's "Eps" 
189 
to peripheral theory "Hilbert_Choice"; 

11437  190 

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

193 

194 
delSWrapper "split_all_tac" 

195 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

196 

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

11474  198 
MAY FAIL; 
11361  199 

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

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

203 
necessary to attach explicit type constraints; 

11307  204 

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

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

206 
expressions; 
11474  207 

208 
* HOL/GroupTheory: group theory examples including Sylow's theorem, by 

12210
2f510d8d8291
* ZF: newstyle theory commands '(co)inductive', '(co)datatype',
wenzelm
parents:
12177
diff
changeset

209 
Florian Kammüller; 
11474  210 

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

213 
renamed "Product_Type.unit"; 

11611  214 

215 

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

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

217 

12280  218 
* proper rep_datatype lift (see theory Lift) instead of ML hacks  
219 
potential INCOMPATIBILITY; now use plain induct_tac instead of former 

220 
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

221 

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

222 

11474  223 
*** ZF *** 
224 

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

227 

228 
* ZF/Induct: new directory for examples of inductive definitions, 

229 
including theory Multiset for multiset orderings; 

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

230 

11474  231 
* ZF: the integer library now covers quotients and remainders, with 
232 
many laws relating division to addition, multiplication, etc.; 

233 

234 

235 
*** General *** 

236 

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

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

240 
also ref manual for further ML interfaces; 

241 

242 
* Pure/axclass: removed obsolete ML interface 

243 
goal_subclass/goal_arity; 

244 

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

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

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

248 
properly; 

249 

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

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

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

252 

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

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

254 
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

255 
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

256 
type variable); 
12280  257 

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

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

260 
"type_brackets"; 

261 

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

11817  263 
tokens into AST constants; 
11474  264 

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

267 
multiple declarations for same syntax element constant; 

268 

269 
* Provers/classical: renamed addaltern to addafter, addSaltern to 

270 
addSafter; 

271 

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

273 
as well; 

12253  274 

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

275 
* system: refrain from any attempt at filtering input streams; no 
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

276 
longer support ``8bit'' encoding of old isabelle font, instead proper 
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

277 
isolatin characters may now be used; 
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

278 

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

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

283 

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

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

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

11551  289 

11314  290 

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

291 

11062  292 
New in Isabelle992 (February 2001) 
293 
 

294 

10224  295 
*** Overview of INCOMPATIBILITIES *** 
296 

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

299 
bind them to ML identifers by e.g. val thm_name = thm "thm_name"; 

300 

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

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

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

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

305 

10998  306 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
307 
gfp_Tarski to gfp_unfold; 

10224  308 

10288  309 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
310 

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

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

10793  314 

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

317 

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

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

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

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

323 
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

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

325 

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

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

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

328 

10224  329 

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

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

331 

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

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

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

336 
typewriter); 

337 

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

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

339 
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

340 

10858  341 
* some more standard symbols; see Appendix A of the system manual for 
11062  342 
the complete list of symbols defined in isabellesym.sty; 
10858  343 

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

346 
definitions); 

347 

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

350 
actual humanreadable proof documents. Please do not include goal 

351 
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

352 

11062  353 
* proper indentation of antiquoted output with proportional LaTeX 
354 
fonts; 

10862  355 

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

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

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

358 

11062  359 
* isatool unsymbolize tunes sources for plain ASCII communication; 
360 

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

361 

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

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

363 

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

366 
documents, due to unpredictable outcome and noncompositional proof 

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

368 
for Prologstyle synthesis of proven results; 

369 

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

372 

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

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

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

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

377 

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

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

380 

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

382 
statements as well; 

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

383 

11097  384 
* Pure: more robust selection of calculational rules; 
385 

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

388 

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

390 
lemmas, using the graph browser tool; 

391 

10944  392 
* Pure: predict failure of "show" in interactive mode; 
393 

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

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

395 

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

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

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

398 

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

402 

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

405 
the result to be shown in each case; 

406 

10770  407 
* HOL: added 'recdef_tc' command; 
408 

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

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

410 

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

411 

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

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

413 

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

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

415 
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

416 
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

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

419 

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

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

423 

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

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

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

428 
literature; 

429 

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

433 

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

436 

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

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

438 
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

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

440 

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

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

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

443 

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

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

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

446 

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

449 
functions for the reals; 

10756  450 

11094  451 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  452 

10858  453 

10474  454 
*** CTT *** 
455 

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

10474  458 

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

461 

10474  462 

10391  463 
*** General *** 
464 

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

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

468 
the Isabelle inference kernel has been greatly improved; 

469 

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

472 

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

475 

11124  476 
* system: support Poly/ML 4.0; 
477 

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

479 

10391  480 

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

481 

10103  482 
New in Isabelle991 (October 2000) 
483 
 

8015  484 

10003  485 
*** Overview of INCOMPATIBILITIES *** 
8014  486 

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

489 
issue the following ML commands: 

490 

491 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

492 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  493 

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

10003  496 

497 
* HOL: nat_less_induct renamed to less_induct; 

498 

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

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

8967  501 

10003  502 
select_equality > some_equality 
503 
select_eq_Ex > some_eq_ex 

504 
selectI2EX > someI2_ex 

505 
selectI2 > someI2 

506 
selectI > someI 

507 
select1_equality > some1_equality 

508 
Eps_sym_eq > some_sym_eq_trivial 

509 
Eps_eq > some_eq_trivial 

510 

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

512 

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

514 
instead); 

515 

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

517 
f.simps instead of f.rules; 

518 

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

520 

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

522 
sometimes be needed; 

523 

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

8014  525 

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

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

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

529 
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

530 
now "<*lex*>" instead of "**"; 
8705  531 

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

9971  534 

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

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

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

537 

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

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

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

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

541 

8848  542 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
543 

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

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

545 
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

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

547 

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

9908  550 

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

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

553 

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

9542  556 

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

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

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

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

561 

9612  562 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
563 

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

564 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  565 

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

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

568 

8014  569 

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

571 

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

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

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

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

576 

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

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

579 

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

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

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

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

583 

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

8566  587 

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

589 

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

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

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

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

593 

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

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

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

597 

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

598 

8184  599 
*** Isar *** 
600 

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

603 
accommodates incremental typeinference very nicely; 

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

604 

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

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

607 

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

610 
useful to collect intermediate results without explicit name 

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

612 
premises; 

8184  613 

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

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

617 
to theorems as "tags"; 

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

618 

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

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

621 

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

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

624 

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

626 

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

629 

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

632 
with the version in Provers/classical; 

9612  633 

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

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

636 

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

639 

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

9612  642 

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

644 
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

645 
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

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

647 

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

650 

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

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

653 
well (including splits); 

654 

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

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

657 

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

659 
of Simplifier and Classical reasoner); 

660 

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

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

663 
recdef) support case names and properly name parameters; 

9612  664 

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

667 
calculations; 

668 

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

670 
method anyway; 

671 

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

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

674 
foo.split foo.split_asm for each datatype; 

675 

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

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

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

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

680 

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

682 

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

684 

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

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

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

687 
proof states; 
8487  688 

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

8487  692 

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

696 
(for HOL datatypes); 

8534  697 

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

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

701 

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

703 

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

706 
(print_commands, print_methods etc.); 

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

707 

10003  708 
* Isar: added 'nothing'  the empty list of theorems; 
9239  709 

8184  710 

8014  711 
*** HOL *** 
712 

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

715 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

719 

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

8014  722 

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

723 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  724 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
725 
Rasmussen; 

8570  726 

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

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

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

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

730 
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

731 
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

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

733 

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

9542  736 

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

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

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

739 

10003  740 
* HOL/Lambda: converted into newstyle theory and document; 
9542  741 

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

744 
representation; very useful in avoiding lifting of operations; 

8848  745 

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

748 
well; admit "r" as field name; 

9542  749 

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

752 

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

754 
Types nat and int belong to this axclass; 

755 

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

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

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

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

8736  763 

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

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

9835  767 

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

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

771 

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

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

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

8603  777 

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

780 
termination conditions are proved automatically, these simplification 

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

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

783 
each equation; 

784 

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

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

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

787 
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

788 
invariant proof rule for while is applied. 
9457  789 

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

8925  792 

8848  793 
* HOL: theorems impI, allI, ballI bound as "strip"; 
794 

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

798 

10003  799 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  800 

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

8626  803 

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

806 

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

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

810 
bogus); 

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

811 

8412  812 

9542  813 
*** ZF *** 
814 

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

9542  817 

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

820 
making the algebraic laws unconditional; 

9542  821 

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

9542  824 

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

9542  827 

10003  828 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
829 
simplification; 

9388  830 

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

9388  833 

834 

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

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

836 

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

839 

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

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

842 

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

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

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

845 

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

848 
use instead the strong form, 

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

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

851 
from destructrules; 

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

852 

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

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

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

855 

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

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

857 

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

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

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

860 

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

863 
situations; 

864 

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

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

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

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

868 

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

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

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

871 

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

872 
* system: provide TAGS file for Isabelle sources; 
9052  873 

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

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

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

876 

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

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

878 
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

879 

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

882 

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

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

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

885 

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

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

888 

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

889 

8015  890 

7986  891 
New in Isabelle99 (October 1999) 
892 
 

4649  893 

5931  894 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
895 

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

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

7215  899 

900 
Delcongs [if_weak_cong]; 

6922  901 

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

5931  904 

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

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

909 

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

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

911 
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

912 

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

6057  915 

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

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

6141  919 

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

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

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

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

926 
mk_solver: string > (thm list > int > tactic) > solver 
7619  927 
where the string argument is only a comment. 
6057  928 

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

929 

6069  930 
*** Proof tools *** 
931 

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

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

6069  936 

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

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

940 
matching. 

6069  941 

7593  942 

6014  943 
*** General *** 
944 

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

948 
readable proof documents (Isar == Intelligible semiautomated 

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

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

951 

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

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

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

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

7215  957 

7252  958 
* native support for Proof General, both for classic Isabelle and 
7986  959 
Isabelle/Isar; 
7215  960 

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

963 

6751  964 
* Isabelle manuals now also available as PDF; 
965 

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

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

6449  971 

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

974 

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

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

977 

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

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

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

981 

7215  982 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
983 

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

5973  986 

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

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

989 

6343  990 
* new print_mode "HTML"; 
991 

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

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

994 

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

997 

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

999 
244c244 

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

1001 
 

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

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

1006 
 

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

1008 

7450  1009 
* function bind_thms stores lists of theorems (cf. bind_thm); 
1010 

7593  1011 
* new shorthand tactics ftac, eatac, datac, fatac; 
1012 

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

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

7593  1016 

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

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

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

1019 

6028  1020 

6057  1021 
*** HOL *** 
1022 

7215  1023 
** HOL arithmetic ** 
1024 

6343  1025 
* There are now decision procedures for linear arithmetic over nat and 
1026 
int: 

6131  1027 

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

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

1031 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  1036 

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

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

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

1041 
simplifier. 

6131  1042 

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

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

6028  1046 

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

1051 
type constraints; 

1052 

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

1054 
arguments; 

7157  1055 

7215  1056 
* many properties of integer multiplication, division and remainder 
1057 
are now available; 

6922  1058 

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

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

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

1063 
invocation of the underlying oracle). For SVC see 

7444  1064 
http://verify.stanford.edu/SVC 
6922  1065 

7125  1066 
* IsaMakefile: the HOLReal target now builds an actual image; 
1067 

7215  1068 

1069 
** HOL misc ** 

1070 

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

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

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

1073 

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

1076 

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

1079 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

1080 
changed syntax and (many) tactics; 

1081 

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

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

1085 
"mono" attribute); 

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

1086 

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

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

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

1089 

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

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

1091 

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

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

7326  1096 

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

1098 
Delsimprocs [record_simproc] 

1099 

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

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

1101 
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

1102 

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

1105 

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

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

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

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

6563  1110 

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

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

1114 

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

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

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

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

1118 

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

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

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

1121 

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

1122 
* HOL basic syntax simplified (more orthogonal): all variants of 
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset

1123 
All/Ex now support plain / symbolic / HOL notation; plain syntax for 
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset

1124 
Eps operator is provided as well: "SOME x. P[x]"; 
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset

1125 

7320  1126 
* HOL/Sum.thy: sum_case has been moved to HOL/Datatype; 
7261  1127 

7280  1128 
* HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made 
1129 
thus available for user theories; 

1130 

7300
8439bf404c28
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with HOL/List;
wenzelm
parents:
7287
diff
changeset

1131 
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with 
8439bf404c28
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with HOL/List;
wenzelm
parents:
7287
diff
changeset

1132 
HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the 
8439bf404c28
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with HOL/List;
wenzelm
parents:
7287
diff
changeset

1133 
time; 
8439bf404c28
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with HOL/List;
wenzelm
parents:
7287
diff
changeset

1134 

7986  1135 
* HOL: new tactic smp_tac: int > int > tactic, which applies spec 
1136 
several times and then mp; 

7492  1137 

7215  1138 

7113  1139 
*** LK *** 
1140 

7215  1141 
* the notation <<...>> is now available as a notation for sequences of 
1142 
formulas; 

7113  1143 

1144 
* the simplifier is now installed 

1145 

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

1146 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  1147 

1148 
* the classical reasoner now has a default rule database 

1149 

1150 

6064  1151 
*** ZF *** 
1152 

1153 
* new primrec section allows primitive recursive functions to be given 

6269  1154 
directly (as in HOL) over datatypes and the natural numbers; 
6064  1155 

6269  1156 
* new tactics induct_tac and exhaust_tac for induction (or case 
1157 
analysis) over datatypes and the natural numbers; 

6064  1158 

1159 
* the datatype declaration of type T now defines the recursor T_rec; 

1160 

6141  1161 
* simplification automatically does freeness reasoning for datatype 
6269  1162 
constructors; 
6141  1163 

6269  1164 
* automatic typeinference, with AddTCs command to insert new 
1165 
typechecking rules; 

6155  1166 

6269  1167 
* datatype introduction rules are now added as Safe Introduction rules 
1168 
to the claset; 

6155  1169 

6269  1170 
* the syntax "if P then x else y" is now available in addition to 
1171 
if(P,x,y); 

1172 

6069  1173 

6343  1174 
*** Internal programming interfaces *** 
1175 

7919
35c18affc1d8
tuned simplifier trace output; new flag debug_simp
wenzelm
parents:
7886
diff
changeset

1176 
* tuned simplifier trace output; new flag debug_simp; 
35c18affc1d8
tuned simplifier trace output; new flag debug_simp
wenzelm
parents:
7886
diff
changeset

1177 

7420
cba45c114f3b
structures Vartab / Termtab (instances of TableFun);
wenzelm
parents:
7327
diff
changeset

1178 
* structures Vartab / Termtab (instances of TableFun) offer efficient 
cba45c114f3b
structures Vartab / Termtab (instances of TableFun);
wenzelm
parents:
7327
diff
changeset

1179 
tables indexed by indexname_ord / term_ord (compatible with aconv); 
cba45c114f3b
structures Vartab / Termtab (instances of TableFun);
wenzelm
parents:
7327
diff
changeset

1180 

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

1181 
* AxClass.axclass_tac lost the theory argument; 
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset

1182 

6343  1183 
* tuned current_goals_markers semantics: begin / end goal avoids 
1184 
printing empty lines; 

1185 

1186 
* removed prs and prs_fn hook, which was broken because it did not 

1187 
include \n in its semantics, forcing writeln to add one 

1188 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

1189 
string > unit if you really want to output text without newline; 

1190 

1191 
* Symbol.output subject to print mode; INCOMPATIBILITY: defaults to 

1192 
plain output, interface builders may have to enable 'isabelle_font' 

1193 
mode to get Isabelle font glyphs as before; 

1194 

1195 
* refined token_translation interface; INCOMPATIBILITY: output length 

1196 
now of type real instead of int; 

1197 

7196  1198 
* theory loader actions may be traced via new ThyInfo.add_hook 
1199 
interface (see src/Pure/Thy/thy_info.ML); example application: keep 

1200 
your own database of information attached to *whole* theories  as 

1201 
opposed to intratheory data slots offered via TheoryDataFun; 

1202 

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

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

1204 
Thm.strip_shyps and Drule.strip_shyps_warning take care of removing 
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset

1205 
extra sort hypotheses that can be witnessed from the type signature; 
7986  1206 
the force_strip_shyps flag is gone, any remaining shyps are simply 
1207 
left in the theorem (with a warning issued by strip_shyps_warning); 

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

1208 

6343  1209 

6064  1210 

5781  1211 
New in Isabelle981 (October 1998) 
1212 
 

1213 

5127  1214 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  1215 

5726  1216 
* several changes of automated proof tools; 
5373  1217 

5726  1218 
* HOL: major changes to the inductive and datatype packages, including 
1219 
some minor incompatibilities of theory syntax; 

5214  1220 

5726  1221 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  1222 
called `inj_on'; 
5160  1223 

5275  1224 
* HOL: removed duplicate thms in Arith: 
1225 
less_imp_add_less should be replaced by trans_less_add1 

1226 
le_imp_add_le should be replaced by trans_le_add1 

5160  1227 

5726  1228 
* HOL: unary minus is now overloaded (new type constraints may be 
1229 
required); 

5490  1230 

5726  1231 
* HOL and ZF: unary minus for integers is now # instead of #~. In 
1232 
ZF, expressions such as n#1 must be changed to n# 1, since #1 is 

1233 
now taken as an integer constant. 

5541  1234 

5726  1235 
* Pure: ML function 'theory_of' renamed to 'theory'; 
5397
034ed25535b9
* Pure: ML function 'theory_of' replaced by 'theory';
wenzelm
parents:
5373
diff
changeset

1236 

5363  1237 

5127  1238 
*** Proof tools *** 
4880  1239 

5657
1a6c9c6a3f8e
2. The simplifier now knows a little bit about natarithmetic.
nipkow
parents:
5651
diff
changeset

1240 
* Simplifier: 
1a6c9c6a3f8e
2. The simplifier now knows a little bit about natarithmetic.
nipkow
parents:
5651
diff
changeset

1241 
1. Asm_full_simp_tac is now more aggressive. 
1a6c9c6a3f8e
2. The simplifier now knows a little bit about natarithmetic.
nipkow
parents:
5651
diff
changeset

1242 
1. It will sometimes reorient premises if that increases their power to 
1a6c9c6a3f8e
2. The simplifier now knows a little bit about natarithmetic.
nipkow
parents:
5651
diff
changeset

1243 
simplify. 
1a6c9c6a3f8e
2. The simplifier now knows a little bit about natarithmetic.
nipkow
parents:
5651
diff
changeset

1244 
2. It does no longer proceed strictly from left to right but may also 
1a6c9c6a3f8e
2. The simplifier now knows a little bit about natarithmetic.
nipkow
parents:
5651
diff
changeset

1245 
rotate premises to achieve further simplification. 
1a6c9c6a3f8e
2. The simplifier now knows a little bit about natarithmetic.
nipkow
parents:
5651
diff
changeset

1246 
For compatibility reasons there is now Asm_lr_simp_tac which is like the 
1a6c9c6a3f8e
2. The simplifier now knows a little bit about natarithmetic.
nipkow
parents:
5651
diff
changeset

1247 
old Asm_full_simp_tac in that it does not rotate premises. 
1a6c9c6a3f8e
2. The simplifier now knows a little bit about natarithmetic.
nipkow
parents:
5651
diff
changeset

1248 
2. The simplifier now knows a little bit about natarithmetic. 
4880  1249 

5127  1250 
* Classical reasoner: wrapper mechanism for the classical reasoner now 
1251 
allows for selected deletion of wrappers, by introduction of names for 

1252 
wrapper functionals. This implies that addbefore, addSbefore, 

1253 
addaltern, and addSaltern now take a pair (name, tactic) as argument, 

1254 
and that adding two tactics with the same name overwrites the first 

1255 
one (emitting a warning). 

4824  1256 
type wrapper = (int > tactic) > (int > tactic) 
4649  1257 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  1258 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
1259 
delWrapper, delSWrapper: claset * string > claset 

4649  1260 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
1261 

5705
56f2030c46c6
tuned (all proofs are INSTABLE by David's definition of instability);
wenzelm
parents:
5671
diff
changeset

1262 
* Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE 
5726  1263 
semantics; addbefore now affects only the unsafe part of step_tac 
1264 
etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY 

1265 
FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac 

1266 
by Force_tac; 

5524  1267 

5726  1268 
* Classical reasoner: setwrapper to setWrapper and compwrapper to 
1269 
compWrapper; added safe wrapper (and access functions for it); 

5524  1270 

5127  1271 
* HOL/split_all_tac is now much faster and fails if there is nothing 
5726  1272 
to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order 
1273 
and the names of the automatically generated variables have changed. 

1274 
split_all_tac has moved within claset() from unsafe wrappers to safe 

1275 
wrappers, which means that !!bound variables are split much more 

1276 
aggressively, and safe_tac and clarify_tac now split such variables. 

1277 
If this splitting is not appropriate, use delSWrapper "split_all_tac". 

1278 
Note: the same holds for record_split_tac, which does the job of 

1279 
split_all_tac for record fields. 

5127  1280 

5726  1281 
* HOL/Simplifier: Rewrite rules for case distinctions can now be added 
1282 
permanently to the default simpset using Addsplits just like 

1283 
Addsimps. They can be removed via Delsplits just like 

1284 
Delsimps. Lowercase versions are also available. 

5127  1285 

5726  1286 
* HOL/Simplifier: The rule split_if is now part of the default 
1287 
simpset. This means that the simplifier will eliminate all occurrences 

1288 
of ifthenelse in the conclusion of a goal. To prevent this, you can 

1289 
either remove split_if completely from the default simpset by 

1290 
`Delsplits [split_if]' or remove it in a specific call of the 

1291 
simplifier using `... delsplits [split_if]'. You can also add/delete 

1292 
other case splitting rules to/from the default simpset: every datatype 

1293 
generates suitable rules `split_t_case' and `split_t_case_asm' (where 

1294 
t is the name of the datatype). 

5127  1295 

5726  1296 
* Classical reasoner / Simplifier combination: new force_tac (and 
5127  1297 
derivatives Force_tac, force) combines rewriting and classical 
1298 
reasoning (and whatever other tools) similarly to auto_tac, but is 

5726  1299 
aimed to solve the given subgoal completely. 
5127  1300 

1301 

1302 
*** General *** 

1303 

5217  1304 
* new toplevel commands `Goal' and `Goalw' that improve upon `goal' 
5127  1305 
and `goalw': the theory is no longer needed as an explicit argument  
1306 
the current theory context is used; assumptions are no longer returned 

1307 
at the MLlevel unless one of them starts with ==> or !!; it is 

5217  1308 
recommended to convert to these new commands using isatool fixgoal 
1309 
(backup your sources first!); 

4842  1310 

5217  1311 
* new toplevel commands 'thm' and 'thms' for retrieving theorems from 
5207  1312 
the current theory context, and 'theory' to lookup stored theories; 
4806  1313 

5722  1314 
* new theory section 'locale' for declaring constants, assumptions and 
1315 
definitions that have local scope; 

1316 

5127  1317 
* new theory section 'nonterminals' for purely syntactic types; 
4858  1318 

5127  1319 
* new theory section 'setup' for generic ML setup functions 
1320 
(e.g. package initialization); 

4869  1321 

5131  1322 
* the distribution now includes Isabelle icons: see 
1323 
lib/logo/isabelle{small,tiny}.xpm; 

1324 

5363  1325 
* isatool install  install binaries with absolute references to 
1326 
ISABELLE_HOME/bin; 

1327 

5572  1328 
* isatool logo  create instances of the Isabelle logo (as EPS); 
1329 

5407  1330 
* print mode 'emacs' reserved for Isamode; 
1331 

5726  1332 
* support multiple print (ast) translations per constant name; 
1333 

6925
8d4d45ec6a3d
theorems involving oracles are now printed with a suffixed [!];
wenzelm
parents:
6922
diff
changeset

1334 
* theorems involving oracles are now printed with a suffixed [!]; 
8d4d45ec6a3d
theorems involving oracles are now printed with a suffixed [!];
wenzelm
parents:
6922
diff
changeset

1335 

4711  1336 

4661  1337 
*** HOL *** 
1338 

5710  1339 
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial'); 
5709  1340 

5217  1341 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  1342 
definitions such as 
5217  1343 

1344 
inductive EVEN ODD 

1345 
intrs 

1346 
null "0 : EVEN" 

1347 
oddI "n : EVEN ==> Suc n : ODD" 

1348 
evenI "n : ODD ==> Suc n : EVEN" 

1349 

1350 
new theorem list "elims" contains an elimination rule for each of the 

1351 
recursive sets; inductive definitions now handle disjunctive premises 

1352 
correctly (also ZF); 

5214  1353 

5217  1354 
INCOMPATIBILITIES: requires Inductive as an ancestor; component 
1355 
"mutual_induct" no longer exists  the induction rule is always 

1356 
contained in "induct"; 

1357 

1358 

1359 
* HOL/datatype package reimplemented and greatly improved: now 

5267  1360 
supports mutually recursive datatypes such as 
5217  1361 

1362 
datatype 

1363 
'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp) 

1364 
 SUM ('a aexp) ('a aexp) 

1365 
 DIFF ('a aexp) ('a aexp) 

1366 
 NUM 'a 

1367 
and 

1368 
'a bexp = LESS ('a aexp) ('a aexp) 

1369 
 AND ('a bexp) ('a bexp) 

1370 
 OR ('a bexp) ('a bexp) 

1371 

5267  1372 
as well as indirectly recursive datatypes such as 
5214  1373 

5217  1374 
datatype 
1375 
('a, 'b) term = Var 'a 

1376 
 App 'b ((('a, 'b) term) list) 

5214  1377 

5217  1378 
The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs 
1379 
induction on mutually / indirectly recursive datatypes. 

1380 

1381 
Primrec equations are now stored in theory and can be accessed via 

1382 
<function_name>.simps. 

1383 

1384 
INCOMPATIBILITIES: 

5214  1385 

5217  1386 
 Theories using datatypes must now have theory Datatype as an 
1387 
ancestor. 

1388 
 The specific <typename>.induct_tac no longer exists  use the 

1389 
generic induct_tac instead. 

5226  1390 
 natE has been renamed to nat.exhaust  use exhaust_tac 
5217  1391 
instead of res_inst_tac ... natE. Note that the variable 
5226  1392 
names in nat.exhaust differ from the names in natE, this 
5217  1393 
may cause some "fragile" proofs to fail. 
1394 
 The theorems split_<typename>_case and split_<typename>_case_asm 

1395 
have been renamed to <typename>.split and <typename>.split_asm. 

1396 
 Since default sorts of type variables are now handled correctly, 

1397 
some datatype definitions may have to be annotated with explicit 

1398 
sort constraints. 

1399 
 Primrec definitions no longer require function name and type 

1400 
of recursive argument. 

5214  1401 

5217  1402 
Consider using isatool fixdatatype to adapt your theories and proof 
1403 
scripts to the new package (backup your sources first!). 

1404 

1405 

5726  1406 
* HOL/record package: considerably improved implementation; now 
1407 
includes concrete syntax for record types, terms, updates; theorems 

1408 
for surjective pairing and splitting !!bound record variables; proof 

1409 
support is as follows: 

1410 

1411 
1) standard conversions (selectors or updates applied to record 

1412 
constructor terms) are part of the standard simpset; 

1413 

1414 
2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are 

1415 
made part of standard simpset and claset via addIffs; 

1416 

1417 
3) a tactic for record field splitting (record_split_tac) is part of 

1418 
the standard claset (addSWrapper); 

1419 

1420 
To get a better idea about these rules you may retrieve them via 

1421 
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is 

1422 
the name of your record type. 