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;
     1 
     2 Isabelle NEWS -- history of user-visible changes
     3 ================================================
     4 
     5 New in Isabelle???? (DATE ????)
     6 -------------------------------
     7 
     8 *** General Changes ***
     9 
    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;
    21 
    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;
    27 
    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);
    31 
    32 * defs may now be conditional; improved rewrite_goals_tac to handle
    33 conditional equations;
    34 
    35 * defs now admits additional type arguments, using TYPE('a) syntax;
    36 
    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;
    41 
    42 * improved handling of draft signatures / theories; draft thms (and
    43 ctyps, cterms) are automatically promoted to real ones;
    44 
    45 * slightly changed interfaces for oracles: admit many per theory, named
    46 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
    47 
    48 * print_goals: optional output of const types (set show_consts and
    49 show_types);
    50 
    51 * improved output of warnings (###) / errors (***);
    52 
    53 * removed old README and Makefiles;
    54 
    55 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
    56 
    57 * removed obsolete init_pps and init_database;
    58 
    59 * deleted the obsolete tactical STATE, which was declared by
    60     fun STATE tacfun st = tacfun st st;
    61 
    62 
    63 *** Classical Reasoner ***
    64 
    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;
    68 
    69 * Safe_tac: like safe_tac but uses the default claset;
    70 
    71 
    72 *** Simplifier ***
    73 
    74 * added simplification meta rules:
    75     (asm_)(full_)simplify: simpset -> thm -> thm;
    76 
    77 * simplifier.ML no longer part of Pure -- has to be loaded by object
    78 logics (again);
    79 
    80 * added prems argument to simplification procedures;
    81 
    82 
    83 *** Syntax ***
    84 
    85 * TYPE('a) syntax for type reflection terms;
    86 
    87 * no longer handles consts with name "" -- declare as 'syntax' instead;
    88 
    89 * pretty printer: changed order of mixfix annotation preference (again!);
    90 
    91 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
    92 
    93 
    94 *** HOL ***
    95 
    96 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
    97 
    98 * HOL/Auth: new protocol proofs including some for the Internet
    99   protocol TLS;
   100 
   101 * HOL/Map: new theory of `maps' a la VDM;
   102 
   103 * HOL/simplifier: added infix function `addsplits':
   104   instead of `<simpset> setloop (split_tac <thms>)'
   105   you can simply write `<simpset> addsplits <thms>'
   106 
   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)',
   115 
   116 * HOL/datatype
   117   Each datatype `t' now comes with a theorem `split_t_case' of the form
   118 
   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      )
   124 
   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.
   128 
   129 * HOL/Lists: the function "set_of_list" has been renamed "set"
   130   (and its theorems too);
   131 
   132 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
   133 
   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);
   136 
   137 
   138 *** HOLCF ***
   139 
   140 * removed "axioms" and "generated by" sections;
   141 
   142 * replaced "ops" section by extended "consts" section, which is capable of
   143   handling the continuous function space "->" directly;
   144 
   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;
   154 
   155 * fixed LAM <x,y,zs>.b syntax;
   156 
   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;
   159 
   160 
   161 *** FOL and ZF ***
   162 
   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;
   165 
   166 
   167 
   168 New in Isabelle94-8 (May 1997)
   169 ------------------------------
   170 
   171 *** General Changes ***
   172 
   173 * new utilities to build / run / maintain Isabelle etc. (in parts
   174 still somewhat experimental); old Makefiles etc. still functional;
   175 
   176 * new 'Isabelle System Manual';
   177 
   178 * INSTALL text, together with ./configure and ./build scripts;
   179 
   180 * reimplemented type inference for greater efficiency, better error
   181 messages and clean internal interface;
   182 
   183 * prlim command for dealing with lots of subgoals (an easier way of
   184 setting goals_limit);
   185 
   186 
   187 *** Syntax ***
   188 
   189 * supports alternative (named) syntax tables (parser and pretty
   190 printer); internal interface is provided by add_modesyntax(_i);
   191 
   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;
   195 
   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);
   201 
   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);
   205 
   206 * infixes may now be declared with names independent of their syntax;
   207 
   208 * added typed_print_translation (like print_translation, but may
   209 access type of constant);
   210 
   211 
   212 *** Classical Reasoner ***
   213 
   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
   223 
   224 * substitution with equality assumptions no longer permutes other
   225 assumptions;
   226 
   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);
   230 
   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).
   238 
   239 *** Simplifier ***
   240 
   241 * added interface for simplification procedures (functions that
   242 produce *proven* rewrite rules on the fly, depending on current
   243 redex);
   244 
   245 * ordering on terms as parameter (used for ordered rewriting);
   246 
   247 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
   248 
   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;
   253 
   254 
   255 *** HOL ***
   256 
   257 * a generic induction tactic `induct_tac' which works for all datatypes and
   258 also for type `nat';
   259 
   260 * a generic case distinction tactic `exhaust_tac' which works for all
   261 datatypes and also for type `nat';
   262 
   263 * each datatype comes with a function `size';
   264 
   265 * patterns in case expressions allow tuple patterns as arguments to
   266 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
   267 
   268 * primrec now also works with type nat;
   269 
   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.
   272 
   273 * the constant for negation has been renamed from "not" to "Not" to
   274 harmonize with FOL, ZF, LK, etc.;
   275 
   276 * HOL/ex/LFilter theory of a corecursive "filter" functional for
   277 infinite lists;
   278 
   279 * HOL/Modelcheck demonstrates invocation of model checker oracle;
   280 
   281 * HOL/ex/Ring.thy declares cring_simp, which solves equational
   282 problems in commutative rings, using axiomatic type classes for + and *;
   283 
   284 * more examples in HOL/MiniML and HOL/Auth;
   285 
   286 * more default rewrite rules for quantifiers, union/intersection;
   287 
   288 * a new constant `arbitrary == @x.False';
   289 
   290 * HOLCF/IOA replaces old HOL/IOA;
   291 
   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 ;
   301 
   302 
   303 *** ZF ***
   304 
   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];
   308 
   309 
   310 
   311 New in Isabelle94-7 (November 96)
   312 ---------------------------------
   313 
   314 * allowing negative levels (as offsets) in prlev and choplev;
   315 
   316 * super-linear speedup for large simplifications;
   317 
   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;
   322 
   323 * improved printing of ==>  :  ~:
   324 
   325 * new object-logic "Sequents" adds linear logic, while replacing LK
   326 and Modal (thanks to Sara Kalvala);
   327 
   328 * HOL/Auth: correctness proofs for authentication protocols;
   329 
   330 * HOL: new auto_tac combines rewriting and classical reasoning (many
   331 examples on HOL/Auth);
   332 
   333 * HOL: new command AddIffs for declaring theorems of the form P=Q to
   334 the rewriter and classical reasoner simultaneously;
   335 
   336 * function uresult no longer returns theorems in "standard" format;
   337 regain previous version by: val uresult = standard o uresult;
   338 
   339 
   340 
   341 New in Isabelle94-6
   342 -------------------
   343 
   344 * oracles -- these establish an interface between Isabelle and trusted
   345 external reasoners, which may deliver results as theorems;
   346 
   347 * proof objects (in particular record all uses of oracles);
   348 
   349 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
   350 
   351 * "constdefs" section in theory files;
   352 
   353 * "primrec" section (HOL) no longer requires names;
   354 
   355 * internal type "tactic" now simply "thm -> thm Sequence.seq";
   356 
   357 
   358 
   359 New in Isabelle94-5
   360 -------------------
   361 
   362 * reduced space requirements;
   363 
   364 * automatic HTML generation from theories;
   365 
   366 * theory files no longer require "..." (quotes) around most types;
   367 
   368 * new examples, including two proofs of the Church-Rosser theorem;
   369 
   370 * non-curried (1994) version of HOL is no longer distributed;
   371 
   372 
   373 
   374 New in Isabelle94-4
   375 -------------------
   376 
   377 * greatly reduced space requirements;
   378 
   379 * theory files (.thy) no longer require \...\ escapes at line breaks;
   380 
   381 * searchable theorem database (see the section "Retrieving theorems" on 
   382 page 8 of the Reference Manual);
   383 
   384 * new examples, including Grabczewski's monumental case study of the
   385 Axiom of Choice;
   386 
   387 * The previous version of HOL renamed to Old_HOL;
   388 
   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);
   391 
   392 * Mutually recursive inductive definitions finally work in HOL;
   393 
   394 * In ZF, pattern-matching on tuples is now available in all abstractions and
   395 translates to the operator "split";
   396 
   397 
   398 
   399 New in Isabelle94-3
   400 -------------------
   401 
   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)
   405 
   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>;
   409 
   410 * PLEASE NOTE: CHOL will eventually replace HOL!
   411 
   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;
   414 
   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;
   417 
   418 * Many new examples: I/O automata, Church-Rosser theorem, equivalents 
   419 of the Axiom of Choice;
   420 
   421 
   422 
   423 New in Isabelle94-2
   424 -------------------
   425 
   426 * Significantly faster resolution;  
   427 
   428 * the different sections in a .thy file can now be mixed and repeated
   429 freely;
   430 
   431 * Database of theorems for FOL, HOL and ZF.  New
   432 commands including qed, qed_goal and bind_thm store theorems in the database.
   433 
   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);
   437 
   438 * Bugs fixed in the inductive definition and datatype packages;
   439 
   440 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
   441 and HOL_dup_cs obsolete;
   442 
   443 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
   444 have been removed;
   445 
   446 * Simpler definition of function space in ZF;
   447 
   448 * new results about cardinal and ordinal arithmetic in ZF;
   449 
   450 * 'subtype' facility in HOL for introducing new types as subsets of existing
   451 types;
   452 
   453 
   454 $Id$