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@2556: * HOL: primrec now also works with type nat; wenzelm@2553: wenzelm@2553: * new utilities to build / run / maintain Isabelle etc. (in parts wenzelm@2555: still somewhat experimental); old Makefiles etc. still functional; 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@2555: * added typed_print_translation (like print_translation, but may wenzelm@2555: access type of 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@2556: * the NEWS file; 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: paulson@2557: paulson@2557: New in Isabelle94-4 paulson@2557: ------------------- paulson@2557: paulson@2557: * greatly 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$