author  wenzelm 
Sat, 04 Nov 2000 18:39:44 +0100  
changeset 10391  0025fd11882c 
parent 10337  fca9cd9fd115 
child 10401  58bb50f69497 
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 

10391  11 
* Isar: 'obtain' no longer declares "that" fact as simp/intro; 
12 

10224  13 

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

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

15 

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

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

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

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

19 

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

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

21 
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

22 

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

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

24 
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

25 
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

26 
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

27 

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

28 

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

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

30 

10391  31 
* Pure: assumption method (an implicit finishing) now handles actual 
32 
rules as well; 

33 

34 
* Pure: improved 'obtain'  moved to Pure, insert "that" into 

35 
initial goal, declare "that" only as Pure intro (only for single 

36 
steps); the "that" rule assumption may now be involved in implicit 

37 
finishing, thus ".." becomes a feasible for trivial obtains; 

38 

39 
* Pure: default proof step now includes 'intro_classes'; thus trivial 

40 
instance proofs may be performed by ".."; 

41 

42 
* Pure: ?thesis / ?this / "..." now work for pure metalevel 

43 
statements as well; 

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

44 

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

45 

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

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

47 

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

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

49 
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

50 
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

51 
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While 
10337  52 
(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

53 

10391  54 
* HOL/typedef: simplified package, provide more useful rules (see also 
55 
HOL/subset.thy); 

56 

57 

58 
*** General *** 

59 

60 
* Provers: fast_tac (and friends) now handle actual objectlogic rules 

61 
as assumptions as well; 

62 

63 

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

64 

10103  65 
New in Isabelle991 (October 2000) 
66 
 

8015  67 

10003  68 
*** Overview of INCOMPATIBILITIES *** 
8014  69 

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

72 
issue the following ML commands: 

73 

74 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

75 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  76 

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

10003  79 

80 
* HOL: nat_less_induct renamed to less_induct; 

81 

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

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

8967  84 

10003  85 
select_equality > some_equality 
86 
select_eq_Ex > some_eq_ex 

87 
selectI2EX > someI2_ex 

88 
selectI2 > someI2 

89 
selectI > someI 

90 
select1_equality > some1_equality 

91 
Eps_sym_eq > some_sym_eq_trivial 

92 
Eps_eq > some_eq_trivial 

93 

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

95 

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

97 
instead); 

98 

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

100 
f.simps instead of f.rules; 

101 

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

103 

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

105 
sometimes be needed; 

106 

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

8014  108 

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

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

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

112 
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

113 
now "<*lex*>" instead of "**"; 
8705  114 

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

9971  117 

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

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

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

120 

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

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

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

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

124 

8848  125 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
126 

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

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

128 
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

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

130 

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

9908  133 

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

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

136 

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

9542  139 

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

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

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

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

144 

9612  145 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
146 

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

147 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  148 

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

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

151 

8014  152 

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

154 

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

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

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

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

159 

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

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

162 

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

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

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

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

166 

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

8566  170 

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

172 

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

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

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

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

176 

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

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

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

180 

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

181 

8184  182 
*** Isar *** 
183 

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

186 
accommodates incremental typeinference very nicely; 

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

187 

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

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

190 

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

193 
useful to collect intermediate results without explicit name 

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

195 
premises; 

8184  196 

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

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

200 
to theorems as "tags"; 

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

201 

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

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

204 

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

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

207 

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

209 

10003  210 
* Isar/Pure: syntax of sorts made 'inner', i.e. have to write 
211 
"{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

212 

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

215 
with the version in Provers/classical; 

9612  216 

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

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

219 

10003  220 
* Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms 
221 
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

222 

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

9612  225 

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

227 
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

228 
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

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

230 

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

233 

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

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

236 
well (including splits); 

237 

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

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

240 

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

242 
of Simplifier and Classical reasoner); 

243 

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

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

246 
recdef) support case names and properly name parameters; 

9612  247 

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

250 
calculations; 

251 

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

253 
method anyway; 

254 

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

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

257 
foo.split foo.split_asm for each datatype; 

258 

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

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

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

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

263 

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

265 

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

267 

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

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

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

270 
proof states; 
8487  271 

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

8487  275 

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

279 
(for HOL datatypes); 

8534  280 

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

283 
'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

284 

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

286 

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

289 
(print_commands, print_methods etc.); 

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

290 

10003  291 
* Isar: added 'nothing'  the empty list of theorems; 
9239  292 

8184  293 

8014  294 
*** HOL *** 
295 

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

298 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

302 

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

8014  305 

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

306 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  307 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
308 
Rasmussen; 

8570  309 

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

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

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

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

313 
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

314 
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

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

316 

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

9542  319 

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

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

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

322 

10003  323 
* HOL/Lambda: converted into newstyle theory and document; 
9542  324 

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

327 
representation; very useful in avoiding lifting of operations; 

8848  328 

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

331 
well; admit "r" as field name; 

9542  332 

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

335 

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

337 
Types nat and int belong to this axclass; 

338 

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

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

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

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

8736  346 

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

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

9835  350 

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

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

354 

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

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

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

8603  360 

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

363 
termination conditions are proved automatically, these simplification 

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

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

366 
each equation; 

367 

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

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

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

370 
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

371 
invariant proof rule for while is applied. 
9457  372 

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

8925  375 

8848  376 
* HOL: theorems impI, allI, ballI bound as "strip"; 
377 

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

381 

10003  382 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  383 

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

8626  386 

10003  387 
* HOL: fewer consts declared as global (e.g. have to refer to 
388 
"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

389 

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

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

393 
bogus); 

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

394 

8412  395 

9542  396 
*** ZF *** 
397 

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

9542  400 

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

403 
making the algebraic laws unconditional; 

9542  404 

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

9542  407 

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

9542  410 

10003  411 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
412 
simplification; 

9388  413 

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

9388  416 

417 

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

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

419 

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

422 

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

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

425 

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

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

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

428 

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

431 
use instead the strong form, 

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

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

434 
from destructrules; 

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

435 

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

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

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

438 

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

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

440 

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

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

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

443 

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

446 
situations; 

447 

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

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

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

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

451 

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

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

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

454 

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

455 
* system: provide TAGS file for Isabelle sources; 
9052  456 

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

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

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

459 

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

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

461 
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

462 

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

465 

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

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

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

468 

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

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

471 

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

472 

8015  473 

7986  474 
New in Isabelle99 (October 1999) 
475 
 

4649  476 

5931  477 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
478 

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

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

7215  482 

483 
Delcongs [if_weak_cong]; 

6922  484 

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

5931  487 

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

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

492 

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

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

494 
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

495 

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

6057  498 

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

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

6141  502 

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

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

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

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

509 
mk_solver: string > (thm list > int > tactic) > solver 
7619  510 
where the string argument is only a comment. 
6057  511 

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

512 

6069  513 
*** Proof tools *** 
514 

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

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

6069  519 

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

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

523 
matching. 

6069  524 

7593  525 

6014  526 
*** General *** 
527 

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

531 
readable proof documents (Isar == Intelligible semiautomated 

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

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

534 

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

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

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

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

7215  540 

7252  541 
* native support for Proof General, both for classic Isabelle and 
7986  542 
Isabelle/Isar; 
7215  543 

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

546 

6751  547 
* Isabelle manuals now also available as PDF; 
548 

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

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

6449  554 

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

557 

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

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

560 

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

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

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

564 

7215  565 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
566 

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

5973  569 

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

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

572 

6343  573 
* new print_mode "HTML"; 
574 

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

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

577 

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

580 

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

582 
244c244 

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

584 
 

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

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

589 
 

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

591 

7450  592 
* function bind_thms stores lists of theorems (cf. bind_thm); 
593 

7593  594 
* new shorthand tactics ftac, eatac, datac, fatac; 
595 

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

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

7593  599 

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

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

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

602 

6028  603 

6057  604 
*** HOL *** 
605 

7215  606 
** HOL arithmetic ** 
607 

6343  608 
* There are now decision procedures for linear arithmetic over nat and 
609 
int: 

6131  610 

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

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

614 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  619 

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

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

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

624 
simplifier. 

6131  625 

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

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

6028  629 

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

634 
type constraints; 

635 

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

637 
arguments; 

7157  638 

7215  639 
* many properties of integer multiplication, division and remainder 
640 
are now available; 

6922  641 

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

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

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

646 
invocation of the underlying oracle). For SVC see 

7444  647 
http://verify.stanford.edu/SVC 
6922  648 

7125  649 
* IsaMakefile: the HOLReal target now builds an actual image; 
650 

7215  651 

652 
** HOL misc ** 

653 

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

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

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

656 

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

659 

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

662 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

663 
changed syntax and (many) tactics; 

664 

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

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

668 
"mono" attribute); 

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

669 

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

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

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

672 

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

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

674 

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

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

7326  679 

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

681 
Delsimprocs [record_simproc] 

682 

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

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

684 
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

685 

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

688 

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

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

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

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

6563  693 

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

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

697 

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

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

699 
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

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

701 

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

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

703 
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

704 

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

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

706 
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

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

708 

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

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

713 

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

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

715 
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

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

717 

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

7492  720 

7215  721 

7113  722 
*** LK *** 
723 

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

7113  726 

727 
* the simplifier is now installed 

728 

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

729 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  730 

731 
* the classical reasoner now has a default rule database 

732 

733 

6064  734 
*** ZF *** 
735 

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

6269  737 
directly (as in HOL) over datatypes and the natural numbers; 
6064  738 

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

6064  741 

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

743 

6141  744 
* simplification automatically does freeness reasoning for datatype 
6269  745 
constructors; 
6141  746 

6269  747 
* automatic typeinference, with AddTCs command to insert new 
748 
typechecking rules; 

6155  749 

6269  750 
* datatype introduction rules are now added as Safe Introduction rules 
751 
to the claset; 

6155  752 

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

755 

6069  756 

6343  757 
*** Internal programming interfaces *** 
758 

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

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

760 

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

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

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

763 

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

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

765 

6343  766 
* tuned current_goals_markers semantics: begin / end goal avoids 
767 
printing empty lines; 

768 

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

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

771 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

773 

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

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

776 
mode to get Isabelle font glyphs as before; 

777 

778 
* refined token_translation interface; INCOMPATIBILITY: output length 

779 
now of type real instead of int; 

780 

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

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

784 
opposed to intratheory data slots offered via TheoryDataFun; 

785 

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

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

787 
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

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

791 

6343  792 

6064  793 

5781  794 
New in Isabelle981 (October 1998) 
795 
 

796 

5127  797 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  798 

5726  799 
* several changes of automated proof tools; 
5373  800 

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

5214  803 

5726  804 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  805 
called `inj_on'; 
5160  806 

5275  807 
* HOL: removed duplicate thms in Arith: 
808 
less_imp_add_less should be replaced by trans_less_add1 

809 
le_imp_add_le should be replaced by trans_le_add1 

5160  810 

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

5490  813 

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

816 
now taken as an integer constant. 

5541  817 

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

819 

5363  820 

5127  821 
*** Proof tools *** 
4880  822 

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

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

824 
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

825 
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

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

827 
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

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

829 
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

830 
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

831 
2. The simplifier now knows a little bit about natarithmetic. 
4880  832 

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

835 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

838 
one (emitting a warning). 

4824  839 
type wrapper = (int > tactic) > (int > tactic) 
4649  840 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  841 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
842 
delWrapper, delSWrapper: claset * string > claset 

4649  843 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
844 

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

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

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

849 
by Force_tac; 

5524  850 

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

5524  853 

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

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

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

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

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

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

862 
split_all_tac for record fields. 

5127  863 

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

866 
Addsimps. They can be removed via Delsplits just like 

867 
Delsimps. Lowercase versions are also available. 

5127  868 

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

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

872 
either remove split_if completely from the default simpset by 

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

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

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

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

877 
t is the name of the datatype). 

5127  878 

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

5726  882 
aimed to solve the given subgoal completely. 
5127  883 

884 

885 
*** General *** 

886 

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

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

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

4842  893 

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

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

899 

5127  900 
* new theory section 'nonterminals' for purely syntactic types; 
4858  901 

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

4869  904 

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

907 

5363  908 
* isatool install  install binaries with absolute references to 
909 
ISABELLE_HOME/bin; 

910 

5572  911 
* isatool logo  create instances of the Isabelle logo (as EPS); 
912 

5407  913 
* print mode 'emacs' reserved for Isamode; 
914 

5726  915 
* support multiple print (ast) translations per constant name; 
916 

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

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

918 

4711  919 

4661  920 
*** HOL *** 
921 

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

5217  924 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  925 
definitions such as 
5217  926 

927 
inductive EVEN ODD 

928 
intrs 

929 
null "0 : EVEN" 

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

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

932 

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

934 
recursive sets; inductive definitions now handle disjunctive premises 

935 
correctly (also ZF); 

5214  936 

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

939 
contained in "induct"; 

940 

941 

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

5267  943 
supports mutually recursive datatypes such as 
5217  944 

945 
datatype 

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

947 
 SUM ('a aexp) ('a aexp) 

948 
 DIFF ('a aexp) ('a aexp) 

949 
 NUM 'a 

950 
and 

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

952 
 AND ('a bexp) ('a bexp) 

953 
 OR ('a bexp) ('a bexp) 

954 

5267  955 
as well as indirectly recursive datatypes such as 
5214  956 

5217  957 
datatype 
958 
('a, 'b) term = Var 'a 

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

5214  960 

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

963 

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

965 
<function_name>.simps. 

966 

967 
INCOMPATIBILITIES: 

5214  968 

5217  969 
 Theories using datatypes must now have theory Datatype as an 
970 
ancestor. 

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

972 
generic induct_tac instead. 

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

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

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

980 
some datatype definitions may have to be annotated with explicit 

981 
sort constraints. 

982 
 Primrec definitions no longer require function name and type 

983 
of recursive argument. 

5214  984 

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

987 

988 

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

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

992 
support is as follows: 

993 

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

995 
constructor terms) are part of the standard simpset; 

996 

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

998 
made part of standard simpset and claset via addIffs; 

999 

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

1001 
the standard claset (addSWrapper); 

1002 

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

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

1005 
the name of your record type. 

1006 

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

1008 

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

1010 

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

1012 
blow up into some record constructor term, consequently the 

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

1014 
solve record problems automatically. 

1015 

5214  1016 

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

1019 

5650  1020 
* automatic simplification of integer sums and comparisons, using cancellation; 
1021 

5526  1022 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  1023 

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

1025 

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

1027 

1028 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

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

1030 
with add/delsplits); 

5125  1031 

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

1034 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

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

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

1038 
%u.f(); 

5125  1039 

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

5109  1042 

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

1045 
disjointness reasoning but breaking a few old proofs. 

5267  1046 

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

1049 
literature); 

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

1050 

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

4838  1053 

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

1056 
release ONLY. 

1057 

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

1060 
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

1061 

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

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

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

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

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

5282  1070 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  1071 

5127  1072 
* HOL/Arith: 
1073 
 removed 'pred' (predecessor) function; 

1074 
 generalized some theorems about n1; 

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

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

4766  1077 

5127  1078 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  1079 
instead of "inverse"; 
4711  1080 

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

1083 

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

5127  1087 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  1088 

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

1091 

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

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

1095 

5363  1096 

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

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

1098 

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

5160  1101 

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

1104 
disjointness reasoning but breaking a few old proofs. 

5267  1105 

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

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

1109 

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

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

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

5308  1114 
Now rew can involve either definitions or equalities (either == or =). 
5142  1115 

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

1118 

4842  1119 

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

1121 

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

5207  1124 

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

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

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

1129 

5251  1130 
* removed global_names compatibility flag  all theory declarations 
1131 
are qualified by default; 

1132 

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

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

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

1136 

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

1139 

5207  1140 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
1141 
subgoal; 

5142  1142 

5251  1143 
* Display.print_goals function moved to Locale.print_goals; 
1144 

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

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

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

1149 
for example; 

1150 

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

1151 

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

1152 

4410  1153 
New in Isabelle98 (January 1998) 
1154 
 

1155 

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

1157 

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

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

1160 

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

1162 
simpset / simpset_ref; 

1163 

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

1165 
implicit merge of thms' signatures; 

1166 

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

1168 

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

1170 

3454  1171 

3715  1172 
*** General Changes *** 
1173 

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

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

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

1181 
backward campatibility problems try setting 'global_names' at compile 

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

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

1184 
section; 

4108  1185 

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

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

1188 
replaced by functions simpset:unit>simpset and 

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

1190 
to patch your ML files accordingly; 

3856  1191 

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

3901  1194 
usedir (see i option, ISABELLE_USEDIR_OPTIONS); 
3857  1195 

3856  1196 
* defs may now be conditional; improved rewrite_goals_tac to handle 
1197 
conditional equations; 

1198 

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

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

4112  1203 
restricted to 'trivial' ones; COMPATIBILITY: one may have to use 
3901  1204 
transfer:theory>thm>thm in (rare) cases; 
1205 

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

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

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

1208 

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

1211 

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

1213 
show_types); 

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

1214 

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

1216 

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

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

1218 

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

1220 

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

1222 

3715  1223 
* removed obsolete init_pps and init_database; 
1224 

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

1226 
fun STATE tacfun st = tacfun st st; 

1227 

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

4269  1230 

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

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

1233 
qualified references to the Sequence structure only!); 

1234 

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

4269  1237 

3715  1238 

1239 
*** Classical Reasoner *** 

1240 

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

1243 
splitting it into several subgoals; 

3715  1244 

3719  1245 
* Safe_tac: like safe_tac but uses the default claset; 
1246 

3715  1247 

1248 
*** Simplifier *** 

1249 

1250 
* added simplification meta rules: 

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

1252 

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

1254 
logics (again); 

1255 

1256 
* added prems argument to simplification procedures; 

1257 

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

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

1261 

3715  1262 

1263 
*** Syntax *** 

1264 

4174  1265 
* TYPE('a) syntax for type reflection terms; 
1266 

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

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

3846  1270 

3715  1271 
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; 
1272 

1273 

1274 
*** HOL *** 

1275 

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

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

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

4035  1282 
protocol TLS; 
3985  1283 

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

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

1288 
differences; simplification procedures nat_cancel_factor for 

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

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

4335  1292 

3580  1293 
* HOL/simplifier: terms of the form 
4325  1294 
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x) 
3580  1295 
are rewritten to 
4035  1296 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)', 
1297 
and those of the form 

4325  1298 
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) > R(x)' (or t=x) 
4035  1299 
are rewritten to 
1300 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) > R(t)', 

1301 

1302 
* HOL/datatype 

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

3580  1304 

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

1307 
... 

4189  1308 
(!y1 ... ymn. x = Cn y1 ... ymn > P(f1 y1 ... ymn)) 
4035  1309 
) 
1310 

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

1311 
and a theorem `split_t_case_asm' of the form 
4189  1312 

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

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

1315 
... 

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

1317 
) 

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

1318 
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

1319 
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

1320 
split_list_case and split_option_case. 
4189  1321 

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

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

1325 
because it will disappear altogether at some point. 

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

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

1328 
`standard'. 

4357  1329 

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

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

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

3570  1334 

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

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

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

1339 

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

1342 
still lacks various theorems and concrete record syntax; 

1343 

4125  1344 

3715  1345 
*** HOLCF *** 
3535  1346 

4125  1347 
* removed "axioms" and "generated by" sections; 
1348 

4123  1349 
* replaced "ops" section by extended "consts" section, which is capable of 
4125  1350 
handling the continuous function space ">" directly; 
1351 

1352 
* domain package: 

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

1354 
. creates hierachical name space, 

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

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

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

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

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

1360 
appear on the lefthand side of the equations only; 

4123  1361 

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

3567  1363 

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

3579  1366 

1367 

3719  1368 
*** FOL and ZF *** 
1369 

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

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

1375 

3719  1376 

3579  1377 

3006  1378 
New in Isabelle948 (May 1997) 
1379 
 

2654  1380 

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

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

1382 

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

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

1384 
still somewhat experimental); old Makefiles etc. still functional; 
2971  1385 

3205  1386 
* new 'Isabelle System Manual'; 
1387 

2825  1388 
* INSTALL text, together with ./configure and ./build scripts; 
2773  1389 

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

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

1392 

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

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

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

1395 

3006  1396 

1397 
*** Syntax *** 

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

1398 

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

1401 

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

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

1403 
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

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

1405 

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

1410 
(Syntax.mark_boundT); 

2705  1411 

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

2730  1415 

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

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

1417 
