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