author  wenzelm 
Tue, 06 Aug 2002 11:19:00 +0200  
changeset 13459  83f41b047a39 
parent 13443  1c3327c348b3 
child 13463  07747943c626 
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 

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

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

19 
parameters (as in CASL, for example); just specify something like 
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset

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

21 

13425
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13410
diff
changeset

22 
* improved induct method: assumptions introduced by case "foo" are 
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13410
diff
changeset

23 
split into "foo.hyps" (from the rule) and "foo.prems" (from the goal 
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13410
diff
changeset

24 
statement); "foo" still refers to all facts collectively; 
119ae829ad9b
support for split assumptions in cases (hyps vs. prems);
wenzelm
parents:
13410
diff
changeset

25 

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

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

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

30 
default is 40); 

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

31 

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

32 

13158  33 
*** HOL *** 
34 

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

37 

38 
* attribute [symmetric] now works for relations as well; it turns 

39 
(x,y) : R^1 into (y,x) : R, and vice versa; 

40 

41 
* arith(_tac) does now know about div k and mod k where k is a numeral 

42 
of type nat or int. It can solve simple goals like 

43 

13344  44 
"0 < n ==> n div 2 < (n::nat)" 
13443  45 

46 
but fails if divisibility plays a role like in 

47 

48 
"n div 2 + (n+1) div 2 = (n::nat)" 

49 

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

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

13158  52 

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

53 

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

54 

12984  55 
New in Isabelle2002 (March 2002) 
56 
 

11474  57 

11572  58 
*** Document preparation *** 
59 

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

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

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

62 
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

63 
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

64 
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

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

66 

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

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

68 
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

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

70 

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

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

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

73 

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

76 

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

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

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

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

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

85 
isatool document copies the Isabelle style files to the target 

86 
location; 

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

87 

11572  88 

11633  89 
*** Isar *** 
90 

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

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

94 
 'induct' method divinates rule instantiation from the inductive 

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

96 
instantiation of cases; 

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

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

99 
rules without further ado; 

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

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

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

103 
statement becomes is included in the hypothesis, avoiding the 

104 
slightly cumbersome show "PROP ?case" form; 

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

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

107 
rules stemming from inductive sets to be applied in unstructured 

108 
scripts, while still benefitting from proper handling of nonatomic 

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

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

111 
 'induct' proper support for mutual induction involving nonatomic 

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

113 
below); 

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

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

116 
 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

117 
 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

118 
 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

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

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

121 
 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

122 

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

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

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

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

126 
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

127 
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

128 
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

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

130 

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

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

132 

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

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

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

135 

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

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

137 
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

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

142 
some examples; 

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

143 

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

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

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

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

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

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

149 

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

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

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

154 
the context elements being discharged in the obvious way; 

155 

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

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

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

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

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

161 

11722  162 
* Pure: renamed "antecedent" case to "rule_context"; 
163 

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

166 
use hardwired "Trueprop"; 

167 

11738  168 
* Pure: added 'corollary' command; 
169 

11722  170 
* Pure: fixed 'token_translation' command; 
171 

11899  172 
* Pure: removed obsolete 'exported' attribute; 
173 

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

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

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

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

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

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

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

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

183 

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

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

185 
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

186 
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

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

188 

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

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

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

191 

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

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

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

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

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

196 

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

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

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

199 

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

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

201 
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

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

203 

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

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

205 
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

206 
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

207 

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

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

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

210 
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

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

212 
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

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

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

215 

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

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

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

218 

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

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

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

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

222 

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

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

224 

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

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

230 

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

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

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

233 

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

234 

11474  235 
*** HOL *** 
236 

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

239 

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

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

242 

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

244 
binary representation internally; 

245 

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

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

248 

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

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

250 
are some hints on converting existing sources: 
11702  251 

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

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

254 
to be spaced properly; 

255 

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

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

258 

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

260 

261 
 remove all special provisions on numerals in proofs; 

262 

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

12736  266 
* HOL: symbolic syntax for x^2 (numeral 2); 
267 

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

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

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

270 
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

271 
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

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

273 

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

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

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

278 
declared as simp by default; 

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

279 
 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

280 
qualified)  potential INCOMPATIBILITY; 
12280  281 
 removed "make_scheme" operations (use "make" with "extend")  
282 
INCOMPATIBILITY; 

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

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

289 

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

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

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

292 
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

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

294 

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

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

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

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

299 

11657  300 
* HOL: linorder_less_split superseded by linorder_cases; 
301 

12917  302 
* HOL/List: "nodups" renamed to "distinct"; 
12889  303 

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

11437  306 

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

309 

310 
delSWrapper "split_all_tac" 

311 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

312 

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

11474  314 
MAY FAIL; 
11361  315 

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

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

319 
necessary to attach explicit type constraints; 

11307  320 

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

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

12489  324 

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

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

326 
expressions; 
11474  327 

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

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

329 
of "lam"  INCOMPATIBILITY; 
11474  330 

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

333 
renamed "Product_Type.unit"; 

11611  334 

12564  335 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
336 

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

339 

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

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

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

342 

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

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

344 
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

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

346 

12734  347 
* HOLReal: added Complex_Numbers (by Gertrud Bauer); 
348 

12690  349 
* HOLHyperreal is now a logic image; 
350 

11611  351 

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

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

353 

12622  354 
* Isar: consts/constdefs supports mixfix syntax for continuous 
355 
operations; 

356 

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

358 
HOLCF/ex/Dnat.thy; 

359 

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

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

363 

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

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

365 

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

366 

11474  367 
*** ZF *** 
368 

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

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

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

373 

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

375 
your theory on Main_ZFC; 

376 

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

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

12563  379 

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

382 

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

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

385 

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

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

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

389 

13025  390 
* ZF: many new theorems about lists, ordinals, etc.; 
12850  391 

11474  392 

393 
*** General *** 

394 

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

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

398 
also ref manual for further ML interfaces; 

399 

400 
* Pure/axclass: removed obsolete ML interface 

401 
goal_subclass/goal_arity; 

402 

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

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

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

406 
properly; 

407 

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

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

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

410 

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

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

412 
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

413 
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

414 
type variable); 
12280  415 

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

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

418 
"type_brackets"; 

419 

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

11817  421 
tokens into AST constants; 
11474  422 

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

425 
multiple declarations for same syntax element constant; 

426 

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

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

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

429 

12280  430 
* Provers/classical: renamed addaltern to addafter, addSaltern to 
431 
addSafter; 

432 

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

434 
as well; 

12253  435 

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

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

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

440 
support requires further installations, e.g. from 

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

442 

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

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

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

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

447 

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

450 

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

453 
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

454 

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

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

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

11551  460 

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

463 
isolatin characters may now be used; the related isatools 

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

465 

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

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

468 
terminal); 

469 

11314  470 

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

471 

11062  472 
New in Isabelle992 (February 2001) 
473 
 

474 

10224  475 
*** Overview of INCOMPATIBILITIES *** 
476 

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

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

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

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

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

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

485 

10998  486 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
487 
gfp_Tarski to gfp_unfold; 

10224  488 

10288  489 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
490 

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

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

10793  494 

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

497 

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

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

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

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

503 
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

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

505 

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

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

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

508 

10224  509 

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

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

511 

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

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

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

516 
typewriter); 

517 

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

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

519 
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

520 

10858  521 
* some more standard symbols; see Appendix A of the system manual for 
11062  522 
the complete list of symbols defined in isabellesym.sty; 
10858  523 

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

526 
definitions); 

527 

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

530 
actual humanreadable proof documents. Please do not include goal 

531 
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

532 

11062  533 
* proper indentation of antiquoted output with proportional LaTeX 
534 
fonts; 

10862  535 

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

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

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

538 

11062  539 
* isatool unsymbolize tunes sources for plain ASCII communication; 
540 

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

541 

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

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

543 

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

546 
documents, due to unpredictable outcome and noncompositional proof 

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

548 
for Prologstyle synthesis of proven results; 

549 

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

552 

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

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

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

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

557 

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

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

560 

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

562 
statements as well; 

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

563 

11097  564 
* Pure: more robust selection of calculational rules; 
565 

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

568 

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

570 
lemmas, using the graph browser tool; 

571 

10944  572 
* Pure: predict failure of "show" in interactive mode; 
573 

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

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

575 

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

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

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

578 

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

582 

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

585 
the result to be shown in each case; 

586 

10770  587 
* HOL: added 'recdef_tc' command; 
588 

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

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

590 

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

591 

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

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

593 

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

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

595 
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

596 
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

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

599 

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

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

603 

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

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

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

608 
literature; 

609 

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

613 

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

616 

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

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

618 
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

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

620 

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

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

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

623 

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

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

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

626 

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

629 
functions for the reals; 

10756  630 

11094  631 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  632 

10858  633 

10474  634 
*** CTT *** 
635 

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

10474  638 

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

641 

10474  642 

10391  643 
*** General *** 
644 

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

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

648 
the Isabelle inference kernel has been greatly improved; 

649 

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

652 

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

655 

11124  656 
* system: support Poly/ML 4.0; 
657 

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

659 

10391  660 

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

661 

10103  662 
New in Isabelle991 (October 2000) 
663 
 

8015  664 

10003  665 
*** Overview of INCOMPATIBILITIES *** 
8014  666 

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

669 
issue the following ML commands: 

670 

671 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

672 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  673 

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

10003  676 

677 
* HOL: nat_less_induct renamed to less_induct; 

678 

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

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

8967  681 

10003  682 
select_equality > some_equality 
683 
select_eq_Ex > some_eq_ex 

684 
selectI2EX > someI2_ex 

685 
selectI2 > someI2 

686 
selectI > someI 

687 
select1_equality > some1_equality 

688 
Eps_sym_eq > some_sym_eq_trivial 

689 
Eps_eq > some_eq_trivial 

690 

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

692 

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

694 
instead); 

695 

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

697 
f.simps instead of f.rules; 

698 

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

700 

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

702 
sometimes be needed; 

703 

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

8014  705 

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

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

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

709 
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

710 
now "<*lex*>" instead of "**"; 
8705  711 

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

9971  714 

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

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

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

717 

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

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

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

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

721 

8848  722 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
723 

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

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

725 
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

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

727 

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

9908  730 

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

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

733 

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

9542  736 

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

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

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

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

741 

9612  742 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
743 

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

744 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  745 

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

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

748 

8014  749 

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

751 

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

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

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

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

756 

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

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

759 

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

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

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

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

763 

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

8566  767 

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

769 

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

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

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

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

773 

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

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

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

777 

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

778 

8184  779 
*** Isar *** 
780 

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

783 
accommodates incremental typeinference very nicely; 

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

784 

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

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

787 

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

790 
useful to collect intermediate results without explicit name 

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

792 
premises; 

8184  793 

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

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

797 
to theorems as "tags"; 

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

798 

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

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

801 

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

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

804 

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

806 

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

809 

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

812 
with the version in Provers/classical; 

9612  813 

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

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

816 

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

819 

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

9612  822 

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

824 
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

825 
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

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

827 

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

830 

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

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

833 
well (including splits); 

834 

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

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

837 

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

839 
of Simplifier and Classical reasoner); 

840 

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

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

843 
recdef) support case names and properly name parameters; 

9612  844 

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

847 
calculations; 

848 

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

850 
method anyway; 

851 

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

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

854 
foo.split foo.split_asm for each datatype; 

855 

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

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

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

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

860 

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

862 

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

864 

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

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

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

867 
proof states; 
8487  868 

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

8487  872 

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

876 
(for HOL datatypes); 

8534  877 

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

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

881 

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

883 

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

886 
(print_commands, print_methods etc.); 

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

887 

10003  888 
* Isar: added 'nothing'  the empty list of theorems; 
9239  889 

8184  890 

8014  891 
*** HOL *** 
892 

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

895 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

899 

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

8014  902 

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

903 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  904 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
905 
Rasmussen; 

8570  906 

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

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

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

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

910 
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

911 
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

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

913 

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

9542  916 

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

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

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

919 

10003  920 
* HOL/Lambda: converted into newstyle theory and document; 
9542  921 

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

924 
representation; very useful in avoiding lifting of operations; 

8848  925 

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

928 
well; admit "r" as field name; 

9542  929 

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

932 

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

934 
Types nat and int belong to this axclass; 

935 

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

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

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

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

8736  943 

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

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

9835  947 

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

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

951 

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

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

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

8603  957 

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

960 
termination conditions are proved automatically, these simplification 

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

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

963 
each equation; 

964 

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

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

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

967 
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

968 
invariant proof rule for while is applied. 
9457  969 

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

8925  972 

8848  973 
* HOL: theorems impI, allI, ballI bound as "strip"; 
974 

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

978 

10003  979 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  980 

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

8626  983 

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

986 

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

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

990 
bogus); 

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

991 

8412  992 

9542  993 
*** ZF *** 
994 

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

9542  997 

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

1000 
making the algebraic laws unconditional; 

9542  1001 

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

9542  1004 

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

9542  1007 

10003  1008 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
1009 
simplification; 

9388  1010 

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

9388  1013 

1014 

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

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

1016 

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

1019 

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

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

1022 

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

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

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

1025 

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

1028 
use instead the strong form, 

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

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

1031 
from destructrules; 

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

1032 

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

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

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

1035 

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

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

1037 

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

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

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

1040 

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

1043 
situations; 

1044 

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

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

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

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

1048 

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

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

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

1051 

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

1052 
* system: provide TAGS file for Isabelle sources; 
9052  1053 

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

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

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

1056 

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

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

1058 
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

1059 

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

1062 

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

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

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

1065 

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

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

1068 

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

1069 

8015  1070 

7986  1071 
New in Isabelle99 (October 1999) 
1072 
 

4649  1073 

5931  1074 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
1075 

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

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

7215  1079 

1080 
Delcongs [if_weak_cong]; 

6922  1081 

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

5931  1084 

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

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

1089 

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

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

1091 
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

1092 

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

6057  1095 

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

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

6141  1099 

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

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

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

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

1106 
mk_solver: string > (thm list > int > tactic) > solver 
7619  1107 
where the string argument is only a comment. 
6057  1108 

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

1109 

6069  1110 
*** Proof tools *** 
1111 

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

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

6069  1116 

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

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

1120 
matching. 

6069  1121 

7593  1122 

6014  1123 
*** General *** 
1124 

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

1128 
readable proof documents (Isar == Intelligible semiautomated 

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

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

1131 

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

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

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

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

7215  1137 

7252  1138 
* native support for Proof General, both for classic Isabelle and 
7986  1139 
Isabelle/Isar; 
7215  1140 

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

1143 

6751  1144 
* Isabelle manuals now also available as PDF; 
1145 

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

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

6449  1151 

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

1154 

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

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

1157 

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

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

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

1161 

7215  1162 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
1163 

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

5973  1166 

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

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

1169 

6343  1170 
* new print_mode "HTML"; 
1171 

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

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

1174 

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

1177 

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

1179 
244c244 

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

1181 
 

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

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

1186 
 

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

1188 

7450  1189 
* function bind_thms stores lists of theorems (cf. bind_thm); 
1190 

7593  1191 
* new shorthand tactics ftac, eatac, datac, fatac; 
1192 

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

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

7593  1196 

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

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

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

1199 

6028  1200 

6057  1201 
*** HOL *** 
1202 

7215  1203 
** HOL arithmetic ** 
1204 

6343  1205 
* There are now decision procedures for linear arithmetic over nat and 
1206 
int: 

6131  1207 

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

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

1211 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  1216 

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

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

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

1221 
simplifier. 

6131  1222 

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

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

6028  1226 

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

1231 
type constraints; 

1232 

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

1234 
arguments; 

7157  1235 

7215  1236 
* many properties of integer multiplication, division and remainder 
1237 
are now available; 

6922  1238 

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

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

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

1243 
invocation of the underlying oracle). For SVC see 

7444  1244 
http://verify.stanford.edu/SVC 
6922  1245 

7125  1246 
* IsaMakefile: the HOLReal target now builds an actual image; 
1247 

7215  1248 

1249 
** HOL misc ** 

1250 

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

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

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

1253 

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

1256 

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

1259 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

1260 
changed syntax and (many) tactics; 

1261 

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

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

1265 
"mono" attribute); 

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

1266 

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

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

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

1269 

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

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

1271 

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

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

7326  1276 

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

1278 
Delsimprocs [record_simproc] 

1279 

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

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

1281 
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

1282 

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

1285 

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

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

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

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

6563  1290 

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

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

1294 

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

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

1296 
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

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

1298 

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

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

1300 
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

1301 

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

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

1303 
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

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

1305 

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

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

1310 

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

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

1312 
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

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

1314 

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

7492  1317 

7215  1318 

7113  1319 
*** LK *** 
1320 

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

7113  1323 

1324 
* the simplifier is now installed 

1325 

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

1326 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  1327 

1328 
* the classical reasoner now has a default rule database 

1329 

1330 

6064  1331 
*** ZF *** 
1332 

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

6269  1334 
directly (as in HOL) over datatypes and the natural numbers; 
6064  1335 

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

6064  1338 

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

1340 

6141  1341 
* simplification automatically does freeness reasoning for datatype 
6269  1342 
constructors; 
6141  1343 

6269  1344 
* automatic typeinference, with AddTCs command to insert new 
1345 
typechecking rules; 

6155  1346 

6269  1347 
* datatype introduction rules are now added as Safe Introduction rules 
1348 
to the claset; 

6155  1349 

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

1352 

6069  1353 

6343  1354 
*** Internal programming interfaces *** 
1355 

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

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

1357 

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

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

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

1360 

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

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

1362 

6343  1363 
* tuned current_goals_markers semantics: begin / end goal avoids 
1364 
printing empty lines; 

1365 

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

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

1368 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

1370 

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

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

1373 
mode to get Isabelle font glyphs as before; 

1374 

1375 
* refined token_translation interface; INCOMPATIBILITY: output length 

1376 
now of type real instead of int; 

1377 

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

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

1381 
opposed to intratheory data slots offered via TheoryDataFun; 

1382 

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

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

1384 
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

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

1388 

6343  1389 

6064  1390 

5781  1391 
New in Isabelle981 (October 1998) 
1392 
 

1393 

5127  1394 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  1395 

5726  1396 
* several changes of automated proof tools; 
5373  1397 

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

5214  1400 

5726  1401 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  1402 
called `inj_on'; 
5160  1403 

5275  1404 
* HOL: removed duplicate thms in Arith: 
1405 
less_imp_add_less should be replaced by trans_less_add1 

1406 
le_imp_add_le should be replaced by trans_le_add1 

5160  1407 

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

5490  1410 

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

1413 
now taken as an integer constant. 

5541 