author  paulson 
Fri, 25 Jan 2002 15:42:59 +0100  
changeset 12850  d3c16021e999 
parent 12837  74ce01905e57 
child 12853  de505273c971 
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 

12850  303 
* Many new theorems about lists, ordinals, etc.; 
304 

11474  305 

306 
*** General *** 

307 

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

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

311 
also ref manual for further ML interfaces; 

312 

313 
* Pure/axclass: removed obsolete ML interface 

314 
goal_subclass/goal_arity; 

315 

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

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

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

319 
properly; 

320 

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

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

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

323 

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

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

325 
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

326 
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

327 
type variable); 
12280  328 

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

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

331 
"type_brackets"; 

332 

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

11817  334 
tokens into AST constants; 
11474  335 

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

338 
multiple declarations for same syntax element constant; 

339 

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

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

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

342 

12280  343 
* Provers/classical: renamed addaltern to addafter, addSaltern to 
344 
addSafter; 

345 

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

347 
as well; 

12253  348 

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

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

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

353 
support requires further installations, e.g. from 

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

355 

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

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

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

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

360 

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

363 

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

366 
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

367 

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

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

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

11551  373 

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

376 
isolatin characters may now be used; the related isatools 

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

378 

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

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

381 
terminal); 

382 

11314  383 

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

384 

11062  385 
New in Isabelle992 (February 2001) 
386 
 

387 

10224  388 
*** Overview of INCOMPATIBILITIES *** 
389 

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

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

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

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

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

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

398 

10998  399 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
400 
gfp_Tarski to gfp_unfold; 

10224  401 

10288  402 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
403 

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

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

10793  407 

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

410 

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

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

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

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

416 
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

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

418 

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

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

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

421 

10224  422 

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

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

424 

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

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

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

429 
typewriter); 

430 

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

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

432 
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

433 

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

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

439 
definitions); 

440 

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

443 
actual humanreadable proof documents. Please do not include goal 

444 
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

445 

11062  446 
* proper indentation of antiquoted output with proportional LaTeX 
447 
fonts; 

10862  448 

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

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

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

451 

11062  452 
* isatool unsymbolize tunes sources for plain ASCII communication; 
453 

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

454 

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

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

456 

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

459 
documents, due to unpredictable outcome and noncompositional proof 

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

461 
for Prologstyle synthesis of proven results; 

462 

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

465 

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

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

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

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

470 

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

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

473 

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

475 
statements as well; 

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

476 

11097  477 
* Pure: more robust selection of calculational rules; 
478 

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

481 

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

483 
lemmas, using the graph browser tool; 

484 

10944  485 
* Pure: predict failure of "show" in interactive mode; 
486 

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

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

488 

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

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

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

491 

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

495 

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

498 
the result to be shown in each case; 

499 

10770  500 
* HOL: added 'recdef_tc' command; 
501 

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

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

503 

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

504 

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

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

506 

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

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

508 
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

509 
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

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

512 

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

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

516 

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

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

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

521 
literature; 

522 

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

526 

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

529 

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

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

531 
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

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

533 

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

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

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

536 

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

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

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

539 

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

542 
functions for the reals; 

10756  543 

11094  544 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  545 

10858  546 

10474  547 
*** CTT *** 
548 

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

10474  551 

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

554 

10474  555 

10391  556 
*** General *** 
557 

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

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

561 
the Isabelle inference kernel has been greatly improved; 

562 

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

565 

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

568 

11124  569 
* system: support Poly/ML 4.0; 
570 

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

572 

10391  573 

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

574 

10103  575 
New in Isabelle991 (October 2000) 
576 
 

8015  577 

10003  578 
*** Overview of INCOMPATIBILITIES *** 
8014  579 

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

582 
issue the following ML commands: 

583 

584 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

585 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  586 

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

10003  589 

590 
* HOL: nat_less_induct renamed to less_induct; 

591 

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

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

8967  594 

10003  595 
select_equality > some_equality 
596 
select_eq_Ex > some_eq_ex 

597 
selectI2EX > someI2_ex 

598 
selectI2 > someI2 

599 
selectI > someI 

600 
select1_equality > some1_equality 

601 
Eps_sym_eq > some_sym_eq_trivial 

602 
Eps_eq > some_eq_trivial 

603 

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

605 

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

607 
instead); 

608 

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

610 
f.simps instead of f.rules; 

611 

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

613 

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

615 
sometimes be needed; 

616 

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

8014  618 

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

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

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

622 
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

623 
now "<*lex*>" instead of "**"; 
8705  624 

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

9971  627 

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

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

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

630 

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

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

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

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

634 

8848  635 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
636 

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

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

638 
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

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

640 

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

9908  643 

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

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

646 

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

9542  649 

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

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

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

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

654 

9612  655 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
656 

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

657 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  658 

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

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

661 

8014  662 

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

664 

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

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

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

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

669 

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

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

672 

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

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

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

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

676 

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

8566  680 

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

682 

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

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

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

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

686 

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

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

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

690 

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

691 

8184  692 
*** Isar *** 
693 

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

696 
accommodates incremental typeinference very nicely; 

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

697 

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

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

700 

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

703 
useful to collect intermediate results without explicit name 

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

705 
premises; 

8184  706 

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

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

710 
to theorems as "tags"; 

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

711 

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

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

714 

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

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

717 

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

719 

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

722 

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

725 
with the version in Provers/classical; 

9612  726 

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

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

729 

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

732 

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

9612  735 

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

737 
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

738 
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

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

740 

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

743 

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

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

746 
well (including splits); 

747 

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

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

750 

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

752 
of Simplifier and Classical reasoner); 

753 

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

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

756 
recdef) support case names and properly name parameters; 

9612  757 

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

760 
calculations; 

761 

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

763 
method anyway; 

764 

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

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

767 
foo.split foo.split_asm for each datatype; 

768 

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

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

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

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

773 

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

775 

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

777 

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

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

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

780 
proof states; 
8487  781 

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

8487  785 

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

789 
(for HOL datatypes); 

8534  790 

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

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

794 

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

796 

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

799 
(print_commands, print_methods etc.); 

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

800 

10003  801 
* Isar: added 'nothing'  the empty list of theorems; 
9239  802 

8184  803 

8014  804 
*** HOL *** 
805 

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

808 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

812 

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

8014  815 

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

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

8570  819 

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

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

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

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

823 
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

824 
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

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

826 

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

9542  829 

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

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

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

832 

10003  833 
* HOL/Lambda: converted into newstyle theory and document; 
9542  834 

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

837 
representation; very useful in avoiding lifting of operations; 

8848  838 

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

841 
well; admit "r" as field name; 

9542  842 

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

845 

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

847 
Types nat and int belong to this axclass; 

848 

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

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

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

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

8736  856 

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

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

9835  860 

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

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

864 

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

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

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

8603  870 

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

873 
termination conditions are proved automatically, these simplification 

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

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

876 
each equation; 

877 

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

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

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

880 
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

881 
invariant proof rule for while is applied. 
9457  882 

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

8925  885 

8848  886 
* HOL: theorems impI, allI, ballI bound as "strip"; 
887 

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

891 

10003  892 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  893 

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

8626  896 

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

899 

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

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

903 
bogus); 

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

904 

8412  905 

9542  906 
*** ZF *** 
907 

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

9542  910 

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

913 
making the algebraic laws unconditional; 

9542  914 

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

9542  917 

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

9542  920 

10003  921 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
922 
simplification; 

9388  923 

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

9388  926 

927 

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

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

929 

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

932 

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

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

935 

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

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

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

938 

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

941 
use instead the strong form, 

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

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

944 
from destructrules; 

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

945 

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

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

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

948 

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

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

950 

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

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

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

953 

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

956 
situations; 

957 

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

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

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

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

961 

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

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

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

964 

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

965 
* system: provide TAGS file for Isabelle sources; 
9052  966 

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

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

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

969 

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

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

971 
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

972 

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

975 

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

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

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

978 

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

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

981 

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

982 

8015  983 

7986  984 
New in Isabelle99 (October 1999) 
985 
 

4649  986 

5931  987 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
988 

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

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

7215  992 

993 
Delcongs [if_weak_cong]; 

6922  994 

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

5931  997 

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

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

1002 

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

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

1004 
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

1005 

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

6057  1008 

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

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

6141  1012 

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

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

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

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

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

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

1022 

6069  1023 
*** Proof tools *** 
1024 

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

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

6069  1029 

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

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

1033 
matching. 

6069  1034 

7593  1035 

6014  1036 
*** General *** 
1037 

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

1041 
readable proof documents (Isar == Intelligible semiautomated 

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

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

1044 

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

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

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

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

7215  1050 

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

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

1056 

6751  1057 
* Isabelle manuals now also available as PDF; 
1058 

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

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

6449  1064 

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

1067 

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

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

1070 

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

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

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

1074 

7215  1075 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
1076 

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

5973  1079 

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

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

1082 

6343  1083 
* new print_mode "HTML"; 
1084 

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

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

1087 

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

1090 

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

1092 
244c244 

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

1094 
 

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

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

1099 
 

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

1101 

7450  1102 
* function bind_thms stores lists of theorems (cf. bind_thm); 
1103 

7593  1104 
* new shorthand tactics ftac, eatac, datac, fatac; 
1105 

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

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

7593  1109 

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

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

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

1112 

6028  1113 

6057  1114 
*** HOL *** 
1115 

7215  1116 
** HOL arithmetic ** 
1117 

6343  1118 
* There are now decision procedures for linear arithmetic over nat and 
1119 
int: 

6131  1120 

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

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

1124 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  1129 

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

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

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

1134 
simplifier. 

6131  1135 

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

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

6028  1139 

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

1144 
type constraints; 

1145 

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

1147 
arguments; 

7157  1148 

7215  1149 
* many properties of integer multiplication, division and remainder 
1150 
are now available; 

6922  1151 

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

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

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

1156 
invocation of the underlying oracle). For SVC see 

7444  1157 
http://verify.stanford.edu/SVC 
6922  1158 

7125  1159 
* IsaMakefile: the HOLReal target now builds an actual image; 
1160 

7215  1161 

1162 
** HOL misc ** 

1163 

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

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

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

1166 

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

1169 

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

1172 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

1173 
changed syntax and (many) tactics; 

1174 

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

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

1178 
"mono" attribute); 

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

1179 

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

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

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

1182 

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

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

1184 

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

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

7326  1189 

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

1191 
Delsimprocs [record_simproc] 

1192 

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

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

1194 
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

1195 

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

1198 

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

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

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

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

6563  1203 

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

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

1207 

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

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

1209 
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

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

1211 

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

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

1213 
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

1214 

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

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

1216 
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

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

1218 

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

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

1223 

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

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

1225 
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

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

1227 

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

7492  1230 

7215  1231 

7113  1232 
*** LK *** 
1233 

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

7113  1236 

1237 
* the simplifier is now installed 

1238 

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

1239 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  1240 

1241 
* the classical reasoner now has a default rule database 

1242 

1243 

6064  1244 
*** ZF *** 
1245 

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

6269  1247 
directly (as in HOL) over datatypes and the natural numbers; 
6064  1248 

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

6064  1251 

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

1253 

6141  1254 
* simplification automatically does freeness reasoning for datatype 
6269  1255 
constructors; 
6141  1256 

6269  1257 
* automatic typeinference, with AddTCs command to insert new 
1258 
typechecking rules; 

6155  1259 

6269  1260 
* datatype introduction rules are now added as Safe Introduction rules 
1261 
to the claset; 

6155  1262 

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

1265 

6069  1266 

6343  1267 
*** Internal programming interfaces *** 
1268 

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

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

1270 

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

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

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

1273 

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

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

1275 

6343  1276 
* tuned current_goals_markers semantics: begin / end goal avoids 
1277 
printing empty lines; 

1278 

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

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

1281 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

1283 

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

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

1286 
mode to get Isabelle font glyphs as before; 

1287 

1288 
* refined token_translation interface; INCOMPATIBILITY: output length 

1289 
now of type real instead of int; 

1290 

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

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

1294 
opposed to intratheory data slots offered via TheoryDataFun; 

1295 

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

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

1297 
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

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

1301 

6343  1302 

6064  1303 

5781  1304 
New in Isabelle981 (October 1998) 
1305 
 

1306 

5127  1307 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  1308 

5726  1309 
* several changes of automated proof tools; 
5373  1310 

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

5214  1313 

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

5275  1317 
* HOL: removed duplicate thms in Arith: 
1318 
less_imp_add_less should be replaced by trans_less_add1 

1319 
le_imp_add_le should be replaced by trans_le_add1 

5160  1320 

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

5490  1323 

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

1326 
now taken as an integer constant. 

5541  1327 

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

1329 

5363  1330 

5127  1331 
*** Proof tools *** 
4880  1332 

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

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

1334 
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

1335 
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

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

1337 
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

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

1339 
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

1340 
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

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

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

1345 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

1348 
one (emitting a warning). 

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

4649  1353 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
1354 

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

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

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

1359 
by Force_tac; 

5524  1360 

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

5524  1363 

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

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

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

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

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

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

1372 
split_all_tac for record fields. 

5127  1373 

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

1376 
Addsimps. They can be removed via Delsplits just like 

1377 
Delsimps. Lowercase versions are also available. 

5127  1378 

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

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

1382 
either remove split_if completely from the default simpset by 

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

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

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

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

1387 
t is the name of the datatype). 

5127  1388 

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

5726  1392 
aimed to solve the given subgoal completely. 
5127  1393 

1394 

1395 
*** General *** 

1396 

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

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

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

4842  1403 

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

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

1409 

5127  1410 
* new theory section 'nonterminals' for purely syntactic types; 
4858  1411 

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

4869  1414 

5131  1415 
* the distribution now includes Isabelle icons: see 
1416 