summary |
shortlog |
changelog |
graph |
tags |
branches |
files |
changeset |
file |
revisions |
annotate |
diff |
raw

NEWS

author | paulson |

Wed Nov 26 16:49:07 1997 +0100 (1997-11-26 ago) | |

changeset 4299 | 22596d62ce0b |

parent 4269 | a045600f0c98 |

child 4325 | e72cba5af6c5 |

permissions | -rw-r--r-- |

updated comment

2 Isabelle NEWS -- history of user-visible changes

3 ================================================

5 New in Isabelle???? (DATE ????)

6 -------------------------------

8 *** General Changes ***

10 * hierachically structured name spaces (for consts, types, axms, thms

11 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of

12 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:

13 isatool fixdots ensures space after dots (e.g. "%x. x"); set

14 long_names for fully qualified output names; NOTE: ML programs

15 (special tactics, packages etc.) referring to internal names may have

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

17 backward campatibility problems try setting 'global_names' at compile

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

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

20 section;

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

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

24 replaced by functions simpset:unit->simpset and

25 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp

26 to patch your ML files accordingly;

28 * HTML output now includes theory graph data for display with Java

29 applet or isatool browser; data generated automatically via isatool

30 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);

32 * defs may now be conditional; improved rewrite_goals_tac to handle

33 conditional equations;

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

37 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always

38 creates a new theory node; implicit merge of thms' signatures is

39 restricted to 'trivial' ones; COMPATIBILITY: one may have to use

40 transfer:theory->thm->thm in (rare) cases;

42 * improved handling of draft signatures / theories; draft thms (and

43 ctyps, cterms) are automatically promoted to real ones;

45 * slightly changed interfaces for oracles: admit many per theory, named

46 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;

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

49 show_types);

51 * improved output of warnings (###) / errors (***);

53 * subgoal_tac displays a warning if the new subgoal has type variables;

55 * removed old README and Makefiles;

57 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;

59 * removed obsolete init_pps and init_database;

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

62 fun STATE tacfun st = tacfun st st;

64 * cd, use, use etc. now support path variables, e.g. ~ (which

65 abbreviates $HOME), or $ISABELLE_HOME;

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

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

69 qualified references to the Sequence structure only!);

73 *** Classical Reasoner ***

75 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new

76 tactics that use classical reasoning to simplify a subgoal without

77 splitting it into several subgoals;

79 * Safe_tac: like safe_tac but uses the default claset;

82 *** Simplifier ***

84 * added simplification meta rules:

85 (asm_)(full_)simplify: simpset -> thm -> thm;

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

88 logics (again);

90 * added prems argument to simplification procedures;

93 *** Syntax ***

95 * TYPE('a) syntax for type reflection terms;

97 * no longer handles consts with name "" -- declare as 'syntax' instead;

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

101 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;

104 *** HOL ***

106 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.

107 with `addloop' of the simplifier to faciliate case splitting in premises.

109 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;

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

112 protocol TLS;

114 * HOL/Map: new theory of `maps' a la VDM;

116 * HOL/simplifier: added infix function `addsplits':

117 instead of `<simpset> setloop (split_tac <thms>)'

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

120 * HOL/simplifier: terms of the form

121 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)

122 are rewritten to

123 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',

124 and those of the form

125 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)

126 are rewritten to

127 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',

129 * HOL/datatype

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

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

133 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &

134 ...

135 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))

136 )

138 which can be added to a simpset via `addsplits'. The existing theorems

139 expand_list_case and expand_option_case have been renamed to

140 split_list_case and split_option_case.

142 Additionally, there is a theorem `split_t_case_asm' of the form

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

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

146 ...

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

148 )

150 it be used with the new `split_asm_tac'.

152 * HOL/Lists: the function "set_of_list" has been renamed "set"

153 (and its theorems too);

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

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

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

161 *** HOLCF ***

163 * removed "axioms" and "generated by" sections;

165 * replaced "ops" section by extended "consts" section, which is capable of

166 handling the continuous function space "->" directly;

168 * domain package:

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

170 . creates hierachical name space,

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

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

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

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

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

176 appear on the left-hand side of the equations only;

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

180 * added extended adm_tac to simplifier in HOLCF -- can now discharge

181 adm (%x. P (t x)), where P is chainfinite and t continuous;

184 *** FOL and ZF ***

186 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.

187 with `addloop' of the simplifier to faciliate case splitting in premises.

189 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as

190 in HOL, they strip ALL and --> from proved theorems;

194 New in Isabelle94-8 (May 1997)

195 ------------------------------

197 *** General Changes ***

199 * new utilities to build / run / maintain Isabelle etc. (in parts

200 still somewhat experimental); old Makefiles etc. still functional;

202 * new 'Isabelle System Manual';

204 * INSTALL text, together with ./configure and ./build scripts;

206 * reimplemented type inference for greater efficiency, better error

207 messages and clean internal interface;

209 * prlim command for dealing with lots of subgoals (an easier way of

210 setting goals_limit);

213 *** Syntax ***

215 * supports alternative (named) syntax tables (parser and pretty

216 printer); internal interface is provided by add_modesyntax(_i);

218 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to

219 be used in conjunction with the Isabelle symbol font; uses the

220 "symbols" syntax table;

222 * added token_translation interface (may translate name tokens in

223 arbitrary ways, dependent on their type (free, bound, tfree, ...) and

224 the current print_mode); IMPORTANT: user print translation functions

225 are responsible for marking newly introduced bounds

226 (Syntax.mark_boundT);

228 * token translations for modes "xterm" and "xterm_color" that display

229 names in bold, underline etc. or colors (which requires a color

230 version of xterm);

232 * infixes may now be declared with names independent of their syntax;

234 * added typed_print_translation (like print_translation, but may

235 access type of constant);

238 *** Classical Reasoner ***

240 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has

241 some limitations. Blast_tac...

242 + ignores addss, addbefore, addafter; this restriction is intrinsic

243 + ignores elimination rules that don't have the correct format

244 (the conclusion MUST be a formula variable)

245 + ignores types, which can make HOL proofs fail

246 + rules must not require higher-order unification, e.g. apply_type in ZF

247 [message "Function Var's argument not a bound variable" relates to this]

248 + its proof strategy is more general but can actually be slower

250 * substitution with equality assumptions no longer permutes other

251 assumptions;

253 * minor changes in semantics of addafter (now called addaltern); renamed

254 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper

255 (and access functions for it);

257 * improved combination of classical reasoner and simplifier:

258 + functions for handling clasimpsets

259 + improvement of addss: now the simplifier is called _after_ the

260 safe steps.

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

262 _during_ the safe steps. It is more complete as it allows multiple

263 instantiations of unknowns (e.g. with slow_tac).

265 *** Simplifier ***

267 * added interface for simplification procedures (functions that

268 produce *proven* rewrite rules on the fly, depending on current

269 redex);

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

273 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;

275 * the solver is now split into a safe and an unsafe part.

276 This should be invisible for the normal user, except that the

277 functions setsolver and addsolver have been renamed to setSolver and

278 addSolver; added safe_asm_full_simp_tac;

281 *** HOL ***

283 * a generic induction tactic `induct_tac' which works for all datatypes and

284 also for type `nat';

286 * a generic case distinction tactic `exhaust_tac' which works for all

287 datatypes and also for type `nat';

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

291 * patterns in case expressions allow tuple patterns as arguments to

292 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';

294 * primrec now also works with type nat;

296 * recdef: a new declaration form, allows general recursive functions to be

297 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.

299 * the constant for negation has been renamed from "not" to "Not" to

300 harmonize with FOL, ZF, LK, etc.;

302 * HOL/ex/LFilter theory of a corecursive "filter" functional for

303 infinite lists;

305 * HOL/Modelcheck demonstrates invocation of model checker oracle;

307 * HOL/ex/Ring.thy declares cring_simp, which solves equational

308 problems in commutative rings, using axiomatic type classes for + and *;

310 * more examples in HOL/MiniML and HOL/Auth;

312 * more default rewrite rules for quantifiers, union/intersection;

314 * a new constant `arbitrary == @x.False';

316 * HOLCF/IOA replaces old HOL/IOA;

318 * HOLCF changes: derived all rules and arities

319 + axiomatic type classes instead of classes

320 + typedef instead of faking type definitions

321 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.

322 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po

323 + eliminated the types void, one, tr

324 + use unit lift and bool lift (with translations) instead of one and tr

325 + eliminated blift from Lift3.thy (use Def instead of blift)

326 all eliminated rules are derived as theorems --> no visible changes ;

329 *** ZF ***

331 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default

332 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back

333 as ZF_cs addSIs [equalityI];

337 New in Isabelle94-7 (November 96)

338 ---------------------------------

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

342 * super-linear speedup for large simplifications;

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

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

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

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

349 * improved printing of ==> : ~:

351 * new object-logic "Sequents" adds linear logic, while replacing LK

352 and Modal (thanks to Sara Kalvala);

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

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

357 examples on HOL/Auth);

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

360 the rewriter and classical reasoner simultaneously;

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

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

367 New in Isabelle94-6

368 -------------------

370 * oracles -- these establish an interface between Isabelle and trusted

371 external reasoners, which may deliver results as theorems;

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

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

377 * "constdefs" section in theory files;

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

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

385 New in Isabelle94-5

386 -------------------

388 * reduced space requirements;

390 * automatic HTML generation from theories;

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

394 * new examples, including two proofs of the Church-Rosser theorem;

396 * non-curried (1994) version of HOL is no longer distributed;

400 New in Isabelle94-4

401 -------------------

403 * greatly reduced space requirements;

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

407 * searchable theorem database (see the section "Retrieving theorems" on

408 page 8 of the Reference Manual);

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

411 Axiom of Choice;

413 * The previous version of HOL renamed to Old_HOL;

415 * The new version of HOL (previously called CHOL) uses a curried syntax

416 for functions. Application looks like f a b instead of f(a,b);

418 * Mutually recursive inductive definitions finally work in HOL;

420 * In ZF, pattern-matching on tuples is now available in all abstractions and

421 translates to the operator "split";

425 New in Isabelle94-3

426 -------------------

428 * new infix operator, addss, allowing the classical reasoner to

429 perform simplification at each step of its search. Example:

430 fast_tac (cs addss ss)

432 * a new logic, CHOL, the same as HOL, but with a curried syntax

433 for functions. Application looks like f a b instead of f(a,b). Also pairs

434 look like (a,b) instead of <a,b>;

436 * PLEASE NOTE: CHOL will eventually replace HOL!

438 * In CHOL, pattern-matching on tuples is now available in all abstractions.

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

441 * In ZF, integer numerals now denote two's-complement binary integers.

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

444 * Many new examples: I/O automata, Church-Rosser theorem, equivalents

445 of the Axiom of Choice;

449 New in Isabelle94-2

450 -------------------

452 * Significantly faster resolution;

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

455 freely;

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

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

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

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

462 (theory_of_thm);

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

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

467 and HOL_dup_cs obsolete;

469 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1

470 have been removed;

472 * Simpler definition of function space in ZF;

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

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

477 types;

480 $Id$