author  oheimb 
Fri, 21 Jul 2000 17:46:43 +0200  
changeset 9402  480a1b40fdd6 
parent 9388  0b039a3575eb 
child 9437  93e91040c286 
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 

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

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

8626  32 

8848  33 
* HOL: theory Sexp now in HOL/Induct examples (used to be part of main 
34 
HOL, but was unused); should better use HOL's datatype package anyway; 

35 

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

36 
* HOL: removed obsolete theorem binding expand_if, use split_if instead; 
c21fa1c48de0
* HOL: removed obsolete expand_if = split_if; theorems if_splits =
wenzelm
parents:
9349
diff
changeset

37 

8848  38 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
39 

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

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

41 
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

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

43 

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

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

46 

9388  47 
* Isar: changed syntax of local blocks from {{ }} to { }; 
9335  48 

9402  49 
* Provers: strengthened force_tac by using new first_best_tac 
50 

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

53 
use instead the strong form, 

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

55 
In HOL, FOL and ZF the function cla_make_elim will create such rules 
9335  56 
from destructrules; 
9185  57 

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

60 
if required. 

61 

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

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

63 
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

64 

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

66 

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

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

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

69 

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

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

71 

8014  72 

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

74 

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

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

76 
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

77 
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

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

79 

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

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

82 

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

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

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

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

86 

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

89 

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

91 

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

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

93 
on WWW server seperately); 
af1ca1acf292
* browser info session directories are now selfcontained (may be put
wenzelm
parents:
9052
diff
changeset

94 

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

95 

8184  96 
*** Isar *** 
97 

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

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

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

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

101 

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

102 
* Pure: new 'obtain' language element supports generalized existence 
8ba0f90f6f35
* Isar/Pure: local results and corresponding term bindings are now
wenzelm
parents:
8603
diff
changeset

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

104 

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

105 
* Pure: new calculational elements 'moreover' and 'ultimately' support 
8ba0f90f6f35
* Isar/Pure: local results and corresponding term bindings are now
wenzelm
parents:
8603
diff
changeset

106 
plain accumulation of results, without applying any rules yet; 
8184  107 

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

109 
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

110 
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

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

112 

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

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

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

115 

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

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

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

118 

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

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

120 

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

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

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

123 

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

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

125 
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

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

127 

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

130 

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

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

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

133 

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

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

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

136 

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

139 
(including splits); 

140 

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

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

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

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

144 

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

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

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

147 

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

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

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

150 

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

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

152 
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

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

154 

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

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

156 

8518  157 
* Provers: intro/elim/dest attributes: changed ! / !! flags to ? / ??; 
8283
0a319c5746eb
* Pure now provides its own version of intro/elim/dest attributes;
wenzelm
parents:
8271
diff
changeset

158 

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

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

160 
contexts, but only proof states; 
8487  161 

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

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

8487  165 

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

168 
'induct_tac' (for HOL datatypes); 

169 

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

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

171 
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

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

173 

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

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

175 

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

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

177 
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

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

179 

9239  180 
* added 'nothing'  the empty list of theorems; 
181 

8184  182 

8014  183 
*** HOL *** 
184 

9028  185 
* HOL/Prolog: a (barebones) implementation of LambdaProlog 
186 

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

8014  189 

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

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

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

192 

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

8007  195 

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

198 
useful in avoiding lifting all operations; 

199 

8848  200 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
201 

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

204 

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

206 
Types nat and int belong to this axclass; 

207 

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

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

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

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

8736  215 

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

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

219 

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

222 
enable full simplification of caseexpressions for datatype t, you 

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

8603  224 
(Delcongs[thm"t.weak_case_cong"];) or locally (delcongs [...]). 
225 

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

228 
termination conditions are proved automatically, these simplification 

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

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

231 
each equation; 

232 

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

235 

8848  236 
* HOL: theorems impI, allI, ballI bound as "strip"; 
237 

238 
* theory Sexp now in HOL/Induct examples (used to be part of main HOL, 

239 
but was unused); 

8626  240 

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

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

242 
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

243 

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

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

245 
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

246 

8412  247 

9388  248 
*** FOL & ZF *** 
249 

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

251 
simplifier and classical reasoner simultaneously; 

252 

253 

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

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

255 

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

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

257 

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

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

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

260 

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

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

263 

9052  264 
* provide TAGS file for Isabelle sources; 
265 

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

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

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

268 

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

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

270 
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

271 

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

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

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

274 

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

277 

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

278 

8015  279 

7986  280 
New in Isabelle99 (October 1999) 
281 
 

4649  282 

5931  283 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
284 

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

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

7215  288 

289 
Delcongs [if_weak_cong]; 

6922  290 

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

5931  293 

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

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

298 

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

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

300 
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

301 

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

6057  304 

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

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

6141  308 

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

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

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

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

315 
mk_solver: string > (thm list > int > tactic) > solver 
7619  316 
where the string argument is only a comment. 
6057  317 

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

318 

6069  319 
*** Proof tools *** 
320 

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

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

6069  325 

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

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

329 
matching. 

6069  330 

7593  331 

6014  332 
*** General *** 
333 

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

337 
readable proof documents (Isar == Intelligible semiautomated 

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

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

340 

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

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

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

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

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

345 
theories only); see isatool doc system for more information; 
7215  346 

7252  347 
* native support for Proof General, both for classic Isabelle and 
7986  348 
Isabelle/Isar; 
7215  349 

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

352 

6751  353 
* Isabelle manuals now also available as PDF; 
354 

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

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

6449  360 

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

363 

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

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

366 

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

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

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

370 

7215  371 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
372 

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

5973  375 

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

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

378 

6343  379 
* new print_mode "HTML"; 
380 

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

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

383 

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

386 

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

388 
244c244 

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

390 
 

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

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

395 
 

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

397 

7450  398 
* function bind_thms stores lists of theorems (cf. bind_thm); 
399 

7593  400 
* new shorthand tactics ftac, eatac, datac, fatac; 
401 

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

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

7593  405 

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

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

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

408 

6028  409 

6057  410 
*** HOL *** 
411 

7215  412 
** HOL arithmetic ** 
413 

6343  414 
* There are now decision procedures for linear arithmetic over nat and 
415 
int: 

6131  416 

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

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

420 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  425 

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

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

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

430 
simplifier. 

6131  431 

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

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

6028  435 

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

440 
type constraints; 

441 

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

443 
arguments; 

7157  444 

7215  445 
* many properties of integer multiplication, division and remainder 
446 
are now available; 

6922  447 

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

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

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

452 
invocation of the underlying oracle). For SVC see 

7444  453 
http://verify.stanford.edu/SVC 
6922  454 

7125  455 
* IsaMakefile: the HOLReal target now builds an actual image; 
456 

7215  457 

458 
** HOL misc ** 

459 

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

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

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

462 

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

465 

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

468 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

469 
changed syntax and (many) tactics; 

470 

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

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

474 
"mono" attribute); 

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

475 

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

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

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

478 

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

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

480 

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

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

7326  485 

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

487 
Delsimprocs [record_simproc] 

488 

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

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

490 
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

491 

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

494 

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

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

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

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

6563  499 

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

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

503 

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

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

505 
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

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

507 

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

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

509 
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

510 

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

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

512 
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

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

514 

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

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

519 

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

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

521 
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

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

523 

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

7492  526 

7215  527 

7113  528 
*** LK *** 
529 

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

7113  532 

533 
* the simplifier is now installed 

534 

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

535 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  536 

537 
* the classical reasoner now has a default rule database 

538 

539 

6064  540 
*** ZF *** 
541 

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

6269  543 
directly (as in HOL) over datatypes and the natural numbers; 
6064  544 

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

6064  547 

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

549 

6141  550 
* simplification automatically does freeness reasoning for datatype 
6269  551 
constructors; 
6141  552 

6269  553 
* automatic typeinference, with AddTCs command to insert new 
554 
typechecking rules; 

6155  555 

6269  556 
* datatype introduction rules are now added as Safe Introduction rules 
557 
to the claset; 

6155  558 

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

561 

6069  562 

6343  563 
*** Internal programming interfaces *** 
564 

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

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

566 

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

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

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

569 

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

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

571 

6343  572 
* tuned current_goals_markers semantics: begin / end goal avoids 
573 
printing empty lines; 

574 

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

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

577 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

579 

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

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

582 
mode to get Isabelle font glyphs as before; 

583 

584 
* refined token_translation interface; INCOMPATIBILITY: output length 

585 
now of type real instead of int; 

586 

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

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

590 
opposed to intratheory data slots offered via TheoryDataFun; 

591 

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

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

593 
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

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

597 

6343  598 

6064  599 

5781  600 
New in Isabelle981 (October 1998) 
601 
 

602 

5127  603 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  604 

5726  605 
* several changes of automated proof tools; 
5373  606 

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

5214  609 

5726  610 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  611 
called `inj_on'; 
5160  612 

5275  613 
* HOL: removed duplicate thms in Arith: 
614 
less_imp_add_less should be replaced by trans_less_add1 

615 
le_imp_add_le should be replaced by trans_le_add1 

5160  616 

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

5490  619 

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

622 
now taken as an integer constant. 

5541  623 

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

625 

5363  626 

5127  627 
*** Proof tools *** 
4880  628 

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

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

630 
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

631 
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

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

633 
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

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

635 
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

636 
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

637 
2. The simplifier now knows a little bit about natarithmetic. 
4880  638 

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

641 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

644 
one (emitting a warning). 

4824  645 
type wrapper = (int > tactic) > (int > tactic) 
4649  646 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  647 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
648 
delWrapper, delSWrapper: claset * string > claset 

4649  649 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
650 

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

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

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

655 
by Force_tac; 

5524  656 

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

5524  659 

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

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

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

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

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

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

668 
split_all_tac for record fields. 

5127  669 

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

672 
Addsimps. They can be removed via Delsplits just like 

673 
Delsimps. Lowercase versions are also available. 

5127  674 

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

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

678 
either remove split_if completely from the default simpset by 

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

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

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

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

683 
t is the name of the datatype). 

5127  684 

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

5726  688 
aimed to solve the given subgoal completely. 
5127  689 

690 

691 
*** General *** 

692 

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

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

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

4842  699 

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

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

705 

5127  706 
* new theory section 'nonterminals' for purely syntactic types; 
4858  707 

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

4869  710 

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

713 

5363  714 
* isatool install  install binaries with absolute references to 
715 
ISABELLE_HOME/bin; 

716 

5572  717 
* isatool logo  create instances of the Isabelle logo (as EPS); 
718 

5407  719 
* print mode 'emacs' reserved for Isamode; 
720 

5726  721 
* support multiple print (ast) translations per constant name; 
722 

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

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

724 

4711  725 

4661  726 
*** HOL *** 
727 

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

5217  730 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  731 
definitions such as 
5217  732 

733 
inductive EVEN ODD 

734 
intrs 

735 
null "0 : EVEN" 

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

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

738 

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

740 
recursive sets; inductive definitions now handle disjunctive premises 

741 
correctly (also ZF); 

5214  742 

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

745 
contained in "induct"; 

746 

747 

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

5267  749 
supports mutually recursive datatypes such as 
5217  750 

751 
datatype 

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

753 
 SUM ('a aexp) ('a aexp) 

754 
 DIFF ('a aexp) ('a aexp) 

755 
 NUM 'a 

756 
and 

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

758 
 AND ('a bexp) ('a bexp) 

759 
 OR ('a bexp) ('a bexp) 

760 

5267  761 
as well as indirectly recursive datatypes such as 
5214  762 

5217  763 
datatype 
764 
('a, 'b) term = Var 'a 

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

5214  766 

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

769 

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

771 
<function_name>.simps. 

772 

773 
INCOMPATIBILITIES: 

5214  774 

5217  775 
 Theories using datatypes must now have theory Datatype as an 
776 
ancestor. 

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

778 
generic induct_tac instead. 

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

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

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

786 
some datatype definitions may have to be annotated with explicit 

787 
sort constraints. 

788 
 Primrec definitions no longer require function name and type 

789 
of recursive argument. 

5214  790 

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

793 

794 

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

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

798 
support is as follows: 

799 

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

801 
constructor terms) are part of the standard simpset; 

802 

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

804 
made part of standard simpset and claset via addIffs; 

805 

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

807 
the standard claset (addSWrapper); 

808 

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

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

811 
the name of your record type. 

812 

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

814 

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

816 

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

818 
blow up into some record constructor term, consequently the 

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

820 
solve record problems automatically. 

821 

5214  822 

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

825 

5650  826 
* automatic simplification of integer sums and comparisons, using cancellation; 
827 

5526  828 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  829 

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

831 

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

833 

834 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

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

836 
with add/delsplits); 

5125  837 

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

840 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

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

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

844 
%u.f(); 

5125  845 

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

5109  848 

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

851 
disjointness reasoning but breaking a few old proofs. 

5267  852 

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

855 
literature); 

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

856 

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

4838  859 

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

862 
release ONLY. 

863 

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

866 
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

867 

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

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

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

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

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

5282  876 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  877 

5127  878 
* HOL/Arith: 
879 
 removed 'pred' (predecessor) function; 

880 
 generalized some theorems about n1; 

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

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

4766  883 

5127  884 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  885 
instead of "inverse"; 
4711  886 

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

889 

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

5127  893 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  894 

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

897 

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

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

901 

5363  902 

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

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

904 

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

5160  907 

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

910 
disjointness reasoning but breaking a few old proofs. 

5267  911 

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

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

915 

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

916 
* in let x=t in u(x), neither t nor u(x) has to be an FOL term. 
4649  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 =). 
5142  921 

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

924 

4842  925 

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

927 

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

5207  930 

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

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

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

935 

5251  936 
* removed global_names compatibility flag  all theory declarations 
937 
are qualified by default; 

938 

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

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

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

942 

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

945 

5207  946 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
947 
subgoal; 

5142  948 

5251  949 
* Display.print_goals function moved to Locale.print_goals; 
950 

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

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

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

955 
for example; 

956 

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

957 

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

958 

4410  959 
New in Isabelle98 (January 1998) 
960 
 

961 

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

963 

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

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

966 

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

968 
simpset / simpset_ref; 

969 

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

971 
implicit merge of thms' signatures; 

972 

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

974 

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

976 

3454  977 

3715  978 
*** General Changes *** 
979 

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

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

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

987 
backward campatibility problems try setting 'global_names' at compile 

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

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

990 
section; 

4108  991 

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

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

994 
replaced by functions simpset:unit>simpset and 

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

996 
to patch your ML files accordingly; 

3856  997 

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

3901  1000 
usedir (see i option, ISABELLE_USEDIR_OPTIONS); 
3857  1001 

3856  1002 
* defs may now be conditional; improved rewrite_goals_tac to handle 
1003 
conditional equations; 

1004 

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

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

4112  1009 
restricted to 'trivial' ones; COMPATIBILITY: one may have to use 
3901  1010 
transfer:theory>thm>thm in (rare) cases; 
1011 

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

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

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

1014 

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

1017 

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

1019 
show_types); 

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

1020 

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

1022 

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

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

1024 

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

1026 

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

1028 

3715  1029 
* removed obsolete init_pps and init_database; 
1030 

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

1032 
fun STATE tacfun st = tacfun st st; 

1033 

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

4269  1036 

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

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

1039 
qualified references to the Sequence structure only!); 

1040 

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

4269  1043 

3715  1044 

1045 
*** Classical Reasoner *** 

1046 

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

1049 
splitting it into several subgoals; 

3715  1050 

3719  1051 
* Safe_tac: like safe_tac but uses the default claset; 
1052 

3715  1053 

1054 
*** Simplifier *** 

1055 

1056 
* added simplification meta rules: 

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

1058 

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

1060 
logics (again); 

1061 

1062 
* added prems argument to simplification procedures; 

1063 

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

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

1067 

3715  1068 

1069 
*** Syntax *** 

1070 

4174  1071 
* TYPE('a) syntax for type reflection terms; 
1072 

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

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

3846  1076 

3715  1077 
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; 
1078 

1079 

1080 
*** HOL *** 

1081 

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

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

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

4035  1088 
protocol TLS; 
3985  1089 

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

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

1094 
differences; simplification procedures nat_cancel_factor for 

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

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

4335  1098 

3580  1099 
* HOL/simplifier: terms of the form 
4325  1100 
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x) 
3580  1101 
are rewritten to 
4035  1102 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)', 
1103 
and those of the form 

4325  1104 
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) > R(x)' (or t=x) 
4035  1105 
are rewritten to 
1106 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) > R(t)', 

1107 

1108 
* HOL/datatype 

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

3580  1110 

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

1113 
... 

4189  1114 
(!y1 ... ymn. x = Cn y1 ... ymn > P(f1 y1 ... ymn)) 
4035  1115 
) 
1116 

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

1117 
and a theorem `split_t_case_asm' of the form 
4189  1118 

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

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

1121 
... 

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

1123 
) 

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

1124 
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

1125 
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

1126 
split_list_case and split_option_case. 
4189  1127 

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

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

1131 
because it will disappear altogether at some point. 

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

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

1134 
`standard'. 

4357  1135 

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

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

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

3570  1140 

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

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

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

1145 

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

1148 
still lacks various theorems and concrete record syntax; 

1149 

4125  1150 

3715  1151 
*** HOLCF *** 
3535  1152 

4125  1153 
* removed "axioms" and "generated by" sections; 
1154 

4123  1155 
* replaced "ops" section by extended "consts" section, which is capable of 
4125  1156 
handling the continuous function space ">" directly; 
1157 

1158 
* domain package: 

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

1160 
. creates hierachical name space, 

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

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

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

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

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

1166 
appear on the lefthand side of the equations only; 

4123  1167 

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

3567  1169 

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

3579  1172 

1173 

3719  1174 
*** FOL and ZF *** 
1175 

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

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

1181 

3719  1182 

3579  1183 

3006  1184 
New in Isabelle948 (May 1997) 
1185 
 

2654  1186 

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

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

1188 

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

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

1190 
still somewhat experimental); old Makefiles etc. still functional; 
2971  1191 

3205  1192 
* new 'Isabelle System Manual'; 
1193 

2825  1194 
* INSTALL text, together with ./configure and ./build scripts; 
2773  1195 

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

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

1198 

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

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

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

1201 

3006  1202 

1203 
*** Syntax *** 

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

1204 

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

1207 

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

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

1209 
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

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

1211 

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

1216 
(Syntax.mark_boundT); 

2705  1217 

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

2730  1221 

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

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

1223 

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

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

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

1226 

3006  1227 

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

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

1229 

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

1230 
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

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

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

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

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

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

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

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

1239 

3107  1240 
* substitution with equality assumptions no longer permutes other 
1241 
assumptions; 

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

1242 

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

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

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

1246 

5726  1247 
* improved combination of classical reasoner and simplifier: 
3317  1248 
+ functions for handling clasimpsets 
1249 
+ improvement of addss: now the simplifier is called _after_ the 

1250 
safe steps. 

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

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

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

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

1256 

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

1259 
redex); 

1260 

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

1262 

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

1264 

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

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

1266 
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

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

1269 

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

1270 

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

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

1272 

3042  1273 
* a generic induction tactic `induct_tac' which works for all datatypes and 
3107  1274 
also for type `nat'; 
3042  1275 

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

1278 

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

1280 

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

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

1283 

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

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

1285 

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

1288 

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

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

1291 

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

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

1294 

3227  1295 
* HOL/Modelcheck demonstrates invocation of model checker oracle; 
1296 

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

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

1298 
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

1299 

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

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

1301 

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

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

1303 

3321  1304 
* a new constant `arbitrary == @x.False'; 
1305 

3107  1306 
* HOLCF/IOA replaces old HOL/IOA; 
1307 

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

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

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

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

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

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

3006  1318 

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

1319 
*** ZF *** 
2553  1320 

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

1323 
as ZF_cs addSIs [equalityI]; 

2553  1324 

2554  1325 

2732  1326 

2553  1327 
New in Isabelle947 (November 96) 
1328 
 

1329 

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

1331 

2554  1332 
* superlinear speedup for large simplifications; 
1333 

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

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

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

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

1338 

1339 
* improved printing of ==> : ~: 

1340 

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

1342 
and Modal (thanks to Sara Kalvala); 

1343 

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

1345 

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

1347 
examples on HOL/Auth); 

1348 

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

1350 
the rewriter and classical reasoner simultaneously; 

1351 

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

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

1354 

1355 

1356 

1357 
New in Isabelle946 

1358 
 

1359 

1360 
* oracles  these establish an interface between Isabelle and trusted 

1361 
external reasoners, which may deliver results as theorems; 

1362 

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

1364 

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

1366 

1367 
* "constdefs" section in theory files; 

1368 

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

1370 

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

1372 

1373 

1374 

1375 
New in Isabelle945 

1376 
 

1377 

1378 
* reduced space requirements; 

1379 

1380 
* automatic HTML generation from theories; 

1381 

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

1383 

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

1385 

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

1387 

2553  1388 

2557  1389 

1390 
New in Isabelle944 

1391 
 

1392 

2747  1393 
* greatly reduced space requirements; 
2557  1394 

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

1396 

5726  1397 
* searchable theorem database (see the section "Retrieving theorems" on 
2557  1398 
page 8 of the Reference Manual); 
1399 

1400 
* new examples, including Grabczewski's monumental case study of the 

1401 
Axiom of Choice; 

1402 

1403 
* The previous version of HOL renamed to Old_HOL; 

1404 

5726  1405 
* The new version of HOL (previously called CHOL) uses a curried syntax 
2557  1406 
for functions. Application looks like f a b instead of f(a,b); 
1407 

1408 
* Mutually recursive inductive definitions finally work in HOL; 

1409 

1410 
* In ZF, patternmatching on tuples is now available in all abstractions and 

1411 
translates to the operator "split"; 

1412 

1413 

1414 

1415 
New in Isabelle943 

1416 
 

1417 

5726  1418 
* new infix operator, addss, allowing the classical reasoner to 
2557  1419 
perform simplification at each step of its search. Example: 
5726  1420 
fast_tac (cs addss ss) 
2557  1421 

5726  1422 
* a new logic, CHOL, the same as HOL, but with a curried syntax 
1423 
for functions. Application looks like f a b instead of f(a,b). Also pairs 

2557  1424 
look like (a,b) instead of <a,b>; 
1425 

1426 
* PLEASE NOTE: CHOL will eventually replace HOL! 

1427 

1428 
* In CHOL, patternmatching on tuples is now available in all abstractions. 

1429 
It translates to the operator "split". A new theory of integers is available; 

1430 

1431 
* In ZF, integer numerals now denote two'scomplement binary integers. 

1432 
Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML; 