author  wenzelm 
Tue, 01 Aug 2000 13:41:23 +0200  
changeset 9489  aa757b35b129 
parent 9457  966974a7a5b3 
child 9542  fa19ffdbe1de 
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 

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

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

50 
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

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

52 

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

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

54 

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

55 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  56 

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

59 
use instead the strong form, 

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

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

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

66 
if required. 

67 

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

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

69 
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

70 

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

72 

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

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

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

75 

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

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

77 

8014  78 

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

80 

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

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

82 
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

83 
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

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

85 

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

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

88 

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

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

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

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

92 

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

95 

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

97 

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

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

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

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

101 

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

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

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

104 

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

105 

8184  106 
*** Isar *** 
107 

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

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

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

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

111 

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

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

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

114 

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

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

116 
accumulation of results, without applying any rules yet; 
8184  117 

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

119 
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

120 
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

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

122 

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

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

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

125 

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

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

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

128 

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

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

130 

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

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

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

133 

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

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

135 
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

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

137 

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

140 

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

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

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

143 

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

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

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

146 

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

149 
(including splits); 

150 

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

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

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

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

154 

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

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

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

157 

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

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

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

160 

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

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

162 
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

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

164 

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

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

166 

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

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

168 
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

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

170 

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

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

172 
contexts, but only proof states; 
8487  173 

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

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

8487  177 

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

180 
'induct_tac' (for HOL datatypes); 

181 

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

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

183 
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

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

185 

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

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

187 

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

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

189 
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

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

191 

9239  192 
* added 'nothing'  the empty list of theorems; 
193 

8184  194 

8014  195 
*** HOL *** 
196 

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

197 
* HOL/Prolog: a (barebones) implementation of LambdaProlog; 
9028  198 

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

8014  201 

8271
7602b57ba028
HOL/record: fixed selectupdate simplification procedure to handle
wenzelm
parents:
8203
diff
changeset

202 
* HOL/record: fixed selectupdate simplification procedure to handle 
8283
0a319c5746eb
* Pure now provides its own version of intro/elim/dest attributes;
wenzelm
parents:
8271
diff
changeset

203 
extended records as well; admit "r" as field name; 
8271
7602b57ba028
HOL/record: fixed selectupdate simplification procedure to handle
wenzelm
parents:
8203
diff
changeset

204 

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

8007  207 

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

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

210 
useful in avoiding lifting of operations; 
8570  211 

8848  212 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
213 

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

216 

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

218 
Types nat and int belong to this axclass; 

219 

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

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

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

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

8736  227 

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

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

231 

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

234 
enable full simplification of caseexpressions for datatype t, you 

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

8603  236 
(Delcongs[thm"t.weak_case_cong"];) or locally (delcongs [...]). 
237 

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

240 
termination conditions are proved automatically, these simplification 

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

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

243 
each equation; 

244 

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

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

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

247 
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

248 
invariant proof rule for while is applied. 
9457  249 

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

252 

8848  253 
* HOL: theorems impI, allI, ballI bound as "strip"; 
254 

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

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

256 
HOL, but was unused); 
8626  257 

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

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

259 
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

260 

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

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

262 
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

263 

8412  264 

9388  265 
*** FOL & ZF *** 
266 

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

268 
simplifier and classical reasoner simultaneously; 
9388  269 

270 

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

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

272 

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

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

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

275 

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

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

277 

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

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

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

280 

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

281 
* compression of ML heaps images may now be controlled via c option 
8518  282 
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

283 

9052  284 
* provide TAGS file for Isabelle sources; 
285 

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

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

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

288 

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

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

290 
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

291 

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

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

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

294 

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

297 

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

298 

8015  299 

7986  300 
New in Isabelle99 (October 1999) 
301 
 

4649  302 

5931  303 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
304 

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

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

7215  308 

309 
Delcongs [if_weak_cong]; 

6922  310 

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

5931  313 

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

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

318 

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

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

320 
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

321 

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

6057  324 

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

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

6141  328 

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

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

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

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

335 
mk_solver: string > (thm list > int > tactic) > solver 
7619  336 
where the string argument is only a comment. 
6057  337 

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

338 

6069  339 
*** Proof tools *** 
340 

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

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

6069  345 

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

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

349 
matching. 

6069  350 

7593  351 

6014  352 
*** General *** 
353 

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

357 
readable proof documents (Isar == Intelligible semiautomated 

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

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

360 

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

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

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

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

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

365 
theories only); see isatool doc system for more information; 
7215  366 

7252  367 
* native support for Proof General, both for classic Isabelle and 
7986  368 
Isabelle/Isar; 
7215  369 

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

372 

6751  373 
* Isabelle manuals now also available as PDF; 
374 

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

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

6449  380 

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

383 

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

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

386 

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

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

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

390 

7215  391 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
392 

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

5973  395 

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

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

398 

6343  399 
* new print_mode "HTML"; 
400 

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

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

403 

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

406 

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

408 
244c244 

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

410 
 

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

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

415 
 

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

417 

7450  418 
* function bind_thms stores lists of theorems (cf. bind_thm); 
419 

7593  420 
* new shorthand tactics ftac, eatac, datac, fatac; 
421 

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

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

7593  425 

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

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

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

428 

6028  429 

6057  430 
*** HOL *** 
431 

7215  432 
** HOL arithmetic ** 
433 

6343  434 
* There are now decision procedures for linear arithmetic over nat and 
435 
int: 

6131  436 

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

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

440 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  445 

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

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

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

450 
simplifier. 

6131  451 

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

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

6028  455 

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

460 
type constraints; 

461 

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

463 
arguments; 

7157  464 

7215  465 
* many properties of integer multiplication, division and remainder 
466 
are now available; 

6922  467 

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

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

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

472 
invocation of the underlying oracle). For SVC see 

7444  473 
http://verify.stanford.edu/SVC 
6922  474 

7125  475 
* IsaMakefile: the HOLReal target now builds an actual image; 
476 

7215  477 

478 
** HOL misc ** 

479 

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

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

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

482 

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

485 

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

488 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

489 
changed syntax and (many) tactics; 

490 

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

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

494 
"mono" attribute); 

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

495 

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

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

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

498 

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

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

500 

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

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

7326  505 

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

507 
Delsimprocs [record_simproc] 

508 

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

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

510 
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

511 

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

514 

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

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

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

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

6563  519 

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

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

523 

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

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

525 
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

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

527 

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

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

529 
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

530 

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

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

532 
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

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

534 

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

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

539 

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

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

541 
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

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

543 

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

7492  546 

7215  547 

7113  548 
*** LK *** 
549 

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

7113  552 

553 
* the simplifier is now installed 

554 

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

555 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  556 

557 
* the classical reasoner now has a default rule database 

558 

559 

6064  560 
*** ZF *** 
561 

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

6269  563 
directly (as in HOL) over datatypes and the natural numbers; 
6064  564 

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

6064  567 

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

569 

6141  570 
* simplification automatically does freeness reasoning for datatype 
6269  571 
constructors; 
6141  572 

6269  573 
* automatic typeinference, with AddTCs command to insert new 
574 
typechecking rules; 

6155  575 

6269  576 
* datatype introduction rules are now added as Safe Introduction rules 
577 
to the claset; 

6155  578 

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

581 

6069  582 

6343  583 
*** Internal programming interfaces *** 
584 

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

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

586 

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

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

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

589 

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

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

591 

6343  592 
* tuned current_goals_markers semantics: begin / end goal avoids 
593 
printing empty lines; 

594 

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

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

597 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

599 

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

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

602 
mode to get Isabelle font glyphs as before; 

603 

604 
* refined token_translation interface; INCOMPATIBILITY: output length 

605 
now of type real instead of int; 

606 

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

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

610 
opposed to intratheory data slots offered via TheoryDataFun; 

611 

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

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

613 
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

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

617 

6343  618 

6064  619 

5781  620 
New in Isabelle981 (October 1998) 
621 
 

622 

5127  623 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  624 

5726  625 
* several changes of automated proof tools; 
5373  626 

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

5214  629 

5726  630 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  631 
called `inj_on'; 
5160  632 

5275  633 
* HOL: removed duplicate thms in Arith: 
634 
less_imp_add_less should be replaced by trans_less_add1 

635 
le_imp_add_le should be replaced by trans_le_add1 

5160  636 

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

5490  639 

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

642 
now taken as an integer constant. 

5541  643 

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

645 

5363  646 

5127  647 
*** Proof tools *** 
4880  648 

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

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

650 
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

651 
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

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

653 
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

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

655 
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

656 
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

657 
2. The simplifier now knows a little bit about natarithmetic. 
4880  658 

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

661 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

664 
one (emitting a warning). 

4824  665 
type wrapper = (int > tactic) > (int > tactic) 
4649  666 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  667 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
668 
delWrapper, delSWrapper: claset * string > claset 

4649  669 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
670 

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

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

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

675 
by Force_tac; 

5524  676 

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

5524  679 

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

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

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

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

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

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

688 
split_all_tac for record fields. 

5127  689 

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

692 
Addsimps. They can be removed via Delsplits just like 

693 
Delsimps. Lowercase versions are also available. 

5127  694 

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

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

698 
either remove split_if completely from the default simpset by 

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

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

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

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

703 
t is the name of the datatype). 

5127  704 

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

5726  708 
aimed to solve the given subgoal completely. 
5127  709 

710 

711 
*** General *** 

712 

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

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

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

4842  719 

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

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

725 

5127  726 
* new theory section 'nonterminals' for purely syntactic types; 
4858  727 

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

4869  730 

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

733 

5363  734 
* isatool install  install binaries with absolute references to 
735 
ISABELLE_HOME/bin; 

736 

5572  737 
* isatool logo  create instances of the Isabelle logo (as EPS); 
738 

5407  739 
* print mode 'emacs' reserved for Isamode; 
740 

5726  741 
* support multiple print (ast) translations per constant name; 
742 

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

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

744 

4711  745 

4661  746 
*** HOL *** 
747 

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

5217  750 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  751 
definitions such as 
5217  752 

753 
inductive EVEN ODD 

754 
intrs 

755 
null "0 : EVEN" 

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

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

758 

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

760 
recursive sets; inductive definitions now handle disjunctive premises 

761 
correctly (also ZF); 

5214  762 

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

765 
contained in "induct"; 

766 

767 

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

5267  769 
supports mutually recursive datatypes such as 
5217  770 

771 
datatype 

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

773 
 SUM ('a aexp) ('a aexp) 

774 
 DIFF ('a aexp) ('a aexp) 

775 
 NUM 'a 

776 
and 

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

778 
 AND ('a bexp) ('a bexp) 

779 
 OR ('a bexp) ('a bexp) 

780 

5267  781 
as well as indirectly recursive datatypes such as 
5214  782 

5217  783 
datatype 
784 
('a, 'b) term = Var 'a 

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

5214  786 

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

789 

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

791 
<function_name>.simps. 

792 

793 
INCOMPATIBILITIES: 

5214  794 

5217  795 
 Theories using datatypes must now have theory Datatype as an 
796 
ancestor. 

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

798 
generic induct_tac instead. 

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

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

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

806 
some datatype definitions may have to be annotated with explicit 

807 
sort constraints. 

808 
 Primrec definitions no longer require function name and type 

809 
of recursive argument. 

5214  810 

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

813 

814 

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

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

818 
support is as follows: 

819 

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

821 
constructor terms) are part of the standard simpset; 

822 

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

824 
made part of standard simpset and claset via addIffs; 

825 

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

827 
the standard claset (addSWrapper); 

828 

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

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

831 
the name of your record type. 

832 

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

834 

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

836 

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

838 
blow up into some record constructor term, consequently the 

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

840 
solve record problems automatically. 

841 

5214  842 

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

845 

5650  846 
* automatic simplification of integer sums and comparisons, using cancellation; 
847 

5526  848 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  849 

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

851 

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

853 

854 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

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

856 
with add/delsplits); 

5125  857 

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

860 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

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

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

864 
%u.f(); 

5125  865 

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

5109  868 

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

871 
disjointness reasoning but breaking a few old proofs. 

5267  872 

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

875 
literature); 

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

876 

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

4838  879 

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

882 
release ONLY. 

883 

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

886 
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

887 

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

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

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

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

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

5282  896 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  897 

5127  898 
* HOL/Arith: 
899 
 removed 'pred' (predecessor) function; 

900 
 generalized some theorems about n1; 

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

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

4766  903 

5127  904 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  905 
instead of "inverse"; 
4711  906 

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

909 

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

5127  913 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  914 

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

917 

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

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

921 

5363  922 

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

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

924 

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

5160  927 

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

930 
disjointness reasoning but breaking a few old proofs. 

5267  931 

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

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

935 

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

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

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

5308  940 
Now rew can involve either definitions or equalities (either == or =). 
5142  941 

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

944 

4842  945 

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

947 

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

5207  950 

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

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

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

955 

5251  956 
* removed global_names compatibility flag  all theory declarations 
957 
are qualified by default; 

958 

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

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

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

962 

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

965 

5207  966 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
967 
subgoal; 

5142  968 

5251  969 
* Display.print_goals function moved to Locale.print_goals; 
970 

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

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

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

975 
for example; 

976 

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

977 

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

978 

4410  979 
New in Isabelle98 (January 1998) 
980 
 

981 

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

983 

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

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

986 

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

988 
simpset / simpset_ref; 

989 

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

991 
implicit merge of thms' signatures; 

992 

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

994 

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

996 

3454  997 

3715  998 
*** General Changes *** 
999 

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

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

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

1007 
backward campatibility problems try setting 'global_names' at compile 

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

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

1010 
section; 

4108  1011 

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

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

1014 
replaced by functions simpset:unit>simpset and 

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

1016 
to patch your ML files accordingly; 

3856  1017 

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

3901  1020 
usedir (see i option, ISABELLE_USEDIR_OPTIONS); 
3857  1021 

3856  1022 
* defs may now be conditional; improved rewrite_goals_tac to handle 
1023 
conditional equations; 

1024 

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

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

4112  1029 
restricted to 'trivial' ones; COMPATIBILITY: one may have to use 
3901  1030 
transfer:theory>thm>thm in (rare) cases; 
1031 

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

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

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

1034 

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

1037 

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

1039 
show_types); 

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

1040 

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

1042 

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

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

1044 

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

1046 

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

1048 

3715  1049 
* removed obsolete init_pps and init_database; 
1050 

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

1052 
fun STATE tacfun st = tacfun st st; 

1053 

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

4269  1056 

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

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

1059 
qualified references to the Sequence structure only!); 

1060 

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

4269  1063 

3715  1064 

1065 
*** Classical Reasoner *** 

1066 

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

1069 
splitting it into several subgoals; 

3715  1070 

3719  1071 
* Safe_tac: like safe_tac but uses the default claset; 
1072 

3715  1073 

1074 
*** Simplifier *** 

1075 

1076 
* added simplification meta rules: 

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

1078 

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

1080 
logics (again); 

1081 

1082 
* added prems argument to simplification procedures; 

1083 

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

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

1087 

3715  1088 

1089 
*** Syntax *** 

1090 

4174  1091 
* TYPE('a) syntax for type reflection terms; 
1092 

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

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

3846  1096 

3715  1097 
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; 
1098 

1099 

1100 
*** HOL *** 

1101 

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

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

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

4035  1108 
protocol TLS; 
3985  1109 

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

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

1114 
differences; simplification procedures nat_cancel_factor for 

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

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

4335  1118 

3580  1119 
* HOL/simplifier: terms of the form 
4325  1120 
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x) 
3580  1121 
are rewritten to 
4035  1122 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)', 
1123 
and those of the form 

4325  1124 
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) > R(x)' (or t=x) 
4035  1125 
are rewritten to 
1126 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) > R(t)', 

1127 

1128 
* HOL/datatype 

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

3580  1130 

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

1133 
... 

4189  1134 
(!y1 ... ymn. x = Cn y1 ... ymn > P(f1 y1 ... ymn)) 
4035  1135 
) 
1136 

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

1137 
and a theorem `split_t_case_asm' of the form 
4189  1138 

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

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

1141 
... 

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

1143 
) 

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

1144 
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

1145 
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

1146 
split_list_case and split_option_case. 
4189  1147 

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

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

1151 
because it will disappear altogether at some point. 

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

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

1154 
`standard'. 

4357  1155 

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

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

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

3570  1160 

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

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

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

1165 

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

1168 
still lacks various theorems and concrete record syntax; 

1169 

4125  1170 

3715  1171 
*** HOLCF *** 
3535  1172 

4125  1173 
* removed "axioms" and "generated by" sections; 
1174 

4123  1175 
* replaced "ops" section by extended "consts" section, which is capable of 
4125  1176 
handling the continuous function space ">" directly; 
1177 

1178 
* domain package: 

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

1180 
. creates hierachical name space, 

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

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

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

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

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

1186 
appear on the lefthand side of the equations only; 

4123  1187 

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

3567  1189 

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

3579  1192 

1193 

3719  1194 
*** FOL and ZF *** 
1195 

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

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

1201 

3719  1202 

3579  1203 

3006  1204 
New in Isabelle948 (May 1997) 
1205 
 

2654  1206 

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

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

1208 

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

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

1210 
still somewhat experimental); old Makefiles etc. still functional; 
2971  1211 

3205  1212 
* new 'Isabelle System Manual'; 
1213 

2825  1214 
* INSTALL text, together with ./configure and ./build scripts; 
2773  1215 

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

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

1218 

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

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

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

1221 

3006  1222 

1223 
*** Syntax *** 

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

1224 

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

1227 

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

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

1229 
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

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

1231 

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

1236 
(Syntax.mark_boundT); 

2705  1237 

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

2730  1241 

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

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

1243 

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

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

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

1246 

3006  1247 

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

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

1249 

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

1250 
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

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

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

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

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

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

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

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

1259 

3107  1260 
* substitution with equality assumptions no longer permutes other 
1261 
assumptions; 

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

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

1266 

5726  1267 
* improved combination of classical reasoner and simplifier: 
3317  1268 
+ functions for handling clasimpsets 
1269 
+ improvement of addss: now the simplifier is called _after_ the 

1270 
safe steps. 

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

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

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

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

1276 

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

1279 
redex); 

1280 

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

1282 

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

1284 

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

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

1286 
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

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

1289 

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

1290 

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

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

1292 

3042  1293 
* a generic induction tactic `induct_tac' which works for all datatypes and 
3107  1294 
also for type `nat'; 
3042  1295 

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

1298 

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

1300 

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

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

1303 

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

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

1305 

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

1308 

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

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

1311 

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

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

1314 

3227  1315 
* HOL/Modelcheck demonstrates invocation of model checker oracle; 
1316 

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

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

1318 
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

1319 

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

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

1321 

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

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

1323 

3321  1324 
* a new constant `arbitrary == @x.False'; 
1325 

3107  1326 
* HOLCF/IOA replaces old HOL/IOA; 
1327 

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

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

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

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

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

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

3006  1338 

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

1339 
*** ZF *** 
2553  1340 

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

1343 
as ZF_cs addSIs [equalityI]; 

2553  1344 

2554  1345 

2732  1346 

2553  1347 
New in Isabelle947 (November 96) 
1348 
 

1349 

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

1351 

2554  1352 
* superlinear speedup for large simplifications; 
1353 

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

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

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

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

1358 

1359 
* improved printing of ==> : ~: 

1360 

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

1362 
and Modal (thanks to Sara Kalvala); 

1363 

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

1365 

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

1367 
examples on HOL/Auth); 

1368 

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

1370 
the rewriter and classical reasoner simultaneously; 

1371 

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

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

1374 

1375 

1376 

1377 
New in Isabelle946 

1378 
 

1379 

1380 
* oracles  these establish an interface between Isabelle and trusted 

1381 
external reasoners, which may deliver results as theorems; 

1382 

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

1384 

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

1386 

1387 
* "constdefs" section in theory files; 

1388 

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

1390 

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

1392 

1393 

1394 

1395 
New in Isabelle945 

1396 
 

1397 

1398 
* reduced space requirements; 

1399 

1400 
* automatic HTML generation from theories; 

1401 

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

1403 

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

1405 

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

1407 

2553  1408 

2557  1409 

1410 
New in Isabelle944 

1411 
 

1412 

2747  1413 
* greatly reduced space requirements; 
2557  1414 

1415 
* theory files (.thy) no longer require \...\ escapes at line breaks; 

1416 

5726  1417 
* searchable theorem database (see the section "Retrieving theorems" on 
2557  1418 
page 8 of the Reference Manual); 
1419 
