author  nipkow 
Thu, 14 Feb 2002 12:24:02 +0100  
changeset 12889  1de4f0b824a8 
parent 12877  b9635eb8a448 
child 12899  7d5b690253ee 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

12724  4 
New in Isabelle2002 (January 2002) 
5 
 

11474  6 

11572  7 
*** Document preparation *** 
8 

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

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

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

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

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

13 

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

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

15 
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

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

17 

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

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

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

20 

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

23 

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

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

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

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

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

32 
isatool document copies the Isabelle style files to the target 

33 
location; 

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

34 

11572  35 

11633  36 
*** Isar *** 
37 

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

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

41 
 'induct' method divinates rule instantiation from the inductive 

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

43 
instantiation of cases; 

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

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

46 
rules without further ado; 

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

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

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

50 
statement becomes is included in the hypothesis, avoiding the 

51 
slightly cumbersome show "PROP ?case" form; 

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

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

54 
rules stemming from inductive sets to be applied in unstructured 

55 
scripts, while still benefitting from proper handling of nonatomic 

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

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

58 
 'induct' proper support for mutual induction involving nonatomic 

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

60 
below); 

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

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

63 
 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

64 
 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

65 
 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

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

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

68 
 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

69 

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

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

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

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

73 
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

74 
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

75 
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

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

77 

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

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

79 

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

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

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

82 

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

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

84 
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

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

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

88 

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

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

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

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

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

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

94 

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

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

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

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

98 

11722  99 
* Pure: renamed "antecedent" case to "rule_context"; 
100 

11738  101 
* Pure: added 'corollary' command; 
102 

11722  103 
* Pure: fixed 'token_translation' command; 
104 

11899  105 
* Pure: removed obsolete 'exported' attribute; 
106 

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

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

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

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

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

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

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

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

116 

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

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

118 
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

119 
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

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

121 

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

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

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

124 

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

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

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

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

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

129 

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

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

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

132 

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

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

134 
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

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

136 

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

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

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

139 
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

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

141 
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

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

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

144 

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

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

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

147 

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

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

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

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

151 

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

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

153 

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

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

159 

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

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

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

162 

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

163 

11474  164 
*** HOL *** 
165 

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

168 

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

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

171 

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

173 
binary representation internally; 

174 

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

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

177 

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

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

179 
are some hints on converting existing sources: 
11702  180 

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

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

183 
to be spaced properly; 

184 

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

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

187 

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

189 

190 
 remove all special provisions on numerals in proofs; 

191 

12837  192 
* HOL: simp rules nat_number_of expand numerals on nat to Suc/0 
193 
representation (depends on bin_arith_simps in the default context); 

194 

12736  195 
* HOL: symbolic syntax for x^2 (numeral 2); 
196 

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

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

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

199 
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

200 
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

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

202 

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

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

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

207 
declared as simp by default; 

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

208 
 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

209 
qualified)  potential INCOMPATIBILITY; 
12280  210 
 removed "make_scheme" operations (use "make" with "extend")  
211 
INCOMPATIBILITY; 

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

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

218 

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

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

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

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

223 

11657  224 
* HOL: linorder_less_split superseded by linorder_cases; 
225 

12889  226 
* HOL/List: "nodups" renamed to "distinct" 
227 

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

11437  230 

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

233 

234 
delSWrapper "split_all_tac" 

235 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

236 

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

11474  238 
MAY FAIL; 
11361  239 

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

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

243 
necessary to attach explicit type constraints; 

11307  244 

12489  245 
* HOL/Relation: the prefix name of the infix "O" has been changed from "comp" 
246 
to "rel_comp"; INCOMPATIBILITY: a few theorems have been renamed accordingly 

247 
(eg "compI" > "rel_compI"). 

248 

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

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

250 
expressions; 
11474  251 

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

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

253 
of "lam"  INCOMPATIBILITY; 
11474  254 

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

257 
renamed "Product_Type.unit"; 

11611  258 

12564  259 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
260 

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

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

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

263 

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

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

265 
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

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

267 

12734  268 
* HOLReal: added Complex_Numbers (by Gertrud Bauer); 
269 

12690  270 
* HOLHyperreal is now a logic image; 
271 

11611  272 

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

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

274 

12622  275 
* Isar: consts/constdefs supports mixfix syntax for continuous 
276 
operations; 

277 

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

279 
HOLCF/ex/Dnat.thy; 

280 

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

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

284 

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

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

286 

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

287 

11474  288 
*** ZF *** 
289 

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

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

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

294 

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

296 
your theory on Main_ZFC; 

297 

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

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

12563  300 

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

303 

12777  304 
* ZF/AC, Coind, IMP, Resid: updated and converted to newstyle theory format; 
12608
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

305 

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

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

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

309 

12850  310 
* Many new theorems about lists, ordinals, etc.; 
311 

11474  312 

313 
*** General *** 

314 

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

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

318 
also ref manual for further ML interfaces; 

319 

320 
* Pure/axclass: removed obsolete ML interface 

321 
goal_subclass/goal_arity; 

322 

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

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

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

326 
properly; 

327 

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

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

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

330 

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

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

332 
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

333 
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

334 
type variable); 
12280  335 

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

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

338 
"type_brackets"; 

339 

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

11817  341 
tokens into AST constants; 
11474  342 

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

345 
multiple declarations for same syntax element constant; 

346 

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

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

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

349 

12280  350 
* Provers/classical: renamed addaltern to addafter, addSaltern to 
351 
addSafter; 

352 

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

354 
as well; 

12253  355 

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

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

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

360 
support requires further installations, e.g. from 

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

362 

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

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

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

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

367 

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

370 

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

373 
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

374 

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

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

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

11551  380 

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

383 
isolatin characters may now be used; the related isatools 

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

385 

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

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

388 
terminal); 

389 

11314  390 

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

391 

11062  392 
New in Isabelle992 (February 2001) 
393 
 

394 

10224  395 
*** Overview of INCOMPATIBILITIES *** 
396 

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

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

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

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

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

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

405 

10998  406 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
407 
gfp_Tarski to gfp_unfold; 

10224  408 

10288  409 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
410 

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

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

10793  414 

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

417 

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

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

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

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

423 
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

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

425 

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

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

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

428 

10224  429 

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

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

431 

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

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

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

436 
typewriter); 

437 

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

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

439 
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

440 

10858  441 
* some more standard symbols; see Appendix A of the system manual for 
11062  442 
the complete list of symbols defined in isabellesym.sty; 
10858  443 

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

446 
definitions); 

447 

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

450 
actual humanreadable proof documents. Please do not include goal 

451 
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

452 

11062  453 
* proper indentation of antiquoted output with proportional LaTeX 
454 
fonts; 

10862  455 

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

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

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

458 

11062  459 
* isatool unsymbolize tunes sources for plain ASCII communication; 
460 

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

461 

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

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

463 

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

466 
documents, due to unpredictable outcome and noncompositional proof 

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

468 
for Prologstyle synthesis of proven results; 

469 

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

472 

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

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

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

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

477 

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

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

480 

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

482 
statements as well; 

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

483 

11097  484 
* Pure: more robust selection of calculational rules; 
485 

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

488 

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

490 
lemmas, using the graph browser tool; 

491 

10944  492 
* Pure: predict failure of "show" in interactive mode; 
493 

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

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

495 

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

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

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

498 

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

502 

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

505 
the result to be shown in each case; 

506 

10770  507 
* HOL: added 'recdef_tc' command; 
508 

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

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

510 

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

511 

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

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

513 

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

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

515 
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

516 
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

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

519 

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

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

523 

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

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

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

528 
literature; 

529 

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

533 

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

536 

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

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

538 
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

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

540 

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

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

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

543 

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

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

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

546 

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

549 
functions for the reals; 

10756  550 

11094  551 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  552 

10858  553 

10474  554 
*** CTT *** 
555 

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

10474  558 

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

561 

10474  562 

10391  563 
*** General *** 
564 

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

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

568 
the Isabelle inference kernel has been greatly improved; 

569 

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

572 

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

575 

11124  576 
* system: support Poly/ML 4.0; 
577 

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

579 

10391  580 

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

581 

10103  582 
New in Isabelle991 (October 2000) 
583 
 

8015  584 

10003  585 
*** Overview of INCOMPATIBILITIES *** 
8014  586 

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

589 
issue the following ML commands: 

590 

591 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

592 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  593 

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

10003  596 

597 
* HOL: nat_less_induct renamed to less_induct; 

598 

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

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

8967  601 

10003  602 
select_equality > some_equality 
603 
select_eq_Ex > some_eq_ex 

604 
selectI2EX > someI2_ex 

605 
selectI2 > someI2 

606 
selectI > someI 

607 
select1_equality > some1_equality 

608 
Eps_sym_eq > some_sym_eq_trivial 

609 
Eps_eq > some_eq_trivial 

610 

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

612 

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

614 
instead); 

615 

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

617 
f.simps instead of f.rules; 

618 

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

620 

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

622 
sometimes be needed; 

623 

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

8014  625 

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

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

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

629 
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

630 
now "<*lex*>" instead of "**"; 
8705  631 

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

9971  634 

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

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

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

637 

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

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

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

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

641 

8848  642 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
643 

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

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

645 
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

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

647 

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

9908  650 

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

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

653 

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

9542  656 

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

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

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

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

661 

9612  662 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
663 

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

664 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  665 

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

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

668 

8014  669 

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

671 

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

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

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

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

676 

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

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

679 

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

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

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

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

683 

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

8566  687 

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

689 

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

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

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

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

693 

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

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

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

697 

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

698 

8184  699 
*** Isar *** 
700 

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

703 
accommodates incremental typeinference very nicely; 

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

704 

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

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

707 

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

710 
useful to collect intermediate results without explicit name 

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

712 
premises; 

8184  713 

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

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

717 
to theorems as "tags"; 

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

718 

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

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

721 

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

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

724 

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

726 

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

729 

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

732 
with the version in Provers/classical; 

9612  733 

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

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

736 

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

739 

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

9612  742 

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

744 
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

745 
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

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

747 

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

750 

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

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

753 
well (including splits); 

754 

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

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

757 

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

759 
of Simplifier and Classical reasoner); 

760 

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

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

763 
recdef) support case names and properly name parameters; 

9612  764 

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

767 
calculations; 

768 

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

770 
method anyway; 

771 

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

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

774 
foo.split foo.split_asm for each datatype; 

775 

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

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

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

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

780 

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

782 

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

784 

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

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

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

787 
proof states; 
8487  788 

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

8487  792 

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

796 
(for HOL datatypes); 

8534  797 

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

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

801 

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

803 

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

806 
(print_commands, print_methods etc.); 

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

807 

10003  808 
* Isar: added 'nothing'  the empty list of theorems; 
9239  809 

8184  810 

8014  811 
*** HOL *** 
812 

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

815 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

819 

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

8014  822 

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

823 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  824 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
825 
Rasmussen; 

8570  826 

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

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

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

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

830 
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

831 
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

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

833 

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

9542  836 

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

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

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

839 

10003  840 
* HOL/Lambda: converted into newstyle theory and document; 
9542  841 

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

844 
representation; very useful in avoiding lifting of operations; 

8848  845 

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

848 
well; admit "r" as field name; 

9542  849 

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

852 

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

854 
Types nat and int belong to this axclass; 

855 

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

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

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

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

8736  863 

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

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

9835  867 

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

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

871 

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

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

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

8603  877 

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

880 
termination conditions are proved automatically, these simplification 

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

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

883 
each equation; 

884 

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

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

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

887 
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

888 
invariant proof rule for while is applied. 
9457  889 

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

8925  892 

8848  893 
* HOL: theorems impI, allI, ballI bound as "strip"; 
894 

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

898 

10003  899 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  900 

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

8626  903 

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

906 

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

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

910 
bogus); 

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

911 

8412  912 

9542  913 
*** ZF *** 
914 

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

9542  917 

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

920 
making the algebraic laws unconditional; 

9542  921 

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

9542  924 

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

9542  927 

10003  928 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
929 
simplification; 

9388  930 

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

9388  933 

934 

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

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

936 

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

939 

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

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

942 

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

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

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

945 

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

948 
use instead the strong form, 

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

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

951 
from destructrules; 

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

952 

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

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

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

955 

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

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

957 

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

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

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

960 

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

963 
situations; 

964 

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

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

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

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

968 

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

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

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

971 

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

972 
* system: provide TAGS file for Isabelle sources; 
9052  973 

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

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

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

976 

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

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

978 
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

979 

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

982 

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

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

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

985 

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

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

988 

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

989 

8015  990 

7986  991 
New in Isabelle99 (October 1999) 
992 
 

4649  993 

5931  994 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
995 

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

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

7215  999 

1000 
Delcongs [if_weak_cong]; 

6922  1001 

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

5931  1004 

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

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

1009 

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

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

1011 
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

1012 

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

6057  1015 

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

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

6141  1019 

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

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

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

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

1026 
mk_solver: string > (thm list > int > tactic) > solver 
7619  1027 
where the string argument is only a comment. 
6057  1028 

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

1029 

6069  1030 
*** Proof tools *** 
1031 

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

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

6069  1036 

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

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

1040 
matching. 

6069  1041 

7593  1042 

6014  1043 
*** General *** 
1044 

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

1048 
readable proof documents (Isar == Intelligible semiautomated 

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

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

1051 

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

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

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

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

7215  1057 

7252  1058 
* native support for Proof General, both for classic Isabelle and 
7986  1059 
Isabelle/Isar; 
7215  1060 

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

1063 

6751  1064 
* Isabelle manuals now also available as PDF; 
1065 

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

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

6449  1071 

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

1074 

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

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

1077 

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

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

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

1081 

7215  1082 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
1083 

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

5973  1086 

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

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

1089 

6343  1090 
* new print_mode "HTML"; 
1091 

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

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

1094 

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

1097 

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

1099 
244c244 

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

1101 
 

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

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

1106 
 

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

1108 

7450  1109 
* function bind_thms stores lists of theorems (cf. bind_thm); 
1110 

7593  1111 
* new shorthand tactics ftac, eatac, datac, fatac; 
1112 

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

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

7593  1116 

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

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

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

1119 

6028  1120 

6057  1121 
*** HOL *** 
1122 

7215  1123 
** HOL arithmetic ** 
1124 

6343  1125 
* There are now decision procedures for linear arithmetic over nat and 
1126 
int: 

6131  1127 

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

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

1131 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  1136 

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

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

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

1141 
simplifier. 

6131  1142 

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

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

6028  1146 

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

1151 
type constraints; 

1152 

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

1154 
arguments; 

7157  1155 

7215  1156 
* many properties of integer multiplication, division and remainder 
1157 
are now available; 

6922  1158 

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

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

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

1163 
invocation of the underlying oracle). For SVC see 

7444  1164 
http://verify.stanford.edu/SVC 
6922  1165 

7125  1166 
* IsaMakefile: the HOLReal target now builds an actual image; 
1167 

7215  1168 

1169 
** HOL misc ** 

1170 

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

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

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

1173 

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

1176 

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

1179 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

1180 
changed syntax and (many) tactics; 

1181 

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

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

1185 
"mono" attribute); 

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

1186 

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

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

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

1189 

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

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

1191 

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

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

7326  1196 

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

1198 
Delsimprocs [record_simproc] 

1199 

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

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

1201 
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

1202 

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

1205 

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

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

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

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

6563  1210 

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

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

1214 

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

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

1216 
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

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

1218 

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

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

1220 
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

1221 

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

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

1223 
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

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

1225 

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

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

1230 

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

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

1232 
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

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

1234 

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

7492  1237 

7215  1238 

7113  1239 
*** LK *** 
1240 

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

7113  1243 

1244 
* the simplifier is now installed 

1245 

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

1246 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  1247 

1248 
* the classical reasoner now has a default rule database 

1249 

1250 

6064  1251 
*** ZF *** 
1252 

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

6269  1254 
directly (as in HOL) over datatypes and the natural numbers; 
6064  1255 

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

6064  1258 

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

1260 

6141  1261 
* simplification automatically does freeness reasoning for datatype 
6269  1262 
constructors; 
6141  1263 

6269  1264 
* automatic typeinference, with AddTCs command to insert new 
1265 
typechecking rules; 

6155  1266 

6269  1267 
* datatype introduction rules are now added as Safe Introduction rules 
1268 
to the claset; 

6155  1269 

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

1272 

6069  1273 

6343  1274 
*** Internal programming interfaces *** 
1275 

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

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

1277 

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

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

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

1280 

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

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

1282 

6343  1283 
* tuned current_goals_markers semantics: begin / end goal avoids 
1284 
printing empty lines; 

1285 

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

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

1288 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

1290 

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

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

1293 
mode to get Isabelle font glyphs as before; 

1294 

1295 
* refined token_translation interface; INCOMPATIBILITY: output length 

1296 
now of type real instead of int; 

1297 

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

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

1301 
opposed to intratheory data slots offered via TheoryDataFun; 

1302 

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

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

1304 
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

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

1308 

6343  1309 

6064  1310 

5781  1311 
New in Isabelle981 (October 1998) 
1312 
 

1313 

5127  1314 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  1315 

5726  1316 
* several changes of automated proof tools; 
5373  1317 

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

5214  1320 

5726  1321 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  1322 
called `inj_on'; 
5160  1323 

5275  1324 
* HOL: removed duplicate thms in Arith: 
1325 
less_imp_add_less should be replaced by trans_less_add1 

1326 
le_imp_add_le should be replaced by trans_le_add1 

5160  1327 

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

5490  1330 

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

1333 
now taken as an integer constant. 

5541  1334 

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

1336 

5363  1337 

5127  1338 
*** Proof tools *** 
4880  1339 

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

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

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

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

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

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

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

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

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

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

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

1352 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

1355 
one (emitting a warning). 

4824  1356 
type wrapper = (int > tactic) > (int > tactic) 
4649  1357 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  1358 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
1359 
delWrapper, delSWrapper: claset * string > claset 

4649  1360 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
1361 

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

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

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

1366 
by Force_tac; 

5524  1367 

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

5524  1370 

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

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

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

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

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

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

1379 
split_all_tac for record fields. 

5127  1380 

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

1383 
Addsimps. They can be removed via Delsplits just like 

1384 
Delsimps. Lowercase versions are also available. 

5127  1385 

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

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

1389 
either remove split_if completely from the default simpset by 

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

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

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

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

1394 
t is the name of the datatype). 

5127  1395 

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

5726  1399 
aimed to solve the given subgoal completely. 
5127  1400 

1401 

1402 
*** General *** 

1403 

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

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

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

4842  1410 

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

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