author  paulson 
Tue, 05 Sep 2000 10:11:02 +0200  
changeset 9835  543d23cd1259 
parent 9814  aef1f83cf8a6 
child 9871  53e2a8bce258 
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 
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

34 
main HOL, but was unused); should better use HOL's datatype package 
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 

8848  40 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
41 

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

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

43 
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

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

45 

9388  46 
* HOL, ZF: syntax for quotienting wrt an equivalence relation changed from 
47 
A/r to A//r; 

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

48 

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

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

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

52 
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one 
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset

53 
should have to change intro!! to intro? only); 
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset

54 

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

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

56 

9612  57 
* Isar: renamed 'RS' attribute to 'THEN'; 
58 

59 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 

60 

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

61 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  62 

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

65 
use instead the strong form, 

66 
[ 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

67 
In HOL, FOL and ZF the function cla_make_elim will create such rules 
9335  68 
from destructrules; 
9185  69 

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

72 
if required. 

73 

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

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

75 
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

76 

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

78 

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

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

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

81 

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

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

83 

8014  84 

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

86 

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

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

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

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

91 

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

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

94 

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

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

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

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

98 

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

101 

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

103 

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

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

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

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

107 

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

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

109 
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

110 

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

111 

8184  112 
*** Isar *** 
113 

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

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

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

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

117 

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

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

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

120 

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

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

122 
accumulation of results, without applying any rules yet; 
8184  123 

8487  124 
* 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

125 
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

126 
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

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

128 

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

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

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

131 

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

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

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

134 

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

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

136 

9612  137 
* Pure: renamed 'RS' attribute to 'THEN'; 
138 

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

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

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

141 

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

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

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

145 

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

148 

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

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

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

151 

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

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

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

154 

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

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

156 

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

159 

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

162 
(including splits); 

163 

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

166 

167 
* Provers: added 'arith_split' attribute; 

168 

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

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

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

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

172 

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

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

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

175 

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

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

177 
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

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

179 

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

182 

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

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

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

186 
(simplified)) method in proper proofs; 

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

187 

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

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

189 
flags to intro!/intro/intro? (in most cases, one should have to change 
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset

190 
intro!! to intro? only); 
8283
0a319c5746eb
* Pure now provides its own version of intro/elim/dest attributes;
wenzelm
parents:
8271
diff
changeset

191 

9612  192 
* names of theorems etc. may be natural numbers as well; 
193 

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

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

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

196 
proof states; 
8487  197 

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

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

8487  201 

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

205 
(for HOL datatypes); 

8534  206 

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

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

208 
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

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

210 

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

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

212 

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

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

214 
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

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

216 

9239  217 
* added 'nothing'  the empty list of theorems; 
218 

8184  219 

8014  220 
*** HOL *** 
221 

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

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

223 

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

8014  226 

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

8007  229 

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

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

232 
useful in avoiding lifting of operations; 
8570  233 

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

236 

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

238 

8848  239 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
240 

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

243 
well; admit "r" as field name; 

9542  244 

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

247 

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

249 
Types nat and int belong to this axclass; 

250 

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

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

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

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

8736  258 

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

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

262 

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

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

266 

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

269 
enable full simplification of caseexpressions for datatype t, you 

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

8603  271 
(Delcongs[thm"t.weak_case_cong"];) or locally (delcongs [...]). 
272 

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

275 
termination conditions are proved automatically, these simplification 

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

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

278 
each equation; 

279 

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

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

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

282 
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

283 
invariant proof rule for while is applied. 
9457  284 

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

287 

8848  288 
* HOL: theorems impI, allI, ballI bound as "strip"; 
289 

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

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

293 

9741  294 
* new function rulify: thm > thm for turning outer >/! into ==>/?; 
295 
behaves like qed_spec_mp; 

9737  296 

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

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

298 
HOL, but was unused); 
8626  299 

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

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

301 
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

302 

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

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

304 
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

305 

8412  306 

9542  307 
*** ZF *** 
308 

9577  309 
* simplification automatically cancels common terms in arithmetic expressions 
310 
over nat and int; 

9542  311 

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

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

314 
laws unconditional; 

315 

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

9542  318 

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

9577  320 
including $<=, and monotonicity laws for $+ and $*; 
9542  321 

9647  322 
* new example ZF/ex/NatSum to demonstrate integer arithmetic simplification; 
9542  323 

9388  324 
*** FOL & ZF *** 
325 

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

327 
simplifier and classical reasoner simultaneously; 
9388  328 

329 

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

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

331 

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

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

333 
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

334 

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

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

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

337 

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

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

339 

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

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

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

342 

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

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

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

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

346 

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

347 
* system: provide TAGS file for Isabelle sources; 
9052  348 

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

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

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

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

352 

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

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

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

355 

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

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

357 
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

358 

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

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

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

361 

8518  362 
* ML: new combinators >> and >>> for incremental transformations 
363 
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

364 

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

365 

8015  366 

7986  367 
New in Isabelle99 (October 1999) 
368 
 

4649  369 

5931  370 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
371 

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

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

7215  375 

376 
Delcongs [if_weak_cong]; 

6922  377 

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

5931  380 

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

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

385 

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

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

387 
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

388 

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

6057  391 

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

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

6141  395 

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

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

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

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

402 
mk_solver: string > (thm list > int > tactic) > solver 
7619  403 
where the string argument is only a comment. 
6057  404 

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

405 

6069  406 
*** Proof tools *** 
407 

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

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

6069  412 

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

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

416 
matching. 

6069  417 

7593  418 

6014  419 
*** General *** 
420 

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

424 
readable proof documents (Isar == Intelligible semiautomated 

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

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

427 

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

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

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

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

7215  433 

7252  434 
* native support for Proof General, both for classic Isabelle and 
7986  435 
Isabelle/Isar; 
7215  436 

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

439 

6751  440 
* Isabelle manuals now also available as PDF; 
441 

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

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

6449  447 

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

450 

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

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

453 

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

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

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

457 

7215  458 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
459 

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

5973  462 

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

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

465 

6343  466 
* new print_mode "HTML"; 
467 

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

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

470 

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

473 

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

475 
244c244 

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

477 
 

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

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

482 
 

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

484 

7450  485 
* function bind_thms stores lists of theorems (cf. bind_thm); 
486 

7593  487 
* new shorthand tactics ftac, eatac, datac, fatac; 
488 

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

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

7593  492 

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

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

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

495 

6028  496 

6057  497 
*** HOL *** 
498 

7215  499 
** HOL arithmetic ** 
500 

6343  501 
* There are now decision procedures for linear arithmetic over nat and 
502 
int: 

6131  503 

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

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

507 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  512 

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

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

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

517 
simplifier. 

6131  518 

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

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

6028  522 

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

527 
type constraints; 

528 

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

530 
arguments; 

7157  531 

7215  532 
* many properties of integer multiplication, division and remainder 
533 
are now available; 

6922  534 

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

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

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

539 
invocation of the underlying oracle). For SVC see 

7444  540 
http://verify.stanford.edu/SVC 
6922  541 

7125  542 
* IsaMakefile: the HOLReal target now builds an actual image; 
543 

7215  544 

545 
** HOL misc ** 

546 

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

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

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

549 

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

552 

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

555 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

556 
changed syntax and (many) tactics; 

557 

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

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

561 
"mono" attribute); 

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

562 

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

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

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

565 

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

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

567 

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

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

7326  572 

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

574 
Delsimprocs [record_simproc] 

575 

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

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

577 
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

578 

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

581 

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

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

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

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

6563  586 

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

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

590 

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

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

592 
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

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

594 

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

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

596 
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

597 

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

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

599 
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

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

601 

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

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

606 

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

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

608 
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

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

610 

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

7492  613 

7215  614 

7113  615 
*** LK *** 
616 

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

7113  619 

620 
* the simplifier is now installed 

621 

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

622 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  623 

624 
* the classical reasoner now has a default rule database 

625 

626 

6064  627 
*** ZF *** 
628 

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

6269  630 
directly (as in HOL) over datatypes and the natural numbers; 
6064  631 

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

6064  634 

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

636 

6141  637 
* simplification automatically does freeness reasoning for datatype 
6269  638 
constructors; 
6141  639 

6269  640 
* automatic typeinference, with AddTCs command to insert new 
641 
typechecking rules; 

6155  642 

6269  643 
* datatype introduction rules are now added as Safe Introduction rules 
644 
to the claset; 

6155  645 

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

648 

6069  649 

6343  650 
*** Internal programming interfaces *** 
651 

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

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

653 

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

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

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

656 

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

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

658 

6343  659 
* tuned current_goals_markers semantics: begin / end goal avoids 
660 
printing empty lines; 

661 

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

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

664 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

666 

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

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

669 
mode to get Isabelle font glyphs as before; 

670 

671 
* refined token_translation interface; INCOMPATIBILITY: output length 

672 
now of type real instead of int; 

673 

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

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

677 
opposed to intratheory data slots offered via TheoryDataFun; 

678 

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

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

680 
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

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

684 

6343  685 

6064  686 

5781  687 
New in Isabelle981 (October 1998) 
688 
 

689 

5127  690 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  691 

5726  692 
* several changes of automated proof tools; 
5373  693 

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

5214  696 

5726  697 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  698 
called `inj_on'; 
5160  699 

5275  700 
* HOL: removed duplicate thms in Arith: 
701 
less_imp_add_less should be replaced by trans_less_add1 

702 
le_imp_add_le should be replaced by trans_le_add1 

5160  703 

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

5490  706 

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

709 
now taken as an integer constant. 

5541  710 

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

712 

5363  713 

5127  714 
*** Proof tools *** 
4880  715 

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

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

717 
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

718 
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

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

720 
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

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

722 
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

723 
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

724 
2. The simplifier now knows a little bit about natarithmetic. 
4880  725 

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

728 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

731 
one (emitting a warning). 

4824  732 
type wrapper = (int > tactic) > (int > tactic) 
4649  733 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  734 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
735 
delWrapper, delSWrapper: claset * string > claset 

4649  736 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
737 

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

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

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

742 
by Force_tac; 

5524  743 

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

5524  746 

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

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

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

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

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

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

755 
split_all_tac for record fields. 

5127  756 

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

759 
Addsimps. They can be removed via Delsplits just like 

760 
Delsimps. Lowercase versions are also available. 

5127  761 

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

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

765 
either remove split_if completely from the default simpset by 

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

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

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

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

770 
t is the name of the datatype). 

5127  771 

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

5726  775 
aimed to solve the given subgoal completely. 
5127  776 

777 

778 
*** General *** 

779 

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

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

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

4842  786 

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

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

792 

5127  793 
* new theory section 'nonterminals' for purely syntactic types; 
4858  794 

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

4869  797 

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

800 

5363  801 
* isatool install  install binaries with absolute references to 
802 
ISABELLE_HOME/bin; 

803 

5572  804 
* isatool logo  create instances of the Isabelle logo (as EPS); 
805 

5407  806 
* print mode 'emacs' reserved for Isamode; 
807 

5726  808 
* support multiple print (ast) translations per constant name; 
809 

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

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

811 

4711  812 

4661  813 
*** HOL *** 
814 

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

5217  817 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  818 
definitions such as 
5217  819 

820 
inductive EVEN ODD 

821 
intrs 

822 
null "0 : EVEN" 

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

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

825 

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

827 
recursive sets; inductive definitions now handle disjunctive premises 

828 
correctly (also ZF); 

5214  829 

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

832 
contained in "induct"; 

833 

834 

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

5267  836 
supports mutually recursive datatypes such as 
5217  837 

838 
datatype 

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

840 
 SUM ('a aexp) ('a aexp) 

841 
 DIFF ('a aexp) ('a aexp) 

842 
 NUM 'a 

843 
and 

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

845 
 AND ('a bexp) ('a bexp) 

846 
 OR ('a bexp) ('a bexp) 

847 

5267  848 
as well as indirectly recursive datatypes such as 
5214  849 

5217  850 
datatype 
851 
('a, 'b) term = Var 'a 

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

5214  853 

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

856 

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

858 
<function_name>.simps. 

859 

860 
INCOMPATIBILITIES: 

5214  861 

5217  862 
 Theories using datatypes must now have theory Datatype as an 
863 
ancestor. 

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

865 
generic induct_tac instead. 

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

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

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

873 
some datatype definitions may have to be annotated with explicit 

874 
sort constraints. 

875 
 Primrec definitions no longer require function name and type 

876 
of recursive argument. 

5214  877 

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

880 

881 

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

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

885 
support is as follows: 

886 

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

888 
constructor terms) are part of the standard simpset; 

889 

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

891 
made part of standard simpset and claset via addIffs; 

892 

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

894 
the standard claset (addSWrapper); 

895 

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

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

898 
the name of your record type. 

899 

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

901 

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

903 

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

905 
blow up into some record constructor term, consequently the 

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

907 
solve record problems automatically. 

908 

5214  909 

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

912 

5650  913 
* automatic simplification of integer sums and comparisons, using cancellation; 
914 

5526  915 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  916 

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

918 

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

920 

921 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

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

923 
with add/delsplits); 

5125  924 

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

927 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

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

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

931 
%u.f(); 

5125  932 

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

5109  935 

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

938 
disjointness reasoning but breaking a few old proofs. 

5267  939 

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

942 
literature); 

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

943 

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

4838  946 

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

949 
release ONLY. 

950 

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

953 
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

954 

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

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

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

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

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

5282  963 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  964 

5127  965 
* HOL/Arith: 
966 
 removed 'pred' (predecessor) function; 

967 
 generalized some theorems about n1; 

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

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

4766  970 

5127  971 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  972 
instead of "inverse"; 
4711  973 

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

976 

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

5127  980 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  981 

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

984 

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

5308  987 
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

988 

5363  989 

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

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

991 

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

5160  994 

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

997 
disjointness reasoning but breaking a few old proofs. 

5267  998 

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

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

1002 

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

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

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

5308  1007 
Now rew can involve either definitions or equalities (either == or =). 
5142  1008 

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

1011 

4842  1012 

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

1014 

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

5207  1017 

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

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

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

1022 

5251  1023 
* removed global_names compatibility flag  all theory declarations 
1024 
are qualified by default; 

1025 

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

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

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

1029 

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

1032 

5207  1033 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
1034 
subgoal; 

5142  1035 

5251  1036 
* Display.print_goals function moved to Locale.print_goals; 
1037 

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

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

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

1042 
for example; 

1043 

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

1044 

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

1045 

4410  1046 
New in Isabelle98 (January 1998) 
1047 
 

1048 

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

1050 

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

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

1053 

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

1055 
simpset / simpset_ref; 

1056 

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

1058 
implicit merge of thms' signatures; 

1059 

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

1061 

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

1063 

3454  1064 

3715  1065 
*** General Changes *** 
1066 

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

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

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

1074 
backward campatibility problems try setting 'global_names' at compile 

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

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

1077 
section; 

4108  1078 

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

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

1081 
replaced by functions simpset:unit>simpset and 

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

1083 
to patch your ML files accordingly; 

3856  1084 

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

3901  1087 
usedir (see i option, ISABELLE_USEDIR_OPTIONS); 
3857  1088 

3856  1089 
* defs may now be conditional; improved rewrite_goals_tac to handle 
1090 
conditional equations; 

1091 

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

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

4112  1096 
restricted to 'trivial' ones; COMPATIBILITY: one may have to use 
3901  1097 
transfer:theory>thm>thm in (rare) cases; 
1098 

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

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

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

1101 

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

1104 

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

1106 
show_types); 

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

1107 

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

1109 

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

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

1111 

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

1113 

3856  1114 
* 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

1115 

3715  1116 
* removed obsolete init_pps and init_database; 
1117 

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

1119 
fun STATE tacfun st = tacfun st st; 

1120 

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

4269  1123 

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

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

1126 
qualified references to the Sequence structure only!); 

1127 

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

4269  1130 

3715  1131 

1132 
*** Classical Reasoner *** 

1133 

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

1136 
splitting it into several subgoals; 

3715  1137 

3719  1138 
* Safe_tac: like safe_tac but uses the default claset; 
1139 

3715  1140 

1141 
*** Simplifier *** 

1142 

1143 
* added simplification meta rules: 

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

1145 

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

1147 
logics (again); 

1148 

1149 
* added prems argument to simplification procedures; 

1150 

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

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

1154 

3715  1155 

1156 
*** Syntax *** 

1157 

4174  1158 
* TYPE('a) syntax for type reflection terms; 
1159 

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

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

3846  1163 

3715  1164 
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; 
1165 

1166 

1167 
*** HOL *** 

1168 

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

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

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

4035  1175 
protocol TLS; 
3985  1176 

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

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

1181 
differences; simplification procedures nat_cancel_factor for 

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

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

4335  1185 

3580  1186 
* HOL/simplifier: terms of the form 
4325  1187 
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x) 
3580  1188 
are rewritten to 
4035  1189 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)', 
1190 
and those of the form 

4325  1191 
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) > R(x)' (or t=x) 
4035  1192 
are rewritten to 
1193 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) > R(t)', 

1194 

1195 
* HOL/datatype 

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

3580  1197 

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

1200 
... 

4189  1201 
(!y1 ... ymn. x = Cn y1 ... ymn > P(f1 y1 ... ymn)) 
4035  1202 
) 
1203 

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

1204 
and a theorem `split_t_case_asm' of the form 
4189  1205 

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

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

1208 
... 

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

1210 
) 

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

1211 
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

1212 
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

1213 
split_list_case and split_option_case. 
4189  1214 

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

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

1218 
because it will disappear altogether at some point. 

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

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

1221 
`standard'. 

4357  1222 

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

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

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

3570  1227 

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

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

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

1232 

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

1235 
still lacks various theorems and concrete record syntax; 

1236 

4125  1237 

3715  1238 
*** HOLCF *** 
3535  1239 

4125  1240 
* removed "axioms" and "generated by" sections; 
1241 

4123  1242 
* replaced "ops" section by extended "consts" section, which is capable of 
4125  1243 
handling the continuous function space ">" directly; 
1244 

1245 
* domain package: 

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

1247 
. creates hierachical name space, 

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

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

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

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

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

1253 
appear on the lefthand side of the equations only; 

4123  1254 

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

3567  1256 

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

3579  1259 

1260 

3719  1261 
*** FOL and ZF *** 
1262 

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

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

1268 

3719  1269 

3579  1270 

3006  1271 
New in Isabelle948 (May 1997) 
1272 
 

2654  1273 

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

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

1275 

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

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

1277 
still somewhat experimental); old Makefiles etc. still functional; 
2971  1278 

3205  1279 
* new 'Isabelle System Manual'; 
1280 

2825  1281 
* INSTALL text, together with ./configure and ./build scripts; 
2773  1282 

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

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

1285 

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

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

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

1288 

3006  1289 

1290 
*** Syntax *** 

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

1291 

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

1294 

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

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

1296 
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

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

1298 

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

1303 
(Syntax.mark_boundT); 

2705  1304 

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

2730  1308 

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

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

1310 

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

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

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

1313 

3006  1314 

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

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

1316 

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

1317 
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

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

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

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

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

1323 
+ 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

1324 
[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

1325 
+ 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

1326 

3107  1327 
* substitution with equality assumptions no longer permutes other 
1328 
assumptions; 

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

1329 

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

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

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

1333 

5726  1334 
* improved combination of classical reasoner and simplifier: 
3317  1335 
+ functions for handling clasimpsets 
1336 
+ improvement of addss: now the simplifier is called _after_ the 

1337 
safe steps. 

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

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

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

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

1343 

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

1346 
redex); 

1347 

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

1349 

3107  1350 
* 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

1351 

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

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

1353 
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

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

1356 

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

1357 

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

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

1359 

3042  1360 
* a generic induction tactic `induct_tac' which works for all datatypes and 
3107  1361 
also for type `nat'; 
3042  1362 

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

1365 

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

1367 

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

1368 
* patterns in case expressions allow tuple patterns as arguments to 
3107  1369 
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

1370 

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

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

1372 

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

1375 

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

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

1378 

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

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

1381 

3227  1382 
* HOL/Modelcheck demonstrates invocation of model checker oracle; 
1383 

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

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

1385 
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

1386 

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

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

1388 

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

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

1390 

3321  1391 
* a new constant `arbitrary == @x.False'; 
1392 

3107  1393 
* HOLCF/IOA replaces old HOL/IOA; 
1394 

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

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

1397 
+ typedef instead of faking type definitions 
2747  1398 
+ eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc. 
2730  1399 
+ 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

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

1401 
+ 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

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

3006  1405 

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

1406 
*** ZF *** 
2553  1407 

2865  1408 
* ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default 
1409 
rewrite rule; this may affect some proofs. eq_cs is gone but can be put back 

1410 
as ZF_cs addSIs [equalityI]; 

2553  1411 

2554  1412 

2732  1413 

2553  1414 
New in Isabelle947 (November 96) 
1415 
 

1416 

1417 
* allowing negative levels (as offsets) in prlev and choplev; 

1418 

2554  1419 
* superlinear speedup for large simplifications; 
1420 

1421 
* FOL, ZF and HOL now use miniscoping: rewriting pushes 

1422 
quantifications in as far as possible (COULD MAKE EXISTING PROOFS 

1423 
FAIL); can suppress it using the command Delsimps (ex_simps @ 

1424 
all_simps); De Morgan laws are also now included, by default; 

1425 

1426 
* improved printing of ==> : ~: 
