author  paulson 
Tue, 23 Jul 2002 15:07:12 +0200  
changeset 13409  d4ea094c650e 
parent 13344  c8eb3fbf4c0c 
child 13410  f2cd09766864 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

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

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

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

6 

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

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

8 

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

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

10 
theorems; check validity of results wrt. current name space; include 
13284  11 
local facts of proof configuration (also covers active locales); an 
12 
optional limit for the number of printed facts may be given (the 

13 
default is 40); 

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

14 

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

15 

13158  16 
*** HOL *** 
17 

13344  18 
* attribute [symmetric] now works for relations as well. It turns 
19 
(x,y) : R^1 into (y,x) : R, and vice versa. 

20 

13190  21 
* arith(_tac) does now know about div k and mod k where k is a numeral of 
13344  22 
type nat or int. It can solve simple goals like 
23 
"0 < n ==> n div 2 < (n::nat)" 

13158  24 
but fails if divisibility plays a role like in 
25 
"n div 2 + (n+1) div 2 = (n::nat)". 

13188  26 
* simp's arithmetic capabilities have been enhanced a bit: 
27 
it now takes ~= in premises into account (by performing a case split). 

13158  28 

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

29 

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

30 

12984  31 
New in Isabelle2002 (March 2002) 
32 
 

11474  33 

11572  34 
*** Document preparation *** 
35 

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

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

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

38 
instructive isatool mkdir; users should basically be able to get 
12899
7d5b690253ee
"isatool usedir D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset

39 
started with "isatool mkdir HOL Test && isatool make"; alternatively, 
7d5b690253ee
"isatool usedir D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset

40 
users may run a separate document processing stage manually like this: 
7d5b690253ee
"isatool usedir D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset

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

42 

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

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

44 
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

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

46 

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

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

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

49 

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

52 

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

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

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

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

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

61 
isatool document copies the Isabelle style files to the target 

62 
location; 

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

63 

11572  64 

11633  65 
*** Isar *** 
66 

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

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

70 
 'induct' method divinates rule instantiation from the inductive 

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

72 
instantiation of cases; 

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

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

75 
rules without further ado; 

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

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

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

79 
statement becomes is included in the hypothesis, avoiding the 

80 
slightly cumbersome show "PROP ?case" form; 

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

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

83 
rules stemming from inductive sets to be applied in unstructured 

84 
scripts, while still benefitting from proper handling of nonatomic 

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

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

87 
 'induct' proper support for mutual induction involving nonatomic 

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

89 
below); 

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

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

92 
 removed obsolete "(simplified)" and "(stripped)" options of methods; 
12754
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset

93 
 undeclared rule case names default to numbers 1, 2, 3, ...; 
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset

94 
 added 'print_induct_rules' (covered by help item in recent Proof 
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset

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

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

97 
 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

98 

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

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

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

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

102 
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

103 
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

104 
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

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

106 

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

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

108 

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

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

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

111 

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

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

113 
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

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

118 
some examples; 

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

119 

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

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

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

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

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

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

125 

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

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

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

130 
the context elements being discharged in the obvious way; 

131 

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

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

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

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

136 
``from a and b have C using d and e <proof>''; 

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

137 

11722  138 
* Pure: renamed "antecedent" case to "rule_context"; 
139 

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

142 
use hardwired "Trueprop"; 

143 

11738  144 
* Pure: added 'corollary' command; 
145 

11722  146 
* Pure: fixed 'token_translation' command; 
147 

11899  148 
* Pure: removed obsolete 'exported' attribute; 
149 

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

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

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

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

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

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

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

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

159 

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

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

161 
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

162 
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

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

164 

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

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

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

167 

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

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

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

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

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

172 

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

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

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

175 

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

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

177 
text; the fixed correlation with particular command syntax has been 
b9635eb8a448
* Isar/Pure: marginal comments ``'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset

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

179 

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

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

181 
search in intuitionistic logic; a bit slower than 'blast' or 'fast', 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

182 
but often produces more compact proof terms with less detours; 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

183 

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

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

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

186 
declarations coincide with the pure ones; the "rule" method no longer 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

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

188 
longer pick rules from the context; also got rid of ML declarations 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

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

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

191 

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

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

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

194 

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

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

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

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

198 

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

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

200 

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

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

206 

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

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

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

209 

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

210 

11474  211 
*** HOL *** 
212 

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

215 

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

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

218 

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

220 
binary representation internally; 

221 

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

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

224 

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

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

226 
are some hints on converting existing sources: 
11702  227 

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

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

230 
to be spaced properly; 

231 

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

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

234 

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

236 

237 
 remove all special provisions on numerals in proofs; 

238 

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

12736  242 
* HOL: symbolic syntax for x^2 (numeral 2); 
243 

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

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

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

246 
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

247 
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

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

249 

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

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

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

254 
declared as simp by default; 

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

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

256 
qualified)  potential INCOMPATIBILITY; 
12280  257 
 removed "make_scheme" operations (use "make" with "extend")  
258 
INCOMPATIBILITY; 

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

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

265 

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

266 
* HOL: generic code generator for generating executable ML code from 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

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

268 
datatypes and sets, as well as recursive functions; can be invoked 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

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

270 

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

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

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

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

275 

11657  276 
* HOL: linorder_less_split superseded by linorder_cases; 
277 

12917  278 
* HOL/List: "nodups" renamed to "distinct"; 
12889  279 

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

11437  282 

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

285 

286 
delSWrapper "split_all_tac" 

287 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

288 

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

11474  290 
MAY FAIL; 
11361  291 

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

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

295 
necessary to attach explicit type constraints; 

11307  296 

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

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

12489  300 

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

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

302 
expressions; 
11474  303 

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

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

305 
of "lam"  INCOMPATIBILITY; 
11474  306 

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

309 
renamed "Product_Type.unit"; 

11611  310 

12564  311 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
312 

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

315 

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

316 
* HOL/GroupTheory: group theory examples including Sylow's theorem (by 
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

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

318 

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

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

320 
parts turned into readable document, with proper Isar proof texts and 
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

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

322 

12734  323 
* HOLReal: added Complex_Numbers (by Gertrud Bauer); 
324 

12690  325 
* HOLHyperreal is now a logic image; 
326 

11611  327 

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

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

329 

12622  330 
* Isar: consts/constdefs supports mixfix syntax for continuous 
331 
operations; 

332 

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

334 
HOLCF/ex/Dnat.thy; 

335 

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

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

339 

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

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

341 

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

342 

11474  343 
*** ZF *** 
344 

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

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

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

349 

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

351 
your theory on Main_ZFC; 

352 

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

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

12563  355 

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

358 

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

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

361 

12280  362 
* ZF/Induct: new directory for examples of inductive definitions, 
12608
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

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

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

365 

13025  366 
* ZF: many new theorems about lists, ordinals, etc.; 
12850  367 

11474  368 

369 
*** General *** 

370 

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

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

374 
also ref manual for further ML interfaces; 

375 

376 
* Pure/axclass: removed obsolete ML interface 

377 
goal_subclass/goal_arity; 

378 

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

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

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

382 
properly; 

383 

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

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

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

386 

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

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

388 
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

389 
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

390 
type variable); 
12280  391 

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

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

394 
"type_brackets"; 

395 

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

11817  397 
tokens into AST constants; 
11474  398 

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

401 
multiple declarations for same syntax element constant; 

402 

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

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

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

405 

12280  406 
* Provers/classical: renamed addaltern to addafter, addSaltern to 
407 
addSafter; 

408 

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

410 
as well; 

12253  411 

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

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

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

416 
support requires further installations, e.g. from 

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

418 

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

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

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

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

423 

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

426 

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

429 
logic images like this: ``isabelle q HOL Test''; 

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

430 

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

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

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

11551  436 

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

439 
isolatin characters may now be used; the related isatools 

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

441 

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

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

444 
terminal); 

445 

11314  446 

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

447 

11062  448 
New in Isabelle992 (February 2001) 
449 
 

450 

10224  451 
*** Overview of INCOMPATIBILITIES *** 
452 

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

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

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

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

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

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

461 

10998  462 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
463 
gfp_Tarski to gfp_unfold; 

10224  464 

10288  465 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
466 

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

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

10793  470 

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

473 

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

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

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

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

479 
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

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

481 

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

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

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

484 

10224  485 

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

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

487 

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

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

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

492 
typewriter); 

493 

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

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

495 
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

496 

10858  497 
* some more standard symbols; see Appendix A of the system manual for 
11062  498 
the complete list of symbols defined in isabellesym.sty; 
10858  499 

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

502 
definitions); 

503 

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

506 
actual humanreadable proof documents. Please do not include goal 

507 
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

508 

11062  509 
* proper indentation of antiquoted output with proportional LaTeX 
510 
fonts; 

10862  511 

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

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

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

514 

11062  515 
* isatool unsymbolize tunes sources for plain ASCII communication; 
516 

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

517 

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

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

519 

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

522 
documents, due to unpredictable outcome and noncompositional proof 

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

524 
for Prologstyle synthesis of proven results; 

525 

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

528 

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

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

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

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

533 

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

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

536 

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

538 
statements as well; 

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

539 

11097  540 
* Pure: more robust selection of calculational rules; 
541 

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

544 

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

546 
lemmas, using the graph browser tool; 

547 

10944  548 
* Pure: predict failure of "show" in interactive mode; 
549 

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

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

551 

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

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

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

554 

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

558 

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

561 
the result to be shown in each case; 

562 

10770  563 
* HOL: added 'recdef_tc' command; 
564 

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

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

566 

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

567 

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

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

569 

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

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

571 
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

572 
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

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

575 

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

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

579 

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

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

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

584 
literature; 

585 

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

589 

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

592 

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

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

594 
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

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

596 

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

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

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

599 

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

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

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

602 

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

605 
functions for the reals; 

10756  606 

11094  607 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  608 

10858  609 

10474  610 
*** CTT *** 
611 

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

10474  614 

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

617 

10474  618 

10391  619 
*** General *** 
620 

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

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

624 
the Isabelle inference kernel has been greatly improved; 

625 

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

628 

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

631 

11124  632 
* system: support Poly/ML 4.0; 
633 

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

635 

10391  636 

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

637 

10103  638 
New in Isabelle991 (October 2000) 
639 
 

8015  640 

10003  641 
*** Overview of INCOMPATIBILITIES *** 
8014  642 

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

645 
issue the following ML commands: 

646 

647 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

648 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  649 

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

10003  652 

653 
* HOL: nat_less_induct renamed to less_induct; 

654 

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

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

8967  657 

10003  658 
select_equality > some_equality 
659 
select_eq_Ex > some_eq_ex 

660 
selectI2EX > someI2_ex 

661 
selectI2 > someI2 

662 
selectI > someI 

663 
select1_equality > some1_equality 

664 
Eps_sym_eq > some_sym_eq_trivial 

665 
Eps_eq > some_eq_trivial 

666 

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

668 

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

670 
instead); 

671 

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

673 
f.simps instead of f.rules; 

674 

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

676 

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

678 
sometimes be needed; 

679 

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

8014  681 

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

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

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

685 
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

686 
now "<*lex*>" instead of "**"; 
8705  687 

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

9971  690 

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

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

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

693 

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

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

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

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

697 

8848  698 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
699 

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

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

701 
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

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

703 

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

9908  706 

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

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

709 

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

9542  712 

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

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

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

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

717 

9612  718 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
719 

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

720 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  721 

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

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

724 

8014  725 

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

727 

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

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

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

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

732 

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

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

735 

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

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

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

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

739 

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

8566  743 

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

745 

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

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

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

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

749 

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

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

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

753 

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

754 

8184  755 
*** Isar *** 
756 

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

759 
accommodates incremental typeinference very nicely; 

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

760 

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

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

763 

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

766 
useful to collect intermediate results without explicit name 

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

768 
premises; 

8184  769 

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

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

773 
to theorems as "tags"; 

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

774 

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

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

777 

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

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

780 

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

782 

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

785 

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

788 
with the version in Provers/classical; 

9612  789 

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

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

792 

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

795 

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

9612  798 

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

800 
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

801 
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

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

803 

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

806 

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

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

809 
well (including splits); 

810 

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

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

813 

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

815 
of Simplifier and Classical reasoner); 

816 

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

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

819 
recdef) support case names and properly name parameters; 

9612  820 

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

823 
calculations; 

824 

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

826 
method anyway; 

827 

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

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

830 
foo.split foo.split_asm for each datatype; 

831 

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

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

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

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

836 

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

838 

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

840 

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

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

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

843 
proof states; 
8487  844 

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

8487  848 

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

852 
(for HOL datatypes); 

8534  853 

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

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

857 

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

859 

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

862 
(print_commands, print_methods etc.); 

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

863 

10003  864 
* Isar: added 'nothing'  the empty list of theorems; 
9239  865 

8184  866 

8014  867 
*** HOL *** 
868 

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

871 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

875 

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

8014  878 

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

879 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  880 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
881 
Rasmussen; 

8570  882 

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

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

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

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

886 
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

887 
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

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

889 

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

9542  892 

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

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

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

895 

10003  896 
* HOL/Lambda: converted into newstyle theory and document; 
9542  897 

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

900 
representation; very useful in avoiding lifting of operations; 

8848  901 

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

904 
well; admit "r" as field name; 

9542  905 

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

908 

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

910 
Types nat and int belong to this axclass; 

911 

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

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

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

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

8736  919 

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

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

9835  923 

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

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

927 

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

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

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

8603  933 

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

936 
termination conditions are proved automatically, these simplification 

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

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

939 
each equation; 

940 

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

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

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

943 
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

944 
invariant proof rule for while is applied. 
9457  945 

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

8925  948 

8848  949 
* HOL: theorems impI, allI, ballI bound as "strip"; 
950 

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

954 

10003  955 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  956 

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

8626  959 

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

962 

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

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

966 
bogus); 

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

967 

8412  968 

9542  969 
*** ZF *** 
970 

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

9542  973 

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

976 
making the algebraic laws unconditional; 

9542  977 

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

9542  980 

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

9542  983 

10003  984 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
985 
simplification; 

9388  986 

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

9388  989 

990 

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

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

992 

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

995 

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

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

998 

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

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

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

1001 

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

1004 
use instead the strong form, 

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

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

1007 
from destructrules; 

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

1008 

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

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

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

1011 

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

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

1013 

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

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

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

1016 

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

1019 
situations; 

1020 

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

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

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

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

1024 

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

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

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

1027 

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

1028 
* system: provide TAGS file for Isabelle sources; 
9052  1029 

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

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

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

1032 

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

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

1034 
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

1035 

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

1038 

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

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

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

1041 

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

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

1044 

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

1045 

8015  1046 

7986  1047 
New in Isabelle99 (October 1999) 
1048 
 

4649  1049 

5931  1050 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
1051 

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

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

7215  1055 

1056 
Delcongs [if_weak_cong]; 

6922  1057 

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

5931  1060 

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

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

1065 

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

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

1067 
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

1068 

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

6057  1071 

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

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

6141  1075 

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

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

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

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

1082 
mk_solver: string > (thm list > int > tactic) > solver 
7619  1083 
where the string argument is only a comment. 
6057  1084 

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

1085 

6069  1086 
*** Proof tools *** 
1087 

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

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

6069  1092 

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

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

1096 
matching. 

6069  1097 

7593  1098 

6014  1099 
*** General *** 
1100 

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

1104 
readable proof documents (Isar == Intelligible semiautomated 

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

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

1107 

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

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

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

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

7215  1113 

7252  1114 
* native support for Proof General, both for classic Isabelle and 
7986  1115 
Isabelle/Isar; 
7215  1116 

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

1119 

6751  1120 
* Isabelle manuals now also available as PDF; 
1121 

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

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

6449  1127 

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

1130 

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

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

1133 

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

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

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

1137 

7215  1138 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
1139 

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

5973  1142 

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

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

1145 

6343  1146 
* new print_mode "HTML"; 
1147 

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

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

1150 

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

1153 

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

1155 
244c244 

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

1157 
 

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

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

1162 
 

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

1164 

7450  1165 
* function bind_thms stores lists of theorems (cf. bind_thm); 
1166 

7593  1167 
* new shorthand tactics ftac, eatac, datac, fatac; 
1168 

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

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

7593  1172 

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

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

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

1175 

6028  1176 

6057  1177 
*** HOL *** 
1178 

7215  1179 
** HOL arithmetic ** 
1180 

6343  1181 
* There are now decision procedures for linear arithmetic over nat and 
1182 
int: 

6131  1183 

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

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

1187 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  1192 

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

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

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

1197 
simplifier. 

6131  1198 

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

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

6028  1202 

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

1207 
type constraints; 

1208 

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

1210 
arguments; 

7157  1211 

7215  1212 
* many properties of integer multiplication, division and remainder 
1213 
are now available; 

6922  1214 

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

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

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

1219 
invocation of the underlying oracle). For SVC see 

7444  1220 
http://verify.stanford.edu/SVC 
6922  1221 

7125  1222 
* IsaMakefile: the HOLReal target now builds an actual image; 
1223 

7215  1224 

1225 
** HOL misc ** 

1226 

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

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

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

1229 

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

1232 

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

1235 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

1236 
changed syntax and (many) tactics; 

1237 

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

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

1241 
"mono" attribute); 

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

1242 

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

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

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

1245 

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

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

1247 

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

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

7326  1252 

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

1254 
Delsimprocs [record_simproc] 

1255 

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

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

1257 
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

1258 

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

1261 

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

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

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

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

6563  1266 

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

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

1270 

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

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

1272 
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

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

1274 

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

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

1276 
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

1277 

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

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

1279 
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

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

1281 

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

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

1286 

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

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

1288 
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

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

1290 

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

7492  1293 

7215  1294 

7113  1295 
*** LK *** 
1296 

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

7113  1299 

1300 
* the simplifier is now installed 

1301 

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

1302 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  1303 

1304 
* the classical reasoner now has a default rule database 

1305 

1306 

6064  1307 
*** ZF *** 
1308 

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

6269  1310 
directly (as in HOL) over datatypes and the natural numbers; 
6064  1311 

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

6064  1314 

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

1316 

6141  1317 
* simplification automatically does freeness reasoning for datatype 
6269  1318 
constructors; 
6141  1319 

6269  1320 
* automatic typeinference, with AddTCs command to insert new 
1321 
typechecking rules; 

6155  1322 

6269  1323 
* datatype introduction rules are now added as Safe Introduction rules 
1324 
to the claset; 

6155  1325 

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

1328 

6069  1329 

6343  1330 
*** Internal programming interfaces *** 
1331 

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

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

1333 

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

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

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

1336 

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

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

1338 

6343  1339 
* tuned current_goals_markers semantics: begin / end goal avoids 
1340 
printing empty lines; 

1341 

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

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

1344 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

1346 

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

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

1349 
mode to get Isabelle font glyphs as before; 

1350 

1351 
* refined token_translation interface; INCOMPATIBILITY: output length 

1352 
now of type real instead of int; 

1353 

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

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

1357 
opposed to intratheory data slots offered via TheoryDataFun; 

1358 

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

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

1360 
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

1361 
extra sort hypotheses that can be witnessed from the type signature; 
7986  1362 
the force_strip_shyps flag is gone, any remaining shyps are simply 
1363 
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

1364 

6343  1365 

6064  1366 

5781  1367 
New in Isabelle981 (October 1998) 
1368 
 

1369 

5127  1370 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  1371 

5726  1372 
* several changes of automated proof tools; 
5373  1373 

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

5214  1376 

5726  1377 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  1378 
called `inj_on'; 
5160  1379 

5275  1380 
* HOL: removed duplicate thms in Arith: 
1381 
less_imp_add_less should be replaced by trans_less_add1 

1382 
le_imp_add_le should be replaced by trans_le_add1 

5160  1383 

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

5490  1386 

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

1389 
now taken as an integer constant. 

5541  1390 

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

1392 

5363  1393 

5127  1394 
*** Proof tools *** 
4880  1395 

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

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

1397 
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

1398 
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

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

1400 
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

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

1402 
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

1403 
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

1404 
2. The simplifier now knows a little bit about natarithmetic. 
4880  1405 

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

1408 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

1411 
one (emitting a warning). 

4824  1412 
type wrapper = (int > tactic) > (int > tactic) 
4649  1413 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  1414 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 