author  wenzelm 
Wed, 21 Apr 1999 17:11:34 +0200  
changeset 6461  99c34e50a2c6 
parent 6449  d031cb5ea2fc 
child 6482  324a4051ff7b 
permissions  rwrr 
6420  1 

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

2553  4 

4981  5 
New in this Isabelle version 
6 
 

4649  7 

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

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

5931  12 

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

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

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

16 
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

17 

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

6057  20 

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

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

6141  24 

6057  25 

6069  26 
*** Proof tools *** 
27 

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

30 
types `nat' and `int' in HOL (see below) but can, should and will be 

31 
instantiated for other types and logics as well. 

6069  32 

33 

6014  34 
*** General *** 
35 

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

38 
add_path, del_path, reset_path functions; 

39 

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

5973  42 

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

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

45 

6343  46 
* new print_mode "HTML"; 
47 

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

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

49 

6343  50 
* new flag show_tags controls display of tags of theorems (which are 
51 
basically just comments that may be attached by some tools); 

52 

6420  53 
* improved isatool install: option k creates KDE application icon, 
54 
option p DIR installs standalone binaries; 

6415  55 

6413  56 
* added ML_PLATFORM setting (useful for crossplatform installations); 
57 

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

60 

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

62 
244c244 

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

64 
 

65 
> (list (isagetenv "ISABELLE") "misabelle_font" "msymbols" 

66 
logicname) 

67 
diff r Isabelle2.6/elisp/isaproofstate.el Isamode/elisp/isaproofstate.el 

68 
181c181 

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

70 
 

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

72 

6028  73 

6057  74 
*** HOL *** 
75 

6343  76 
* There are now decision procedures for linear arithmetic over nat and 
77 
int: 

6131  78 

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

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

82 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  87 

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

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

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

92 
simplifier. 

6131  93 

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

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

6028  97 

6403  98 
* New bounded quantifier syntax (input only): 
99 
! x < y. P, ! x <= y. P, ? x < y. P, ? x <= y. P 

100 

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

103 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

104 
changed syntax and (many) tactics; 

105 

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

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

107 
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

108 

6269  109 

6064  110 
*** ZF *** 
111 

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

6269  113 
directly (as in HOL) over datatypes and the natural numbers; 
6064  114 

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

6064  117 

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

119 

6141  120 
* simplification automatically does freeness reasoning for datatype 
6269  121 
constructors; 
6141  122 

6269  123 
* automatic typeinference, with AddTCs command to insert new 
124 
typechecking rules; 

6155  125 

6269  126 
* datatype introduction rules are now added as Safe Introduction rules 
127 
to the claset; 

6155  128 

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

131 

6069  132 

6343  133 
*** Internal programming interfaces *** 
134 

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

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

136 

6343  137 
* tuned current_goals_markers semantics: begin / end goal avoids 
138 
printing empty lines; 

139 

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

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

142 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

144 

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

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

147 
mode to get Isabelle font glyphs as before; 

148 

149 
* refined token_translation interface; INCOMPATIBILITY: output length 

150 
now of type real instead of int; 

151 

152 

6064  153 

5781  154 
New in Isabelle981 (October 1998) 
155 
 

156 

5127  157 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  158 

5726  159 
* several changes of automated proof tools; 
5373  160 

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

5214  163 

5726  164 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  165 
called `inj_on'; 
5160  166 

5275  167 
* HOL: removed duplicate thms in Arith: 
168 
less_imp_add_less should be replaced by trans_less_add1 

169 
le_imp_add_le should be replaced by trans_le_add1 

5160  170 

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

5490  173 

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

176 
now taken as an integer constant. 

5541  177 

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

179 

5363  180 

5127  181 
*** Proof tools *** 
4880  182 

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

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

184 
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

185 
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

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

187 
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

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

189 
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

190 
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

191 
2. The simplifier now knows a little bit about natarithmetic. 
4880  192 

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

195 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

198 
one (emitting a warning). 

4824  199 
type wrapper = (int > tactic) > (int > tactic) 
4649  200 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  201 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
202 
delWrapper, delSWrapper: claset * string > claset 

4649  203 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
204 

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

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

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

209 
by Force_tac; 

5524  210 

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

5524  213 

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

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

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

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

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

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

222 
split_all_tac for record fields. 

5127  223 

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

226 
Addsimps. They can be removed via Delsplits just like 

227 
Delsimps. Lowercase versions are also available. 

5127  228 

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

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

232 
either remove split_if completely from the default simpset by 

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

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

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

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

237 
t is the name of the datatype). 

5127  238 

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

5726  242 
aimed to solve the given subgoal completely. 
5127  243 

244 

245 
*** General *** 

246 

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

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

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

4842  253 

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

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

259 

5127  260 
* new theory section 'nonterminals' for purely syntactic types; 
4858  261 

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

4869  264 

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

267 

5363  268 
* isatool install  install binaries with absolute references to 
269 
ISABELLE_HOME/bin; 

270 

5572  271 
* isatool logo  create instances of the Isabelle logo (as EPS); 
272 

5407  273 
* print mode 'emacs' reserved for Isamode; 
274 

5726  275 
* support multiple print (ast) translations per constant name; 
276 

4711  277 

4661  278 
*** HOL *** 
279 

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

5217  282 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  283 
definitions such as 
5217  284 

285 
inductive EVEN ODD 

286 
intrs 

287 
null "0 : EVEN" 

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

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

290 

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

292 
recursive sets; inductive definitions now handle disjunctive premises 

293 
correctly (also ZF); 

5214  294 

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

297 
contained in "induct"; 

298 

299 

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

5267  301 
supports mutually recursive datatypes such as 
5217  302 

303 
datatype 

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

305 
 SUM ('a aexp) ('a aexp) 

306 
 DIFF ('a aexp) ('a aexp) 

307 
 NUM 'a 

308 
and 

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

310 
 AND ('a bexp) ('a bexp) 

311 
 OR ('a bexp) ('a bexp) 

312 

5267  313 
as well as indirectly recursive datatypes such as 
5214  314 

5217  315 
datatype 
316 
('a, 'b) term = Var 'a 

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

5214  318 

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

321 

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

323 
<function_name>.simps. 

324 

325 
INCOMPATIBILITIES: 

5214  326 

5217  327 
 Theories using datatypes must now have theory Datatype as an 
328 
ancestor. 

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

330 
generic induct_tac instead. 

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

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

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

338 
some datatype definitions may have to be annotated with explicit 

339 
sort constraints. 

340 
 Primrec definitions no longer require function name and type 

341 
of recursive argument. 

5214  342 

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

345 

346 

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

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

350 
support is as follows: 

351 

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

353 
constructor terms) are part of the standard simpset; 

354 

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

356 
made part of standard simpset and claset via addIffs; 

357 

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

359 
the standard claset (addSWrapper); 

360 

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

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

363 
the name of your record type. 

364 

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

366 

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

368 

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

370 
blow up into some record constructor term, consequently the 

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

372 
solve record problems automatically. 

373 

5214  374 

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

377 

5650  378 
* automatic simplification of integer sums and comparisons, using cancellation; 
379 

5526  380 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  381 

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

383 

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

385 

386 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

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

388 
with add/delsplits); 

5125  389 

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

392 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

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

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

396 
%u.f(); 

5125  397 

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

5109  400 

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

403 
disjointness reasoning but breaking a few old proofs. 

5267  404 

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

407 
literature); 

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

408 

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

4838  411 

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

414 
release ONLY. 

415 

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

418 
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

419 

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

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

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

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

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

5282  428 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  429 

5127  430 
* HOL/Arith: 
431 
 removed 'pred' (predecessor) function; 

432 
 generalized some theorems about n1; 

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

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

4766  435 

5127  436 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  437 
instead of "inverse"; 
4711  438 

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

441 

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

5127  445 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  446 

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

449 

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

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

453 

5363  454 

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

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

456 

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

5160  459 

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

462 
disjointness reasoning but breaking a few old proofs. 

5267  463 

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

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

467 

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

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

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

5308  472 
Now rew can involve either definitions or equalities (either == or =). 
5142  473 

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

476 

4842  477 

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

479 

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

5207  482 

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

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

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

487 

5251  488 
* removed global_names compatibility flag  all theory declarations 
489 
are qualified by default; 

490 

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

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

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

494 

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

497 

5207  498 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
499 
subgoal; 

5142  500 

5251  501 
* Display.print_goals function moved to Locale.print_goals; 
502 

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

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

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

507 
for example; 

508 

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

509 

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

510 

4410  511 
New in Isabelle98 (January 1998) 
512 
 

513 

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

515 

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

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

518 

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

520 
simpset / simpset_ref; 

521 

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

523 
implicit merge of thms' signatures; 

524 

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

526 

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

528 

3454  529 

3715  530 
*** General Changes *** 
531 

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

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

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

539 
backward campatibility problems try setting 'global_names' at compile 

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

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

542 
section; 

4108  543 

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

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

546 
replaced by functions simpset:unit>simpset and 

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

548 
to patch your ML files accordingly; 

3856  549 

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

3901  552 
usedir (see i option, ISABELLE_USEDIR_OPTIONS); 
3857  553 

3856  554 
* defs may now be conditional; improved rewrite_goals_tac to handle 
555 
conditional equations; 

556 

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

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

4112  561 
restricted to 'trivial' ones; COMPATIBILITY: one may have to use 
3901  562 
transfer:theory>thm>thm in (rare) cases; 
563 

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

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

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

566 

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

569 

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

571 
show_types); 

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

572 

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

574 

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

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

576 

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

578 

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

580 

3715  581 
* removed obsolete init_pps and init_database; 
582 

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

584 
fun STATE tacfun st = tacfun st st; 

585 

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

4269  588 

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

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

591 
qualified references to the Sequence structure only!); 

592 

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

4269  595 

3715  596 

597 
*** Classical Reasoner *** 

598 

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

601 
splitting it into several subgoals; 

3715  602 

3719  603 
* Safe_tac: like safe_tac but uses the default claset; 
604 

3715  605 

606 
*** Simplifier *** 

607 

608 
* added simplification meta rules: 

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

610 

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

612 
logics (again); 

613 

614 
* added prems argument to simplification procedures; 

615 

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

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

619 

3715  620 

621 
*** Syntax *** 

622 

4174  623 
* TYPE('a) syntax for type reflection terms; 
624 

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

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

3846  628 

3715  629 
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; 
630 

631 

632 
*** HOL *** 

633 

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

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

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

4035  640 
protocol TLS; 
3985  641 

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

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

646 
differences; simplification procedures nat_cancel_factor for 

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

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

4335  650 

3580  651 
* HOL/simplifier: terms of the form 
4325  652 
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x) 
3580  653 
are rewritten to 
4035  654 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)', 
655 
and those of the form 

4325  656 
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) > R(x)' (or t=x) 
4035  657 
are rewritten to 
658 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) > R(t)', 

659 

660 
* HOL/datatype 

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

3580  662 

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

665 
... 

4189  666 
(!y1 ... ymn. x = Cn y1 ... ymn > P(f1 y1 ... ymn)) 
4035  667 
) 
668 

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

669 
and a theorem `split_t_case_asm' of the form 
4189  670 

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

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

673 
... 

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

675 
) 

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

676 
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

677 
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

678 
split_list_case and split_option_case. 
4189  679 

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

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

683 
because it will disappear altogether at some point. 

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

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

686 
`standard'. 

4357  687 

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

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

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

3570  692 

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

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

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

697 

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

700 
still lacks various theorems and concrete record syntax; 

701 

4125  702 

3715  703 
*** HOLCF *** 
3535  704 

4125  705 
* removed "axioms" and "generated by" sections; 
706 

4123  707 
* replaced "ops" section by extended "consts" section, which is capable of 
4125  708 
handling the continuous function space ">" directly; 
709 

710 
* domain package: 

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

712 
. creates hierachical name space, 

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

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

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

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

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

718 
appear on the lefthand side of the equations only; 

4123  719 

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

3567  721 

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

3579  724 

725 

3719  726 
*** FOL and ZF *** 
727 

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

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

733 

3719  734 

3579  735 

3006  736 
New in Isabelle948 (May 1997) 
737 
 

2654  738 

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

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

740 

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

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

742 
still somewhat experimental); old Makefiles etc. still functional; 
2971  743 

3205  744 
* new 'Isabelle System Manual'; 
745 

2825  746 
* INSTALL text, together with ./configure and ./build scripts; 
2773  747 

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

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

750 

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

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

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

753 

3006  754 

755 
*** Syntax *** 

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

756 

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

759 

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

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

761 
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

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

763 

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

768 
(Syntax.mark_boundT); 

2705  769 

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

2730  773 

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

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

775 

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

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

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

778 

3006  779 

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

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

781 

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

782 
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

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

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

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

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

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

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

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

791 

3107  792 
* substitution with equality assumptions no longer permutes other 
793 
assumptions; 

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

794 

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

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

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

798 

5726  799 
* improved combination of classical reasoner and simplifier: 
3317  800 
+ functions for handling clasimpsets 
801 
+ improvement of addss: now the simplifier is called _after_ the 

802 
safe steps. 

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

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

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

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

808 

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

811 
redex); 

812 

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

814 

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

816 

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

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

818 
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

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

821 

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

822 

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

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

824 

3042  825 
* a generic induction tactic `induct_tac' which works for all datatypes and 
3107  826 
also for type `nat'; 
3042  827 

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

830 

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

832 

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

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

835 

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

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

837 

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

840 

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

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

843 

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

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

846 

3227  847 
* HOL/Modelcheck demonstrates invocation of model checker oracle; 
848 

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

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

850 
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

851 

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

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

853 

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

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

855 

3321  856 
* a new constant `arbitrary == @x.False'; 
857 

3107  858 
* HOLCF/IOA replaces old HOL/IOA; 
859 

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

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

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

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

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

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

3006  870 

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

871 
*** ZF *** 
2553  872 

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

875 
as ZF_cs addSIs [equalityI]; 

2553  876 

2554  877 

2732  878 

2553  879 
New in Isabelle947 (November 96) 
880 
 

881 

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

883 

2554  884 
* superlinear speedup for large simplifications; 
885 

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

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

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

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

890 

891 
* improved printing of ==> : ~: 

892 

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

894 
and Modal (thanks to Sara Kalvala); 

895 

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

897 

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

899 
examples on HOL/Auth); 

900 

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

902 
the rewriter and classical reasoner simultaneously; 

903 

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

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

906 

907 

908 

909 
New in Isabelle946 

910 
 

911 

912 
* oracles  these establish an interface between Isabelle and trusted 

913 
external reasoners, which may deliver results as theorems; 

914 

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

916 

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

918 

919 
* "constdefs" section in theory files; 

920 

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

922 

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

924 

925 

926 

927 
New in Isabelle945 

928 
 

929 

930 
* reduced space requirements; 

931 

932 
* automatic HTML generation from theories; 

933 

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

935 

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

937 

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

939 

2553  940 

2557  941 

942 
New in Isabelle944 

943 
 

944 

2747  945 
* greatly reduced space requirements; 
2557  946 

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

948 

5726  949 
* searchable theorem database (see the section "Retrieving theorems" on 
2557  950 
page 8 of the Reference Manual); 
951 

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

953 
Axiom of Choice; 

954 

955 
* The previous version of HOL renamed to Old_HOL; 

956 

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

960 
* Mutually recursive inductive definitions finally work in HOL; 

961 

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

963 
translates to the operator "split"; 

964 

965 

966 

967 
New in Isabelle943 

968 
 

969 

5726  970 
* new infix operator, addss, allowing the classical reasoner to 
2557  971 
perform simplification at each step of its search. Example: 
5726  972 
fast_tac (cs addss ss) 
2557  973 

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

2557  976 
look like (a,b) instead of <a,b>; 
977 

978 
* PLEASE NOTE: CHOL will eventually replace HOL! 

979 

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

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

982 

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

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

985 

5726  986 
* Many new examples: I/O automata, ChurchRosser theorem, equivalents 
2557  987 
of the Axiom of Choice; 
988 

989 

990 

991 
New in Isabelle942 

992 
 

993 

5726  994 
* Significantly faster resolution; 
2557  995 

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

997 
freely; 

998 

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

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

1001 

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

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

1004 
(theory_of_thm); 

1005 

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

1007 

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

1009 
and HOL_dup_cs obsolete; 

1010 

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

1012 
have been removed; 

1013 

1014 
* Simpler definition of function space in ZF; 

1015 

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

1017 

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

1019 
types; 

1020 

1021 

2553  1022 
$Id$ 