author  wenzelm 
Tue, 11 Dec 2001 16:22:09 +0100  
changeset 12467  b5630a4ea5d8 
parent 12457  cbfc53e45476 
child 12472  3307149f1ec2 
permissions  rwrr 
11437  1 

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

2553  4 

11474  5 
New in Isabelle2001 (?? 2001) 
6 
 

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 / 
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset

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

31 

11572  32 

11633  33 
*** Isar *** 
34 

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

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

38 
 'induct' method divinates rule instantiation from the inductive 

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

40 
instantiation of cases; 

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

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

43 
rules without further ado; 

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

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

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

47 
statement becomes is included in the hypothesis, avoiding the 

48 
slightly cumbersome show "PROP ?case" form; 

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

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

51 
rules stemming from inductive sets to be applied in unstructured 

52 
scripts, while still benefitting from proper handling of nonatomic 

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

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

55 
 'induct' proper support for mutual induction involving nonatomic 

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

57 
below); 

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

58 
 removed obsolete "(simplified)" and "(stripped)" options of methods; 
4a622f5fb164
 'induct' may now use elimstyle induction rules without chaining
wenzelm
parents:
11986
diff
changeset

59 
 added 'print_induct_rules' (covered by help item in Proof General > 3.3); 
4a622f5fb164
 'induct' may now use elimstyle induction rules without chaining
wenzelm
parents:
11986
diff
changeset

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

61 
 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

62 

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

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

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

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

66 
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

67 
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

68 
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

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

70 

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

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

72 

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

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

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

75 

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

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

77 
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

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

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

81 

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

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

83 
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

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

85 

11722  86 
* Pure: renamed "antecedent" case to "rule_context"; 
87 

11738  88 
* Pure: added 'corollary' command; 
89 

11722  90 
* Pure: fixed 'token_translation' command; 
91 

11899  92 
* Pure: removed obsolete 'exported' attribute; 
93 

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

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

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

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

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

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

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

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

103 

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

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

105 
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

106 
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

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

108 

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

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

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

111 

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

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

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

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

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

116 

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

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

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

119 

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

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

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

122 
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

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

124 
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

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

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

127 

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

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

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

130 

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

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

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

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

134 

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

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

136 

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

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

142 

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

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

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

145 

12280  146 
* HOLCF: domain package adapted to newstyle theories, e.g. see 
147 
HOLCF/ex/Dnat.thy; 

148 

149 
* ZF: proper integration of logicspecific tools and packages, 

150 
including theory commands '(co)inductive', '(co)datatype', 

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

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

153 

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

154 

11474  155 
*** HOL *** 
156 

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

159 

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

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

162 

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

164 
binary representation internally; 

165 

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

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

168 

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

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

170 
are some hints on converting existing sources: 
11702  171 

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

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

174 
to be spaced properly; 

175 

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

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

178 

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

180 

181 
 remove all special provisions on numerals in proofs; 

182 

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

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

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

185 
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

186 
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

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

188 

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

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

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

193 
declared as simp by default; 

194 
 removed "make_scheme" operations (use "make" with "extend")  

195 
INCOMPATIBILITY; 

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

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

202 

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

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

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

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

207 

11657  208 
* HOL: linorder_less_split superseded by linorder_cases; 
209 

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

11437  212 

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

215 

216 
delSWrapper "split_all_tac" 

217 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

218 

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

11474  220 
MAY FAIL; 
11361  221 

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

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

225 
necessary to attach explicit type constraints; 

11307  226 

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

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

228 
expressions; 
11474  229 

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

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

231 
of "lam"  INCOMPATIBILITY; 
11474  232 

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

235 
renamed "Product_Type.unit"; 

11611  236 

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

237 
* HOL/GroupTheory: group theory examples including Sylow's theorem, by 
cbfc53e45476
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm
parents:
12405
diff
changeset

238 
Florian Kammüller; 
cbfc53e45476
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm
parents:
12405
diff
changeset

239 

11611  240 

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

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

242 

12280  243 
* proper rep_datatype lift (see theory Lift) instead of ML hacks  
244 
potential INCOMPATIBILITY; now use plain induct_tac instead of former 

245 
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

246 

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

247 

11474  248 
*** ZF *** 
249 

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

252 

253 
* ZF/Induct: new directory for examples of inductive definitions, 

254 
including theory Multiset for multiset orderings; 

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

255 

11474  256 
* ZF: the integer library now covers quotients and remainders, with 
257 
many laws relating division to addition, multiplication, etc.; 

258 

259 

260 
*** General *** 

261 

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

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

265 
also ref manual for further ML interfaces; 

266 

267 
* Pure/axclass: removed obsolete ML interface 

268 
goal_subclass/goal_arity; 

269 

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

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

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

273 
properly; 

274 

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

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

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

277 

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

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

279 
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

280 
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

281 
type variable); 
12280  282 

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

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

285 
"type_brackets"; 

286 

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

11817  288 
tokens into AST constants; 
11474  289 

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

292 
multiple declarations for same syntax element constant; 

293 

294 
* Provers/classical: renamed addaltern to addafter, addSaltern to 

295 
addSafter; 

296 

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

298 
as well; 

12253  299 

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

300 
* system: refrain from any attempt at filtering input streams; no 
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

301 
longer support ``8bit'' encoding of old isabelle font, instead proper 
12467
b5630a4ea5d8
isatools "symbolinput" and "nonascii" have disappeared;
wenzelm
parents:
12457
diff
changeset

302 
isolatin characters may now be used; the related isatools 
b5630a4ea5d8
isatools "symbolinput" and "nonascii" have disappeared;
wenzelm
parents:
12457
diff
changeset

303 
"symbolinput" and "nonascii" have disappeared as well; 
12106
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

304 

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

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

309 

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

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

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

11551  315 

11314  316 

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

317 

11062  318 
New in Isabelle992 (February 2001) 
319 
 

320 

10224  321 
*** Overview of INCOMPATIBILITIES *** 
322 

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

325 
bind them to ML identifers by e.g. val thm_name = thm "thm_name"; 

326 

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

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

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

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

331 

10998  332 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
333 
gfp_Tarski to gfp_unfold; 

10224  334 

10288  335 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
336 

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

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

10793  340 

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

343 

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

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

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

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

349 
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

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

351 

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

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

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

354 

10224  355 

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

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

357 

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

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

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

362 
typewriter); 

363 

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

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

365 
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

366 

10858  367 
* some more standard symbols; see Appendix A of the system manual for 
11062  368 
the complete list of symbols defined in isabellesym.sty; 
10858  369 

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

372 
definitions); 

373 

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

376 
actual humanreadable proof documents. Please do not include goal 

377 
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

378 

11062  379 
* proper indentation of antiquoted output with proportional LaTeX 
380 
fonts; 

10862  381 

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

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

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

384 

11062  385 
* isatool unsymbolize tunes sources for plain ASCII communication; 
386 

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

387 

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

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

389 

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

392 
documents, due to unpredictable outcome and noncompositional proof 

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

394 
for Prologstyle synthesis of proven results; 

395 

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

398 

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

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

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

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

403 

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

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

406 

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

408 
statements as well; 

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

409 

11097  410 
* Pure: more robust selection of calculational rules; 
411 

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

414 

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

416 
lemmas, using the graph browser tool; 

417 

10944  418 
* Pure: predict failure of "show" in interactive mode; 
419 

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

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

421 

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

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

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

424 

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

428 

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

431 
the result to be shown in each case; 

432 

10770  433 
* HOL: added 'recdef_tc' command; 
434 

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

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

436 

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

437 

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

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

439 

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

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

441 
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

442 
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

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

445 

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

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

449 

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

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

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

454 
literature; 

455 

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

459 

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

462 

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

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

464 
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

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

466 

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

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

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

469 

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

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

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

472 

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

475 
functions for the reals; 

10756  476 

11094  477 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  478 

10858  479 

10474  480 
*** CTT *** 
481 

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

10474  484 

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

487 

10474  488 

10391  489 
*** General *** 
490 

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

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

494 
the Isabelle inference kernel has been greatly improved; 

495 

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

498 

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

501 

11124  502 
* system: support Poly/ML 4.0; 
503 

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

505 

10391  506 

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

507 

10103  508 
New in Isabelle991 (October 2000) 
509 
 

8015  510 

10003  511 
*** Overview of INCOMPATIBILITIES *** 
8014  512 

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

515 
issue the following ML commands: 

516 

517 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

518 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  519 

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

10003  522 

523 
* HOL: nat_less_induct renamed to less_induct; 

524 

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

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

8967  527 

10003  528 
select_equality > some_equality 
529 
select_eq_Ex > some_eq_ex 

530 
selectI2EX > someI2_ex 

531 
selectI2 > someI2 

532 
selectI > someI 

533 
select1_equality > some1_equality 

534 
Eps_sym_eq > some_sym_eq_trivial 

535 
Eps_eq > some_eq_trivial 

536 

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

538 

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

540 
instead); 

541 

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

543 
f.simps instead of f.rules; 

544 

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

546 

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

548 
sometimes be needed; 

549 

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

8014  551 

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

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

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

555 
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

556 
now "<*lex*>" instead of "**"; 
8705  557 

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

9971  560 

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

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

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

563 

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

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

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

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

567 

8848  568 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
569 

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

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

571 
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

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

573 

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

9908  576 

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

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

579 

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

9542  582 

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

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

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

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

587 

9612  588 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
589 

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

590 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  591 

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

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

594 

8014  595 

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

597 

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

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

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

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

602 

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

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

605 

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

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

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

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

609 

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

8566  613 

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

615 

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

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

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

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

619 

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

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

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

623 

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

624 

8184  625 
*** Isar *** 
626 

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

629 
accommodates incremental typeinference very nicely; 

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

630 

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

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

633 

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

636 
useful to collect intermediate results without explicit name 

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

638 
premises; 

8184  639 

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

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

643 
to theorems as "tags"; 

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

644 

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

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

647 

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

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

650 

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

652 

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

655 

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

658 
with the version in Provers/classical; 

9612  659 

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

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

662 

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

665 

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

9612  668 

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

670 
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

671 
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

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

673 

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

676 

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

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

679 
well (including splits); 

680 

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

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

683 

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

685 
of Simplifier and Classical reasoner); 

686 

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

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

689 
recdef) support case names and properly name parameters; 

9612  690 

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

693 
calculations; 

694 

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

696 
method anyway; 

697 

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

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

700 
foo.split foo.split_asm for each datatype; 

701 

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

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

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

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

706 

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

708 

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

710 

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

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

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

713 
proof states; 
8487  714 

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

8487  718 

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

722 
(for HOL datatypes); 

8534  723 

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

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

727 

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

729 

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

732 
(print_commands, print_methods etc.); 

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

733 

10003  734 
* Isar: added 'nothing'  the empty list of theorems; 
9239  735 

8184  736 

8014  737 
*** HOL *** 
738 

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

741 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

745 

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

8014  748 

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

749 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  750 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
751 
Rasmussen; 

8570  752 

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

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

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

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

756 
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

757 
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

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

759 

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

9542  762 

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

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

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

765 

10003  766 
* HOL/Lambda: converted into newstyle theory and document; 
9542  767 

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

770 
representation; very useful in avoiding lifting of operations; 

8848  771 

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

774 
well; admit "r" as field name; 

9542  775 

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

778 

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

780 
Types nat and int belong to this axclass; 

781 

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

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

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

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

8736  789 

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

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

9835  793 

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

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

797 

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

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

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

8603  803 

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

806 
termination conditions are proved automatically, these simplification 

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

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

809 
each equation; 

810 

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

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

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

813 
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

814 
invariant proof rule for while is applied. 
9457  815 

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

8925  818 

8848  819 
* HOL: theorems impI, allI, ballI bound as "strip"; 
820 

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

824 

10003  825 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  826 

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

8626  829 

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

832 

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

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

836 
bogus); 

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

837 

8412  838 

9542  839 
*** ZF *** 
840 

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

9542  843 

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

846 
making the algebraic laws unconditional; 

9542  847 

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

9542  850 

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

9542  853 

10003  854 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
855 
simplification; 

9388  856 

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

9388  859 

860 

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

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

862 

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

865 

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

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

868 

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

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

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

871 

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

874 
use instead the strong form, 

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

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

877 
from destructrules; 

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

878 

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

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

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

881 

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

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

883 

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

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

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

886 

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

889 
situations; 

890 

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

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

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

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

894 

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

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

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

897 

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

898 
* system: provide TAGS file for Isabelle sources; 
9052  899 

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

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

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

902 

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

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

904 
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

905 

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

908 

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

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

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

911 

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

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

914 

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

915 

8015  916 

7986  917 
New in Isabelle99 (October 1999) 
918 
 

4649  919 

5931  920 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
921 

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

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

7215  925 

926 
Delcongs [if_weak_cong]; 

6922  927 

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

5931  930 

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

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

935 

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

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

937 
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

938 

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

6057  941 

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

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

6141  945 

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

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

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

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

952 
mk_solver: string > (thm list > int > tactic) > solver 
7619  953 
where the string argument is only a comment. 
6057  954 

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

955 

6069  956 
*** Proof tools *** 
957 

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

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

6069  962 

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

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

966 
matching. 

6069  967 

7593  968 

6014  969 
*** General *** 
970 

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

974 
readable proof documents (Isar == Intelligible semiautomated 

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

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

977 

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

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

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

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

7215  983 

7252  984 
* native support for Proof General, both for classic Isabelle and 
7986  985 
Isabelle/Isar; 
7215  986 

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

989 

6751  990 
* Isabelle manuals now also available as PDF; 
991 

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

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

6449  997 

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

1000 

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

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

1003 

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

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

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

1007 

7215  1008 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
1009 

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

5973  1012 

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

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

1015 

6343  1016 
* new print_mode "HTML"; 
1017 

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

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

1020 

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

1023 

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

1025 
244c244 

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

1027 
 

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

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

1032 
 

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

1034 

7450  1035 
* function bind_thms stores lists of theorems (cf. bind_thm); 
1036 

7593  1037 
* new shorthand tactics ftac, eatac, datac, fatac; 
1038 

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

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

7593  1042 

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

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

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

1045 

6028  1046 

6057  1047 
*** HOL *** 
1048 

7215  1049 
** HOL arithmetic ** 
1050 

6343  1051 
* There are now decision procedures for linear arithmetic over nat and 
1052 
int: 

6131  1053 

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

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

1057 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  1062 

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

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

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

1067 
simplifier. 

6131  1068 

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

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

6028  1072 

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

1077 
type constraints; 

1078 

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

1080 
arguments; 

7157  1081 

7215  1082 
* many properties of integer multiplication, division and remainder 
1083 
are now available; 

6922  1084 

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

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

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

1089 
invocation of the underlying oracle). For SVC see 

7444  1090 
http://verify.stanford.edu/SVC 
6922  1091 

7125  1092 
* IsaMakefile: the HOLReal target now builds an actual image; 
1093 

7215  1094 

1095 
** HOL misc ** 

1096 

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

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

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

1099 

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

1102 

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

1105 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

1106 
changed syntax and (many) tactics; 

1107 

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

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

1111 
"mono" attribute); 

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

1112 

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

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

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

1115 

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

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

1117 

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

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

7326  1122 

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

1124 
Delsimprocs [record_simproc] 

1125 

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

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

1127 
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

1128 

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

1131 

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

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

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

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

6563  1136 

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

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

1140 

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

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

1142 
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

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

1144 

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

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

1146 
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

1147 

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

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

1149 
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

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

1151 

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

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

1156 

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

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

1158 
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

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

1160 

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

7492  1163 

7215  1164 

7113  1165 
*** LK *** 
1166 

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

7113  1169 

1170 
* the simplifier is now installed 

1171 

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

1172 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  1173 

1174 
* the classical reasoner now has a default rule database 

1175 

1176 

6064  1177 
*** ZF *** 
1178 

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

6269  1180 
directly (as in HOL) over datatypes and the natural numbers; 
6064  1181 

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

6064  1184 

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

1186 

6141  1187 
* simplification automatically does freeness reasoning for datatype 
6269  1188 
constructors; 
6141  1189 

6269  1190 
* automatic typeinference, with AddTCs command to insert new 
1191 
typechecking rules; 

6155  1192 

6269  1193 
* datatype introduction rules are now added as Safe Introduction rules 
1194 
to the claset; 

6155  1195 

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

1198 

6069  1199 

6343  1200 
*** Internal programming interfaces *** 
1201 

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

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

1203 

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

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

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

1206 

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

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

1208 

6343  1209 
* tuned current_goals_markers semantics: begin / end goal avoids 
1210 
printing empty lines; 

1211 

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

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

1214 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

1216 

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

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

1219 
mode to get Isabelle font glyphs as before; 

1220 

1221 
* refined token_translation interface; INCOMPATIBILITY: output length 

1222 
now of type real instead of int; 

1223 

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

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

1227 
opposed to intratheory data slots offered via TheoryDataFun; 

1228 

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

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

1230 
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

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

1234 

6343  1235 

6064  1236 

5781  1237 
New in Isabelle981 (October 1998) 
1238 
 

1239 

5127  1240 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  1241 

5726  1242 
* several changes of automated proof tools; 
5373  1243 

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

5214  1246 

5726  1247 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  1248 
called `inj_on'; 
5160  1249 

5275  1250 
* HOL: removed duplicate thms in Arith: 
1251 
less_imp_add_less should be replaced by trans_less_add1 

1252 
le_imp_add_le should be replaced by trans_le_add1 

5160  1253 

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

5490  1256 

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

1259 
now taken as an integer constant. 

5541  1260 

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

1262 

5363  1263 

5127  1264 
*** Proof tools *** 
4880  1265 

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

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

1267 
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

1268 
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

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

1270 
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

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

1272 
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

1273 
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

1274 
2. The simplifier now knows a little bit about natarithmetic. 
4880  1275 

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

1278 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

1281 
one (emitting a warning). 

4824  1282 
type wrapper = (int > tactic) > (int > tactic) 
4649  1283 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  1284 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
1285 
delWrapper, delSWrapper: claset * string > claset 

4649  1286 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
1287 

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

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

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

1292 
by Force_tac; 

5524  1293 

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

5524  1296 

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

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

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

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

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

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

1305 
split_all_tac for record fields. 

5127  1306 

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

1309 
Addsimps. They can be removed via Delsplits just like 

1310 
Delsimps. Lowercase versions are also available. 

5127  1311 

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

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

1315 
either remove split_if completely from the default simpset by 

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

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

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

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

1320 
t is the name of the datatype). 

5127  1321 

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

5726  1325 
aimed to solve the given subgoal completely. 
5127  1326 

1327 

1328 
*** General *** 

1329 

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

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

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

4842  1336 

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

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

1342 

5127  1343 
* new theory section 'nonterminals' for purely syntactic types; 
4858  1344 

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

4869  1347 

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

1350 

5363  1351 
* isatool install  install binaries with absolute references to 
1352 
ISABELLE_HOME/bin; 

1353 

5572  1354 
* isatool logo  create instances of the Isabelle logo (as EPS); 
1355 

5407  1356 
* print mode 'emacs' reserved for Isamode; 
1357 

5726  1358 
* support multiple print (ast) translations per constant name; 
1359 

6925
8d4d45ec6a3d
theorems involving oracles are now printed with a suffixed [!];
wenzelm
parents:
6922
diff
changeset

1360 
* theorems involving oracles are now printed with a suffixed [!]; 
8d4d45ec6a3d
theorems involving oracles are now printed with a suffixed [!];
wenzelm
parents:
6922
diff
changeset

1361 

4711  1362 

4661  1363 
*** HOL *** 
1364 

5710  1365 
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial'); 
5709  1366 

5217  1367 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  1368 
definitions such as 
5217  1369 

1370 
inductive EVEN ODD 

1371 
intrs 

1372 
null "0 : EVEN" 

1373 
oddI "n : EVEN ==> Suc n : ODD" 

1374 
evenI "n : ODD ==> Suc n : EVEN" 

1375 

1376 
new theorem list "elims" contains an elimination rule for each of the 

1377 
recursive sets; inductive definitions now handle disjunctive premises 

1378 
correctly (also ZF); 

5214  1379 

5217  1380 
INCOMPATIBILITIES: requires Inductive as an ancestor; component 
1381 
"mutual_induct" no longer exists  the induction rule is always 

1382 
contained in "induct"; 

1383 

1384 

1385 
* HOL/datatype package reimplemented and greatly improved: now 

5267  1386 
supports mutually recursive datatypes such as 
5217  1387 

1388 
datatype 

1389 
'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp) 

1390 
 SUM ('a aexp) ('a aexp) 

1391 
 DIFF ('a aexp) ('a aexp) 

1392 
 NUM 'a 

1393 
and 

1394 
'a bexp = LESS ('a aexp) ('a aexp) 

1395 
 AND ('a bexp) ('a bexp) 

1396 
 OR ('a bexp) ('a bexp) 

1397 

5267  1398 
as well as indirectly recursive datatypes such as 
5214  1399 

5217  1400 
datatype 
1401 
('a, 'b) term = Var 'a 

1402 
 App 'b ((('a, 'b) term) list) 

5214  1403 

5217  1404 
The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs 
1405 
induction on mutually / indirectly recursive datatypes. 

1406 

1407 
Primrec equations are now stored in theory and can be accessed via 

1408 
<function_name>.simps. 

1409 

1410 
INCOMPATIBILITIES: 

5214  1411 

5217  1412 
 Theories using datatypes must now have theory Datatype as an 
1413 
ancestor. 

1414 
 The specific <typename>.induct_tac no longer exists  use the 

1415 
generic induct_tac instead. 

5226  1416 
 natE has been renamed to nat.exhaust  use exhaust_tac 
5217  1417 
instead of res_inst_tac ... natE. Note that the variable 
5226  1418 
names in nat.exhaust differ from the names in natE, this 
5217  1419 
may cause some "fragile" proofs to fail. 