author  wenzelm 
Wed, 24 Jul 2002 00:08:52 +0200  
changeset 13410  f2cd09766864 
parent 13344  c8eb3fbf4c0c 
child 13425  119ae829ad9b 
permissions  rwrr 
13410
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

1 

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

2553  4 

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

5 
New in this Isabelle release 
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 

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

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

9 

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

10 
* Pure: locale specifications now produce predicate definitions 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

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

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

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

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

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

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

17 

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

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

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

22 
default is 40); 

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

23 

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

24 

13158  25 
*** HOL *** 
26 

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

29 

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

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

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

13158  37 

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

38 

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

39 

12984  40 
New in Isabelle2002 (March 2002) 
41 
 

11474  42 

11572  43 
*** Document preparation *** 
44 

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

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

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

47 
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

48 
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

49 
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

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

51 

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

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

53 
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

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

55 

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

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

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

58 

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

61 

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

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

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

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

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

70 
isatool document copies the Isabelle style files to the target 

71 
location; 

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

72 

11572  73 

11633  74 
*** Isar *** 
75 

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

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

79 
 'induct' method divinates rule instantiation from the inductive 

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

81 
instantiation of cases; 

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

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

84 
rules without further ado; 

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

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

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

88 
statement becomes is included in the hypothesis, avoiding the 

89 
slightly cumbersome show "PROP ?case" form; 

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

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

92 
rules stemming from inductive sets to be applied in unstructured 

93 
scripts, while still benefitting from proper handling of nonatomic 

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

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

96 
 'induct' proper support for mutual induction involving nonatomic 

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

98 
below); 

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

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

101 
 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

102 
 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

103 
 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

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

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

106 
 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

107 

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

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

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

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

111 
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

112 
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

113 
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

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

115 

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

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

117 

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

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

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

120 

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

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

122 
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

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

127 
some examples; 

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

128 

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

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

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

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

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

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

134 

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

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

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

139 
the context elements being discharged in the obvious way; 

140 

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

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

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

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

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

146 

11722  147 
* Pure: renamed "antecedent" case to "rule_context"; 
148 

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

151 
use hardwired "Trueprop"; 

152 

11738  153 
* Pure: added 'corollary' command; 
154 

11722  155 
* Pure: fixed 'token_translation' command; 
156 

11899  157 
* Pure: removed obsolete 'exported' attribute; 
158 

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

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

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

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

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

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

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

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

168 

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

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

170 
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

171 
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

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

173 

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

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

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

176 

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

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

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

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

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

181 

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

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

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

184 

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

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

186 
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

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

188 

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

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

190 
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

191 
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

192 

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

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

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

195 
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

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

197 
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

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

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

200 

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

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

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

203 

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

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

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

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

207 

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

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

209 

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

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

215 

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

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

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

218 

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

219 

11474  220 
*** HOL *** 
221 

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

224 

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

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

227 

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

229 
binary representation internally; 

230 

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

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

233 

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

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

235 
are some hints on converting existing sources: 
11702  236 

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

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

239 
to be spaced properly; 

240 

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

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

243 

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

245 

246 
 remove all special provisions on numerals in proofs; 

247 

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

12736  251 
* HOL: symbolic syntax for x^2 (numeral 2); 
252 

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

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

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

255 
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

256 
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

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

258 

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

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

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

263 
declared as simp by default; 

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

264 
 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

265 
qualified)  potential INCOMPATIBILITY; 
12280  266 
 removed "make_scheme" operations (use "make" with "extend")  
267 
INCOMPATIBILITY; 

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

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

274 

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

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

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

277 
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

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

279 

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

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

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

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

284 

11657  285 
* HOL: linorder_less_split superseded by linorder_cases; 
286 

12917  287 
* HOL/List: "nodups" renamed to "distinct"; 
12889  288 

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

11437  291 

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

294 

295 
delSWrapper "split_all_tac" 

296 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

297 

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

11474  299 
MAY FAIL; 
11361  300 

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

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

304 
necessary to attach explicit type constraints; 

11307  305 

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

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

12489  309 

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

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

311 
expressions; 
11474  312 

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

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

314 
of "lam"  INCOMPATIBILITY; 
11474  315 

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

318 
renamed "Product_Type.unit"; 

11611  319 

12564  320 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
321 

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

324 

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

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

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

327 

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

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

329 
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

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

331 

12734  332 
* HOLReal: added Complex_Numbers (by Gertrud Bauer); 
333 

12690  334 
* HOLHyperreal is now a logic image; 
335 

11611  336 

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

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

338 

12622  339 
* Isar: consts/constdefs supports mixfix syntax for continuous 
340 
operations; 

341 

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

343 
HOLCF/ex/Dnat.thy; 

344 

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

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

348 

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

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

350 

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

351 

11474  352 
*** ZF *** 
353 

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

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

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

358 

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

360 
your theory on Main_ZFC; 

361 

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

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

12563  364 

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

367 

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

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

370 

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

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

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

374 

13025  375 
* ZF: many new theorems about lists, ordinals, etc.; 
12850  376 

11474  377 

378 
*** General *** 

379 

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

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

383 
also ref manual for further ML interfaces; 

384 

385 
* Pure/axclass: removed obsolete ML interface 

386 
goal_subclass/goal_arity; 

387 

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

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

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

391 
properly; 

392 

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

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

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

395 

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

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

397 
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

398 
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

399 
type variable); 
12280  400 

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

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

403 
"type_brackets"; 

404 

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

11817  406 
tokens into AST constants; 
11474  407 

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

410 
multiple declarations for same syntax element constant; 

411 

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

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

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

414 

12280  415 
* Provers/classical: renamed addaltern to addafter, addSaltern to 
416 
addSafter; 

417 

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

419 
as well; 

12253  420 

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

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

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

425 
support requires further installations, e.g. from 

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

427 

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

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

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

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

432 

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

435 

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

438 
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

439 

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

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

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

11551  445 

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

448 
isolatin characters may now be used; the related isatools 

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

450 

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

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

453 
terminal); 

454 

11314  455 

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

456 

11062  457 
New in Isabelle992 (February 2001) 
458 
 

459 

10224  460 
*** Overview of INCOMPATIBILITIES *** 
461 

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

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

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

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

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

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

470 

10998  471 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
472 
gfp_Tarski to gfp_unfold; 

10224  473 

10288  474 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
475 

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

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

10793  479 

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

482 

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

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

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

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

488 
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

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

490 

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

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

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

493 

10224  494 

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

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

496 

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

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

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

501 
typewriter); 

502 

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

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

504 
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

505 

10858  506 
* some more standard symbols; see Appendix A of the system manual for 
11062  507 
the complete list of symbols defined in isabellesym.sty; 
10858  508 

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

511 
definitions); 

512 

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

515 
actual humanreadable proof documents. Please do not include goal 

516 
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

517 

11062  518 
* proper indentation of antiquoted output with proportional LaTeX 
519 
fonts; 

10862  520 

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

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

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

523 

11062  524 
* isatool unsymbolize tunes sources for plain ASCII communication; 
525 

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

526 

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

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

528 

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

531 
documents, due to unpredictable outcome and noncompositional proof 

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

533 
for Prologstyle synthesis of proven results; 

534 

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

537 

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

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

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

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

542 

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

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

545 

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

547 
statements as well; 

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

548 

11097  549 
* Pure: more robust selection of calculational rules; 
550 

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

553 

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

555 
lemmas, using the graph browser tool; 

556 

10944  557 
* Pure: predict failure of "show" in interactive mode; 
558 

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

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

560 

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

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

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

563 

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

567 

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

570 
the result to be shown in each case; 

571 

10770  572 
* HOL: added 'recdef_tc' command; 
573 

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

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

575 

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

576 

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

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

578 

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

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

580 
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

581 
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

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

584 

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

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

588 

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

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

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

593 
literature; 

594 

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

598 

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

601 

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

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

603 
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

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

605 

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

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

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

608 

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

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

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

611 

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

614 
functions for the reals; 

10756  615 

11094  616 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  617 

10858  618 

10474  619 
*** CTT *** 
620 

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

10474  623 

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

626 

10474  627 

10391  628 
*** General *** 
629 

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

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

633 
the Isabelle inference kernel has been greatly improved; 

634 

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

637 

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

640 

11124  641 
* system: support Poly/ML 4.0; 
642 

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

644 

10391  645 

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

646 

10103  647 
New in Isabelle991 (October 2000) 
648 
 

8015  649 

10003  650 
*** Overview of INCOMPATIBILITIES *** 
8014  651 

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

654 
issue the following ML commands: 

655 

656 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

657 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  658 

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

10003  661 

662 
* HOL: nat_less_induct renamed to less_induct; 

663 

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

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

8967  666 

10003  667 
select_equality > some_equality 
668 
select_eq_Ex > some_eq_ex 

669 
selectI2EX > someI2_ex 

670 
selectI2 > someI2 

671 
selectI > someI 

672 
select1_equality > some1_equality 

673 
Eps_sym_eq > some_sym_eq_trivial 

674 
Eps_eq > some_eq_trivial 

675 

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

677 

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

679 
instead); 

680 

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

682 
f.simps instead of f.rules; 

683 

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

685 

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

687 
sometimes be needed; 

688 

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

8014  690 

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

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

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

694 
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

695 
now "<*lex*>" instead of "**"; 
8705  696 

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

9971  699 

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

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

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

702 

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

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

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

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

706 

8848  707 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
708 

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

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

710 
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

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

712 

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

9908  715 

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

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

718 

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

9542  721 

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

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

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

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

726 

9612  727 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
728 

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

729 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  730 

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

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

733 

8014  734 

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

736 

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

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

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

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

741 

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

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

744 

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

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

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

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

748 

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

8566  752 

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

754 

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

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

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

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

758 

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

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

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

762 

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

763 

8184  764 
*** Isar *** 
765 

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

768 
accommodates incremental typeinference very nicely; 

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

769 

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

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

772 

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

775 
useful to collect intermediate results without explicit name 

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

777 
premises; 

8184  778 

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

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

782 
to theorems as "tags"; 

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

783 

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

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

786 

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

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

789 

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

791 

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

794 

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

797 
with the version in Provers/classical; 

9612  798 

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

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

801 

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

804 

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

9612  807 

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

809 
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

810 
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

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

812 

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

815 

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

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

818 
well (including splits); 

819 

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

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

822 

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

824 
of Simplifier and Classical reasoner); 

825 

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

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

828 
recdef) support case names and properly name parameters; 

9612  829 

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

832 
calculations; 

833 

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

835 
method anyway; 

836 

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

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

839 
foo.split foo.split_asm for each datatype; 

840 

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

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

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

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

845 

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

847 

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

849 

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

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

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

852 
proof states; 
8487  853 

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

8487  857 

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

861 
(for HOL datatypes); 

8534  862 

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

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

866 

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

868 

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

871 
(print_commands, print_methods etc.); 

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

872 

10003  873 
* Isar: added 'nothing'  the empty list of theorems; 
9239  874 

8184  875 

8014  876 
*** HOL *** 
877 

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

880 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

884 

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

8014  887 

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

888 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  889 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
890 
Rasmussen; 

8570  891 

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

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

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

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

895 
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

896 
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

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

898 

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

9542  901 

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

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

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

904 

10003  905 
* HOL/Lambda: converted into newstyle theory and document; 
9542  906 

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

909 
representation; very useful in avoiding lifting of operations; 

8848  910 

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

913 
well; admit "r" as field name; 

9542  914 

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

917 

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

919 
Types nat and int belong to this axclass; 

920 

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

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

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

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

8736  928 

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

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

9835  932 

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

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

936 

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

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

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

8603  942 

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

945 
termination conditions are proved automatically, these simplification 

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

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

948 
each equation; 

949 

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

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

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

952 
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

953 
invariant proof rule for while is applied. 
9457  954 

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

8925  957 

8848  958 
* HOL: theorems impI, allI, ballI bound as "strip"; 
959 

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

963 

10003  964 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  965 

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

8626  968 

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

971 

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

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

975 
bogus); 

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

976 

8412  977 

9542  978 
*** ZF *** 
979 

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

9542  982 

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

985 
making the algebraic laws unconditional; 

9542  986 

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

9542  989 

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

9542  992 

10003  993 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
994 
simplification; 

9388  995 

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

9388  998 

999 

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

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

1001 

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

1004 

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

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

1007 

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

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

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

1010 

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

1013 
use instead the strong form, 

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

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

1016 
from destructrules; 

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

1017 

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

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

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

1020 

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

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

1022 

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

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

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

1025 

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

1028 
situations; 

1029 

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

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

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

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

1033 

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

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

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

1036 

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

1037 
* system: provide TAGS file for Isabelle sources; 
9052  1038 

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

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

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

1041 

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

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

1043 
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

1044 

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

1047 

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

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

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

1050 

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

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

1053 

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

1054 

8015  1055 

7986  1056 
New in Isabelle99 (October 1999) 
1057 
 

4649  1058 

5931  1059 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
1060 

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

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

7215  1064 

1065 
Delcongs [if_weak_cong]; 

6922  1066 

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

5931  1069 

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

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

1074 

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

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

1076 
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

1077 

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

6057  1080 

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

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

6141  1084 

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

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

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

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

1091 
mk_solver: string > (thm list > int > tactic) > solver 
7619  1092 
where the string argument is only a comment. 
6057  1093 

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

1094 

6069  1095 
*** Proof tools *** 
1096 

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

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

6069  1101 

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

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

1105 
matching. 

6069  1106 

7593  1107 

6014  1108 
*** General *** 
1109 

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

1113 
readable proof documents (Isar == Intelligible semiautomated 

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

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

1116 

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

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

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

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

7215  1122 

7252  1123 
* native support for Proof General, both for classic Isabelle and 
7986  1124 
Isabelle/Isar; 
7215  1125 

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

1128 

6751  1129 
* Isabelle manuals now also available as PDF; 
1130 

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

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

6449  1136 

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

1139 

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

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

1142 

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

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

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

1146 

7215  1147 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
1148 

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

5973  1151 

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

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

1154 

6343  1155 
* new print_mode "HTML"; 
1156 

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

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

1159 

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

1162 

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

1164 
244c244 

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

1166 
 

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

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

1171 
 

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

1173 

7450  1174 
* function bind_thms stores lists of theorems (cf. bind_thm); 
1175 

7593  1176 
* new shorthand tactics ftac, eatac, datac, fatac; 
1177 

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

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

7593  1181 

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

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

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

1184 

6028  1185 

6057  1186 
*** HOL *** 
1187 

7215  1188 
** HOL arithmetic ** 
1189 

6343  1190 
* There are now decision procedures for linear arithmetic over nat and 
1191 
int: 

6131  1192 

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

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

1196 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  1201 

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

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

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

1206 
simplifier. 

6131  1207 

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

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

6028  1211 

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

1216 
type constraints; 

1217 

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

1219 
arguments; 

7157  1220 

7215  1221 
* many properties of integer multiplication, division and remainder 
1222 
are now available; 

6922  1223 

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

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

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

1228 
invocation of the underlying oracle). For SVC see 

7444  1229 
http://verify.stanford.edu/SVC 
6922  1230 

7125  1231 
* IsaMakefile: the HOLReal target now builds an actual image; 
1232 

7215  1233 

1234 
** HOL misc ** 

1235 

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

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

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

1238 

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

1241 

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

1244 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

1245 
changed syntax and (many) tactics; 

1246 

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

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

1250 
"mono" attribute); 

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

1251 

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

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

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

1254 

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

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

1256 

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

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

7326  1261 

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

1263 
Delsimprocs [record_simproc] 

1264 

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

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

1266 
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

1267 

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

1270 

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

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

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

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

6563  1275 

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

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

1279 

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

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

1281 
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

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

1283 

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

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

1285 
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

1286 

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

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

1288 
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

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

1290 

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

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

1295 

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

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

1297 
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

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

1299 

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

7492  1302 

7215  1303 

7113  1304 
*** LK *** 
1305 

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

7113  1308 

1309 
* the simplifier is now installed 

1310 

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

1311 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  1312 

1313 
* the classical reasoner now has a default rule database 

1314 

1315 

6064  1316 
*** ZF *** 
1317 

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

6269  1319 
directly (as in HOL) over datatypes and the natural numbers; 
6064  1320 

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

6064  1323 

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

1325 

6141  1326 
* simplification automatically does freeness reasoning for datatype 
6269  1327 
constructors; 
6141  1328 

6269  1329 
* automatic typeinference, with AddTCs command to insert new 
1330 
typechecking rules; 

6155  1331 

6269  1332 
* datatype introduction rules are now added as Safe Introduction rules 
1333 
to the claset; 

6155  1334 

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

1337 

6069  1338 

6343  1339 
*** Internal programming interfaces *** 
1340 

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

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

1342 

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

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

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

1345 

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

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

1347 

6343  1348 
* tuned current_goals_markers semantics: begin / end goal avoids 
1349 
printing empty lines; 

1350 

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

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

1353 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

1355 

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

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

1358 
mode to get Isabelle font glyphs as before; 

1359 

1360 
* refined token_translation interface; INCOMPATIBILITY: output length 

1361 
now of type real instead of int; 

1362 

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

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

1366 
opposed to intratheory data slots offered via TheoryDataFun; 

1367 

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

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

1369 
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

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

1373 

6343  1374 

6064  1375 

5781  1376 
New in Isabelle981 (October 1998) 
1377 
 

1378 

5127  1379 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  1380 

5726  1381 
* several changes of automated proof tools; 
5373  1382 

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

5214  1385 

5726  1386 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  1387 
called `inj_on'; 
5160  1388 

5275  1389 
* HOL: removed duplicate thms in Arith: 
1390 
less_imp_add_less should be replaced by trans_less_add1 

1391 
le_imp_add_le should be replaced by trans_le_add1 

5160  1392 

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

5490  1395 

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

1398 
now taken as an integer constant. 

5541  1399 

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

1401 

5363  1402 

5127  1403 
*** Proof tools *** 
4880  1404 

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

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

1406 
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

1407 
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

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

1409 
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

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

1411 
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

1412 
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

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