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

NEWS

author | wenzelm |

Wed Nov 05 19:40:50 1997 +0100 (1997-11-05) | |

changeset 4177 | 77f65eb64da4 |

parent 4174 | 0a3556e5d6ed |

child 4178 | e64ff1c1bc70 |

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

mkdir -p bin;

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 * removed old README and Makefiles;

55 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;

57 * removed obsolete init_pps and init_database;

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

60 fun STATE tacfun st = tacfun st st;

63 *** Classical Reasoner ***

65 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new

66 tactics that use classical reasoning to simplify a subgoal without

67 splitting it into several subgoals;

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

72 *** Simplifier ***

74 * added simplification meta rules:

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

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

78 logics (again);

80 * added prems argument to simplification procedures;

83 *** Syntax ***

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

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

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

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

94 *** HOL ***

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

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

99 protocol TLS;

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

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

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

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

107 * HOL/simplifier: terms of the form

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

109 are rewritten to

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

111 and those of the form

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

113 are rewritten to

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

116 * HOL/datatype

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

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

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

121 ...

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

123 )

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

126 expand_list_case and expand_option_case have been renamed to

127 split_list_case and split_option_case.

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

130 (and its theorems too);

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

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

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

138 *** HOLCF ***

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

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

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

145 * domain package:

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

147 . creates hierachical name space,

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

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

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

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

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

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

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

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

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

161 *** FOL and ZF ***

163 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as

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

168 New in Isabelle94-8 (May 1997)

169 ------------------------------

171 *** General Changes ***

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

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

176 * new 'Isabelle System Manual';

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

180 * reimplemented type inference for greater efficiency, better error

181 messages and clean internal interface;

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

184 setting goals_limit);

187 *** Syntax ***

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

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

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

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

194 "symbols" syntax table;

196 * added token_translation interface (may translate name tokens in

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

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

199 are responsible for marking newly introduced bounds

200 (Syntax.mark_boundT);

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

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

204 version of xterm);

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

208 * added typed_print_translation (like print_translation, but may

209 access type of constant);

212 *** Classical Reasoner ***

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

215 some limitations. Blast_tac...

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

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

218 (the conclusion MUST be a formula variable)

219 + ignores types, which can make HOL proofs fail

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

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

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

224 * substitution with equality assumptions no longer permutes other

225 assumptions;

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

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

229 (and access functions for it);

231 * improved combination of classical reasoner and simplifier:

232 + functions for handling clasimpsets

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

234 safe steps.

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

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

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

239 *** Simplifier ***

241 * added interface for simplification procedures (functions that

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

243 redex);

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

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

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

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

251 functions setsolver and addsolver have been renamed to setSolver and

252 addSolver; added safe_asm_full_simp_tac;

255 *** HOL ***

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

258 also for type `nat';

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

261 datatypes and also for type `nat';

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

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

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

268 * primrec now also works with type nat;

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

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

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

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

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

277 infinite lists;

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

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

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

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

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

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

290 * HOLCF/IOA replaces old HOL/IOA;

292 * HOLCF changes: derived all rules and arities

293 + axiomatic type classes instead of classes

294 + typedef instead of faking type definitions

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

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

297 + eliminated the types void, one, tr

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

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

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

303 *** ZF ***

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

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

307 as ZF_cs addSIs [equalityI];

311 New in Isabelle94-7 (November 96)

312 ---------------------------------

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

316 * super-linear speedup for large simplifications;

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

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

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

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

323 * improved printing of ==> : ~:

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

326 and Modal (thanks to Sara Kalvala);

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

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

331 examples on HOL/Auth);

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

334 the rewriter and classical reasoner simultaneously;

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

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

341 New in Isabelle94-6

342 -------------------

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

345 external reasoners, which may deliver results as theorems;

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

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

351 * "constdefs" section in theory files;

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

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

359 New in Isabelle94-5

360 -------------------

362 * reduced space requirements;

364 * automatic HTML generation from theories;

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

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

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

374 New in Isabelle94-4

375 -------------------

377 * greatly reduced space requirements;

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

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

382 page 8 of the Reference Manual);

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

385 Axiom of Choice;

387 * The previous version of HOL renamed to Old_HOL;

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

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

392 * Mutually recursive inductive definitions finally work in HOL;

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

395 translates to the operator "split";

399 New in Isabelle94-3

400 -------------------

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

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

404 fast_tac (cs addss ss)

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

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

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

410 * PLEASE NOTE: CHOL will eventually replace HOL!

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

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

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

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

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

419 of the Axiom of Choice;

423 New in Isabelle94-2

424 -------------------

426 * Significantly faster resolution;

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

429 freely;

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

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

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

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

436 (theory_of_thm);

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

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

441 and HOL_dup_cs obsolete;

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

444 have been removed;

446 * Simpler definition of function space in ZF;

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

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

451 types;

454 $Id$