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

NEWS

author | oheimb |

Wed Nov 12 12:38:12 1997 +0100 (1997-11-12) | |

changeset 4207 | 061919f8da9c |

parent 4189 | b8c7a6bc6c16 |

child 4269 | a045600f0c98 |

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

renamed split_prem_tac to split_asm_tac

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;

65 *** Classical Reasoner ***

67 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new

68 tactics that use classical reasoning to simplify a subgoal without

69 splitting it into several subgoals;

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

74 *** Simplifier ***

76 * added simplification meta rules:

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

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

80 logics (again);

82 * added prems argument to simplification procedures;

85 *** Syntax ***

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

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

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

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

96 *** HOL ***

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

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

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

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

104 protocol TLS;

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

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

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

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

112 * HOL/simplifier: terms of the form

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

114 are rewritten to

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

116 and those of the form

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

118 are rewritten to

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

121 * HOL/datatype

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

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

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

126 ...

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

128 )

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

131 expand_list_case and expand_option_case have been renamed to

132 split_list_case and split_option_case.

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

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

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

138 ...

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

140 )

142 it be used with the new `split_asm_tac'.

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

145 (and its theorems too);

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

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

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

153 *** HOLCF ***

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

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

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

160 * domain package:

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

162 . creates hierachical name space,

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

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

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

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

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

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

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

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

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

176 *** FOL and ZF ***

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

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

181 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as

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

186 New in Isabelle94-8 (May 1997)

187 ------------------------------

189 *** General Changes ***

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

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

194 * new 'Isabelle System Manual';

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

198 * reimplemented type inference for greater efficiency, better error

199 messages and clean internal interface;

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

202 setting goals_limit);

205 *** Syntax ***

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

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

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

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

212 "symbols" syntax table;

214 * added token_translation interface (may translate name tokens in

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

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

217 are responsible for marking newly introduced bounds

218 (Syntax.mark_boundT);

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

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

222 version of xterm);

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

226 * added typed_print_translation (like print_translation, but may

227 access type of constant);

230 *** Classical Reasoner ***

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

233 some limitations. Blast_tac...

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

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

236 (the conclusion MUST be a formula variable)

237 + ignores types, which can make HOL proofs fail

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

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

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

242 * substitution with equality assumptions no longer permutes other

243 assumptions;

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

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

247 (and access functions for it);

249 * improved combination of classical reasoner and simplifier:

250 + functions for handling clasimpsets

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

252 safe steps.

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

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

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

257 *** Simplifier ***

259 * added interface for simplification procedures (functions that

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

261 redex);

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

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

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

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

269 functions setsolver and addsolver have been renamed to setSolver and

270 addSolver; added safe_asm_full_simp_tac;

273 *** HOL ***

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

276 also for type `nat';

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

279 datatypes and also for type `nat';

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

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

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

286 * primrec now also works with type nat;

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

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

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

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

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

295 infinite lists;

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

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

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

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

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

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

308 * HOLCF/IOA replaces old HOL/IOA;

310 * HOLCF changes: derived all rules and arities

311 + axiomatic type classes instead of classes

312 + typedef instead of faking type definitions

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

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

315 + eliminated the types void, one, tr

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

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

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

321 *** ZF ***

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

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

325 as ZF_cs addSIs [equalityI];

329 New in Isabelle94-7 (November 96)

330 ---------------------------------

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

334 * super-linear speedup for large simplifications;

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

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

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

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

341 * improved printing of ==> : ~:

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

344 and Modal (thanks to Sara Kalvala);

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

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

349 examples on HOL/Auth);

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

352 the rewriter and classical reasoner simultaneously;

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

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

359 New in Isabelle94-6

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

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

363 external reasoners, which may deliver results as theorems;

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

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

369 * "constdefs" section in theory files;

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

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

377 New in Isabelle94-5

378 -------------------

380 * reduced space requirements;

382 * automatic HTML generation from theories;

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

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

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

392 New in Isabelle94-4

393 -------------------

395 * greatly reduced space requirements;

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

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

400 page 8 of the Reference Manual);

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

403 Axiom of Choice;

405 * The previous version of HOL renamed to Old_HOL;

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

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

410 * Mutually recursive inductive definitions finally work in HOL;

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

413 translates to the operator "split";

417 New in Isabelle94-3

418 -------------------

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

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

422 fast_tac (cs addss ss)

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

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

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

428 * PLEASE NOTE: CHOL will eventually replace HOL!

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

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

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

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

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

437 of the Axiom of Choice;

441 New in Isabelle94-2

442 -------------------

444 * Significantly faster resolution;

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

447 freely;

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

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

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

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

454 (theory_of_thm);

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

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

459 and HOL_dup_cs obsolete;

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

462 have been removed;

464 * Simpler definition of function space in ZF;

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

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

469 types;

472 $Id$