2 Isabelle NEWS -- history user-relevant changes
3 ==============================================
5 New in this Isabelle version
6 ----------------------------
8 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10 * HOL: simplification of natural numbers is much changed; to partly
11 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
12 issue the following ML commands:
14 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
15 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
17 * HOL: 0 is now overloaded, so the type constraint ::nat may sometimes be
20 * HOL: the constant for f``x is now "image" rather than "op ``";
22 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
23 product is now "<*>" instead of "Times"; the lexicographic product is
24 now "<*lex*>" instead of "**";
26 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
28 * HOL: simplification no longer dives into case-expressions;
30 * HOL: the recursion equations generated by 'recdef' are now called
31 f.simps instead of f.rules;
33 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
34 main HOL, but was unused); should better use HOL's datatype package
37 * HOL: removed obsolete theorem binding expand_if (refer to split_if
40 * HOL/Real: "rabs" replaced by overloaded "abs" function;
42 * HOL/ML: even fewer consts are declared as global (see theories Ord,
43 Lfp, Gfp, WF); this only affects ML packages that refer to const names
46 * HOL, ZF: syntax for quotienting wrt an equivalence relation changed from
49 * ZF: new treatment of arithmetic (nat & int) may break some old proofs;
51 * Isar/Provers: intro/elim/dest attributes: changed
52 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
53 should have to change intro!! to intro? only);
55 * Isar: changed syntax of local blocks from {{ }} to { };
57 * Isar: renamed 'RS' attribute to 'THEN';
59 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
61 * Provers: strengthened force_tac by using new first_best_tac;
63 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
64 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
65 use instead the strong form,
66 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
67 In HOL, FOL and ZF the function cla_make_elim will create such rules
70 * Provers: safe_asm_full_simp_tac is no longer in the simplifier signature. Use
71 val safe_asm_full_simp_tac = generic_simp_tac true (true,true,true);
74 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
75 timing flag supersedes proof_timing and Toplevel.trace;
77 * ML: PureThy.add_thms/add_axioms/add_defs return theorems as well;
79 * ML: PureThy.add_defs gets additional argument to indicate potential
80 overloading (usually false);
82 * LaTeX: several changes of isabelle.sty;
85 *** Document preparation ***
87 * formal comments (text blocks etc.) in new-style theories may now
88 contain antiquotations of thm/prop/term/typ to be presented according
89 to latex print mode; concrete syntax is like this: @{term[show_types]
92 * isatool mkdir provides easy setup of Isabelle session directories,
93 including proper document sources;
95 * generated LaTeX sources are now deleted after successful run
96 (isatool document -c); may retain a copy somewhere else via -D option
99 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
100 style files, achieving self-contained LaTeX sources;
102 * old-style theories now produce (crude) LaTeX output as well;
104 * browser info session directories are now self-contained (may be put
105 on WWW server seperately); improved graphs of nested sessions; removed
106 graph for 'all sessions';
108 * several improvements in isabelle.sty; \isabellestyle{it} produces
109 near math mode output; \isamarkupheader is now \section by default;
114 * Pure: local results and corresponding term bindings are now subject
115 to Hindley-Milner polymorphism (similar to ML); this accommodates
116 incremental type-inference nicely;
118 * Pure: new derived language element 'obtain' supports generalized
121 * Pure: new calculational elements 'moreover' and 'ultimately' support
122 accumulation of results, without applying any rules yet;
124 * Pure: scalable support for case-analysis type proofs: new 'case'
125 language element refers to local contexts symbolically, as produced by
126 certain proof methods; internally, case names are attached to theorems
129 * Pure: theory command 'hide' removes declarations from
130 class/type/const name spaces;
132 * Pure: theory command 'defs' supports option "(overloaded)" to
133 indicate potential overloading;
135 * Pure: changed syntax of local blocks from {{ }} to { };
137 * Pure: renamed 'RS' attribute to 'THEN';
139 * Pure: syntax of sorts made 'inner', i.e. have to write "{a, b, c}"
140 instead of {a, b, c};
142 * Pure now provides its own version of intro/elim/dest attributes;
143 useful for building new logics, but beware of confusion with the
144 version in Provers/classical;
146 * Pure: the local context of (non-atomic) goals is provided via case
149 * Pure: removed obsolete 'transfer' attribute (transfer of thms to the
150 current context is now done automatically);
152 * Pure: theory command 'method_setup' provides a simple interface for
153 definining proof methods in ML;
155 * Provers: 'simp' method now supports 'cong' modifiers;
157 * Provers: hypsubst support; also plain subst and symmetric attribute
158 (the latter supercedes [RS sym]);
160 * Provers: splitter support (via 'split' attribute and 'simp' method
161 modifier); 'simp' method: 'only:' modifier removes loopers as well
164 * Provers: added 'fastsimp' and 'clarsimp' methods (combination of
165 Simplifier and Classical reasoner);
167 * Provers: added 'arith_split' attribute;
169 * HOL: new proof method 'cases' and improved version of 'induct' now
170 support named cases; major packages (inductive, datatype, primrec,
171 recdef) support case names and properly name parameters;
173 * HOL: removed 'case_split' thm binding, should use 'cases' proof
176 * HOL: removed obsolete expand_if = split_if; theorems if_splits =
177 split_if split_if_asm; datatype package provides theorems foo.splits =
178 foo.split foo.split_asm for each datatype;
180 * HOL/Calculation: new rules for substitution in inequalities
181 (monotonicity conditions are extracted to be proven at end);
183 * HOL/inductive: rename "intrs" to "intros" (potential
184 INCOMPATIBILITY); emulation of mk_cases feature for proof scripts:
185 'inductive_cases' command and 'ind_cases' method; NOTE: use (cases
186 (simplified)) method in proper proofs;
188 * Provers: intro/elim/dest attributes: changed intro/intro!/intro!!
189 flags to intro!/intro/intro? (in most cases, one should have to change
190 intro!! to intro? only);
192 * names of theorems etc. may be natural numbers as well;
194 * 'pr' command: optional goals_limit argument; no longer prints theory
195 contexts, but only proof states;
197 * diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
198 additional print modes to be specified; e.g. "pr(latex)" will print
199 proof state according to the Isabelle LaTeX style;
201 * improved support for emulating tactic scripts, including proof
202 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
203 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
206 * simplified (more robust) goal selection of proof methods: 1st goal,
207 all goals, or explicit goal specifier (tactic emulation); thus 'proof
208 method scripts' have to be in depth-first order;
210 * tuned 'let' syntax: replaced 'as' keyword by 'and';
212 * removed 'help' command, which hasn't been too helpful anyway; should
213 instead use individual commands for printing items (print_commands,
216 * added 'nothing' --- the empty list of theorems;
221 * HOL/Algebra: new theory of rings and univariate polynomials, by
224 * HOL/ex: new theory Factorization proving the Fundamental Theorem of
225 Arithmetic, by Thomas M Rasmussen;
227 * HOL/ex/Multiquote: multiple nested quotations and anti-quotations --
228 basically a generalized version of de-Bruijn representation; very
229 useful in avoiding lifting of operations;
231 * HOL/NumberTheory: Chinese Remainder Theorem, Fermat/Euler Theorem, Wilson's
232 Theorem, by Thomas M Rasmussen;
234 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog;
236 * HOL/Real: "rabs" replaced by overloaded "abs" function;
238 * HOL/record: added general record equality rule to simpset; fixed
239 select-update simplification procedure to handle extended records as
240 well; admit "r" as field name;
242 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
243 other numeric types and also as the identity of groups, rings, etc.;
245 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
246 Types nat and int belong to this axclass;
248 * greatly improved simplification involving numerals of type nat, int, real:
249 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
250 i*j + k + j*#3*i simplifies to #4*(i*j) + k
251 two terms #m*u and #n*u are replaced by #(m+n)*u
252 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
253 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
254 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
256 * HOL: new version of "case_tac" subsumes both boolean case split and
257 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
258 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
260 * HOL: simplification no longer dives into case-expressions: only the
261 selector expression is simplified, but not the remaining arms. To
262 enable full simplification of case-expressions for datatype t, you
263 need to remove t.weak_case_cong from the simpset, either permanently
264 (Delcongs[thm"t.weak_case_cong"];) or locally (delcongs [...]).
266 * HOL/recdef: the recursion equations generated by 'recdef' for
267 function 'f' are now called f.simps instead of f.rules; if all
268 termination conditions are proved automatically, these simplification
269 rules are added to the simpset, as in primrec; rules may be named
270 individually as well, resulting in a separate list of theorems for
273 * HOL/While is a new theory that provides a while-combinator. It
274 permits the definition of tail-recursive functions without the
275 provision of a termination measure. The latter is necessary once the
276 invariant proof rule for while is applied.
278 * HOL: new (overloaded) notation for the set of elements below/above some
279 element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
281 * HOL: theorems impI, allI, ballI bound as "strip";
283 * theory Sexp now in HOL/Induct examples (it used to be part of main
284 HOL, but was unused);
286 * fewer consts declared as global (e.g. have to refer to "Lfp.lfp"
287 instead of "lfp" internally; affects ML packages only);
289 * tuned AST representation of nested pairs, avoiding bogus output in
290 case of overlap with user translations (e.g. judgements over tuples);
295 * simplification automatically cancels common terms in arithmetic expressions
298 * new treatment of nat to minimize type-checking: all operators coerce their
299 operands to a natural number using the function natify, making the algebraic
302 * as above, for int: operators coerce their operands to an integer using the
305 * the integer library now contains many of the usual laws for the orderings,
306 including $<=, and monotonicity laws for $+ and $*;
308 * new example ZF/ex/NatSum to demonstrate integer arithmetic simplification;
312 * AddIffs now available, giving theorems of the form P<->Q to the
313 simplifier and classical reasoner simultaneously;
318 * Provers: blast(_tac) now handles actual object-logic rules as
319 assumptions; note that auto(_tac) uses blast(_tac) internally as well;
321 * Provers: Simplifier.easy_setup provides a fast path to basic
322 Simplifier setup for new object-logics;
324 * Pure: AST translation rules no longer require constant head on LHS;
326 * Pure: improved name spaces: ambiguous output is qualified; support
329 * system: compression of ML heaps images may now be controlled via -c
330 option of isabelle and isatool usedir (currently only observed by
333 * system: provide TAGS file for Isabelle sources;
335 * settings: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
336 XSYMBOL_HOME; no longer need to do manual configuration in most
339 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
342 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
343 timing flag supersedes proof_timing and Toplevel.trace;
345 * ML: PureThy.add_defs gets additional argument to indicate potential
346 overloading (usually false);
348 * ML: new combinators |>> and |>>> for incremental transformations
349 with secondary results (e.g. certain theory extensions):
353 New in Isabelle99 (October 1999)
354 --------------------------------
356 *** Overview of INCOMPATIBILITIES (see below for more details) ***
358 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
359 are no longer simplified. (This allows the simplifier to unfold recursive
360 functional programs.) To restore the old behaviour, declare
362 Delcongs [if_weak_cong];
364 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
367 * HOL: the predicate "inj" is now defined by translation to "inj_on";
369 * HOL/datatype: mutual_induct_tac no longer exists --
370 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
372 * HOL/typedef: fixed type inference for representing set; type
373 arguments now have to occur explicitly on the rhs as type constraints;
375 * ZF: The con_defs part of an inductive definition may no longer refer
376 to constants declared in the same theory;
378 * HOL, ZF: the function mk_cases, generated by the inductive
379 definition package, has lost an argument. To simplify its result, it
380 uses the default simpset instead of a supplied list of theorems.
382 * HOL/List: the constructors of type list are now Nil and Cons;
384 * Simplifier: the type of the infix ML functions
385 setSSolver addSSolver setSolver addSolver
386 is now simpset * solver -> simpset where `solver' is a new abstract type
387 for packaging solvers. A solver is created via
388 mk_solver: string -> (thm list -> int -> tactic) -> solver
389 where the string argument is only a comment.
394 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
395 decision procedure for linear arithmetic. Currently it is used for
396 types `nat', `int', and `real' in HOL (see below); it can, should and
397 will be instantiated for other types and logics as well.
399 * The simplifier now accepts rewrite rules with flexible heads, eg
400 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
401 They are applied like any rule with a non-pattern lhs, i.e. by first-order
407 * New Isabelle/Isar subsystem provides an alternative to traditional
408 tactical theorem proving; together with the ProofGeneral/isar user
409 interface it offers an interactive environment for developing human
410 readable proof documents (Isar == Intelligible semi-automated
411 reasoning); for further information see isatool doc isar-ref,
412 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
414 * improved and simplified presentation of theories: better HTML markup
415 (including colors), graph views in several sizes; isatool usedir now
416 provides a proper interface for user theories (via -P option); actual
417 document preparation based on (PDF)LaTeX is available as well (for
418 new-style theories only); see isatool doc system for more information;
420 * native support for Proof General, both for classic Isabelle and
423 * ML function thm_deps visualizes dependencies of theorems and lemmas,
424 using the graph browser tool;
426 * Isabelle manuals now also available as PDF;
428 * theory loader rewritten from scratch (may not be fully
429 bug-compatible); old loadpath variable has been replaced by show_path,
430 add_path, del_path, reset_path functions; new operations such as
431 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
434 * improved isatool install: option -k creates KDE application icon,
435 option -p DIR installs standalone binaries;
437 * added ML_PLATFORM setting (useful for cross-platform installations);
438 more robust handling of platform specific ML images for SML/NJ;
440 * the settings environment is now statically scoped, i.e. it is never
441 created again in sub-processes invoked from isabelle, isatool, or
444 * path element specification '~~' refers to '$ISABELLE_HOME';
446 * in locales, the "assumes" and "defines" parts may be omitted if
449 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
452 * new print_mode "HTML";
454 * new flag show_tags controls display of tags of theorems (which are
455 basically just comments that may be attached by some tools);
457 * Isamode 2.6 requires patch to accomodate change of Isabelle font
458 mode and goal output format:
460 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
462 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
464 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
465 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
467 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
469 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
471 * function bind_thms stores lists of theorems (cf. bind_thm);
473 * new shorthand tactics ftac, eatac, datac, fatac;
475 * qed (and friends) now accept "" as result name; in that case the
476 theorem is not stored, but proper checks and presentation of the
479 * theorem database now also indexes constants "Trueprop", "all",
480 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
487 * There are now decision procedures for linear arithmetic over nat and
490 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
491 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
492 are treated as atomic; subformulae not involving type `nat' or `int'
493 are ignored; quantified subformulae are ignored unless they are
494 positive universal or negative existential. The tactic has to be
495 invoked by hand and can be a little bit slow. In particular, the
496 running time is exponential in the number of occurrences of `min' and
497 `max', and `-' on `nat'.
499 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
500 (negated) (in)equalities among the premises and the conclusion into
501 account (i.e. no compound formulae) and does not know about `min' and
502 `max', and `-' on `nat'. It is fast and is used automatically by the
505 NB: At the moment, these decision procedures do not cope with mixed
506 nat/int formulae where the two parts interact, such as `m < n ==>
509 * HOL/Numeral provides a generic theory of numerals (encoded
510 efficiently as bit strings); setup for types nat/int/real is in place;
511 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
512 int, existing theories and proof scripts may require a few additional
515 * integer division and remainder can now be performed on constant
518 * many properties of integer multiplication, division and remainder
521 * An interface to the Stanford Validity Checker (SVC) is available through the
522 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
523 are proved automatically. SVC must be installed separately, and its results
524 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
525 invocation of the underlying oracle). For SVC see
526 http://verify.stanford.edu/SVC
528 * IsaMakefile: the HOL-Real target now builds an actual image;
533 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
534 (in Isabelle/Isar) -- by Gertrud Bauer;
536 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
537 analysis for assembly languages with subtypes;
539 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
540 -- avoids syntactic ambiguities and treats state, transition, and
541 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
542 changed syntax and (many) tactics;
544 * HOL/inductive: Now also handles more general introduction rules such
545 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
546 theorems are now maintained within the theory (maintained via the
549 * HOL/datatype: Now also handles arbitrarily branching datatypes
550 (using function types) such as
552 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
554 * HOL/record: record_simproc (part of the default simpset) takes care
555 of selectors applied to updated records; record_split_tac is no longer
556 part of the default claset; update_defs may now be removed from the
557 simpset in many cases; COMPATIBILITY: old behavior achieved by
559 claset_ref () := claset() addSWrapper record_split_wrapper;
560 Delsimprocs [record_simproc]
562 * HOL/typedef: fixed type inference for representing set; type
563 arguments now have to occur explicitly on the rhs as type constraints;
565 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
566 names rather than an ML expression;
568 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
569 supplied later. Program schemes can be defined, such as
570 "While B C s = (if B s then While B C (C s) else s)"
571 where the well-founded relation can be chosen after B and C have been given.
573 * HOL/List: the constructors of type list are now Nil and Cons;
574 INCOMPATIBILITY: while [] and infix # syntax is still there, of
575 course, ML tools referring to List.list.op # etc. have to be adapted;
577 * HOL_quantifiers flag superseded by "HOL" print mode, which is
578 disabled by default; run isabelle with option -m HOL to get back to
579 the original Gordon/HOL-style output;
581 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
582 ALL x<=y. P, EX x<y. P, EX x<=y. P;
584 * HOL basic syntax simplified (more orthogonal): all variants of
585 All/Ex now support plain / symbolic / HOL notation; plain syntax for
586 Eps operator is provided as well: "SOME x. P[x]";
588 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
590 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
591 thus available for user theories;
593 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
594 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
597 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
598 several times and then mp;
603 * the notation <<...>> is now available as a notation for sequences of
606 * the simplifier is now installed
608 * the axiom system has been generalized (thanks to Soren Heilmann)
610 * the classical reasoner now has a default rule database
615 * new primrec section allows primitive recursive functions to be given
616 directly (as in HOL) over datatypes and the natural numbers;
618 * new tactics induct_tac and exhaust_tac for induction (or case
619 analysis) over datatypes and the natural numbers;
621 * the datatype declaration of type T now defines the recursor T_rec;
623 * simplification automatically does freeness reasoning for datatype
626 * automatic type-inference, with AddTCs command to insert new
629 * datatype introduction rules are now added as Safe Introduction rules
632 * the syntax "if P then x else y" is now available in addition to
636 *** Internal programming interfaces ***
638 * tuned simplifier trace output; new flag debug_simp;
640 * structures Vartab / Termtab (instances of TableFun) offer efficient
641 tables indexed by indexname_ord / term_ord (compatible with aconv);
643 * AxClass.axclass_tac lost the theory argument;
645 * tuned current_goals_markers semantics: begin / end goal avoids
646 printing empty lines;
648 * removed prs and prs_fn hook, which was broken because it did not
649 include \n in its semantics, forcing writeln to add one
650 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
651 string -> unit if you really want to output text without newline;
653 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
654 plain output, interface builders may have to enable 'isabelle_font'
655 mode to get Isabelle font glyphs as before;
657 * refined token_translation interface; INCOMPATIBILITY: output length
658 now of type real instead of int;
660 * theory loader actions may be traced via new ThyInfo.add_hook
661 interface (see src/Pure/Thy/thy_info.ML); example application: keep
662 your own database of information attached to *whole* theories -- as
663 opposed to intra-theory data slots offered via TheoryDataFun;
665 * proper handling of dangling sort hypotheses (at last!);
666 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
667 extra sort hypotheses that can be witnessed from the type signature;
668 the force_strip_shyps flag is gone, any remaining shyps are simply
669 left in the theorem (with a warning issued by strip_shyps_warning);
673 New in Isabelle98-1 (October 1998)
674 ----------------------------------
676 *** Overview of INCOMPATIBILITIES (see below for more details) ***
678 * several changes of automated proof tools;
680 * HOL: major changes to the inductive and datatype packages, including
681 some minor incompatibilities of theory syntax;
683 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
686 * HOL: removed duplicate thms in Arith:
687 less_imp_add_less should be replaced by trans_less_add1
688 le_imp_add_le should be replaced by trans_le_add1
690 * HOL: unary minus is now overloaded (new type constraints may be
693 * HOL and ZF: unary minus for integers is now #- instead of #~. In
694 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
695 now taken as an integer constant.
697 * Pure: ML function 'theory_of' renamed to 'theory';
703 1. Asm_full_simp_tac is now more aggressive.
704 1. It will sometimes reorient premises if that increases their power to
706 2. It does no longer proceed strictly from left to right but may also
707 rotate premises to achieve further simplification.
708 For compatibility reasons there is now Asm_lr_simp_tac which is like the
709 old Asm_full_simp_tac in that it does not rotate premises.
710 2. The simplifier now knows a little bit about nat-arithmetic.
712 * Classical reasoner: wrapper mechanism for the classical reasoner now
713 allows for selected deletion of wrappers, by introduction of names for
714 wrapper functionals. This implies that addbefore, addSbefore,
715 addaltern, and addSaltern now take a pair (name, tactic) as argument,
716 and that adding two tactics with the same name overwrites the first
717 one (emitting a warning).
718 type wrapper = (int -> tactic) -> (int -> tactic)
719 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
720 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
721 delWrapper, delSWrapper: claset * string -> claset
722 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
724 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
725 semantics; addbefore now affects only the unsafe part of step_tac
726 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
727 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
730 * Classical reasoner: setwrapper to setWrapper and compwrapper to
731 compWrapper; added safe wrapper (and access functions for it);
733 * HOL/split_all_tac is now much faster and fails if there is nothing
734 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
735 and the names of the automatically generated variables have changed.
736 split_all_tac has moved within claset() from unsafe wrappers to safe
737 wrappers, which means that !!-bound variables are split much more
738 aggressively, and safe_tac and clarify_tac now split such variables.
739 If this splitting is not appropriate, use delSWrapper "split_all_tac".
740 Note: the same holds for record_split_tac, which does the job of
741 split_all_tac for record fields.
743 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
744 permanently to the default simpset using Addsplits just like
745 Addsimps. They can be removed via Delsplits just like
746 Delsimps. Lower-case versions are also available.
748 * HOL/Simplifier: The rule split_if is now part of the default
749 simpset. This means that the simplifier will eliminate all occurrences
750 of if-then-else in the conclusion of a goal. To prevent this, you can
751 either remove split_if completely from the default simpset by
752 `Delsplits [split_if]' or remove it in a specific call of the
753 simplifier using `... delsplits [split_if]'. You can also add/delete
754 other case splitting rules to/from the default simpset: every datatype
755 generates suitable rules `split_t_case' and `split_t_case_asm' (where
756 t is the name of the datatype).
758 * Classical reasoner / Simplifier combination: new force_tac (and
759 derivatives Force_tac, force) combines rewriting and classical
760 reasoning (and whatever other tools) similarly to auto_tac, but is
761 aimed to solve the given subgoal completely.
766 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
767 and `goalw': the theory is no longer needed as an explicit argument -
768 the current theory context is used; assumptions are no longer returned
769 at the ML-level unless one of them starts with ==> or !!; it is
770 recommended to convert to these new commands using isatool fixgoal
771 (backup your sources first!);
773 * new top-level commands 'thm' and 'thms' for retrieving theorems from
774 the current theory context, and 'theory' to lookup stored theories;
776 * new theory section 'locale' for declaring constants, assumptions and
777 definitions that have local scope;
779 * new theory section 'nonterminals' for purely syntactic types;
781 * new theory section 'setup' for generic ML setup functions
782 (e.g. package initialization);
784 * the distribution now includes Isabelle icons: see
785 lib/logo/isabelle-{small,tiny}.xpm;
787 * isatool install - install binaries with absolute references to
790 * isatool logo -- create instances of the Isabelle logo (as EPS);
792 * print mode 'emacs' reserved for Isamode;
794 * support multiple print (ast) translations per constant name;
796 * theorems involving oracles are now printed with a suffixed [!];
801 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
803 * HOL/inductive package reorganized and improved: now supports mutual
809 oddI "n : EVEN ==> Suc n : ODD"
810 evenI "n : ODD ==> Suc n : EVEN"
812 new theorem list "elims" contains an elimination rule for each of the
813 recursive sets; inductive definitions now handle disjunctive premises
816 INCOMPATIBILITIES: requires Inductive as an ancestor; component
817 "mutual_induct" no longer exists - the induction rule is always
818 contained in "induct";
821 * HOL/datatype package re-implemented and greatly improved: now
822 supports mutually recursive datatypes such as
825 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
826 | SUM ('a aexp) ('a aexp)
827 | DIFF ('a aexp) ('a aexp)
830 'a bexp = LESS ('a aexp) ('a aexp)
831 | AND ('a bexp) ('a bexp)
832 | OR ('a bexp) ('a bexp)
834 as well as indirectly recursive datatypes such as
837 ('a, 'b) term = Var 'a
838 | App 'b ((('a, 'b) term) list)
840 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
841 induction on mutually / indirectly recursive datatypes.
843 Primrec equations are now stored in theory and can be accessed via
844 <function_name>.simps.
848 - Theories using datatypes must now have theory Datatype as an
850 - The specific <typename>.induct_tac no longer exists - use the
851 generic induct_tac instead.
852 - natE has been renamed to nat.exhaust - use exhaust_tac
853 instead of res_inst_tac ... natE. Note that the variable
854 names in nat.exhaust differ from the names in natE, this
855 may cause some "fragile" proofs to fail.
856 - The theorems split_<typename>_case and split_<typename>_case_asm
857 have been renamed to <typename>.split and <typename>.split_asm.
858 - Since default sorts of type variables are now handled correctly,
859 some datatype definitions may have to be annotated with explicit
861 - Primrec definitions no longer require function name and type
862 of recursive argument.
864 Consider using isatool fixdatatype to adapt your theories and proof
865 scripts to the new package (backup your sources first!).
868 * HOL/record package: considerably improved implementation; now
869 includes concrete syntax for record types, terms, updates; theorems
870 for surjective pairing and splitting !!-bound record variables; proof
871 support is as follows:
873 1) standard conversions (selectors or updates applied to record
874 constructor terms) are part of the standard simpset;
876 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
877 made part of standard simpset and claset via addIffs;
879 3) a tactic for record field splitting (record_split_tac) is part of
880 the standard claset (addSWrapper);
882 To get a better idea about these rules you may retrieve them via
883 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
884 the name of your record type.
886 The split tactic 3) conceptually simplifies by the following rule:
888 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
890 Thus any record variable that is bound by meta-all will automatically
891 blow up into some record constructor term, consequently the
892 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
893 solve record problems automatically.
896 * reorganized the main HOL image: HOL/Integ and String loaded by
897 default; theory Main includes everything;
899 * automatic simplification of integer sums and comparisons, using cancellation;
901 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
903 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
905 * many new identities for unions, intersections, set difference, etc.;
907 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
908 called split_if, split_split, split_sum_case and split_nat_case (to go
911 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
912 (?x::unit) = (); this is made part of the default simpset, which COULD
913 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
914 'Delsimprocs [unit_eq_proc];' as last resort); also note that
915 unit_abs_eta_conv is added in order to counter the effect of
916 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
919 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
922 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
923 It and 'sym RS equals0D' are now in the default claset, giving automatic
924 disjointness reasoning but breaking a few old proofs.
926 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
927 to 'converse' from 'inverse' (for compatibility with ZF and some
930 * HOL/recdef can now declare non-recursive functions, with {} supplied as
931 the well-founded relation;
933 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
934 Compl A. The "Compl" syntax remains available as input syntax for this
937 * HOL/Update: new theory of function updates:
938 f(a:=b) == %x. if x=a then b else f x
939 may also be iterated as in f(a:=b,c:=d,...);
941 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
944 - new function list_update written xs[i:=v] that updates the i-th
945 list position. May also be iterated as in xs[i:=a,j:=b,...].
946 - new function `upt' written [i..j(] which generates the list
947 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
948 bound write [i..j], which is a shorthand for [i..j+1(].
949 - new lexicographic orderings and corresponding wellfoundedness theorems.
952 - removed 'pred' (predecessor) function;
953 - generalized some theorems about n-1;
954 - many new laws about "div" and "mod";
955 - new laws about greatest common divisors (see theory ex/Primes);
957 * HOL/Relation: renamed the relational operator r^-1 "converse"
958 instead of "inverse";
960 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
961 of the multiset ordering;
963 * directory HOL/Real: a construction of the reals using Dedekind cuts
964 (not included by default);
966 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
968 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
969 programs, i.e. different program variables may have different types.
971 * calling (stac rew i) now fails if "rew" has no effect on the goal
972 [previously, this check worked only if the rewrite rule was unconditional]
973 Now rew can involve either definitions or equalities (either == or =).
978 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
979 only the theorems proved on ZF.ML;
981 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
982 It and 'sym RS equals0D' are now in the default claset, giving automatic
983 disjointness reasoning but breaking a few old proofs.
985 * ZF/Update: new theory of function updates
986 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
987 may also be iterated as in f(a:=b,c:=d,...);
989 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
991 * calling (stac rew i) now fails if "rew" has no effect on the goal
992 [previously, this check worked only if the rewrite rule was unconditional]
993 Now rew can involve either definitions or equalities (either == or =).
995 * case_tac provided for compatibility with HOL
996 (like the old excluded_middle_tac, but with subgoals swapped)
999 *** Internal programming interfaces ***
1001 * Pure: several new basic modules made available for general use, see
1002 also src/Pure/README;
1004 * improved the theory data mechanism to support encapsulation (data
1005 kind name replaced by private Object.kind, acting as authorization
1006 key); new type-safe user interface via functor TheoryDataFun; generic
1007 print_data function becomes basically useless;
1009 * removed global_names compatibility flag -- all theory declarations
1010 are qualified by default;
1012 * module Pure/Syntax now offers quote / antiquote translation
1013 functions (useful for Hoare logic etc. with implicit dependencies);
1014 see HOL/ex/Antiquote for an example use;
1016 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
1019 * new tactical CHANGED_GOAL for checking that a tactic modifies a
1022 * Display.print_goals function moved to Locale.print_goals;
1024 * standard print function for goals supports current_goals_markers
1025 variable for marking begin of proof, end of proof, start of goal; the
1026 default is ("", "", ""); setting current_goals_markers := ("<proof>",
1027 "</proof>", "<goal>") causes SGML like tagged proof state printing,
1032 New in Isabelle98 (January 1998)
1033 --------------------------------
1035 *** Overview of INCOMPATIBILITIES (see below for more details) ***
1037 * changed lexical syntax of terms / types: dots made part of long
1038 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
1040 * simpset (and claset) reference variable replaced by functions
1041 simpset / simpset_ref;
1043 * no longer supports theory aliases (via merge) and non-trivial
1044 implicit merge of thms' signatures;
1046 * most internal names of constants changed due to qualified names;
1048 * changed Pure/Sequence interface (see Pure/seq.ML);
1051 *** General Changes ***
1053 * hierachically structured name spaces (for consts, types, axms, thms
1054 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
1055 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
1056 isatool fixdots ensures space after dots (e.g. "%x. x"); set
1057 long_names for fully qualified output names; NOTE: ML programs
1058 (special tactics, packages etc.) referring to internal names may have
1059 to be adapted to cope with fully qualified names; in case of severe
1060 backward campatibility problems try setting 'global_names' at compile
1061 time to have enrything declared within a flat name space; one may also
1062 fine tune name declarations in theories via the 'global' and 'local'
1065 * reimplemented the implicit simpset and claset using the new anytype
1066 data filed in signatures; references simpset:simpset ref etc. are
1067 replaced by functions simpset:unit->simpset and
1068 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
1069 to patch your ML files accordingly;
1071 * HTML output now includes theory graph data for display with Java
1072 applet or isatool browser; data generated automatically via isatool
1073 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
1075 * defs may now be conditional; improved rewrite_goals_tac to handle
1076 conditional equations;
1078 * defs now admits additional type arguments, using TYPE('a) syntax;
1080 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
1081 creates a new theory node; implicit merge of thms' signatures is
1082 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
1083 transfer:theory->thm->thm in (rare) cases;
1085 * improved handling of draft signatures / theories; draft thms (and
1086 ctyps, cterms) are automatically promoted to real ones;
1088 * slightly changed interfaces for oracles: admit many per theory, named
1089 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
1091 * print_goals: optional output of const types (set show_consts and
1094 * improved output of warnings (###) and errors (***);
1096 * subgoal_tac displays a warning if the new subgoal has type variables;
1098 * removed old README and Makefiles;
1100 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
1102 * removed obsolete init_pps and init_database;
1104 * deleted the obsolete tactical STATE, which was declared by
1105 fun STATE tacfun st = tacfun st st;
1107 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
1108 (which abbreviates $HOME);
1110 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
1111 use isatool fixseq to adapt your ML programs (this works for fully
1112 qualified references to the Sequence structure only!);
1114 * use_thy no longer requires writable current directory; it always
1115 reloads .ML *and* .thy file, if either one is out of date;
1118 *** Classical Reasoner ***
1120 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
1121 tactics that use classical reasoning to simplify a subgoal without
1122 splitting it into several subgoals;
1124 * Safe_tac: like safe_tac but uses the default claset;
1129 * added simplification meta rules:
1130 (asm_)(full_)simplify: simpset -> thm -> thm;
1132 * simplifier.ML no longer part of Pure -- has to be loaded by object
1135 * added prems argument to simplification procedures;
1137 * HOL, FOL, ZF: added infix function `addsplits':
1138 instead of `<simpset> setloop (split_tac <thms>)'
1139 you can simply write `<simpset> addsplits <thms>'
1144 * TYPE('a) syntax for type reflection terms;
1146 * no longer handles consts with name "" -- declare as 'syntax' instead;
1148 * pretty printer: changed order of mixfix annotation preference (again!);
1150 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
1155 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
1156 with `addloop' of the simplifier to faciliate case splitting in premises.
1158 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
1160 * HOL/Auth: new protocol proofs including some for the Internet
1163 * HOL/Map: new theory of `maps' a la VDM;
1165 * HOL/simplifier: simplification procedures nat_cancel_sums for
1166 cancelling out common nat summands from =, <, <= (in)equalities, or
1167 differences; simplification procedures nat_cancel_factor for
1168 cancelling common factor from =, <, <= (in)equalities over natural
1169 sums; nat_cancel contains both kinds of procedures, it is installed by
1170 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
1172 * HOL/simplifier: terms of the form
1173 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
1175 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
1176 and those of the form
1177 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
1179 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
1182 Each datatype `t' now comes with a theorem `split_t_case' of the form
1184 P(t_case f1 ... fn x) =
1185 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
1187 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
1190 and a theorem `split_t_case_asm' of the form
1192 P(t_case f1 ... fn x) =
1193 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
1195 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
1197 which can be added to a simpset via `addsplits'. The existing theorems
1198 expand_list_case and expand_option_case have been renamed to
1199 split_list_case and split_option_case.
1202 - `pred n' is automatically converted to `n-1'.
1203 Users are strongly encouraged not to use `pred' any longer,
1204 because it will disappear altogether at some point.
1205 - Users are strongly encouraged to write "0 < n" rather than
1206 "n ~= 0". Theorems and proof tools have been modified towards this
1210 the function "set_of_list" has been renamed "set" (and its theorems too);
1211 the function "nth" now takes its arguments in the reverse order and
1212 has acquired the infix notation "!" as in "xs!n".
1214 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
1216 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
1217 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
1219 * HOL/record: extensible records with schematic structural subtyping
1220 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
1221 still lacks various theorems and concrete record syntax;
1226 * removed "axioms" and "generated by" sections;
1228 * replaced "ops" section by extended "consts" section, which is capable of
1229 handling the continuous function space "->" directly;
1232 . proves theorems immediately and stores them in the theory,
1233 . creates hierachical name space,
1234 . now uses normal mixfix annotations (instead of cinfix...),
1235 . minor changes to some names and values (for consistency),
1236 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
1237 . separator between mutual domain defs: changed "," to "and",
1238 . improved handling of sort constraints; now they have to
1239 appear on the left-hand side of the equations only;
1241 * fixed LAM <x,y,zs>.b syntax;
1243 * added extended adm_tac to simplifier in HOLCF -- can now discharge
1244 adm (%x. P (t x)), where P is chainfinite and t continuous;
1249 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
1250 with `addloop' of the simplifier to faciliate case splitting in premises.
1252 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
1253 in HOL, they strip ALL and --> from proved theorems;
1257 New in Isabelle94-8 (May 1997)
1258 ------------------------------
1260 *** General Changes ***
1262 * new utilities to build / run / maintain Isabelle etc. (in parts
1263 still somewhat experimental); old Makefiles etc. still functional;
1265 * new 'Isabelle System Manual';
1267 * INSTALL text, together with ./configure and ./build scripts;
1269 * reimplemented type inference for greater efficiency, better error
1270 messages and clean internal interface;
1272 * prlim command for dealing with lots of subgoals (an easier way of
1273 setting goals_limit);
1278 * supports alternative (named) syntax tables (parser and pretty
1279 printer); internal interface is provided by add_modesyntax(_i);
1281 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
1282 be used in conjunction with the Isabelle symbol font; uses the
1283 "symbols" syntax table;
1285 * added token_translation interface (may translate name tokens in
1286 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
1287 the current print_mode); IMPORTANT: user print translation functions
1288 are responsible for marking newly introduced bounds
1289 (Syntax.mark_boundT);
1291 * token translations for modes "xterm" and "xterm_color" that display
1292 names in bold, underline etc. or colors (which requires a color
1295 * infixes may now be declared with names independent of their syntax;
1297 * added typed_print_translation (like print_translation, but may
1298 access type of constant);
1301 *** Classical Reasoner ***
1303 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
1304 some limitations. Blast_tac...
1305 + ignores addss, addbefore, addafter; this restriction is intrinsic
1306 + ignores elimination rules that don't have the correct format
1307 (the conclusion MUST be a formula variable)
1308 + ignores types, which can make HOL proofs fail
1309 + rules must not require higher-order unification, e.g. apply_type in ZF
1310 [message "Function Var's argument not a bound variable" relates to this]
1311 + its proof strategy is more general but can actually be slower
1313 * substitution with equality assumptions no longer permutes other
1316 * minor changes in semantics of addafter (now called addaltern); renamed
1317 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
1318 (and access functions for it);
1320 * improved combination of classical reasoner and simplifier:
1321 + functions for handling clasimpsets
1322 + improvement of addss: now the simplifier is called _after_ the
1324 + safe variant of addss called addSss: uses safe simplifications
1325 _during_ the safe steps. It is more complete as it allows multiple
1326 instantiations of unknowns (e.g. with slow_tac).
1330 * added interface for simplification procedures (functions that
1331 produce *proven* rewrite rules on the fly, depending on current
1334 * ordering on terms as parameter (used for ordered rewriting);
1336 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
1338 * the solver is now split into a safe and an unsafe part.
1339 This should be invisible for the normal user, except that the
1340 functions setsolver and addsolver have been renamed to setSolver and
1341 addSolver; added safe_asm_full_simp_tac;
1346 * a generic induction tactic `induct_tac' which works for all datatypes and
1347 also for type `nat';
1349 * a generic case distinction tactic `exhaust_tac' which works for all
1350 datatypes and also for type `nat';
1352 * each datatype comes with a function `size';
1354 * patterns in case expressions allow tuple patterns as arguments to
1355 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
1357 * primrec now also works with type nat;
1359 * recdef: a new declaration form, allows general recursive functions to be
1360 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
1362 * the constant for negation has been renamed from "not" to "Not" to
1363 harmonize with FOL, ZF, LK, etc.;
1365 * HOL/ex/LFilter theory of a corecursive "filter" functional for
1368 * HOL/Modelcheck demonstrates invocation of model checker oracle;
1370 * HOL/ex/Ring.thy declares cring_simp, which solves equational
1371 problems in commutative rings, using axiomatic type classes for + and *;
1373 * more examples in HOL/MiniML and HOL/Auth;
1375 * more default rewrite rules for quantifiers, union/intersection;
1377 * a new constant `arbitrary == @x.False';
1379 * HOLCF/IOA replaces old HOL/IOA;
1381 * HOLCF changes: derived all rules and arities
1382 + axiomatic type classes instead of classes
1383 + typedef instead of faking type definitions
1384 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
1385 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
1386 + eliminated the types void, one, tr
1387 + use unit lift and bool lift (with translations) instead of one and tr
1388 + eliminated blift from Lift3.thy (use Def instead of blift)
1389 all eliminated rules are derived as theorems --> no visible changes ;
1394 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
1395 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
1396 as ZF_cs addSIs [equalityI];
1400 New in Isabelle94-7 (November 96)
1401 ---------------------------------
1403 * allowing negative levels (as offsets) in prlev and choplev;
1405 * super-linear speedup for large simplifications;
1407 * FOL, ZF and HOL now use miniscoping: rewriting pushes
1408 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
1409 FAIL); can suppress it using the command Delsimps (ex_simps @
1410 all_simps); De Morgan laws are also now included, by default;
1412 * improved printing of ==> : ~:
1414 * new object-logic "Sequents" adds linear logic, while replacing LK
1415 and Modal (thanks to Sara Kalvala);
1417 * HOL/Auth: correctness proofs for authentication protocols;
1419 * HOL: new auto_tac combines rewriting and classical reasoning (many
1420 examples on HOL/Auth);
1422 * HOL: new command AddIffs for declaring theorems of the form P=Q to
1423 the rewriter and classical reasoner simultaneously;
1425 * function uresult no longer returns theorems in "standard" format;
1426 regain previous version by: val uresult = standard o uresult;
1433 * oracles -- these establish an interface between Isabelle and trusted
1434 external reasoners, which may deliver results as theorems;
1436 * proof objects (in particular record all uses of oracles);
1438 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
1440 * "constdefs" section in theory files;
1442 * "primrec" section (HOL) no longer requires names;
1444 * internal type "tactic" now simply "thm -> thm Sequence.seq";
1451 * reduced space requirements;
1453 * automatic HTML generation from theories;
1455 * theory files no longer require "..." (quotes) around most types;
1457 * new examples, including two proofs of the Church-Rosser theorem;
1459 * non-curried (1994) version of HOL is no longer distributed;
1466 * greatly reduced space requirements;
1468 * theory files (.thy) no longer require \...\ escapes at line breaks;
1470 * searchable theorem database (see the section "Retrieving theorems" on
1471 page 8 of the Reference Manual);
1473 * new examples, including Grabczewski's monumental case study of the
1476 * The previous version of HOL renamed to Old_HOL;
1478 * The new version of HOL (previously called CHOL) uses a curried syntax
1479 for functions. Application looks like f a b instead of f(a,b);
1481 * Mutually recursive inductive definitions finally work in HOL;
1483 * In ZF, pattern-matching on tuples is now available in all abstractions and
1484 translates to the operator "split";
1491 * new infix operator, addss, allowing the classical reasoner to
1492 perform simplification at each step of its search. Example:
1493 fast_tac (cs addss ss)
1495 * a new logic, CHOL, the same as HOL, but with a curried syntax
1496 for functions. Application looks like f a b instead of f(a,b). Also pairs
1497 look like (a,b) instead of <a,b>;
1499 * PLEASE NOTE: CHOL will eventually replace HOL!
1501 * In CHOL, pattern-matching on tuples is now available in all abstractions.
1502 It translates to the operator "split". A new theory of integers is available;
1504 * In ZF, integer numerals now denote two's-complement binary integers.
1505 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
1507 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
1508 of the Axiom of Choice;
1515 * Significantly faster resolution;
1517 * the different sections in a .thy file can now be mixed and repeated
1520 * Database of theorems for FOL, HOL and ZF. New
1521 commands including qed, qed_goal and bind_thm store theorems in the database.
1523 * Simple database queries: return a named theorem (get_thm) or all theorems of
1524 a given theory (thms_of), or find out what theory a theorem was proved in
1527 * Bugs fixed in the inductive definition and datatype packages;
1529 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
1530 and HOL_dup_cs obsolete;
1532 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
1535 * Simpler definition of function space in ZF;
1537 * new results about cardinal and ordinal arithmetic in ZF;
1539 * 'subtype' facility in HOL for introducing new types as subsets of existing