wenzelm@3943: wenzelm@2553: Isabelle NEWS -- history of user-visible changes wenzelm@2553: ================================================ wenzelm@2553: wenzelm@4410: New in Isabelle98 (January 1998) wenzelm@4410: -------------------------------- wenzelm@4410: wenzelm@4410: *** Overview of INCOMPATIBILITIES (see below for more details) *** wenzelm@4410: wenzelm@4410: * changed lexical syntax of terms / types: dots made part of long wenzelm@4410: identifiers, e.g. "%x.x" no longer possible, should be "%x. x"; wenzelm@4410: wenzelm@4410: * simpset (and claset) reference variable replaced by functions wenzelm@4410: simpset / simpset_ref; wenzelm@4410: wenzelm@4410: * no longer supports theory aliases (via merge) and non-trivial wenzelm@4410: implicit merge of thms' signatures; wenzelm@4410: wenzelm@4410: * most internal names of constants changed due to qualified names; wenzelm@4410: wenzelm@4410: * changed Pure/Sequence interface (see Pure/seq.ML); wenzelm@4410: wenzelm@3454: paulson@3715: *** General Changes *** paulson@3715: wenzelm@4174: * hierachically structured name spaces (for consts, types, axms, thms wenzelm@3943: etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of wenzelm@4108: old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY: wenzelm@4108: isatool fixdots ensures space after dots (e.g. "%x. x"); set wenzelm@4174: long_names for fully qualified output names; NOTE: ML programs wenzelm@4174: (special tactics, packages etc.) referring to internal names may have wenzelm@4174: to be adapted to cope with fully qualified names; in case of severe wenzelm@4174: backward campatibility problems try setting 'global_names' at compile wenzelm@4174: time to have enrything declared within a flat name space; one may also wenzelm@4174: fine tune name declarations in theories via the 'global' and 'local' wenzelm@4174: section; wenzelm@4108: wenzelm@4108: * reimplemented the implicit simpset and claset using the new anytype wenzelm@4108: data filed in signatures; references simpset:simpset ref etc. are wenzelm@4108: replaced by functions simpset:unit->simpset and wenzelm@4108: simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp wenzelm@4108: to patch your ML files accordingly; paulson@3856: wenzelm@3857: * HTML output now includes theory graph data for display with Java wenzelm@3857: applet or isatool browser; data generated automatically via isatool wenzelm@3901: usedir (see -i option, ISABELLE_USEDIR_OPTIONS); wenzelm@3857: paulson@3856: * defs may now be conditional; improved rewrite_goals_tac to handle paulson@3856: conditional equations; paulson@3856: wenzelm@4174: * defs now admits additional type arguments, using TYPE('a) syntax; wenzelm@4174: wenzelm@3901: * theory aliases via merge (e.g. M=A+B+C) no longer supported, always wenzelm@3901: creates a new theory node; implicit merge of thms' signatures is wenzelm@4112: restricted to 'trivial' ones; COMPATIBILITY: one may have to use wenzelm@3901: transfer:theory->thm->thm in (rare) cases; wenzelm@3901: wenzelm@3968: * improved handling of draft signatures / theories; draft thms (and wenzelm@3968: ctyps, cterms) are automatically promoted to real ones; wenzelm@3968: wenzelm@3901: * slightly changed interfaces for oracles: admit many per theory, named wenzelm@3901: (e.g. oracle foo = mlfun), additional name argument for invoke_oracle; wenzelm@3901: wenzelm@3901: * print_goals: optional output of const types (set show_consts and wenzelm@3901: show_types); wenzelm@3851: wenzelm@4388: * improved output of warnings (###) and errors (***); wenzelm@3697: paulson@4178: * subgoal_tac displays a warning if the new subgoal has type variables; paulson@4178: paulson@3715: * removed old README and Makefiles; wenzelm@3697: paulson@3856: * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn; wenzelm@3670: paulson@3715: * removed obsolete init_pps and init_database; paulson@3715: paulson@3715: * deleted the obsolete tactical STATE, which was declared by paulson@3715: fun STATE tacfun st = tacfun st st; paulson@3715: wenzelm@4388: * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~ wenzelm@4388: (which abbreviates $HOME); wenzelm@4269: wenzelm@4269: * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY: wenzelm@4269: use isatool fixseq to adapt your ML programs (this works for fully wenzelm@4269: qualified references to the Sequence structure only!); wenzelm@4269: wenzelm@4381: * use_thy no longer requires writable current directory; it always wenzelm@4381: reloads .ML *and* .thy file, if either one is out of date; wenzelm@4269: paulson@3715: paulson@3715: *** Classical Reasoner *** paulson@3715: wenzelm@3744: * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new wenzelm@3744: tactics that use classical reasoning to simplify a subgoal without wenzelm@3744: splitting it into several subgoals; paulson@3715: paulson@3719: * Safe_tac: like safe_tac but uses the default claset; paulson@3719: paulson@3715: paulson@3715: *** Simplifier *** paulson@3715: paulson@3715: * added simplification meta rules: paulson@3715: (asm_)(full_)simplify: simpset -> thm -> thm; paulson@3715: paulson@3715: * simplifier.ML no longer part of Pure -- has to be loaded by object paulson@3715: logics (again); paulson@3715: paulson@3715: * added prems argument to simplification procedures; paulson@3715: paulson@4325: * HOL, FOL, ZF: added infix function `addsplits': paulson@4325: instead of ` setloop (split_tac )' paulson@4325: you can simply write ` addsplits ' paulson@4325: paulson@3715: paulson@3715: *** Syntax *** paulson@3715: wenzelm@4174: * TYPE('a) syntax for type reflection terms; wenzelm@4174: wenzelm@3985: * no longer handles consts with name "" -- declare as 'syntax' instead; paulson@3856: paulson@3856: * pretty printer: changed order of mixfix annotation preference (again!); wenzelm@3846: paulson@3715: * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; paulson@3715: paulson@3715: paulson@3715: *** HOL *** paulson@3715: oheimb@4207: * HOL: there is a new splitter `split_asm_tac' that can be used e.g. oheimb@4189: with `addloop' of the simplifier to faciliate case splitting in premises. oheimb@4189: nipkow@4035: * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions; wenzelm@3985: wenzelm@3985: * HOL/Auth: new protocol proofs including some for the Internet nipkow@4035: protocol TLS; wenzelm@3985: wenzelm@4125: * HOL/Map: new theory of `maps' a la VDM; nipkow@3982: wenzelm@4335: * HOL/simplifier: simplification procedures nat_cancel_sums for wenzelm@4335: cancelling out common nat summands from =, <, <= (in)equalities, or wenzelm@4335: differences; simplification procedures nat_cancel_factor for wenzelm@4335: cancelling common factor from =, <, <= (in)equalities over natural wenzelm@4373: sums; nat_cancel contains both kinds of procedures, it is installed by wenzelm@4373: default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL; wenzelm@4335: nipkow@3580: * HOL/simplifier: terms of the form paulson@4325: `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x) nipkow@3580: are rewritten to nipkow@4035: `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)', nipkow@4035: and those of the form paulson@4325: `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x) nipkow@4035: are rewritten to nipkow@4035: `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)', nipkow@4035: nipkow@4035: * HOL/datatype nipkow@4035: Each datatype `t' now comes with a theorem `split_t_case' of the form nipkow@3580: nipkow@4035: P(t_case f1 ... fn x) = nipkow@4035: ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) & nipkow@4035: ... oheimb@4189: (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn)) nipkow@4035: ) nipkow@4035: nipkow@4070: which can be added to a simpset via `addsplits'. The existing theorems nipkow@4070: expand_list_case and expand_option_case have been renamed to nipkow@4070: split_list_case and split_option_case. nipkow@4035: oheimb@4207: Additionally, there is a theorem `split_t_case_asm' of the form oheimb@4189: oheimb@4189: P(t_case f1 ... fn x) = oheimb@4189: ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) | oheimb@4189: ... oheimb@4189: (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn)) oheimb@4189: ) oheimb@4189: oheimb@4207: it be used with the new `split_asm_tac'. oheimb@4189: nipkow@4361: * HOL/Arithmetic: nipkow@4361: - `pred n' is automatically converted to `n-1'. nipkow@4361: Users are strongly encouraged not to use `pred' any longer, nipkow@4361: because it will disappear altogether at some point. nipkow@4361: - Users are strongly encouraged to write "0 < n" rather than nipkow@4361: "n ~= 0". Theorems and proof tools have been modified towards this nipkow@4361: `standard'. nipkow@4357: nipkow@4035: * HOL/Lists: the function "set_of_list" has been renamed "set" nipkow@4035: (and its theorems too); paulson@3570: paulson@4154: * HOL/Set: UNIV is now a constant and is no longer translated to Compl{}; paulson@4154: paulson@4154: * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its paulson@4154: specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x); paulson@4154: wenzelm@4125: paulson@3715: *** HOLCF *** wenzelm@3535: wenzelm@4125: * removed "axioms" and "generated by" sections; wenzelm@4125: oheimb@4123: * replaced "ops" section by extended "consts" section, which is capable of wenzelm@4125: handling the continuous function space "->" directly; wenzelm@4125: wenzelm@4125: * domain package: wenzelm@4125: . proves theorems immediately and stores them in the theory, wenzelm@4125: . creates hierachical name space, wenzelm@4125: . now uses normal mixfix annotations (instead of cinfix...), wenzelm@4125: . minor changes to some names and values (for consistency), wenzelm@4125: . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas, wenzelm@4125: . separator between mutual domain defs: changed "," to "and", wenzelm@4125: . improved handling of sort constraints; now they have to wenzelm@4125: appear on the left-hand side of the equations only; oheimb@4123: oheimb@4123: * fixed LAM .b syntax; wenzelm@3567: wenzelm@3744: * added extended adm_tac to simplifier in HOLCF -- can now discharge wenzelm@3744: adm (%x. P (t x)), where P is chainfinite and t continuous; wenzelm@3579: wenzelm@3579: paulson@3719: *** FOL and ZF *** paulson@3719: oheimb@4207: * FOL: there is a new splitter `split_asm_tac' that can be used e.g. oheimb@4189: with `addloop' of the simplifier to faciliate case splitting in premises. oheimb@4189: wenzelm@3744: * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as wenzelm@3744: in HOL, they strip ALL and --> from proved theorems; wenzelm@3744: paulson@3719: 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$