wenzelm@2553:
wenzelm@2553: Isabelle NEWS -- history of user-visible changes
wenzelm@2553: ================================================
wenzelm@2553:
wenzelm@3454: New in Isabelle???? (DATE ????)
wenzelm@3454: -------------------------------
wenzelm@3454:
mueller@3671: * added extended adm_tac to simplifier in HOLCF. Is now capable to discharge
mueller@3671: adm (%x. P (t x)), where P is chainfinite and t continuous.
mueller@3671:
wenzelm@3670: * replaced print_goals_ref hook by print_current_goals_fn and
wenzelm@3670: result_error_fn;
wenzelm@3670:
nipkow@3580: * HOL/simplifier: terms of the form
nipkow@3580: `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
nipkow@3580: are rewritten to
nipkow@3580: `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)'
nipkow@3580:
paulson@3658: * HOL/Lists: the function "set_of_list" has been renamed "set" (and its
wenzelm@3670: theorems too);
paulson@3570:
wenzelm@3454: * removed old README and Makefiles;
wenzelm@3454:
wenzelm@3511: * removed obsolete init_pps and init_database;
wenzelm@3511:
wenzelm@3579: * defs may now be conditional; improved rewrite_goals_tac to handle
wenzelm@3579: conditional equations;
wenzelm@3535:
wenzelm@3535: * improved output of warnings / errors;
wenzelm@3535:
wenzelm@3579: * deleted the obsolete tactical STATE, which was declared by:
wenzelm@3567: fun STATE tacfun st = tacfun st st;
wenzelm@3567:
wenzelm@3579: * added simplification meta rules:
wenzelm@3567: (asm_)(full_)simplify: simpset -> thm -> thm;
paulson@3561:
wenzelm@3579: * simplifier.ML no longer part of Pure -- has to be loaded by object
wenzelm@3579: logics (again);
wenzelm@3579:
wenzelm@3579: * added prems argument to simplification procedures;
wenzelm@3579:
wenzelm@3579:
wenzelm@3579:
wenzelm@3006: New in Isabelle94-8 (May 1997)
wenzelm@3006: ------------------------------
wenzelm@2654:
paulson@3002: *** General Changes ***
paulson@3002:
paulson@3002: * new utilities to build / run / maintain Isabelle etc. (in parts
paulson@3002: still somewhat experimental); old Makefiles etc. still functional;
wenzelm@2971:
wenzelm@3205: * new 'Isabelle System Manual';
wenzelm@3205:
wenzelm@2825: * INSTALL text, together with ./configure and ./build scripts;
wenzelm@2773:
wenzelm@3006: * reimplemented type inference for greater efficiency, better error
wenzelm@3006: messages and clean internal interface;
paulson@3002:
paulson@3002: * prlim command for dealing with lots of subgoals (an easier way of
paulson@3002: setting goals_limit);
paulson@3002:
wenzelm@3006:
wenzelm@3006: *** Syntax ***
paulson@3002:
wenzelm@3116: * supports alternative (named) syntax tables (parser and pretty
wenzelm@3116: printer); internal interface is provided by add_modesyntax(_i);
wenzelm@3116:
paulson@3002: * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
paulson@3002: be used in conjunction with the Isabelle symbol font; uses the
paulson@3002: "symbols" syntax table;
paulson@3002:
wenzelm@2705: * added token_translation interface (may translate name tokens in
wenzelm@2756: arbitrary ways, dependent on their type (free, bound, tfree, ...) and
wenzelm@3116: the current print_mode); IMPORTANT: user print translation functions
wenzelm@3116: are responsible for marking newly introduced bounds
wenzelm@3116: (Syntax.mark_boundT);
wenzelm@2705:
wenzelm@2730: * token translations for modes "xterm" and "xterm_color" that display
wenzelm@3006: names in bold, underline etc. or colors (which requires a color
wenzelm@3006: version of xterm);
wenzelm@2730:
paulson@3002: * infixes may now be declared with names independent of their syntax;
paulson@3002:
paulson@3002: * added typed_print_translation (like print_translation, but may
paulson@3002: access type of constant);
paulson@3002:
wenzelm@3006:
paulson@3002: *** Classical Reasoner ***
paulson@3002:
paulson@3002: Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
paulson@3002: some limitations. Blast_tac...
paulson@3002: + ignores addss, addbefore, addafter; this restriction is intrinsic
paulson@3002: + ignores elimination rules that don't have the correct format
paulson@3002: (the conclusion MUST be a formula variable)
paulson@3002: + ignores types, which can make HOL proofs fail
paulson@3002: + rules must not require higher-order unification, e.g. apply_type in ZF
paulson@3002: [message "Function Var's argument not a bound variable" relates to this]
paulson@3002: + its proof strategy is more general but can actually be slower
paulson@3002:
wenzelm@3107: * substitution with equality assumptions no longer permutes other
wenzelm@3107: assumptions;
paulson@3002:
paulson@3002: * minor changes in semantics of addafter (now called addaltern); renamed
paulson@3002: setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
wenzelm@3107: (and access functions for it);
paulson@3002:
oheimb@3317: * improved combination of classical reasoner and simplifier:
oheimb@3317: + functions for handling clasimpsets
oheimb@3317: + improvement of addss: now the simplifier is called _after_ the
oheimb@3317: safe steps.
oheimb@3317: + safe variant of addss called addSss: uses safe simplifications
oheimb@3317: _during_ the safe steps. It is more complete as it allows multiple
oheimb@3317: instantiations of unknowns (e.g. with slow_tac).
wenzelm@3006:
paulson@3002: *** Simplifier ***
paulson@3002:
wenzelm@3006: * added interface for simplification procedures (functions that
wenzelm@3006: produce *proven* rewrite rules on the fly, depending on current
wenzelm@3006: redex);
wenzelm@3006:
wenzelm@3006: * ordering on terms as parameter (used for ordered rewriting);
wenzelm@3006:
wenzelm@3107: * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
paulson@3002:
paulson@3002: * the solver is now split into a safe and an unsafe part.
paulson@3002: This should be invisible for the normal user, except that the
paulson@3002: functions setsolver and addsolver have been renamed to setSolver and
wenzelm@3107: addSolver; added safe_asm_full_simp_tac;
paulson@3002:
paulson@3002:
paulson@3002: *** HOL ***
paulson@3002:
nipkow@3042: * a generic induction tactic `induct_tac' which works for all datatypes and
wenzelm@3107: also for type `nat';
nipkow@3042:
nipkow@3316: * a generic case distinction tactic `exhaust_tac' which works for all
nipkow@3316: datatypes and also for type `nat';
nipkow@3316:
nipkow@3316: * each datatype comes with a function `size';
nipkow@3316:
paulson@3002: * patterns in case expressions allow tuple patterns as arguments to
wenzelm@3107: constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
paulson@3002:
paulson@3002: * primrec now also works with type nat;
paulson@3002:
paulson@3338: * recdef: a new declaration form, allows general recursive functions to be
paulson@3338: defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
paulson@3338:
paulson@3002: * the constant for negation has been renamed from "not" to "Not" to
wenzelm@3107: harmonize with FOL, ZF, LK, etc.;
paulson@3002:
wenzelm@3107: * HOL/ex/LFilter theory of a corecursive "filter" functional for
wenzelm@3107: infinite lists;
paulson@3002:
wenzelm@3227: * HOL/Modelcheck demonstrates invocation of model checker oracle;
wenzelm@3227:
paulson@3002: * HOL/ex/Ring.thy declares cring_simp, which solves equational
paulson@3002: problems in commutative rings, using axiomatic type classes for + and *;
paulson@3002:
paulson@3002: * more examples in HOL/MiniML and HOL/Auth;
paulson@3002:
paulson@3002: * more default rewrite rules for quantifiers, union/intersection;
paulson@3002:
nipkow@3321: * a new constant `arbitrary == @x.False';
nipkow@3321:
wenzelm@3107: * HOLCF/IOA replaces old HOL/IOA;
wenzelm@3107:
slotosch@2653: * HOLCF changes: derived all rules and arities
slotosch@2653: + axiomatic type classes instead of classes
slotosch@2653: + typedef instead of faking type definitions
paulson@2747: + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
wenzelm@2730: + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
slotosch@2653: + eliminated the types void, one, tr
slotosch@2653: + use unit lift and bool lift (with translations) instead of one and tr
slotosch@2653: + eliminated blift from Lift3.thy (use Def instead of blift)
wenzelm@3107: all eliminated rules are derived as theorems --> no visible changes ;
oheimb@2649:
wenzelm@3006:
paulson@3002: *** ZF ***
wenzelm@2553:
paulson@2865: * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
paulson@2865: rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
paulson@2865: as ZF_cs addSIs [equalityI];
wenzelm@2553:
wenzelm@2554:
wenzelm@2732:
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:
paulson@2557:
paulson@2557: New in Isabelle94-4
paulson@2557: -------------------
paulson@2557:
paulson@2747: * greatly reduced space requirements;
paulson@2557:
paulson@2557: * theory files (.thy) no longer require \...\ escapes at line breaks;
paulson@2557:
paulson@2557: * searchable theorem database (see the section "Retrieving theorems" on
paulson@2557: page 8 of the Reference Manual);
paulson@2557:
paulson@2557: * new examples, including Grabczewski's monumental case study of the
paulson@2557: Axiom of Choice;
paulson@2557:
paulson@2557: * The previous version of HOL renamed to Old_HOL;
paulson@2557:
paulson@2557: * The new version of HOL (previously called CHOL) uses a curried syntax
paulson@2557: for functions. Application looks like f a b instead of f(a,b);
paulson@2557:
paulson@2557: * Mutually recursive inductive definitions finally work in HOL;
paulson@2557:
paulson@2557: * In ZF, pattern-matching on tuples is now available in all abstractions and
paulson@2557: translates to the operator "split";
paulson@2557:
paulson@2557:
paulson@2557:
paulson@2557: New in Isabelle94-3
paulson@2557: -------------------
paulson@2557:
paulson@2557: * new infix operator, addss, allowing the classical reasoner to
paulson@2557: perform simplification at each step of its search. Example:
paulson@2557: fast_tac (cs addss ss)
paulson@2557:
paulson@2557: * a new logic, CHOL, the same as HOL, but with a curried syntax
paulson@2557: for functions. Application looks like f a b instead of f(a,b). Also pairs
paulson@2557: look like (a,b) instead of ;
paulson@2557:
paulson@2557: * PLEASE NOTE: CHOL will eventually replace HOL!
paulson@2557:
paulson@2557: * In CHOL, pattern-matching on tuples is now available in all abstractions.
paulson@2557: It translates to the operator "split". A new theory of integers is available;
paulson@2557:
paulson@2557: * In ZF, integer numerals now denote two's-complement binary integers.
paulson@2557: Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
paulson@2557:
paulson@2557: * Many new examples: I/O automata, Church-Rosser theorem, equivalents
paulson@2557: of the Axiom of Choice;
paulson@2557:
paulson@2557:
paulson@2557:
paulson@2557: New in Isabelle94-2
paulson@2557: -------------------
paulson@2557:
paulson@2557: * Significantly faster resolution;
paulson@2557:
paulson@2557: * the different sections in a .thy file can now be mixed and repeated
paulson@2557: freely;
paulson@2557:
paulson@2557: * Database of theorems for FOL, HOL and ZF. New
paulson@2557: commands including qed, qed_goal and bind_thm store theorems in the database.
paulson@2557:
paulson@2557: * Simple database queries: return a named theorem (get_thm) or all theorems of
paulson@2557: a given theory (thms_of), or find out what theory a theorem was proved in
paulson@2557: (theory_of_thm);
paulson@2557:
paulson@2557: * Bugs fixed in the inductive definition and datatype packages;
paulson@2557:
paulson@2557: * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
paulson@2557: and HOL_dup_cs obsolete;
paulson@2557:
paulson@2557: * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
paulson@2557: have been removed;
paulson@2557:
paulson@2557: * Simpler definition of function space in ZF;
paulson@2557:
paulson@2557: * new results about cardinal and ordinal arithmetic in ZF;
paulson@2557:
paulson@2557: * 'subtype' facility in HOL for introducing new types as subsets of existing
paulson@2557: types;
paulson@2557:
paulson@2557:
wenzelm@2553: $Id$