author  nipkow 
Fri, 10 Nov 2000 16:31:28 +0100  
changeset 10428  8f15fbce549f 
parent 10421  ceaab640734b 
child 10452  abeefb0a79ae 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

10224  4 
*** Overview of INCOMPATIBILITIES *** 
5 

6 
* HOL: induct renamed to lfp_induct; 

7 

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

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

10401
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

12 
* Isar/HOL: method 'induct' now handles nonatomic goals; as a 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

13 
consequence, it is no longer monotonic wrt. the local goal context 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

14 
(which is now passed through the inductive cases); 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

15 

10224  16 

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

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

18 

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

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

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

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

22 

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

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

24 
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

25 

10421  26 
* antiquotation @{goals} and @{subgoals} for output of *dynamic* goals state; 
27 
Note that presentation of goal states does not conform to actual 

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

28 
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

29 
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

30 

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

31 

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

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

33 

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

36 

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

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

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

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

41 

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

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

44 

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

46 
statements as well; 

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

47 

10401
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

48 
* HOL: improved method 'induct'  now handles nonatomic goals 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

49 
(potential INCOMPATIBILITY); tuned error handling; 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

50 

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

51 

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

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

53 

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

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

55 
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

56 
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

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

59 

10428  60 
* >, >= and \<ge> can now be used for input; they are immediately replaced 
61 
by the converse symbol, eg "x > y" by "y < x". 

62 

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

65 

66 

67 
*** General *** 

68 

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

70 
as assumptions as well; 

71 

72 

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

73 

10103  74 
New in Isabelle991 (October 2000) 
75 
 

8015  76 

10003  77 
*** Overview of INCOMPATIBILITIES *** 
8014  78 

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

81 
issue the following ML commands: 

82 

83 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

84 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  85 

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

10003  88 

89 
* HOL: nat_less_induct renamed to less_induct; 

90 

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

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

8967  93 

10003  94 
select_equality > some_equality 
95 
select_eq_Ex > some_eq_ex 

96 
selectI2EX > someI2_ex 

97 
selectI2 > someI2 

98 
selectI > someI 

99 
select1_equality > some1_equality 

100 
Eps_sym_eq > some_sym_eq_trivial 

101 
Eps_eq > some_eq_trivial 

102 

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

104 

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

106 
instead); 

107 

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

109 
f.simps instead of f.rules; 

110 

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

112 

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

114 
sometimes be needed; 

115 

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

8014  117 

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

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

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

121 
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

122 
now "<*lex*>" instead of "**"; 
8705  123 

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

9971  126 

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

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

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

129 

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

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

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

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

133 

8848  134 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
135 

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

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

137 
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

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

139 

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

9908  142 

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

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

145 

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

9542  148 

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

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

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

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

153 

9612  154 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
155 

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

156 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  157 

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

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

160 

8014  161 

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

163 

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

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

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

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

168 

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

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

171 

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

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

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

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

175 

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

8566  179 

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

181 

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

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

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

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

185 

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

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

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

189 

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

190 

8184  191 
*** Isar *** 
192 

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

195 
accommodates incremental typeinference very nicely; 

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

196 

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

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

199 

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

202 
useful to collect intermediate results without explicit name 

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

204 
premises; 

8184  205 

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

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

209 
to theorems as "tags"; 

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

210 

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

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

213 

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

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

216 

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

218 

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

221 

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

224 
with the version in Provers/classical; 

9612  225 

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

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

228 

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

231 

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

9612  234 

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

236 
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

237 
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

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

239 

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

242 

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

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

245 
well (including splits); 

246 

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

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

249 

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

251 
of Simplifier and Classical reasoner); 

252 

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

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

255 
recdef) support case names and properly name parameters; 

9612  256 

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

259 
calculations; 

260 

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

262 
method anyway; 

263 

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

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

266 
foo.split foo.split_asm for each datatype; 

267 

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

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

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

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

272 

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

274 

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

276 

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

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

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

279 
proof states; 
8487  280 

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

8487  284 

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

288 
(for HOL datatypes); 

8534  289 

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

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

293 

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

295 

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

298 
(print_commands, print_methods etc.); 

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

299 

10003  300 
* Isar: added 'nothing'  the empty list of theorems; 
9239  301 

8184  302 

8014  303 
*** HOL *** 
304 

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

307 
verifier and a lightweight bytecode verifier, including proofs of 

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

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

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

311 

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

8014  314 

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

315 
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese 
10003  316 
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M 
317 
Rasmussen; 

8570  318 

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

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

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

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

322 
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

323 
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

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

325 

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

9542  328 

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

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

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

331 

10003  332 
* HOL/Lambda: converted into newstyle theory and document; 
9542  333 

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

336 
representation; very useful in avoiding lifting of operations; 

8848  337 

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

340 
well; admit "r" as field name; 

9542  341 

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

344 

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

346 
Types nat and int belong to this axclass; 

347 

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

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

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

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

8736  355 

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

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

9835  359 

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

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

363 

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

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

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

8603  369 

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

372 
termination conditions are proved automatically, these simplification 

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

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

375 
each equation; 

376 

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

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

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

379 
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

380 
invariant proof rule for while is applied. 
9457  381 

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

8925  384 

8848  385 
* HOL: theorems impI, allI, ballI bound as "strip"; 
386 

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

390 

10003  391 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
9737  392 

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

8626  395 

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

398 

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

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

402 
bogus); 

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

403 

8412  404 

9542  405 
*** ZF *** 
406 

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

9542  409 

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

412 
making the algebraic laws unconditional; 

9542  413 

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

9542  416 

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

9542  419 

10003  420 
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic 
421 
simplification; 

9388  422 

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

9388  425 

426 

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

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

428 

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

431 

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

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

434 

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

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

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

437 

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

440 
use instead the strong form, 

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

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

443 
from destructrules; 

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

444 

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

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

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

447 

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

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

449 

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

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

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

452 

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

455 
situations; 

456 

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

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

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

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

460 

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

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

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

463 

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

464 
* system: provide TAGS file for Isabelle sources; 
9052  465 

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

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

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

468 

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

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

470 
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

471 

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

474 

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

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

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

477 

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

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

480 

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

481 

8015  482 

7986  483 
New in Isabelle99 (October 1999) 
484 
 

4649  485 

5931  486 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
487 

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

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

7215  491 

492 
Delcongs [if_weak_cong]; 

6922  493 

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

5931  496 

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

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

501 

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

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

503 
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

504 

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

6057  507 

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

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

6141  511 

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

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

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

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

518 
mk_solver: string > (thm list > int > tactic) > solver 
7619  519 
where the string argument is only a comment. 
6057  520 

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

521 

6069  522 
*** Proof tools *** 
523 

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

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

6069  528 

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

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

532 
matching. 

6069  533 

7593  534 

6014  535 
*** General *** 
536 

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

540 
readable proof documents (Isar == Intelligible semiautomated 

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

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

543 

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

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

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

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

7215  549 

7252  550 
* native support for Proof General, both for classic Isabelle and 
7986  551 
Isabelle/Isar; 
7215  552 

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

555 

6751  556 
* Isabelle manuals now also available as PDF; 
557 

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

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

6449  563 

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

566 

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

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

569 

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

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

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

573 

7215  574 
* path element specification '~~' refers to '$ISABELLE_HOME'; 
575 

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

5973  578 

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

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

581 

6343  582 
* new print_mode "HTML"; 
583 

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

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

586 

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

589 

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

591 
244c244 

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

593 
 

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

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

598 
 

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

600 

7450  601 
* function bind_thms stores lists of theorems (cf. bind_thm); 
602 

7593  603 
* new shorthand tactics ftac, eatac, datac, fatac; 
604 

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

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

7593  608 

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

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

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

611 

6028  612 

6057  613 
*** HOL *** 
614 

7215  615 
** HOL arithmetic ** 
616 

6343  617 
* There are now decision procedures for linear arithmetic over nat and 
618 
int: 

6131  619 

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

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

623 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  628 

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

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

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

633 
simplifier. 

6131  634 

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

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

6028  638 

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

643 
type constraints; 

644 

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

646 
arguments; 

7157  647 

7215  648 
* many properties of integer multiplication, division and remainder 
649 
are now available; 

6922  650 

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

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

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

655 
invocation of the underlying oracle). For SVC see 

7444  656 
http://verify.stanford.edu/SVC 
6922  657 

7125  658 
* IsaMakefile: the HOLReal target now builds an actual image; 
659 

7215  660 

661 
** HOL misc ** 

662 

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

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

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

665 

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

668 

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

671 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

672 
changed syntax and (many) tactics; 

673 

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

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

677 
"mono" attribute); 

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

678 

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

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

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

681 

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

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

683 

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

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

7326  688 

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

690 
Delsimprocs [record_simproc] 

691 

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

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

693 
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

694 

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

697 

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

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

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

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

6563  702 

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

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

706 

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

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

708 
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

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

710 

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

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

712 
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

713 

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

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

715 
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

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

717 

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

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

722 

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

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

724 
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

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

726 

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

7492  729 

7215  730 

7113  731 
*** LK *** 
732 

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

7113  735 

736 
* the simplifier is now installed 

737 

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

738 
* the axiom system has been generalized (thanks to Soren Heilmann) 
7113  739 

740 
* the classical reasoner now has a default rule database 

741 

742 

6064  743 
*** ZF *** 
744 

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

6269  746 
directly (as in HOL) over datatypes and the natural numbers; 
6064  747 

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

6064  750 

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

752 

6141  753 
* simplification automatically does freeness reasoning for datatype 
6269  754 
constructors; 
6141  755 

6269  756 
* automatic typeinference, with AddTCs command to insert new 
757 
typechecking rules; 

6155  758 

6269  759 
* datatype introduction rules are now added as Safe Introduction rules 
760 
to the claset; 

6155  761 

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

764 

6069  765 

6343  766 
*** Internal programming interfaces *** 
767 

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

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

769 

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

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

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

772 

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

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

774 

6343  775 
* tuned current_goals_markers semantics: begin / end goal avoids 
776 
printing empty lines; 

777 

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

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

780 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

782 

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

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

785 
mode to get Isabelle font glyphs as before; 

786 

787 
* refined token_translation interface; INCOMPATIBILITY: output length 

788 
now of type real instead of int; 

789 

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

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

793 
opposed to intratheory data slots offered via TheoryDataFun; 

794 

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

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

796 
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

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

800 

6343  801 

6064  802 

5781  803 
New in Isabelle981 (October 1998) 
804 
 

805 

5127  806 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  807 

5726  808 
* several changes of automated proof tools; 
5373  809 

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

5214  812 

5726  813 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  814 
called `inj_on'; 
5160  815 

5275  816 
* HOL: removed duplicate thms in Arith: 
817 
less_imp_add_less should be replaced by trans_less_add1 

818 
le_imp_add_le should be replaced by trans_le_add1 

5160  819 

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

5490  822 

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

825 
now taken as an integer constant. 

5541  826 

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

828 

5363  829 

5127  830 
*** Proof tools *** 
4880  831 

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

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

833 
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

834 
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

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

836 
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

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

838 
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

839 
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

840 
2. The simplifier now knows a little bit about natarithmetic. 
4880  841 

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

844 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

847 
one (emitting a warning). 

4824  848 
type wrapper = (int > tactic) > (int > tactic) 
4649  849 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  850 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
851 
delWrapper, delSWrapper: claset * string > claset 

4649  852 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
853 

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

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

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

858 
by Force_tac; 

5524  859 

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

5524  862 

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

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

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

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

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

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

871 
split_all_tac for record fields. 

5127  872 

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

875 
Addsimps. They can be removed via Delsplits just like 

876 
Delsimps. Lowercase versions are also available. 

5127  877 

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

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

881 
either remove split_if completely from the default simpset by 

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

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

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

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

886 
t is the name of the datatype). 

5127  887 

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

5726  891 
aimed to solve the given subgoal completely. 
5127  892 

893 

894 
*** General *** 

895 

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

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

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

4842  902 

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

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

908 

5127  909 
* new theory section 'nonterminals' for purely syntactic types; 
4858  910 

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

4869  913 

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

916 

5363  917 
* isatool install  install binaries with absolute references to 
918 
ISABELLE_HOME/bin; 

919 

5572  920 
* isatool logo  create instances of the Isabelle logo (as EPS); 
921 

5407  922 
* print mode 'emacs' reserved for Isamode; 
923 

5726  924 
* support multiple print (ast) translations per constant name; 
925 

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

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

927 

4711  928 

4661  929 
*** HOL *** 
930 

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

5217  933 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  934 
definitions such as 
5217  935 

936 
inductive EVEN ODD 

937 
intrs 

938 
null "0 : EVEN" 

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

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

941 

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

943 
recursive sets; inductive definitions now handle disjunctive premises 

944 
correctly (also ZF); 

5214  945 

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

948 
contained in "induct"; 

949 

950 

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

5267  952 
supports mutually recursive datatypes such as 
5217  953 

954 
datatype 

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

956 
 SUM ('a aexp) ('a aexp) 

957 
 DIFF ('a aexp) ('a aexp) 

958 
 NUM 'a 

959 
and 

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

961 
 AND ('a bexp) ('a bexp) 

962 
 OR ('a bexp) ('a bexp) 

963 

5267  964 
as well as indirectly recursive datatypes such as 
5214  965 

5217  966 
datatype 
967 
('a, 'b) term = Var 'a 

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

5214  969 

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

972 

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

974 
<function_name>.simps. 

975 

976 
INCOMPATIBILITIES: 

5214  977 

5217  978 
 Theories using datatypes must now have theory Datatype as an 
979 
ancestor. 

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

981 
generic induct_tac instead. 

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

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

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

989 
some datatype definitions may have to be annotated with explicit 

990 
sort constraints. 

991 
 Primrec definitions no longer require function name and type 

992 
of recursive argument. 

5214  993 

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

996 

997 

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

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

1001 
support is as follows: 

1002 

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

1004 
constructor terms) are part of the standard simpset; 

1005 

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

1007 
made part of standard simpset and claset via addIffs; 

1008 

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

1010 
the standard claset (addSWrapper); 

1011 

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

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

1014 
the name of your record type. 

1015 

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

1017 

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

1019 

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

1021 
blow up into some record constructor term, consequently the 

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

1023 
solve record problems automatically. 

1024 

5214  1025 

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

1028 

5650  1029 
* automatic simplification of integer sums and comparisons, using cancellation; 
1030 

5526  1031 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  1032 

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

1034 

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

1036 

1037 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

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

1039 
with add/delsplits); 

5125  1040 

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

1043 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

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

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

1047 
%u.f(); 

5125  1048 

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

5109  1051 

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

1054 
disjointness reasoning but breaking a few old proofs. 

5267  1055 

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

1058 
literature); 

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

1059 

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

4838  1062 

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

1065 
release ONLY. 

1066 

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

1069 
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

1070 

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

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

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

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

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

5282  1079 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  1080 

5127  1081 
* HOL/Arith: 
1082 
 removed 'pred' (predecessor) function; 

1083 
 generalized some theorems about n1; 

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

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

4766  1086 

5127  1087 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  1088 
instead of "inverse"; 
4711  1089 

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

1092 

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

5127  1096 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  1097 

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

1100 

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

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

1104 

5363  1105 

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

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

1107 

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

5160  1110 

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

1113 
disjointness reasoning but breaking a few old proofs. 

5267  1114 

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

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

1118 

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

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

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

5308  1123 
Now rew can involve either definitions or equalities (either == or =). 
5142  1124 

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

1127 

4842  1128 

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

1130 

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

5207  1133 

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

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

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

1138 

5251  1139 
* removed global_names compatibility flag  all theory declarations 
1140 
are qualified by default; 

1141 

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

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

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

1145 

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

1148 

5207  1149 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
1150 
subgoal; 

5142  1151 

5251  1152 
* Display.print_goals function moved to Locale.print_goals; 
1153 

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

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

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

1158 
for example; 

1159 

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

1160 

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

1161 

4410  1162 
New in Isabelle98 (January 1998) 
1163 
 

1164 

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

1166 

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

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

1169 

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

1171 
simpset / simpset_ref; 

1172 

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

1174 
implicit merge of thms' signatures; 

1175 

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

1177 

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

1179 

3454  1180 

3715  1181 
*** General Changes *** 
1182 

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

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

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

1190 
backward campatibility problems try setting 'global_names' at compile 

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

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

1193 
section; 

4108  1194 

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

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

1197 
replaced by functions simpset:unit>simpset and 

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

1199 
to patch your ML files accordingly; 

3856  1200 

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

3901  1203 
usedir (see i option, ISABELLE_USEDIR_OPTIONS); 
3857  1204 

3856  1205 
* defs may now be conditional; improved rewrite_goals_tac to handle 
1206 
conditional equations; 

1207 

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

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

4112  1212 
restricted to 'trivial' ones; COMPATIBILITY: one may have to use 
3901  1213 
transfer:theory>thm>thm in (rare) cases; 
1214 

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

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

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

1217 

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

1220 

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

1222 
show_types); 

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

1223 

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

1225 

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

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

1227 

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

1229 

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

1231 

3715  1232 
* removed obsolete init_pps and init_database; 
1233 

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

1235 
fun STATE tacfun st = tacfun st st; 

1236 

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

4269  1239 

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

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

1242 
qualified references to the Sequence structure only!); 

1243 

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

4269  1246 

3715  1247 

1248 
*** Classical Reasoner *** 

1249 

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

1252 
splitting it into several subgoals; 

3715  1253 

3719  1254 
* Safe_tac: like safe_tac but uses the default claset; 
1255 

3715  1256 

1257 
*** Simplifier *** 

1258 

1259 
* added simplification meta rules: 

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

1261 

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

1263 
logics (again); 

1264 

1265 
* added prems argument to simplification procedures; 

1266 

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

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

1270 

3715  1271 

1272 
*** Syntax *** 

1273 

4174  1274 
* TYPE('a) syntax for type reflection terms; 
1275 

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

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

3846  1279 

3715  1280 
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; 
1281 

1282 

1283 
*** HOL *** 

1284 

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

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

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

4035  1291 
protocol TLS; 
3985  1292 

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

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

1297 
differences; simplification procedures nat_cancel_factor for 

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

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

4335  1301 

3580  1302 
* HOL/simplifier: terms of the form 
4325  1303 
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x) 
3580  1304 
are rewritten to 
4035  1305 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)', 
1306 
and those of the form 

4325  1307 
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) > R(x)' (or t=x) 
4035  1308 
are rewritten to 
1309 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) > R(t)', 

1310 

1311 
* HOL/datatype 

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

3580  1313 

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

1316 
... 

4189  1317 
(!y1 ... ymn. x = Cn y1 ... ymn > P(f1 y1 ... ymn)) 
4035  1318 
) 
1319 

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

1320 
and a theorem `split_t_case_asm' of the form 
4189  1321 

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

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

1324 
... 

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

1326 
) 

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

1327 
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

1328 
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

1329 
split_list_case and split_option_case. 
4189  1330 

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

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

1334 
because it will disappear altogether at some point. 

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

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

1337 
`standard'. 

4357  1338 

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

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

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

3570  1343 

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

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

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

1348 

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

1351 
still lacks various theorems and concrete record syntax; 

1352 

4125  1353 

3715  1354 
*** HOLCF *** 
3535  1355 

4125  1356 
* removed "axioms" and "generated by" sections; 
1357 

4123  1358 
* replaced "ops" section by extended "consts" section, which is capable of 
4125  1359 
handling the continuous function space ">" directly; 
1360 

1361 
* domain package: 

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

1363 
. creates hierachical name space, 

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

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

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

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

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

1369 
appear on the lefthand side of the equations only; 

4123  1370 

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

3567  1372 

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

3579  1375 

1376 

3719  1377 
*** FOL and ZF *** 
1378 

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

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

1384 

3719  1385 

3579  1386 

3006  1387 
New in Isabelle948 (May 1997) 
1388 
 

2654  1389 

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

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

1391 

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

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

1393 
still somewhat experimental); old Makefiles etc. still functional; 
2971  1394 

3205  1395 
* new 'Isabelle System Manual'; 
1396 

2825  1397 
* INSTALL text, together with ./configure and ./build scripts; 
2773  1398 

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

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

1401 

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

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

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

1404 

3006  1405 

1406 
*** Syntax *** 

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

1407 

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

1410 

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

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

1412 
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

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

1414 

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

1419 
(Syntax.mark_boundT); 

2705  1420 

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

2730  1424 

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

1425 
* infixes may now be declared with names independent of their syntax; 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
