wenzelm@2553: 
wenzelm@2553: Isabelle NEWS -- history of user-visible changes
wenzelm@2553: ================================================
wenzelm@2553: 
wenzelm@2554: 
wenzelm@2554: New in Isabelle94-8 (??????????? 1997 FIXME)
wenzelm@2554: ---------------------------------------
wenzelm@2553: 
wenzelm@2553: * the NEWS file;
wenzelm@2553: 
wenzelm@2553: * new utilities to build / run / maintain Isabelle etc. (in parts
wenzelm@2553: still somewhat experimental);
wenzelm@2553: 
wenzelm@2553: * simplifier: termless order as parameter; added interface for
wenzelm@2553: simplification procedures (functions that produce *proven* rewrite
wenzelm@2553: rules on the fly, depending on current redex);
wenzelm@2553: 
wenzelm@2553: * now supports alternative (named) syntax tables (parser and pretty
wenzelm@2553: printer); internal interface is provided by add_modesyntax(_i);
wenzelm@2553: 
wenzelm@2553: * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
wenzelm@2553: be used in conjunction with the isabelle symbol font; uses the
wenzelm@2553: "symbols" syntax table;
wenzelm@2553: 
wenzelm@2553: * infixes may now be declared with names independent of their syntax;
wenzelm@2553: 
wenzelm@2553: * added typed_print_translation (like print_translation, but also gets
wenzelm@2553: the type of the constant);
wenzelm@2553: 
wenzelm@2553: * prlim command for dealing with lots of subgoals (an easier way of
wenzelm@2553: setting goals_limit);
wenzelm@2553: 
wenzelm@2553: * HOL/ex/Ring.thy declares cring_simp, which solves equational
wenzelm@2553: problems in commutative rings, using axiomatic type classes for + and *;
wenzelm@2553: 
wenzelm@2553: * ZF now has Fast_tac, Simp_tac and Auto_tac.  WARNING: don't use
wenzelm@2553: ZF.thy anymore!  Contains fewer defs and could make a bogus simpset.
wenzelm@2553: Beware of Union_iff.  eq_cs is gone, can be put back as ZF_cs addSIs
wenzelm@2553: [equalityI];
wenzelm@2553: 
wenzelm@2553: * more examples in HOL/MiniML and HOL/Auth;
wenzelm@2553: 
wenzelm@2553: * more default rewrite rules in HOL for quantifiers, union/intersection;
wenzelm@2553: 
wenzelm@2553: 
wenzelm@2554: 
wenzelm@2553: New in Isabelle94-7 (November 96)
wenzelm@2553: ---------------------------------
wenzelm@2553: 
wenzelm@2553: * allowing negative levels (as offsets) in prlev and choplev;
wenzelm@2553: 
wenzelm@2554: * super-linear speedup for large simplifications;
wenzelm@2554: 
wenzelm@2554: * FOL, ZF and HOL now use miniscoping: rewriting pushes
wenzelm@2554: quantifications in as far as possible (COULD MAKE EXISTING PROOFS
wenzelm@2554: FAIL); can suppress it using the command Delsimps (ex_simps @
wenzelm@2554: all_simps); De Morgan laws are also now included, by default;
wenzelm@2554: 
wenzelm@2554: * improved printing of ==>  :  ~:
wenzelm@2554: 
wenzelm@2554: * new object-logic "Sequents" adds linear logic, while replacing LK
wenzelm@2554: and Modal (thanks to Sara Kalvala);
wenzelm@2554: 
wenzelm@2554: * HOL/Auth: correctness proofs for authentication protocols;
wenzelm@2554: 
wenzelm@2554: * HOL: new auto_tac combines rewriting and classical reasoning (many
wenzelm@2554: examples on HOL/Auth);
wenzelm@2554: 
wenzelm@2554: * HOL: new command AddIffs for declaring theorems of the form P=Q to
wenzelm@2554: the rewriter and classical reasoner simultaneously;
wenzelm@2554: 
wenzelm@2554: * function uresult no longer returns theorems in "standard" format;
wenzelm@2554: regain previous version by: val uresult = standard o uresult;
wenzelm@2554: 
wenzelm@2554: 
wenzelm@2554: 
wenzelm@2554: New in Isabelle94-6
wenzelm@2554: -------------------
wenzelm@2554: 
wenzelm@2554: * oracles -- these establish an interface between Isabelle and trusted
wenzelm@2554: external reasoners, which may deliver results as theorems;
wenzelm@2554: 
wenzelm@2554: * proof objects (in particular record all uses of oracles);
wenzelm@2554: 
wenzelm@2554: * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
wenzelm@2554: 
wenzelm@2554: * "constdefs" section in theory files;
wenzelm@2554: 
wenzelm@2554: * "primrec" section (HOL) no longer requires names;
wenzelm@2554: 
wenzelm@2554: * internal type "tactic" now simply "thm -> thm Sequence.seq";
wenzelm@2554: 
wenzelm@2554: 
wenzelm@2554: 
wenzelm@2554: New in Isabelle94-5
wenzelm@2554: -------------------
wenzelm@2554: 
wenzelm@2554: * reduced space requirements;
wenzelm@2554: 
wenzelm@2554: * automatic HTML generation from theories;
wenzelm@2554: 
wenzelm@2554: * theory files no longer require "..." (quotes) around most types;
wenzelm@2554: 
wenzelm@2554: * new examples, including two proofs of the Church-Rosser theorem;
wenzelm@2554: 
wenzelm@2554: * non-curried (1994) version of HOL is no longer distributed;
wenzelm@2554: 
wenzelm@2553: 
wenzelm@2553: $Id$