author  wenzelm 
Wed, 23 Jan 2002 16:57:33 +0100  
changeset 12837  74ce01905e57 
parent 12832  c31b44286a8a 
child 12850  d3c16021e999 
permissions  rwrr 
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

1 

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

2553  4 

12724  5 
New in Isabelle2002 (January 2002) 
6 
 

11474  7 

11572  8 
*** Document preparation *** 
9 

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

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

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

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

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

14 

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

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

16 
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

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

18 

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

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

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

21 

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

24 

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

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

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

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

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

33 
isatool document copies the Isabelle style files to the target 

34 
location; 

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

35 

11572  36 

11633  37 
*** Isar *** 
38 

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

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

42 
 'induct' method divinates rule instantiation from the inductive 

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

44 
instantiation of cases; 

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

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

47 
rules without further ado; 

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

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

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

51 
statement becomes is included in the hypothesis, avoiding the 

52 
slightly cumbersome show "PROP ?case" form; 

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

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

55 
rules stemming from inductive sets to be applied in unstructured 

56 
scripts, while still benefitting from proper handling of nonatomic 

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

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

59 
 'induct' proper support for mutual induction involving nonatomic 

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

61 
below); 

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

62 
 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

63 
 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

64 
 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

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

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

67 
 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

68 

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

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

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

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

72 
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

73 
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

74 
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

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

76 

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

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

78 

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

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

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

81 

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

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

83 
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

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

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

87 

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

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

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

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

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

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

93 

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

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

95 
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

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

97 

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

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

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

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

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

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

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

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

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

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

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

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

115 

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

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

117 
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

118 
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

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

120 

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

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

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

123 

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

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

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

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

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

128 

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

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

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

131 

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

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

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

134 
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

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

136 
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

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

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

139 

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

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

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

142 

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

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

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

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

146 

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

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

148 

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

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

154 

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

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

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

157 

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

158 

11474  159 
*** HOL *** 
160 

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

163 

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

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

166 

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

168 
binary representation internally; 

169 

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

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

172 

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

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

174 
are some hints on converting existing sources: 
11702  175 

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

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

178 
to be spaced properly; 

179 

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

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

182 

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

184 

185 
 remove all special provisions on numerals in proofs; 

186 

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

189 

12736  190 
* HOL: symbolic syntax for x^2 (numeral 2); 
191 

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

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

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

194 
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

195 
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

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

197 

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

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

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

202 
declared as simp by default; 

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

203 
 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

204 
qualified)  potential INCOMPATIBILITY; 
12280  205 
 removed "make_scheme" operations (use "make" with "extend")  
206 
INCOMPATIBILITY; 

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

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

213 

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

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

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

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

218 

11657  219 
* HOL: linorder_less_split superseded by linorder_cases; 
220 

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

11437  223 

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

226 

227 
delSWrapper "split_all_tac" 

228 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

229 

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

11474  231 
MAY FAIL; 
11361  232 

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

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

236 
necessary to attach explicit type constraints; 

11307  237 

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

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

241 

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

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

243 
expressions; 
11474  244 

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

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

246 
of "lam"  INCOMPATIBILITY; 
11474  247 

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

250 
renamed "Product_Type.unit"; 

11611  251 

12564  252 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
253 

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

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

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

256 

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

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

258 
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

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

260 

12734  261 
* HOLReal: added Complex_Numbers (by Gertrud Bauer); 
262 

12690  263 
* HOLHyperreal is now a logic image; 
264 

11611  265 

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

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

267 

12622  268 
* Isar: consts/constdefs supports mixfix syntax for continuous 
269 
operations; 

270 

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

272 
HOLCF/ex/Dnat.thy; 

273 

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

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

277 

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

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

279 

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

280 

11474  281 
*** ZF *** 
282 

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

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

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

287 

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

289 
your theory on Main_ZFC; 

290 

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

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

12563  293 

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

296 

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

298 

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

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

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

302 

11474  303 

304 
*** General *** 

305 

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

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

309 
also ref manual for further ML interfaces; 

310 

311 
* Pure/axclass: removed obsolete ML interface 

312 
goal_subclass/goal_arity; 

313 

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

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

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

317 
properly; 

318 

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

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

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

321 

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

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

323 
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

324 
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

325 
type variable); 
12280  326 

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

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

329 
"type_brackets"; 

330 

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

11817  332 
tokens into AST constants; 
11474  333 

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

336 
multiple declarations for same syntax element constant; 

337 

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

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

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

340 

12280  341 
* Provers/classical: renamed addaltern to addafter, addSaltern to 
342 
addSafter; 

343 

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

345 
as well; 

12253  346 

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

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

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

351 
support requires further installations, e.g. from 

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

353 

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

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

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

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

358 

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

361 

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

364 
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

365 

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

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

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

11551  371 

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

374 
isolatin characters may now be used; the related isatools 

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

376 

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

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

379 
terminal); 

380 

11314  381 

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

382 

11062  383 
New in Isabelle992 (February 2001) 
384 
 

385 

10224  386 
*** Overview of INCOMPATIBILITIES *** 
387 

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

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

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

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

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

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

396 

10998  397 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
398 
gfp_Tarski to gfp_unfold; 

10224  399 

10288  400 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
401 

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

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

10793  405 

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

408 

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

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

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

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

414 
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

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

416 

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

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

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

419 

10224  420 

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

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

422 

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

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

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

427 
typewriter); 

428 

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

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

430 
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

431 

10858  432 
* some more standard symbols; see Appendix A of the system manual for 
11062  433 
the complete list of symbols defined in isabellesym.sty; 
10858  434 

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

437 
definitions); 

438 

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

441 
actual humanreadable proof documents. Please do not include goal 

442 
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

443 

11062  444 
* proper indentation of antiquoted output with proportional LaTeX 
445 
fonts; 

10862  446 

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

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

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

449 

11062  450 
* isatool unsymbolize tunes sources for plain ASCII communication; 
451 

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

452 

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

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

454 

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

457 
documents, due to unpredictable outcome and noncompositional proof 

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

459 
for Prologstyle synthesis of proven results; 

460 

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

463 

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

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

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

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

468 

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

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

471 

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

473 
statements as well; 

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

474 

11097  475 
* Pure: more robust selection of calculational rules; 
476 

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

479 

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

481 
lemmas, using the graph browser tool; 

482 

10944  483 
* Pure: predict failure of "show" in interactive mode; 
484 

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

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

486 

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

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

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

489 

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

493 

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

496 
the result to be shown in each case; 

497 

10770  498 
* HOL: added 'recdef_tc' command; 
499 

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

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

501 

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

502 

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

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

504 

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

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

506 
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

507 
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

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

510 

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

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

514 

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

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

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

519 
literature; 

520 

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

524 

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

527 

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

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

529 
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

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

531 

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

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

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

534 

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

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

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

537 

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

540 
functions for the reals; 

10756  541 

11094  542 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  543 

10858  544 

10474  545 
*** CTT *** 
546 

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

10474  549 

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

552 

10474  553 

10391  554 
*** General *** 
555 

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

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

559 
the Isabelle inference kernel has been greatly improved; 

560 

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

563 

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

566 

11124  567 
* system: support Poly/ML 4.0; 
568 

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

570 

10391  571 

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

572 

10103  573 
New in Isabelle991 (October 2000) 
574 
 

8015  575 

10003  576 
*** Overview of INCOMPATIBILITIES *** 
8014  577 

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

580 
issue the following ML commands: 

581 

582 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

583 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  584 

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

10003  587 

588 
* HOL: nat_less_induct renamed to less_induct; 

589 

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

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

8967  592 

10003  593 
select_equality > some_equality 
594 
select_eq_Ex > some_eq_ex 

595 
selectI2EX > someI2_ex 

596 
selectI2 > someI2 

597 
selectI > someI 

598 
select1_equality > some1_equality 

599 
Eps_sym_eq > some_sym_eq_trivial 

600 
Eps_eq > some_eq_trivial 

601 

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

603 

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

605 
instead); 

606 

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

608 
f.simps instead of f.rules; 

609 

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

611 

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

613 
sometimes be needed; 

614 

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

8014  616 

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

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

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

620 
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

621 
now "<*lex*>" instead of "**"; 
8705  622 

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

9971  625 

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

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

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

628 

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

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

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

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

632 

8848  633 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
634 

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

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

636 
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

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

638 

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

9908  641 

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

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

644 

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

9542  647 

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

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

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

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

652 

9612  653 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
654 

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

655 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  656 

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

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

659 

8014  660 

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

662 

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

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

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

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

667 

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

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

670 

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

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

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

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

674 

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

8566  678 

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

680 

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

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

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

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

684 

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

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

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

688 

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

689 

8184  690 
*** Isar *** 
691 

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

694 
accommodates incremental typeinference very nicely; 

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

695 

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

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

698 

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

701 
useful to collect intermediate results without explicit name 

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

703 
premises; 

8184  704 

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

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

708 
to theorems as "tags"; 

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

709 

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

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

712 

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

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

715 

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

717 

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

720 

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

723 
with the version in Provers/classical; 

9612  724 

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

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

727 

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

730 

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

9612  733 

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

735 
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

736 
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

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

738 

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

741 

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

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

744 
well (including splits); 

745 

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

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

748 

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

750 
of Simplifier and Classical reasoner); 

751 

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

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

754 
recdef) support case names and properly name parameters; 

9612  755 

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

758 
calculations; 

759 

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

761 
method anyway; 

762 

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

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

765 
foo.split foo.split_asm for each datatype; 

766 

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

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

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

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

771 

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

773 

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

775 

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

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

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

778 
proof states; 
8487  779 

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

8487  783 

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

787 
(for HOL datatypes); 

8534  788 

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

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

792 

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

794 

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

797 
(print_commands, print_methods etc.); 

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

798 

10003  799 
* Isar: added 'nothing'  the empty list of theorems; 
9239  800 

8184  801 

8014  802 
*** HOL *** 
803 

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

806 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

810 

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

8014  813 

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

814 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  815 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
816 
Rasmussen; 

8570  817 

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

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

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

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

821 
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

822 
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

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

824 

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

9542  827 

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

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

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

830 

10003  831 
* HOL/Lambda: converted into newstyle theory and document; 
9542  832 

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

835 
representation; very useful in avoiding lifting of operations; 

8848  836 

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

839 
well; admit "r" as field name; 

9542  840 

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

843 

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

845 
Types nat and int belong to this axclass; 

846 

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

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

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

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

8736  854 

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

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

9835  858 

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

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

862 

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

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

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

8603  868 

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

871 
termination conditions are proved automatically, these simplification 

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

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

874 
each equation; 

875 

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

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

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

878 
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

879 
invariant proof rule for while is applied. 
9457  880 

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

8925  883 

8848  884 
* HOL: theorems impI, allI, ballI bound as "strip"; 
885 

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

889 

10003  890 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  891 

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

8626  894 

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

897 

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

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

901 
bogus); 

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

902 

8412  903 

9542  904 
*** ZF *** 
905 

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

9542  908 

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

911 
making the algebraic laws unconditional; 

9542  912 

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

9542  915 

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

9542  918 

10003  919 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
920 
simplification; 

9388  921 

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

9388  924 

925 

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

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

927 

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

930 

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

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

933 

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

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

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

936 

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

939 
use instead the strong form, 

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

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

942 
from destructrules; 

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

943 

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

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

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

946 

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

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

948 

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

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

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

951 

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

954 
situations; 

955 

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

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

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

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

959 

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

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

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

962 

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

963 
* system: provide TAGS file for Isabelle sources; 
9052  964 

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

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

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

967 

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

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

969 
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

970 

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

973 

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

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

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

976 

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

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

979 

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

980 

8015  981 

7986  982 
New in Isabelle99 (October 1999) 
983 
 

4649  984 

5931  985 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
986 

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

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

7215  990 

991 
Delcongs [if_weak_cong]; 

6922  992 

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

5931  995 

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

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

1000 

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

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

1002 
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

1003 

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

6057  1006 

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

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

6141  1010 

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

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

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

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

1017 
mk_solver: string > (thm list > int > tactic) > solver 
7619  1018 
where the string argument is only a comment. 
6057  1019 

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

1020 

6069  1021 
*** Proof tools *** 
1022 

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

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

6069  1027 

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

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

1031 
matching. 

6069  1032 

7593  1033 

6014  1034 
*** General *** 
1035 

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

1039 
readable proof documents (Isar == Intelligible semiautomated 

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

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

1042 

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

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

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

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

7215  1048 

7252  1049 
* native support for Proof General, both for classic Isabelle and 
7986  1050 
Isabelle/Isar; 
7215  1051 

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

1054 

6751  1055 
* Isabelle manuals now also available as PDF; 
1056 

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

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

6449  1062 

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

1065 

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

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

1068 

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

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

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

1072 

7215  1073 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
1074 

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

5973  1077 

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

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

1080 

6343  1081 
* new print_mode "HTML"; 
1082 

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

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

1085 

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

1088 

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

1090 
244c244 

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

1092 
 

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

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

1097 
 

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

1099 

7450  1100 
* function bind_thms stores lists of theorems (cf. bind_thm); 
1101 

7593  1102 
* new shorthand tactics ftac, eatac, datac, fatac; 
1103 

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

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

7593  1107 

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

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

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

1110 

6028  1111 

6057  1112 
*** HOL *** 
1113 

7215  1114 
** HOL arithmetic ** 
1115 

6343  1116 
* There are now decision procedures for linear arithmetic over nat and 
1117 
int: 

6131  1118 

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

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

1122 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  1127 

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

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

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

1132 
simplifier. 

6131  1133 

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

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

6028  1137 

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

1142 
type constraints; 

1143 

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

1145 
arguments; 

7157  1146 

7215  1147 
* many properties of integer multiplication, division and remainder 
1148 
are now available; 

6922  1149 

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

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

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

1154 
invocation of the underlying oracle). For SVC see 

7444  1155 
http://verify.stanford.edu/SVC 
6922  1156 

7125  1157 
* IsaMakefile: the HOLReal target now builds an actual image; 
1158 

7215  1159 

1160 
** HOL misc ** 

1161 

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

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

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

1164 

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

1167 

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

1170 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

1171 
changed syntax and (many) tactics; 

1172 

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

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

1176 
"mono" attribute); 

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

1177 

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

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

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

1180 

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

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

1182 

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

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

7326  1187 

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

1189 
Delsimprocs [record_simproc] 

1190 

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

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

1192 
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

1193 

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

1196 

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

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

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

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

6563  1201 

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

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

1205 

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

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

1207 
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

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

1209 

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

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

1211 
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

1212 

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

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

1214 
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

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

1216 

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

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

1221 

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

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

1223 
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

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

1225 

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

7492  1228 

7215  1229 

7113  1230 
*** LK *** 
1231 

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

7113  1234 

1235 
* the simplifier is now installed 

1236 

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

1237 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  1238 

1239 
* the classical reasoner now has a default rule database 

1240 

1241 

6064  1242 
*** ZF *** 
1243 

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

6269  1245 
directly (as in HOL) over datatypes and the natural numbers; 
6064  1246 

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

6064  1249 

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

1251 

6141  1252 
* simplification automatically does freeness reasoning for datatype 
6269  1253 
constructors; 
6141  1254 

6269  1255 
* automatic typeinference, with AddTCs command to insert new 
1256 
typechecking rules; 

6155  1257 

6269  1258 
* datatype introduction rules are now added as Safe Introduction rules 
1259 
to the claset; 

6155  1260 

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

1263 

6069  1264 

6343  1265 
*** Internal programming interfaces *** 
1266 

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

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

1268 

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

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

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

1271 

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

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

1273 

6343  1274 
* tuned current_goals_markers semantics: begin / end goal avoids 
1275 
printing empty lines; 

1276 

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

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

1279 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

1281 

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

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

1284 
mode to get Isabelle font glyphs as before; 

1285 

1286 
* refined token_translation interface; INCOMPATIBILITY: output length 

1287 
now of type real instead of int; 

1288 

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

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

1292 
opposed to intratheory data slots offered via TheoryDataFun; 

1293 

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

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

1295 
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

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

1299 

6343  1300 

6064  1301 

5781  1302 
New in Isabelle981 (October 1998) 
1303 
 

1304 

5127  1305 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  1306 

5726  1307 
* several changes of automated proof tools; 
5373  1308 

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

5214  1311 

5726  1312 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  1313 
called `inj_on'; 
5160  1314 

5275  1315 
* HOL: removed duplicate thms in Arith: 
1316 
less_imp_add_less should be replaced by trans_less_add1 

1317 
le_imp_add_le should be replaced by trans_le_add1 

5160  1318 

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

5490  1321 

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

1324 
now taken as an integer constant. 

5541  1325 

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

1327 

5363  1328 

5127  1329 
*** Proof tools *** 
4880  1330 

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

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

1332 
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

1333 
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

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

1335 
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

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

1337 
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

1338 
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

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

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

1343 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

1346 
one (emitting a warning). 

4824  1347 
type wrapper = (int > tactic) > (int > tactic) 
4649  1348 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  1349 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
1350 
delWrapper, delSWrapper: claset * string > claset 

4649  1351 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
1352 

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

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

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

1357 
by Force_tac; 

5524  1358 

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

5524  1361 

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

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

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

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

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

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

1370 
split_all_tac for record fields. 

5127  1371 

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

1374 
Addsimps. They can be removed via Delsplits just like 

1375 
Delsimps. Lowercase versions are also available. 

5127  1376 

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

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

1380 
either remove split_if completely from the default simpset by 

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

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

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

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

1385 
t is the name of the datatype). 

5127  1386 

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

5726  1390 
aimed to solve the given subgoal completely. 
5127  1391 

1392 

1393 
*** General *** 

1394 

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

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

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

4842  1401 

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

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

1407 

5127  1408 
* new theory section 'nonterminals' for purely syntactic types; 
4858  1409 

5127  1410 
* new theory section 'setup' for generic ML setup functions 
1411 
(e.g. package initialization); 

4869  1412 

5131  1413 
* the distribution now includes Isabelle icons: see 
1414 
lib/logo/isabelle{small,tiny}.xpm; 

1415 

5363 