author  paulson 
Fri, 15 Sep 2000 15:48:41 +0200  
changeset 9971  e0164f01d55a 
parent 9941  fe05af7ec816 
child 9981  01a0c4772c18 
permissions  rwrr 
9814
aef1f83cf8a6
* HOL/Lambda: converted into newstyle theory and document;
wenzelm
parents:
9753
diff
changeset

1 

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

2553  4 

8015  5 
New in this Isabelle version 
6 
 

7 

8014  8 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
9 

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

12 
issue the following ML commands: 

13 

14 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

15 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  16 

8967  17 
* HOL: 0 is now overloaded, so the type constraint ::nat may sometimes be 
18 
needed; 

19 

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

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

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

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

23 
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

24 
now "<*lex*>" instead of "**"; 
8705  25 

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

27 

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

28 
* HOL: simplification no longer dives into caseexpressions; 
8603  29 

8655  30 
* HOL: the recursion equations generated by 'recdef' are now called 
31 
f.simps instead of f.rules; 

8626  32 

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

33 
* HOL: theory Sexp now in HOL/Induct examples (it used to be part of 
9971  34 
main HOL, but was unused); it is better to use HOL's datatype package 
9489
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

35 
anyway; 
8848  36 

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

37 
* HOL: removed obsolete theorem binding expand_if (refer to split_if 
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

38 
instead); 
9383
c21fa1c48de0
* HOL: removed obsolete expand_if = split_if; theorems if_splits =
wenzelm
parents:
9349
diff
changeset

39 

9871  40 
* HOL: less_induct is renamed nat_less_induct 
41 

9971  42 
* HOL: systematic renaming of the @rules: 
43 
selectI > someI 

44 
selectI2 > someI2 

45 
selectI2EX > someI2_ex 

46 
select_equality > some_equality 

47 
select1_equality > some1_equality 

48 
select_eq_Ex > some_eq_ex 

49 
Eps_eq > some_eq_trivial 

50 
Eps_sym_eq > some_sym_eq_trivial 

51 

8848  52 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
53 

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

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

55 
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

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

57 

9908  58 
* HOL, ZF: syntax for quotienting wrt an equivalence relation changed 
59 
from A/r to A//r; 

60 

61 
* HOL: qed_spec_mp now also removes bounded ALL; 

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

62 

9542  63 
* ZF: new treatment of arithmetic (nat & int) may break some old proofs; 
64 

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

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

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

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

69 

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

70 
* Isar: changed syntax of local blocks from {{ }} to { }; 
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

71 

9612  72 
* Isar: renamed 'RS' attribute to 'THEN'; 
73 

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

74 
* Isar: renamed some attributes (rulify > rule_format, elimify > elim_format, ...); 
9908  75 

9612  76 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
77 

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

78 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  79 

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

82 
use instead the strong form, 

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

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

84 
In HOL, FOL and ZF the function cla_make_elim will create such rules 
9335  85 
from destructrules; 
9185  86 

9402  87 
* Provers: safe_asm_full_simp_tac is no longer in the simplifier signature. Use 
88 
val safe_asm_full_simp_tac = generic_simp_tac true (true,true,true); 

89 
if required. 

90 

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

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

92 
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

93 

8518  94 
* ML: PureThy.add_thms/add_axioms/add_defs return theorems as well; 
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset

95 

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

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

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

98 

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

99 
* LaTeX: several changes of isabelle.sty; 
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset

100 

8014  101 

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

103 

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

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

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

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

108 

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

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

111 

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

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

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

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

115 

8566  116 
* isatool usedir D now lets isatool latex o sty update the Isabelle 
117 
style files, achieving selfcontained LaTeX sources; 

118 

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

120 

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

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

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

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

124 

9701
533df6cedc2d
* \isabellestyle{it} produces near math mode output;
wenzelm
parents:
9647
diff
changeset

125 
* several improvements in isabelle.sty; \isabellestyle{it} produces 
533df6cedc2d
* \isabellestyle{it} produces near math mode output;
wenzelm
parents:
9647
diff
changeset

126 
near math mode output; \isamarkupheader is now \section by default; 
9489
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

127 

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

128 

8184  129 
*** Isar *** 
130 

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

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

132 
to HindleyMilner polymorphism (similar to ML); this accommodates 
8ba0f90f6f35
* Isar/Pure: local results and corresponding term bindings are now
wenzelm
parents:
8603
diff
changeset

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

134 

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

135 
* Pure: new derived language element 'obtain' supports generalized 
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

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

137 

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

138 
* Pure: new calculational elements 'moreover' and 'ultimately' support 
9489
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

139 
accumulation of results, without applying any rules yet; 
8184  140 

8487  141 
* Pure: scalable support for caseanalysis type proofs: new 'case' 
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset

142 
language element refers to local contexts symbolically, as produced by 
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset

143 
certain proof methods; internally, case names are attached to theorems 
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset

144 
as "tags"; 
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset

145 

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

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

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

148 

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

149 
* Pure: theory command 'defs' supports option "(overloaded)" to 
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset

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

151 

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

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

153 

9612  154 
* Pure: renamed 'RS' attribute to 'THEN'; 
155 

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

156 
* Pure: syntax of sorts made 'inner', i.e. have to write "{a, b, c}" 
8921
7c04c98132c4
* Pure: changed syntax of local blocks from {{ }} to { };
wenzelm
parents:
8887
diff
changeset

157 
instead of {a, b, c}; 
7c04c98132c4
* Pure: changed syntax of local blocks from {{ }} to { };
wenzelm
parents:
8887
diff
changeset

158 

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

159 
* Pure now provides its own version of intro/elim/dest attributes; 
8ba0f90f6f35
* Isar/Pure: local results and corresponding term bindings are now
wenzelm
parents:
8603
diff
changeset

160 
useful for building new logics, but beware of confusion with the 
9612  161 
version in Provers/classical; 
8621
8ba0f90f6f35
* Isar/Pure: local results and corresponding term bindings are now
wenzelm
parents:
8603
diff
changeset

162 

8991  163 
* Pure: the local context of (nonatomic) goals is provided via case 
164 
name 'antecedent'; 

165 

9011
0cfc347f8d19
Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms to
wenzelm
parents:
8994
diff
changeset

166 
* Pure: removed obsolete 'transfer' attribute (transfer of thms to the 
0cfc347f8d19
Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms to
wenzelm
parents:
8994
diff
changeset

167 
current context is now done automatically); 
0cfc347f8d19
Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms to
wenzelm
parents:
8994
diff
changeset

168 

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

169 
* Pure: theory command 'method_setup' provides a simple interface for 
0ab3c81e9425
* formal comments (text blocks etc.) in newstyle theories may now
wenzelm
parents:
9185
diff
changeset

170 
definining proof methods in ML; 
0ab3c81e9425
* formal comments (text blocks etc.) in newstyle theories may now
wenzelm
parents:
9185
diff
changeset

171 

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

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

173 

9612  174 
* Provers: hypsubst support; also plain subst and symmetric attribute 
175 
(the latter supercedes [RS sym]); 

176 

8487  177 
* Provers: splitter support (via 'split' attribute and 'simp' method 
178 
modifier); 'simp' method: 'only:' modifier removes loopers as well 

179 
(including splits); 

180 

9612  181 
* Provers: added 'fastsimp' and 'clarsimp' methods (combination of 
182 
Simplifier and Classical reasoner); 

183 

184 
* Provers: added 'arith_split' attribute; 

185 

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

186 
* HOL: new proof method 'cases' and improved version of 'induct' now 
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset

187 
support named cases; major packages (inductive, datatype, primrec, 
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset

188 
recdef) support case names and properly name parameters; 
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset

189 

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

190 
* HOL: removed 'case_split' thm binding, should use 'cases' proof 
8283
0a319c5746eb
* Pure now provides its own version of intro/elim/dest attributes;
wenzelm
parents:
8271
diff
changeset

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

192 

9383
c21fa1c48de0
* HOL: removed obsolete expand_if = split_if; theorems if_splits =
wenzelm
parents:
9349
diff
changeset

193 
* HOL: removed obsolete expand_if = split_if; theorems if_splits = 
c21fa1c48de0
* HOL: removed obsolete expand_if = split_if; theorems if_splits =
wenzelm
parents:
9349
diff
changeset

194 
split_if split_if_asm; datatype package provides theorems foo.splits = 
c21fa1c48de0
* HOL: removed obsolete expand_if = split_if; theorems if_splits =
wenzelm
parents:
9349
diff
changeset

195 
foo.split foo.split_asm for each datatype; 
c21fa1c48de0
* HOL: removed obsolete expand_if = split_if; theorems if_splits =
wenzelm
parents:
9349
diff
changeset

196 

9612  197 
* HOL/Calculation: new rules for substitution in inequalities 
198 
(monotonicity conditions are extracted to be proven at end); 

199 

200 
* HOL/inductive: rename "intrs" to "intros" (potential 

201 
INCOMPATIBILITY); emulation of mk_cases feature for proof scripts: 

202 
'inductive_cases' command and 'ind_cases' method; NOTE: use (cases 

203 
(simplified)) method in proper proofs; 

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

204 

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

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

206 
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

207 
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

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

209 

9612  210 
* names of theorems etc. may be natural numbers as well; 
211 

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

212 
* 'pr' command: optional arguments for goals_limit and 
2030c5d63741
* 'pr' command: optional argument for ProofContext.prems_limit;
wenzelm
parents:
9709
diff
changeset

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

214 
proof states; 
8487  215 

216 
* diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit 

8518  217 
additional print modes to be specified; e.g. "pr(latex)" will print 
218 
proof state according to the Isabelle LaTeX style; 

8487  219 

8534  220 
* improved support for emulating tactic scripts, including proof 
9612  221 
methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac', 
222 
'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac' 

223 
(for HOL datatypes); 

8534  224 

8673
987ea1a559d0
Isar: simplified (more robust) goal selection of proof methods;
wenzelm
parents:
8655
diff
changeset

225 
* simplified (more robust) goal selection of proof methods: 1st goal, 
987ea1a559d0
Isar: simplified (more robust) goal selection of proof methods;
wenzelm
parents:
8655
diff
changeset

226 
all goals, or explicit goal specifier (tactic emulation); thus 'proof 
987ea1a559d0
Isar: simplified (more robust) goal selection of proof methods;
wenzelm
parents:
8655
diff
changeset

227 
method scripts' have to be in depthfirst order; 
987ea1a559d0
Isar: simplified (more robust) goal selection of proof methods;
wenzelm
parents:
8655
diff
changeset

228 

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

229 
* tuned 'let' syntax: replaced 'as' keyword by 'and'; 
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset

230 

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

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

232 
instead use individual commands for printing items (print_commands, 
0da360494917
* Isar: removed 'help' command, which hasn't been too helpful anyway;
wenzelm
parents:
9198
diff
changeset

233 
print_methods etc.); 
0da360494917
* Isar: removed 'help' command, which hasn't been too helpful anyway;
wenzelm
parents:
9198
diff
changeset

234 

9239  235 
* added 'nothing'  the empty list of theorems; 
236 

8184  237 

8014  238 
*** HOL *** 
239 

9814
aef1f83cf8a6
* HOL/Lambda: converted into newstyle theory and document;
wenzelm
parents:
9753
diff
changeset

240 
* HOL/Lambda: converted into newstyle theory and document; 
aef1f83cf8a6
* HOL/Lambda: converted into newstyle theory and document;
wenzelm
parents:
9753
diff
changeset

241 

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

8014  244 

8392  245 
* HOL/ex: new theory Factorization proving the Fundamental Theorem of 
246 
Arithmetic, by Thomas M Rasmussen; 

8007  247 

8570  248 
* HOL/ex/Multiquote: multiple nested quotations and antiquotations  
249 
basically a generalized version of deBruijn representation; very 

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

250 
useful in avoiding lifting of operations; 
8570  251 

9542  252 
* HOL/NumberTheory: Chinese Remainder Theorem, Fermat/Euler Theorem, Wilson's 
253 
Theorem, by Thomas M Rasmussen; 

254 

255 
* HOL/Prolog: a (barebones) implementation of LambdaProlog; 

256 

8848  257 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
258 

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

261 
well; admit "r" as field name; 

9542  262 

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

265 

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

267 
Types nat and int belong to this axclass; 

268 

9085  269 
* greatly improved simplification involving numerals of type nat, int, real: 
8788  270 
(i + #8 + j) = Suc k simplifies to #7 + (i + j) = k 
8832  271 
i*j + k + j*#3*i simplifies to #4*(i*j) + k 
272 
two terms #m*u and #n*u are replaced by #(m+n)*u 

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

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

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

8736  276 

9835  277 
* HOL: meson_tac is available (previously in ex/meson.ML). It is a powerful 
278 
prover for predicate logic but knows nothing of clasets. For examples of 

279 
what it can do, see ex/mesontest.ML and ex/mesontest2.ML; 

280 

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

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

284 

8848  285 
* HOL: simplification no longer dives into caseexpressions: only the 
286 
selector expression is simplified, but not the remaining arms. To 

287 
enable full simplification of caseexpressions for datatype t, you 

288 
need to remove t.weak_case_cong from the simpset, either permanently 

8603  289 
(Delcongs[thm"t.weak_case_cong"];) or locally (delcongs [...]). 
290 

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

293 
termination conditions are proved automatically, these simplification 

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

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

296 
each equation; 

297 

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

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

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

300 
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

301 
invariant proof rule for while is applied. 
9457  302 

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

305 

8848  306 
* HOL: theorems impI, allI, ballI bound as "strip"; 
307 

9746  308 
* new tactic induct_thm_tac: thm > string > int > tactic 
309 
induct_tac th "x1 ... xn" expects th to have a conclusion of the form 

310 
P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th; 

311 

9908  312 
* new functions rulify/rulify_no_asm: thm > thm for turning outer 
313 
>/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm; 

9737  314 

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

315 
* theory Sexp now in HOL/Induct examples (it used to be part of main 
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

316 
HOL, but was unused); 
8626  317 

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

318 
* fewer consts declared as global (e.g. have to refer to "Lfp.lfp" 
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset

319 
instead of "lfp" internally; affects ML packages only); 
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset

320 

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

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

322 
case of overlap with user translations (e.g. judgements over tuples); 
d43669fb423d
* tuned AST representation of nested pairs, avoiding bogus output in
wenzelm
parents:
9335
diff
changeset

323 

8412  324 

9542  325 
*** ZF *** 
326 

9577  327 
* simplification automatically cancels common terms in arithmetic expressions 
328 
over nat and int; 

9542  329 

330 
* new treatment of nat to minimize typechecking: all operators coerce their 

331 
operands to a natural number using the function natify, making the algebraic 

332 
laws unconditional; 

333 

9577  334 
* as above, for int: operators coerce their operands to an integer using the 
335 
function intify; 

9542  336 

337 
* the integer library now contains many of the usual laws for the orderings, 

9577  338 
including $<=, and monotonicity laws for $+ and $*; 
9542  339 

9647  340 
* new example ZF/ex/NatSum to demonstrate integer arithmetic simplification; 
9542  341 

9388  342 
*** FOL & ZF *** 
343 

344 
* AddIffs now available, giving theorems of the form P<>Q to the 

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

345 
simplifier and classical reasoner simultaneously; 
9388  346 

347 

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

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

349 

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

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

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

352 

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

353 
* Provers: blast(_tac) now handles actual objectlogic rules as 
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset

354 
assumptions; note that auto(_tac) uses blast(_tac) internally as well; 
9489
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

355 

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

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

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

358 

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

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

360 

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

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

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

363 

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

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

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

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

367 

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

368 
* system: provide TAGS file for Isabelle sources; 
9052  369 

9701
533df6cedc2d
* \isabellestyle{it} produces near math mode output;
wenzelm
parents:
9647
diff
changeset

370 
* settings: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and 
533df6cedc2d
* \isabellestyle{it} produces near math mode output;
wenzelm
parents:
9647
diff
changeset

371 
XSYMBOL_HOME; no longer need to do manual configuration in most 
533df6cedc2d
* \isabellestyle{it} produces near math mode output;
wenzelm
parents:
9647
diff
changeset

372 
situations; 
533df6cedc2d
* \isabellestyle{it} produces near math mode output;
wenzelm
parents:
9647
diff
changeset

373 

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

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

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

376 

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

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

378 
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

379 

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

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

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

382 

8518  383 
* ML: new combinators >> and >>> for incremental transformations 
384 
with secondary results (e.g. certain theory extensions): 

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

385 

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

386 

8015  387 

7986  388 
New in Isabelle99 (October 1999) 
389 
 

4649  390 

5931  391 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
392 

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

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

7215  396 

397 
Delcongs [if_weak_cong]; 

6922  398 

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

5931  401 

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

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

406 

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

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

408 
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

409 

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

6057  412 

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

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

6141  416 

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

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

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

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

423 
mk_solver: string > (thm list > int > tactic) > solver 
7619  424 
where the string argument is only a comment. 
6057  425 

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

426 

6069  427 
*** Proof tools *** 
428 

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

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

6069  433 

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

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

437 
matching. 

6069  438 

7593  439 

6014  440 
*** General *** 
441 

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

445 
readable proof documents (Isar == Intelligible semiautomated 

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

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

448 

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

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

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

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

7215  454 

7252  455 
* native support for Proof General, both for classic Isabelle and 
7986  456 
Isabelle/Isar; 
7215  457 

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

460 

6751  461 
* Isabelle manuals now also available as PDF; 
462 

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

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

6449  468 

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

471 

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

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

474 

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

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

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

478 

7215  479 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
480 

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

5973  483 

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

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

486 

6343  487 
* new print_mode "HTML"; 
488 

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

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

491 

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

494 

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

496 
244c244 

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

498 
 

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

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

503 
 

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

505 

7450  506 
* function bind_thms stores lists of theorems (cf. bind_thm); 
507 

7593  508 
* new shorthand tactics ftac, eatac, datac, fatac; 
509 

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

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

7593  513 

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

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

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

516 

6028  517 

6057  518 
*** HOL *** 
519 

7215  520 
** HOL arithmetic ** 
521 

6343  522 
* There are now decision procedures for linear arithmetic over nat and 
523 
int: 

6131  524 

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

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

528 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  533 

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

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

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

538 
simplifier. 

6131  539 

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

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

6028  543 

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

548 
type constraints; 

549 

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

551 
arguments; 

7157  552 

7215  553 
* many properties of integer multiplication, division and remainder 
554 
are now available; 

6922  555 

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

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

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

560 
invocation of the underlying oracle). For SVC see 

7444  561 
http://verify.stanford.edu/SVC 
6922  562 

7125  563 
* IsaMakefile: the HOLReal target now builds an actual image; 
564 

7215  565 

566 
** HOL misc ** 

567 

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

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

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

570 

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

573 

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

576 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

577 
changed syntax and (many) tactics; 

578 

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

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

582 
"mono" attribute); 

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

583 

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

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

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

586 

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

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

588 

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

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

7326  593 

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

595 
Delsimprocs [record_simproc] 

596 

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

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

598 
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

599 

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

602 

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

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

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

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

6563  607 

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

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

611 

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

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

613 
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

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

615 

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

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

617 
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

618 

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

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

620 
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

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

622 

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

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

627 

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

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

629 
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

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

631 

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

7492  634 

7215  635 

7113  636 
*** LK *** 
637 

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

7113  640 

641 
* the simplifier is now installed 

642 

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

643 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  644 

645 
* the classical reasoner now has a default rule database 

646 

647 

6064  648 
*** ZF *** 
649 

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

6269  651 
directly (as in HOL) over datatypes and the natural numbers; 
6064  652 

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

6064  655 

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

657 

6141  658 
* simplification automatically does freeness reasoning for datatype 
6269  659 
constructors; 
6141  660 

6269  661 
* automatic typeinference, with AddTCs command to insert new 
662 
typechecking rules; 

6155  663 

6269  664 
* datatype introduction rules are now added as Safe Introduction rules 
665 
to the claset; 

6155  666 

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

669 

6069  670 

6343  671 
*** Internal programming interfaces *** 
672 

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

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

674 

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

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

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

677 

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

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

679 

6343  680 
* tuned current_goals_markers semantics: begin / end goal avoids 
681 
printing empty lines; 

682 

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

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

685 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

687 

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

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

690 
mode to get Isabelle font glyphs as before; 

691 

692 
* refined token_translation interface; INCOMPATIBILITY: output length 

693 
now of type real instead of int; 

694 

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

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

698 
opposed to intratheory data slots offered via TheoryDataFun; 

699 

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

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

701 
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

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

705 

6343  706 

6064  707 

5781  708 
New in Isabelle981 (October 1998) 
709 
 

710 

5127  711 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  712 

5726  713 
* several changes of automated proof tools; 
5373  714 

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

5214  717 

5726  718 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  719 
called `inj_on'; 
5160  720 

5275  721 
* HOL: removed duplicate thms in Arith: 
722 
less_imp_add_less should be replaced by trans_less_add1 

723 
le_imp_add_le should be replaced by trans_le_add1 

5160  724 

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

5490  727 

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

730 
now taken as an integer constant. 

5541  731 

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

733 

5363  734 

5127  735 
*** Proof tools *** 
4880  736 

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

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

738 
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

739 
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

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

741 
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

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

743 
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

744 
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

745 
2. The simplifier now knows a little bit about natarithmetic. 
4880  746 

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

749 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

752 
one (emitting a warning). 

4824  753 
type wrapper = (int > tactic) > (int > tactic) 
4649  754 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  755 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
756 
delWrapper, delSWrapper: claset * string > claset 

4649  757 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
758 

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

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

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

763 
by Force_tac; 

5524  764 

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

5524  767 

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

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

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

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

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

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

776 
split_all_tac for record fields. 

5127  777 

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

780 
Addsimps. They can be removed via Delsplits just like 

781 
Delsimps. Lowercase versions are also available. 

5127  782 

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

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

786 
either remove split_if completely from the default simpset by 

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

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

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

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

791 
t is the name of the datatype). 

5127  792 

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

5726  796 
aimed to solve the given subgoal completely. 
5127  797 

798 

799 
*** General *** 

800 

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

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

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

4842  807 

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

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

813 

5127  814 
* new theory section 'nonterminals' for purely syntactic types; 
4858  815 

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

4869  818 

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

821 

5363  822 
* isatool install  install binaries with absolute references to 
823 
ISABELLE_HOME/bin; 

824 

5572  825 
* isatool logo  create instances of the Isabelle logo (as EPS); 
826 

5407  827 
* print mode 'emacs' reserved for Isamode; 
828 

5726  829 
* support multiple print (ast) translations per constant name; 
830 

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

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

832 

4711  833 

4661  834 
*** HOL *** 
835 

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

5217  838 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  839 
definitions such as 
5217  840 

841 
inductive EVEN ODD 

842 
intrs 

843 
null "0 : EVEN" 

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

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

846 

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

848 
recursive sets; inductive definitions now handle disjunctive premises 

849 
correctly (also ZF); 

5214  850 

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

853 
contained in "induct"; 

854 

855 

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

5267  857 
supports mutually recursive datatypes such as 
5217  858 

859 
datatype 

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

861 
 SUM ('a aexp) ('a aexp) 

862 
 DIFF ('a aexp) ('a aexp) 

863 
 NUM 'a 

864 
and 

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

866 
 AND ('a bexp) ('a bexp) 

867 
 OR ('a bexp) ('a bexp) 

868 

5267  869 
as well as indirectly recursive datatypes such as 
5214  870 

5217  871 
datatype 
872 
('a, 'b) term = Var 'a 

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

5214  874 

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

877 

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

879 
<function_name>.simps. 

880 

881 
INCOMPATIBILITIES: 

5214  882 

5217  883 
 Theories using datatypes must now have theory Datatype as an 
884 
ancestor. 

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

886 
generic induct_tac instead. 

5226  887 
 natE has been renamed to nat.exhaust  use exhaust_tac 
5217  888 
instead of res_inst_tac ... natE. Note that the variable 
5226  889 
names in nat.exhaust differ from the names in natE, this 
5217  890 
may cause some "fragile" proofs to fail. 
891 
 The theorems split_<typename>_case and split_<typename>_case_asm 

892 
have been renamed to <typename>.split and <typename>.split_asm. 

893 
 Since default sorts of type variables are now handled correctly, 

894 
some datatype definitions may have to be annotated with explicit 

895 
sort constraints. 

896 
 Primrec definitions no longer require function name and type 

897 
of recursive argument. 

5214  898 

5217  899 
Consider using isatool fixdatatype to adapt your theories and proof 
900 
scripts to the new package (backup your sources first!). 

901 

902 

5726  903 
* HOL/record package: considerably improved implementation; now 
904 
includes concrete syntax for record types, terms, updates; theorems 

905 
for surjective pairing and splitting !!bound record variables; proof 

906 
support is as follows: 

907 

908 
1) standard conversions (selectors or updates applied to record 

909 
constructor terms) are part of the standard simpset; 

910 

911 
2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are 

912 
made part of standard simpset and claset via addIffs; 

913 

914 
3) a tactic for record field splitting (record_split_tac) is part of 

915 
the standard claset (addSWrapper); 

916 

917 
To get a better idea about these rules you may retrieve them via 

918 
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is 

919 
the name of your record type. 

920 

921 
The split tactic 3) conceptually simplifies by the following rule: 

922 

923 
"(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))" 

924 

925 
Thus any record variable that is bound by metaall will automatically 

926 
blow up into some record constructor term, consequently the 

927 
simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall 

928 
solve record problems automatically. 

929 

5214  930 

5125  931 
* reorganized the main HOL image: HOL/Integ and String loaded by 
932 
default; theory Main includes everything; 

933 

5650  934 
* automatic simplification of integer sums and comparisons, using cancellation; 
935 

5526  936 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  937 

938 
* added disj_not1 = "(~P  Q) = (P > Q)" to the default simpset; 

939 

940 
* many new identities for unions, intersections, set difference, etc.; 

941 

942 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

943 
called split_if, split_split, split_sum_case and split_nat_case (to go 

944 
with add/delsplits); 

5125  945 

5127  946 
* HOL/Prod introduces simplification procedure unit_eq_proc rewriting 
947 
(?x::unit) = (); this is made part of the default simpset, which COULD 

948 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

5207  949 
'Delsimprocs [unit_eq_proc];' as last resort); also note that 
950 
unit_abs_eta_conv is added in order to counter the effect of 

951 
unit_eq_proc on (%u::unit. f u), replacing it by f rather than by 

952 
%u.f(); 

5125  953 

5217  954 
* HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which 
955 
makes more sense); 

5109  956 

5475  957 
* HOL/Set INCOMPATIBILITY: rule `equals0D' is now a wellformed destruct rule; 
958 
It and 'sym RS equals0D' are now in the default claset, giving automatic 

959 
disjointness reasoning but breaking a few old proofs. 

5267  960 

5217  961 
* HOL/Relation INCOMPATIBILITY: renamed the relational operator r^1 
962 
to 'converse' from 'inverse' (for compatibility with ZF and some 

963 
literature); 

5085
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset

964 

5127  965 
* HOL/recdef can now declare nonrecursive functions, with {} supplied as 
966 
the wellfounded relation; 

4838  967 

5490  968 
* HOL/Set INCOMPATIBILITY: the complement of set A is now written A instead of 
969 
Compl A. The "Compl" syntax remains available as input syntax for this 

970 
release ONLY. 

971 

5127  972 
* HOL/Update: new theory of function updates: 
973 
f(a:=b) == %x. if x=a then b else f x 

974 
may also be iterated as in f(a:=b,c:=d,...); 

5077
71043526295f
* HOL/List: new function list_update written xs[i:=v] that updates the ith
nipkow
parents:
5075
diff
changeset

975 

5127  976 
* HOL/Vimage: new theory for inverse image of a function, syntax f``B; 
4899  977 

5282  978 
* HOL/List: 
979 
 new function list_update written xs[i:=v] that updates the ith 

980 
list position. May also be iterated as in xs[i:=a,j:=b,...]. 

5428  981 
 new function `upt' written [i..j(] which generates the list 
982 
[i,i+1,...,j1], i.e. the upper bound is excluded. To include the upper 

983 
bound write [i..j], which is a shorthand for [i..j+1(]. 

5282  984 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  985 

5127  986 
* HOL/Arith: 
987 
 removed 'pred' (predecessor) function; 

988 
 generalized some theorems about n1; 

989 
 many new laws about "div" and "mod"; 

990 
 new laws about greatest common divisors (see theory ex/Primes); 

4766  991 

5127  992 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  993 
instead of "inverse"; 
4711  994 

5651  995 
* HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness 
996 
of the multiset ordering; 

997 

5127  998 
* directory HOL/Real: a construction of the reals using Dedekind cuts 
5651  999 
(not included by default); 
4835  1000 

5127  1001 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  1002 

5651  1003 
* directory HOL/Hoare: a new version of Hoare logic which permits manysorted 
1004 
programs, i.e. different program variables may have different types. 

1005 

5142  1006 
* calling (stac rew i) now fails if "rew" has no effect on the goal 
1007 
[previously, this check worked only if the rewrite rule was unconditional] 

5308  1008 
Now rew can involve either definitions or equalities (either == or =). 
5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset

1009 

5363  1010 

4879
58656c6a3551
"let" is no longer restricted to FOL terms and allows any logical terms
paulson
parents:
4869
diff
changeset

1011 
*** ZF *** 
58656c6a3551
"let" is no longer restricted to FOL terms and allows any logical terms
paulson
parents:
4869
diff
changeset

1012 

5332  1013 
* theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains 
1014 
only the theorems proved on ZF.ML; 

5160  1015 

5475  1016 
* ZF INCOMPATIBILITY: rule `equals0D' is now a wellformed destruct rule; 
1017 
It and 'sym RS equals0D' are now in the default claset, giving automatic 

1018 
disjointness reasoning but breaking a few old proofs. 

5267  1019 

5160  1020 
* ZF/Update: new theory of function updates 
1021 
with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z) 

1022 
may also be iterated as in f(a:=b,c:=d,...); 

1023 

4879
58656c6a3551
"let" is no longer restricted to FOL terms and allows any logical terms
paulson
parents:
4869
diff
changeset

1024 
* in let x=t in u(x), neither t nor u(x) has to be an FOL term. 
4649  1025 

5142  1026 
* calling (stac rew i) now fails if "rew" has no effect on the goal 
1027 
[previously, this check worked only if the rewrite rule was unconditional] 

5308  1028 
Now rew can involve either definitions or equalities (either == or =). 
5142  1029 

5160  1030 
* case_tac provided for compatibility with HOL 
1031 
(like the old excluded_middle_tac, but with subgoals swapped) 

1032 

4842  1033 

5127  1034 
*** Internal programming interfaces *** 
5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset

1035 

5251  1036 
* Pure: several new basic modules made available for general use, see 
1037 
also src/Pure/README; 

5207  1038 

5008  1039 
* improved the theory data mechanism to support encapsulation (data 
1040 
kind name replaced by private Object.kind, acting as authorization 

5373  1041 
key); new typesafe user interface via functor TheoryDataFun; generic 
1042 
print_data function becomes basically useless; 

5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset

1043 

5251  1044 
* removed global_names compatibility flag  all theory declarations 
1045 
are qualified by default; 

1046 

5085
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset

1047 
* module Pure/Syntax now offers quote / antiquote translation 
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset

1048 
functions (useful for Hoare logic etc. with implicit dependencies); 
5373  1049 
see HOL/ex/Antiquote for an example use; 
5085
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset

1050 

5127  1051 
* Simplifier now offers conversions (asm_)(full_)rewrite: simpset > 
1052 
cterm > thm; 

1053 

5207  1054 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
1055 
subgoal; 

5142  1056 

5251  1057 
* Display.print_goals function moved to Locale.print_goals; 
1058 

5731  1059 
* standard print function for goals supports current_goals_markers 
1060 
variable for marking begin of proof, end of proof, start of goal; the 

1061 
default is ("", "", ""); setting current_goals_markers := ("<proof>", 

1062 
"</proof>", "<goal>") causes SGML like tagged proof state printing, 

1063 
for example; 

1064 

5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset

1065 

7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset

1066 

4410  1067 
New in Isabelle98 (January 1998) 
1068 
 

1069 

1070 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 

1071 

1072 
* changed lexical syntax of terms / types: dots made part of long 

1073 
identifiers, e.g. "%x.x" no longer possible, should be "%x. x"; 

1074 

1075 
* simpset (and claset) reference variable replaced by functions 

1076 
simpset / simpset_ref; 

1077 

1078 
* no longer supports theory aliases (via merge) and nontrivial 

1079 
implicit merge of thms' signatures; 

1080 

1081 
* most internal names of constants changed due to qualified names; 

1082 

1083 
* changed Pure/Sequence interface (see Pure/seq.ML); 

1084 

3454  1085 

3715  1086 
*** General Changes *** 
1087 

4174  1088 
* hierachically structured name spaces (for consts, types, axms, thms 
3943  1089 
etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of 
4108  1090 
old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY: 
1091 
isatool fixdots ensures space after dots (e.g. "%x. x"); set 

4174  1092 
long_names for fully qualified output names; NOTE: ML programs 
1093 
(special tactics, packages etc.) referring to internal names may have 

1094 
to be adapted to cope with fully qualified names; in case of severe 

1095 
backward campatibility problems try setting 'global_names' at compile 

1096 
time to have enrything declared within a flat name space; one may also 

1097 
fine tune name declarations in theories via the 'global' and 'local' 

1098 
section; 

4108  1099 

1100 
* reimplemented the implicit simpset and claset using the new anytype 

1101 
data filed in signatures; references simpset:simpset ref etc. are 

1102 
replaced by functions simpset:unit>simpset and 

1103 
simpset_ref:unit>simpset ref; COMPATIBILITY: use isatool fixclasimp 

1104 
to patch your ML files accordingly; 

3856  1105 

3857  1106 
* HTML output now includes theory graph data for display with Java 
1107 
applet or isatool browser; data generated automatically via isatool 

3901  1108 
usedir (see i option, ISABELLE_USEDIR_OPTIONS); 
3857  1109 

3856  1110 
* defs may now be conditional; improved rewrite_goals_tac to handle 
1111 
conditional equations; 

1112 

4174  1113 
* defs now admits additional type arguments, using TYPE('a) syntax; 
1114 

3901  1115 
* theory aliases via merge (e.g. M=A+B+C) no longer supported, always 
1116 
creates a new theory node; implicit merge of thms' signatures is 

4112  1117 
restricted to 'trivial' ones; COMPATIBILITY: one may have to use 
3901  1118 
transfer:theory>thm>thm in (rare) cases; 
1119 

3968
ec138de716d9
improved handling of draft signatures / theories; draft thms (and
wenzelm
parents:
3964
diff
changeset

1120 
* improved handling of draft signatures / theories; draft thms (and 
ec138de716d9
improved handling of draft signatures / theories; draft thms (and
wenzelm
parents:
3964
diff
changeset

1121 
ctyps, cterms) are automatically promoted to real ones; 
ec138de716d9
improved handling of draft signatures / theories; draft thms (and
wenzelm
parents:
3964
diff
changeset

1122 

3901  1123 
* slightly changed interfaces for oracles: admit many per theory, named 
1124 
(e.g. oracle foo = mlfun), additional name argument for invoke_oracle; 

1125 

1126 
* print_goals: optional output of const types (set show_consts and 

1127 
show_types); 

3851
fe9932a7cd46
print_goals: optional output of const types (set show_consts);
wenzelm
parents:
3846
diff
changeset

1128 

4388  1129 
* improved output of warnings (###) and errors (***); 
3697
c5833dfcc2cc
Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
wenzelm
parents:
3671
diff
changeset

1130 

4178
e64ff1c1bc70
subgoal_tac displays a warning if the new subgoal has type variables
paulson
parents:
4174
diff
changeset

1131 
* subgoal_tac displays a warning if the new subgoal has type variables; 
e64ff1c1bc70
subgoal_tac displays a warning if the new subgoal has type variables
paulson
parents:
4174
diff
changeset

1132 

3715  1133 
* removed old README and Makefiles; 
3697
c5833dfcc2cc
Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
wenzelm
parents:
3671
diff
changeset

1134 

3856  1135 
* replaced print_goals_ref hook by print_current_goals_fn and result_error_fn; 
3670
9fea3562f8c7
replaced print_goals_ref hook by print_current_goals_fn and
wenzelm
parents:
3658
diff
changeset

1136 

3715  1137 
* removed obsolete init_pps and init_database; 
1138 

1139 
* deleted the obsolete tactical STATE, which was declared by 

1140 
fun STATE tacfun st = tacfun st st; 

1141 

4388  1142 
* cd and use now support path variables, e.g. $ISABELLE_HOME, or ~ 
1143 
(which abbreviates $HOME); 

4269  1144 

1145 
* changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY: 

1146 
use isatool fixseq to adapt your ML programs (this works for fully 

1147 
qualified references to the Sequence structure only!); 

1148 

4381  1149 
* use_thy no longer requires writable current directory; it always 
1150 
reloads .ML *and* .thy file, if either one is out of date; 

4269  1151 

3715  1152 

1153 
*** Classical Reasoner *** 

1154 

3744  1155 
* Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new 
1156 
tactics that use classical reasoning to simplify a subgoal without 

1157 
splitting it into several subgoals; 

3715  1158 

3719  1159 
* Safe_tac: like safe_tac but uses the default claset; 
1160 

3715  1161 

1162 
*** Simplifier *** 

1163 

1164 
* added simplification meta rules: 

1165 
(asm_)(full_)simplify: simpset > thm > thm; 

1166 

1167 
* simplifier.ML no longer part of Pure  has to be loaded by object 

1168 
logics (again); 

1169 

1170 
* added prems argument to simplification procedures; 

1171 

4325  1172 
* HOL, FOL, ZF: added infix function `addsplits': 
1173 
instead of `<simpset> setloop (split_tac <thms>)' 

1174 
you can simply write `<simpset> addsplits <thms>' 

1175 

3715  1176 

1177 
*** Syntax *** 

1178 

4174  1179 
* TYPE('a) syntax for type reflection terms; 
1180 

3985  1181 
* no longer handles consts with name ""  declare as 'syntax' instead; 
3856  1182 

1183 
* pretty printer: changed order of mixfix annotation preference (again!); 

3846  1184 

3715  1185 
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; 
1186 

1187 

1188 
*** HOL *** 

1189 

5726  1190 
* HOL: there is a new splitter `split_asm_tac' that can be used e.g. 
4189  1191 
with `addloop' of the simplifier to faciliate case splitting in premises. 
1192 

4035  1193 
* HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions; 
3985  1194 

1195 
* HOL/Auth: new protocol proofs including some for the Internet 

4035  1196 
protocol TLS; 
3985  1197 

4125  1198 
* HOL/Map: new theory of `maps' a la VDM; 
3982  1199 

4335  1200 
* HOL/simplifier: simplification procedures nat_cancel_sums for 
1201 
cancelling out common nat summands from =, <, <= (in)equalities, or 

1202 
differences; simplification procedures nat_cancel_factor for 

1203 
cancelling common factor from =, <, <= (in)equalities over natural 

4373  1204 
sums; nat_cancel contains both kinds of procedures, it is installed by 
1205 
default in Arith.thy  this COULD MAKE EXISTING PROOFS FAIL; 

4335  1206 

3580  1207 
* HOL/simplifier: terms of the form 
4325  1208 
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x) 
3580  1209 
are rewritten to 
4035  1210 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)', 
1211 
and those of the form 

4325  1212 
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) > R(x)' (or t=x) 
4035  1213 
are rewritten to 
1214 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) > R(t)', 

1215 

1216 
* HOL/datatype 

1217 
Each datatype `t' now comes with a theorem `split_t_case' of the form 

3580  1218 

4035  1219 
P(t_case f1 ... fn x) = 
1220 
( (!y1 ... ym1. x = C1 y1 ... ym1 > P(f1 y1 ... ym1)) & 

1221 
... 

4189  1222 
(!y1 ... ymn. x = Cn y1 ... ymn > P(f1 y1 ... ymn)) 
4035  1223 
) 
1224 

4930
89271bc4e7ed
extended addsplits and delsplits to handle also split rules for assumptions
oheimb
parents:
4915
diff
changeset

1225 
and a theorem `split_t_case_asm' of the form 
4189  1226 

1227 
P(t_case f1 ... fn x) = 

1228 
~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1))  

1229 
... 

1230 
(? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn)) 

1231 
) 

4930
89271bc4e7ed
extended addsplits and delsplits to handle also split rules for assumptions
oheimb
parents:
4915
diff
changeset

1232 
which can be added to a simpset via `addsplits'. The existing theorems 
89271bc4e7ed
extended addsplits and delsplits to handle also split rules for assumptions
oheimb
parents:
4915
diff
changeset

1233 
expand_list_case and expand_option_case have been renamed to 
89271bc4e7ed
extended addsplits and delsplits to handle also split rules for assumptions
oheimb
parents:
4915
diff
changeset

1234 
split_list_case and split_option_case. 
4189  1235 

4361  1236 
* HOL/Arithmetic: 
1237 
 `pred n' is automatically converted to `n1'. 

1238 
Users are strongly encouraged not to use `pred' any longer, 

1239 
because it will disappear altogether at some point. 

1240 
 Users are strongly encouraged to write "0 < n" rather than 

1241 
"n ~= 0". Theorems and proof tools have been modified towards this 

1242 
`standard'. 

4357  1243 

4502  1244 
* HOL/Lists: 
1245 
the function "set_of_list" has been renamed "set" (and its theorems too); 

1246 
the function "nth" now takes its arguments in the reverse order and 

1247 
has acquired the infix notation "!" as in "xs!n". 

3570  1248 

4154  1249 
* HOL/Set: UNIV is now a constant and is no longer translated to Compl{}; 
1250 

1251 
* HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its 

1252 
specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x); 

1253 

4575  1254 
* HOL/record: extensible records with schematic structural subtyping 
1255 
(single inheritance); EXPERIMENTAL version demonstrating the encoding, 

1256 
still lacks various theorems and concrete record syntax; 

1257 

4125  1258 

3715  1259 
*** HOLCF *** 
3535  1260 

4125  1261 
* removed "axioms" and "generated by" sections; 
1262 

4123  1263 
* replaced "ops" section by extended "consts" section, which is capable of 
4125  1264 
handling the continuous function space ">" directly; 
1265 

1266 
* domain package: 

1267 
. proves theorems immediately and stores them in the theory, 

1268 
. creates hierachical name space, 

1269 
. now uses normal mixfix annotations (instead of cinfix...), 

1270 
. minor changes to some names and values (for consistency), 

1271 
. e.g. cases > casedist, dists_eq > dist_eqs, [take_lemma] > take_lemmas, 

1272 
. separator between mutual domain defs: changed "," to "and", 

1273 
. improved handling of sort constraints; now they have to 

1274 
appear on the lefthand side of the equations only; 

4123  1275 

1276 
* fixed LAM <x,y,zs>.b syntax; 

3567  1277 

3744  1278 
* added extended adm_tac to simplifier in HOLCF  can now discharge 
1279 
adm (%x. P (t x)), where P is chainfinite and t continuous; 

3579  1280 

1281 

3719  1282 
*** FOL and ZF *** 
1283 

5726  1284 
* FOL: there is a new splitter `split_asm_tac' that can be used e.g. 
4189  1285 
with `addloop' of the simplifier to faciliate case splitting in premises. 
1286 

3744  1287 
* qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as 
1288 
in HOL, they strip ALL and > from proved theorems; 

1289 

3719  1290 

3579  1291 

3006  1292 
New in Isabelle948 (May 1997) 
1293 
 

2654  1294 

3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1295 
*** General Changes *** 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1296 

223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1297 
* new utilities to build / run / maintain Isabelle etc. (in parts 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1298 
still somewhat experimental); old Makefiles etc. still functional; 
2971  1299 

3205  1300 
* new 'Isabelle System Manual'; 
1301 

2825  1302 
* INSTALL text, together with ./configure and ./build scripts; 
2773  1303 

3006  1304 
* reimplemented type inference for greater efficiency, better error 
1305 
messages and clean internal interface; 

3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1306 

223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1307 
* prlim command for dealing with lots of subgoals (an easier way of 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1308 
setting goals_limit); 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1309 

3006  1310 

1311 
*** Syntax *** 

3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1312 

3116  1313 
* supports alternative (named) syntax tables (parser and pretty 
1314 
printer); internal interface is provided by add_modesyntax(_i); 

1315 

3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1316 
* Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1317 
be used in conjunction with the Isabelle symbol font; uses the 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1318 
"symbols" syntax table; 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1319 

2705  1320 
* added token_translation interface (may translate name tokens in 
2756  1321 
arbitrary ways, dependent on their type (free, bound, tfree, ...) and 
3116  1322 
the current print_mode); IMPORTANT: user print translation functions 
1323 
are responsible for marking newly introduced bounds 

1324 
(Syntax.mark_boundT); 

2705  1325 

2730  1326 
* token translations for modes "xterm" and "xterm_color" that display 
3006  1327 
names in bold, underline etc. or colors (which requires a color 
1328 
version of xterm); 

2730  1329 

3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1330 
* infixes may now be declared with names independent of their syntax; 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1331 

223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1332 
* added typed_print_translation (like print_translation, but may 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1333 
access type of constant); 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1334 

3006  1335 

3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1336 
*** Classical Reasoner *** 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1337 

223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1338 
Blast_tac: a new tactic! It is often more powerful than fast_tac, but has 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1339 
some limitations. Blast_tac... 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1340 
+ ignores addss, addbefore, addafter; this restriction is intrinsic 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1341 
+ ignores elimination rules that don't have the correct format 
5726  1342 
(the conclusion MUST be a formula variable) 
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1343 
+ ignores types, which can make HOL proofs fail 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1344 
+ rules must not require higherorder unification, e.g. apply_type in ZF 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1345 
[message "Function Var's argument not a bound variable" relates to this] 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1346 
+ its proof strategy is more general but can actually be slower 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1347 

3107  1348 
* substitution with equality assumptions no longer permutes other 
1349 
assumptions; 

3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1350 

223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1351 
* minor changes in semantics of addafter (now called addaltern); renamed 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1352 
setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper 
3107  1353 
(and access functions for it); 
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1354 

5726  1355 
* improved combination of classical reasoner and simplifier: 
3317  1356 
+ functions for handling clasimpsets 
1357 
+ improvement of addss: now the simplifier is called _after_ the 

1358 
safe steps. 

1359 
+ safe variant of addss called addSss: uses safe simplifications 

5726  1360 
_during_ the safe steps. It is more complete as it allows multiple 
3317  1361 
instantiations of unknowns (e.g. with slow_tac). 
3006  1362 

3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1363 
*** Simplifier *** 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1364 

3006  1365 
* added interface for simplification procedures (functions that 
1366 
produce *proven* rewrite rules on the fly, depending on current 

1367 
redex); 

1368 

1369 
* ordering on terms as parameter (used for ordered rewriting); 

1370 

3107  1371 
* new functions delcongs, deleqcongs, and Delcongs. richer rep_ss; 
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1372 

223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1373 
* the solver is now split into a safe and an unsafe part. 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1374 
This should be invisible for the normal user, except that the 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1375 
functions setsolver and addsolver have been renamed to setSolver and 
3107  1376 
addSolver; added safe_asm_full_simp_tac; 
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1377 

223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1378 

223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1379 
*** HOL *** 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1380 

3042  1381 
* a generic induction tactic `induct_tac' which works for all datatypes and 
3107  1382 
also for type `nat'; 
3042  1383 

3316  1384 
* a generic case distinction tactic `exhaust_tac' which works for all 
1385 
datatypes and also for type `nat'; 

1386 

1387 
* each datatype comes with a function `size'; 

1388 

3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1389 
* patterns in case expressions allow tuple patterns as arguments to 
3107  1390 
constructors, for example `case x of [] => ...  (x,y,z)#ps => ...'; 
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1391 

223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1392 
* primrec now also works with type nat; 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1393 

3338  1394 
* recdef: a new declaration form, allows general recursive functions to be 
1395 
defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify. 

1396 

3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1397 
* the constant for negation has been renamed from "not" to "Not" to 
3107  1398 
harmonize with FOL, ZF, LK, etc.; 
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1399 

3107  1400 
* HOL/ex/LFilter theory of a corecursive "filter" functional for 
1401 
infinite lists; 

3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1402 

3227  1403 
* HOL/Modelcheck demonstrates invocation of model checker oracle; 
1404 

3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1405 
* HOL/ex/Ring.thy declares cring_simp, which solves equational 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1406 
problems in commutative rings, using axiomatic type classes for + and *; 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1407 

223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1408 
* more examples in HOL/MiniML and HOL/Auth; 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1409 

223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1410 
* more default rewrite rules for quantifiers, union/intersection; 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1411 

3321  1412 
* a new constant `arbitrary == @x.False'; 
1413 

3107  1414 
* HOLCF/IOA replaces old HOL/IOA; 
1415 

5726  1416 
* HOLCF changes: derived all rules and arities 
1417 
+ axiomatic type classes instead of classes 

2653
f1a6997cdc06
described changes for HOLCFVersion without rules and arities
slotosch
parents:
2649
diff
changeset

1418 
+ typedef instead of faking type definitions 
2747  1419 
+ eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc. 
2730  1420 
+ new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po 
2653
f1a6997cdc06
described changes for HOLCFVersion without rules and arities
slotosch
parents:
2649
diff
changeset

1421 
+ eliminated the types void, one, tr 
f1a6997cdc06
described changes for HOLCFVersion without rules and arities
slotosch
parents:
2649
diff
changeset

1422 
+ use unit lift and bool lift (with translations) instead of one and tr 
f1a6997cdc06
described changes for HOLCFVersion without rules and arities
slotosch
parents:
2649
diff
changeset

1423 
+ eliminated blift from Lift3.thy (use Def instead of blift) 
3107  1424 
all eliminated rules are derived as theorems > no visible changes ; 
2649  1425 