author  wenzelm 
Fri, 08 Oct 1999 11:10:07 +0200  
changeset 7791  66d3b64dbf49 
parent 7780  099742c562aa 
child 7805  0ae9ddc36fe0 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

4981  4 
New in this Isabelle version 
5 
 

4649  6 

5931  7 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
8 

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

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

7215  12 

13 
Delcongs [if_weak_cong]; 

6922  14 

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

5931  17 

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

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

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

21 
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

22 

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

6057  25 

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

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

6141  29 

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

7619  32 
* Simplifier: the type of the infix ML functions 
33 
setSSolver addSSolver setSolver addSolver 

34 
is now simpset * solver > simpset where `solver' is a new abstract type 

35 
for packaging solvers. A solver is created via 

36 
mk_solver: string > (thm list > int > tactic) > solver 

37 
where the string argument is only a comment. 

6057  38 

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

39 

6069  40 
*** Proof tools *** 
41 

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

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

6069  46 

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

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

50 
matching. 

6069  51 

7593  52 

6014  53 
*** General *** 
54 

7215  55 
* new Isabelle/Isar subsystem provides an alternative to traditional 
56 
tactical theorem proving; together with the ProofGeneral/isar user 

57 
interface it offers an interactive environment for developing human 

58 
readable proof documents (Isar == Intelligible semiautomated 

59 
reasoning); see isatool doc isarref and 

60 
http://isabelle.in.tum.de/Isar/ for more information; 

61 

7252  62 
* native support for Proof General, both for classic Isabelle and 
7215  63 
Isabelle/Isar (the latter is slightly better supported and more 
64 
robust); 

65 

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

68 

6751  69 
* Isabelle manuals now also available as PDF; 
70 

6671  71 
* improved browser info generation: better HTML markup (including 
72 
colors), graph views in several sizes; isatool usedir now provides a 

73 
proper interface for user theories (via P option); 

74 

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

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

6449  80 

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

83 

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

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

86 

87 
* path element specification '~~' refers to '$ISABELLE_HOME'; 

88 

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

5973  91 

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

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

94 

6343  95 
* new print_mode "HTML"; 
96 

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

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

99 

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

102 

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

104 
244c244 

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

106 
 

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

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

111 
 

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

113 

7450  114 
* function bind_thms stores lists of theorems (cf. bind_thm); 
115 

7593  116 
* new shorthand tactics ftac, eatac, datac, fatac; 
117 

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

119 
result is not stored, but proper checks and presentation of the result 

120 
still apply; 

121 

6028  122 

6057  123 
*** HOL *** 
124 

7215  125 
** HOL arithmetic ** 
126 

6343  127 
* There are now decision procedures for linear arithmetic over nat and 
128 
int: 

6131  129 

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

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

133 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  138 

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

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

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

143 
simplifier. 

6131  144 

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

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

6028  148 

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

153 
type constraints; 

154 

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

156 
arguments; 

7157  157 

7215  158 
* many properties of integer multiplication, division and remainder 
159 
are now available; 

6922  160 

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

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

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

165 
invocation of the underlying oracle). For SVC see 

7444  166 
http://verify.stanford.edu/SVC 
6922  167 

7125  168 
* IsaMakefile: the HOLReal target now builds an actual image; 
169 

7215  170 

171 
** HOL misc ** 

172 

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

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

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

175 

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

178 

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

181 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

182 
changed syntax and (many) tactics; 

183 

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

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

187 
"mono" attribute); 

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

188 

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

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

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

191 

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

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

193 

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

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

7326  198 

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

200 
Delsimprocs [record_simproc] 

201 

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

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

203 
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

204 

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

207 

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

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

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

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

6563  212 

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

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

216 

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

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

218 
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

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

220 

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

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

222 
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

223 

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

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

225 
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

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

227 

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

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

232 

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

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

234 
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

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

236 

7492  237 
* HOL: new tactic smp_tac: int > int > tactic, which applies spec several 
238 
times and then mp 

239 

7215  240 

7113  241 
*** LK *** 
242 

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

7113  245 

246 
* the simplifier is now installed 

247 

248 
* the axiom system has been generalized (thanks to Soren Heilmann) 

249 

250 
* the classical reasoner now has a default rule database 

251 

252 

6064  253 
*** ZF *** 
254 

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

6269  256 
directly (as in HOL) over datatypes and the natural numbers; 
6064  257 

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

6064  260 

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

262 

6141  263 
* simplification automatically does freeness reasoning for datatype 
6269  264 
constructors; 
6141  265 

6269  266 
* automatic typeinference, with AddTCs command to insert new 
267 
typechecking rules; 

6155  268 

6269  269 
* datatype introduction rules are now added as Safe Introduction rules 
270 
to the claset; 

6155  271 

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

274 

6069  275 

6343  276 
*** Internal programming interfaces *** 
277 

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

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

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

280 

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

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

282 

6343  283 
* tuned current_goals_markers semantics: begin / end goal avoids 
284 
printing empty lines; 

285 

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

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

288 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

290 

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

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

293 
mode to get Isabelle font glyphs as before; 

294 

295 
* refined token_translation interface; INCOMPATIBILITY: output length 

296 
now of type real instead of int; 

297 

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

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

301 
opposed to intratheory data slots offered via TheoryDataFun; 

302 

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

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

304 
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

305 
extra sort hypotheses that can be witnessed from the type signature; 
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset

306 
the force_strip_shyps is gone, any remaining shyps are simply left in 
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset

307 
the theorem (with a warning issued by strip_shyps_warning); 
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset

308 

6343  309 

6064  310 

5781  311 
New in Isabelle981 (October 1998) 
312 
 

313 

5127  314 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  315 

5726  316 
* several changes of automated proof tools; 
5373  317 

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

5214  320 

5726  321 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  322 
called `inj_on'; 
5160  323 

5275  324 
* HOL: removed duplicate thms in Arith: 
325 
less_imp_add_less should be replaced by trans_less_add1 

326 
le_imp_add_le should be replaced by trans_le_add1 

5160  327 

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

5490  330 

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

333 
now taken as an integer constant. 

5541  334 

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

336 

5363  337 

5127  338 
*** Proof tools *** 
4880  339 

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

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

341 
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

342 
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

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

344 
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

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

346 
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

347 
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

348 
2. The simplifier now knows a little bit about natarithmetic. 
4880  349 

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

352 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

355 
one (emitting a warning). 

4824  356 
type wrapper = (int > tactic) > (int > tactic) 
4649  357 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  358 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
359 
delWrapper, delSWrapper: claset * string > claset 

4649  360 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
361 

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

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

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

366 
by Force_tac; 

5524  367 

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

5524  370 

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

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

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

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

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

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

379 
split_all_tac for record fields. 

5127  380 

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

383 
Addsimps. They can be removed via Delsplits just like 

384 
Delsimps. Lowercase versions are also available. 

5127  385 

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

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

389 
either remove split_if completely from the default simpset by 

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

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

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

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

394 
t is the name of the datatype). 

5127  395 

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

5726  399 
aimed to solve the given subgoal completely. 
5127  400 

401 

402 
*** General *** 

403 

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

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

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

4842  410 

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

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

416 

5127  417 
* new theory section 'nonterminals' for purely syntactic types; 
4858  418 

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

4869  421 

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

424 

5363  425 
* isatool install  install binaries with absolute references to 
426 
ISABELLE_HOME/bin; 

427 

5572  428 
* isatool logo  create instances of the Isabelle logo (as EPS); 
429 

5407  430 
* print mode 'emacs' reserved for Isamode; 
431 

5726  432 
* support multiple print (ast) translations per constant name; 
433 

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

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

435 

4711  436 

4661  437 
*** HOL *** 
438 

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

5217  441 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  442 
definitions such as 
5217  443 

444 
inductive EVEN ODD 

445 
intrs 

446 
null "0 : EVEN" 

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

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

449 

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

451 
recursive sets; inductive definitions now handle disjunctive premises 

452 
correctly (also ZF); 

5214  453 

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

456 
contained in "induct"; 

457 

458 

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

5267  460 
supports mutually recursive datatypes such as 
5217  461 

462 
datatype 

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

464 
 SUM ('a aexp) ('a aexp) 

465 
 DIFF ('a aexp) ('a aexp) 

466 
 NUM 'a 

467 
and 

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

469 
 AND ('a bexp) ('a bexp) 

470 
 OR ('a bexp) ('a bexp) 

471 

5267  472 
as well as indirectly recursive datatypes such as 
5214  473 

5217  474 
datatype 
475 
('a, 'b) term = Var 'a 

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

5214  477 

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

480 

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

482 
<function_name>.simps. 

483 

484 
INCOMPATIBILITIES: 

5214  485 

5217  486 
 Theories using datatypes must now have theory Datatype as an 
487 
ancestor. 

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

489 
generic induct_tac instead. 

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

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

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

497 
some datatype definitions may have to be annotated with explicit 

498 
sort constraints. 

499 
 Primrec definitions no longer require function name and type 

500 
of recursive argument. 

5214  501 

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

504 

505 

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

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

509 
support is as follows: 

510 

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

512 
constructor terms) are part of the standard simpset; 

513 

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

515 
made part of standard simpset and claset via addIffs; 

516 

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

518 
the standard claset (addSWrapper); 

519 

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

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

522 
the name of your record type. 

523 

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

525 

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

527 

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

529 
blow up into some record constructor term, consequently the 

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

531 
solve record problems automatically. 

532 

5214  533 

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

536 

5650  537 
* automatic simplification of integer sums and comparisons, using cancellation; 
538 

5526  539 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  540 

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

542 

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

544 

545 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

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

547 
with add/delsplits); 

5125  548 

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

551 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

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

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

555 
%u.f(); 

5125  556 

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

5109  559 

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

562 
disjointness reasoning but breaking a few old proofs. 

5267  563 

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

566 
literature); 

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

567 

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

4838  570 

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

573 
release ONLY. 

574 

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

577 
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

578 

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

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

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

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

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

5282  587 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  588 

5127  589 
* HOL/Arith: 
590 
 removed 'pred' (predecessor) function; 

591 
 generalized some theorems about n1; 

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

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

4766  594 

5127  595 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  596 
instead of "inverse"; 
4711  597 

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

600 

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

5127  604 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  605 

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

608 

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

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

612 

5363  613 

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

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

615 

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

5160  618 

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

621 
disjointness reasoning but breaking a few old proofs. 

5267  622 

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

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

626 

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

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

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

5308  631 
Now rew can involve either definitions or equalities (either == or =). 
5142  632 

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

635 

4842  636 

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

638 

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

5207  641 

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

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

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

646 

5251  647 
* removed global_names compatibility flag  all theory declarations 
648 
are qualified by default; 

649 

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

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

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

653 

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

656 

5207  657 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
658 
subgoal; 

5142  659 

5251  660 
* Display.print_goals function moved to Locale.print_goals; 
661 

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

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

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

666 
for example; 

667 

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

668 

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

669 

4410  670 
New in Isabelle98 (January 1998) 
671 
 

672 

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

674 

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

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

677 

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

679 
simpset / simpset_ref; 

680 

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

682 
implicit merge of thms' signatures; 

683 

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

685 

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

687 

3454  688 

3715  689 
*** General Changes *** 
690 

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

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

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

698 
backward campatibility problems try setting 'global_names' at compile 

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

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

701 
section; 

4108  702 

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

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

705 
replaced by functions simpset:unit>simpset and 

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

707 
to patch your ML files accordingly; 

3856  708 

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

3901  711 
usedir (see i option, ISABELLE_USEDIR_OPTIONS); 
3857  712 

3856  713 
* defs may now be conditional; improved rewrite_goals_tac to handle 
714 
conditional equations; 

715 

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

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

4112  720 
restricted to 'trivial' ones; COMPATIBILITY: one may have to use 
3901  721 
transfer:theory>thm>thm in (rare) cases; 
722 

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

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

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

725 

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

728 

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

730 
show_types); 

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

731 

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

733 

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

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

735 

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

737 

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

739 

3715  740 
* removed obsolete init_pps and init_database; 
741 

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

743 
fun STATE tacfun st = tacfun st st; 

744 

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

4269  747 

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

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

750 
qualified references to the Sequence structure only!); 

751 

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

4269  754 

3715  755 

756 
*** Classical Reasoner *** 

757 

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

760 
splitting it into several subgoals; 

3715  761 

3719  762 
* Safe_tac: like safe_tac but uses the default claset; 
763 

3715  764 

765 
*** Simplifier *** 

766 

767 
* added simplification meta rules: 

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

769 

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

771 
logics (again); 

772 

773 
* added prems argument to simplification procedures; 

774 

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

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

778 

3715  779 

780 
*** Syntax *** 

781 

4174  782 
* TYPE('a) syntax for type reflection terms; 
783 

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

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

3846  787 

3715  788 
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; 
789 

790 

791 
*** HOL *** 

792 

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

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

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

4035  799 
protocol TLS; 
3985  800 

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

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

805 
differences; simplification procedures nat_cancel_factor for 

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

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

4335  809 

3580  810 
* HOL/simplifier: terms of the form 
4325  811 
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x) 
3580  812 
are rewritten to 
4035  813 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)', 
814 
and those of the form 

4325  815 
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) > R(x)' (or t=x) 
4035  816 
are rewritten to 
817 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) > R(t)', 

818 

819 
* HOL/datatype 

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

3580  821 

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

824 
... 

4189  825 
(!y1 ... ymn. x = Cn y1 ... ymn > P(f1 y1 ... ymn)) 
4035  826 
) 
827 

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

828 
and a theorem `split_t_case_asm' of the form 
4189  829 

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

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

832 
... 

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

834 
) 

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

835 
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

836 
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

837 
split_list_case and split_option_case. 
4189  838 

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

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

842 
because it will disappear altogether at some point. 

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

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

845 
`standard'. 

4357  846 

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

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

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

3570  851 

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

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

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

856 

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

859 
still lacks various theorems and concrete record syntax; 

860 

4125  861 

3715  862 
*** HOLCF *** 
3535  863 

4125  864 
* removed "axioms" and "generated by" sections; 
865 

4123  866 
* replaced "ops" section by extended "consts" section, which is capable of 
4125  867 
handling the continuous function space ">" directly; 
868 

869 
* domain package: 

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

871 
. creates hierachical name space, 

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

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

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

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

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

877 
appear on the lefthand side of the equations only; 

4123  878 

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

3567  880 

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

3579  883 

884 

3719  885 
*** FOL and ZF *** 
886 

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

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

892 

3719  893 

3579  894 

3006  895 
New in Isabelle948 (May 1997) 
896 
 

2654  897 

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

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

899 

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

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

901 
still somewhat experimental); old Makefiles etc. still functional; 
2971  902 

3205  903 
* new 'Isabelle System Manual'; 
904 

2825  905 
* INSTALL text, together with ./configure and ./build scripts; 
2773  906 

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

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

909 

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

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

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

912 

3006  913 

914 
*** Syntax *** 

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

915 

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

918 

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

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

920 
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

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

922 

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

927 
(Syntax.mark_boundT); 

2705  928 

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

2730  932 

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

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

934 

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

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

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

937 

3006  938 

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

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

940 

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

941 
Blast_tac: a new tactic! It is often more powerful than fast_tac, but has 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

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

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

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

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

947 
+ rules must not require higherorder unification, e.g. apply_type in ZF 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

948 
[message "Function Var's argument not a bound variable" relates to this] 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

949 
+ its proof strategy is more general but can actually be slower 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

950 

3107  951 
* substitution with equality assumptions no longer permutes other 
952 
assumptions; 

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

953 

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

954 
* minor changes in semantics of addafter (now called addaltern); renamed 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

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

957 

5726  958 
* improved combination of classical reasoner and simplifier: 
3317  959 
+ functions for handling clasimpsets 
960 
+ improvement of addss: now the simplifier is called _after_ the 

961 
safe steps. 

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

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

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

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

967 

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

970 
redex); 

971 

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

973 

3107  974 
* new functions delcongs, deleqcongs, and Delcongs. richer rep_ss; 
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

975 

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

976 
* the solver is now split into a safe and an unsafe part. 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

977 
This should be invisible for the normal user, except that the 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

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

980 

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

981 

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

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

983 

3042  984 
* a generic induction tactic `induct_tac' which works for all datatypes and 
3107  985 
also for type `nat'; 
3042  986 

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

989 

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

991 

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

992 
* patterns in case expressions allow tuple patterns as arguments to 
3107  993 
constructors, for example `case x of [] => ...  (x,y,z)#ps => ...'; 
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

994 

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

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

996 

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

999 

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

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

1002 

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

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

1005 

3227  1006 
* HOL/Modelcheck demonstrates invocation of model checker oracle; 
1007 

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

1008 
* HOL/ex/Ring.thy declares cring_simp, which solves equational 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1009 
problems in commutative rings, using axiomatic type classes for + and *; 
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset

1010 

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

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

1012 

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

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

1014 

3321  1015 
* a new constant `arbitrary == @x.False'; 
1016 

3107  1017 
* HOLCF/IOA replaces old HOL/IOA; 
1018 

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

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

1021 
+ typedef instead of faking type definitions 
2747  1022 
+ eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc. 
2730  1023 
+ new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po 
2653
f1a6997cdc06
described changes for HOLCFVersion without rules and arities
slotosch
parents:
2649
diff
changeset

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

1025 
+ use unit lift and bool lift (with translations) instead of one and tr 
f1a6997cdc06
described changes for HOLCFVersion without rules and arities
slotosch
parents:
2649
diff
changeset

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

3006  1029 

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

1030 
*** ZF *** 
2553  1031 

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

1034 
as ZF_cs addSIs [equalityI]; 

2553  1035 

2554  1036 

2732  1037 

2553  1038 
New in Isabelle947 (November 96) 
1039 
 

1040 

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

1042 

2554  1043 
* superlinear speedup for large simplifications; 
1044 

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

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

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

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

1049 

1050 
* improved printing of ==> : ~: 

1051 

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

1053 
and Modal (thanks to Sara Kalvala); 

1054 

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

1056 

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

1058 
examples on HOL/Auth); 

1059 

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

1061 
the rewriter and classical reasoner simultaneously; 

1062 

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

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

1065 

1066 

1067 

1068 
New in Isabelle946 

1069 
 

1070 

1071 
* oracles  these establish an interface between Isabelle and trusted 

1072 
external reasoners, which may deliver results as theorems; 

1073 

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

1075 

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

1077 

1078 
* "constdefs" section in theory files; 

1079 

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

1081 

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

1083 

1084 

1085 

1086 
New in Isabelle945 

1087 
 

1088 

1089 
* reduced space requirements; 

1090 

1091 
* automatic HTML generation from theories; 

1092 

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

1094 

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

1096 

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

1098 

2553  1099 

2557  1100 

1101 
New in Isabelle944 

1102 
 

1103 

2747  1104 
* greatly reduced space requirements; 
2557  1105 

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

1107 

5726  1108 
* searchable theorem database (see the section "Retrieving theorems" on 
2557  1109 
page 8 of the Reference Manual); 
1110 

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

1112 
Axiom of Choice; 

1113 

1114 
* The previous version of HOL renamed to Old_HOL; 

1115 

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

1119 
* Mutually recursive inductive definitions finally work in HOL; 

1120 

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

1122 
translates to the operator "split"; 

1123 

1124 

1125 

1126 
New in Isabelle943 

1127 
 

1128 

5726  1129 
* new infix operator, addss, allowing the classical reasoner to 
2557  1130 
perform simplification at each step of its search. Example: 
5726  1131 
fast_tac (cs addss ss) 
2557  1132 

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

2557  1135 
look like (a,b) instead of <a,b>; 
1136 

1137 
* PLEASE NOTE: CHOL will eventually replace HOL! 

1138 

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

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

1141 

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

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

1144 

5726  1145 
* Many new examples: I/O automata, ChurchRosser theorem, equivalents 
2557  1146 
of the Axiom of Choice; 
1147 

1148 

1149 

1150 
New in Isabelle942 

1151 
 

1152 

5726  1153 
* Significantly faster resolution; 
2557  1154 

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

1156 
freely; 

1157 

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

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

1160 

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

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

1163 
(theory_of_thm); 

1164 

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

1166 

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

1168 
and HOL_dup_cs obsolete; 

1169 

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

1171 
have been removed; 

1172 

1173 
* Simpler definition of function space in ZF; 

1174 

1175 
* new results about cardinal and ordinal arithmetic in ZF; 

1176 

1177 
* 'subtype' facility in HOL for introducing new types as subsets of existing 

1178 
types; 

1179 

1180 

2553  1181 
$Id$ 