author  wenzelm 
Thu, 13 Jul 2000 23:22:26 +0200  
changeset 9330  6861e3b00155 
parent 9288  06a55195741b 
child 9335  5d9f02e75569 
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 

36 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 

37 

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

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

39 
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

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

41 

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

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

43 

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

46 
use instead the strong form, 

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

48 
In HOL, FOL and ZF the function cla_make_elim will create such rules 
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset

49 
from destructrules. 
9185  50 

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

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

52 
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

53 

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

55 

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

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

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

58 

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

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

60 

8014  61 

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

63 

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

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

65 
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

66 
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

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

68 

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

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

71 

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

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

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

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

75 

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

78 

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

80 

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

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

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

83 

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

84 

8184  85 
*** Isar *** 
86 

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

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

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

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

90 

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

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

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

93 

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

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

95 
plain accumulation of results, without applying any rules yet; 
8184  96 

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

98 
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

99 
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

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

101 

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

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

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

104 

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

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

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

107 

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

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

109 

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

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

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

112 

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

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

114 
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

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

116 

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

119 

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

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

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

122 

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

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

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

125 

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

128 
(including splits); 

129 

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

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

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

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

133 

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

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

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

136 

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

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

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

139 

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

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

141 

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

143 

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

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

145 
contexts, but only proof states; 
8487  146 

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

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

8487  150 

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

153 
'induct_tac' (for HOL datatypes); 

154 

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

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

156 
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

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

158 

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

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

160 

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

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

162 
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

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

164 

9239  165 
* added 'nothing'  the empty list of theorems; 
166 

8184  167 

8014  168 
*** HOL *** 
169 

9028  170 
* HOL/Prolog: a (barebones) implementation of LambdaProlog 
171 

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

8014  174 

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

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

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

177 

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

8007  180 

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

183 
useful in avoiding lifting all operations; 

184 

8848  185 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
186 

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

189 

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

191 
Types nat and int belong to this axclass; 

192 

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

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

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

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

8736  200 

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

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

204 

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

207 
enable full simplification of caseexpressions for datatype t, you 

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

8603  209 
(Delcongs[thm"t.weak_case_cong"];) or locally (delcongs [...]). 
210 

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

213 
termination conditions are proved automatically, these simplification 

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

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

216 
each equation; 

217 

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

220 

8848  221 
* HOL: theorems impI, allI, ballI bound as "strip"; 
222 

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

224 
but was unused); 

8626  225 

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

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

227 
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

228 

8412  229 

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

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

231 

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

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

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

234 

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

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

237 

9052  238 
* provide TAGS file for Isabelle sources; 
239 

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

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

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

242 

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

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

244 
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

245 

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

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

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

248 

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

251 

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

252 

8015  253 

7986  254 
New in Isabelle99 (October 1999) 
255 
 

4649  256 

5931  257 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
258 

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

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

7215  262 

263 
Delcongs [if_weak_cong]; 

6922  264 

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

5931  267 

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

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

272 

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

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

274 
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

275 

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

6057  278 

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

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

6141  282 

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

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

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

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

289 
mk_solver: string > (thm list > int > tactic) > solver 
7619  290 
where the string argument is only a comment. 
6057  291 

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

292 

6069  293 
*** Proof tools *** 
294 

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

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

6069  299 

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

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

303 
matching. 

6069  304 

7593  305 

6014  306 
*** General *** 
307 

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

311 
readable proof documents (Isar == Intelligible semiautomated 

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

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

314 

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

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

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

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

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

319 
theories only); see isatool doc system for more information; 
7215  320 

7252  321 
* native support for Proof General, both for classic Isabelle and 
7986  322 
Isabelle/Isar; 
7215  323 

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

326 

6751  327 
* Isabelle manuals now also available as PDF; 
328 

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

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

6449  334 

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

337 

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

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

340 

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

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

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

344 

7215  345 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
346 

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

5973  349 

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

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

352 

6343  353 
* new print_mode "HTML"; 
354 

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

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

357 

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

360 

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

362 
244c244 

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

364 
 

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

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

369 
 

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

371 

7450  372 
* function bind_thms stores lists of theorems (cf. bind_thm); 
373 

7593  374 
* new shorthand tactics ftac, eatac, datac, fatac; 
375 

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

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

7593  379 

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

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

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

382 

6028  383 

6057  384 
*** HOL *** 
385 

7215  386 
** HOL arithmetic ** 
387 

6343  388 
* There are now decision procedures for linear arithmetic over nat and 
389 
int: 

6131  390 

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

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

394 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  399 

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

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

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

404 
simplifier. 

6131  405 

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

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

6028  409 

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

414 
type constraints; 

415 

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

417 
arguments; 

7157  418 

7215  419 
* many properties of integer multiplication, division and remainder 
420 
are now available; 

6922  421 

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

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

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

426 
invocation of the underlying oracle). For SVC see 

7444  427 
http://verify.stanford.edu/SVC 
6922  428 

7125  429 
* IsaMakefile: the HOLReal target now builds an actual image; 
430 

7215  431 

432 
** HOL misc ** 

433 

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

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

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

436 

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

439 

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

442 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

443 
changed syntax and (many) tactics; 

444 

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

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

448 
"mono" attribute); 

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

449 

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

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

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

452 

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

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

454 

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

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

7326  459 

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

461 
Delsimprocs [record_simproc] 

462 

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

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

464 
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

465 

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

468 

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

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

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

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

6563  473 

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

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

477 

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

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

479 
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

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

481 

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

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

483 
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

484 

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

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

486 
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

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

488 

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

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

493 

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

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

495 
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

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

497 

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

7492  500 

7215  501 

7113  502 
*** LK *** 
503 

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

7113  506 

507 
* the simplifier is now installed 

508 

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

509 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  510 

511 
* the classical reasoner now has a default rule database 

512 

513 

6064  514 
*** ZF *** 
515 

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

6269  517 
directly (as in HOL) over datatypes and the natural numbers; 
6064  518 

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

6064  521 

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

523 

6141  524 
* simplification automatically does freeness reasoning for datatype 
6269  525 
constructors; 
6141  526 

6269  527 
* automatic typeinference, with AddTCs command to insert new 
528 
typechecking rules; 

6155  529 

6269  530 
* datatype introduction rules are now added as Safe Introduction rules 
531 
to the claset; 

6155  532 

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

535 

6069  536 

6343  537 
*** Internal programming interfaces *** 
538 

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

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

540 

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

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

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

543 

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

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

545 

6343  546 
* tuned current_goals_markers semantics: begin / end goal avoids 
547 
printing empty lines; 

548 

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

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

551 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

553 

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

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

556 
mode to get Isabelle font glyphs as before; 

557 

558 
* refined token_translation interface; INCOMPATIBILITY: output length 

559 
now of type real instead of int; 

560 

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

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

564 
opposed to intratheory data slots offered via TheoryDataFun; 

565 

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

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

567 
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

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

571 

6343  572 

6064  573 

5781  574 
New in Isabelle981 (October 1998) 
575 
 

576 

5127  577 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  578 

5726  579 
* several changes of automated proof tools; 
5373  580 

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

5214  583 

5726  584 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  585 
called `inj_on'; 
5160  586 

5275  587 
* HOL: removed duplicate thms in Arith: 
588 
less_imp_add_less should be replaced by trans_less_add1 

589 
le_imp_add_le should be replaced by trans_le_add1 

5160  590 

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

5490  593 

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

596 
now taken as an integer constant. 

5541  597 

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

599 

5363  600 

5127  601 
*** Proof tools *** 
4880  602 

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

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

604 
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

605 
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

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

607 
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

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

609 
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

610 
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

611 
2. The simplifier now knows a little bit about natarithmetic. 
4880  612 

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

615 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

618 
one (emitting a warning). 

4824  619 
type wrapper = (int > tactic) > (int > tactic) 
4649  620 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  621 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
622 
delWrapper, delSWrapper: claset * string > claset 

4649  623 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
624 

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

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

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

629 
by Force_tac; 

5524  630 

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

5524  633 

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

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

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

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

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

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

642 
split_all_tac for record fields. 

5127  643 

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

646 
Addsimps. They can be removed via Delsplits just like 

647 
Delsimps. Lowercase versions are also available. 

5127  648 

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

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

652 
either remove split_if completely from the default simpset by 

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

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

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

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

657 
t is the name of the datatype). 

5127  658 

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

5726  662 
aimed to solve the given subgoal completely. 
5127  663 

664 

665 
*** General *** 

666 

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

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

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

4842  673 

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

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

679 

5127  680 
* new theory section 'nonterminals' for purely syntactic types; 
4858  681 

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

4869  684 

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

687 

5363  688 
* isatool install  install binaries with absolute references to 
689 
ISABELLE_HOME/bin; 

690 

5572  691 
* isatool logo  create instances of the Isabelle logo (as EPS); 
692 

5407  693 
* print mode 'emacs' reserved for Isamode; 
694 

5726  695 
* support multiple print (ast) translations per constant name; 
696 

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

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

698 

4711  699 

4661  700 
*** HOL *** 
701 

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

5217  704 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  705 
definitions such as 
5217  706 

707 
inductive EVEN ODD 

708 
intrs 

709 
null "0 : EVEN" 

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

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

712 

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

714 
recursive sets; inductive definitions now handle disjunctive premises 

715 
correctly (also ZF); 

5214  716 

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

719 
contained in "induct"; 

720 

721 

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

5267  723 
supports mutually recursive datatypes such as 
5217  724 

725 
datatype 

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

727 
 SUM ('a aexp) ('a aexp) 

728 
 DIFF ('a aexp) ('a aexp) 

729 
 NUM 'a 

730 
and 

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

732 
 AND ('a bexp) ('a bexp) 

733 
 OR ('a bexp) ('a bexp) 

734 

5267  735 
as well as indirectly recursive datatypes such as 
5214  736 

5217  737 
datatype 
738 
('a, 'b) term = Var 'a 

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

5214  740 

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

743 

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

745 
<function_name>.simps. 

746 

747 
INCOMPATIBILITIES: 

5214  748 

5217  749 
 Theories using datatypes must now have theory Datatype as an 
750 
ancestor. 

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

752 
generic induct_tac instead. 

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

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

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

760 
some datatype definitions may have to be annotated with explicit 

761 
sort constraints. 

762 
 Primrec definitions no longer require function name and type 

763 
of recursive argument. 

5214  764 

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

767 

768 

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

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

772 
support is as follows: 

773 

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

775 
constructor terms) are part of the standard simpset; 

776 

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

778 
made part of standard simpset and claset via addIffs; 

779 

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

781 
the standard claset (addSWrapper); 

782 

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

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

785 
the name of your record type. 

786 

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

788 

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

790 

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

792 
blow up into some record constructor term, consequently the 

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

794 
solve record problems automatically. 

795 

5214  796 

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

799 

5650  800 
* automatic simplification of integer sums and comparisons, using cancellation; 
801 

5526  802 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  803 

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

805 

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

807 

808 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

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

810 
with add/delsplits); 

5125  811 

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

814 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

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

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

818 
%u.f(); 

5125  819 

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

5109  822 

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

825 
disjointness reasoning but breaking a few old proofs. 

5267  826 

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

829 
literature); 

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

830 

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

4838  833 

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

836 
release ONLY. 

837 

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

840 
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

841 

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

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

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

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

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

5282  850 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  851 

5127  852 
* HOL/Arith: 
853 
 removed 'pred' (predecessor) function; 

854 
 generalized some theorems about n1; 

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

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

4766  857 

5127  858 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  859 
instead of "inverse"; 
4711  860 

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

863 

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

5127  867 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  868 

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

871 

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

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

875 

5363  876 

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

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

878 

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

5160  881 

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

884 
disjointness reasoning but breaking a few old proofs. 

5267  885 

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

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

889 

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

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

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

5308  894 
Now rew can involve either definitions or equalities (either == or =). 
5142  895 

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

898 

4842  899 

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

901 

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

5207  904 

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

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

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

909 

5251  910 
* removed global_names compatibility flag  all theory declarations 
911 
are qualified by default; 

912 

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

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

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

916 

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

919 

5207  920 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
921 
subgoal; 

5142  922 

5251  923 
* Display.print_goals function moved to Locale.print_goals; 
924 

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

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

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

929 
for example; 

930 

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

931 

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

932 

4410  933 
New in Isabelle98 (January 1998) 
934 
 

935 

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

937 

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

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

940 

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

942 
simpset / simpset_ref; 

943 

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

945 
implicit merge of thms' signatures; 

946 

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

948 

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

950 

3454  951 

3715  952 
*** General Changes *** 
953 

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

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

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

961 
backward campatibility problems try setting 'global_names' at compile 

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

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

964 
section; 

4108  965 

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

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

968 
replaced by functions simpset:unit>simpset and 

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

970 
to patch your ML files accordingly; 

3856  971 

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

3901  974 
usedir (see i option, ISABELLE_USEDIR_OPTIONS); 
3857  975 

3856  976 
* defs may now be conditional; improved rewrite_goals_tac to handle 
977 
conditional equations; 

978 

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

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

4112  983 
restricted to 'trivial' ones; COMPATIBILITY: one may have to use 
3901  984 
transfer:theory>thm>thm in (rare) cases; 
985 

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

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

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

988 

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

991 

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

993 
show_types); 

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

994 

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

996 

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

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

998 

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

1000 

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

1002 

3715  1003 
* removed obsolete init_pps and init_database; 
1004 

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

1006 
fun STATE tacfun st = tacfun st st; 

1007 

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

4269  1010 

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

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

1013 
qualified references to the Sequence structure only!); 

1014 

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

4269  1017 

3715  1018 

1019 
*** Classical Reasoner *** 

1020 

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

1023 
splitting it into several subgoals; 

3715  1024 

3719  1025 
* Safe_tac: like safe_tac but uses the default claset; 
1026 

3715  1027 

1028 
*** Simplifier *** 

1029 

1030 
* added simplification meta rules: 

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

1032 

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

1034 
logics (again); 

1035 

1036 
* added prems argument to simplification procedures; 

1037 

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

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

1041 

3715  1042 

1043 
*** Syntax *** 

1044 

4174  1045 
* TYPE('a) syntax for type reflection terms; 
1046 

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

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

3846  1050 

3715  1051 
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; 
1052 

1053 

1054 
*** HOL *** 

1055 

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

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

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

4035  1062 
protocol TLS; 
3985  1063 

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

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

1068 
differences; simplification procedures nat_cancel_factor for 

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

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

4335  1072 

3580  1073 
* HOL/simplifier: terms of the form 
4325  1074 
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x) 
3580  1075 
are rewritten to 
4035  1076 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)', 
1077 
and those of the form 

4325  1078 
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) > R(x)' (or t=x) 
4035  1079 
are rewritten to 
1080 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) > R(t)', 

1081 

1082 
* HOL/datatype 

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

3580  1084 

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

1087 
... 

4189  1088 
(!y1 ... ymn. x = Cn y1 ... ymn > P(f1 y1 ... ymn)) 
4035  1089 
) 
1090 

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

1091 
and a theorem `split_t_case_asm' of the form 
4189  1092 

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

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

1095 
... 

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

1097 
) 

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

1098 
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

1099 
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

1100 
split_list_case and split_option_case. 
4189  1101 

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

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

1105 
because it will disappear altogether at some point. 

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

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

1108 
`standard'. 

4357  1109 

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

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

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

3570  1114 

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

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

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

1119 

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

1122 
still lacks various theorems and concrete record syntax; 

1123 

4125  1124 

3715  1125 
*** HOLCF *** 
3535  1126 

4125  1127 
* removed "axioms" and "generated by" sections; 
1128 

4123  1129 
* replaced "ops" section by extended "consts" section, which is capable of 
4125  1130 
handling the continuous function space ">" directly; 
1131 

1132 
* domain package: 

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

1134 
. creates hierachical name space, 

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

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

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

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

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

1140 
appear on the lefthand side of the equations only; 

4123  1141 

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

3567  1143 

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

3579  1146 

1147 

3719  1148 
*** FOL and ZF *** 
1149 

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

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

1155 

3719  1156 

3579  1157 

3006  1158 
New in Isabelle948 (May 1997) 
1159 
 

2654  1160 

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

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

1162 

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

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

1164 
still somewhat experimental); old Makefiles etc. still functional; 
2971  1165 

3205  1166 
* new 'Isabelle System Manual'; 
1167 

2825  1168 
* INSTALL text, together with ./configure and ./build scripts; 
2773  1169 

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

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

1172 

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

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

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

1175 

3006  1176 

1177 
*** Syntax *** 

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

1178 

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

1181 

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

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

1183 
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

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

1185 

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

1190 
(Syntax.mark_boundT); 

2705  1191 

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

2730  1195 

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

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

1197 

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

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

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

1200 

3006  1201 

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

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

1203 

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

1204 
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

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

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

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

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

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

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

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

1213 

3107  1214 
* substitution with equality assumptions no longer permutes other 
1215 
assumptions; 

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

1216 

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

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

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

1220 

5726  1221 
* improved combination of classical reasoner and simplifier: 
3317  1222 
+ functions for handling clasimpsets 
1223 
+ improvement of addss: now the simplifier is called _after_ the 

1224 
safe steps. 

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

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

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

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

1230 

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

1233 
redex); 

1234 

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

1236 

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

1238 

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

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

1240 
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

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

1243 

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

1244 

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

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

1246 

3042  1247 
* a generic induction tactic `induct_tac' which works for all datatypes and 
3107  1248 
also for type `nat'; 
3042  1249 

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

1252 

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

1254 

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

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

1257 

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

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

1259 

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

1262 

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

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

1265 

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

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

1268 

3227  1269 
* HOL/Modelcheck demonstrates invocation of model checker oracle; 
1270 

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

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

1272 
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

1273 

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

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

1275 

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

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

1277 

3321  1278 
* a new constant `arbitrary == @x.False'; 
1279 

3107  1280 
* HOLCF/IOA replaces old HOL/IOA; 
1281 

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

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

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

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

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

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

3006  1292 

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

1293 
*** ZF *** 
2553  1294 

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

1297 
as ZF_cs addSIs [equalityI]; 

2553  1298 

2554  1299 

2732  1300 

2553  1301 
New in Isabelle947 (November 96) 
1302 
 

1303 

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

1305 

2554  1306 
* superlinear speedup for large simplifications; 
1307 

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

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

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

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

1312 

1313 
* improved printing of ==> : ~: 

1314 

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

1316 
and Modal (thanks to Sara Kalvala); 

1317 

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

1319 

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

1321 
examples on HOL/Auth); 

1322 

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

1324 
the rewriter and classical reasoner simultaneously; 

1325 

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

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

1328 

1329 

1330 

1331 
New in Isabelle946 

1332 
 

1333 

1334 
* oracles  these establish an interface between Isabelle and trusted 

1335 
external reasoners, which may deliver results as theorems; 

1336 

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

1338 

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

1340 

1341 
* "constdefs" section in theory files; 

1342 

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

1344 

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

1346 

1347 

1348 

1349 
New in Isabelle945 

1350 
 

1351 

1352 
* reduced space requirements; 

1353 

1354 
* automatic HTML generation from theories; 

1355 

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

1357 

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

1359 

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

1361 

2553  1362 

2557  1363 

1364 
New in Isabelle944 

1365 
 

1366 

2747  1367 
* greatly reduced space requirements; 
2557  1368 

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

1370 

5726  1371 
* searchable theorem database (see the section "Retrieving theorems" on 
2557  1372 
page 8 of the Reference Manual); 
1373 

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

1375 
Axiom of Choice; 

1376 

1377 
* The previous version of HOL renamed to Old_HOL; 

1378 

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

1382 
* Mutually recursive inductive definitions finally work in HOL; 

1383 

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

1385 
translates to the operator "split"; 

1386 

1387 

1388 

1389 
New in Isabelle943 

1390 
 

1391 

5726  1392 
* new infix operator, addss, allowing the classical reasoner to 
2557  1393 
perform simplification at each step of its search. Example: 
5726  1394 
fast_tac (cs addss ss) 
2557  1395 

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

2557  1398 
look like (a,b) instead of <a,b>; 
1399 

1400 
* PLEASE NOTE: CHOL will eventually replace HOL! 

1401 

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

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

1404 

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

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

1407 

5726  1408 
* Many new examples: I/O automata, ChurchRosser theorem, equivalents 
2557  1409 
of the Axiom of Choice; 
1410 

1411 

1412 

1413 
New in Isabelle942 

1414 
 

1415 

5726  1416 
* Significantly faster resolution; 
2557  1417 

1418 
* the different sections in a .thy file can now be mixed and repeated 

1419 
freely; 

1420 

1421 
* Database of theorems for FOL, HOL and ZF. New 

1422 
commands including qed, qed_goal and bind_thm store theorems in the database. 

1423 

1424 
* Simple database queries: return a named theorem (get_thm) or all theorems of 

1425 
a given theory (thms_of), or find out what theory a theorem was proved in 

1426 
(theory_of_thm); 

1427 

1428 
* Bugs fixed in the inductive definition and datatype packages; 

1429 

1430 
* The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs 

1431 
and HOL_dup_cs obsolete; 

1432 

1433 
* Syntactic ambiguities caused by the new treatment of syntax in Isabelle941 

