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

NEWS

author | wenzelm |

Tue Nov 04 16:21:52 1997 +0100 (1997-11-04) | |

changeset 4125 | dc1cf9db1e17 |

parent 4123 | 9600dd68d35b |

child 4154 | 17a3a2c5a35f |

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

tuned;

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,

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: in case of severe

15 problems with backward campatibility try setting 'global_names' at

16 compile time to disable qualified names for theories; may also fine

17 tune theories via 'global' and 'local' section;

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

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

21 replaced by functions simpset:unit->simpset and

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

23 to patch your ML files accordingly;

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

26 applet or isatool browser; data generated automatically via isatool

27 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);

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

30 conditional equations;

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

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

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

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

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

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

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

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

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

44 show_types);

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

48 * removed old README and Makefiles;

50 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;

52 * removed obsolete init_pps and init_database;

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

55 fun STATE tacfun st = tacfun st st;

58 *** Classical Reasoner ***

60 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new

61 tactics that use classical reasoning to simplify a subgoal without

62 splitting it into several subgoals;

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

67 *** Simplifier ***

69 * added simplification meta rules:

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

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

73 logics (again);

75 * added prems argument to simplification procedures;

78 *** Syntax ***

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

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

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

87 *** HOL ***

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

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

92 protocol TLS;

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

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

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

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

100 * HOL/simplifier: terms of the form

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

102 are rewritten to

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

104 and those of the form

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

106 are rewritten to

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

109 * HOL/datatype

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

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

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

114 ...

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

116 )

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

119 expand_list_case and expand_option_case have been renamed to

120 split_list_case and split_option_case.

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

123 (and its theorems too);

126 *** HOLCF ***

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

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

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

133 * domain package:

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

135 . creates hierachical name space,

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

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

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

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

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

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

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

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

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

149 *** FOL and ZF ***

151 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as

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

156 New in Isabelle94-8 (May 1997)

157 ------------------------------

159 *** General Changes ***

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

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

164 * new 'Isabelle System Manual';

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

168 * reimplemented type inference for greater efficiency, better error

169 messages and clean internal interface;

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

172 setting goals_limit);

175 *** Syntax ***

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

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

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

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

182 "symbols" syntax table;

184 * added token_translation interface (may translate name tokens in

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

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

187 are responsible for marking newly introduced bounds

188 (Syntax.mark_boundT);

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

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

192 version of xterm);

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

196 * added typed_print_translation (like print_translation, but may

197 access type of constant);

200 *** Classical Reasoner ***

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

203 some limitations. Blast_tac...

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

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

206 (the conclusion MUST be a formula variable)

207 + ignores types, which can make HOL proofs fail

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

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

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

212 * substitution with equality assumptions no longer permutes other

213 assumptions;

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

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

217 (and access functions for it);

219 * improved combination of classical reasoner and simplifier:

220 + functions for handling clasimpsets

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

222 safe steps.

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

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

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

227 *** Simplifier ***

229 * added interface for simplification procedures (functions that

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

231 redex);

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

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

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

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

239 functions setsolver and addsolver have been renamed to setSolver and

240 addSolver; added safe_asm_full_simp_tac;

243 *** HOL ***

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

246 also for type `nat';

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

249 datatypes and also for type `nat';

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

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

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

256 * primrec now also works with type nat;

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

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

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

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

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

265 infinite lists;

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

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

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

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

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

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

278 * HOLCF/IOA replaces old HOL/IOA;

280 * HOLCF changes: derived all rules and arities

281 + axiomatic type classes instead of classes

282 + typedef instead of faking type definitions

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

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

285 + eliminated the types void, one, tr

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

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

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

291 *** ZF ***

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

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

295 as ZF_cs addSIs [equalityI];

299 New in Isabelle94-7 (November 96)

300 ---------------------------------

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

304 * super-linear speedup for large simplifications;

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

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

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

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

311 * improved printing of ==> : ~:

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

314 and Modal (thanks to Sara Kalvala);

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

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

319 examples on HOL/Auth);

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

322 the rewriter and classical reasoner simultaneously;

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

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

329 New in Isabelle94-6

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

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

333 external reasoners, which may deliver results as theorems;

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

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

339 * "constdefs" section in theory files;

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

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

347 New in Isabelle94-5

348 -------------------

350 * reduced space requirements;

352 * automatic HTML generation from theories;

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

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

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

362 New in Isabelle94-4

363 -------------------

365 * greatly reduced space requirements;

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

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

370 page 8 of the Reference Manual);

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

373 Axiom of Choice;

375 * The previous version of HOL renamed to Old_HOL;

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

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

380 * Mutually recursive inductive definitions finally work in HOL;

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

383 translates to the operator "split";

387 New in Isabelle94-3

388 -------------------

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

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

392 fast_tac (cs addss ss)

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

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

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

398 * PLEASE NOTE: CHOL will eventually replace HOL!

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

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

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

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

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

407 of the Axiom of Choice;

411 New in Isabelle94-2

412 -------------------

414 * Significantly faster resolution;

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

417 freely;

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

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

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

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

424 (theory_of_thm);

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

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

429 and HOL_dup_cs obsolete;

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

432 have been removed;

434 * Simpler definition of function space in ZF;

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

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

439 types;

442 $Id$