author  wenzelm 
Mon, 04 Sep 2000 18:38:53 +0200  
changeset 9828  1d8bc4f1833e 
parent 9814  aef1f83cf8a6 
child 9835  543d23cd1259 
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 

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

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

262 

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

265 
enable full simplification of caseexpressions for datatype t, you 

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

8603  267 
(Delcongs[thm"t.weak_case_cong"];) or locally (delcongs [...]). 
268 

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

271 
termination conditions are proved automatically, these simplification 

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

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

274 
each equation; 

275 

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

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

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

278 
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

279 
invariant proof rule for while is applied. 
9457  280 

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

283 

8848  284 
* HOL: theorems impI, allI, ballI bound as "strip"; 
285 

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

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

289 

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

9737  292 

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

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

294 
HOL, but was unused); 
8626  295 

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

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

297 
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

298 

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

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

300 
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

301 

8412  302 

9542  303 
*** ZF *** 
304 

9577  305 
* simplification automatically cancels common terms in arithmetic expressions 
306 
over nat and int; 

9542  307 

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

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

310 
laws unconditional; 

311 

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

9542  314 

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

9577  316 
including $<=, and monotonicity laws for $+ and $*; 
9542  317 

9647  318 
* new example ZF/ex/NatSum to demonstrate integer arithmetic simplification; 
9542  319 

9388  320 
*** FOL & ZF *** 
321 

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

323 
simplifier and classical reasoner simultaneously; 
9388  324 

325 

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

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

327 

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

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

329 
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

330 

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

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

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

333 

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

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

335 

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

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

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

338 

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

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

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

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

342 

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

343 
* system: provide TAGS file for Isabelle sources; 
9052  344 

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

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

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

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

348 

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

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

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

351 

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

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

353 
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

354 

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

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

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

357 

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

360 

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

361 

8015  362 

7986  363 
New in Isabelle99 (October 1999) 
364 
 

4649  365 

5931  366 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
367 

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

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

7215  371 

372 
Delcongs [if_weak_cong]; 

6922  373 

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

5931  376 

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

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

381 

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

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

383 
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

384 

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

6057  387 

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

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

6141  391 

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

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

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

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

398 
mk_solver: string > (thm list > int > tactic) > solver 
7619  399 
where the string argument is only a comment. 
6057  400 

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

401 

6069  402 
*** Proof tools *** 
403 

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

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

6069  408 

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

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

412 
matching. 

6069  413 

7593  414 

6014  415 
*** General *** 
416 

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

420 
readable proof documents (Isar == Intelligible semiautomated 

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

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

423 

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

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

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

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

7215  429 

7252  430 
* native support for Proof General, both for classic Isabelle and 
7986  431 
Isabelle/Isar; 
7215  432 

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

435 

6751  436 
* Isabelle manuals now also available as PDF; 
437 

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

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

6449  443 

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

446 

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

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

449 

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

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

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

453 

7215  454 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
455 

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

5973  458 

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

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

461 

6343  462 
* new print_mode "HTML"; 
463 

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

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

466 

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

469 

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

471 
244c244 

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

473 
 

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

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

478 
 

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

480 

7450  481 
* function bind_thms stores lists of theorems (cf. bind_thm); 
482 

7593  483 
* new shorthand tactics ftac, eatac, datac, fatac; 
484 

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

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

7593  488 

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

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

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

491 

6028  492 

6057  493 
*** HOL *** 
494 

7215  495 
** HOL arithmetic ** 
496 

6343  497 
* There are now decision procedures for linear arithmetic over nat and 
498 
int: 

6131  499 

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

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

503 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  508 

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

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

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

513 
simplifier. 

6131  514 

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

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

6028  518 

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

523 
type constraints; 

524 

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

526 
arguments; 

7157  527 

7215  528 
* many properties of integer multiplication, division and remainder 
529 
are now available; 

6922  530 

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

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

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

535 
invocation of the underlying oracle). For SVC see 

7444  536 
http://verify.stanford.edu/SVC 
6922  537 

7125  538 
* IsaMakefile: the HOLReal target now builds an actual image; 
539 

7215  540 

541 
** HOL misc ** 

542 

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

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

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

545 

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

548 

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

551 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

552 
changed syntax and (many) tactics; 

553 

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

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

557 
"mono" attribute); 

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

558 

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

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

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

561 

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

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

563 

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

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

7326  568 

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

570 
Delsimprocs [record_simproc] 

571 

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

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

573 
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

574 

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

577 

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

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

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

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

6563  582 

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

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

586 

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

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

588 
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

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

590 

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

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

592 
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

593 

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

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

595 
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

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

597 

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

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

602 

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

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

604 
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

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

606 

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

7492  609 

7215  610 

7113  611 
*** LK *** 
612 

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

7113  615 

616 
* the simplifier is now installed 

617 

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

618 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  619 

620 
* the classical reasoner now has a default rule database 

621 

622 

6064  623 
*** ZF *** 
624 

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

6269  626 
directly (as in HOL) over datatypes and the natural numbers; 
6064  627 

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

6064  630 

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

632 

6141  633 
* simplification automatically does freeness reasoning for datatype 
6269  634 
constructors; 
6141  635 

6269  636 
* automatic typeinference, with AddTCs command to insert new 
637 
typechecking rules; 

6155  638 

6269  639 
* datatype introduction rules are now added as Safe Introduction rules 
640 
to the claset; 

6155  641 

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

644 

6069  645 

6343  646 
*** Internal programming interfaces *** 
647 

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

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

649 

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

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

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

652 

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

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

654 

6343  655 
* tuned current_goals_markers semantics: begin / end goal avoids 
656 
printing empty lines; 

657 

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

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

660 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

662 

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

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

665 
mode to get Isabelle font glyphs as before; 

666 

667 
* refined token_translation interface; INCOMPATIBILITY: output length 

668 
now of type real instead of int; 

669 

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

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

673 
opposed to intratheory data slots offered via TheoryDataFun; 

674 

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

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

676 
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

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

680 

6343  681 

6064  682 

5781  683 
New in Isabelle981 (October 1998) 
684 
 

685 

5127  686 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  687 

5726  688 
* several changes of automated proof tools; 
5373  689 

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

5214  692 

5726  693 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  694 
called `inj_on'; 
5160  695 

5275  696 
* HOL: removed duplicate thms in Arith: 
697 
less_imp_add_less should be replaced by trans_less_add1 

698 
le_imp_add_le should be replaced by trans_le_add1 

5160  699 

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

5490  702 

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

705 
now taken as an integer constant. 

5541  706 

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

708 

5363  709 

5127  710 
*** Proof tools *** 
4880  711 

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

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

713 
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

714 
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

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

716 
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

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

718 
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

719 
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

720 
2. The simplifier now knows a little bit about natarithmetic. 
4880  721 

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

724 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

727 
one (emitting a warning). 

4824  728 
type wrapper = (int > tactic) > (int > tactic) 
4649  729 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  730 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
731 
delWrapper, delSWrapper: claset * string > claset 

4649  732 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
733 

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

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

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

738 
by Force_tac; 

5524  739 

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

5524  742 

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

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

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

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

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

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

751 
split_all_tac for record fields. 

5127  752 

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

755 
Addsimps. They can be removed via Delsplits just like 

756 
Delsimps. Lowercase versions are also available. 

5127  757 

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

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

761 
either remove split_if completely from the default simpset by 

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

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

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

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

766 
t is the name of the datatype). 

5127  767 

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

5726  771 
aimed to solve the given subgoal completely. 
5127  772 

773 

774 
*** General *** 

775 

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

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

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

4842  782 

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

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

788 

5127  789 
* new theory section 'nonterminals' for purely syntactic types; 
4858  790 

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

4869  793 

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

796 

5363  797 
* isatool install  install binaries with absolute references to 
798 
ISABELLE_HOME/bin; 

799 

5572  800 
* isatool logo  create instances of the Isabelle logo (as EPS); 
801 

5407  802 
* print mode 'emacs' reserved for Isamode; 
803 

5726  804 
* support multiple print (ast) translations per constant name; 
805 

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

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

807 

4711  808 

4661  809 
*** HOL *** 
810 

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

5217  813 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  814 
definitions such as 
5217  815 

816 
inductive EVEN ODD 

817 
intrs 

818 
null "0 : EVEN" 

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

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

821 

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

823 
recursive sets; inductive definitions now handle disjunctive premises 

824 
correctly (also ZF); 

5214  825 

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

828 
contained in "induct"; 

829 

830 

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

5267  832 
supports mutually recursive datatypes such as 
5217  833 

834 
datatype 

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

836 
 SUM ('a aexp) ('a aexp) 

837 
 DIFF ('a aexp) ('a aexp) 

838 
 NUM 'a 

839 
and 

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

841 
 AND ('a bexp) ('a bexp) 

842 
 OR ('a bexp) ('a bexp) 

843 

5267  844 
as well as indirectly recursive datatypes such as 
5214  845 

5217  846 
datatype 
847 
('a, 'b) term = Var 'a 

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

5214  849 

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

852 

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

854 
<function_name>.simps. 

855 

856 
INCOMPATIBILITIES: 

5214  857 

5217  858 
 Theories using datatypes must now have theory Datatype as an 
859 
ancestor. 

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

861 
generic induct_tac instead. 

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

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

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

869 
some datatype definitions may have to be annotated with explicit 

870 
sort constraints. 

871 
 Primrec definitions no longer require function name and type 

872 
of recursive argument. 

5214  873 

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

876 

877 

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

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

881 
support is as follows: 

882 

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

884 
constructor terms) are part of the standard simpset; 

885 

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

887 
made part of standard simpset and claset via addIffs; 

888 

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

890 
the standard claset (addSWrapper); 

891 

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

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

894 
the name of your record type. 

895 

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

897 

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

899 

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

901 
blow up into some record constructor term, consequently the 

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

903 
solve record problems automatically. 

904 

5214  905 

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

908 

5650  909 
* automatic simplification of integer sums and comparisons, using cancellation; 
910 

5526  911 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  912 

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

914 

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

916 

917 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

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

919 
with add/delsplits); 

5125  920 

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

923 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

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

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

927 
%u.f(); 

5125  928 

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

5109  931 

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

934 
disjointness reasoning but breaking a few old proofs. 

5267  935 

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

938 
literature); 

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

939 

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

4838  942 

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

945 
release ONLY. 

946 

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

949 
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

950 

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

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

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

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

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

5282  959 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  960 

5127  961 
* HOL/Arith: 
962 
 removed 'pred' (predecessor) function; 

963 
 generalized some theorems about n1; 

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

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

4766  966 

5127  967 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  968 
instead of "inverse"; 
4711  969 

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

972 

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

5127  976 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  977 

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

980 

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

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

984 

5363  985 

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

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

987 

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

5160  990 

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

993 
disjointness reasoning but breaking a few old proofs. 

5267  994 

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

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

998 

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

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

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

5308  1003 
Now rew can involve either definitions or equalities (either == or =). 
5142  1004 

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

1007 

4842  1008 

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

1010 

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

5207  1013 

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

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

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

1018 

5251  1019 
* removed global_names compatibility flag  all theory declarations 
1020 
are qualified by default; 

1021 

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

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

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

1025 

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

1028 

5207  1029 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
1030 
subgoal; 

5142  1031 

5251  1032 
* Display.print_goals function moved to Locale.print_goals; 
1033 

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

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

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

1038 
for example; 

1039 

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

1040 

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

1041 

4410  1042 
New in Isabelle98 (January 1998) 
1043 
 

1044 

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

1046 

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

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

1049 

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

1051 
simpset / simpset_ref; 

1052 

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

1054 
implicit merge of thms' signatures; 

1055 

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

1057 

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

1059 

3454  1060 

3715  1061 
*** General Changes *** 
1062 

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

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

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

1070 
backward campatibility problems try setting 'global_names' at compile 

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

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

1073 
section; 

4108  1074 

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

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

1077 
replaced by functions simpset:unit>simpset and 

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

1079 
to patch your ML files accordingly; 

3856  1080 

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

3901  1083 
usedir (see i option, ISABELLE_USEDIR_OPTIONS); 
3857  1084 

3856  1085 
* defs may now be conditional; improved rewrite_goals_tac to handle 
1086 
conditional equations; 

1087 

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

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

4112  1092 
restricted to 'trivial' ones; COMPATIBILITY: one may have to use 
3901  1093 
transfer:theory>thm>thm in (rare) cases; 
1094 

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

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

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

1097 

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

1100 

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

1102 
show_types); 

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

1103 

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

1105 

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

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

1107 

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

1109 

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

1111 

3715  1112 
* removed obsolete init_pps and init_database; 
1113 

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

1115 
fun STATE tacfun st = tacfun st st; 

1116 

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

4269  1119 

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

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

1122 
qualified references to the Sequence structure only!); 

1123 

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

4269  1126 

3715  1127 

1128 
*** Classical Reasoner *** 

1129 

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

1132 
splitting it into several subgoals; 

3715  1133 

3719  1134 
* Safe_tac: like safe_tac but uses the default claset; 
1135 

3715  1136 

1137 
*** Simplifier *** 

1138 

1139 
* added simplification meta rules: 

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

1141 

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

1143 
logics (again); 

1144 

1145 
* added prems argument to simplification procedures; 

1146 

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

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

1150 

3715  1151 

1152 
*** Syntax *** 

1153 

4174  1154 
* TYPE('a) syntax for type reflection terms; 
1155 

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

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

3846  1159 

3715  1160 
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; 
1161 

1162 

1163 
*** HOL *** 

1164 

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

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

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

4035  1171 
protocol TLS; 
3985  1172 

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

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

1177 
differences; simplification procedures nat_cancel_factor for 

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

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

4335  1181 

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

4325  1187 
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) > R(x)' (or t=x) 
4035  1188 
are rewritten to 
1189 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) > R(t)', 

1190 

1191 
* HOL/datatype 

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

3580  1193 

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

1196 
... 

4189  1197 
(!y1 ... ymn. x = Cn y1 ... ymn > P(f1 y1 ... ymn)) 
4035  1198 
) 
1199 

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

1200 
and a theorem `split_t_case_asm' of the form 
4189  1201 

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

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

1204 
... 

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

1206 
) 

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

1207 
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

1208 
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

1209 
split_list_case and split_option_case. 
4189  1210 

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

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

1214 
because it will disappear altogether at some point. 

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

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

1217 
`standard'. 

4357  1218 

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

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

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

3570  1223 

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

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

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

1228 

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

1231 
still lacks various theorems and concrete record syntax; 

1232 

4125  1233 

3715  1234 
*** HOLCF *** 
3535  1235 

4125  1236 
* removed "axioms" and "generated by" sections; 
1237 

4123  1238 
* replaced "ops" section by extended "consts" section, which is capable of 
4125  1239 
handling the continuous function space ">" directly; 
1240 

1241 
* domain package: 

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

1243 
. creates hierachical name space, 

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

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

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

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

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

1249 
appear on the lefthand side of the equations only; 

4123  1250 

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

3567  1252 

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

3579  1255 

1256 

3719  1257 
*** FOL and ZF *** 
1258 

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

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

1264 

3719  1265 

3579  1266 

3006  1267 
New in Isabelle948 (May 1997) 
1268 
 

2654  1269 

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

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

1271 

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

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

1273 
still somewhat experimental); old Makefiles etc. still functional; 
2971  1274 

3205  1275 
* new 'Isabelle System Manual'; 
1276 

2825  1277 
* INSTALL text, together with ./configure and ./build scripts; 
2773  1278 

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

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

1281 

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

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

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

1284 

3006  1285 

1286 
*** Syntax *** 

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

1287 

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

1290 

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

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

1292 
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

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

1294 

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

1299 
(Syntax.mark_boundT); 

2705  1300 

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

2730  1304 

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

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

1306 

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

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

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

1309 

3006  1310 

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

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

1312 

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

1313 
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

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

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

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

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

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

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

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

1322 

3107  1323 
* substitution with equality assumptions no longer permutes other 
1324 
assumptions; 

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

1325 

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

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

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

1329 

5726  1330 
* improved combination of classical reasoner and simplifier: 
3317  1331 
+ functions for handling clasimpsets 
1332 
+ improvement of addss: now the simplifier is called _after_ the 

1333 
safe steps. 

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

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

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

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

1339 

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

1342 
redex); 

1343 

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

1345 

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

1347 

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

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

1349 
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

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

1352 

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

1353 

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

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

1355 

3042  1356 
* a generic induction tactic `induct_tac' which works for all datatypes and 
3107  1357 
also for type `nat'; 
3042  1358 

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

1361 

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

1363 

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

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

1366 

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

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

1368 

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

1371 

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

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

1374 

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

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

1377 

3227  1378 
* HOL/Modelcheck demonstrates invocation of model checker oracle; 
1379 

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

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

1381 
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

1382 

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

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

1384 

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

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

1386 

3321  1387 
* a new constant `arbitrary == @x.False'; 
1388 

3107  1389 
* HOLCF/IOA replaces old HOL/IOA; 
1390 

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

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

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

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

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

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

3006  1401 

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

1402 
*** ZF *** 
2553  1403 

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

1406 
as ZF_cs addSIs [equalityI]; 

2553  1407 

2554  1408 

2732  1409 

2553  1410 
New in Isabelle947 (November 96) 
1411 
 

1412 

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

1414 

2554  1415 
* superlinear speedup for large simplifications; 
1416 

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

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

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

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

1421 

1422 
* improved printing of ==> : ~: 

1423 

1424 
* new objectlogic "Sequents" adds linear logic, while replacing LK 

1425 
and Modal (thanks to Sara Kalvala); 

1426 
