NEWS
author nipkow
Thu Oct 30 09:54:47 1997 +0100 (1997-10-30)
changeset 4035 6ffbc7b11abd
parent 3985 173fcf95412f
child 4070 3a6e1e562aed
permissions -rw-r--r--
*** empty log message ***
     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,
    11 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
    12 old input syntactically incorrect (e.g. "%x.x"); isatool fixdots
    13 ensures space after dots (e.g. "%x. x"); set long_names for fully
    14 qualified output names; NOTE: in case of severe problems with backward
    15 campatibility try setting 'global_names' at compile time to disable
    16 qualified names for theories; may also fine tune theories via 'global'
    17 and 'local' section;
    18 
    19 * HTML output now includes theory graph data for display with Java
    20 applet or isatool browser; data generated automatically via isatool
    21 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
    22 
    23 * defs may now be conditional; improved rewrite_goals_tac to handle
    24 conditional equations;
    25 
    26 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
    27 creates a new theory node; implicit merge of thms' signatures is
    28 restricted to 'trivial' ones, thus one may have to use
    29 transfer:theory->thm->thm in (rare) cases;
    30 
    31 * improved handling of draft signatures / theories; draft thms (and
    32 ctyps, cterms) are automatically promoted to real ones;
    33 
    34 * slightly changed interfaces for oracles: admit many per theory, named
    35 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
    36 
    37 * print_goals: optional output of const types (set show_consts and
    38 show_types);
    39 
    40 * improved output of warnings (###) / errors (***);
    41 
    42 * removed old README and Makefiles;
    43 
    44 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
    45 
    46 * removed obsolete init_pps and init_database;
    47 
    48 * deleted the obsolete tactical STATE, which was declared by
    49     fun STATE tacfun st = tacfun st st;
    50 
    51 
    52 *** Classical Reasoner ***
    53 
    54 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
    55 tactics that use classical reasoning to simplify a subgoal without
    56 splitting it into several subgoals;
    57 
    58 * Safe_tac: like safe_tac but uses the default claset;
    59 
    60 
    61 *** Simplifier ***
    62 
    63 * added simplification meta rules:
    64     (asm_)(full_)simplify: simpset -> thm -> thm;
    65 
    66 * simplifier.ML no longer part of Pure -- has to be loaded by object
    67 logics (again);
    68 
    69 * added prems argument to simplification procedures;
    70 
    71 
    72 *** Syntax ***
    73 
    74 * no longer handles consts with name "" -- declare as 'syntax' instead;
    75 
    76 * pretty printer: changed order of mixfix annotation preference (again!);
    77 
    78 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
    79 
    80 
    81 *** HOL ***
    82 
    83 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
    84 
    85 * HOL/Auth: new protocol proofs including some for the Internet
    86   protocol TLS;
    87 
    88 * HOL/Map: new theory of `maps' a la VDM.
    89 
    90 * HOL/simplifier: added infix function `addsplits':
    91   instead of `<simpset> setloop (split_tac <thms>)'
    92   you can simply write `<simpset> addsplits <thms>'
    93 
    94 * HOL/simplifier: terms of the form
    95   `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
    96   are rewritten to
    97   `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
    98   and those of the form
    99   `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
   100   are rewritten to
   101   `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
   102 
   103 * HOL/datatype
   104   Each datatype `t' now comes with a theorem `split_t_case' of the form
   105 
   106   P(t_case f1 ... fn x) =
   107      ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
   108         ...
   109         (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
   110      )
   111 
   112   which can be added to a simpset via `addsplits'.
   113 
   114 * HOL/Lists: the function "set_of_list" has been renamed "set"
   115   (and its theorems too);
   116 
   117 
   118 *** HOLCF ***
   119 
   120 * HOLCF: fixed LAM <x,y,zs>.b syntax;
   121 
   122 * added extended adm_tac to simplifier in HOLCF -- can now discharge
   123 adm (%x. P (t x)), where P is chainfinite and t continuous;
   124 
   125 
   126 *** FOL and ZF ***
   127 
   128 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
   129 in HOL, they strip ALL and --> from proved theorems;
   130 
   131 
   132 
   133 New in Isabelle94-8 (May 1997)
   134 ------------------------------
   135 
   136 *** General Changes ***
   137 
   138 * new utilities to build / run / maintain Isabelle etc. (in parts
   139 still somewhat experimental); old Makefiles etc. still functional;
   140 
   141 * new 'Isabelle System Manual';
   142 
   143 * INSTALL text, together with ./configure and ./build scripts;
   144 
   145 * reimplemented type inference for greater efficiency, better error
   146 messages and clean internal interface;
   147 
   148 * prlim command for dealing with lots of subgoals (an easier way of
   149 setting goals_limit);
   150 
   151 
   152 *** Syntax ***
   153 
   154 * supports alternative (named) syntax tables (parser and pretty
   155 printer); internal interface is provided by add_modesyntax(_i);
   156 
   157 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
   158 be used in conjunction with the Isabelle symbol font; uses the
   159 "symbols" syntax table;
   160 
   161 * added token_translation interface (may translate name tokens in
   162 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
   163 the current print_mode); IMPORTANT: user print translation functions
   164 are responsible for marking newly introduced bounds
   165 (Syntax.mark_boundT);
   166 
   167 * token translations for modes "xterm" and "xterm_color" that display
   168 names in bold, underline etc. or colors (which requires a color
   169 version of xterm);
   170 
   171 * infixes may now be declared with names independent of their syntax;
   172 
   173 * added typed_print_translation (like print_translation, but may
   174 access type of constant);
   175 
   176 
   177 *** Classical Reasoner ***
   178 
   179 Blast_tac: a new tactic!  It is often more powerful than fast_tac, but has
   180 some limitations.  Blast_tac...
   181   + ignores addss, addbefore, addafter; this restriction is intrinsic
   182   + ignores elimination rules that don't have the correct format
   183 	(the conclusion MUST be a formula variable)
   184   + ignores types, which can make HOL proofs fail
   185   + rules must not require higher-order unification, e.g. apply_type in ZF
   186     [message "Function Var's argument not a bound variable" relates to this]
   187   + its proof strategy is more general but can actually be slower
   188 
   189 * substitution with equality assumptions no longer permutes other
   190 assumptions;
   191 
   192 * minor changes in semantics of addafter (now called addaltern); renamed
   193 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
   194 (and access functions for it);
   195 
   196 * improved combination of classical reasoner and simplifier: 
   197   + functions for handling clasimpsets
   198   + improvement of addss: now the simplifier is called _after_ the
   199     safe steps.
   200   + safe variant of addss called addSss: uses safe simplifications
   201     _during_ the safe steps. It is more complete as it allows multiple 
   202     instantiations of unknowns (e.g. with slow_tac).
   203 
   204 *** Simplifier ***
   205 
   206 * added interface for simplification procedures (functions that
   207 produce *proven* rewrite rules on the fly, depending on current
   208 redex);
   209 
   210 * ordering on terms as parameter (used for ordered rewriting);
   211 
   212 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
   213 
   214 * the solver is now split into a safe and an unsafe part.
   215 This should be invisible for the normal user, except that the
   216 functions setsolver and addsolver have been renamed to setSolver and
   217 addSolver; added safe_asm_full_simp_tac;
   218 
   219 
   220 *** HOL ***
   221 
   222 * a generic induction tactic `induct_tac' which works for all datatypes and
   223 also for type `nat';
   224 
   225 * a generic case distinction tactic `exhaust_tac' which works for all
   226 datatypes and also for type `nat';
   227 
   228 * each datatype comes with a function `size';
   229 
   230 * patterns in case expressions allow tuple patterns as arguments to
   231 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
   232 
   233 * primrec now also works with type nat;
   234 
   235 * recdef: a new declaration form, allows general recursive functions to be
   236 defined in theory files.  See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
   237 
   238 * the constant for negation has been renamed from "not" to "Not" to
   239 harmonize with FOL, ZF, LK, etc.;
   240 
   241 * HOL/ex/LFilter theory of a corecursive "filter" functional for
   242 infinite lists;
   243 
   244 * HOL/Modelcheck demonstrates invocation of model checker oracle;
   245 
   246 * HOL/ex/Ring.thy declares cring_simp, which solves equational
   247 problems in commutative rings, using axiomatic type classes for + and *;
   248 
   249 * more examples in HOL/MiniML and HOL/Auth;
   250 
   251 * more default rewrite rules for quantifiers, union/intersection;
   252 
   253 * a new constant `arbitrary == @x.False';
   254 
   255 * HOLCF/IOA replaces old HOL/IOA;
   256 
   257 * HOLCF changes: derived all rules and arities 
   258   + axiomatic type classes instead of classes 
   259   + typedef instead of faking type definitions
   260   + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
   261   + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
   262   + eliminated the types void, one, tr
   263   + use unit lift and bool lift (with translations) instead of one and tr
   264   + eliminated blift from Lift3.thy (use Def instead of blift)
   265   all eliminated rules are derived as theorems --> no visible changes ;
   266 
   267 
   268 *** ZF ***
   269 
   270 * ZF now has Fast_tac, Simp_tac and Auto_tac.  Union_iff is a now a default
   271 rewrite rule; this may affect some proofs.  eq_cs is gone but can be put back
   272 as ZF_cs addSIs [equalityI];
   273 
   274 
   275 
   276 New in Isabelle94-7 (November 96)
   277 ---------------------------------
   278 
   279 * allowing negative levels (as offsets) in prlev and choplev;
   280 
   281 * super-linear speedup for large simplifications;
   282 
   283 * FOL, ZF and HOL now use miniscoping: rewriting pushes
   284 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
   285 FAIL); can suppress it using the command Delsimps (ex_simps @
   286 all_simps); De Morgan laws are also now included, by default;
   287 
   288 * improved printing of ==>  :  ~:
   289 
   290 * new object-logic "Sequents" adds linear logic, while replacing LK
   291 and Modal (thanks to Sara Kalvala);
   292 
   293 * HOL/Auth: correctness proofs for authentication protocols;
   294 
   295 * HOL: new auto_tac combines rewriting and classical reasoning (many
   296 examples on HOL/Auth);
   297 
   298 * HOL: new command AddIffs for declaring theorems of the form P=Q to
   299 the rewriter and classical reasoner simultaneously;
   300 
   301 * function uresult no longer returns theorems in "standard" format;
   302 regain previous version by: val uresult = standard o uresult;
   303 
   304 
   305 
   306 New in Isabelle94-6
   307 -------------------
   308 
   309 * oracles -- these establish an interface between Isabelle and trusted
   310 external reasoners, which may deliver results as theorems;
   311 
   312 * proof objects (in particular record all uses of oracles);
   313 
   314 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
   315 
   316 * "constdefs" section in theory files;
   317 
   318 * "primrec" section (HOL) no longer requires names;
   319 
   320 * internal type "tactic" now simply "thm -> thm Sequence.seq";
   321 
   322 
   323 
   324 New in Isabelle94-5
   325 -------------------
   326 
   327 * reduced space requirements;
   328 
   329 * automatic HTML generation from theories;
   330 
   331 * theory files no longer require "..." (quotes) around most types;
   332 
   333 * new examples, including two proofs of the Church-Rosser theorem;
   334 
   335 * non-curried (1994) version of HOL is no longer distributed;
   336 
   337 
   338 
   339 New in Isabelle94-4
   340 -------------------
   341 
   342 * greatly reduced space requirements;
   343 
   344 * theory files (.thy) no longer require \...\ escapes at line breaks;
   345 
   346 * searchable theorem database (see the section "Retrieving theorems" on 
   347 page 8 of the Reference Manual);
   348 
   349 * new examples, including Grabczewski's monumental case study of the
   350 Axiom of Choice;
   351 
   352 * The previous version of HOL renamed to Old_HOL;
   353 
   354 * The new version of HOL (previously called CHOL) uses a curried syntax 
   355 for functions.  Application looks like f a b instead of f(a,b);
   356 
   357 * Mutually recursive inductive definitions finally work in HOL;
   358 
   359 * In ZF, pattern-matching on tuples is now available in all abstractions and
   360 translates to the operator "split";
   361 
   362 
   363 
   364 New in Isabelle94-3
   365 -------------------
   366 
   367 * new infix operator, addss, allowing the classical reasoner to 
   368 perform simplification at each step of its search.  Example:
   369 	fast_tac (cs addss ss)
   370 
   371 * a new logic, CHOL, the same as HOL, but with a curried syntax 
   372 for functions.  Application looks like f a b instead of f(a,b).  Also pairs 
   373 look like (a,b) instead of <a,b>;
   374 
   375 * PLEASE NOTE: CHOL will eventually replace HOL!
   376 
   377 * In CHOL, pattern-matching on tuples is now available in all abstractions.
   378 It translates to the operator "split".  A new theory of integers is available;
   379 
   380 * In ZF, integer numerals now denote two's-complement binary integers.
   381 Arithmetic operations can be performed by rewriting.  See ZF/ex/Bin.ML;
   382 
   383 * Many new examples: I/O automata, Church-Rosser theorem, equivalents 
   384 of the Axiom of Choice;
   385 
   386 
   387 
   388 New in Isabelle94-2
   389 -------------------
   390 
   391 * Significantly faster resolution;  
   392 
   393 * the different sections in a .thy file can now be mixed and repeated
   394 freely;
   395 
   396 * Database of theorems for FOL, HOL and ZF.  New
   397 commands including qed, qed_goal and bind_thm store theorems in the database.
   398 
   399 * Simple database queries: return a named theorem (get_thm) or all theorems of
   400 a given theory (thms_of), or find out what theory a theorem was proved in
   401 (theory_of_thm);
   402 
   403 * Bugs fixed in the inductive definition and datatype packages;
   404 
   405 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
   406 and HOL_dup_cs obsolete;
   407 
   408 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
   409 have been removed;
   410 
   411 * Simpler definition of function space in ZF;
   412 
   413 * new results about cardinal and ordinal arithmetic in ZF;
   414 
   415 * 'subtype' facility in HOL for introducing new types as subsets of existing
   416 types;
   417 
   418 
   419 $Id$