author  wenzelm 
Mon, 16 Aug 1999 17:42:37 +0200  
changeset 7216  7ee4eecdc8a6 
parent 7215  1379275df5cd 
child 7238  36e58620ffc8 
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 

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

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

7215  13 

14 
Delcongs [if_weak_cong]; 

6922  15 

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

5931  18 

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

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

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

22 
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

23 

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

6057  26 

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

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

6141  30 

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

6057  33 

6069  34 
*** Proof tools *** 
35 

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

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

39 
instantiated for other types and logics as well. 

6069  40 

41 

6014  42 
*** General *** 
43 

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

46 
interface it offers an interactive environment for developing human 

47 
readable proof documents (Isar == Intelligible semiautomated 

48 
reasoning); see isatool doc isarref and 

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

50 

51 
* native support for ProofGeneral, both for classic Isabelle and 

52 
Isabelle/Isar (the latter is slightly better supported and more 

53 
robust); 

54 

6751  55 
* Isabelle manuals now also available as PDF; 
56 

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

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

60 

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

6671  63 
add_path, del_path, reset_path functions; new operations such as 
64 
update_thy, touch_thy, remove_thy (see also isatool doc ref); 

6449  65 

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

68 

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

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

71 

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

73 

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

5973  76 

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

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

79 

6343  80 
* new print_mode "HTML"; 
81 

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

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

84 

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

87 

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

89 
244c244 

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

91 
 

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

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

96 
 

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

98 

6028  99 

6057  100 
*** HOL *** 
101 

7215  102 
** HOL arithmetic ** 
103 

6343  104 
* There are now decision procedures for linear arithmetic over nat and 
105 
int: 

6131  106 

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

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

110 
are ignored; quantified subformulae are ignored unless they are 

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

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

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

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

6131  115 

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

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

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

120 
simplifier. 

6131  121 

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

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

6028  125 

7215  126 
* HOL/Numeral provides a generic theory of numerals (encoded 
127 
efficiently as bit strings); setup for types nat and int is in place; 

128 
INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than 

129 
int, existing theories and proof scripts may require a few additional 

130 
type constraints; 

131 

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

133 
arguments; 

7157  134 

7215  135 
* many properties of integer multiplication, division and remainder 
136 
are now available; 

6922  137 

7215  138 
* An interface to the Stanford Validity Checker (SVC) is available 
139 
through the tactic svc_tac. Propositional tautologies and theorems of 

140 
linear arithmetic are proved automatically. Numeric variables may 

141 
have types nat, int or real. SVC must be installed separately, and 

142 
its results must be TAKEN ON TRUST (Isabelle does not check the 

143 
proofs, but tags any invocation of the underlying oracle). 

6922  144 

7125  145 
* IsaMakefile: the HOLReal target now builds an actual image; 
146 

7215  147 

148 
** HOL misc ** 

149 

150 
* HOL/datatype: Now also handles arbitrarily branching datatypes 

151 
(using function types) such as 

152 

153 
datatype 'a tree = Atom 'a  Branch "nat => 'a tree" 

6403  154 

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

157 
temporal levels more uniformly; introduces INCOMPATIBILITIES due to 

158 
changed syntax and (many) tactics; 

159 

7215  160 
* New bounded quantifier syntax (input only): 
161 
! x < y. P, ! x <= y. P, ? x < y. P, ? x <= y. P 

7047
d103b875ef1d
Datatype package now handles arbitrarily branching datatypes.
berghofe
parents:
6925
diff
changeset

162 

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

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

164 
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

165 

6671  166 
* HOL/recdef (TFL): requires theory Recdef; 'congs' syntax now expects 
167 
comma separated list of theorem names rather than an ML expression; 

6563  168 

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

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

172 

173 

7113  174 
*** LK *** 
175 

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

7113  178 

179 
* the simplifier is now installed 

180 

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

182 

183 
* the classical reasoner now has a default rule database 

184 

185 

6064  186 
*** ZF *** 
187 

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

6269  189 
directly (as in HOL) over datatypes and the natural numbers; 
6064  190 

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

6064  193 

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

195 

6141  196 
* simplification automatically does freeness reasoning for datatype 
6269  197 
constructors; 
6141  198 

6269  199 
* automatic typeinference, with AddTCs command to insert new 
200 
typechecking rules; 

6155  201 

6269  202 
* datatype introduction rules are now added as Safe Introduction rules 
203 
to the claset; 

6155  204 

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

207 

6069  208 

6343  209 
*** Internal programming interfaces *** 
210 

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

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

212 

6343  213 
* tuned current_goals_markers semantics: begin / end goal avoids 
214 
printing empty lines; 

215 

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

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

218 
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: 

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

220 

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

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

223 
mode to get Isabelle font glyphs as before; 

224 

225 
* refined token_translation interface; INCOMPATIBILITY: output length 

226 
now of type real instead of int; 

227 

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

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

231 
opposed to intratheory data slots offered via TheoryDataFun; 

232 

6343  233 

6064  234 

5781  235 
New in Isabelle981 (October 1998) 
236 
 

237 

5127  238 
*** Overview of INCOMPATIBILITIES (see below for more details) *** 
4842  239 

5726  240 
* several changes of automated proof tools; 
5373  241 

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

5214  244 

5726  245 
* HOL: renamed r^1 to 'converse' from 'inverse'; 'inj_onto' is now 
5217  246 
called `inj_on'; 
5160  247 

5275  248 
* HOL: removed duplicate thms in Arith: 
249 
less_imp_add_less should be replaced by trans_less_add1 

250 
le_imp_add_le should be replaced by trans_le_add1 

5160  251 

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

5490  254 

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

257 
now taken as an integer constant. 

5541  258 

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

260 

5363  261 

5127  262 
*** Proof tools *** 
4880  263 

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

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

265 
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

266 
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

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

268 
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

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

270 
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

271 
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

272 
2. The simplifier now knows a little bit about natarithmetic. 
4880  273 

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

276 
wrapper functionals. This implies that addbefore, addSbefore, 

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

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

279 
one (emitting a warning). 

4824  280 
type wrapper = (int > tactic) > (int > tactic) 
4649  281 
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by 
4824  282 
addWrapper, addSWrapper: claset * (string * wrapper) > claset 
283 
delWrapper, delSWrapper: claset * string > claset 

4649  284 
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; 
285 

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

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

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

290 
by Force_tac; 

5524  291 

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

5524  294 

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

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

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

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

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

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

303 
split_all_tac for record fields. 

5127  304 

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

307 
Addsimps. They can be removed via Delsplits just like 

308 
Delsimps. Lowercase versions are also available. 

5127  309 

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

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

313 
either remove split_if completely from the default simpset by 

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

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

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

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

318 
t is the name of the datatype). 

5127  319 

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

5726  323 
aimed to solve the given subgoal completely. 
5127  324 

325 

326 
*** General *** 

327 

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

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

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

4842  334 

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

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

340 

5127  341 
* new theory section 'nonterminals' for purely syntactic types; 
4858  342 

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

4869  345 

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

348 

5363  349 
* isatool install  install binaries with absolute references to 
350 
ISABELLE_HOME/bin; 

351 

5572  352 
* isatool logo  create instances of the Isabelle logo (as EPS); 
353 

5407  354 
* print mode 'emacs' reserved for Isamode; 
355 

5726  356 
* support multiple print (ast) translations per constant name; 
357 

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

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

359 

4711  360 

4661  361 
*** HOL *** 
362 

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

5217  365 
* HOL/inductive package reorganized and improved: now supports mutual 
5267  366 
definitions such as 
5217  367 

368 
inductive EVEN ODD 

369 
intrs 

370 
null "0 : EVEN" 

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

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

373 

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

375 
recursive sets; inductive definitions now handle disjunctive premises 

376 
correctly (also ZF); 

5214  377 

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

380 
contained in "induct"; 

381 

382 

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

5267  384 
supports mutually recursive datatypes such as 
5217  385 

386 
datatype 

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

388 
 SUM ('a aexp) ('a aexp) 

389 
 DIFF ('a aexp) ('a aexp) 

390 
 NUM 'a 

391 
and 

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

393 
 AND ('a bexp) ('a bexp) 

394 
 OR ('a bexp) ('a bexp) 

395 

5267  396 
as well as indirectly recursive datatypes such as 
5214  397 

5217  398 
datatype 
399 
('a, 'b) term = Var 'a 

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

5214  401 

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

404 

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

406 
<function_name>.simps. 

407 

408 
INCOMPATIBILITIES: 

5214  409 

5217  410 
 Theories using datatypes must now have theory Datatype as an 
411 
ancestor. 

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

413 
generic induct_tac instead. 

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

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

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

421 
some datatype definitions may have to be annotated with explicit 

422 
sort constraints. 

423 
 Primrec definitions no longer require function name and type 

424 
of recursive argument. 

5214  425 

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

428 

429 

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

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

433 
support is as follows: 

434 

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

436 
constructor terms) are part of the standard simpset; 

437 

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

439 
made part of standard simpset and claset via addIffs; 

440 

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

442 
the standard claset (addSWrapper); 

443 

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

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

446 
the name of your record type. 

447 

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

449 

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

451 

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

453 
blow up into some record constructor term, consequently the 

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

455 
solve record problems automatically. 

456 

5214  457 

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

460 

5650  461 
* automatic simplification of integer sums and comparisons, using cancellation; 
462 

5526  463 
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; 
5127  464 

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

466 

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

468 

469 
* expand_if, expand_split, expand_sum_case and expand_nat_case are now 

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

471 
with add/delsplits); 

5125  472 

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

475 
MAKE EXISTING PROOFS FAIL under rare circumstances (consider 

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

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

479 
%u.f(); 

5125  480 

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

5109  483 

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

486 
disjointness reasoning but breaking a few old proofs. 

5267  487 

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

490 
literature); 

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

491 

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

4838  494 

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

497 
release ONLY. 

498 

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

501 
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

502 

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

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

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

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

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

5282  511 
 new lexicographic orderings and corresponding wellfoundedness theorems. 
4779  512 

5127  513 
* HOL/Arith: 
514 
 removed 'pred' (predecessor) function; 

515 
 generalized some theorems about n1; 

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

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

4766  518 

5127  519 
* HOL/Relation: renamed the relational operator r^1 "converse" 
4842  520 
instead of "inverse"; 
4711  521 

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

524 

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

5127  528 
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; 
4711  529 

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

532 

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

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

536 

5363  537 

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

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

539 

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

5160  542 

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

545 
disjointness reasoning but breaking a few old proofs. 

5267  546 

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

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

550 

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

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

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

5308  555 
Now rew can involve either definitions or equalities (either == or =). 
5142  556 

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

559 

4842  560 

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

562 

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

5207  565 

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

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

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

570 

5251  571 
* removed global_names compatibility flag  all theory declarations 
572 
are qualified by default; 

573 

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

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

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

577 

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

580 

5207  581 
* new tactical CHANGED_GOAL for checking that a tactic modifies a 
582 
subgoal; 

5142  583 

5251  584 
* Display.print_goals function moved to Locale.print_goals; 
585 

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

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

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

590 
for example; 

591 

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

592 

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

593 

4410  594 
New in Isabelle98 (January 1998) 
595 
 

596 

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

598 

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

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

601 

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

603 
simpset / simpset_ref; 

604 

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

606 
implicit merge of thms' signatures; 

607 

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

609 

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

611 

3454  612 

3715  613 
*** General Changes *** 
614 

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

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

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

622 
backward campatibility problems try setting 'global_names' at compile 

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

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

625 
section; 

4108  626 

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

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

629 
replaced by functions simpset:unit>simpset and 

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

631 
to patch your ML files accordingly; 

3856  632 

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

3901  635 
usedir (see i option, ISABELLE_USEDIR_OPTIONS); 
3857  636 

3856  637 
* defs may now be conditional; improved rewrite_goals_tac to handle 
638 
conditional equations; 

639 

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

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

4112  644 
restricted to 'trivial' ones; COMPATIBILITY: one may have to use 
3901  645 
transfer:theory>thm>thm in (rare) cases; 
646 

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

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

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

649 

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

652 

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

654 
show_types); 

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

655 

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

657 

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

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

659 

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

661 

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

663 

3715  664 
* removed obsolete init_pps and init_database; 
665 

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

667 
fun STATE tacfun st = tacfun st st; 

668 

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

4269  671 

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

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

674 
qualified references to the Sequence structure only!); 

675 

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

4269  678 

3715  679 

680 
*** Classical Reasoner *** 

681 

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

684 
splitting it into several subgoals; 

3715  685 

3719  686 
* Safe_tac: like safe_tac but uses the default claset; 
687 

3715  688 

689 
*** Simplifier *** 

690 

691 
* added simplification meta rules: 

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

693 

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

695 
logics (again); 

696 

697 
* added prems argument to simplification procedures; 

698 

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

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

702 

3715  703 

704 
*** Syntax *** 

705 

4174  706 
* TYPE('a) syntax for type reflection terms; 
707 

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

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

3846  711 

3715  712 
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; 
713 

714 

715 
*** HOL *** 

716 

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

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

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

4035  723 
protocol TLS; 
3985  724 

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

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

729 
differences; simplification procedures nat_cancel_factor for 

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

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

4335  733 

3580  734 
* HOL/simplifier: terms of the form 
4325  735 
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x) 
3580  736 
are rewritten to 
4035  737 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)', 
738 
and those of the form 

4325  739 
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) > R(x)' (or t=x) 
4035  740 
are rewritten to 
741 
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) > R(t)', 

742 

743 
* HOL/datatype 

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

3580  745 

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

748 
... 

4189  749 
(!y1 ... ymn. x = Cn y1 ... ymn > P(f1 y1 ... ymn)) 
4035  750 
) 
751 

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

752 
and a theorem `split_t_case_asm' of the form 
4189  753 

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

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

756 
... 

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

758 
) 

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

759 
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

760 
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

761 
split_list_case and split_option_case. 
4189  762 

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

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

766 
because it will disappear altogether at some point. 

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

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

769 
`standard'. 

4357  770 

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

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

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

3570  775 

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

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

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

780 

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

783 
still lacks various theorems and concrete record syntax; 

784 

4125  785 

3715  786 
*** HOLCF *** 
3535  787 

4125  788 
* removed "axioms" and "generated by" sections; 
789 

4123  790 
* replaced "ops" section by extended "consts" section, which is capable of 
4125  791 
handling the continuous function space ">" directly; 
792 

793 
* domain package: 

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

795 
. creates hierachical name space, 

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

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

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

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

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

801 
appear on the lefthand side of the equations only; 

4123  802 

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

3567  804 

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

3579  807 

808 

3719  809 
*** FOL and ZF *** 
810 

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

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

816 

3719  817 

3579  818 

3006  819 
New in Isabelle948 (May 1997) 
820 
 

2654  821 

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

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

823 

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

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

825 
still somewhat experimental); old Makefiles etc. still functional; 
2971  826 

3205  827 
* new 'Isabelle System Manual'; 
828 

2825  829 
* INSTALL text, together with ./configure and ./build scripts; 
2773  830 

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

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

833 

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

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

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

836 

3006  837 

838 
*** Syntax *** 

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

839 

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

842 

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

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

844 
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

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

846 

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

851 
(Syntax.mark_boundT); 

2705  852 

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

2730  856 

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

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

858 

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

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

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

861 

3006  862 

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

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

864 

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

865 
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

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

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

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

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

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

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

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

874 

3107  875 
* substitution with equality assumptions no longer permutes other 
876 
assumptions; 

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

877 

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

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

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

881 

5726  882 
* improved combination of classical reasoner and simplifier: 
3317  883 
+ functions for handling clasimpsets 
884 
+ improvement of addss: now the simplifier is called _after_ the 

885 
safe steps. 

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

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

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

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

891 

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

894 
redex); 

895 

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

897 

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

899 

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

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

901 
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

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

904 

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

905 

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

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

907 

3042  908 
* a generic induction tactic `induct_tac' which works for all datatypes and 
3107  909 
also for type `nat'; 
3042  910 

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

913 

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

915 

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

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

918 

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

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

920 

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

923 

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

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

926 

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

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

929 

3227  930 
* HOL/Modelcheck demonstrates invocation of model checker oracle; 
931 

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

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

933 
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

934 

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

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

936 

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

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

938 

3321  939 
* a new constant `arbitrary == @x.False'; 
940 

3107  941 
* HOLCF/IOA replaces old HOL/IOA; 
942 

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

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

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

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

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

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

3006  953 

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

954 
*** ZF *** 
2553  955 

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

958 
as ZF_cs addSIs [equalityI]; 

2553  959 

2554  960 

2732  961 

2553  962 
New in Isabelle947 (November 96) 
963 
 

964 

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

966 

2554  967 
* superlinear speedup for large simplifications; 
968 

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

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

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

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

973 

974 
* improved printing of ==> : ~: 

975 

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

977 
and Modal (thanks to Sara Kalvala); 

978 

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

980 

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

982 
examples on HOL/Auth); 

983 

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

985 
the rewriter and classical reasoner simultaneously; 

986 

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

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

989 

990 

991 

992 
New in Isabelle946 

993 
 

994 

995 
* oracles  these establish an interface between Isabelle and trusted 

996 
external reasoners, which may deliver results as theorems; 

997 

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

999 

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

1001 

1002 
* "constdefs" section in theory files; 

1003 

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

1005 

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

1007 

1008 

1009 

1010 
New in Isabelle945 

1011 
 

1012 

1013 
* reduced space requirements; 

1014 

1015 
* automatic HTML generation from theories; 

1016 

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

1018 

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

1020 

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

1022 

2553  1023 

2557  1024 

1025 
New in Isabelle944 

1026 
 

1027 

2747  1028 
* greatly reduced space requirements; 
2557  1029 

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

1031 

5726  1032 
* searchable theorem database (see the section "Retrieving theorems" on 
2557  1033 
page 8 of the Reference Manual); 
1034 

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

1036 
Axiom of Choice; 

1037 

1038 
* The previous version of HOL renamed to Old_HOL; 

1039 

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

1043 
* Mutually recursive inductive definitions finally work in HOL; 

1044 

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

1046 
translates to the operator "split"; 

1047 

1048 

1049 

1050 
New in Isabelle943 

1051 
 

1052 

5726  1053 
* new infix operator, addss, allowing the classical reasoner to 
2557  1054 
perform simplification at each step of its search. Example: 
5726  1055 
fast_tac (cs addss ss) 
2557  1056 

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

2557  1059 
look like (a,b) instead of <a,b>; 
1060 

1061 
* PLEASE NOTE: CHOL will eventually replace HOL! 

1062 

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

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

1065 

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

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

1068 

5726  1069 
* Many new examples: I/O automata, ChurchRosser theorem, equivalents 
2557  1070 
of the Axiom of Choice; 
1071 

1072 

1073 

1074 
New in Isabelle942 

1075 
 

1076 

5726  1077 
* Significantly faster resolution; 
2557  1078 

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

1080 
freely; 

1081 

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

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

1084 

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

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

1087 
(theory_of_thm); 

1088 

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

1090 

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

1092 
and HOL_dup_cs obsolete; 

1093 

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

1095 
have been removed; 

1096 

1097 
* Simpler definition of function space in ZF; 

1098 

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

1100 

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

1102 
types; 

1103 

1104 

2553  1105 
$Id$ 