author  paulson 
Thu, 02 Nov 2000 11:00:29 +0100  
changeset 10365  a17cf465d29a 
parent 10337  fca9cd9fd115 
child 10391  0025fd11882c 
permissions  rwrr 
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1 

5363  2 
Isabelle NEWS  history userrelevant changes 
3 
============================================== 

2553  4 

10224  5 
*** Overview of INCOMPATIBILITIES *** 
6 

7 
* HOL: induct renamed to lfp_induct; 

8 

10288  9 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
10 

10224  11 

10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

12 
*** Document preparation *** 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

13 

87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

14 
* improved isabelle style files; more abstract symbol implementation 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

15 
(should now use \isamath{...} and \isatext{...} in custom symbol 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

16 
definitions); 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

17 

10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

18 
* support sub/super scripts (for single symbols only), input syntax is 
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

19 
like this: "A\<^sup>*" or "A\<^sup>\<star>"; 
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

20 

df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

21 
* antiquotation @{goals} for output of *dynamic* goals state; Note 
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

22 
that presentation of goal states does not conform to actual 
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

23 
humanreadable proof documents. Please do not include goal states 
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

24 
into document output unless you really know what you are doing! 
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

25 

df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

26 

10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

27 

10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

28 
*** Isar *** 
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

29 

b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

30 
* HOL: default proof step now includes 'intro_classes'; 
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

31 

b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

32 

10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

33 
*** HOL *** 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

34 

87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

35 
* HOL/Library: a collection of generic theories to be used together 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

36 
with main HOL; the theory loader path already includes this directory 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

37 
by default; the following existing theories have been moved here: 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

38 
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While 
10337  39 
(as While_Combinator), HOL/Lex/Prefix (as List_Prefix); 
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

40 

87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

41 

10103  42 
New in Isabelle991 (October 2000) 
43 
 

8015  44 

10003  45 
*** Overview of INCOMPATIBILITIES *** 
8014  46 

8848  47 
* HOL: simplification of natural numbers is much changed; to partly 
48 
recover the old behaviour (e.g. to prevent n+n rewriting to #2*n) 

49 
issue the following ML commands: 

50 

51 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

52 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  53 

10129  54 
* HOL: simplification no longer dives into caseexpressions; this is 
55 
controlled by "t.weak_case_cong" for each datatype t; 

10003  56 

57 
* HOL: nat_less_induct renamed to less_induct; 

58 

59 
* HOL: systematic renaming of the SOME (Eps) rules, may use isatool 

60 
fixsome to patch .thy and .ML sources automatically; 

8967  61 

10003  62 
select_equality > some_equality 
63 
select_eq_Ex > some_eq_ex 

64 
selectI2EX > someI2_ex 

65 
selectI2 > someI2 

66 
selectI > someI 

67 
select1_equality > some1_equality 

68 
Eps_sym_eq > some_sym_eq_trivial 

69 
Eps_eq > some_eq_trivial 

70 

71 
* HOL: exhaust_tac on datatypes superceded by new generic case_tac; 

72 

73 
* HOL: removed obsolete theorem binding expand_if (refer to split_if 

74 
instead); 

75 

76 
* HOL: the recursion equations generated by 'recdef' are now called 

77 
f.simps instead of f.rules; 

78 

79 
* HOL: qed_spec_mp now also handles bounded ALL as well; 

80 

81 
* HOL: 0 is now overloaded, so the type constraint ":: nat" may 

82 
sometimes be needed; 

83 

84 
* HOL: the constant for "f``x" is now "image" rather than "op ``"; 

8014  85 

10065  86 
* HOL: the constant for "f``x" is now "vimage" rather than "op ``"; 
87 

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

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

89 
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

90 
now "<*lex*>" instead of "**"; 
8705  91 

10003  92 
* HOL: theory Sexp is now in HOL/Induct examples (it used to be part 
93 
of main HOL, but was unused); better use HOL's datatype package; 

9971  94 

10137
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

95 
* HOL: removed "symbols" syntax for constant "override" of theory Map; 
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

96 
the old syntax may be recovered as follows: 
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

97 

d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

98 
syntax (symbols) 
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

99 
override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)" 
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

100 
(infixl "\\<oplus>" 100) 
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

101 

8848  102 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
103 

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

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

105 
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

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

107 

10003  108 
* HOL and ZF: syntax for quotienting wrt an equivalence relation 
109 
changed from A/r to A//r; 

9908  110 

10003  111 
* ZF: new treatment of arithmetic (nat & int) may break some old 
112 
proofs; 

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

113 

10003  114 
* Isar: renamed some attributes (RS > THEN, simplify > simplified, 
115 
rulify > rule_format, elimify > elim_format, ...); 

9542  116 

9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset

117 
* Isar/Provers: intro/elim/dest attributes changed; renamed 
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset

118 
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one 
9937  119 
should have to change intro!! to intro? only); replaced "delrule" by 
120 
"rule del"; 

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

121 

9612  122 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
123 

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

124 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  125 

10003  126 
* LaTeX document preparation: several changes of isabelle.sty (see 
127 
lib/texinputs); 

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

128 

8014  129 

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

131 

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

132 
* formal comments (text blocks etc.) in newstyle theories may now 
9753  133 
contain antiquotations of thm/prop/term/typ/text to be presented 
134 
according to latex print mode; concrete syntax is like this: 

135 
@{term[show_types] "f(x) = a + x"}; 

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

136 

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

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

139 

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

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

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

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

143 

8566  144 
* isatool usedir D now lets isatool latex o sty update the Isabelle 
10003  145 
style files, achieving selfcontained LaTeX sources and simplifying 
146 
LaTeX debugging; 

8566  147 

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

149 

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

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

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

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

153 

10003  154 
* several improvements in isabelle style files; \isabellestyle{it} 
155 
produces fake math mode output; \isamarkupheader is now \section by 

156 
default; see lib/texinputs/isabelle.sty etc.; 

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

157 

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

158 

8184  159 
*** Isar *** 
160 

10003  161 
* Isar/Pure: local results and corresponding term bindings are now 
162 
subject to HindleyMilner polymorphism (similar to ML); this 

163 
accommodates incremental typeinference very nicely; 

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

164 

10003  165 
* Isar/Pure: new derived language element 'obtain' supports 
166 
generalized existence reasoning; 

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

167 

10003  168 
* Isar/Pure: new calculational elements 'moreover' and 'ultimately' 
169 
support accumulation of results, without applying any rules yet; 

170 
useful to collect intermediate results without explicit name 

171 
references, and for use with transitivity rules with more than 2 

172 
premises; 

8184  173 

10003  174 
* Isar/Pure: scalable support for caseanalysis type proofs: new 
175 
'case' language element refers to local contexts symbolically, as 

176 
produced by certain proof methods; internally, case names are attached 

177 
to theorems as "tags"; 

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

178 

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

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

181 

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

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

184 

10003  185 
* Isar/Pure: changed syntax of local blocks from {{ }} to { }; 
8621
8ba0f90f6f35
* Isar/Pure: local results and corresponding term bindings are now
wenzelm
parents:
8603
diff
changeset

186 

10003  187 
* Isar/Pure: syntax of sorts made 'inner', i.e. have to write 
188 
"{a,b,c}" instead of {a,b,c}; 

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

189 

10003  190 
* Isar/Pure now provides its own version of intro/elim/dest 
191 
attributes; useful for building new logics, but beware of confusion 

192 
with the version in Provers/classical; 

9612  193 

10003  194 
* Isar/Pure: the local context of (nonatomic) goals is provided via 
195 
case name 'antecedent'; 

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

196 

10003  197 
* Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms 
198 
to the current context is now done automatically); 

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

199 

10003  200 
* Isar/Pure: theory command 'method_setup' provides a simple interface 
201 
for definining proof methods in ML; 

9612  202 

10003  203 
* Isar/Provers: intro/elim/dest attributes changed; renamed 
9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset

204 
intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in 
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset

205 
most cases, one should have to change intro!! to intro? only); 
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset

206 
replaced "delrule" by "rule del"; 
8283
0a319c5746eb
* Pure now provides its own version of intro/elim/dest attributes;
wenzelm
parents:
8271
diff
changeset

207 

10003  208 
* Isar/Provers: new 'hypsubst' method, plain 'subst' method and 
209 
'symmetric' attribute (the latter supercedes [RS sym]); 

210 

211 
* Isar/Provers: splitter support (via 'split' attribute and 'simp' 

212 
method modifier); 'simp' method: 'only:' modifier removes loopers as 

213 
well (including splits); 

214 

215 
* Isar/Provers: Simplifier and Classical methods now support all kind 

216 
of modifiers used in the past, including 'cong', 'iff', etc. 

217 

218 
* Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination 

219 
of Simplifier and Classical reasoner); 

220 

221 
* Isar/HOL: new proof method 'cases' and improved version of 'induct' 

222 
now support named cases; major packages (inductive, datatype, primrec, 

223 
recdef) support case names and properly name parameters; 

9612  224 

10003  225 
* Isar/HOL: new transitivity rules for substitution in inequalities  
226 
monotonicity conditions are extracted to be proven at end of 

227 
calculations; 

228 

229 
* Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof 

230 
method anyway; 

231 

232 
* Isar/HOL: removed old expand_if = split_if; theorems if_splits = 

233 
split_if split_if_asm; datatype package provides theorems foo.splits = 

234 
foo.split foo.split_asm for each datatype; 

235 

236 
* Isar/HOL: tuned inductive package, rename "intrs" to "intros" 

237 
(potential INCOMPATIBILITY), emulation of mk_cases feature for proof 

238 
scripts: new 'inductive_cases' command and 'ind_cases' method; (Note: 

239 
use "(cases (simplified))" method in proper proof texts); 

240 

241 
* Isar/HOL: added global 'arith_split' attribute for 'arith' method; 

242 

243 
* Isar: names of theorems etc. may be natural numbers as well; 

244 

245 
* Isar: 'pr' command: optional arguments for goals_limit and 

9724
2030c5d63741
* 'pr' command: optional argument for ProofContext.prems_limit;
wenzelm
parents:
9709
diff
changeset

246 
ProofContext.prems_limit; no longer prints theory contexts, but only 
2030c5d63741
* 'pr' command: optional argument for ProofContext.prems_limit;
wenzelm
parents:
9709
diff
changeset

247 
proof states; 
8487  248 

10003  249 
* Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit 
8518  250 
additional print modes to be specified; e.g. "pr(latex)" will print 
251 
proof state according to the Isabelle LaTeX style; 

8487  252 

10003  253 
* Isar: improved support for emulating tactic scripts, including proof 
9612  254 
methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac', 
255 
'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac' 

256 
(for HOL datatypes); 

8534  257 

10003  258 
* Isar: simplified (more robust) goal selection of proof methods: 1st 
259 
goal, all goals, or explicit goal specifier (tactic emulation); thus 

260 
'proof method scripts' have to be in depthfirst order; 

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

261 

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

263 

10003  264 
* Isar: removed 'help' command, which hasn't been too helpful anyway; 
265 
should instead use individual commands for printing items 

266 
(print_commands, print_methods etc.); 

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

267 

10003  268 
* Isar: added 'nothing'  the empty list of theorems; 
9239  269 

8184  270 

8014  271 
*** HOL *** 
272 

10080  273 
* HOL/MicroJava: formalization of a fragment of Java, together with a 
274 
corresponding virtual machine and a specification of its bytecode 

275 
verifier and a lightweight bytecode verifier, including proofs of 

276 
typesafety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and 

277 
Cornelia Pusch (see also the homepage of project Bali at 

278 
http://isabelle.in.tum.de/Bali/); 

279 

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

8014  282 

10157
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

283 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  284 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
285 
Rasmussen; 

8570  286 

10157
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

287 
* HOL/Lattice: fundamental concepts of lattice theory and order 
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

288 
structures, including duals, properties of bounds versus algebraic 
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

289 
laws, lattice operations versus settheoretic ones, the KnasterTarski 
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

290 
Theorem for complete lattices etc.; may also serve as a demonstration 
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

291 
for abstract algebraic reasoning using axiomatic type classes, and 
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

292 
mathematicsstyle proof in Isabelle/Isar; by Markus Wenzel; 
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset

293 

10003  294 
* HOL/Prolog: a (barebones) implementation of LambdaProlog, by David 
295 
von Oheimb; 

9542  296 

10164
c240747082aa
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm
parents:
10157
diff
changeset

297 
* HOL/IMPP: extension of IMP with local variables and mutually 
c240747082aa
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm
parents:
10157
diff
changeset

298 
recursive procedures, by David von Oheimb; 
c240747082aa
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm
parents:
10157
diff
changeset

299 

10003  300 
* HOL/Lambda: converted into newstyle theory and document; 
9542  301 

10003  302 
* HOL/ex/Multiquote: example of multiple nested quotations and 
303 
antiquotations  basically a generalized version of deBruijn 

304 
representation; very useful in avoiding lifting of operations; 

8848  305 

9612  306 
* HOL/record: added general record equality rule to simpset; fixed 
307 
selectupdate simplification procedure to handle extended records as 

308 
well; admit "r" as field name; 

9542  309 

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

312 

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

314 
Types nat and int belong to this axclass; 

315 

10003  316 
* HOL: greatly improved simplification involving numerals of type nat, int, real: 
8788  317 
(i + #8 + j) = Suc k simplifies to #7 + (i + j) = k 
8832  318 
i*j + k + j*#3*i simplifies to #4*(i*j) + k 
319 
two terms #m*u and #n*u are replaced by #(m+n)*u 

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

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

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

8736  323 

10003  324 
* HOL: meson_tac is available (previously in ex/meson.ML); it is a 
325 
powerful prover for predicate logic but knows nothing of clasets; see 

326 
ex/mesontest.ML and ex/mesontest2.ML for example applications; 

9835  327 

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

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

331 

8848  332 
* HOL: simplification no longer dives into caseexpressions: only the 
10129  333 
selector expression is simplified, but not the remaining arms; to 
334 
enable full simplification of caseexpressions for datatype t, you may 

335 
remove t.weak_case_cong from the simpset, either globally (Delcongs 

336 
[thm"t.weak_case_cong"];) or locally (delcongs [...]). 

8603  337 

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

340 
termination conditions are proved automatically, these simplification 

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

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

343 
each equation; 

344 

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

345 
* HOL/While is a new theory that provides a whilecombinator. It 
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

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

347 
provision of a termination measure. The latter is necessary once the 
aa757b35b129
* blast(_tac) now handles actual objectlogic rules as assumptions;
wenzelm
parents:
9457
diff
changeset

348 
invariant proof rule for while is applied. 
9457  349 

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

8925  352 

8848  353 
* HOL: theorems impI, allI, ballI bound as "strip"; 
354 

10003  355 
* HOL: new tactic induct_thm_tac: thm > string > int > tactic 
9746  356 
induct_tac th "x1 ... xn" expects th to have a conclusion of the form 
357 
P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th; 

358 

10003  359 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  360 

10003  361 
* HOL: theory Sexp now in HOL/Induct examples (it used to be part of 
362 
main HOL, but was unused); 

8626  363 

10003  364 
* HOL: fewer consts declared as global (e.g. have to refer to 
365 
"Lfp.lfp" instead of "lfp" internally; affects ML packages only); 

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

366 

10003  367 
* HOL: tuned AST representation of nested pairs, avoiding bogus output 
368 
in case of overlap with user translations (e.g. judgements over 

369 
tuples); (note that the underlying logical represenation is still 

370 
bogus); 

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

371 

8412  372 

9542  373 
*** ZF *** 
374 

10003  375 
* ZF: simplification automatically cancels common terms in arithmetic 
376 
expressions over nat and int; 

9542  377 

10003  378 
* ZF: new treatment of nat to minimize typechecking: all operators 
379 
coerce their operands to a natural number using the function natify, 

380 
making the algebraic laws unconditional; 

9542  381 

10003  382 
* ZF: as above, for int: operators coerce their operands to an integer 
383 
using the function intify; 

9542  384 

10003  385 
* ZF: the integer library now contains many of the usual laws for the 
386 
orderings, including $<=, and monotonicity laws for $+ and $*; 

9542  387 

10003  388 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
389 
simplification; 

9388  390 

10003  391 
* FOL and ZF: AddIffs now available, giving theorems of the form P<>Q 
392 
to the simplifier and classical reasoner simultaneously; 

9388  393 

394 

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

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

396 

10003  397 
* Provers: blast_tac now handles actual objectlogic rules as 
398 
assumptions; note that auto_tac uses blast_tac internally as well; 

399 

400 
* Provers: new functions rulify/rulify_no_asm: thm > thm for turning 

401 
outer >/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm; 

402 

9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset

403 
* Provers: delrules now handles destruct rules as well (no longer need 
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset

404 
explicit make_elim); 
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset

405 

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

408 
use instead the strong form, 

409 
[ inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W ] ==> ?W 

410 
in HOL, FOL and ZF the function cla_make_elim will create such rules 

411 
from destructrules; 

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

412 

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

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

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

415 

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

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

417 

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

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

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

420 

10003  421 
* system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and 
422 
XSYMBOL_HOME; no longer need to do manual configuration in most 

423 
situations; 

424 

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

425 
* system: compression of ML heaps images may now be controlled via c 
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset

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

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

428 

9981
01a0c4772c18
system: isatool installfonts may handle XSymbol fonts as well;
wenzelm
parents:
9971
diff
changeset

429 
* system: isatool installfonts may handle XSymbol fonts as well (very 
01a0c4772c18
system: isatool installfonts may handle XSymbol fonts as well;
wenzelm
parents:
9971
diff
changeset

430 
useful for remote X11); 
01a0c4772c18
system: isatool installfonts may handle XSymbol fonts as well;
wenzelm
parents:
9971
diff
changeset

431 

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

432 
* system: provide TAGS file for Isabelle sources; 
9052  433 

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

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

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

436 

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

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

438 
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

439 

10003  440 
* ML: new combinators >> and >>> for incremental transformations 
441 
with secondary results (e.g. certain theory extensions): 

442 

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

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

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

445 

10003  446 
* ML: PureThy.add_thms/add_axioms/add_defs now return theorems as 
447 
results; 

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

448 

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

449 

8015  450 

7986  451 
New in Isabelle99 (October 1999) 
452 
 

4649  453 

5931  454 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
455 

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

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

7215  459 

460 
Delcongs [if_weak_cong]; 

6922  461 

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

5931  464 

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

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

469 

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

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

471 
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

472 

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

6057  475 

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

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

6141  479 

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

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

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

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

486 
mk_solver: string > (thm list > int > tactic) > solver 
7619  487 
where the string argument is only a comment. 
6057  488 

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

489 

6069  490 
*** Proof tools *** 
491 

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

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

6069  496 

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

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

500 
matching. 

6069  501 

7593  502 

6014  503 
*** General *** 
504 

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

508 
readable proof documents (Isar == Intelligible semiautomated 

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

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

511 

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

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

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

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

7215  517 

7252  518 
* native support for Proof General, both for classic Isabelle and 
7986  519 
Isabelle/Isar; 
7215  520 

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

523 

6751  524 
* Isabelle manuals now also available as PDF; 
525 

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

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

6449  531 

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

534 

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

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

537 

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

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

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

541 

7215  542 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
543 

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

5973  546 

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

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

549 

6343  550 
* new print_mode "HTML"; 
551 

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

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

554 

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

557 

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

559 
244c244 

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

561 
 

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

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

566 
 

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

568 

7450  569 
* function bind_thms stores lists of theorems (cf. bind_thm); 
570 

7593  571 
* new shorthand tactics ftac, eatac, datac, fatac; 
572 

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

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

7593  576 

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

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

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

579 

6028  580 

6057  581 
*** HOL *** 
582 

7215  583 
** HOL arithmetic ** 
584 

6343  585 
* There are now decision procedures for linear arithmetic over nat and 
586 
int: 

6131  587 

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

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

591 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  596 

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

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

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

601 
simplifier. 

6131  602 

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

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

6028  606 

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

611 
type constraints; 

612 

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

614 
arguments; 

7157  615 

7215  616 
* many properties of integer multiplication, division and remainder 
617 
are now available; 

6922  618 

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

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

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

623 
invocation of the underlying oracle). For SVC see 

7444  624 
http://verify.stanford.edu/SVC 
6922  625 

7125  626 
* IsaMakefile: the HOLReal target now builds an actual image; 
627 

7215  628 

629 
** HOL misc ** 

630 

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

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

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

633 

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

636 

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

639 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

640 
changed syntax and (many) tactics; 

641 

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

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

645 
"mono" attribute); 

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

646 

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

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

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

649 

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

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

651 

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

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

7326  656 

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

658 
Delsimprocs [record_simproc] 

659 

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

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

661 
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

662 

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

665 

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

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

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

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

6563  670 

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

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

674 

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

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

676 
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

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

678 

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

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

680 
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

681 

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

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

683 
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

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

685 

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

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

690 

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

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

692 
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

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

694 

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

7492  697 

7215  698 

7113  699 
*** LK *** 
700 

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

7113  703 

704 
* the simplifier is now installed 

705 

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

706 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  707 

708 
* the classical reasoner now has a default rule database 

709 

710 

6064  711 
*** ZF *** 
712 

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

6269  714 
directly (as in HOL) over datatypes and the natural numbers; 
6064  715 

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

6064  718 

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

720 

6141  721 
* simplification automatically does freeness reasoning for datatype 
6269  722 
constructors; 
6141  723 

6269  724 
* automatic typeinference, with AddTCs command to insert new 
725 
typechecking rules; 

6155  726 

6269  727 
* datatype introduction rules are now added as Safe Introduction rules 
728 
to the claset; 

6155  729 

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

732 

6069  733 

6343  734 
*** Internal programming interfaces *** 
735 

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

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

737 

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

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

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

740 

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

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

742 

6343  743 
* tuned current_goals_markers semantics: begin / end goal avoids 
744 
printing empty lines; 

745 

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

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

748 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

750 

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

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

753 
mode to get Isabelle font glyphs as before; 

754 

755 
* refined token_translation interface; INCOMPATIBILITY: output length 

756 
now of type real instead of int; 

757 

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

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

761 
opposed to intratheory data slots offered via TheoryDataFun; 

762 

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

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

764 
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

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

768 

6343  769 

6064  770 

5781  771 
New in Isabelle981 (October 1998) 
772 
 

773 

5127  774 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  775 

5726  776 
* several changes of automated proof tools; 
5373  777 

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

5214  780 

5726  781 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  782 
called `inj_on'; 
5160  783 

5275  784 
* HOL: removed duplicate thms in Arith: 
785 
less_imp_add_less should be replaced by trans_less_add1 

786 
le_imp_add_le should be replaced by trans_le_add1 

5160  787 

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

5490  790 

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

793 
now taken as an integer constant. 

5541  794 

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

796 

5363  797 

5127  798 
*** Proof tools *** 
4880  799 

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

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

801 
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

802 
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

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

804 
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

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

806 
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

807 
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

808 
2. The simplifier now knows a little bit about natarithmetic. 
4880  809 

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

812 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

815 
one (emitting a warning). 

4824  816 
type wrapper = (int > tactic) > (int > tactic) 
4649  817 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  818 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
819 
delWrapper, delSWrapper: claset * string > claset 

4649  820 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
821 

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

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

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

826 
by Force_tac; 

5524  827 

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

5524  830 

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

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

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

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

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

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

839 
split_all_tac for record fields. 

5127  840 

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

843 
Addsimps. They can be removed via Delsplits just like 

844 
Delsimps. Lowercase versions are also available. 

5127  845 

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

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

849 
either remove split_if completely from the default simpset by 

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

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

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

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

854 
t is the name of the datatype). 

5127  855 

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

5726  859 
aimed to solve the given subgoal completely. 
5127  860 

861 

862 
*** General *** 

863 

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

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

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

4842  870 

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

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

876 

5127  877 
* new theory section 'nonterminals' for purely syntactic types; 
4858  878 

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

4869  881 

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

884 

5363  885 
* isatool install  install binaries with absolute references to 
886 
ISABELLE_HOME/bin; 

887 

5572  888 
* isatool logo  create instances of the Isabelle logo (as EPS); 
889 

5407  890 
* print mode 'emacs' reserved for Isamode; 
891 

5726  892 
* support multiple print (ast) translations per constant name; 
893 

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

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

895 

4711  896 

4661  897 
*** HOL *** 
898 

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

5217  901 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  902 
definitions such as 
5217  903 

904 
inductive EVEN ODD 

905 
intrs 

906 
null "0 : EVEN" 

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

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

909 

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

911 
recursive sets; inductive definitions now handle disjunctive premises 

912 
correctly (also ZF); 

5214  913 

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

916 
contained in "induct"; 

917 

918 

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

5267  920 
supports mutually recursive datatypes such as 
5217  921 

922 
datatype 

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

924 
 SUM ('a aexp) ('a aexp) 

925 
 DIFF ('a aexp) ('a aexp) 

926 
 NUM 'a 

927 
and 

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

929 
 AND ('a bexp) ('a bexp) 

930 
 OR ('a bexp) ('a bexp) 

931 

5267  932 
as well as indirectly recursive datatypes such as 
5214  933 

5217  934 
datatype 
935 
('a, 'b) term = Var 'a 

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

5214  937 

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

940 

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

942 
<function_name>.simps. 

943 

944 
INCOMPATIBILITIES: 

5214  945 

5217  946 
 Theories using datatypes must now have theory Datatype as an 
947 
ancestor. 

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

949 
generic induct_tac instead. 

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

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

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

957 
some datatype definitions may have to be annotated with explicit 

958 
sort constraints. 

959 
 Primrec definitions no longer require function name and type 

960 
of recursive argument. 

5214  961 

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

964 

965 

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

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

969 
support is as follows: 

970 

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

972 
constructor terms) are part of the standard simpset; 

973 

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

975 
made part of standard simpset and claset via addIffs; 

976 

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

978 
the standard claset (addSWrapper); 

979 

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

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

982 
the name of your record type. 

983 

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

985 

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

987 

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

989 
blow up into some record constructor term, consequently the 

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

991 
solve record problems automatically. 

992 

5214  993 

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

996 

5650  997 
* automatic simplification of integer sums and comparisons, using cancellation; 
998 

5526  999 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  1000 

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

1002 

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

1004 

1005 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

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

1007 
with add/delsplits); 

5125  1008 

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

1011 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

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

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

1015 
%u.f(); 

5125  1016 

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

5109  1019 

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

1022 
disjointness reasoning but breaking a few old proofs. 

5267  1023 

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

1026 
literature); 

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

1027 

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

4838  1030 

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

1033 
release ONLY. 

1034 

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

1037 
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

1038 

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

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

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

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

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

5282  1047 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  1048 

5127  1049 
* HOL/Arith: 
1050 
 removed 'pred' (predecessor) function; 

1051 
 generalized some theorems about n1; 

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

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

4766  1054 

5127  1055 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  1056 
instead of "inverse"; 
4711  1057 

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

1060 

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

5127  1064 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  1065 

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

1068 

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

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

1072 

5363  1073 

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

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

1075 

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

5160  1078 

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

1081 
disjointness reasoning but breaking a few old proofs. 

5267  1082 

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

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

1086 

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

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

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

5308  1091 
Now rew can involve either definitions or equalities (either == or =). 
5142  1092 

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

1095 

4842  1096 

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

1098 

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

5207  1101 

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

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

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

1106 

5251  1107 
* removed global_names compatibility flag  all theory declarations 
1108 
are qualified by default; 

1109 

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

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

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

1113 

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

1116 

5207  1117 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
1118 
subgoal; 

5142  1119 

5251  1120 
* Display.print_goals function moved to Locale.print_goals; 
1121 

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

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

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

1126 
for example; 

1127 

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

1128 

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

1129 

4410  1130 
New in Isabelle98 (January 1998) 
1131 
 

1132 

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

1134 

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

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

1137 

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

1139 
simpset / simpset_ref; 

1140 

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

1142 
implicit merge of thms' signatures; 

1143 

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

1145 

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

1147 

3454  1148 

3715  1149 
*** General Changes *** 
1150 

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

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

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

1158 
backward campatibility problems try setting 'global_names' at compile 

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

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

1161 
section; 

4108  1162 

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

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

1165 
replaced by functions simpset:unit>simpset and 

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

1167 
to patch your ML files accordingly; 

3856  1168 

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

3901  1171 
usedir (see i option, ISABELLE_USEDIR_OPTIONS); 
3857  1172 

3856  1173 
* defs may now be conditional; improved rewrite_goals_tac to handle 
1174 
conditional equations; 

1175 

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

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

4112  1180 
restricted to 'trivial' ones; COMPATIBILITY: one may have to use 
3901  1181 
transfer:theory>thm>thm in (rare) cases; 
1182 

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

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

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

1185 

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

1188 

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

1190 
show_types); 

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

1191 

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

1193 

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

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

1195 

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

1197 

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

1199 

3715  1200 
* removed obsolete init_pps and init_database; 
1201 

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

1203 
fun STATE tacfun st = tacfun st st; 

1204 

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

4269  1207 

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

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

1210 
qualified references to the Sequence structure only!); 

1211 

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

4269  1214 

3715  1215 

1216 
*** Classical Reasoner *** 

1217 

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

1220 
splitting it into several subgoals; 

3715  1221 

3719  1222 
* Safe_tac: like safe_tac but uses the default claset; 
1223 

3715  1224 

1225 
*** Simplifier *** 

1226 

1227 
* added simplification meta rules: 

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

1229 

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

1231 
logics (again); 

1232 

1233 
* added prems argument to simplification procedures; 

1234 

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

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

1238 

3715  1239 

1240 
*** Syntax *** 

1241 

4174  1242 
* TYPE('a) syntax for type reflection terms; 
1243 

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

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

3846  1247 

3715  1248 
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; 
1249 

1250 

1251 
*** HOL *** 

1252 

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

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

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

4035  1259 
protocol TLS; 
3985  1260 

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

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

1265 
differences; simplification procedures nat_cancel_factor for 

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

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

4335  1269 

3580  1270 
* HOL/simplifier: terms of the form 
4325  1271 
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x) 
3580  1272 
are rewritten to 
4035  1273 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)', 
1274 
and those of the form 

4325  1275 
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) > R(x)' (or t=x) 
4035  1276 
are rewritten to 
1277 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) > R(t)', 

1278 

1279 
* HOL/datatype 

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

3580  1281 

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

1284 
... 

4189  1285 
(!y1 ... ymn. x = Cn y1 ... ymn > P(f1 y1 ... ymn)) 
4035  1286 
) 
1287 

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

1288 
and a theorem `split_t_case_asm' of the form 
4189  1289 

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

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

1292 
... 

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

1294 
) 

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

1295 
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

1296 
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

1297 
split_list_case and split_option_case. 
4189  1298 

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

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

1302 
because it will disappear altogether at some point. 

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

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

1305 
`standard'. 

4357  1306 

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

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

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

3570  1311 

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

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

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

1316 

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

1319 
still lacks various theorems and concrete record syntax; 

1320 

4125  1321 

3715  1322 
*** HOLCF *** 
3535  1323 

4125  1324 
* removed "axioms" and "generated by" sections; 
1325 

4123  1326 
* replaced "ops" section by extended "consts" section, which is capable of 
4125  1327 
handling the continuous function space ">" directly; 
1328 

1329 
* domain package: 

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

1331 
. creates hierachical name space, 

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

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

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

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

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

1337 
appear on the lefthand side of the equations only; 

4123  1338 

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

3567  1340 

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

3579  1343 

1344 

3719  1345 
*** FOL and ZF *** 
1346 

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

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

1352 

3719  1353 

3579  1354 

3006  1355 
New in Isabelle948 (May 1997) 
1356 
 

2654  1357 

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

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

1359 

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

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

1361 
still somewhat experimental); old Makefiles etc. still functional; 
2971  1362 

3205  1363 
* new 'Isabelle System Manual'; 
1364 

2825  1365 
* INSTALL text, together with ./configure and ./build scripts; 
2773  1366 

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

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

1369 

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

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

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

1372 

3006  1373 

1374 
*** Syntax *** 

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

1375 

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

1378 

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

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

1380 
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

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

1382 

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

1387 
(Syntax.mark_boundT); 

2705  1388 

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

2730  1392 

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

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

1394 

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

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

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

1397 

3006  1398 

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

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

1400 

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

1401 
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

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

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

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

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

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

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

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

1410 

3107  1411 
* substitution with equality assumptions no longer permutes other 
1412 
assumptions; 

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

1413 

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

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

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

1417 

5726  1418 
* improved combination of classical reasoner and simplifier: 
3317  1419 
+ functions for handling clasimpsets 
1420 
+ improvement of addss: now the simplifier is called _after_ the 

1421 
safe steps. 

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

5726  1423 
_during_ the safe steps. It is more complete as it allows multiple 
3317  1424 
in 