author  paulson 
Mon, 07 Aug 2000 10:25:12 +0200  
changeset 9542  fa19ffdbe1de 
parent 9489  aa757b35b129 
child 9577  9e66e8ed8237 
permissions  rwrr 
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
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 

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

57 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  58 

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

61 
use instead the strong form, 

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

63 
In HOL, FOL and ZF the function cla_make_elim will create such rules 
9335  64 
from destructrules; 
9185  65 

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

68 
if required. 

69 

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

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

71 
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

72 

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

74 

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

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

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

77 

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

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

79 

8014  80 

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

82 

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

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

84 
contain antiquotations of thm/prop/term/typ to be presented according 
0ab3c81e9425
* formal comments (text blocks etc.) in newstyle theories may now
wenzelm
parents:
9185
diff
changeset

85 
to latex print mode; concrete syntax is like this: @{term[show_types] 
0ab3c81e9425
* formal comments (text blocks etc.) in newstyle theories may now
wenzelm
parents:
9185
diff
changeset

86 
"f(x) = a + x"}; 
0ab3c81e9425
* formal comments (text blocks etc.) in newstyle theories may now
wenzelm
parents:
9185
diff
changeset

87 

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

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

90 

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

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

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

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

94 

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

97 

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

99 

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

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

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

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

103 

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

104 
* several improvements in isabelle.sty; \isamarkupheader is now 
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

105 
\section by default; 
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

106 

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

107 

8184  108 
*** Isar *** 
109 

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

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

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

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

113 

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

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

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

116 

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

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

118 
accumulation of results, without applying any rules yet; 
8184  119 

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

121 
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

122 
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

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

124 

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

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

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

127 

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

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

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

130 

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

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

132 

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

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

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

135 

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

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

137 
useful for building new logics, but beware of confusion with the 
8ba0f90f6f35
* Isar/Pure: local results and corresponding term bindings are now
wenzelm
parents:
8603
diff
changeset

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

139 

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

142 

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

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

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

145 

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

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

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

148 

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

151 
(including splits); 

152 

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

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

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

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

156 

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

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

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

159 

9229
a7c6ea7e57de
* Isar/HOL/Calculation: new rules for substitution in inequalities
wenzelm
parents:
9224
diff
changeset

160 
* HOL/Calculation: new rules for substitution in inequalities 
9489
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

161 
(monotonicity conditions are extracted to be proven at end); 
9229
a7c6ea7e57de
* Isar/HOL/Calculation: new rules for substitution in inequalities
wenzelm
parents:
9224
diff
changeset

162 

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

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

164 
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

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

166 

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

167 
* names of theorems etc. may be natural numbers as well; 
8283
0a319c5746eb
* Pure now provides its own version of intro/elim/dest attributes;
wenzelm
parents:
8271
diff
changeset

168 

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

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

170 
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

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

172 

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

173 
* 'pr' command: optional goals_limit argument; no longer prints theory 
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset

174 
contexts, but only proof states; 
8487  175 

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

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

8487  179 

8534  180 
* improved support for emulating tactic scripts, including proof 
181 
methods 'tactic', 'res_inst_tac' etc., 'subgoal_tac', and 'case_tac' / 

182 
'induct_tac' (for HOL datatypes); 

183 

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

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

185 
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

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

187 

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

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

189 

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

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

191 
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

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

193 

9239  194 
* added 'nothing'  the empty list of theorems; 
195 

8184  196 

8014  197 
*** HOL *** 
198 

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

8014  201 

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

8007  204 

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

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

207 
useful in avoiding lifting of operations; 
8570  208 

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

211 

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

213 

8848  214 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
215 

9542  216 
* HOL/record: fixed selectupdate simplification procedure to handle 
217 
extended records as well; admit "r" as field name; 

218 

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

221 

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

223 
Types nat and int belong to this axclass; 

224 

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

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

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

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

8736  232 

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

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

236 

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

239 
enable full simplification of caseexpressions for datatype t, you 

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

8603  241 
(Delcongs[thm"t.weak_case_cong"];) or locally (delcongs [...]). 
242 

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

245 
termination conditions are proved automatically, these simplification 

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

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

248 
each equation; 

249 

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

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

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

252 
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

253 
invariant proof rule for while is applied. 
9457  254 

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

257 

8848  258 
* HOL: theorems impI, allI, ballI bound as "strip"; 
259 

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

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

261 
HOL, but was unused); 
8626  262 

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

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

264 
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

265 

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

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

267 
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

268 

8412  269 

9542  270 
*** ZF *** 
271 

272 
* simplification automatically cancels common terms in arithmetic expressions over nat; 

273 

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

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

276 
laws unconditional; 

277 

278 
* as above, for int; 

279 

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

281 
including $<=; 

282 

283 

9388  284 
*** FOL & ZF *** 
285 

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

287 
simplifier and classical reasoner simultaneously; 
9388  288 

289 

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

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

291 

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

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

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

294 

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

295 
* AST translation rules no longer require constant head on LHS; 
d43669fb423d
* tuned AST representation of nested pairs, avoiding bogus output in
wenzelm
parents:
9335
diff
changeset

296 

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

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

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

299 

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

300 
* compression of ML heaps images may now be controlled via c option 
8518  301 
of isabelle and isatool usedir (currently only observed by Poly/ML); 
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

302 

9052  303 
* provide TAGS file for Isabelle sources; 
304 

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

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

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

307 

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

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

309 
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

310 

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

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

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

313 

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

316 

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

317 

8015  318 

7986  319 
New in Isabelle99 (October 1999) 
320 
 

4649  321 

5931  322 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
323 

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

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

7215  327 

328 
Delcongs [if_weak_cong]; 

6922  329 

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

5931  332 

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

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

337 

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

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

339 
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

340 

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

6057  343 

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

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

6141  347 

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

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

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

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

354 
mk_solver: string > (thm list > int > tactic) > solver 
7619  355 
where the string argument is only a comment. 
6057  356 

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

357 

6069  358 
*** Proof tools *** 
359 

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

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

6069  364 

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

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

368 
matching. 

6069  369 

7593  370 

6014  371 
*** General *** 
372 

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

376 
readable proof documents (Isar == Intelligible semiautomated 

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

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

379 

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

380 
* improved presentation of theories: better HTML markup (including 
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset

381 
colors), graph views in several sizes; isatool usedir now provides a 
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset

382 
proper interface for user theories (via P option); actual document 
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset

383 
preparation based on (PDF)LaTeX is available as well (for newstyle 
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset

384 
theories only); see isatool doc system for more information; 
7215  385 

7252  386 
* native support for Proof General, both for classic Isabelle and 
7986  387 
Isabelle/Isar; 
7215  388 

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

391 

6751  392 
* Isabelle manuals now also available as PDF; 
393 

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

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

6449  399 

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

402 

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

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

405 

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

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

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

409 

7215  410 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
411 

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

5973  414 

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

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

417 

6343  418 
* new print_mode "HTML"; 
419 

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

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

422 

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

425 

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

427 
244c244 

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

429 
 

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

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

434 
 

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

436 

7450  437 
* function bind_thms stores lists of theorems (cf. bind_thm); 
438 

7593  439 
* new shorthand tactics ftac, eatac, datac, fatac; 
440 

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

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

7593  444 

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

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

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

447 

6028  448 

6057  449 
*** HOL *** 
450 

7215  451 
** HOL arithmetic ** 
452 

6343  453 
* There are now decision procedures for linear arithmetic over nat and 
454 
int: 

6131  455 

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

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

459 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  464 

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

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

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

469 
simplifier. 

6131  470 

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

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

6028  474 

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

479 
type constraints; 

480 

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

482 
arguments; 

7157  483 

7215  484 
* many properties of integer multiplication, division and remainder 
485 
are now available; 

6922  486 

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

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

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

491 
invocation of the underlying oracle). For SVC see 

7444  492 
http://verify.stanford.edu/SVC 
6922  493 

7125  494 
* IsaMakefile: the HOLReal target now builds an actual image; 
495 

7215  496 

497 
** HOL misc ** 

498 

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

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

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

501 

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

504 

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

507 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

508 
changed syntax and (many) tactics; 

509 

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

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

513 
"mono" attribute); 

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

514 

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

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

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

517 

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

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

519 

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

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

7326  524 

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

526 
Delsimprocs [record_simproc] 

527 

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

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

529 
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

530 

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

533 

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

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

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

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

6563  538 

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

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

542 

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

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

544 
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

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

546 

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

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

548 
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

549 

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

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

551 
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

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

553 

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

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

558 

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

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

560 
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

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

562 

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

7492  565 

7215  566 

7113  567 
*** LK *** 
568 

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

7113  571 

572 
* the simplifier is now installed 

573 

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

574 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  575 

576 
* the classical reasoner now has a default rule database 

577 

578 

6064  579 
*** ZF *** 
580 

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

6269  582 
directly (as in HOL) over datatypes and the natural numbers; 
6064  583 

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

6064  586 

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

588 

6141  589 
* simplification automatically does freeness reasoning for datatype 
6269  590 
constructors; 
6141  591 

6269  592 
* automatic typeinference, with AddTCs command to insert new 
593 
typechecking rules; 

6155  594 

6269  595 
* datatype introduction rules are now added as Safe Introduction rules 
596 
to the claset; 

6155  597 

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

600 

6069  601 

6343  602 
*** Internal programming interfaces *** 
603 

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

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

605 

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

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

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

608 

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

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

610 

6343  611 
* tuned current_goals_markers semantics: begin / end goal avoids 
612 
printing empty lines; 

613 

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

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

616 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

618 

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

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

621 
mode to get Isabelle font glyphs as before; 

622 

623 
* refined token_translation interface; INCOMPATIBILITY: output length 

624 
now of type real instead of int; 

625 

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

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

629 
opposed to intratheory data slots offered via TheoryDataFun; 

630 

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

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

632 
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

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

636 

6343  637 

6064  638 

5781  639 
New in Isabelle981 (October 1998) 
640 
 

641 

5127  642 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  643 

5726  644 
* several changes of automated proof tools; 
5373  645 

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

5214  648 

5726  649 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  650 
called `inj_on'; 
5160  651 

5275  652 
* HOL: removed duplicate thms in Arith: 
653 
less_imp_add_less should be replaced by trans_less_add1 

654 
le_imp_add_le should be replaced by trans_le_add1 

5160  655 

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

5490  658 

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

661 
now taken as an integer constant. 

5541  662 

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

664 

5363  665 

5127  666 
*** Proof tools *** 
4880  667 

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

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

669 
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

670 
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

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

672 
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

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

674 
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

675 
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

676 
2. The simplifier now knows a little bit about natarithmetic. 
4880  677 

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

680 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

683 
one (emitting a warning). 

4824  684 
type wrapper = (int > tactic) > (int > tactic) 
4649  685 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  686 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
687 
delWrapper, delSWrapper: claset * string > claset 

4649  688 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
689 

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

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

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

694 
by Force_tac; 

5524  695 

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

5524  698 

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

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

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

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

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

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

707 
split_all_tac for record fields. 

5127  708 

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

711 
Addsimps. They can be removed via Delsplits just like 

712 
Delsimps. Lowercase versions are also available. 

5127  713 

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

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

717 
either remove split_if completely from the default simpset by 

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

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

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

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

722 
t is the name of the datatype). 

5127  723 

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

5726  727 
aimed to solve the given subgoal completely. 
5127  728 

729 

730 
*** General *** 

731 

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

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

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

4842  738 

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

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

744 

5127  745 
* new theory section 'nonterminals' for purely syntactic types; 
4858  746 

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

4869  749 

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

752 

5363  753 
* isatool install  install binaries with absolute references to 
754 
ISABELLE_HOME/bin; 

755 

5572  756 
* isatool logo  create instances of the Isabelle logo (as EPS); 
757 

5407  758 
* print mode 'emacs' reserved for Isamode; 
759 

5726  760 
* support multiple print (ast) translations per constant name; 
761 

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

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

763 

4711  764 

4661  765 
*** HOL *** 
766 

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

5217  769 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  770 
definitions such as 
5217  771 

772 
inductive EVEN ODD 

773 
intrs 

774 
null "0 : EVEN" 

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

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

777 

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

779 
recursive sets; inductive definitions now handle disjunctive premises 

780 
correctly (also ZF); 

5214  781 

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

784 
contained in "induct"; 

785 

786 

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

5267  788 
supports mutually recursive datatypes such as 
5217  789 

790 
datatype 

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

792 
 SUM ('a aexp) ('a aexp) 

793 
 DIFF ('a aexp) ('a aexp) 

794 
 NUM 'a 

795 
and 

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

797 
 AND ('a bexp) ('a bexp) 

798 
 OR ('a bexp) ('a bexp) 

799 

5267  800 
as well as indirectly recursive datatypes such as 
5214  801 

5217  802 
datatype 
803 
('a, 'b) term = Var 'a 

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

5214  805 

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

808 

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

810 
<function_name>.simps. 

811 

812 
INCOMPATIBILITIES: 

5214  813 

5217  814 
 Theories using datatypes must now have theory Datatype as an 
815 
ancestor. 

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

817 
generic induct_tac instead. 

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

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

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

825 
some datatype definitions may have to be annotated with explicit 

826 
sort constraints. 

827 
 Primrec definitions no longer require function name and type 

828 
of recursive argument. 

5214  829 

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

832 

833 

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

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

837 
support is as follows: 

838 

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

840 
constructor terms) are part of the standard simpset; 

841 

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

843 
made part of standard simpset and claset via addIffs; 

844 

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

846 
the standard claset (addSWrapper); 

847 

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

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

850 
the name of your record type. 

851 

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

853 

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

855 

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

857 
blow up into some record constructor term, consequently the 

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

859 
solve record problems automatically. 

860 

5214  861 

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

864 

5650  865 
* automatic simplification of integer sums and comparisons, using cancellation; 
866 

5526  867 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  868 

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

870 

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

872 

873 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

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

875 
with add/delsplits); 

5125  876 

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

879 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

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

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

883 
%u.f(); 

5125  884 

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

5109  887 

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

890 
disjointness reasoning but breaking a few old proofs. 

5267  891 

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

894 
literature); 

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

895 

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

4838  898 

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

901 
release ONLY. 

902 

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

905 
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

906 

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

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

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

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

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

5282  915 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  916 

5127  917 
* HOL/Arith: 
918 
 removed 'pred' (predecessor) function; 

919 
 generalized some theorems about n1; 

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

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

4766  922 

5127  923 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  924 
instead of "inverse"; 
4711  925 

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

928 

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

5127  932 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  933 

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

936 

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

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

940 

5363  941 

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

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

943 

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

5160  946 

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

949 
disjointness reasoning but breaking a few old proofs. 

5267  950 

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

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

954 

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

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

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

5308  959 
Now rew can involve either definitions or equalities (either == or =). 
5142  960 

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

963 

4842  964 

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

966 

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

5207  969 

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

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

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

974 

5251  975 
* removed global_names compatibility flag  all theory declarations 
976 
are qualified by default; 

977 

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

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

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

981 

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

984 

5207  985 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
986 
subgoal; 

5142  987 

5251  988 
* Display.print_goals function moved to Locale.print_goals; 
989 

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

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

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

994 
for example; 

995 

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

996 

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

997 

4410  998 
New in Isabelle98 (January 1998) 
999 
 

1000 

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

1002 

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

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

1005 

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

1007 
simpset / simpset_ref; 

1008 

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

1010 
implicit merge of thms' signatures; 

1011 

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

1013 

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

1015 

3454  1016 

3715  1017 
*** General Changes *** 
1018 

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

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

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

1026 
backward campatibility problems try setting 'global_names' at compile 

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

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

1029 
section; 

4108  1030 

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

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

1033 
replaced by functions simpset:unit>simpset and 

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

1035 
to patch your ML files accordingly; 

3856  1036 

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

3901  1039 
usedir (see i option, ISABELLE_USEDIR_OPTIONS); 
3857  1040 

3856  1041 
* defs may now be conditional; improved rewrite_goals_tac to handle 
1042 
conditional equations; 

1043 

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

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

4112  1048 
restricted to 'trivial' ones; COMPATIBILITY: one may have to use 
3901  1049 
transfer:theory>thm>thm in (rare) cases; 
1050 

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

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

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

1053 

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

1056 

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

1058 
show_types); 

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

1059 

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

1061 

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

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

1063 

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

1065 

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

1067 

3715  1068 
* removed obsolete init_pps and init_database; 
1069 

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

1071 
fun STATE tacfun st = tacfun st st; 

1072 

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

4269  1075 

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

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

1078 
qualified references to the Sequence structure only!); 

1079 

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

4269  1082 

3715  1083 

1084 
*** Classical Reasoner *** 

1085 

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

1088 
splitting it into several subgoals; 

3715  1089 

3719  1090 
* Safe_tac: like safe_tac but uses the default claset; 
1091 

3715  1092 

1093 
*** Simplifier *** 

1094 

1095 
* added simplification meta rules: 

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

1097 

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

1099 
logics (again); 

1100 

1101 
* added prems argument to simplification procedures; 

1102 

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

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

1106 

3715  1107 

1108 
*** Syntax *** 

1109 

4174  1110 
* TYPE('a) syntax for type reflection terms; 
1111 

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

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

3846  1115 

3715  1116 
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; 
1117 

1118 

1119 
*** HOL *** 

1120 

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

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

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

4035  1127 
protocol TLS; 
3985  1128 

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

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

1133 
differences; simplification procedures nat_cancel_factor for 

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

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

4335  1137 

3580  1138 
* HOL/simplifier: terms of the form 
4325  1139 
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x) 
3580  1140 
are rewritten to 
4035  1141 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)', 
1142 
and those of the form 

4325  1143 
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) > R(x)' (or t=x) 
4035  1144 
are rewritten to 
1145 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) > R(t)', 

1146 

1147 
* HOL/datatype 

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

3580  1149 

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

1152 
... 

4189  1153 
(!y1 ... ymn. x = Cn y1 ... ymn > P(f1 y1 ... ymn)) 
4035  1154 
) 
1155 

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

1156 
and a theorem `split_t_case_asm' of the form 
4189  1157 

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

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

1160 
... 

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

1162 
) 

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

1163 
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

1164 
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

1165 
split_list_case and split_option_case. 
4189  1166 

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

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

1170 
because it will disappear altogether at some point. 

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

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

1173 
`standard'. 

4357  1174 

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

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

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

3570  1179 

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

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

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

1184 

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

1187 
still lacks various theorems and concrete record syntax; 

1188 

4125  1189 

3715  1190 
*** HOLCF *** 
3535  1191 

4125  1192 
* removed "axioms" and "generated by" sections; 
1193 

4123  1194 
* replaced "ops" section by extended "consts" section, which is capable of 
4125  1195 
handling the continuous function space ">" directly; 
1196 

1197 
* domain package: 

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

1199 
. creates hierachical name space, 

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

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

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

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

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

1205 
appear on the lefthand side of the equations only; 

4123  1206 

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

3567  1208 

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

3579  1211 

1212 

3719  1213 
*** FOL and ZF *** 
1214 

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

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

1220 

3719  1221 

3579  1222 

3006  1223 
New in Isabelle948 (May 1997) 
1224 
 

2654  1225 

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

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

1227 

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

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

1229 
still somewhat experimental); old Makefiles etc. still functional; 
2971  1230 

3205  1231 
* new 'Isabelle System Manual'; 
1232 

2825  1233 
* INSTALL text, together with ./configure and ./build scripts; 
2773  1234 

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

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

1237 

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

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

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

1240 

3006  1241 

1242 
*** Syntax *** 

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

1243 

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

1246 

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

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

1248 
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

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

1250 

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

1255 
(Syntax.mark_boundT); 

2705  1256 

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

2730  1260 

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

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

1262 

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

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

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

1265 

3006  1266 

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

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

1268 

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

1269 
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

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

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

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

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

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

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

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

1278 

3107  1279 
* substitution with equality assumptions no longer permutes other 
1280 
assumptions; 

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

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

1285 

5726  1286 
* improved combination of classical reasoner and simplifier: 
3317  1287 
+ functions for handling clasimpsets 
1288 
+ improvement of addss: now the simplifier is called _after_ the 

1289 
safe steps. 

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

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

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

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

1295 

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

1298 
redex); 

1299 

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

1301 

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

1303 

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

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

1305 
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

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

1308 

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

1309 

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

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

1311 

3042  1312 
* a generic induction tactic `induct_tac' which works for all datatypes and 
3107  1313 
also for type `nat'; 
3042  1314 

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

1317 

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

1319 

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

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

1322 

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

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

1324 

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

1327 

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

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

1330 

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

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

1333 

3227  1334 
* HOL/Modelcheck demonstrates invocation of model checker oracle; 
1335 

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

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

1337 
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

1338 

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

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

1340 

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

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

1342 

3321  1343 
* a new constant `arbitrary == @x.False'; 
1344 

3107  1345 
* HOLCF/IOA replaces old HOL/IOA; 
1346 

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

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

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

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

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

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

3006  1357 

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

1358 
*** ZF *** 
2553  1359 

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

1362 
as ZF_cs addSIs [equalityI]; 

2553  1363 

2554  1364 

2732  1365 

2553  1366 
New in Isabelle947 (November 96) 
1367 
 

1368 

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

1370 

2554  1371 
* superlinear speedup for large simplifications; 
1372 

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

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

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

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

1377 

1378 
* improved printing of ==> : ~: 

1379 

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

1381 
and Modal (thanks to Sara Kalvala); 

1382 

1383 
* HOL/Auth: correctness proofs for authentication protocols; 

1384 

1385 
* HOL: new auto_tac combines rewriting and classical reasoning (many 

1386 
examples on HOL/Auth); 

1387 

1388 
* HOL: new command AddIffs for declaring theorems of the form P=Q to 

1389 
the rewriter and classical reasoner simultaneously; 

1390 

1391 
* function uresult no longer returns theorems in "standard" format; 

1392 
regain previous version by: val uresult = standard o uresult; 

1393 

1394 

1395 

1396 
New in Isabelle946 

1397 
 

1398 

1399 
* oracles  these establish an interface between Isabelle and trusted 

1400 
external reasoners, which may deliver results as theorems; 

1401 

1402 
* proof objects (in particular record all uses of oracles); 

1403 

1404 
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset; 

1405 

1406 
* "constdefs" section in theory files; 

1407 

1408 
* "primrec" section (HOL) no longer requires names; 

1409 

1410 
* internal type "tactic" now simply "thm > thm Sequence.seq"; 

1411 

1412 

1413 

1414 
New in Isabelle945 

1415 
 

1416 

1417 
* reduced space requirements; 

1418 

1419 
* automatic HTML generation from theories; 

1420 

1421 
* theory files no longer require "..." (quotes) around most types; 

1422 

1423 
* new examples, including two proofs of the ChurchRosser theorem; 

1424 

1425 
* noncurried (1994) version of HOL is no longer distributed; 

1426 

2553  1427 

2557  1428 

1429 
New in Isabelle944 

1430 
 

dffebc6ab0a1
More n 