author  wenzelm 
Thu, 08 Aug 2002 23:49:44 +0200  
changeset 13484  d8f5d3391766 
parent 13478  9cfbcb9acfef 
child 13492  6aae8eb39a18 
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 

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

22 
* Pure: improved thms_containing: proper indexing of facts instead of 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

23 
raw theorems; check validity of results wrt. current name space; 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

24 
include local facts of proof configuration (also covers active 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

25 
locales); an optional limit for the number of printed facts may be 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

26 
given (the default is 40); 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

27 

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

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

29 
"foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

30 
the goal statement); "foo" still refers to all facts collectively; 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

31 

13280
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 

13478  54 
*** ML *** 
55 

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

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

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

59 

60 
* Pure: improved error reporting of simprocs; 

61 

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

63 
up simprocs; 

64 

65 

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

66 

12984  67 
New in Isabelle2002 (March 2002) 
68 
 

11474  69 

11572  70 
*** Document preparation *** 
71 

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

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

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

74 
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

75 
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

76 
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

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

78 

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

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

80 
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

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

82 

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

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

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

85 

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

88 

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

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

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

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

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

97 
isatool document copies the Isabelle style files to the target 

98 
location; 

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

99 

11572  100 

11633  101 
*** Isar *** 
102 

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

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

106 
 'induct' method divinates rule instantiation from the inductive 

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

108 
instantiation of cases; 

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

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

111 
rules without further ado; 

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

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

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

115 
statement becomes is included in the hypothesis, avoiding the 

116 
slightly cumbersome show "PROP ?case" form; 

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

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

119 
rules stemming from inductive sets to be applied in unstructured 

120 
scripts, while still benefitting from proper handling of nonatomic 

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

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

123 
 'induct' proper support for mutual induction involving nonatomic 

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

125 
below); 

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

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

128 
 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

129 
 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

130 
 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

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

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

133 
 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

134 

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

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

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

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

138 
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

139 
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

140 
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

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

142 

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

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

144 

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

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

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

147 

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

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

149 
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

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

154 
some examples; 

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

155 

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

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

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

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

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

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

161 

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

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

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

166 
the context elements being discharged in the obvious way; 

167 

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

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

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

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

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

173 

11722  174 
* Pure: renamed "antecedent" case to "rule_context"; 
175 

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

178 
use hardwired "Trueprop"; 

179 

11738  180 
* Pure: added 'corollary' command; 
181 

11722  182 
* Pure: fixed 'token_translation' command; 
183 

11899  184 
* Pure: removed obsolete 'exported' attribute; 
185 

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

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

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

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

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

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

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

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

195 

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

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

197 
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

198 
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

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

200 

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

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

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

203 

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

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

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

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

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

208 

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

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

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

211 

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

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

213 
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

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

215 

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

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

217 
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

218 
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

219 

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

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

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

222 
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

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

224 
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

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

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

227 

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

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

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

230 

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

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

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

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

234 

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

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

236 

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

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

242 

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

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

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

245 

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

246 

11474  247 
*** HOL *** 
248 

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

251 

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

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

254 

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

256 
binary representation internally; 

257 

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

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

260 

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

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

262 
are some hints on converting existing sources: 
11702  263 

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

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

266 
to be spaced properly; 

267 

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

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

270 

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

272 

273 
 remove all special provisions on numerals in proofs; 

274 

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

12736  278 
* HOL: symbolic syntax for x^2 (numeral 2); 
279 

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

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

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

282 
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

283 
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

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

285 

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

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

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

290 
declared as simp by default; 

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

291 
 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

292 
qualified)  potential INCOMPATIBILITY; 
12280  293 
 removed "make_scheme" operations (use "make" with "extend")  
294 
INCOMPATIBILITY; 

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

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

301 

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

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

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

304 
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

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

306 

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

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

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

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

311 

11657  312 
* HOL: linorder_less_split superseded by linorder_cases; 
313 

12917  314 
* HOL/List: "nodups" renamed to "distinct"; 
12889  315 

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

11437  318 

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

321 

322 
delSWrapper "split_all_tac" 

323 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

324 

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

11474  326 
MAY FAIL; 
11361  327 

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

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

331 
necessary to attach explicit type constraints; 

11307  332 

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

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

12489  336 

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

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

338 
expressions; 
11474  339 

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

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

341 
of "lam"  INCOMPATIBILITY; 
11474  342 

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

345 
renamed "Product_Type.unit"; 

11611  346 

12564  347 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
348 

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

351 

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

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

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

354 

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

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

356 
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

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

358 

12734  359 
* HOLReal: added Complex_Numbers (by Gertrud Bauer); 
360 

12690  361 
* HOLHyperreal is now a logic image; 
362 

11611  363 

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

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

365 

12622  366 
* Isar: consts/constdefs supports mixfix syntax for continuous 
367 
operations; 

368 

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

370 
HOLCF/ex/Dnat.thy; 

371 

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

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

375 

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

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

377 

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

378 

11474  379 
*** ZF *** 
380 

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

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

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

385 

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

387 
your theory on Main_ZFC; 

388 

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

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

12563  391 

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

394 

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

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

397 

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

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

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

401 

13025  402 
* ZF: many new theorems about lists, ordinals, etc.; 
12850  403 

11474  404 

405 
*** General *** 

406 

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

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

410 
also ref manual for further ML interfaces; 

411 

412 
* Pure/axclass: removed obsolete ML interface 

413 
goal_subclass/goal_arity; 

414 

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

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

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

418 
properly; 

419 

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

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

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

422 

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

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

424 
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

425 
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

426 
type variable); 
12280  427 

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

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

430 
"type_brackets"; 

431 

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

11817  433 
tokens into AST constants; 
11474  434 

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

437 
multiple declarations for same syntax element constant; 

438 

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

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

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

441 

12280  442 
* Provers/classical: renamed addaltern to addafter, addSaltern to 
443 
addSafter; 

444 

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

446 
as well; 

12253  447 

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

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

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

452 
support requires further installations, e.g. from 

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

454 

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

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

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

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

459 

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

462 

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

465 
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

466 

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

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

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

11551  472 

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

475 
isolatin characters may now be used; the related isatools 

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

477 

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

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

480 
terminal); 

481 

11314  482 

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

483 

11062  484 
New in Isabelle992 (February 2001) 
485 
 

486 

10224  487 
*** Overview of INCOMPATIBILITIES *** 
488 

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

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

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

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

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

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

497 

10998  498 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
499 
gfp_Tarski to gfp_unfold; 

10224  500 

10288  501 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
502 

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

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

10793  506 

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

509 

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

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

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

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

515 
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

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

517 

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

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

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

520 

10224  521 

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

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

523 

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

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

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

528 
typewriter); 

529 

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

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

531 
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

532 

10858  533 
* some more standard symbols; see Appendix A of the system manual for 
11062  534 
the complete list of symbols defined in isabellesym.sty; 
10858  535 

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

538 
definitions); 

539 

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

542 
actual humanreadable proof documents. Please do not include goal 

543 
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

544 

11062  545 
* proper indentation of antiquoted output with proportional LaTeX 
546 
fonts; 

10862  547 

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

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

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

550 

11062  551 
* isatool unsymbolize tunes sources for plain ASCII communication; 
552 

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

553 

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

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

555 

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

558 
documents, due to unpredictable outcome and noncompositional proof 

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

560 
for Prologstyle synthesis of proven results; 

561 

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

564 

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

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

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

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

569 

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

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

572 

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

574 
statements as well; 

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

575 

11097  576 
* Pure: more robust selection of calculational rules; 
577 

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

580 

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

582 
lemmas, using the graph browser tool; 

583 

10944  584 
* Pure: predict failure of "show" in interactive mode; 
585 

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

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

587 

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

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

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

590 

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

594 

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

597 
the result to be shown in each case; 

598 

10770  599 
* HOL: added 'recdef_tc' command; 
600 

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

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

602 

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

603 

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

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

605 

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

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

607 
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

608 
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

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

611 

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

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

615 

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

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

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

620 
literature; 

621 

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

625 

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

628 

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

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

630 
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

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

632 

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

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

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

635 

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

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

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

638 

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

641 
functions for the reals; 

10756  642 

11094  643 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  644 

10858  645 

10474  646 
*** CTT *** 
647 

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

10474  650 

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

653 

10474  654 

10391  655 
*** General *** 
656 

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

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

660 
the Isabelle inference kernel has been greatly improved; 

661 

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

664 

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

667 

11124  668 
* system: support Poly/ML 4.0; 
669 

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

671 

10391  672 

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

673 

10103  674 
New in Isabelle991 (October 2000) 
675 
 

8015  676 

10003  677 
*** Overview of INCOMPATIBILITIES *** 
8014  678 

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

681 
issue the following ML commands: 

682 

683 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

684 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  685 

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

10003  688 

689 
* HOL: nat_less_induct renamed to less_induct; 

690 

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

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

8967  693 

10003  694 
select_equality > some_equality 
695 
select_eq_Ex > some_eq_ex 

696 
selectI2EX > someI2_ex 

697 
selectI2 > someI2 

698 
selectI > someI 

699 
select1_equality > some1_equality 

700 
Eps_sym_eq > some_sym_eq_trivial 

701 
Eps_eq > some_eq_trivial 

702 

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

704 

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

706 
instead); 

707 

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

709 
f.simps instead of f.rules; 

710 

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

712 

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

714 
sometimes be needed; 

715 

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

8014  717 

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

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

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

721 
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

722 
now "<*lex*>" instead of "**"; 
8705  723 

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

9971  726 

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

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

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

729 

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

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

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

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

733 

8848  734 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
735 

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

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

737 
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

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

739 

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

9908  742 

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

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

745 

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

9542  748 

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

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

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

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

753 

9612  754 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
755 

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

756 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  757 

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

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

760 

8014  761 

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

763 

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

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

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

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

768 

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

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

771 

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

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

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

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

775 

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

8566  779 

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

781 

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

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

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

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

785 

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

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

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

789 

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

790 

8184  791 
*** Isar *** 
792 

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

795 
accommodates incremental typeinference very nicely; 

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

796 

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

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

799 

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

802 
useful to collect intermediate results without explicit name 

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

804 
premises; 

8184  805 

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

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

809 
to theorems as "tags"; 

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

810 

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

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

813 

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

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

816 

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

818 

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

821 

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

824 
with the version in Provers/classical; 

9612  825 

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

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

828 

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

831 

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

9612  834 

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

836 
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

837 
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

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

839 

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

842 

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

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

845 
well (including splits); 

846 

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

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

849 

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

851 
of Simplifier and Classical reasoner); 

852 

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

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

855 
recdef) support case names and properly name parameters; 

9612  856 

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

859 
calculations; 

860 

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

862 
method anyway; 

863 

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

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

866 
foo.split foo.split_asm for each datatype; 

867 

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

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

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

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

872 

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

874 

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

876 

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

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

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

879 
proof states; 
8487  880 

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

8487  884 

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

888 
(for HOL datatypes); 

8534  889 

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

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

893 

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

895 

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

898 
(print_commands, print_methods etc.); 

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

899 

10003  900 
* Isar: added 'nothing'  the empty list of theorems; 
9239  901 

8184  902 

8014  903 
*** HOL *** 
904 

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

907 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

911 

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

8014  914 

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

915 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  916 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
917 
Rasmussen; 

8570  918 

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

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

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

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

922 
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

923 
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

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

925 

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

9542  928 

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

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

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

931 

10003  932 
* HOL/Lambda: converted into newstyle theory and document; 
9542  933 

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

936 
representation; very useful in avoiding lifting of operations; 

8848  937 

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

940 
well; admit "r" as field name; 

9542  941 

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

944 

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

946 
Types nat and int belong to this axclass; 

947 

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

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

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

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

8736  955 

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

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

9835  959 

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

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

963 

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

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

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

8603  969 

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

972 
termination conditions are proved automatically, these simplification 

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

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

975 
each equation; 

976 

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

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

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

979 
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

980 
invariant proof rule for while is applied. 
9457  981 

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

8925  984 

8848  985 
* HOL: theorems impI, allI, ballI bound as "strip"; 
986 

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

990 

10003  991 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  992 

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

8626  995 

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

998 

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

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

1002 
bogus); 

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

1003 

8412  1004 

9542  1005 
*** ZF *** 
1006 

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

9542  1009 

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

1012 
making the algebraic laws unconditional; 

9542  1013 

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

9542  1016 

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

9542  1019 

10003  1020 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
1021 
simplification; 

9388  1022 

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

9388  1025 

1026 

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

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

1028 

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

1031 

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

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

1034 

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

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

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

1037 

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

1040 
use instead the strong form, 

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

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

1043 
from destructrules; 

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

1044 

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

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

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

1047 

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

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

1049 

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

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

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

1052 

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

1055 
situations; 

1056 

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

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

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

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

1060 

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

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

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

1063 

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

1064 
* system: provide TAGS file for Isabelle sources; 
9052  1065 

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

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

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

1068 

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

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

1070 
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

1071 

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

1074 

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

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

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

1077 

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

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

1080 

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

1081 

8015  1082 

7986  1083 
New in Isabelle99 (October 1999) 
1084 
 

4649  1085 

5931  1086 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
1087 

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

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

7215  1091 

1092 
Delcongs [if_weak_cong]; 

6922  1093 

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

5931  1096 

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

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

1101 

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

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

1103 
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

1104 

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

6057  1107 

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

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

6141  1111 

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

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

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

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

1118 
mk_solver: string > (thm list > int > tactic) > solver 
7619  1119 
where the string argument is only a comment. 
6057  1120 

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

1121 

6069  1122 
*** Proof tools *** 
1123 

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

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

6069  1128 

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

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

1132 
matching. 

6069  1133 

7593  1134 

6014  1135 
*** General *** 
1136 

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

1140 
readable proof documents (Isar == Intelligible semiautomated 

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

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

1143 

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

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

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

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

7215  1149 

7252  1150 
* native support for Proof General, both for classic Isabelle and 
7986  1151 
Isabelle/Isar; 
7215  1152 

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

1155 

6751  1156 
* Isabelle manuals now also available as PDF; 
1157 

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

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

6449  1163 

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

1166 

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

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

1169 

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

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

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

1173 

7215  1174 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
1175 

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

5973  1178 

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

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

1181 

6343  1182 
* new print_mode "HTML"; 
1183 

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

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

1186 

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

1189 

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

1191 
244c244 

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

1193 
 

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

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

1198 
 

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

1200 

7450  1201 
* function bind_thms stores lists of theorems (cf. bind_thm); 
1202 

7593  1203 
* new shorthand tactics ftac, eatac, datac, fatac; 
1204 

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

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

7593  1208 

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

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

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

1211 

6028  1212 

6057  1213 
*** HOL *** 
1214 

7215  1215 
** HOL arithmetic ** 
1216 

6343  1217 
* There are now decision procedures for linear arithmetic over nat and 
1218 
int: 

6131  1219 

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

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

1223 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  1228 

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

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

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

1233 
simplifier. 

6131  1234 

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

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

6028  1238 

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

1243 
type constraints; 

1244 

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

1246 
arguments; 

7157  1247 

7215  1248 
* many properties of integer multiplication, division and remainder 
1249 
are now available; 

6922  1250 

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

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

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

1255 
invocation of the underlying oracle). For SVC see 

7444  1256 
http://verify.stanford.edu/SVC 
6922  1257 

7125  1258 
* IsaMakefile: the HOLReal target now builds an actual image; 
1259 

7215  1260 

1261 
** HOL misc ** 

1262 

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

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

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

1265 

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

1268 

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

1271 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

1272 
changed syntax and (many) tactics; 

1273 

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

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

1277 
"mono" attribute); 

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

1278 

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

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

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

1281 

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

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

1283 

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

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

7326  1288 

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

1290 
Delsimprocs [record_simproc] 

1291 

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

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

1293 
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

1294 

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

1297 

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

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

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

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

6563  1302 

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

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

1306 

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

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

1308 
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

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

1310 

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

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

1312 
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

1313 

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

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

1315 
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

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

1317 

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

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

1322 

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

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

1324 
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

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

1326 

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

7492  1329 

7215  1330 

7113  1331 
*** LK *** 
1332 

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

7113  1335 

1336 
* the simplifier is now installed 

1337 

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

1338 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  1339 

1340 
* the classical reasoner now has a default rule database 

1341 

1342 

6064  1343 
*** ZF *** 
1344 

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

6269  1346 
directly (as in HOL) over datatypes and the natural numbers; 
6064  1347 

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

6064  1350 

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

1352 

6141  1353 
* simplification automatically does freeness reasoning for datatype 
6269  1354 
constructors; 
6141  1355 

6269  1356 
* automatic typeinference, with AddTCs command to insert new 
1357 
typechecking rules; 

6155  1358 

6269  1359 
* datatype introduction rules are now added as Safe Introduction rules 
1360 
to the claset; 

6155  1361 

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

1364 

6069  1365 

6343  1366 
*** Internal programming interfaces *** 
1367 

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

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

1369 

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

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

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

1372 

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

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

1374 

6343  1375 
* tuned current_goals_markers semantics: begin / end goal avoids 
1376 
printing empty lines; 

1377 

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

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

1380 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

1382 

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

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

1385 
mode to get Isabelle font glyphs as before; 

1386 

1387 
* refined token_translation interface; INCOMPATIBILITY: output length 

1388 
now of type real instead of int; 

1389 

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

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

1393 
opposed to intratheory data slots offered via TheoryDataFun; 

1394 

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

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

1396 
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

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

1400 

6343  1401 

6064  1402 

5781  1403 
New in Isabelle981 (October 1998) 
1404 
 

1405 

5127  1406 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  1407 

5726  1408 
* several changes of automated proof tools; 
5373  1409 

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

5214  1412 

5726  1413 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  1414 
called `inj_on'; 