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