wenzelm@5363: Isabelle NEWS -- history user-relevant changes
wenzelm@5363: ==============================================
wenzelm@2553: 
wenzelm@14655: New in this Isabelle release
wenzelm@14655: ----------------------------
wenzelm@14655: 
wenzelm@14655: *** General ***
wenzelm@14655: 
nipkow@15130: * Theory headers: the new header syntax for Isar theories is
nipkow@15130: 
nipkow@15130:   theory <name>
nipkow@15148:   imports <theory1> ... <theoryn>
nipkow@15130:   begin
nipkow@15130: 
nipkow@15148:   optionally also with a "files" section. The syntax
nipkow@15130: 
nipkow@15130:   theory <name> = <theory1> + ... + <theoryn>:
nipkow@15130: 
nipkow@15130:   will still be supported for some time but will eventually disappear.
nipkow@15130:   The syntax of old-style theories has not changed.
nipkow@15130: 
berghofe@15475: * Theory loader: parent theories can now also be referred to via
berghofe@15475:   relative and absolute paths.
berghofe@15475: 
ballarin@15103: * Provers/quasi.ML:  new transitivity reasoners for transitivity only
ballarin@15103:   and quasi orders.
ballarin@15103: 
ballarin@15076: * Provers/trancl.ML:  new transitivity reasoner for transitive and
ballarin@15076:   reflexive-transitive closure of relations.
ballarin@15076: 
webertj@15163: * Provers/blast.ML:  new reference depth_limit to make blast's depth
webertj@15163:   limit (previously hard-coded with a value of 20) user-definable.
webertj@15163: 
paulson@15481: * Provers: new version of the subst method, for single-step rewriting: it now
paulson@15481:   works in bound variable contexts. New is subst (asm), for rewriting an
paulson@15481:   assumption. Thanks to Lucas Dixon! INCOMPATIBILITY: may rewrite a different
paulson@15481:   subterm than the original subst method, which is still available under the
paulson@15481:   name simplesubst.
paulson@15481: 
paulson@15454: * Pure: thin_tac now works even if the assumption being deleted contains !! or ==>. 
paulson@15454:   More generally, erule now works even if the major premise of the elimination rule
paulson@15454:   contains !! or ==>.
paulson@15454: 
wenzelm@14655: * Pure: considerably improved version of 'constdefs' command.  Now
wenzelm@14731:   performs automatic type-inference of declared constants; additional
wenzelm@14731:   support for local structure declarations (cf. locales and HOL
wenzelm@14731:   records), see also isar-ref manual.  Potential INCOMPATIBILITY: need
wenzelm@14731:   to observe strictly sequential dependencies of definitions within a
wenzelm@14731:   single 'constdefs' section; moreover, the declared name needs to be
wenzelm@14731:   an identifier.  If all fails, consider to fall back on 'consts' and
wenzelm@14731:   'defs' separately.
wenzelm@14655: 
wenzelm@14698: * Pure: improved indexed syntax and implicit structures.  First of
wenzelm@14731:   all, indexed syntax provides a notational device for subscripted
wenzelm@14731:   application, using the new syntax \<^bsub>term\<^esub> for arbitrary
wenzelm@14731:   expressions.  Secondly, in a local context with structure
wenzelm@14731:   declarations, number indexes \<^sub>n or the empty index (default
wenzelm@14731:   number 1) refer to a certain fixed variable implicitly; option
wenzelm@14731:   show_structs controls printing of implicit structures.  Typical
wenzelm@14731:   applications of these concepts involve record types and locales.
wenzelm@14731: 
wenzelm@14795: * Pure: clear separation of logical types and nonterminals, where the
wenzelm@14795:   latter may only occur in 'syntax' specifications or type
wenzelm@14795:   abbreviations.  Before that distinction was only partially
wenzelm@14795:   implemented via type class "logic" vs. "{}".  Potential
wenzelm@14795:   INCOMPATIBILITY in rare cases of improper use of 'types'/'consts'
wenzelm@14795:   instead of 'nonterminals'/'syntax'.  Some very exotic syntax
wenzelm@14816:   specifications may require further adaption (e.g. Cube/Base.thy).
wenzelm@14816: 
wenzelm@14854: * Pure: removed obsolete type class "logic", use the top sort {}
wenzelm@14854:   instead.  Note that non-logical types should be declared as
wenzelm@14854:   'nonterminals' rather than 'types'.  INCOMPATIBILITY for new
wenzelm@14854:   object-logic specifications.
wenzelm@14854: 
wenzelm@15744: * Pure: command 'no_syntax' removes grammar declarations (and
wenzelm@15744:   translations) resulting from the given syntax specification, which
wenzelm@15744:   is interpreted in the same manner as for the 'syntax' command.
wenzelm@15744: 
wenzelm@15022: * Pure: print_tac now outputs the goal through the trace channel.
wenzelm@15022: 
wenzelm@15022: * Pure: reference Namespace.unique_names included.  If true the
wenzelm@15022:   (shortest) namespace-prefix is printed to disambiguate conflicts (as
wenzelm@15022:   yet). If false the first entry wins (as during parsing). Default
wenzelm@15022:   value is true.
schirmer@15018: 
wenzelm@15033: * Pure: tuned internal renaming of symbolic identifiers -- attach
wenzelm@15033:   primes instead of base 26 numbers.
wenzelm@15033: 
wenzelm@15979: * Pure: new flag show_question_marks controls printing of leading
wenzelm@15979:   question marks in schematic variable names.
berghofe@15475: 
kleing@15883: * Pure: new version of thms_containing that searches for a list 
kleing@15883:   of patterns instead of a list of constants. Available in 
kleing@15883:   ProofGeneral under ProofGeneral -> Find Theorems or C-c C-f. 
kleing@15883:   Example search: "(_::nat) + _ + _"   "_ ==> _"
kleing@15883: 
wenzelm@14816: * Pure/Syntax: inner syntax includes (*(*nested*) comments*).
wenzelm@14816: 
wenzelm@14816: * Pure/Syntax: pretty pinter now supports unbreakable blocks,
wenzelm@14816:   specified in mixfix annotations as "(00...)".
wenzelm@14816: 
wenzelm@14816: * Pure/Syntax: 'advanced' translation functions (parse_translation
wenzelm@14816:   etc.) may depend on the signature of the theory context being
wenzelm@14816:   presently used for parsing/printing, see also isar-ref manual.
wenzelm@14816: 
wenzelm@15033: * Pure/Simplifier: simplification procedures may now take the current
wenzelm@15033:   simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
wenzelm@15033:   interface), which is very useful for calling the Simplifier
wenzelm@15033:   recursively.  Minor INCOMPATIBILITY: the 'prems' argument of
wenzelm@15033:   simprocs is gone -- use prems_of_ss on the simpset instead.
wenzelm@15033:   Moreover, the low-level mk_simproc no longer applies Logic.varify
wenzelm@15033:   internally, to allow for use in a context of fixed variables.
wenzelm@15033: 
nipkow@15406: * Pure/Simplifier: Command "find_rewrites" takes a string and lists all
wenzelm@15703:   equality theorems (not just those declared as simp!) whose left-hand
nipkow@15406:   side matches the term given via the string. In PG the command can be
nipkow@15406:   activated via Isabelle -> Show me -> matching rewrites.
nipkow@15406: 
wenzelm@15703: * Isar debugging: new reference Toplevel.debug; default false.
ballarin@15528:   Set to make printing of exceptions THM, TERM, TYPE and THEORY more verbose.
ballarin@15528:   
ballarin@15127: * Locales:
ballarin@15127:   - "includes" disallowed in declaration of named locales (command "locale").
ballarin@15206:   - Fixed parameter management in theorem generation for goals with "includes".
ballarin@15206:     INCOMPATIBILITY: rarely, the generated theorem statement is different.
berghofe@15475: 
ballarin@15696: * Locales:  new commands for the interpretation of locale expressions
ballarin@15696:   in theories (interpretation) and proof contexts (interpret).  These take an
ballarin@15696:   instantiation of the locale parameters and compute proof obligations from
ballarin@15696:   the instantiated specification.  After the obligations have been discharged,
ballarin@15696:   the instantiated theorems of the locale are added to the theory or proof
ballarin@15696:   context.  Interpretation is smart in that already active interpretations
ballarin@15696:   do not occur in proof obligations, neither are instantiated theorems stored
ballarin@15696:   in duplicate.
ballarin@15696:   Use print_interps to inspect active interpretations of a particular locale.
ballarin@15763:   For details, see the Isar Reference manual.
ballarin@15696: 
wenzelm@15727: * Locales: proper static binding of attribute syntax -- i.e. types /
wenzelm@15727:   terms / facts mentioned as arguments are always those of the locale
wenzelm@15727:   definition context, independently of the context of later
wenzelm@15727:   invocations.  Moreover, locale operations (renaming and type / term
wenzelm@15727:   instantiation) are applied to attribute arguments as expected.
wenzelm@15727: 
wenzelm@15727:   INCOMPATIBILITY of the ML interface: always pass Attrib.src instead
wenzelm@15727:   of actual attributes; rare situations may require Attrib.attribute
wenzelm@15727:   to embed those attributes into Attrib.src that lack concrete syntax.
wenzelm@15727: 
wenzelm@15727:   Attribute implementations need to cooperate properly with the static
wenzelm@15727:   binding mechanism.  Basic parsers Args.XXX_typ/term/prop and
wenzelm@15727:   Attrib.XXX_thm etc. already do the right thing without further
wenzelm@15727:   intervention.  Only unusual applications -- such as "where" or "of"
wenzelm@15727:   (cf. src/Pure/Isar/attrib.ML), which process arguments depending
wenzelm@15727:   both on the context and the facts involved -- may have to assign
wenzelm@15727:   parsed values to argument tokens explicitly.
wenzelm@15727: 
wenzelm@15727: * Attributes 'induct' and 'cases': type or set names may now be
wenzelm@15727:   locally fixed variables as well.
wenzelm@15727: 
wenzelm@15703: * Isar: new syntax 'name(i-j, i-, i, ...)' for referring to specific
wenzelm@15703:   selections of theorems in named facts via indices.
wenzelm@15703: 
wenzelm@15801: * Pure: reorganized bootstrapping of the Pure theories; CPure is now
wenzelm@15801:   derived from Pure, which contains all common declarations already.
wenzelm@15801:   Both theories are defined via plain Isabelle/Isar .thy files.
wenzelm@15801:   INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
wenzelm@15801:   CPure.elim / CPure.dest attributes) now appear in the Pure name
wenzelm@15801:   space; use isatool fixcpure to adapt your theory and ML sources.
wenzelm@15801: 
wenzelm@15703: 
wenzelm@15703: *** Document preparation ***
wenzelm@15703: 
wenzelm@15979: * Several new antiquotation:
wenzelm@15979: 
wenzelm@15979:   @{term_type term} prints a term with its type annotated;
wenzelm@15979: 
wenzelm@15979:   @{typeof term} prints the type of a term;
wenzelm@15979: 
wenzelm@15979:   @{const const} is the same as @{term const}, but checks
wenzelm@15979:     that the argument is a known logical constant;
wenzelm@15979: 
wenzelm@15979:   @{term_style style term} and @{thm_style style thm} print a term or
wenzelm@15979:     theorem applying a "style" to it
wenzelm@15979: 
wenzelm@15979:   Predefined styles are "lhs" and "rhs" printing the lhs/rhs of
wenzelm@15979:   definitions, equations, inequations etc. and "conclusion" printing
wenzelm@15979:   only the conclusion of a meta-logical statement theorem.  Styles may
wenzelm@15979:   be defined via TermStyle.add_style in ML.  See the "LaTeX Sugar"
wenzelm@15979:   document for more information.
wenzelm@15703: 
wenzelm@15703: * Antiquotations now provide the option 'locale=NAME' to specify an
wenzelm@15703:   alternative context used for evaluating and printing the subsequent
wenzelm@15703:   argument, as in @{thm [locale=LC] fold_commute}, for example.
wenzelm@15703: 
wenzelm@15703: * Commands 'display_drafts' and 'print_drafts' perform simple output
wenzelm@15703:   of raw sources.  Only those symbols that do not require additional
wenzelm@15703:   LaTeX packages (depending on comments in isabellesym.sty) are
wenzelm@15703:   displayed properly, everything else is left verbatim.  We use
wenzelm@15703:   isatool display and isatool print as front ends; these are subject
wenzelm@15703:   to the DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively.
wenzelm@15703: 
wenzelm@15703: * Proof scripts as well as some other commands such as ML or
wenzelm@15703:   parse/print_translation can now be hidden in the document.  Hiding
wenzelm@15703:   is enabled by default, and can be disabled either via the option '-H
wenzelm@15703:   false' of isatool usedir or by resetting the reference variable
wenzelm@15703:   IsarOutput.hide_commands. Additional commands to be hidden may be
wenzelm@15703:   declared using IsarOutput.add_hidden_commands.
wenzelm@15703: 
berghofe@15475: 
schirmer@14700: *** HOL ***
schirmer@14700: 
nipkow@15242: * Datatype induction via method `induct' now preserves the name of the
nipkow@15242:   induction variable. For example, when proving P(xs::'a list) by induction
nipkow@15242:   on xs, the induction step is now P(xs) ==> P(a#xs) rather than
nipkow@15242:   P(list) ==> P(a#list) as previously.
nipkow@15242: 
wenzelm@14731: * HOL/record: reimplementation of records. Improved scalability for
wenzelm@14731:   records with many fields, avoiding performance problems for type
wenzelm@14731:   inference. Records are no longer composed of nested field types, but
wenzelm@14731:   of nested extension types. Therefore the record type only grows
wenzelm@14731:   linear in the number of extensions and not in the number of fields.
wenzelm@14731:   The top-level (users) view on records is preserved.  Potential
wenzelm@14731:   INCOMPATIBILITY only in strange cases, where the theory depends on
wenzelm@14731:   the old record representation. The type generated for a record is
wenzelm@14731:   called <record_name>_ext_type.
wenzelm@14731: 
wenzelm@15022: * HOL/record: Reference record_quick_and_dirty_sensitive can be
wenzelm@15022:   enabled to skip the proofs triggered by a record definition or a
wenzelm@15022:   simproc (if quick_and_dirty is enabled). Definitions of large
wenzelm@15022:   records can take quite long.
wenzelm@15022: 
wenzelm@15022: * HOL/record: "record_upd_simproc" for simplification of multiple
wenzelm@15022:   record updates enabled by default.  Moreover, trivial updates are
wenzelm@15022:   also removed: r(|x := x r|) = r.  INCOMPATIBILITY: old proofs break
wenzelm@15022:   occasionally, since simplification is more powerful by default.
schirmer@15012: 
wenzelm@14878: * HOL: symbolic syntax of Hilbert Choice Operator is now as follows:
wenzelm@14878: 
wenzelm@14878:   syntax (epsilon)
wenzelm@14878:     "_Eps" :: "[pttrn, bool] => 'a"    ("(3\<some>_./ _)" [0, 10] 10)
wenzelm@14878: 
wenzelm@14878:   The symbol \<some> is displayed as the alternative epsilon of LaTeX
wenzelm@14878:   and x-symbol; use option '-m epsilon' to get it actually printed.
wenzelm@14878:   Moreover, the mathematically important symbolic identifier
wenzelm@14878:   \<epsilon> becomes available as variable, constant etc.
wenzelm@14878: 
nipkow@15361: * HOL: "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
wenzelm@15979:   Similarly for all quantifiers: "ALL x > y" etc.  The x-symbol for >=
wenzelm@15979:   is \<ge>.
wenzelm@15979: 
wenzelm@15979: * HOL/Set: "{x:A. P}" abbreviates "{x. x:A & P}" (and similarly for
wenzelm@15979:   "\<in>" instead of ":").
nipkow@15534: 
nipkow@15046: * HOL/SetInterval: The syntax for open intervals has changed:
nipkow@15046: 
nipkow@15046:   Old         New
nipkow@15046:   {..n(}   -> {..<n}
nipkow@15046:   {)n..}   -> {n<..}
nipkow@15046:   {m..n(}  -> {m..<n}
nipkow@15046:   {)m..n}  -> {m<..n}
nipkow@15046:   {)m..n(} -> {m<..<n}
nipkow@15046: 
nipkow@15046:   The old syntax is still supported but will disappear in the future.
nipkow@15046:   For conversion use the following emacs search and replace patterns:
nipkow@15046: 
nipkow@15046:   {)\([^\.]*\)\.\.  ->  {\1<\.\.}
nipkow@15046:   \.\.\([^(}]*\)(}  ->  \.\.<\1}
nipkow@15046: 
nipkow@15046:   They are not perfect but work quite well.
nipkow@15046: 
nipkow@15073: * HOL: The syntax for 'setsum', summation over finite sets, has changed:
nipkow@15073: 
nipkow@15073:   The syntax for 'setsum (%x. e) A' used to be '\<Sum>x:A. e'
nipkow@15073:   and is now either 'SUM x:A. e' or '\<Sum>x\<in>A. e'.
nipkow@15073: 
nipkow@15073:   There is new syntax for summation over finite sets:
nipkow@15046: 
nipkow@15050:   '\<Sum>x | P. e'    is the same as  'setsum (%x. e) {x. P}'
nipkow@15050:   '\<Sum>x=a..b. e'   is the same as  'setsum (%x. e) {a..b}'
nipkow@15050:   '\<Sum>x=a..<b. e'  is the same as  'setsum (%x. e) {a..<b}'
nipkow@15050:   '\<Sum>x<k. e'      is the same as  'setsum (%x. e) {..<k}'
nipkow@15046: 
nipkow@15046:   Function 'Summation' over nat is gone, its syntax '\<Sum>i<k. e'
nipkow@15046:   now translates into 'setsum' as above.
nipkow@15046: 
nipkow@15319: * HOL: Finite set induction: In Isar proofs, the insert case is now
nipkow@15319:   "case (insert x F)" instead of the old counterintuitive "case (insert F x)".
nipkow@15319: 
nipkow@15200: * HOL/Simplifier:
nipkow@15200: 
nipkow@15200:   - Is now set up to reason about transitivity chains involving "trancl"
nipkow@15200:   (r^+) and "rtrancl" (r^*) by setting up tactics provided by
nipkow@15200:   Provers/trancl.ML as additional solvers.  INCOMPATIBILITY: old proofs break
nipkow@15200:   occasionally as simplification may now solve more goals than previously.
nipkow@15200: 
nipkow@15200:   - Converts x <= y into x = y if assumption y <= x is present.  Works for
nipkow@15200:   all partial orders (class "order"), in particular numbers and sets. For
nipkow@15200:   linear orders (e.g. numbers) it treats ~ x < y just like y <= x.
wenzelm@15089: 
schirmer@15423:   - Simproc for "let x = a in f x"
schirmer@15423:   If a is a free or bound variable or a constant then the let is unfolded.
schirmer@15423:   Otherwise first a is simplified to a', and then f a' is simplified to
schirmer@15423:   g. If possible we abstract a' from g arriving at "let x = a' in g' x",
schirmer@15423:   otherwise we unfold the let and arrive at g. The simproc can be 
schirmer@15423:   enabled/disabled by the reference use_let_simproc. Potential
schirmer@15423:   INCOMPATIBILITY since simplification is more powerful by default.
webertj@15776: 
webertj@15776: * HOL: The 'refute' command has been extended to support a much larger
webertj@15776:   fragment of HOL, including axiomatic type classes, constdefs and typedefs,
webertj@15776:   inductive datatypes and recursion.
webertj@15776: 
wenzelm@14655: 
wenzelm@14682: *** HOLCF ***
wenzelm@14682: 
wenzelm@14682: * HOLCF: discontinued special version of 'constdefs' (which used to
wenzelm@14731:   support continuous functions) in favor of the general Pure one with
wenzelm@14731:   full type-inference.
wenzelm@14682: 
wenzelm@14682: 
paulson@14885: *** ZF ***
paulson@14885: 
wenzelm@15089: * ZF/ex/{Group,Ring}: examples in abstract algebra, including the
wenzelm@15089:   First Isomorphism Theorem (on quotienting by the kernel of a
wenzelm@15089:   homomorphism).
wenzelm@15089: 
wenzelm@15089: * ZF/Simplifier: install second copy of type solver that actually
wenzelm@15089:   makes use of TC rules declared to Isar proof contexts (or locales);
wenzelm@15089:   the old version is still required for ML proof scripts.
paulson@14885: 
paulson@14885: 
wenzelm@15703: *** System ***
wenzelm@15703: 
wenzelm@15852: * Allow symlinks to all proper Isabelle executables (Isabelle,
wenzelm@15852:   isabelle, isatool etc.).
wenzelm@15852: 
wenzelm@15852: * isabelle-process: Poly/ML no longer needs Perl to run an interactive
wenzelm@15852:   session.
wenzelm@15852: 
wenzelm@15852: * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
wenzelm@15852:   isatool doc, isatool mkdir, display_drafts etc.).
wenzelm@15703: 
wenzelm@15703: * isatool usedir: option -f allows specification of the ML file to be
wenzelm@15703:   used by Isabelle; default is ROOT.ML.
wenzelm@15703: 
wenzelm@15852: * HOL: isatool dimacs2hol converts files in DIMACS CNF format
wenzelm@15852:   (containing Boolean satisfiability problems) into Isabelle/HOL
wenzelm@15852:   theories.
wenzelm@15703: 
wenzelm@15703: 
wenzelm@15703: *** ML ***
wenzelm@15703: 
wenzelm@15973: * Pure/library.ML no longer defines its own option datatype, but uses
wenzelm@15973:   that of the SML basis, which has constructors NONE and SOME instead
wenzelm@15973:   of None and Some, as well as exception Option.Option instead of
wenzelm@15973:   OPTION.  The functions the, if_none, is_some, is_none have been
wenzelm@15973:   adapted accordingly, while Option.map replaces apsome.
wenzelm@15973: 
wenzelm@15973: * The exception LIST is no more, the standard exceptions Empty and
wenzelm@15973:   Subscript, as well as Library.UnequalLengths are used instead.  This
wenzelm@15973:   means that function like Library.hd and Library.tl are gone, as the
wenzelm@15973:   standard hd and tl functions suffice.
wenzelm@15973: 
wenzelm@15973:   A number of basic functions are now no longer exported to the ML
wenzelm@15973:   toplevel, as they are variants of standard functions.  The following
wenzelm@15973:   suggests how one can translate existing code:
wenzelm@15973: 
wenzelm@15973:     rev_append xs ys = List.revAppend (xs, ys)
wenzelm@15973:     nth_elem (i, xs) = List.nth (xs, i)
wenzelm@15973:     last_elem xs = List.last xs
wenzelm@15973:     flat xss = List.concat xss
wenzelm@15973:     seq fs = app fs
wenzelm@15973:     partition P xs = List.partition P xs
wenzelm@15973:     filter P xs = List.filter P xs
wenzelm@15973:     mapfilter f xs = List.mapPartial f xs
wenzelm@15973: 
wenzelm@15703: * Pure: output via the Isabelle channels of writeln/warning/error
wenzelm@15703:   etc. is now passed through Output.output, with a hook for arbitrary
wenzelm@15703:   transformations depending on the print_mode (cf. Output.add_mode --
wenzelm@15703:   the first active mode that provides a output function wins).
wenzelm@15703:   Already formatted output may be embedded into further text via
wenzelm@15703:   Output.raw; the result of Pretty.string_of/str_of and derived
wenzelm@15703:   functions (string_of_term/cterm/thm etc.) is already marked raw to
wenzelm@15703:   accommodate easy composition of diagnostic messages etc.
wenzelm@15703:   Programmers rarely need to care about Output.output or Output.raw at
wenzelm@15703:   all, with some notable exceptions: Output.output is required when
wenzelm@15703:   bypassing the standard channels (writeln etc.), or in token
wenzelm@15703:   translations to produce properly formatted results; Output.raw is
wenzelm@15703:   required when capturing already output material that will eventually
wenzelm@15703:   be presented to the user a second time.  For the default print mode,
wenzelm@15703:   both Output.output and Output.raw have no effect.
wenzelm@15703: 
wenzelm@15703: * Provers: Simplifier and Classical Reasoner now support proof context
wenzelm@15703:   dependent plug-ins (simprocs, solvers, wrappers etc.).  These extra
wenzelm@15703:   components are stored in the theory and patched into the
wenzelm@15703:   simpset/claset when used in an Isar proof context.  Context
wenzelm@15703:   dependent components are maintained by the following theory
wenzelm@15703:   operations:
wenzelm@15703: 
wenzelm@15703:     Simplifier.add_context_simprocs
wenzelm@15703:     Simplifier.del_context_simprocs
wenzelm@15703:     Simplifier.set_context_subgoaler
wenzelm@15703:     Simplifier.reset_context_subgoaler
wenzelm@15703:     Simplifier.add_context_looper
wenzelm@15703:     Simplifier.del_context_looper
wenzelm@15703:     Simplifier.add_context_unsafe_solver
wenzelm@15703:     Simplifier.add_context_safe_solver
wenzelm@15703: 
wenzelm@15703:     Classical.add_context_safe_wrapper
wenzelm@15703:     Classical.del_context_safe_wrapper
wenzelm@15703:     Classical.add_context_unsafe_wrapper
wenzelm@15703:     Classical.del_context_unsafe_wrapper
wenzelm@15703: 
wenzelm@15703:   IMPORTANT NOTE: proof tools (methods etc.) need to use
wenzelm@15703:   local_simpset_of and local_claset_of to instead of the primitive
wenzelm@15703:   Simplifier.get_local_simpset and Classical.get_local_claset,
wenzelm@15703:   respectively, in order to see the context dependent fields!
wenzelm@15703: 
wenzelm@15703: 
wenzelm@14655: 
wenzelm@14606: New in Isabelle2004 (April 2004)
wenzelm@14606: --------------------------------
wenzelm@13280: 
skalberg@14171: *** General ***
skalberg@14171: 
ballarin@14398: * Provers/order.ML:  new efficient reasoner for partial and linear orders.
ballarin@14398:   Replaces linorder.ML.
ballarin@14398: 
wenzelm@14606: * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
wenzelm@14606:   (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
skalberg@14173:   (\<a>...\<z>), are now considered normal letters, and can therefore
skalberg@14173:   be used anywhere where an ASCII letter (a...zA...Z) has until
skalberg@14173:   now. COMPATIBILITY: This obviously changes the parsing of some
skalberg@14173:   terms, especially where a symbol has been used as a binder, say
skalberg@14173:   '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
skalberg@14173:   as an identifier.  Fix it by inserting a space around former
skalberg@14173:   symbols.  Call 'isatool fixgreek' to try to fix parsing errors in
skalberg@14173:   existing theory and ML files.
skalberg@14171: 
paulson@14237: * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
paulson@14237: 
wenzelm@14731: * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
wenzelm@14731:   allowed in identifiers. Similar to Greek letters \<^isub> is now considered
wenzelm@14731:   a normal (but invisible) letter. For multiple letter subscripts repeat
wenzelm@14731:   \<^isub> like this: x\<^isub>1\<^isub>2.
kleing@14233: 
kleing@14333: * Pure: There are now sub-/superscripts that can span more than one
kleing@14333:   character. Text between \<^bsub> and \<^esub> is set in subscript in
wenzelm@14606:   ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
wenzelm@14606:   superscript. The new control characters are not identifier parts.
kleing@14333: 
schirmer@14561: * Pure: Control-symbols of the form \<^raw:...> will literally print the
wenzelm@14606:   content of "..." to the latex file instead of \isacntrl... . The "..."
wenzelm@14606:   may consist of any printable characters excluding the end bracket >.
schirmer@14361: 
paulson@14237: * Pure: Using new Isar command "finalconsts" (or the ML functions
paulson@14237:   Theory.add_finals or Theory.add_finals_i) it is now possible to
paulson@14237:   declare constants "final", which prevents their being given a definition
paulson@14237:   later.  It is useful for constants whose behaviour is fixed axiomatically
skalberg@14224:   rather than definitionally, such as the meta-logic connectives.
skalberg@14224: 
wenzelm@14606: * Pure: 'instance' now handles general arities with general sorts
wenzelm@14606:   (i.e. intersections of classes),
skalberg@14503: 
kleing@14547: * Presentation: generated HTML now uses a CSS style sheet to make layout
wenzelm@14731:   (somewhat) independent of content. It is copied from lib/html/isabelle.css.
kleing@14547:   It can be changed to alter the colors/layout of generated pages.
kleing@14547: 
wenzelm@14556: 
ballarin@14175: *** Isar ***
ballarin@14175: 
ballarin@14508: * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
ballarin@14508:   cut_tac, subgoal_tac and thin_tac:
ballarin@14175:   - Now understand static (Isar) contexts.  As a consequence, users of Isar
ballarin@14175:     locales are no longer forced to write Isar proof scripts.
ballarin@14175:     For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
ballarin@14175:     emulations.
ballarin@14175:   - INCOMPATIBILITY: names of variables to be instantiated may no
ballarin@14211:     longer be enclosed in quotes.  Instead, precede variable name with `?'.
ballarin@14211:     This is consistent with the instantiation attribute "where".
ballarin@14211: 
ballarin@14257: * Attributes "where" and "of":
ballarin@14285:   - Now take type variables of instantiated theorem into account when reading
ballarin@14285:     the instantiation string.  This fixes a bug that caused instantiated
ballarin@14285:     theorems to have too special types in some circumstances.
ballarin@14285:   - "where" permits explicit instantiations of type variables.
ballarin@14257: 
wenzelm@14556: * Calculation commands "moreover" and "also" no longer interfere with
wenzelm@14556:   current facts ("this"), admitting arbitrary combinations with "then"
wenzelm@14556:   and derived forms.
kleing@14283: 
ballarin@14211: * Locales:
ballarin@14211:   - Goal statements involving the context element "includes" no longer
ballarin@14211:     generate theorems with internal delta predicates (those ending on
ballarin@14211:     "_axioms") in the premise.
ballarin@14211:     Resolve particular premise with <locale>.intro to obtain old form.
ballarin@14211:   - Fixed bug in type inference ("unify_frozen") that prevented mix of target
ballarin@14211:     specification and "includes" elements in goal statement.
ballarin@14254:   - Rule sets <locale>.intro and <locale>.axioms no longer declared as
ballarin@14254:     [intro?] and [elim?] (respectively) by default.
ballarin@14508:   - Experimental command for instantiation of locales in proof contexts:
ballarin@14551:         instantiate <label>[<attrs>]: <loc>
ballarin@14508:     Instantiates locale <loc> and adds all its theorems to the current context
ballarin@14551:     taking into account their attributes.  Label and attrs are optional
ballarin@14551:     modifiers, like in theorem declarations.  If present, names of
ballarin@14551:     instantiated theorems are qualified with <label>, and the attributes
ballarin@14551:     <attrs> are applied after any attributes these theorems might have already.
ballarin@14551:       If the locale has assumptions, a chained fact of the form
ballarin@14508:     "<loc> t1 ... tn" is expected from which instantiations of the parameters
ballarin@14551:     are derived.  The command does not support old-style locales declared
ballarin@14551:     with "locale (open)".
ballarin@14551:       A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
ballarin@14175: 
ballarin@14175: * HOL: Tactic emulation methods induct_tac and case_tac understand static
ballarin@14175:   (Isar) contexts.
ballarin@14175: 
wenzelm@14556: 
kleing@14136: *** HOL ***
kleing@14136: 
kleing@14624: * Proof import: new image HOL4 contains the imported library from
kleing@14624:   the HOL4 system with about 2500 theorems. It is imported by
kleing@14624:   replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
kleing@14624:   can be used like any other Isabelle image.  See
kleing@14624:   HOL/Import/HOL/README for more information.
kleing@14624: 
ballarin@14398: * Simplifier:
ballarin@14398:   - Much improved handling of linear and partial orders.
ballarin@14398:     Reasoners for linear and partial orders are set up for type classes
ballarin@14398:     "linorder" and "order" respectively, and are added to the default simpset
ballarin@14398:     as solvers.  This means that the simplifier can build transitivity chains
ballarin@14398:     to solve goals from the assumptions.
ballarin@14398:   - INCOMPATIBILITY: old proofs break occasionally.  Typically, applications
ballarin@14398:     of blast or auto after simplification become unnecessary because the goal
ballarin@14398:     is solved by simplification already.
ballarin@14398: 
wenzelm@14731: * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
paulson@14389:     all proved in axiomatic type classes for semirings, rings and fields.
paulson@14389: 
paulson@14389: * Numerics:
paulson@14389:   - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
wenzelm@14731:     now formalized using the Ring_and_Field theory mentioned above.
paulson@14389:   - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
paulson@14389:     than before, because now they are set up once in a generic manner.
wenzelm@14731:   - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
paulson@14480:     Look for the general versions in Ring_and_Field (and Power if they concern
paulson@14480:     exponentiation).
paulson@14389: 
paulson@14401: * Type "rat" of the rational numbers is now available in HOL-Complex.
paulson@14389: 
schirmer@14255: * Records:
schirmer@14255:   - Record types are now by default printed with their type abbreviation
schirmer@14255:     instead of the list of all field types. This can be configured via
schirmer@14255:     the reference "print_record_type_abbr".
wenzelm@14731:   - Simproc "record_upd_simproc" for simplification of multiple updates added
schirmer@14255:     (not enabled by default).
schirmer@14427:   - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
schirmer@14427:     EX x. x = sel r to True (not enabled by default).
schirmer@14255:   - Tactic "record_split_simp_tac" to split and simplify records added.
wenzelm@14731: 
kleing@14136: * 'specification' command added, allowing for definition by
skalberg@14224:   specification.  There is also an 'ax_specification' command that
skalberg@14224:   introduces the new constants axiomatically.
kleing@14136: 
nipkow@14375: * arith(_tac) is now able to generate counterexamples for reals as well.
nipkow@14375: 
ballarin@14399: * HOL-Algebra: new locale "ring" for non-commutative rings.
ballarin@14399: 
paulson@14243: * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
kleing@14610:   definitions, thanks to Sava Krsti\'{c} and John Matthews.
kleing@14610: 
wenzelm@14731: * HOL-Matrix: a first theory for matrices in HOL with an application of
kleing@14610:   matrix theory to linear programming.
kleing@14136: 
nipkow@14380: * Unions and Intersections:
nipkow@15119:   The latex output syntax of UN and INT has been changed
nipkow@15119:   from "\Union x \in A. B" to "\Union_{x \in A} B"
nipkow@15119:   i.e. the index formulae has become a subscript.
nipkow@15119:   Similarly for "\Union x. B", and for \Inter instead of \Union.
nipkow@14380: 
kleing@14418: * Unions and Intersections over Intervals:
wenzelm@14731:   There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
wenzelm@14731:   also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
kleing@14418:   like in normal math, and corresponding versions for < and for intersection.
kleing@14418: 
nipkow@15677: * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
nipkow@15677:   lexicographic dictonary ordering has been added as "lexord".
nipkow@15677: 
paulson@14401: * ML: the legacy theory structures Int and List have been removed. They had
paulson@14401:   conflicted with ML Basis Library structures having the same names.
nipkow@14380: 
webertj@14464: * 'refute' command added to search for (finite) countermodels.  Only works
webertj@14464:   for a fragment of HOL.  The installation of an external SAT solver is
webertj@14464:   highly recommended.  See "HOL/Refute.thy" for details.
webertj@14464: 
berghofe@14602: * 'quickcheck' command: Allows to find counterexamples by evaluating
berghofe@14602:   formulae under an assignment of free variables to random values.
berghofe@14602:   In contrast to 'refute', it can deal with inductive datatypes,
berghofe@14602:   but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
berghofe@14602:   for examples.
webertj@14464: 
wenzelm@14606: 
oheimb@14536: *** HOLCF ***
oheimb@14536: 
oheimb@14536: * Streams now come with concatenation and are part of the HOLCF image
oheimb@14536: 
wenzelm@14572: 
wenzelm@14572: 
kleing@14136: New in Isabelle2003 (May 2003)
wenzelm@14606: ------------------------------
kleing@14136: 
wenzelm@13280: *** General ***
wenzelm@13280: 
berghofe@13618: * Provers/simplifier:
berghofe@13618: 
nipkow@13781:   - Completely reimplemented method simp (ML: Asm_full_simp_tac):
berghofe@13618:     Assumptions are now subject to complete mutual simplification,
berghofe@13618:     not just from left to right. The simplifier now preserves
berghofe@13618:     the order of assumptions.
berghofe@13618: 
berghofe@13618:     Potential INCOMPATIBILITY:
berghofe@13618: 
nipkow@13781:     -- simp sometimes diverges where the old version did
nipkow@13781:        not, e.g. invoking simp on the goal
berghofe@13618: 
berghofe@13618:         [| P (f x); y = x; f x = f y |] ==> Q
berghofe@13618: 
nipkow@13781:        now gives rise to the infinite reduction sequence
nipkow@13781: 
nipkow@13781:         P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
nipkow@13781: 
nipkow@13781:        Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
nipkow@13781:        kind of problem.
nipkow@13781: 
nipkow@13781:     -- Tactics combining classical reasoner and simplification (such as auto)
nipkow@13781:        are also affected by this change, because many of them rely on
nipkow@13781:        simp. They may sometimes diverge as well or yield a different numbers
nipkow@13781:        of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
nipkow@13781:        in case of problems. Sometimes subsequent calls to the classical
nipkow@13781:        reasoner will fail because a preceeding call to the simplifier too
nipkow@13781:        eagerly simplified the goal, e.g. deleted redundant premises.
berghofe@13618: 
berghofe@13618:   - The simplifier trace now shows the names of the applied rewrite rules
berghofe@13618: 
nipkow@13829:   - You can limit the number of recursive invocations of the simplifier
nipkow@13829:     during conditional rewriting (where the simplifie tries to solve the
nipkow@13829:     conditions before applying the rewrite rule):
nipkow@13829:     ML "simp_depth_limit := n"
nipkow@13829:     where n is an integer. Thus you can force termination where previously
nipkow@13829:     the simplifier would diverge.
nipkow@13829: 
ballarin@13835:   - Accepts free variables as head terms in congruence rules.  Useful in Isar.
nipkow@13829: 
ballarin@13938:   - No longer aborts on failed congruence proof.  Instead, the
ballarin@13938:     congruence is ignored.
ballarin@13938: 
berghofe@14008: * Pure: New generic framework for extracting programs from constructive
berghofe@14008:   proofs. See HOL/Extraction.thy for an example instantiation, as well
berghofe@14008:   as HOL/Extraction for some case studies.
berghofe@14008: 
nipkow@13868: * Pure: The main goal of the proof state is no longer shown by default, only
nipkow@13868: the subgoals. This behaviour is controlled by a new flag.
ballarin@13835:    PG menu: Isabelle/Isar -> Settings -> Show Main Goal
nipkow@13815: (ML: Proof.show_main_goal).
nipkow@13815: 
nipkow@13815: * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
nipkow@13815: rules whose conclusion matches subgoal 1:
nipkow@13815:       PG menu: Isabelle/Isar -> Show me -> matching rules
nipkow@13815: The rules are ordered by how closely they match the subgoal.
nipkow@13815: In particular, rules that solve a subgoal outright are displayed first
nipkow@13815: (or rather last, the way they are printed).
nipkow@13815: (ML: ProofGeneral.print_intros())
nipkow@13815: 
nipkow@13815: * Pure: New flag trace_unify_fail causes unification to print
nipkow@13781: diagnostic information (PG: in trace buffer) when it fails. This is
nipkow@13781: useful for figuring out why single step proofs like rule, erule or
nipkow@13781: assumption failed.
nipkow@13781: 
nipkow@13815: * Pure: Locale specifications now produce predicate definitions
wenzelm@13410: according to the body of text (covering assumptions modulo local
wenzelm@13410: definitions); predicate "loc_axioms" covers newly introduced text,
wenzelm@13410: while "loc" is cumulative wrt. all included locale expressions; the
wenzelm@13410: latter view is presented only on export into the global theory
wenzelm@13410: context; potential INCOMPATIBILITY, use "(open)" option to fall back
wenzelm@13410: on the old view without predicates;
wenzelm@13410: 
wenzelm@13459: * Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm@13459: parameters (as in CASL, for example); just specify something like
wenzelm@13459: ``var x + var y + struct M'' as import;
wenzelm@13459: 
wenzelm@13463: * Pure: improved thms_containing: proper indexing of facts instead of
wenzelm@13463: raw theorems; check validity of results wrt. current name space;
wenzelm@13463: include local facts of proof configuration (also covers active
wenzelm@13541: locales), cover fixed variables in index; may use "_" in term
wenzelm@13541: specification; an optional limit for the number of printed facts may
wenzelm@13541: be given (the default is 40);
wenzelm@13541: 
wenzelm@13541: * Pure: disallow duplicate fact bindings within new-style theory files
wenzelm@13541: (batch-mode only);
wenzelm@13540: 
wenzelm@13463: * Provers: improved induct method: assumptions introduced by case
wenzelm@13463: "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
wenzelm@13463: the goal statement); "foo" still refers to all facts collectively;
wenzelm@13463: 
paulson@13550: * Provers: the function blast.overloaded has been removed: all constants
paulson@13550: are regarded as potentially overloaded, which improves robustness in exchange
paulson@13550: for slight decrease in efficiency;
paulson@13550: 
nipkow@13781: * Provers/linorder: New generic prover for transitivity reasoning over
nipkow@13781: linear orders.  Note: this prover is not efficient!
nipkow@13781: 
wenzelm@13522: * Isar: preview of problems to finish 'show' now produce an error
wenzelm@13522: rather than just a warning (in interactive mode);
wenzelm@13522: 
wenzelm@13280: 
nipkow@13158: *** HOL ***
nipkow@13158: 
nipkow@13899: * arith(_tac)
nipkow@13899: 
nipkow@13899:  - Produces a counter example if it cannot prove a goal.
nipkow@13899:    Note that the counter example may be spurious if the goal is not a formula
nipkow@13899:    of quantifier-free linear arithmetic.
nipkow@13899:    In ProofGeneral the counter example appears in the trace buffer.
nipkow@13899: 
nipkow@13899:  - Knows about div k and mod k where k is a numeral of type nat or int.
nipkow@13899: 
nipkow@13899:  - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
nipkow@13899:    linear arithmetic fails. This takes account of quantifiers and divisibility.
wenzelm@14731:    Presburger arithmetic can also be called explicitly via presburger(_tac).
nipkow@13899: 
nipkow@13899: * simp's arithmetic capabilities have been enhanced a bit: it now
nipkow@13899: takes ~= in premises into account (by performing a case split);
nipkow@13899: 
nipkow@13899: * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
nipkow@13899: are distributed over a sum of terms;
nipkow@13899: 
ballarin@13735: * New tactic "trans_tac" and method "trans" instantiate
ballarin@13735: Provers/linorder.ML for axclasses "order" and "linorder" (predicates
wenzelm@14731: "<=", "<" and "=").
wenzelm@14731: 
wenzelm@14731: * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
paulson@13587: HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
paulson@13587: 
wenzelm@13443: * 'typedef' command has new option "open" to suppress the set
wenzelm@13443: definition;
wenzelm@13443: 
wenzelm@13522: * functions Min and Max on finite sets have been introduced (theory
wenzelm@13522: Finite_Set);
nipkow@13492: 
wenzelm@13443: * attribute [symmetric] now works for relations as well; it turns
wenzelm@13443: (x,y) : R^-1 into (y,x) : R, and vice versa;
wenzelm@13443: 
nipkow@13613: * induct over a !!-quantified statement (say !!x1..xn):
nipkow@13613:   each "case" automatically performs "fix x1 .. xn" with exactly those names.
nipkow@13613: 
nipkow@13899: * Map: `empty' is no longer a constant but a syntactic abbreviation for
nipkow@13899: %x. None. Warning: empty_def now refers to the previously hidden definition
nipkow@13899: of the empty set.
nipkow@13899: 
ballarin@14018: * Algebra: formalization of classical algebra.  Intended as base for
ballarin@14018: any algebraic development in Isabelle.  Currently covers group theory
ballarin@14018: (up to Sylow's theorem) and ring theory (Universal Property of
ballarin@14018: Univariate Polynomials).  Contributions welcome;
paulson@13960: 
paulson@13960: * GroupTheory: deleted, since its material has been moved to Algebra;
paulson@13960: 
wenzelm@14731: * Complex: new directory of the complex numbers with numeric constants,
wenzelm@14731: nonstandard complex numbers, and some complex analysis, standard and
paulson@13966: nonstandard (Jacques Fleuriot);
paulson@13966: 
paulson@13966: * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
paulson@13966: 
wenzelm@14731: * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
paulson@13966: Fleuriot);
paulson@13960: 
wenzelm@13549: * Real/HahnBanach: updated and adapted to locales;
wenzelm@13549: 
ballarin@13995: * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
ballarin@13995: Gray and Kramer);
paulson@13872: 
paulson@13872: * UNITY: added the Meier-Sanders theory of progress sets;
paulson@13872: 
kleing@14011: * MicroJava: bytecode verifier and lightweight bytecode verifier
kleing@14011: as abstract algorithms, instantiated to the JVM;
kleing@14011: 
schirmer@14010: * Bali: Java source language formalization. Type system, operational
schirmer@14010: semantics, axiomatic semantics. Supported language features:
schirmer@14010: classes, interfaces, objects,virtual methods, static methods,
schirmer@14010: static/instance fields, arrays, access modifiers, definite
schirmer@14010: assignment, exceptions.
wenzelm@13549: 
kleing@14011: 
wenzelm@13549: *** ZF ***
wenzelm@13549: 
webertj@15154: * ZF/Constructible: consistency proof for AC (Gdel's constructible
wenzelm@13549: universe, etc.);
wenzelm@13549: 
paulson@13872: * Main ZF: virtually all theories converted to new-style format;
nipkow@13518: 
wenzelm@13280: 
wenzelm@13478: *** ML ***
wenzelm@13478: 
wenzelm@13478: * Pure: Tactic.prove provides sane interface for internal proofs;
wenzelm@13478: omits the infamous "standard" operation, so this is more appropriate
wenzelm@13478: than prove_goalw_cterm in many situations (e.g. in simprocs);
wenzelm@13478: 
wenzelm@13478: * Pure: improved error reporting of simprocs;
wenzelm@13478: 
wenzelm@13478: * Provers: Simplifier.simproc(_i) provides sane interface for setting
wenzelm@13478: up simprocs;
wenzelm@13478: 
wenzelm@13478: 
kleing@13953: *** Document preparation ***
kleing@13953: 
kleing@13953: * uses \par instead of \\ for line breaks in theory text. This may
kleing@13953: shift some page breaks in large documents. To get the old behaviour
kleing@13953: use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
kleing@13953: 
wenzelm@14731: * minimized dependencies of isabelle.sty and isabellesym.sty on
kleing@13953: other packages
kleing@13953: 
kleing@13953: * \<euro> now needs package babel/greek instead of marvosym (which
kleing@13953: broke \Rightarrow)
kleing@13953: 
wenzelm@14731: * normal size for \<zero>...\<nine> (uses \mathbf instead of
kleing@13954: textcomp package)
kleing@13953: 
wenzelm@13280: 
wenzelm@14572: 
wenzelm@12984: New in Isabelle2002 (March 2002)
wenzelm@12984: --------------------------------
wenzelm@11474: 
wenzelm@11572: *** Document preparation ***
wenzelm@11572: 
wenzelm@11842: * greatly simplified document preparation setup, including more
wenzelm@11842: graceful interpretation of isatool usedir -i/-d/-D options, and more
wenzelm@11842: instructive isatool mkdir; users should basically be able to get
wenzelm@12899: started with "isatool mkdir HOL Test && isatool make"; alternatively,
wenzelm@12899: users may run a separate document processing stage manually like this:
wenzelm@12899: "isatool usedir -D output HOL Test && isatool document Test/output";
wenzelm@11842: 
wenzelm@11842: * theory dependency graph may now be incorporated into documents;
wenzelm@11842: isatool usedir -g true will produce session_graph.eps/.pdf for use
wenzelm@11842: with \includegraphics of LaTeX;
wenzelm@11842: 
wenzelm@11864: * proper spacing of consecutive markup elements, especially text
wenzelm@11864: blocks after section headings;
wenzelm@11864: 
wenzelm@11572: * support bold style (for single symbols only), input syntax is like
wenzelm@11572: this: "\<^bold>\<alpha>" or "\<^bold>A";
wenzelm@11572: 
wenzelm@11814: * \<bullet> is now output as bold \cdot by default, which looks much
wenzelm@11572: better in printed text;
wenzelm@11572: 
wenzelm@11712: * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm@11712: note that these symbols are currently unavailable in Proof General /
wenzelm@12769: X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
wenzelm@12690: 
wenzelm@12690: * isatool latex no longer depends on changed TEXINPUTS, instead
wenzelm@12690: isatool document copies the Isabelle style files to the target
wenzelm@12690: location;
wenzelm@11712: 
wenzelm@11572: 
wenzelm@11633: *** Isar ***
wenzelm@11633: 
wenzelm@12312: * Pure/Provers: improved proof by cases and induction;
wenzelm@12280:   - 'case' command admits impromptu naming of parameters (such as
wenzelm@12280:     "case (Suc n)");
wenzelm@12280:   - 'induct' method divinates rule instantiation from the inductive
wenzelm@12280:     claim; no longer requires excessive ?P bindings for proper
wenzelm@12280:     instantiation of cases;
wenzelm@12280:   - 'induct' method properly enumerates all possibilities of set/type
wenzelm@12280:     rules; as a consequence facts may be also passed through *type*
wenzelm@12280:     rules without further ado;
wenzelm@12280:   - 'induct' method now derives symbolic cases from the *rulified*
wenzelm@12280:     rule (before it used to rulify cases stemming from the internal
wenzelm@12280:     atomized version); this means that the context of a non-atomic
wenzelm@12280:     statement becomes is included in the hypothesis, avoiding the
wenzelm@12280:     slightly cumbersome show "PROP ?case" form;
wenzelm@12280:   - 'induct' may now use elim-style induction rules without chaining
wenzelm@12280:     facts, using ``missing'' premises from the goal state; this allows
wenzelm@12280:     rules stemming from inductive sets to be applied in unstructured
wenzelm@12280:     scripts, while still benefitting from proper handling of non-atomic
wenzelm@12280:     statements; NB: major inductive premises need to be put first, all
wenzelm@12280:     the rest of the goal is passed through the induction;
wenzelm@12280:   - 'induct' proper support for mutual induction involving non-atomic
wenzelm@12280:     rule statements (uses the new concept of simultaneous goals, see
wenzelm@12280:     below);
wenzelm@12853:   - append all possible rule selections, but only use the first
wenzelm@12853:     success (no backtracking);
wenzelm@11995:   - removed obsolete "(simplified)" and "(stripped)" options of methods;
wenzelm@12754:   - undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm@12754:   - added 'print_induct_rules' (covered by help item in recent Proof
wenzelm@12754:     General versions);
wenzelm@11995:   - moved induct/cases attributes to Pure, methods to Provers;
wenzelm@11995:   - generic method setup instantiated for FOL and HOL;
wenzelm@11986: 
wenzelm@12163: * Pure: support multiple simultaneous goal statements, for example
wenzelm@12163: "have a: A and b: B" (same for 'theorem' etc.); being a pure
wenzelm@12163: meta-level mechanism, this acts as if several individual goals had
wenzelm@12163: been stated separately; in particular common proof methods need to be
wenzelm@12163: repeated in order to cover all claims; note that a single elimination
wenzelm@12163: step is *not* sufficient to establish the two conjunctions, so this
wenzelm@12163: fails:
wenzelm@12163: 
wenzelm@12163:   assume "A & B" then have A and B ..   (*".." fails*)
wenzelm@12163: 
wenzelm@12163: better use "obtain" in situations as above; alternative refer to
wenzelm@12163: multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
wenzelm@12163: 
wenzelm@12078: * Pure: proper integration with ``locales''; unlike the original
webertj@15154: version by Florian Kammller, Isar locales package high-level proof
wenzelm@12078: contexts rather than raw logical ones (e.g. we admit to include
wenzelm@12280: attributes everywhere); operations on locales include merge and
wenzelm@12964: rename; support for implicit arguments (``structures''); simultaneous
wenzelm@12964: type-inference over imports and text; see also HOL/ex/Locales.thy for
wenzelm@12964: some examples;
wenzelm@12078: 
wenzelm@12707: * Pure: the following commands have been ``localized'', supporting a
wenzelm@12707: target locale specification "(in name)": 'lemma', 'theorem',
wenzelm@12707: 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
wenzelm@12707: stored both within the locale and at the theory level (exported and
wenzelm@12707: qualified by the locale name);
wenzelm@12707: 
wenzelm@12964: * Pure: theory goals may now be specified in ``long'' form, with
wenzelm@12964: ad-hoc contexts consisting of arbitrary locale elements. for example
wenzelm@12964: ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
wenzelm@12964: definitions may be given, too); the result is a meta-level rule with
wenzelm@12964: the context elements being discharged in the obvious way;
wenzelm@12964: 
wenzelm@12964: * Pure: new proof command 'using' allows to augment currently used
wenzelm@12964: facts after a goal statement ('using' is syntactically analogous to
wenzelm@12964: 'apply', but acts on the goal's facts only); this allows chained facts
wenzelm@12964: to be separated into parts given before and after a claim, as in
wenzelm@12964: ``from a and b have C using d and e <proof>'';
wenzelm@12078: 
wenzelm@11722: * Pure: renamed "antecedent" case to "rule_context";
wenzelm@11722: 
wenzelm@12964: * Pure: new 'judgment' command records explicit information about the
wenzelm@12964: object-logic embedding (used by several tools internally); no longer
wenzelm@12964: use hard-wired "Trueprop";
wenzelm@12964: 
wenzelm@11738: * Pure: added 'corollary' command;
wenzelm@11738: 
wenzelm@11722: * Pure: fixed 'token_translation' command;
wenzelm@11722: 
wenzelm@11899: * Pure: removed obsolete 'exported' attribute;
wenzelm@11899: 
wenzelm@11933: * Pure: dummy pattern "_" in is/let is now automatically lifted over
wenzelm@11933: bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
wenzelm@11899: supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
wenzelm@11899: 
wenzelm@11952: * Pure: method 'atomize' presents local goal premises as object-level
wenzelm@11952: statements (atomic meta-level propositions); setup controlled via
wenzelm@11952: rewrite rules declarations of 'atomize' attribute; example
wenzelm@11952: application: 'induct' method with proper rule statements in improper
wenzelm@11952: proof *scripts*;
wenzelm@11952: 
wenzelm@12106: * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
wenzelm@12106: now consider the syntactic context of assumptions, giving a better
wenzelm@12106: chance to get type-inference of the arguments right (this is
wenzelm@12106: especially important for locales);
wenzelm@12106: 
wenzelm@12312: * Pure: "sorry" no longer requires quick_and_dirty in interactive
wenzelm@12312: mode;
wenzelm@12312: 
wenzelm@12405: * Pure/obtain: the formal conclusion "thesis", being marked as
wenzelm@12405: ``internal'', may no longer be reference directly in the text;
wenzelm@12405: potential INCOMPATIBILITY, may need to use "?thesis" in rare
wenzelm@12405: situations;
wenzelm@12405: 
wenzelm@12405: * Pure: generic 'sym' attribute which declares a rule both as pure
wenzelm@12405: 'elim?' and for the 'symmetric' operation;
wenzelm@12405: 
wenzelm@12877: * Pure: marginal comments ``--'' may now occur just anywhere in the
wenzelm@12877: text; the fixed correlation with particular command syntax has been
wenzelm@12877: discontinued;
wenzelm@12877: 
berghofe@13023: * Pure: new method 'rules' is particularly well-suited for proof
berghofe@13023: search in intuitionistic logic; a bit slower than 'blast' or 'fast',
berghofe@13023: but often produces more compact proof terms with less detours;
berghofe@13023: 
wenzelm@12364: * Pure/Provers/classical: simplified integration with pure rule
wenzelm@12364: attributes and methods; the classical "intro?/elim?/dest?"
wenzelm@12364: declarations coincide with the pure ones; the "rule" method no longer
wenzelm@12364: includes classically swapped intros; "intro" and "elim" methods no
wenzelm@12364: longer pick rules from the context; also got rid of ML declarations
wenzelm@12364: AddXIs/AddXEs/AddXDs; all of this has some potential for
wenzelm@12364: INCOMPATIBILITY;
wenzelm@12364: 
wenzelm@12405: * Provers/classical: attribute 'swapped' produces classical inversions
wenzelm@12405: of introduction rules;
wenzelm@12405: 
wenzelm@12364: * Provers/simplifier: 'simplified' attribute may refer to explicit
wenzelm@12364: rules instead of full simplifier context; 'iff' attribute handles
wenzelm@12364: conditional rules;
wenzelm@11936: 
wenzelm@11745: * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm@11745: 
wenzelm@11690: * HOL: 'recdef' now fails on unfinished automated proofs, use
wenzelm@11633: "(permissive)" option to recover old behavior;
wenzelm@11633: 
wenzelm@11933: * HOL: 'inductive' no longer features separate (collective) attributes
wenzelm@11933: for 'intros' (was found too confusing);
wenzelm@11933: 
wenzelm@12405: * HOL: properly declared induction rules less_induct and
wenzelm@12405: wf_induct_rule;
wenzelm@12405: 
kleing@11788: 
wenzelm@11474: *** HOL ***
wenzelm@11474: 
wenzelm@11702: * HOL: moved over to sane numeral syntax; the new policy is as
wenzelm@11702: follows:
wenzelm@11702: 
wenzelm@11702:   - 0 and 1 are polymorphic constants, which are defined on any
wenzelm@11702:   numeric type (nat, int, real etc.);
wenzelm@11702: 
wenzelm@11702:   - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
wenzelm@11702:   binary representation internally;
wenzelm@11702: 
wenzelm@11702:   - type nat has special constructor Suc, and generally prefers Suc 0
wenzelm@11702:   over 1::nat and Suc (Suc 0) over 2::nat;
wenzelm@11702: 
wenzelm@12364: This change may cause significant problems of INCOMPATIBILITY; here
wenzelm@12364: are some hints on converting existing sources:
wenzelm@11702: 
wenzelm@11702:   - due to the new "num" token, "-0" and "-1" etc. are now atomic
wenzelm@11702:   entities, so expressions involving "-" (unary or binary minus) need
wenzelm@11702:   to be spaced properly;
wenzelm@11702: 
wenzelm@11702:   - existing occurrences of "1" may need to be constraint "1::nat" or
wenzelm@11702:   even replaced by Suc 0; similar for old "2";
wenzelm@11702: 
wenzelm@11702:   - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
wenzelm@11702: 
wenzelm@11702:   - remove all special provisions on numerals in proofs;
wenzelm@11702: 
wenzelm@13042: * HOL: simp rules nat_number expand numerals on nat to Suc/0
wenzelm@12837: representation (depends on bin_arith_simps in the default context);
wenzelm@12837: 
wenzelm@12736: * HOL: symbolic syntax for x^2 (numeral 2);
wenzelm@12736: 
wenzelm@12335: * HOL: the class of all HOL types is now called "type" rather than
wenzelm@12335: "term"; INCOMPATIBILITY, need to adapt references to this type class
wenzelm@12335: in axclass/classes, instance/arities, and (usually rare) occurrences
wenzelm@12335: in typings (of consts etc.); internally the class is called
wenzelm@12335: "HOL.type", ML programs should refer to HOLogic.typeS;
wenzelm@12335: 
wenzelm@12280: * HOL/record package improvements:
wenzelm@12280:   - new derived operations "fields" to build a partial record section,
wenzelm@12280:     "extend" to promote a fixed record to a record scheme, and
wenzelm@12280:     "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
wenzelm@12280:     declared as simp by default;
wenzelm@12587:   - shared operations ("more", "fields", etc.) now need to be always
wenzelm@12587:     qualified) --- potential INCOMPATIBILITY;
wenzelm@12280:   - removed "make_scheme" operations (use "make" with "extend") --
wenzelm@12280:     INCOMPATIBILITY;
wenzelm@11937:   - removed "more" class (simply use "term") -- INCOMPATIBILITY;
wenzelm@12253:   - provides cases/induct rules for use with corresponding Isar
wenzelm@12253:     methods (for concrete records, record schemes, concrete more
wenzelm@12280:     parts, and schematic more parts -- in that order);
wenzelm@11930:   - internal definitions directly based on a light-weight abstract
wenzelm@11930:     theory of product types over typedef rather than datatype;
wenzelm@11930: 
berghofe@13023: * HOL: generic code generator for generating executable ML code from
berghofe@13023: specifications; specific support for HOL constructs such as inductive
berghofe@13023: datatypes and sets, as well as recursive functions; can be invoked
berghofe@13023: via 'generate_code' theory section;
berghofe@13023: 
wenzelm@11933: * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
wenzelm@11933: 
paulson@13824: * HOL: consolidated and renamed several theories.  In particular:
wenzelm@14731:         Ord.thy has been absorbed into HOL.thy
wenzelm@14731:         String.thy has been absorbed into List.thy
wenzelm@14731: 
wenzelm@11802: * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm@11802: (beware of argument permutation!);
wenzelm@11802: 
wenzelm@11657: * HOL: linorder_less_split superseded by linorder_cases;
wenzelm@11657: 
wenzelm@12917: * HOL/List: "nodups" renamed to "distinct";
nipkow@12889: 
wenzelm@11633: * HOL: added "The" definite description operator; move Hilbert's "Eps"
paulson@13824: to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
paulson@13824:   - Ex_def has changed, now need to use some_eq_ex
wenzelm@11437: 
wenzelm@11572: * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
wenzelm@11572: in this (rare) case use:
wenzelm@11572: 
wenzelm@11572:   delSWrapper "split_all_tac"
wenzelm@11572:   addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
wenzelm@11572: 
wenzelm@11572: * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
wenzelm@11474: MAY FAIL;
nipkow@11361: 
wenzelm@11572: * HOL: introduced f^n = f o ... o f; warning: due to the limits of
wenzelm@11572: Isabelle's type classes, ^ on functions and relations has too general
wenzelm@11572: a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
wenzelm@11572: necessary to attach explicit type constraints;
nipkow@11307: 
wenzelm@12917: * HOL/Relation: the prefix name of the infix "O" has been changed from
wenzelm@12917: "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
wenzelm@12917: renamed accordingly (eg "compI" -> "rel_compI").
nipkow@12489: 
wenzelm@11487: * HOL: syntax translations now work properly with numerals and records
wenzelm@11487: expressions;
wenzelm@11474: 
wenzelm@12457: * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm@12457: of "lam" -- INCOMPATIBILITY;
wenzelm@11474: 
wenzelm@11933: * HOL: got rid of some global declarations (potential INCOMPATIBILITY
wenzelm@11933: for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
wenzelm@11933: renamed "Product_Type.unit";
wenzelm@11611: 
nipkow@12564: * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
nipkow@12564: 
wenzelm@12924: * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
wenzelm@12924: the "cases" method);
wenzelm@12924: 
wenzelm@12597: * HOL/GroupTheory: group theory examples including Sylow's theorem (by
webertj@15154: Florian Kammller);
wenzelm@12597: 
wenzelm@12608: * HOL/IMP: updated and converted to new-style theory format; several
wenzelm@12608: parts turned into readable document, with proper Isar proof texts and
wenzelm@12608: some explanations (by Gerwin Klein);
wenzelm@12597: 
wenzelm@12734: * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
wenzelm@12734: 
wenzelm@12690: * HOL-Hyperreal is now a logic image;
wenzelm@12690: 
wenzelm@11611: 
wenzelm@12022: *** HOLCF ***
wenzelm@12022: 
wenzelm@12622: * Isar: consts/constdefs supports mixfix syntax for continuous
wenzelm@12622: operations;
wenzelm@12622: 
wenzelm@12622: * Isar: domain package adapted to new-style theory format, e.g. see
wenzelm@12622: HOLCF/ex/Dnat.thy;
wenzelm@12622: 
wenzelm@12622: * theory Lift: proper use of rep_datatype lift instead of ML hacks --
wenzelm@12280: potential INCOMPATIBILITY; now use plain induct_tac instead of former
wenzelm@12280: lift.induct_tac, always use UU instead of Undef;
wenzelm@12022: 
wenzelm@12597: * HOLCF/IMP: updated and converted to new-style theory;
wenzelm@12597: 
wenzelm@12022: 
wenzelm@11474: *** ZF ***
wenzelm@11474: 
wenzelm@12622: * Isar: proper integration of logic-specific tools and packages,
wenzelm@12622: including theory commands '(co)inductive', '(co)datatype',
wenzelm@12622: 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
wenzelm@12622: 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
wenzelm@12622: 
wenzelm@12622: * theory Main no longer includes AC; for the Axiom of Choice, base
wenzelm@12622: your theory on Main_ZFC;
wenzelm@12622: 
wenzelm@12622: * the integer library now covers quotients and remainders, with many
wenzelm@12622: laws relating division to addition, multiplication, etc.;
paulson@12563: 
wenzelm@12280: * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
wenzelm@12280: typeless version of the formalism;
wenzelm@12280: 
wenzelm@13025: * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
wenzelm@13025: format;
wenzelm@12608: 
wenzelm@12280: * ZF/Induct: new directory for examples of inductive definitions,
wenzelm@12608: including theory Multiset for multiset orderings; converted to
wenzelm@12608: new-style theory format;
wenzelm@12177: 
wenzelm@13025: * ZF: many new theorems about lists, ordinals, etc.;
paulson@12850: 
wenzelm@11474: 
wenzelm@11474: *** General ***
wenzelm@11474: 
wenzelm@12280: * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
wenzelm@12280: variable proof controls level of detail: 0 = no proofs (only oracle
wenzelm@12280: dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
wenzelm@12280: also ref manual for further ML interfaces;
wenzelm@12280: 
wenzelm@12280: * Pure/axclass: removed obsolete ML interface
wenzelm@12280: goal_subclass/goal_arity;
wenzelm@12280: 
wenzelm@12280: * Pure/syntax: new token syntax "num" for plain numerals (without "#"
wenzelm@12280: of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
wenzelm@12280: separate tokens, so expressions involving minus need to be spaced
wenzelm@12280: properly;
wenzelm@12280: 
wenzelm@12312: * Pure/syntax: support non-oriented infixes, using keyword "infix"
wenzelm@12312: rather than "infixl" or "infixr";
wenzelm@12312: 
wenzelm@12312: * Pure/syntax: concrete syntax for dummy type variables admits genuine
wenzelm@12312: sort constraint specifications in type inference; e.g. "x::_::foo"
wenzelm@12312: ensures that the type of "x" is of sort "foo" (but not necessarily a
wenzelm@12312: type variable);
wenzelm@12280: 
wenzelm@12280: * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
wenzelm@12280: control output of nested => (types); the default behavior is
wenzelm@12280: "type_brackets";
wenzelm@12280: 
wenzelm@12280: * Pure/syntax: builtin parse translation for "_constify" turns valued
wenzelm@11817: tokens into AST constants;
wenzelm@11474: 
wenzelm@12280: * Pure/syntax: prefer later declarations of translations and print
wenzelm@12280: translation functions; potential INCOMPATIBILITY: need to reverse
wenzelm@12280: multiple declarations for same syntax element constant;
wenzelm@12280: 
wenzelm@12832: * Pure/show_hyps reset by default (in accordance to existing Isar
wenzelm@12832: practice);
wenzelm@12832: 
wenzelm@12280: * Provers/classical: renamed addaltern to addafter, addSaltern to
wenzelm@12280: addSafter;
wenzelm@12280: 
wenzelm@12280: * Provers/clasimp: ``iff'' declarations now handle conditional rules
wenzelm@12280: as well;
wenzelm@12253: 
wenzelm@12538: * system: tested support for MacOS X; should be able to get Isabelle +
wenzelm@12538: Proof General to work in a plain Terminal after installing Poly/ML
wenzelm@12538: (e.g. from the Isabelle distribution area) and GNU bash alone
wenzelm@12538: (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
wenzelm@12538: support requires further installations, e.g. from
wenzelm@12538: http://fink.sourceforge.net/);
wenzelm@12538: 
wenzelm@12280: * system: support Poly/ML 4.1.1 (able to manage larger heaps);
wenzelm@11551: 
wenzelm@12753: * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm@12753: of 40 MB), cf. ML_OPTIONS;
wenzelm@12753: 
wenzelm@11633: * system: Proof General keywords specification is now part of the
wenzelm@11633: Isabelle distribution (see etc/isar-keywords.el);
wenzelm@11633: 
wenzelm@12728: * system: support for persistent Proof General sessions (refrain from
wenzelm@12728: outdating all loaded theories on startup); user may create writable
wenzelm@12728: logic images like this: ``isabelle -q HOL Test'';
wenzelm@12597: 
wenzelm@11551: * system: smart selection of Isabelle process versus Isabelle
wenzelm@11572: interface, accommodates case-insensitive file systems (e.g. HFS+); may
wenzelm@11572: run both "isabelle" and "Isabelle" even if file names are badly
wenzelm@11572: damaged (executable inspects the case of the first letter of its own
wenzelm@11572: name); added separate "isabelle-process" and "isabelle-interface";
wenzelm@11551: 
wenzelm@12472: * system: refrain from any attempt at filtering input streams; no
wenzelm@12472: longer support ``8bit'' encoding of old isabelle font, instead proper
wenzelm@12472: iso-latin characters may now be used; the related isatools
wenzelm@12472: "symbolinput" and "nonascii" have disappeared as well;
wenzelm@12472: 
wenzelm@12472: * system: removed old "xterm" interface (the print modes "xterm" and
wenzelm@12472: "xterm_color" are still available for direct use in a suitable
wenzelm@12472: terminal);
wenzelm@12472: 
paulson@11314: 
oheimb@11169: 
wenzelm@11062: New in Isabelle99-2 (February 2001)
wenzelm@11062: -----------------------------------
wenzelm@11062: 
nipkow@10224: *** Overview of INCOMPATIBILITIES ***
nipkow@10224: 
paulson@11241: * HOL: please note that theories in the Library and elsewhere often use the
paulson@11241: new-style (Isar) format; to refer to their theorems in an ML script you must
wenzelm@12622: bind them to ML identifers by e.g.      val thm_name = thm "thm_name";
paulson@11241: 
wenzelm@11043: * HOL: inductive package no longer splits induction rule aggressively,
wenzelm@11043: but only as far as specified by the introductions given; the old
oheimb@11130: format may be recovered via ML function complete_split_rule or attribute
wenzelm@11043: 'split_rule (complete)';
wenzelm@11043: 
wenzelm@10998: * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
wenzelm@10998: gfp_Tarski to gfp_unfold;
nipkow@10224: 
paulson@10288: * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
paulson@10288: 
wenzelm@10858: * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
wenzelm@10858: relation); infix "^^" has been renamed "``"; infix "``" has been
wenzelm@10858: renamed "`"; "univalent" has been renamed "single_valued";
nipkow@10793: 
wenzelm@10998: * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
wenzelm@10998: operation;
wenzelm@10998: 
nipkow@10868: * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
nipkow@10856: 
wenzelm@10391: * Isar: 'obtain' no longer declares "that" fact as simp/intro;
wenzelm@10391: 
wenzelm@10401: * Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm@10401: consequence, it is no longer monotonic wrt. the local goal context
wenzelm@10401: (which is now passed through the inductive cases);
wenzelm@10401: 
wenzelm@10976: * Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm@10976: \<gg> to \<ggreater>;
wenzelm@10976: 
nipkow@10224: 
wenzelm@10245: *** Document preparation ***
wenzelm@10245: 
wenzelm@10858: * \isabellestyle{NAME} selects version of Isabelle output (currently
wenzelm@10858: available: are "it" for near math-mode best-style output, "sl" for
wenzelm@10858: slanted text style, and "tt" for plain type-writer; if no
wenzelm@10858: \isabellestyle command is given, output is according to slanted
wenzelm@10858: type-writer);
wenzelm@10858: 
wenzelm@10322: * support sub/super scripts (for single symbols only), input syntax is
wenzelm@10322: like this: "A\<^sup>*" or "A\<^sup>\<star>";
wenzelm@10322: 
wenzelm@10858: * some more standard symbols; see Appendix A of the system manual for
wenzelm@11062: the complete list of symbols defined in isabellesym.sty;
wenzelm@10858: 
wenzelm@10998: * improved isabelle style files; more abstract symbol implementation
wenzelm@10998: (should now use \isamath{...} and \isatext{...} in custom symbol
wenzelm@10998: definitions);
wenzelm@10998: 
wenzelm@10634: * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
wenzelm@10634: state; Note that presentation of goal states does not conform to
wenzelm@10634: actual human-readable proof documents.  Please do not include goal
wenzelm@10634: states into document output unless you really know what you are doing!
wenzelm@10322: 
wenzelm@11062: * proper indentation of antiquoted output with proportional LaTeX
wenzelm@11062: fonts;
wenzelm@10862: 
wenzelm@11050: * no_document ML operator temporarily disables LaTeX document
wenzelm@11050: generation;
wenzelm@11050: 
wenzelm@11062: * isatool unsymbolize tunes sources for plain ASCII communication;
wenzelm@11062: 
wenzelm@10322: 
wenzelm@10306: *** Isar ***
wenzelm@10306: 
wenzelm@10547: * Pure: Isar now suffers initial goal statements to contain unbound
wenzelm@10547: schematic variables (this does not conform to actual readable proof
wenzelm@10547: documents, due to unpredictable outcome and non-compositional proof
wenzelm@10547: checking); users who know what they are doing may use schematic goals
wenzelm@10547: for Prolog-style synthesis of proven results;
wenzelm@10547: 
wenzelm@10391: * Pure: assumption method (an implicit finishing) now handles actual
wenzelm@10391: rules as well;
wenzelm@10391: 
wenzelm@10391: * Pure: improved 'obtain' --- moved to Pure, insert "that" into
wenzelm@10391: initial goal, declare "that" only as Pure intro (only for single
wenzelm@10391: steps); the "that" rule assumption may now be involved in implicit
wenzelm@10391: finishing, thus ".." becomes a feasible for trivial obtains;
wenzelm@10391: 
wenzelm@10391: * Pure: default proof step now includes 'intro_classes'; thus trivial
wenzelm@10391: instance proofs may be performed by "..";
wenzelm@10391: 
wenzelm@10391: * Pure: ?thesis / ?this / "..." now work for pure meta-level
wenzelm@10391: statements as well;
wenzelm@10306: 
wenzelm@11097: * Pure: more robust selection of calculational rules;
wenzelm@11097: 
wenzelm@10858: * Pure: the builtin notion of 'finished' goal now includes the ==-refl
wenzelm@10858: rule (as well as the assumption rule);
wenzelm@10858: 
wenzelm@10858: * Pure: 'thm_deps' command visualizes dependencies of theorems and
wenzelm@10858: lemmas, using the graph browser tool;
wenzelm@10858: 
wenzelm@10944: * Pure: predict failure of "show" in interactive mode;
wenzelm@10944: 
wenzelm@11016: * Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm@11016: 
wenzelm@10401: * HOL: improved method 'induct' --- now handles non-atomic goals
wenzelm@10401: (potential INCOMPATIBILITY); tuned error handling;
wenzelm@10401: 
wenzelm@10557: * HOL: cases and induct rules now provide explicit hints about the
wenzelm@10547: number of facts to be consumed (0 for "type" and 1 for "set" rules);
wenzelm@10547: any remaining facts are inserted into the goal verbatim;
wenzelm@10547: 
wenzelm@10858: * HOL: local contexts (aka cases) may now contain term bindings as
wenzelm@10858: well; the 'cases' and 'induct' methods new provide a ?case binding for
wenzelm@10858: the result to be shown in each case;
wenzelm@10858: 
wenzelm@10770: * HOL: added 'recdef_tc' command;
wenzelm@10770: 
wenzelm@11016: * isatool convert assists in eliminating legacy ML scripts;
wenzelm@11016: 
wenzelm@10306: 
wenzelm@10245: *** HOL ***
wenzelm@10245: 
wenzelm@10245: * HOL/Library: a collection of generic theories to be used together
wenzelm@10245: with main HOL; the theory loader path already includes this directory
wenzelm@10245: by default; the following existing theories have been moved here:
wenzelm@10245: HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
wenzelm@10337: (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
wenzelm@10245: 
wenzelm@10966: * HOL/Unix: "Some aspects of Unix file-system security", a typical
wenzelm@10966: modelling and verification task performed in Isabelle/HOL +
wenzelm@10966: Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
wenzelm@10966: 
wenzelm@11094: * HOL/Algebra: special summation operator SUM no longer exists, it has
wenzelm@11094: been replaced by setsum; infix 'assoc' now has priority 50 (like
wenzelm@11094: 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
wenzelm@11094: 'domain', this makes the theory consistent with mathematical
wenzelm@11094: literature;
wenzelm@11094: 
wenzelm@10514: * HOL basics: added overloaded operations "inverse" and "divide"
wenzelm@10726: (infix "/"), syntax for generic "abs" operation, generic summation
wenzelm@11094: operator \<Sum>;
wenzelm@10452: 
wenzelm@10391: * HOL/typedef: simplified package, provide more useful rules (see also
wenzelm@10391: HOL/subset.thy);
wenzelm@10391: 
wenzelm@10915: * HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm@10915: now expressed as a proper nested rule (old-style tactic scripts may
wenzelm@10915: require atomize_strip_tac to cope with non-atomic premises);
wenzelm@10915: 
wenzelm@10915: * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
wenzelm@10915: to "split_conv" (old name still available for compatibility);
wenzelm@10915: 
wenzelm@10915: * HOL: improved concrete syntax for strings (e.g. allows translation
wenzelm@10915: rules with string literals);
wenzelm@10915: 
paulson@12245: * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
paulson@12245:  and Fleuriot's mechanization of analysis, including the transcendental
paulson@12245:  functions for the reals;
paulson@10756: 
wenzelm@11094: * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
wenzelm@10391: 
wenzelm@10858: 
paulson@10474: *** CTT ***
paulson@10474: 
wenzelm@10547: * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
wenzelm@10547: "lam" is displayed as TWO lambda-symbols
paulson@10474: 
wenzelm@10547: * CTT: theory Main now available, containing everything (that is, Bool
wenzelm@10547: and Arith);
wenzelm@10547: 
paulson@10474: 
wenzelm@10391: *** General ***
wenzelm@10391: 
wenzelm@10547: * Pure: the Simplifier has been implemented properly as a derived rule
wenzelm@10547: outside of the actual kernel (at last!); the overall performance
wenzelm@10547: penalty in practical applications is about 50%, while reliability of
wenzelm@10547: the Isabelle inference kernel has been greatly improved;
wenzelm@10547: 
wenzelm@11112: * print modes "brackets" and "no_brackets" control output of nested =>
wenzelm@11112: (types) and ==> (props); the default behaviour is "brackets";
wenzelm@11112: 
wenzelm@10391: * Provers: fast_tac (and friends) now handle actual object-logic rules
wenzelm@10391: as assumptions as well;
wenzelm@10391: 
wenzelm@11124: * system: support Poly/ML 4.0;
wenzelm@11124: 
wenzelm@11124: * system: isatool install handles KDE version 1 or 2;
wenzelm@11124: 
wenzelm@10391: 
wenzelm@10245: 
wenzelm@10103: New in Isabelle99-1 (October 2000)
wenzelm@10103: ----------------------------------
wenzelm@8015: 
wenzelm@10003: *** Overview of INCOMPATIBILITIES ***
paulson@8014: 
wenzelm@8848: * HOL: simplification of natural numbers is much changed; to partly
wenzelm@8848: recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
wenzelm@8848: issue the following ML commands:
wenzelm@8848: 
wenzelm@8848:   Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
wenzelm@8848:   Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
paulson@8788: 
wenzelm@10129: * HOL: simplification no longer dives into case-expressions; this is
wenzelm@10129: controlled by "t.weak_case_cong" for each datatype t;
wenzelm@10003: 
wenzelm@10003: * HOL: nat_less_induct renamed to less_induct;
wenzelm@10003: 
wenzelm@10003: * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
wenzelm@10003: fixsome to patch .thy and .ML sources automatically;
paulson@8967: 
wenzelm@10003:   select_equality  -> some_equality
wenzelm@10003:   select_eq_Ex     -> some_eq_ex
wenzelm@10003:   selectI2EX       -> someI2_ex
wenzelm@10003:   selectI2         -> someI2
wenzelm@10003:   selectI          -> someI
wenzelm@10003:   select1_equality -> some1_equality
wenzelm@10003:   Eps_sym_eq       -> some_sym_eq_trivial
wenzelm@10003:   Eps_eq           -> some_eq_trivial
wenzelm@10003: 
wenzelm@10003: * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
wenzelm@10003: 
wenzelm@10003: * HOL: removed obsolete theorem binding expand_if (refer to split_if
wenzelm@10003: instead);
wenzelm@10003: 
wenzelm@10003: * HOL: the recursion equations generated by 'recdef' are now called
wenzelm@10003: f.simps instead of f.rules;
wenzelm@10003: 
wenzelm@10003: * HOL: qed_spec_mp now also handles bounded ALL as well;
wenzelm@10003: 
wenzelm@10003: * HOL: 0 is now overloaded, so the type constraint ":: nat" may
wenzelm@10003: sometimes be needed;
wenzelm@10003: 
wenzelm@10003: * HOL: the constant for "f``x" is now "image" rather than "op ``";
paulson@8014: 
paulson@10065: * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
paulson@10065: 
wenzelm@9330: * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
wenzelm@9330: product is now "<*>" instead of "Times"; the lexicographic product is
wenzelm@9330: now "<*lex*>" instead of "**";
nipkow@8705: 
wenzelm@10003: * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
wenzelm@10003: of main HOL, but was unused); better use HOL's datatype package;
paulson@9971: 
wenzelm@10137: * HOL: removed "symbols" syntax for constant "override" of theory Map;
wenzelm@10137: the old syntax may be recovered as follows:
wenzelm@10137: 
wenzelm@10137:   syntax (symbols)
wenzelm@10137:     override  :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
wenzelm@10137:       (infixl "\\<oplus>" 100)
wenzelm@10137: 
wenzelm@8848: * HOL/Real: "rabs" replaced by overloaded "abs" function;
wenzelm@8848: 
wenzelm@8887: * HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm@8887: Lfp, Gfp, WF); this only affects ML packages that refer to const names
wenzelm@8887: internally;
wenzelm@8887: 
wenzelm@10003: * HOL and ZF: syntax for quotienting wrt an equivalence relation
wenzelm@10003: changed from A/r to A//r;
wenzelm@9908: 
wenzelm@10003: * ZF: new treatment of arithmetic (nat & int) may break some old
wenzelm@10003: proofs;
wenzelm@8921: 
wenzelm@10003: * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
wenzelm@10003: rulify -> rule_format, elimify -> elim_format, ...);
paulson@9542: 
wenzelm@9941: * Isar/Provers: intro/elim/dest attributes changed; renamed
wenzelm@9941: intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
wenzelm@9937: should have to change intro!! to intro? only); replaced "delrule" by
wenzelm@9937: "rule del";
wenzelm@9437: 
wenzelm@9612: * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
wenzelm@9612: 
wenzelm@9437: * Provers: strengthened force_tac by using new first_best_tac;
oheimb@9402: 
wenzelm@10003: * LaTeX document preparation: several changes of isabelle.sty (see
wenzelm@10003: lib/texinputs);
wenzelm@8729: 
paulson@8014: 
wenzelm@8487: *** Document preparation ***
wenzelm@8358: 
wenzelm@9198: * formal comments (text blocks etc.) in new-style theories may now
wenzelm@9753: contain antiquotations of thm/prop/term/typ/text to be presented
wenzelm@9753: according to latex print mode; concrete syntax is like this:
wenzelm@9753: @{term[show_types] "f(x) = a + x"};
wenzelm@9198: 
wenzelm@8358: * isatool mkdir provides easy setup of Isabelle session directories,
wenzelm@8518: including proper document sources;
wenzelm@8358: 
wenzelm@8358: * generated LaTeX sources are now deleted after successful run
wenzelm@8358: (isatool document -c); may retain a copy somewhere else via -D option
wenzelm@8358: of isatool usedir;
wenzelm@8358: 
wenzelm@8566: * isatool usedir -D now lets isatool latex -o sty update the Isabelle
wenzelm@10003: style files, achieving self-contained LaTeX sources and simplifying
wenzelm@10003: LaTeX debugging;
wenzelm@8566: 
wenzelm@8518: * old-style theories now produce (crude) LaTeX output as well;
wenzelm@8358: 
wenzelm@9057: * browser info session directories are now self-contained (may be put
wenzelm@9437: on WWW server seperately); improved graphs of nested sessions; removed
wenzelm@9437: graph for 'all sessions';
wenzelm@9057: 
wenzelm@10003: * several improvements in isabelle style files; \isabellestyle{it}
wenzelm@10003: produces fake math mode output; \isamarkupheader is now \section by
wenzelm@10003: default; see lib/texinputs/isabelle.sty etc.;
wenzelm@9489: 
wenzelm@8358: 
wenzelm@8184: *** Isar ***
wenzelm@8184: 
wenzelm@10003: * Isar/Pure: local results and corresponding term bindings are now
wenzelm@10003: subject to Hindley-Milner polymorphism (similar to ML); this
wenzelm@10003: accommodates incremental type-inference very nicely;
wenzelm@8283: 
wenzelm@10003: * Isar/Pure: new derived language element 'obtain' supports
wenzelm@10003: generalized existence reasoning;
wenzelm@8621: 
wenzelm@10003: * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
wenzelm@10003: support accumulation of results, without applying any rules yet;
wenzelm@10003: useful to collect intermediate results without explicit name
wenzelm@10003: references, and for use with transitivity rules with more than 2
wenzelm@10003: premises;
wenzelm@8184: 
wenzelm@10003: * Isar/Pure: scalable support for case-analysis type proofs: new
wenzelm@10003: 'case' language element refers to local contexts symbolically, as
wenzelm@10003: produced by certain proof methods; internally, case names are attached
wenzelm@10003: to theorems as "tags";
wenzelm@8440: 
wenzelm@10003: * Isar/Pure: theory command 'hide' removes declarations from
wenzelm@9330: class/type/const name spaces;
wenzelm@9330: 
wenzelm@10003: * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
wenzelm@9330: indicate potential overloading;
wenzelm@9330: 
wenzelm@10003: * Isar/Pure: changed syntax of local blocks from {{ }} to { };
wenzelm@8621: 
wenzelm@10003: * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
wenzelm@10003: "{a,b,c}" instead of {a,b,c};
wenzelm@9011: 
wenzelm@10003: * Isar/Pure now provides its own version of intro/elim/dest
wenzelm@10003: attributes; useful for building new logics, but beware of confusion
wenzelm@10003: with the version in Provers/classical;
wenzelm@9612: 
wenzelm@10003: * Isar/Pure: the local context of (non-atomic) goals is provided via
wenzelm@10003: case name 'antecedent';
wenzelm@8440: 
wenzelm@10003: * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
wenzelm@10003: to the current context is now done automatically);
wenzelm@9383: 
wenzelm@10003: * Isar/Pure: theory command 'method_setup' provides a simple interface
wenzelm@10003: for definining proof methods in ML;
wenzelm@9612: 
wenzelm@10003: * Isar/Provers: intro/elim/dest attributes changed; renamed
wenzelm@9941: intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
wenzelm@9941: most cases, one should have to change intro!! to intro? only);
wenzelm@9941: replaced "delrule" by "rule del";
wenzelm@8283: 
wenzelm@10003: * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
wenzelm@10003: 'symmetric' attribute (the latter supercedes [RS sym]);
wenzelm@10003: 
wenzelm@10003: * Isar/Provers: splitter support (via 'split' attribute and 'simp'
wenzelm@10003: method modifier); 'simp' method: 'only:' modifier removes loopers as
wenzelm@10003: well (including splits);
wenzelm@10003: 
wenzelm@10003: * Isar/Provers: Simplifier and Classical methods now support all kind
wenzelm@10003: of modifiers used in the past, including 'cong', 'iff', etc.
wenzelm@10003: 
wenzelm@10003: * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
wenzelm@10003: of Simplifier and Classical reasoner);
wenzelm@10003: 
wenzelm@10003: * Isar/HOL: new proof method 'cases' and improved version of 'induct'
wenzelm@10003: now support named cases; major packages (inductive, datatype, primrec,
wenzelm@10003: recdef) support case names and properly name parameters;
wenzelm@9612: 
wenzelm@10003: * Isar/HOL: new transitivity rules for substitution in inequalities --
wenzelm@10003: monotonicity conditions are extracted to be proven at end of
wenzelm@10003: calculations;
wenzelm@10003: 
wenzelm@10003: * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
wenzelm@10003: method anyway;
wenzelm@10003: 
wenzelm@10003: * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
wenzelm@10003: split_if split_if_asm; datatype package provides theorems foo.splits =
wenzelm@10003: foo.split foo.split_asm for each datatype;
wenzelm@10003: 
wenzelm@10003: * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
wenzelm@10003: (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
wenzelm@10003: scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
wenzelm@10003: use "(cases (simplified))" method in proper proof texts);
wenzelm@10003: 
wenzelm@10003: * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
wenzelm@10003: 
wenzelm@10003: * Isar: names of theorems etc. may be natural numbers as well;
wenzelm@10003: 
wenzelm@10003: * Isar: 'pr' command: optional arguments for goals_limit and
wenzelm@9724: ProofContext.prems_limit; no longer prints theory contexts, but only
wenzelm@9724: proof states;
wenzelm@8487: 
wenzelm@10003: * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
wenzelm@8518: additional print modes to be specified; e.g. "pr(latex)" will print
wenzelm@8518: proof state according to the Isabelle LaTeX style;
wenzelm@8487: 
wenzelm@10003: * Isar: improved support for emulating tactic scripts, including proof
wenzelm@9612: methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
wenzelm@9612: 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
wenzelm@9612: (for HOL datatypes);
wenzelm@8534: 
wenzelm@10003: * Isar: simplified (more robust) goal selection of proof methods: 1st
wenzelm@10003: goal, all goals, or explicit goal specifier (tactic emulation); thus
wenzelm@10003: 'proof method scripts' have to be in depth-first order;
wenzelm@8673: 
wenzelm@10003: * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
wenzelm@8729: 
wenzelm@10003: * Isar: removed 'help' command, which hasn't been too helpful anyway;
wenzelm@10003: should instead use individual commands for printing items
wenzelm@10003: (print_commands, print_methods etc.);
wenzelm@9224: 
wenzelm@10003: * Isar: added 'nothing' --- the empty list of theorems;
wenzelm@9239: 
wenzelm@8184: 
paulson@8014: *** HOL ***
paulson@8014: 
wenzelm@10080: * HOL/MicroJava: formalization of a fragment of Java, together with a
wenzelm@10080: corresponding virtual machine and a specification of its bytecode
wenzelm@10080: verifier and a lightweight bytecode verifier, including proofs of
wenzelm@10080: type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
wenzelm@10080: Cornelia Pusch (see also the homepage of project Bali at
wenzelm@10080: http://isabelle.in.tum.de/Bali/);
wenzelm@10080: 
wenzelm@8518: * HOL/Algebra: new theory of rings and univariate polynomials, by
wenzelm@8518: Clemens Ballarin;
paulson@8014: 
wenzelm@10157: * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
wenzelm@10003: Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
wenzelm@10003: Rasmussen;
wenzelm@8570: 
wenzelm@10157: * HOL/Lattice: fundamental concepts of lattice theory and order
wenzelm@10157: structures, including duals, properties of bounds versus algebraic
wenzelm@10157: laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
wenzelm@10157: Theorem for complete lattices etc.; may also serve as a demonstration
wenzelm@10157: for abstract algebraic reasoning using axiomatic type classes, and
wenzelm@10157: mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
wenzelm@10157: 
wenzelm@10003: * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
wenzelm@10003: von Oheimb;
paulson@9542: 
wenzelm@10164: * HOL/IMPP: extension of IMP with local variables and mutually
wenzelm@10164: recursive procedures, by David von Oheimb;
wenzelm@10164: 
wenzelm@10003: * HOL/Lambda: converted into new-style theory and document;
paulson@9542: 
wenzelm@10003: * HOL/ex/Multiquote: example of multiple nested quotations and
wenzelm@10003: anti-quotations -- basically a generalized version of de-Bruijn
wenzelm@10003: representation; very useful in avoiding lifting of operations;
wenzelm@8848: 
wenzelm@9612: * HOL/record: added general record equality rule to simpset; fixed
wenzelm@9612: select-update simplification procedure to handle extended records as
wenzelm@9612: well; admit "r" as field name;
paulson@9542: 
paulson@8967: * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
paulson@8967: other numeric types and also as the identity of groups, rings, etc.;
paulson@8967: 
paulson@8967: * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
paulson@8967: Types nat and int belong to this axclass;
paulson@8967: 
wenzelm@10003: * HOL: greatly improved simplification involving numerals of type nat, int, real:
paulson@8788:    (i + #8 + j) = Suc k simplifies to  #7 + (i + j) = k
paulson@8832:    i*j + k + j*#3*i     simplifies to  #4*(i*j) + k
paulson@8832:   two terms #m*u and #n*u are replaced by #(m+n)*u
paulson@8832:     (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
paulson@8832:   and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
paulson@8832:     or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
paulson@8736: 
wenzelm@10003: * HOL: meson_tac is available (previously in ex/meson.ML); it is a
wenzelm@10003: powerful prover for predicate logic but knows nothing of clasets; see
wenzelm@10003: ex/mesontest.ML and ex/mesontest2.ML for example applications;
paulson@9835: 
wenzelm@8848: * HOL: new version of "case_tac" subsumes both boolean case split and
wenzelm@8440: "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
wenzelm@8518: exists, may define val exhaust_tac = case_tac for ad-hoc portability;
wenzelm@8440: 
wenzelm@8848: * HOL: simplification no longer dives into case-expressions: only the
wenzelm@10129: selector expression is simplified, but not the remaining arms; to
wenzelm@10129: enable full simplification of case-expressions for datatype t, you may
wenzelm@10129: remove t.weak_case_cong from the simpset, either globally (Delcongs
wenzelm@10129: [thm"t.weak_case_cong"];) or locally (delcongs [...]).
nipkow@8603: 
wenzelm@8848: * HOL/recdef: the recursion equations generated by 'recdef' for
wenzelm@8848: function 'f' are now called f.simps instead of f.rules; if all
wenzelm@8848: termination conditions are proved automatically, these simplification
wenzelm@8848: rules are added to the simpset, as in primrec; rules may be named
wenzelm@8848: individually as well, resulting in a separate list of theorems for
wenzelm@8848: each equation;
wenzelm@8848: 
wenzelm@9489: * HOL/While is a new theory that provides a while-combinator. It
wenzelm@9489: permits the definition of tail-recursive functions without the
wenzelm@9489: provision of a termination measure. The latter is necessary once the
wenzelm@9489: invariant proof rule for while is applied.
nipkow@9457: 
wenzelm@10003: * HOL: new (overloaded) notation for the set of elements below/above
wenzelm@10003: some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
nipkow@8925: 
wenzelm@8848: * HOL: theorems impI, allI, ballI bound as "strip";
wenzelm@8848: 
wenzelm@10003: * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
nipkow@9746: induct_tac th "x1 ... xn" expects th to have a conclusion of the form
nipkow@9746: P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
nipkow@9746: 
wenzelm@10003: * HOL/Real: "rabs" replaced by overloaded "abs" function;
nipkow@9737: 
wenzelm@10003: * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
wenzelm@10003: main HOL, but was unused);
nipkow@8626: 
wenzelm@10003: * HOL: fewer consts declared as global (e.g. have to refer to
wenzelm@10003: "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
wenzelm@8887: 
wenzelm@10003: * HOL: tuned AST representation of nested pairs, avoiding bogus output
wenzelm@10003: in case of overlap with user translations (e.g. judgements over
wenzelm@10003: tuples); (note that the underlying logical represenation is still
wenzelm@10003: bogus);
wenzelm@9349: 
nipkow@8412: 
paulson@9542: *** ZF ***
paulson@9542: 
wenzelm@10003: * ZF: simplification automatically cancels common terms in arithmetic
wenzelm@10003: expressions over nat and int;
paulson@9542: 
wenzelm@10003: * ZF: new treatment of nat to minimize type-checking: all operators
wenzelm@10003: coerce their operands to a natural number using the function natify,
wenzelm@10003: making the algebraic laws unconditional;
paulson@9542: 
wenzelm@10003: * ZF: as above, for int: operators coerce their operands to an integer
wenzelm@10003: using the function intify;
paulson@9542: 
wenzelm@10003: * ZF: the integer library now contains many of the usual laws for the
wenzelm@10003: orderings, including $<=, and monotonicity laws for $+ and $*;
paulson@9542: 
wenzelm@10003: * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
wenzelm@10003: simplification;
paulson@9388: 
wenzelm@10003: * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
wenzelm@10003: to the simplifier and classical reasoner simultaneously;
paulson@9388: 
paulson@9388: 
wenzelm@8358: *** General ***
wenzelm@8358: 
wenzelm@10003: * Provers: blast_tac now handles actual object-logic rules as
wenzelm@10003: assumptions; note that auto_tac uses blast_tac internally as well;
wenzelm@10003: 
wenzelm@10003: * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
wenzelm@10003: outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
wenzelm@10003: 
wenzelm@9941: * Provers: delrules now handles destruct rules as well (no longer need
wenzelm@9941: explicit make_elim);
wenzelm@9941: 
wenzelm@10003: * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
wenzelm@10003:   [| inj ?f;          ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
wenzelm@10003: use instead the strong form,
wenzelm@10003:   [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
wenzelm@10003: in HOL, FOL and ZF the function cla_make_elim will create such rules
wenzelm@10003: from destruct-rules;
wenzelm@9489: 
wenzelm@9709: * Provers: Simplifier.easy_setup provides a fast path to basic
wenzelm@9709: Simplifier setup for new object-logics;
wenzelm@9709: 
wenzelm@9709: * Pure: AST translation rules no longer require constant head on LHS;
wenzelm@9349: 
wenzelm@9709: * Pure: improved name spaces: ambiguous output is qualified; support
wenzelm@9709: for hiding of names;
wenzelm@8729: 
wenzelm@10003: * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
wenzelm@10003: XSYMBOL_HOME; no longer need to do manual configuration in most
wenzelm@10003: situations;
wenzelm@10003: 
wenzelm@9709: * system: compression of ML heaps images may now be controlled via -c
wenzelm@9709: option of isabelle and isatool usedir (currently only observed by
wenzelm@9709: Poly/ML);
wenzelm@8358: 
wenzelm@9981: * system: isatool installfonts may handle X-Symbol fonts as well (very
wenzelm@9981: useful for remote X11);
wenzelm@9981: 
wenzelm@9709: * system: provide TAGS file for Isabelle sources;
wenzelm@9052: 
wenzelm@9288: * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
wenzelm@9288: order;
wenzelm@9288: 
wenzelm@8994: * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
wenzelm@8994: timing flag supersedes proof_timing and Toplevel.trace;
wenzelm@8994: 
wenzelm@10003: * ML: new combinators |>> and |>>> for incremental transformations
wenzelm@10003: with secondary results (e.g. certain theory extensions):
wenzelm@10003: 
wenzelm@9330: * ML: PureThy.add_defs gets additional argument to indicate potential
wenzelm@9330: overloading (usually false);
wenzelm@9330: 
wenzelm@10003: * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
wenzelm@10003: results;
wenzelm@8440: 
wenzelm@8358: 
wenzelm@8015: 
wenzelm@7986: New in Isabelle99 (October 1999)
wenzelm@7986: --------------------------------
oheimb@4649: 
paulson@5931: *** Overview of INCOMPATIBILITIES (see below for more details) ***
paulson@5931: 
paulson@6922: * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
paulson@6922: are no longer simplified.  (This allows the simplifier to unfold recursive
paulson@6922: functional programs.)  To restore the old behaviour, declare
wenzelm@7215: 
wenzelm@7215:     Delcongs [if_weak_cong];
paulson@6922: 
wenzelm@6269: * HOL: Removed the obsolete syntax "Compl A"; use -A for set
wenzelm@6269: complement;
paulson@5931: 
wenzelm@6269: * HOL: the predicate "inj" is now defined by translation to "inj_on";
paulson@6174: 
berghofe@7847: * HOL/datatype: mutual_induct_tac no longer exists --
berghofe@7847:   use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
berghofe@7847: 
wenzelm@6386: * HOL/typedef: fixed type inference for representing set; type
wenzelm@6386: arguments now have to occur explicitly on the rhs as type constraints;
wenzelm@6386: 
wenzelm@6269: * ZF: The con_defs part of an inductive definition may no longer refer
wenzelm@6269: to constants declared in the same theory;
nipkow@6057: 
wenzelm@6269: * HOL, ZF: the function mk_cases, generated by the inductive
wenzelm@6269: definition package, has lost an argument.  To simplify its result, it
wenzelm@6269: uses the default simpset instead of a supplied list of theorems.
paulson@6141: 
wenzelm@7215: * HOL/List: the constructors of type list are now Nil and Cons;
wenzelm@7215: 
nipkow@7619: * Simplifier: the type of the infix ML functions
wenzelm@8729:         setSSolver addSSolver setSolver addSolver
nipkow@7619: is now  simpset * solver -> simpset  where `solver' is a new abstract type
nipkow@7619: for packaging solvers. A solver is created via
wenzelm@8729:         mk_solver: string -> (thm list -> int -> tactic) -> solver
nipkow@7619: where the string argument is only a comment.
nipkow@6057: 
wenzelm@7647: 
paulson@6069: *** Proof tools ***
paulson@6069: 
wenzelm@6343: * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
wenzelm@6343: decision procedure for linear arithmetic. Currently it is used for
wenzelm@7593: types `nat', `int', and `real' in HOL (see below); it can, should and
wenzelm@7593: will be instantiated for other types and logics as well.
paulson@6069: 
nipkow@7324: * The simplifier now accepts rewrite rules with flexible heads, eg
nipkow@7324:      hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
nipkow@7324:   They are applied like any rule with a non-pattern lhs, i.e. by first-order
nipkow@7324:   matching.
paulson@6069: 
wenzelm@7593: 
paulson@6014: *** General ***
paulson@6014: 
wenzelm@7986: * New Isabelle/Isar subsystem provides an alternative to traditional
wenzelm@7215: tactical theorem proving; together with the ProofGeneral/isar user
wenzelm@7215: interface it offers an interactive environment for developing human
wenzelm@7215: readable proof documents (Isar == Intelligible semi-automated
wenzelm@7886: reasoning); for further information see isatool doc isar-ref,
wenzelm@7986: src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
wenzelm@7886: 
wenzelm@9612: * improved and simplified presentation of theories: better HTML markup
wenzelm@9612: (including colors), graph views in several sizes; isatool usedir now
wenzelm@9612: provides a proper interface for user theories (via -P option); actual
wenzelm@9612: document preparation based on (PDF)LaTeX is available as well (for
wenzelm@9612: new-style theories only); see isatool doc system for more information;
wenzelm@7215: 
wenzelm@7252: * native support for Proof General, both for classic Isabelle and
wenzelm@7986: Isabelle/Isar;
wenzelm@7215: 
wenzelm@7791: * ML function thm_deps visualizes dependencies of theorems and lemmas,
wenzelm@7791: using the graph browser tool;
wenzelm@7791: 
wenzelm@6751: * Isabelle manuals now also available as PDF;
wenzelm@6751: 
wenzelm@6449: * theory loader rewritten from scratch (may not be fully
wenzelm@6449: bug-compatible); old loadpath variable has been replaced by show_path,
wenzelm@6671: add_path, del_path, reset_path functions; new operations such as
wenzelm@7593: update_thy, touch_thy, remove_thy, use/update_thy_only (see also
wenzelm@7593: isatool doc ref);
wenzelm@6449: 
wenzelm@7215: * improved isatool install: option -k creates KDE application icon,
wenzelm@7215: option -p DIR installs standalone binaries;
wenzelm@7215: 
wenzelm@7215: * added ML_PLATFORM setting (useful for cross-platform installations);
wenzelm@7215: more robust handling of platform specific ML images for SML/NJ;
wenzelm@7215: 
wenzelm@7886: * the settings environment is now statically scoped, i.e. it is never
wenzelm@7986: created again in sub-processes invoked from isabelle, isatool, or
wenzelm@7886: Isabelle;
wenzelm@7886: 
wenzelm@7215: * path element specification '~~' refers to '$ISABELLE_HOME';
wenzelm@7215: 
wenzelm@6343: * in locales, the "assumes" and "defines" parts may be omitted if
wenzelm@6343: empty;
wenzelm@5973: 
wenzelm@6269: * new print_mode "xsymbols" for extended symbol support (e.g. genuine
wenzelm@6269: long arrows);
wenzelm@6259: 
wenzelm@6343: * new print_mode "HTML";
wenzelm@6343: 
wenzelm@6343: * new flag show_tags controls display of tags of theorems (which are
wenzelm@6343: basically just comments that may be attached by some tools);
wenzelm@6343: 
wenzelm@6461: * Isamode 2.6 requires patch to accomodate change of Isabelle font
wenzelm@6461: mode and goal output format:
wenzelm@6461: 
wenzelm@6461: diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
wenzelm@6461: 244c244
wenzelm@6461: <       (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
wenzelm@6461: ---
wenzelm@6533: >       (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
wenzelm@6461: diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
wenzelm@6461: 181c181
wenzelm@6461: < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
wenzelm@6461: ---
wenzelm@6461: > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
wenzelm@6461: 
wenzelm@7450: * function bind_thms stores lists of theorems (cf. bind_thm);
wenzelm@7450: 
wenzelm@7593: * new shorthand tactics ftac, eatac, datac, fatac;
wenzelm@7593: 
wenzelm@7593: * qed (and friends) now accept "" as result name; in that case the
wenzelm@7986: theorem is not stored, but proper checks and presentation of the
wenzelm@7986: result still apply;
wenzelm@7593: 
wenzelm@7805: * theorem database now also indexes constants "Trueprop", "all",
wenzelm@7805: "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
wenzelm@7805: 
oheimb@6028: 
nipkow@6057: *** HOL ***
nipkow@6057: 
wenzelm@7215: ** HOL arithmetic **
wenzelm@7215: 
wenzelm@6343: * There are now decision procedures for linear arithmetic over nat and
wenzelm@6343: int:
nipkow@6131: 
wenzelm@6343: 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
wenzelm@6343: `+', `-', `Suc', `min', `max' and numerical constants; other subterms
wenzelm@6343: are treated as atomic; subformulae not involving type `nat' or `int'
wenzelm@6343: are ignored; quantified subformulae are ignored unless they are
wenzelm@6343: positive universal or negative existential. The tactic has to be
wenzelm@6343: invoked by hand and can be a little bit slow. In particular, the
wenzelm@6343: running time is exponential in the number of occurrences of `min' and
wenzelm@6343: `max', and `-' on `nat'.
nipkow@6131: 
wenzelm@6343: 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
wenzelm@6343: (negated) (in)equalities among the premises and the conclusion into
wenzelm@6343: account (i.e. no compound formulae) and does not know about `min' and
wenzelm@6343: `max', and `-' on `nat'. It is fast and is used automatically by the
wenzelm@6343: simplifier.
nipkow@6131: 
wenzelm@6343: NB: At the moment, these decision procedures do not cope with mixed
wenzelm@6343: nat/int formulae where the two parts interact, such as `m < n ==>
wenzelm@6343: int(m) < int(n)'.
oheimb@6028: 
wenzelm@7215: * HOL/Numeral provides a generic theory of numerals (encoded
wenzelm@7313: efficiently as bit strings); setup for types nat/int/real is in place;
wenzelm@7215: INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
wenzelm@7215: int, existing theories and proof scripts may require a few additional
wenzelm@7215: type constraints;
wenzelm@7215: 
wenzelm@7215: * integer division and remainder can now be performed on constant
wenzelm@7215: arguments;
paulson@7157: 
wenzelm@7215: * many properties of integer multiplication, division and remainder
wenzelm@7215: are now available;
paulson@6922: 
paulson@7287: * An interface to the Stanford Validity Checker (SVC) is available through the
paulson@7287: tactic svc_tac.  Propositional tautologies and theorems of linear arithmetic
paulson@7287: are proved automatically.  SVC must be installed separately, and its results
paulson@7287: must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
paulson@7287: invocation of the underlying oracle).  For SVC see
paulson@7444:   http://verify.stanford.edu/SVC
paulson@6922: 
wenzelm@7125: * IsaMakefile: the HOL-Real target now builds an actual image;
wenzelm@7125: 
wenzelm@7215: 
wenzelm@7215: ** HOL misc **
wenzelm@7215: 
wenzelm@7595: * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
wenzelm@7595: (in Isabelle/Isar) -- by Gertrud Bauer;
wenzelm@7595: 
wenzelm@7691: * HOL/BCV: generic model of bytecode verification, i.e. data-flow
wenzelm@7691: analysis for assembly languages with subtypes;
wenzelm@7691: 
wenzelm@6278: * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
wenzelm@6278: -- avoids syntactic ambiguities and treats state, transition, and
wenzelm@6278: temporal levels more uniformly; introduces INCOMPATIBILITIES due to
wenzelm@6278: changed syntax and (many) tactics;
wenzelm@6278: 
wenzelm@7791: * HOL/inductive: Now also handles more general introduction rules such
wenzelm@7791:   as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
wenzelm@7791:   theorems are now maintained within the theory (maintained via the
wenzelm@7791:   "mono" attribute);
berghofe@7780: 
wenzelm@7238: * HOL/datatype: Now also handles arbitrarily branching datatypes
wenzelm@7238:   (using function types) such as
wenzelm@7238: 
wenzelm@7238:   datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
berghofe@7047: 
wenzelm@7326: * HOL/record: record_simproc (part of the default simpset) takes care
wenzelm@7326: of selectors applied to updated records; record_split_tac is no longer
wenzelm@7327: part of the default claset; update_defs may now be removed from the
wenzelm@7327: simpset in many cases; COMPATIBILITY: old behavior achieved by
wenzelm@7326: 
wenzelm@7326:   claset_ref () := claset() addSWrapper record_split_wrapper;
wenzelm@7326:   Delsimprocs [record_simproc]
wenzelm@7326: 
wenzelm@6386: * HOL/typedef: fixed type inference for representing set; type
wenzelm@6386: arguments now have to occur explicitly on the rhs as type constraints;
wenzelm@6386: 
paulson@7287: * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
paulson@7287: names rather than an ML expression;
paulson@7287: 
paulson@7287: * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
paulson@7287: supplied later.  Program schemes can be defined, such as
paulson@7287:     "While B C s = (if B s then While B C (C s) else s)"
paulson@7287: where the well-founded relation can be chosen after B and C have been given.
wenzelm@6563: 
wenzelm@7215: * HOL/List: the constructors of type list are now Nil and Cons;
wenzelm@7215: INCOMPATIBILITY: while [] and infix # syntax is still there, of
wenzelm@7215: course, ML tools referring to List.list.op # etc. have to be adapted;
wenzelm@7215: 
wenzelm@7238: * HOL_quantifiers flag superseded by "HOL" print mode, which is
wenzelm@7238: disabled by default; run isabelle with option -m HOL to get back to
wenzelm@7238: the original Gordon/HOL-style output;
wenzelm@7238: 
wenzelm@7238: * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
wenzelm@7238: ALL x<=y. P, EX x<y. P, EX x<=y. P;
wenzelm@7238: 
wenzelm@7238: * HOL basic syntax simplified (more orthogonal): all variants of
wenzelm@7238: All/Ex now support plain / symbolic / HOL notation; plain syntax for
wenzelm@7238: Eps operator is provided as well: "SOME x. P[x]";
wenzelm@7238: 
berghofe@7320: * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
wenzelm@7261: 
wenzelm@7280: * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
wenzelm@7280: thus available for user theories;
wenzelm@7280: 
wenzelm@7300: * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
wenzelm@7300: HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
wenzelm@7300: time;
wenzelm@7300: 
wenzelm@7986: * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
wenzelm@7986: several times and then mp;
oheimb@7492: 
wenzelm@7215: 
paulson@7113: *** LK ***
paulson@7113: 
wenzelm@7215: * the notation <<...>> is now available as a notation for sequences of
wenzelm@7215: formulas;
paulson@7113: 
paulson@7113: * the simplifier is now installed
paulson@7113: 
wenzelm@8729: * the axiom system has been generalized (thanks to Soren Heilmann)
paulson@7113: 
paulson@7113: * the classical reasoner now has a default rule database
paulson@7113: 
paulson@7113: 
paulson@6064: *** ZF ***
paulson@6064: 
paulson@6064: * new primrec section allows primitive recursive functions to be given
wenzelm@6269: directly (as in HOL) over datatypes and the natural numbers;
paulson@6064: 
wenzelm@6269: * new tactics induct_tac and exhaust_tac for induction (or case
wenzelm@6269: analysis) over datatypes and the natural numbers;
paulson@6064: 
paulson@6064: * the datatype declaration of type T now defines the recursor T_rec;
paulson@6064: 
paulson@6141: * simplification automatically does freeness reasoning for datatype
wenzelm@6269: constructors;
paulson@6141: 
wenzelm@6269: * automatic type-inference, with AddTCs command to insert new
wenzelm@6269: type-checking rules;
paulson@6155: 
wenzelm@6269: * datatype introduction rules are now added as Safe Introduction rules
wenzelm@6269: to the claset;
paulson@6155: 
wenzelm@6269: * the syntax "if P then x else y" is now available in addition to
wenzelm@6269: if(P,x,y);
wenzelm@6269: 
paulson@6069: 
wenzelm@6343: *** Internal programming interfaces ***
wenzelm@6343: 
wenzelm@7919: * tuned simplifier trace output; new flag debug_simp;
wenzelm@7919: 
wenzelm@7420: * structures Vartab / Termtab (instances of TableFun) offer efficient
wenzelm@7420: tables indexed by indexname_ord / term_ord (compatible with aconv);
wenzelm@7420: 
wenzelm@6386: * AxClass.axclass_tac lost the theory argument;
wenzelm@6386: 
wenzelm@6343: * tuned current_goals_markers semantics: begin / end goal avoids
wenzelm@6343: printing empty lines;
wenzelm@6343: 
wenzelm@6343: * removed prs and prs_fn hook, which was broken because it did not
wenzelm@6343: include \n in its semantics, forcing writeln to add one
wenzelm@6343: uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
wenzelm@6343: string -> unit if you really want to output text without newline;
wenzelm@6343: 
wenzelm@6343: * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
wenzelm@6343: plain output, interface builders may have to enable 'isabelle_font'
wenzelm@6343: mode to get Isabelle font glyphs as before;
wenzelm@6343: 
wenzelm@6343: * refined token_translation interface; INCOMPATIBILITY: output length
wenzelm@6343: now of type real instead of int;
wenzelm@6343: 
wenzelm@7196: * theory loader actions may be traced via new ThyInfo.add_hook
wenzelm@7196: interface (see src/Pure/Thy/thy_info.ML); example application: keep
wenzelm@7196: your own database of information attached to *whole* theories -- as
wenzelm@7196: opposed to intra-theory data slots offered via TheoryDataFun;
wenzelm@7196: 
wenzelm@7647: * proper handling of dangling sort hypotheses (at last!);
wenzelm@7647: Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
wenzelm@7647: extra sort hypotheses that can be witnessed from the type signature;
wenzelm@7986: the force_strip_shyps flag is gone, any remaining shyps are simply
wenzelm@7986: left in the theorem (with a warning issued by strip_shyps_warning);
wenzelm@7647: 
wenzelm@6343: 
paulson@6064: 
wenzelm@5781: New in Isabelle98-1 (October 1998)
wenzelm@5781: ----------------------------------
wenzelm@5781: 
wenzelm@5127: *** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4842: 
wenzelm@5726: * several changes of automated proof tools;
wenzelm@5373: 
wenzelm@5726: * HOL: major changes to the inductive and datatype packages, including
wenzelm@5726: some minor incompatibilities of theory syntax;
berghofe@5214: 
wenzelm@5726: * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
wenzelm@5217: called `inj_on';
paulson@5160: 
nipkow@5275: * HOL: removed duplicate thms in Arith:
nipkow@5275:   less_imp_add_less  should be replaced by  trans_less_add1
nipkow@5275:   le_imp_add_le      should be replaced by  trans_le_add1
paulson@5160: 
wenzelm@5726: * HOL: unary minus is now overloaded (new type constraints may be
wenzelm@5726: required);
paulson@5490: 
wenzelm@5726: * HOL and ZF: unary minus for integers is now #- instead of #~.  In
wenzelm@5726: ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
wenzelm@5726: now taken as an integer constant.
paulson@5541: 
wenzelm@5726: * Pure: ML function 'theory_of' renamed to 'theory';
wenzelm@5397: 
wenzelm@5363: 
wenzelm@5127: *** Proof tools ***
nipkow@4880: 
nipkow@5657: * Simplifier:
nipkow@5657:   1. Asm_full_simp_tac is now more aggressive.
nipkow@5657:      1. It will sometimes reorient premises if that increases their power to
nipkow@5657:         simplify.
nipkow@5657:      2. It does no longer proceed strictly from left to right but may also
nipkow@5657:         rotate premises to achieve further simplification.
nipkow@5657:      For compatibility reasons there is now Asm_lr_simp_tac which is like the
nipkow@5657:      old Asm_full_simp_tac in that it does not rotate premises.
nipkow@5657:   2. The simplifier now knows a little bit about nat-arithmetic.
nipkow@4880: 
wenzelm@5127: * Classical reasoner: wrapper mechanism for the classical reasoner now
wenzelm@5127: allows for selected deletion of wrappers, by introduction of names for
wenzelm@5127: wrapper functionals.  This implies that addbefore, addSbefore,
wenzelm@5127: addaltern, and addSaltern now take a pair (name, tactic) as argument,
wenzelm@5127: and that adding two tactics with the same name overwrites the first
wenzelm@5127: one (emitting a warning).
oheimb@4824:   type wrapper = (int -> tactic) -> (int -> tactic)
oheimb@4649:   setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
oheimb@4824:   addWrapper, addSWrapper: claset * (string * wrapper) -> claset
oheimb@4824:   delWrapper, delSWrapper: claset *  string            -> claset
oheimb@4649:   getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
oheimb@4649: 
wenzelm@5705: * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
wenzelm@5726: semantics; addbefore now affects only the unsafe part of step_tac
wenzelm@5726: etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
wenzelm@5726: FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
wenzelm@5726: by Force_tac;
oheimb@5524: 
wenzelm@5726: * Classical reasoner: setwrapper to setWrapper and compwrapper to
wenzelm@5726: compWrapper; added safe wrapper (and access functions for it);
oheimb@5524: 
wenzelm@5127: * HOL/split_all_tac is now much faster and fails if there is nothing
wenzelm@5726: to split.  Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
wenzelm@5726: and the names of the automatically generated variables have changed.
wenzelm@5726: split_all_tac has moved within claset() from unsafe wrappers to safe
wenzelm@5726: wrappers, which means that !!-bound variables are split much more
wenzelm@5726: aggressively, and safe_tac and clarify_tac now split such variables.
wenzelm@5726: If this splitting is not appropriate, use delSWrapper "split_all_tac".
wenzelm@5726: Note: the same holds for record_split_tac, which does the job of
wenzelm@5726: split_all_tac for record fields.
wenzelm@5127: 
wenzelm@5726: * HOL/Simplifier: Rewrite rules for case distinctions can now be added
wenzelm@5726: permanently to the default simpset using Addsplits just like
wenzelm@5726: Addsimps. They can be removed via Delsplits just like
wenzelm@5726: Delsimps. Lower-case versions are also available.
wenzelm@5127: 
wenzelm@5726: * HOL/Simplifier: The rule split_if is now part of the default
wenzelm@5726: simpset. This means that the simplifier will eliminate all occurrences
wenzelm@5726: of if-then-else in the conclusion of a goal. To prevent this, you can
wenzelm@5726: either remove split_if completely from the default simpset by
wenzelm@5726: `Delsplits [split_if]' or remove it in a specific call of the
wenzelm@5726: simplifier using `... delsplits [split_if]'.  You can also add/delete
wenzelm@5726: other case splitting rules to/from the default simpset: every datatype
wenzelm@5726: generates suitable rules `split_t_case' and `split_t_case_asm' (where
wenzelm@5726: t is the name of the datatype).
wenzelm@5127: 
wenzelm@5726: * Classical reasoner / Simplifier combination: new force_tac (and
wenzelm@5127: derivatives Force_tac, force) combines rewriting and classical
wenzelm@5127: reasoning (and whatever other tools) similarly to auto_tac, but is
wenzelm@5726: aimed to solve the given subgoal completely.
wenzelm@5127: 
wenzelm@5127: 
wenzelm@5127: *** General ***
wenzelm@5127: 
wenzelm@5217: * new top-level commands `Goal' and `Goalw' that improve upon `goal'
wenzelm@5127: and `goalw': the theory is no longer needed as an explicit argument -
wenzelm@5127: the current theory context is used; assumptions are no longer returned
wenzelm@5127: at the ML-level unless one of them starts with ==> or !!; it is
wenzelm@5217: recommended to convert to these new commands using isatool fixgoal
wenzelm@5217: (backup your sources first!);
wenzelm@4842: 
wenzelm@5217: * new top-level commands 'thm' and 'thms' for retrieving theorems from
wenzelm@5207: the current theory context, and 'theory' to lookup stored theories;
paulson@4806: 
paulson@5722: * new theory section 'locale' for declaring constants, assumptions and
paulson@5722: definitions that have local scope;
paulson@5722: 
wenzelm@5127: * new theory section 'nonterminals' for purely syntactic types;
wenzelm@4858: 
wenzelm@5127: * new theory section 'setup' for generic ML setup functions
wenzelm@5127: (e.g. package initialization);
wenzelm@4869: 
wenzelm@5131: * the distribution now includes Isabelle icons: see
wenzelm@5131: lib/logo/isabelle-{small,tiny}.xpm;
wenzelm@5131: 
wenzelm@5363: * isatool install - install binaries with absolute references to
wenzelm@5363: ISABELLE_HOME/bin;
wenzelm@5363: 
wenzelm@5572: * isatool logo -- create instances of the Isabelle logo (as EPS);
wenzelm@5572: 
wenzelm@5407: * print mode 'emacs' reserved for Isamode;
wenzelm@5407: 
wenzelm@5726: * support multiple print (ast) translations per constant name;
wenzelm@5726: 
wenzelm@6925: * theorems involving oracles are now printed with a suffixed [!];
wenzelm@6925: 
wenzelm@4711: 
paulson@4661: *** HOL ***
paulson@4661: 
wenzelm@5710: * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
nipkow@5709: 
wenzelm@5217: * HOL/inductive package reorganized and improved: now supports mutual
paulson@5267: definitions such as
wenzelm@5217: 
wenzelm@5217:   inductive EVEN ODD
wenzelm@5217:     intrs
wenzelm@5217:       null "0 : EVEN"
wenzelm@5217:       oddI "n : EVEN ==> Suc n : ODD"
wenzelm@5217:       evenI "n : ODD ==> Suc n : EVEN"
wenzelm@5217: 
wenzelm@5217: new theorem list "elims" contains an elimination rule for each of the
wenzelm@5217: recursive sets; inductive definitions now handle disjunctive premises
wenzelm@5217: correctly (also ZF);
berghofe@5214: 
wenzelm@5217: INCOMPATIBILITIES: requires Inductive as an ancestor; component
wenzelm@5217: "mutual_induct" no longer exists - the induction rule is always
wenzelm@5217: contained in "induct";
wenzelm@5217: 
wenzelm@5217: 
wenzelm@5217: * HOL/datatype package re-implemented and greatly improved: now
paulson@5267: supports mutually recursive datatypes such as
wenzelm@5217: 
wenzelm@5217:   datatype
wenzelm@5217:     'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
wenzelm@5217:             | SUM ('a aexp) ('a aexp)
wenzelm@5217:             | DIFF ('a aexp) ('a aexp)
wenzelm@5217:             | NUM 'a
wenzelm@5217:   and
wenzelm@5217:     'a bexp = LESS ('a aexp) ('a aexp)
wenzelm@5217:             | AND ('a bexp) ('a bexp)
wenzelm@5217:             | OR ('a bexp) ('a bexp)
wenzelm@5217: 
paulson@5267: as well as indirectly recursive datatypes such as
berghofe@5214: 
wenzelm@5217:   datatype
wenzelm@5217:     ('a, 'b) term = Var 'a
wenzelm@5217:                   | App 'b ((('a, 'b) term) list)
berghofe@5214: 
wenzelm@5217: The new tactic  mutual_induct_tac [<var_1>, ..., <var_n>] i  performs
wenzelm@5217: induction on mutually / indirectly recursive datatypes.
wenzelm@5217: 
wenzelm@5217: Primrec equations are now stored in theory and can be accessed via
wenzelm@5217: <function_name>.simps.
wenzelm@5217: 
wenzelm@5217: INCOMPATIBILITIES:
berghofe@5214: 
wenzelm@5217:   - Theories using datatypes must now have theory Datatype as an
wenzelm@5217:     ancestor.
wenzelm@5217:   - The specific <typename>.induct_tac no longer exists - use the
wenzelm@5217:     generic induct_tac instead.
berghofe@5226:   - natE has been renamed to nat.exhaust - use exhaust_tac
wenzelm@5217:     instead of res_inst_tac ... natE. Note that the variable
berghofe@5226:     names in nat.exhaust differ from the names in natE, this
wenzelm@5217:     may cause some "fragile" proofs to fail.
wenzelm@5217:   - The theorems split_<typename>_case and split_<typename>_case_asm
wenzelm@5217:     have been renamed to <typename>.split and <typename>.split_asm.
wenzelm@5217:   - Since default sorts of type variables are now handled correctly,
wenzelm@5217:     some datatype definitions may have to be annotated with explicit
wenzelm@5217:     sort constraints.
wenzelm@5217:   - Primrec definitions no longer require function name and type
wenzelm@5217:     of recursive argument.
berghofe@5214: 
wenzelm@5217: Consider using isatool fixdatatype to adapt your theories and proof
wenzelm@5217: scripts to the new package (backup your sources first!).
wenzelm@5217: 
wenzelm@5217: 
wenzelm@5726: * HOL/record package: considerably improved implementation; now
wenzelm@5726: includes concrete syntax for record types, terms, updates; theorems
wenzelm@5726: for surjective pairing and splitting !!-bound record variables; proof
wenzelm@5726: support is as follows:
wenzelm@5726: 
wenzelm@5726:   1) standard conversions (selectors or updates applied to record
wenzelm@5726: constructor terms) are part of the standard simpset;
wenzelm@5726: 
wenzelm@5726:   2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
wenzelm@5726: made part of standard simpset and claset via addIffs;
wenzelm@5726: 
wenzelm@5726:   3) a tactic for record field splitting (record_split_tac) is part of
wenzelm@5726: the standard claset (addSWrapper);
wenzelm@5726: 
wenzelm@5726: To get a better idea about these rules you may retrieve them via
wenzelm@5726: something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
wenzelm@5726: the name of your record type.
wenzelm@5726: 
wenzelm@5726: The split tactic 3) conceptually simplifies by the following rule:
wenzelm@5726: 
wenzelm@5726:   "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
wenzelm@5726: 
wenzelm@5726: Thus any record variable that is bound by meta-all will automatically
wenzelm@5726: blow up into some record constructor term, consequently the
wenzelm@5726: simplifications of 1), 2) apply.  Thus force_tac, auto_tac etc. shall
wenzelm@5726: solve record problems automatically.
wenzelm@5726: 
berghofe@5214: 
wenzelm@5125: * reorganized the main HOL image: HOL/Integ and String loaded by
wenzelm@5125: default; theory Main includes everything;
wenzelm@5125: 
paulson@5650: * automatic simplification of integer sums and comparisons, using cancellation;
paulson@5650: 
oheimb@5526: * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
wenzelm@5127: 
wenzelm@5127: * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
wenzelm@5127: 
wenzelm@5127: * many new identities for unions, intersections, set difference, etc.;
wenzelm@5127: 
wenzelm@5127: * expand_if, expand_split, expand_sum_case and expand_nat_case are now
wenzelm@5127: called split_if, split_split, split_sum_case and split_nat_case (to go
wenzelm@5127: with add/delsplits);
wenzelm@5125: 
wenzelm@5127: * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
wenzelm@5127: (?x::unit) = (); this is made part of the default simpset, which COULD
wenzelm@5127: MAKE EXISTING PROOFS FAIL under rare circumstances (consider
wenzelm@5207: 'Delsimprocs [unit_eq_proc];' as last resort); also note that
wenzelm@5207: unit_abs_eta_conv is added in order to counter the effect of
wenzelm@5207: unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
wenzelm@5207: %u.f();
wenzelm@5125: 
wenzelm@5217: * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
wenzelm@5217: makes more sense);
berghofe@5109: 
paulson@5475: * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475:   It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475:   disjointness reasoning but breaking a few old proofs.
paulson@5267: 
wenzelm@5217: * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
wenzelm@5217: to 'converse' from 'inverse' (for compatibility with ZF and some
wenzelm@5217: literature);
wenzelm@5085: 
wenzelm@5127: * HOL/recdef can now declare non-recursive functions, with {} supplied as
wenzelm@5127: the well-founded relation;
oheimb@4838: 
paulson@5490: * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
paulson@5490:     Compl A.  The "Compl" syntax remains available as input syntax for this
paulson@5490:     release ONLY.
paulson@5490: 
wenzelm@5127: * HOL/Update: new theory of function updates:
wenzelm@5127:     f(a:=b) == %x. if x=a then b else f x
wenzelm@5127: may also be iterated as in f(a:=b,c:=d,...);
nipkow@5077: 
wenzelm@5127: * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
paulson@4899: 
nipkow@5282: * HOL/List:
nipkow@5282:   - new function list_update written xs[i:=v] that updates the i-th
nipkow@5282:     list position. May also be iterated as in xs[i:=a,j:=b,...].
nipkow@5428:   - new function `upt' written [i..j(] which generates the list
nipkow@5428:     [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
nipkow@5428:     bound write [i..j], which is a shorthand for [i..j+1(].
nipkow@5282:   - new lexicographic orderings and corresponding wellfoundedness theorems.
paulson@4779: 
wenzelm@5127: * HOL/Arith:
wenzelm@5127:   - removed 'pred' (predecessor) function;
wenzelm@5127:   - generalized some theorems about n-1;
wenzelm@5127:   - many new laws about "div" and "mod";
wenzelm@5127:   - new laws about greatest common divisors (see theory ex/Primes);
oheimb@4766: 
wenzelm@5127: * HOL/Relation: renamed the relational operator r^-1 "converse"
wenzelm@4842: instead of "inverse";
wenzelm@4711: 
nipkow@5651: * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
nipkow@5651:   of the multiset ordering;
nipkow@5651: 
wenzelm@5127: * directory HOL/Real: a construction of the reals using Dedekind cuts
nipkow@5651:   (not included by default);
nipkow@4835: 
wenzelm@5127: * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
wenzelm@4711: 
nipkow@5651: * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
nipkow@5651:   programs, i.e. different program variables may have different types.
nipkow@5651: 
paulson@5142: * calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142:   [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308:   Now rew can involve either definitions or equalities (either == or =).
wenzelm@5002: 
wenzelm@5363: 
paulson@4879: *** ZF ***
paulson@4879: 
paulson@5332: * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
paulson@5332:   only the theorems proved on ZF.ML;
paulson@5160: 
paulson@5475: * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475:   It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475:   disjointness reasoning but breaking a few old proofs.
paulson@5267: 
paulson@5160: * ZF/Update: new theory of function updates
paulson@5160:     with default rewrite rule  f(x:=y) ` z = if(z=x, y, f`z)
paulson@5160:   may also be iterated as in f(a:=b,c:=d,...);
paulson@5160: 
paulson@4879: * in  let x=t in u(x), neither t nor u(x) has to be an FOL term.
oheimb@4649: 
paulson@5142: * calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142:   [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308:   Now rew can involve either definitions or equalities (either == or =).
paulson@5142: 
paulson@5160: * case_tac provided for compatibility with HOL
paulson@5160:     (like the old excluded_middle_tac, but with subgoals swapped)
paulson@5160: 
wenzelm@4842: 
wenzelm@5127: *** Internal programming interfaces ***
wenzelm@5002: 
wenzelm@5251: * Pure: several new basic modules made available for general use, see
wenzelm@5251: also src/Pure/README;
wenzelm@5207: 
wenzelm@5008: * improved the theory data mechanism to support encapsulation (data
wenzelm@5008: kind name replaced by private Object.kind, acting as authorization
wenzelm@5373: key); new type-safe user interface via functor TheoryDataFun; generic
wenzelm@5373: print_data function becomes basically useless;
wenzelm@5002: 
wenzelm@5251: * removed global_names compatibility flag -- all theory declarations
wenzelm@5251: are qualified by default;
wenzelm@5251: 
wenzelm@5085: * module Pure/Syntax now offers quote / antiquote translation
wenzelm@5085: functions (useful for Hoare logic etc. with implicit dependencies);
wenzelm@5373: see HOL/ex/Antiquote for an example use;
wenzelm@5085: 
wenzelm@5127: * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
wenzelm@5127: cterm -> thm;
wenzelm@5127: 
wenzelm@5207: * new tactical CHANGED_GOAL for checking that a tactic modifies a
wenzelm@5207: subgoal;
paulson@5142: 
wenzelm@5251: * Display.print_goals function moved to Locale.print_goals;
wenzelm@5251: 
wenzelm@5731: * standard print function for goals supports current_goals_markers
wenzelm@5731: variable for marking begin of proof, end of proof, start of goal; the
wenzelm@5731: default is ("", "", ""); setting current_goals_markers := ("<proof>",
wenzelm@5731: "</proof>", "<goal>") causes SGML like tagged proof state printing,
wenzelm@5731: for example;
wenzelm@5731: 
wenzelm@5002: 
wenzelm@5002: 
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 `<simpset> setloop (split_tac <thms>)'
paulson@4325:   you can simply write `<simpset> addsplits <thms>'
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: 
wenzelm@5726: * 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: 
oheimb@4930:   and 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@4930:   which can be added to a simpset via `addsplits'. The existing theorems
oheimb@4930:   expand_list_case and expand_option_case have been renamed to
oheimb@4930:   split_list_case and split_option_case.
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@4502: * HOL/Lists:
nipkow@4502:   the function "set_of_list" has been renamed "set" (and its theorems too);
nipkow@4502:   the function "nth" now takes its arguments in the reverse order and
nipkow@4502:   has acquired the infix notation "!" as in "xs!n".
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@4575: * HOL/record: extensible records with schematic structural subtyping
wenzelm@4575: (single inheritance); EXPERIMENTAL version demonstrating the encoding,
wenzelm@4575: still lacks various theorems and concrete record syntax;
wenzelm@4575: 
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 <x,y,zs>.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: 
wenzelm@5726: * 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
wenzelm@5726:         (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: 
wenzelm@5726: * 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
wenzelm@5726:     _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: 
wenzelm@5726: * HOLCF changes: derived all rules and arities
wenzelm@5726:   + 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: 
wenzelm@5726: * 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: 
wenzelm@5726: * 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: 
wenzelm@5726: * new infix operator, addss, allowing the classical reasoner to
paulson@2557: perform simplification at each step of its search.  Example:
wenzelm@5726:         fast_tac (cs addss ss)
paulson@2557: 
wenzelm@5726: * a new logic, CHOL, the same as HOL, but with a curried syntax
wenzelm@5726: for functions.  Application looks like f a b instead of f(a,b).  Also pairs
paulson@2557: look like (a,b) instead of <a,b>;
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: 
wenzelm@5726: * 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: 
wenzelm@5726: * 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$