author  wenzelm 
Thu, 14 Oct 1999 15:04:36 +0200  
changeset 7866  3ccaa11b6df9 
parent 7863  8b0aca9bdc26 
child 7886  8fa551e22e52 
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 

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

22 

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

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

24 
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

25 

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

6057  28 

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

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

6141  32 

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

7619  35 
* Simplifier: the type of the infix ML functions 
36 
setSSolver addSSolver setSolver addSolver 

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

38 
for packaging solvers. A solver is created via 

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

40 
where the string argument is only a comment. 

6057  41 

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

42 

6069  43 
*** Proof tools *** 
44 

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

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

6069  49 

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

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

53 
matching. 

6069  54 

7593  55 

6014  56 
*** General *** 
57 

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

60 
interface it offers an interactive environment for developing human 

61 
readable proof documents (Isar == Intelligible semiautomated 

7863  62 
reasoning); actual document preparation based on (PDF)LaTeX is 
63 
available as well; see isatool doc isarref, HOL/Isar_examples and 

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

7215  65 

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

69 

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

72 

6751  73 
* Isabelle manuals now also available as PDF; 
74 

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

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

78 

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

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

6449  84 

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

87 

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

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

90 

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

92 

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

5973  95 

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

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

98 

6343  99 
* new print_mode "HTML"; 
100 

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

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

103 

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

106 

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

108 
244c244 

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

110 
 

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

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

115 
 

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

117 

7450  118 
* function bind_thms stores lists of theorems (cf. bind_thm); 
119 

7593  120 
* new shorthand tactics ftac, eatac, datac, fatac; 
121 

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

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

124 
still apply; 

125 

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

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

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

128 

6028  129 

6057  130 
*** HOL *** 
131 

7215  132 
** HOL arithmetic ** 
133 

6343  134 
* There are now decision procedures for linear arithmetic over nat and 
135 
int: 

6131  136 

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

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

140 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  145 

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

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

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

150 
simplifier. 

6131  151 

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

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

6028  155 

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

160 
type constraints; 

161 

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

163 
arguments; 

7157  164 

7215  165 
* many properties of integer multiplication, division and remainder 
166 
are now available; 

6922  167 

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

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

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

172 
invocation of the underlying oracle). For SVC see 

7444  173 
http://verify.stanford.edu/SVC 
6922  174 

7125  175 
* IsaMakefile: the HOLReal target now builds an actual image; 
176 

7215  177 

178 
** HOL misc ** 

179 

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

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

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

182 

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

185 

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

188 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

189 
changed syntax and (many) tactics; 

190 

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

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

194 
"mono" attribute); 

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

195 

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

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

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

198 

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

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

200 

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

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

7326  205 

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

207 
Delsimprocs [record_simproc] 

208 

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

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

210 
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

211 

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

214 

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

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

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

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

6563  219 

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

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

223 

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

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

225 
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

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

227 

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

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

229 
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

230 

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

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

232 
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

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

234 

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

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

239 

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

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

241 
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

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

243 

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

246 

7215  247 

7113  248 
*** LK *** 
249 

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

7113  252 

253 
* the simplifier is now installed 

254 

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

256 

257 
* the classical reasoner now has a default rule database 

258 

259 

6064  260 
*** ZF *** 
261 

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

6269  263 
directly (as in HOL) over datatypes and the natural numbers; 
6064  264 

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

6064  267 

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

269 

6141  270 
* simplification automatically does freeness reasoning for datatype 
6269  271 
constructors; 
6141  272 

6269  273 
* automatic typeinference, with AddTCs command to insert new 
274 
typechecking rules; 

6155  275 

6269  276 
* datatype introduction rules are now added as Safe Introduction rules 
277 
to the claset; 

6155  278 

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

281 

6069  282 

6343  283 
*** Internal programming interfaces *** 
284 

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

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

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

287 

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

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

289 

6343  290 
* tuned current_goals_markers semantics: begin / end goal avoids 
291 
printing empty lines; 

292 

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

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

295 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

297 

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

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

300 
mode to get Isabelle font glyphs as before; 

301 

302 
* refined token_translation interface; INCOMPATIBILITY: output length 

303 
now of type real instead of int; 

304 

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

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

308 
opposed to intratheory data slots offered via TheoryDataFun; 

309 

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

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

311 
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

312 
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

313 
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

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

315 

6343  316 

6064  317 

5781  318 
New in Isabelle981 (October 1998) 
319 
 

320 

5127  321 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  322 

5726  323 
* several changes of automated proof tools; 
5373  324 

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

5214  327 

5726  328 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  329 
called `inj_on'; 
5160  330 

5275  331 
* HOL: removed duplicate thms in Arith: 
332 
less_imp_add_less should be replaced by trans_less_add1 

333 
le_imp_add_le should be replaced by trans_le_add1 

5160  334 

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

5490  337 

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

340 
now taken as an integer constant. 

5541  341 

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

343 

5363  344 

5127  345 
*** Proof tools *** 
4880  346 

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

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

348 
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

349 
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

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

351 
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

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

353 
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

354 
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

355 
2. The simplifier now knows a little bit about natarithmetic. 
4880  356 

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

359 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

362 
one (emitting a warning). 

4824  363 
type wrapper = (int > tactic) > (int > tactic) 
4649  364 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  365 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
366 
delWrapper, delSWrapper: claset * string > claset 

4649  367 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
368 

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

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

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

373 
by Force_tac; 

5524  374 

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

5524  377 

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

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

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

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

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

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

386 
split_all_tac for record fields. 

5127  387 

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

390 
Addsimps. They can be removed via Delsplits just like 

391 
Delsimps. Lowercase versions are also available. 

5127  392 

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

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

396 
either remove split_if completely from the default simpset by 

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

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

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

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

401 
t is the name of the datatype). 

5127  402 

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

5726  406 
aimed to solve the given subgoal completely. 
5127  407 

408 

409 
*** General *** 

410 

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

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

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

4842  417 

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

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

423 

5127  424 
* new theory section 'nonterminals' for purely syntactic types; 
4858  425 

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

4869  428 

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

431 

5363  432 
* isatool install  install binaries with absolute references to 
433 
ISABELLE_HOME/bin; 

434 

5572  435 
* isatool logo  create instances of the Isabelle logo (as EPS); 
436 

5407  437 
* print mode 'emacs' reserved for Isamode; 
438 

5726  439 
* support multiple print (ast) translations per constant name; 
440 

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

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

442 

4711  443 

4661  444 
*** HOL *** 
445 

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

5217  448 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  449 
definitions such as 
5217  450 

451 
inductive EVEN ODD 

452 
intrs 

453 
null "0 : EVEN" 

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

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

456 

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

458 
recursive sets; inductive definitions now handle disjunctive premises 

459 
correctly (also ZF); 

5214  460 

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

463 
contained in "induct"; 

464 

465 

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

5267  467 
supports mutually recursive datatypes such as 
5217  468 

469 
datatype 

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

471 
 SUM ('a aexp) ('a aexp) 

472 
 DIFF ('a aexp) ('a aexp) 

473 
 NUM 'a 

474 
and 

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

476 
 AND ('a bexp) ('a bexp) 

477 
 OR ('a bexp) ('a bexp) 

478 

5267  479 
as well as indirectly recursive datatypes such as 
5214  480 

5217  481 
datatype 
482 
('a, 'b) term = Var 'a 

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

5214  484 

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

487 

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

489 
<function_name>.simps. 

490 

491 
INCOMPATIBILITIES: 

5214  492 

5217  493 
 Theories using datatypes must now have theory Datatype as an 
494 
ancestor. 

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

496 
generic induct_tac instead. 

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

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

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

504 
some datatype definitions may have to be annotated with explicit 

505 
sort constraints. 

506 
 Primrec definitions no longer require function name and type 

507 
of recursive argument. 

5214  508 

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

511 

512 

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

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

516 
support is as follows: 

517 

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

519 
constructor terms) are part of the standard simpset; 

520 

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

522 
made part of standard simpset and claset via addIffs; 

523 

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

525 
the standard claset (addSWrapper); 

526 

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

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

529 
the name of your record type. 

530 

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

532 

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

534 

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

536 
blow up into some record constructor term, consequently the 

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

538 
solve record problems automatically. 

539 

5214  540 

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

543 

5650  544 
* automatic simplification of integer sums and comparisons, using cancellation; 
545 

5526  546 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  547 

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

549 

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

551 

552 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

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

554 
with add/delsplits); 

5125  555 

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

558 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

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

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

562 
%u.f(); 

5125  563 

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

5109  566 

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

569 
disjointness reasoning but breaking a few old proofs. 

5267  570 

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

573 
literature); 

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

574 

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

4838  577 

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

580 
release ONLY. 

581 

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

584 
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

585 

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

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

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

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

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

5282  594 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  595 

5127  596 
* HOL/Arith: 
597 
 removed 'pred' (predecessor) function; 

598 
 generalized some theorems about n1; 

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

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

4766  601 

5127  602 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  603 
instead of "inverse"; 
4711  604 

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

607 

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

5127  611 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  612 

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

615 

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

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

619 

5363  620 

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

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

622 

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

5160  625 

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

628 
disjointness reasoning but breaking a few old proofs. 

5267  629 

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

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

633 

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

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

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

5308  638 
Now rew can involve either definitions or equalities (either == or =). 
5142  639 

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

642 

4842  643 

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

645 

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

5207  648 

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

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

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

653 

5251  654 
* removed global_names compatibility flag  all theory declarations 
655 
are qualified by default; 

656 

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

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

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

660 

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

663 

5207  664 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
665 
subgoal; 

5142  666 

5251  667 
* Display.print_goals function moved to Locale.print_goals; 
668 

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

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

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

673 
for example; 

674 

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

675 

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

676 

4410  677 
New in Isabelle98 (January 1998) 
678 
 

679 

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

681 

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

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

684 

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

686 
simpset / simpset_ref; 

687 

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

689 
implicit merge of thms' signatures; 

690 

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

692 

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

694 

3454  695 

3715  696 
*** General Changes *** 
697 

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

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

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

705 
backward campatibility problems try setting 'global_names' at compile 

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

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

708 
section; 

4108  709 

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

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

712 
replaced by functions simpset:unit>simpset and 

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

714 
to patch your ML files accordingly; 

3856  715 

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

3901  718 
usedir (see i option, ISABELLE_USEDIR_OPTIONS); 
3857  719 

3856  720 
* defs may now be conditional; improved rewrite_goals_tac to handle 
721 
conditional equations; 

722 

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

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

4112  727 
restricted to 'trivial' ones; COMPATIBILITY: one may have to use 
3901  728 
transfer:theory>thm>thm in (rare) cases; 
729 

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

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

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

732 

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

735 

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

737 
show_types); 

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

738 

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

740 

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

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

742 

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

744 

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

746 

3715  747 
* removed obsolete init_pps and init_database; 
748 

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

750 
fun STATE tacfun st = tacfun st st; 

751 

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

4269  754 

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

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

757 
qualified references to the Sequence structure only!); 

758 

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

4269  761 

3715  762 

763 
*** Classical Reasoner *** 

764 

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

767 
splitting it into several subgoals; 

3715  768 

3719  769 
* Safe_tac: like safe_tac but uses the default claset; 
770 

3715  771 

772 
*** Simplifier *** 

773 

774 
* added simplification meta rules: 

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

776 

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

778 
logics (again); 

779 

780 
* added prems argument to simplification procedures; 

781 

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

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

785 

3715  786 

787 
*** Syntax *** 

788 

4174  789 
* TYPE('a) syntax for type reflection terms; 
790 

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

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

3846  794 

3715  795 
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; 
796 

797 

798 
*** HOL *** 

799 

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

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

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

4035  806 
protocol TLS; 
3985  807 

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

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

812 
differences; simplification procedures nat_cancel_factor for 

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

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

4335  816 

3580  817 
* HOL/simplifier: terms of the form 
4325  818 
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x) 
3580  819 
are rewritten to 
4035  820 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)', 
821 
and those of the form 

4325  822 
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) > R(x)' (or t=x) 
4035  823 
are rewritten to 
824 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) > R(t)', 

825 

826 
* HOL/datatype 

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

3580  828 

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

831 
... 

4189  832 
(!y1 ... ymn. x = Cn y1 ... ymn > P(f1 y1 ... ymn)) 
4035  833 
) 
834 

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

835 
and a theorem `split_t_case_asm' of the form 
4189  836 

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

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

839 
... 

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

841 
) 

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

842 
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

843 
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

844 
split_list_case and split_option_case. 
4189  845 

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

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

849 
because it will disappear altogether at some point. 

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

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

852 
`standard'. 

4357  853 

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

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

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

3570  858 

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

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

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

863 

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

866 
still lacks various theorems and concrete record syntax; 

867 

4125  868 

3715  869 
*** HOLCF *** 
3535  870 

4125  871 
* removed "axioms" and "generated by" sections; 
872 

4123  873 
* replaced "ops" section by extended "consts" section, which is capable of 
4125  874 
handling the continuous function space ">" directly; 
875 

876 
* domain package: 

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

878 
. creates hierachical name space, 

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

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

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

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

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

884 
appear on the lefthand side of the equations only; 

4123  885 

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

3567  887 

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

3579  890 

891 

3719  892 
*** FOL and ZF *** 
893 

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

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

899 

3719  900 

3579  901 

3006  902 
New in Isabelle948 (May 1997) 
903 
 

2654  904 

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

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

906 

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

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

908 
still somewhat experimental); old Makefiles etc. still functional; 
2971  909 

3205  910 
* new 'Isabelle System Manual'; 
911 

2825  912 
* INSTALL text, together with ./configure and ./build scripts; 
2773  913 

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

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

916 

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

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

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

919 

3006  920 

921 
*** Syntax *** 

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

922 

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

925 

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

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

927 
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

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

929 

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

934 
(Syntax.mark_boundT); 

2705  935 

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

2730  939 

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

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

941 

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

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

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

944 

3006  945 

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

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

947 

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

948 
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

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

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

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

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

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

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

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

957 

3107  958 
* substitution with equality assumptions no longer permutes other 
959 
assumptions; 

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

960 

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

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

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

964 

5726  965 
* improved combination of classical reasoner and simplifier: 
3317  966 
+ functions for handling clasimpsets 
967 
+ improvement of addss: now the simplifier is called _after_ the 

968 
safe steps. 

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

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

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

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

974 

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

977 
redex); 

978 

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

980 

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

982 

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

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

984 
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

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

987 

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

988 

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

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

990 

3042  991 
* a generic induction tactic `induct_tac' which works for all datatypes and 
3107  992 
also for type `nat'; 
3042  993 

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

996 

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

998 

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

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

1001 

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

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

1003 

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

1006 

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

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

1009 

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

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

1012 

3227  1013 
* HOL/Modelcheck demonstrates invocation of model checker oracle; 
1014 

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

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

1016 
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

1017 

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

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

1019 

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

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

1021 

3321  1022 
* a new constant `arbitrary == @x.False'; 
1023 

3107  1024 
* HOLCF/IOA replaces old HOL/IOA; 
1025 

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

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

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

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

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

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

3006  1036 

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

1037 
*** ZF *** 
2553  1038 

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

1041 
as ZF_cs addSIs [equalityI]; 

2553  1042 

2554  1043 

2732  1044 

2553  1045 
New in Isabelle947 (November 96) 
1046 
 

1047 

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

1049 

2554  1050 
* superlinear speedup for large simplifications; 
1051 

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

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

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

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

1056 

1057 
* improved printing of ==> : ~: 

1058 

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

1060 
and Modal (thanks to Sara Kalvala); 

1061 

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

1063 

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

1065 
examples on HOL/Auth); 

1066 

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

1068 
the rewriter and classical reasoner simultaneously; 

1069 

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

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

1072 

1073 

1074 

1075 
New in Isabelle946 

1076 
 

1077 

1078 
* oracles  these establish an interface between Isabelle and trusted 

1079 
external reasoners, which may deliver results as theorems; 

1080 

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

1082 

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

1084 

1085 
* "constdefs" section in theory files; 

1086 

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

1088 

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

1090 

1091 

1092 

1093 
New in Isabelle945 

1094 
 

1095 

1096 
* reduced space requirements; 

1097 

1098 
* automatic HTML generation from theories; 

1099 

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

1101 

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

1103 

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

1105 

2553  1106 

2557  1107 

1108 
New in Isabelle944 

1109 
 

1110 

2747  1111 
* greatly reduced space requirements; 
2557  1112 

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

1114 

5726  1115 
* searchable theorem database (see the section "Retrieving theorems" on 
2557  1116 
page 8 of the Reference Manual); 
1117 

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

1119 
Axiom of Choice; 

1120 

1121 
* The previous version of HOL renamed to Old_HOL; 

1122 

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

1126 
* Mutually recursive inductive definitions finally work in HOL; 

1127 

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

1129 
translates to the operator "split"; 

1130 

1131 

1132 

1133 
New in Isabelle943 

1134 
 

1135 

5726  1136 
* new infix operator, addss, allowing the classical reasoner to 
2557  1137 
perform simplification at each step of its search. Example: 
5726  1138 
fast_tac (cs addss ss) 
2557  1139 

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

2557  1142 
look like (a,b) instead of <a,b>; 
1143 

1144 
* PLEASE NOTE: CHOL will eventually replace HOL! 

1145 

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

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

1148 

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

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

1151 

5726  1152 
* Many new examples: I/O automata, ChurchRosser theorem, equivalents 
2557  1153 
of the Axiom of Choice; 
1154 

1155 

1156 

1157 
New in Isabelle942 

1158 
 

1159 

5726  1160 
* Significantly faster resolution; 
2557  1161 

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

1163 
freely; 

1164 

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

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

1167 

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

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

1170 
(theory_of_thm); 

1171 

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

1173 

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

1175 
and HOL_dup_cs obsolete; 

1176 

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

1178 
have been removed; 

1179 

1180 
* Simpler definition of function space in ZF; 

1181 

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

1183 

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

1185 
types; 

1186 

1187 

2553  1188 
$Id$ 