NEWS
author haftmann
Thu May 01 09:30:32 2014 +0200 (2014-05-01)
changeset 56807 ab36ec0c8eb5
parent 56787 81dc6fffdf30
child 56815 848d507584db
permissions -rw-r--r--
NEWS
     1 Isabelle NEWS -- history user-relevant changes
     2 ==============================================
     3 
     4 New in this Isabelle version
     5 ----------------------------
     6 
     7 *** General ***
     8 
     9 * Document antiquotation @{url} produces markup for the given URL,
    10 which results in an active hyperlink within the text.
    11 
    12 * Document antiquotation @{file_unchecked} is like @{file}, but does
    13 not check existence within the file-system.
    14 
    15 * Discontinued legacy_isub_isup, which was a temporary Isabelle/ML
    16 workaround in Isabelle2013-1.  The prover process no longer accepts
    17 old identifier syntax with \<^isub> or \<^isup>.
    18 
    19 * Syntax of document antiquotation @{rail} now uses \<newline> instead
    20 of "\\", to avoid the optical illusion of escaped backslash within
    21 string token.  Minor INCOMPATIBILITY.
    22 
    23 * Lexical syntax (inner and outer) supports text cartouches with
    24 arbitrary nesting, and without escapes of quotes etc.  The Prover IDE
    25 supports input via ` (backquote).
    26 
    27 * The outer syntax categories "text" (for formal comments and document
    28 markup commands) and "altstring" (for literal fact references) allow
    29 cartouches as well, in addition to the traditional mix of quotations.
    30 
    31 * More static checking of proof methods, which allows the system to
    32 form a closure over the concrete syntax.  Method arguments should be
    33 processed in the original proof context as far as possible, before
    34 operating on the goal state.  In any case, the standard discipline for
    35 subgoal-addressing needs to be observed: no subgoals or a subgoal
    36 number that is out of range produces an empty result sequence, not an
    37 exception.  Potential INCOMPATIBILITY for non-conformant tactical
    38 proof tools.
    39 
    40 * Support for official Standard ML within the Isabelle context.
    41 Command 'SML_file' reads and evaluates the given Standard ML file.
    42 Toplevel bindings are stored within the theory context; the initial
    43 environment is restricted to the Standard ML implementation of
    44 Poly/ML, without the add-ons of Isabelle/ML.  Commands 'SML_import'
    45 and 'SML_export' allow to exchange toplevel bindings between the two
    46 separate environments.  See also ~~/src/Tools/SML/Examples.thy for
    47 some examples.
    48 
    49 
    50 *** Prover IDE -- Isabelle/Scala/jEdit ***
    51 
    52 * Improved syntactic and semantic completion mechanism:
    53 
    54   - No completion for Isar keywords that have already been recognized
    55     by the prover, e.g. ":" within accepted Isar syntax looses its
    56     meaning as abbreviation for symbol "\<in>".
    57 
    58   - Completion context provides information about embedded languages
    59     of Isabelle: keywords are only completed for outer syntax, symbols
    60     or antiquotations for languages that support them.  E.g. no symbol
    61     completion for ML source, but within ML strings, comments,
    62     antiquotations.
    63 
    64   - Support for semantic completion based on failed name space lookup.
    65     The error produced by the prover contains information about
    66     alternative names that are accessible in a particular position.
    67     This may be used with explicit completion (C+b) or implicit
    68     completion after some delay.
    69 
    70   - Semantic completions may get extended by appending a suffix of
    71     underscores to an already recognized name, e.g. "foo_" to complete
    72     "foo" or "foobar" if these are known in the context.  The special
    73     identifier "__" serves as a wild-card in this respect: it
    74     completes to the full collection of names from the name space
    75     (truncated according to the system option "completion_limit").
    76 
    77   - Syntax completion of the editor and semantic completion of the
    78     prover are merged.  Since the latter requires a full round-trip of
    79     document update to arrive, the default for option
    80     jedit_completion_delay has been changed to 0.5s to improve the
    81     user experience.
    82 
    83   - Option jedit_completion_immediate may now get used with
    84     jedit_completion_delay > 0, to complete symbol abbreviations
    85     aggressively while benefiting from combined syntactic and semantic
    86     completion.
    87 
    88   - Support for simple completion templates (with single
    89     place-holder), e.g. "`" for text cartouche, or "@{" for
    90     antiquotation.
    91 
    92   - Improved treatment of completion vs. various forms of jEdit text
    93     selection (multiple selections, rectangular selections,
    94     rectangular selection as "tall caret").
    95 
    96   - More reliable treatment of GUI events vs. completion popups: avoid
    97     loosing keystrokes with slow / remote graphics displays.
    98 
    99 * Integrated spell-checker for document text, comments etc. with
   100 completion popup and context-menu.  See also "Plugin Options /
   101 Isabelle / General / Spell Checker" for some system options.
   102 
   103 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
   104 Open text buffers take precedence over copies within the file-system.
   105 
   106 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for
   107 auxiliary ML files.
   108 
   109 * Document panel: simplied interaction where every single mouse click
   110 (re)opens document via desktop environment or as jEdit buffer.
   111 
   112 * Find panel: support for 'find_consts' in addition to
   113 'find_theorems'.
   114 
   115 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
   116 General") allows to specify additional print modes for the prover
   117 process, without requiring old-fashioned command-line invocation of
   118 "isabelle jedit -m MODE".
   119 
   120 * New panel: Simplifier trace.  Provides an interactive view of the
   121 simplification process, enabled by the newly-introduced
   122 "simplifier_trace" declaration.
   123 
   124 * Support for Navigator plugin (with toolbar buttons).
   125 
   126 * More support for remote files (e.g. http) using standard Java
   127 networking operations instead of jEdit virtual file-systems.
   128 
   129 
   130 *** Pure ***
   131 
   132 * Basic constants of Pure use more conventional names and are always
   133 qualified.  Rare INCOMPATIBILITY, but with potentially serious
   134 consequences, notably for tools in Isabelle/ML.  The following
   135 renaming needs to be applied:
   136 
   137   ==             ~>  Pure.eq
   138   ==>            ~>  Pure.imp
   139   all            ~>  Pure.all
   140   TYPE           ~>  Pure.type
   141   dummy_pattern  ~>  Pure.dummy_pattern
   142 
   143 Systematic porting works by using the following theory setup on a
   144 *previous* Isabelle version to introduce the new name accesses for the
   145 old constants:
   146 
   147 setup {*
   148   fn thy => thy
   149     |> Sign.root_path
   150     |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="
   151     |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"
   152     |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"
   153     |> Sign.restore_naming thy
   154 *}
   155 
   156 Thus ML antiquotations like @{const_name Pure.eq} may be used already.
   157 Later the application is moved to the current Isabelle version, and
   158 the auxiliary aliases are deleted.
   159 
   160 * Low-level type-class commands 'classes', 'classrel', 'arities' have
   161 been discontinued to avoid the danger of non-trivial axiomatization
   162 that is not immediately visible.  INCOMPATIBILITY, use regular
   163 'instance' with proof.  The required OFCLASS(...) theorem might be
   164 postulated via 'axiomatization' beforehand, or the proof finished
   165 trivially if the underlying class definition is made vacuous (without
   166 any assumptions).  See also Isabelle/ML operations
   167 Axclass.axiomatize_class, Axclass.axiomatize_classrel,
   168 Axclass.axiomatize_arity.
   169 
   170 * Attributes "where" and "of" allow an optional context of local
   171 variables ('for' declaration): these variables become schematic in the
   172 instantiated theorem.
   173 
   174 * Obsolete attribute "standard" has been discontinued (legacy since
   175 Isabelle2012).  Potential INCOMPATIBILITY, use explicit 'for' context
   176 where instantiations with schematic variables are intended (for
   177 declaration commands like 'lemmas' or attributes like "of").  The
   178 following temporary definition may help to port old applications:
   179 
   180   attribute_setup standard =
   181     "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
   182 
   183 * More thorough check of proof context for goal statements and
   184 attributed fact expressions (concerning background theory, declared
   185 hyps).  Potential INCOMPATIBILITY, tools need to observe standard
   186 context discipline.  See also Assumption.add_assumes and the more
   187 primitive Thm.assume_hyps.
   188 
   189 * Inner syntax token language allows regular quoted strings "..."
   190 (only makes sense in practice, if outer syntax is delimited
   191 differently).
   192 
   193 
   194 *** HOL ***
   195 
   196 * Adjustion of INF and SUP operations:
   197   * Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.
   198   * Consolidated theorem names containing INFI and SUPR: have INF
   199   and SUP instead uniformly.
   200   * More aggressive normalization of expressions involving INF and Inf
   201   or SUP and Sup.
   202   * INF_image and SUP_image do not unfold composition.
   203   * Dropped facts INF_comp, SUP_comp.
   204   * Default congruence rules strong_INF_cong and strong_SUP_cong,
   205   with simplifier implication in premises.  Generalize and replace
   206   former INT_cong, SUP_cong
   207 INCOMPATIBILITY.
   208 
   209 * Swapped orientation of facts image_comp and vimage_comp:
   210   image_compose ~> image_comp [symmetric]
   211   image_comp ~> image_comp [symmetric]
   212   vimage_compose ~> vimage_comp [symmetric]
   213   vimage_comp ~> vimage_comp [symmetric]
   214   INCOMPATIBILITY.
   215 
   216 * Simplifier: Enhanced solver of preconditions of rewrite rules
   217   can now deal with conjunctions.
   218   For help with converting proofs, the old behaviour of the simplifier
   219   can be restored like this:  declare/using [[simp_legacy_precond]]
   220   This configuration option will disappear again in the future.
   221 
   222 * HOL-Word:
   223   * Abandoned fact collection "word_arith_alts", which is a
   224   duplicate of "word_arith_wis".
   225   * Dropped first (duplicated) element in fact collections
   226   "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
   227   "uint_word_arith_bintrs".
   228 
   229 * Code generator: explicit proof contexts in many ML interfaces.
   230 INCOMPATIBILITY.
   231 
   232 * Code generator: minimize exported identifiers by default.
   233 Minor INCOMPATIBILITY.
   234 
   235 * Code generation for SML and OCaml: dropped arcane "no_signatures" option.
   236 Minor INCOMPATIBILITY.
   237 
   238 * Simproc "finite_Collect" is no longer enabled by default, due to
   239 spurious crashes and other surprises.  Potential INCOMPATIBILITY.
   240 
   241 * Moved new (co)datatype package and its dependencies from "HOL-BNF" to "HOL".
   242   The "bnf", "wrap_free_constructors", "datatype_new", "codatatype",
   243   "primcorec", and "primcorecursive" commands are now part of "Main".
   244   Theory renamings:
   245     FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
   246     Library/Wfrec.thy ~> Wfrec.thy
   247     Library/Zorn.thy ~> Zorn.thy
   248     Cardinals/Order_Relation.thy ~> Order_Relation.thy
   249     Library/Order_Union.thy ~> Cardinals/Order_Union.thy
   250     Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
   251     Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
   252     Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
   253     Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
   254     Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
   255     BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
   256     BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
   257     BNF/BNF_Comp.thy ~> BNF_Comp.thy
   258     BNF/BNF_Def.thy ~> BNF_Def.thy
   259     BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
   260     BNF/BNF_GFP.thy ~> BNF_GFP.thy
   261     BNF/BNF_LFP.thy ~> BNF_LFP.thy
   262     BNF/BNF_Util.thy ~> BNF_Util.thy
   263     BNF/Coinduction.thy ~> Coinduction.thy
   264     BNF/More_BNFs.thy ~> Library/More_BNFs.thy
   265     BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
   266     BNF/Examples/* ~> BNF_Examples/*
   267   New theories:
   268     Wellorder_Extension.thy (split from Zorn.thy)
   269     Library/Cardinal_Notations.thy
   270     Library/BNF_Decl.thy
   271     BNF_Examples/Misc_Primcorec.thy
   272     BNF_Examples/Stream_Processor.thy
   273   Discontinued theories:
   274     BNF/BNF.thy
   275     BNF/Equiv_Relations_More.thy
   276   INCOMPATIBILITY.
   277 
   278 * New (co)datatype package:
   279   * "primcorec" is fully implemented.
   280   * "datatype_new" generates size functions ("size_xxx" and "size") as
   281     required by "fun".
   282   * BNFs are integrated with the Lifting tool and new-style (co)datatypes
   283     with Transfer.
   284   * Renamed commands:
   285       datatype_new_compat ~> datatype_compat
   286       primrec_new ~> primrec
   287       wrap_free_constructors ~> free_constructors
   288     INCOMPATIBILITY.
   289   * The generated constants "xxx_case" and "xxx_rec" have been renamed
   290     "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
   291     INCOMPATIBILITY.
   292   * The constant "xxx_(un)fold" and related theorems are no longer generated.
   293     Use "xxx_(co)rec" or define "xxx_(un)fold" manually using "prim(co)rec".
   294     INCOMPATIBILITY.
   295 
   296 * Old datatype package:
   297   * The generated theorems "xxx.cases" and "xxx.recs" have been renamed
   298     "xxx.case" and "xxx.rec" (e.g., "sum.cases" -> "sum.case").
   299     INCOMPATIBILITY.
   300   * The generated constants "xxx_case" and "xxx_rec" have been renamed
   301     "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
   302     INCOMPATIBILITY.
   303 
   304 * The types "'a list" and "'a option", their set and map functions, their
   305   relators, and their selectors are now produced using the new BNF-based
   306   datatype package.
   307   Renamed constants:
   308     Option.set ~> set_option
   309     Option.map ~> map_option
   310     option_rel ~> rel_option
   311     list_size ~> size_list
   312     option_size ~> size_option
   313   Renamed theorems:
   314     set_def ~> set_rec[abs_def]
   315     map_def ~> map_rec[abs_def]
   316     Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
   317     option.recs ~> option.rec
   318     list_all2_def ~> list_all2_iff
   319     set.simps ~> set_simps (or the slightly different "list.set")
   320     map.simps ~> list.map
   321     hd.simps ~> list.sel(1)
   322     tl.simps ~> list.sel(2-3)
   323     the.simps ~> option.sel
   324   INCOMPATIBILITY.
   325 
   326 * The following map functions and relators have been renamed:
   327     sum_map ~> map_sum
   328     map_pair ~> map_prod
   329     prod_rel ~> rel_prod
   330     sum_rel ~> rel_sum
   331     fun_rel ~> rel_fun
   332     set_rel ~> rel_set
   333     filter_rel ~> rel_filter
   334     fset_rel ~> rel_fset (in "Library/FSet.thy")
   335     cset_rel ~> rel_cset (in "Library/Countable_Set_Type.thy")
   336     vset ~> rel_vset (in "Library/Quotient_Set.thy")
   337 
   338 * New theory:
   339     Cardinals/Ordinal_Arithmetic.thy
   340 
   341 * Theory reorganizations:
   342   * Big_Operators.thy ~> Groups_Big.thy and Lattices_Big.thy
   343 
   344 * SMT module:
   345   * A new version of the SMT module, temporarily called "SMT2", uses SMT-LIB 2
   346     and supports recent versions of Z3 (e.g., 4.3). The new proof method is
   347     called "smt2", and the new Z3 is called "z3_new" in Sledgehammer and
   348     elsewhere.
   349 
   350 * Sledgehammer:
   351   - New prover "z3_new" with support for Isar proofs
   352   - New option:
   353       smt_proofs
   354   - Renamed options:
   355       isar_compress ~> compress_isar
   356       isar_try0 ~> try0_isar
   357     INCOMPATIBILITY.
   358 
   359 * Metis:
   360   - Removed legacy proof method 'metisFT'. Use 'metis (full_types)' instead.
   361     INCOMPATIBILITY.
   362 
   363 * Try0: Added 'algebra' and 'meson' to the set of proof methods.
   364 
   365 * Command renaming: enriched_type ~> functor. INCOMPATIBILITY.
   366 
   367 * The symbol "\<newline>" may be used within char or string literals
   368 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
   369 
   370 * Activation of Z3 now works via "z3_non_commercial" system option
   371 (without requiring restart), instead of former settings variable
   372 "Z3_NON_COMMERCIAL".  The option can be edited in Isabelle/jEdit menu
   373 Plugin Options / Isabelle / General.
   374 
   375 * "declare [[code abort: ...]]" replaces "code_abort ...".
   376 INCOMPATIBILITY.
   377 
   378 * "declare [[code drop: ...]]" drops all code equations associated
   379 with the given constants.
   380 
   381 * Abolished slightly odd global lattice interpretation for min/max.
   382 
   383 Fact consolidations:
   384     min_max.inf_assoc ~> min.assoc
   385     min_max.inf_commute ~> min.commute
   386     min_max.inf_left_commute ~> min.left_commute
   387     min_max.inf_idem ~> min.idem
   388     min_max.inf_left_idem ~> min.left_idem
   389     min_max.inf_right_idem ~> min.right_idem
   390     min_max.sup_assoc ~> max.assoc
   391     min_max.sup_commute ~> max.commute
   392     min_max.sup_left_commute ~> max.left_commute
   393     min_max.sup_idem ~> max.idem
   394     min_max.sup_left_idem ~> max.left_idem
   395     min_max.sup_inf_distrib1 ~> max_min_distrib2
   396     min_max.sup_inf_distrib2 ~> max_min_distrib1
   397     min_max.inf_sup_distrib1 ~> min_max_distrib2
   398     min_max.inf_sup_distrib2 ~> min_max_distrib1
   399     min_max.distrib ~> min_max_distribs
   400     min_max.inf_absorb1 ~> min.absorb1
   401     min_max.inf_absorb2 ~> min.absorb2
   402     min_max.sup_absorb1 ~> max.absorb1
   403     min_max.sup_absorb2 ~> max.absorb2
   404     min_max.le_iff_inf ~> min.absorb_iff1
   405     min_max.le_iff_sup ~> max.absorb_iff2
   406     min_max.inf_le1 ~> min.cobounded1
   407     min_max.inf_le2 ~> min.cobounded2
   408     le_maxI1, min_max.sup_ge1 ~> max.cobounded1
   409     le_maxI2, min_max.sup_ge2 ~> max.cobounded2
   410     min_max.le_infI1 ~> min.coboundedI1
   411     min_max.le_infI2 ~> min.coboundedI2
   412     min_max.le_supI1 ~> max.coboundedI1
   413     min_max.le_supI2 ~> max.coboundedI2
   414     min_max.less_infI1 ~> min.strict_coboundedI1
   415     min_max.less_infI2 ~> min.strict_coboundedI2
   416     min_max.less_supI1 ~> max.strict_coboundedI1
   417     min_max.less_supI2 ~> max.strict_coboundedI2
   418     min_max.inf_mono ~> min.mono
   419     min_max.sup_mono ~> max.mono
   420     min_max.le_infI, min_max.inf_greatest ~> min.boundedI
   421     min_max.le_supI, min_max.sup_least ~> max.boundedI
   422     min_max.le_inf_iff ~> min.bounded_iff
   423     min_max.le_sup_iff ~> max.bounded_iff
   424 
   425 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
   426 min.left_commute, min.left_idem, max.commute, max.assoc,
   427 max.left_commute, max.left_idem directly.
   428 
   429 For min_max.inf_sup_ord, prefer (one of) min.cobounded1, min.cobounded2,
   430 max.cobounded1m max.cobounded2 directly.
   431 
   432 For min_ac or max_ac, prefer more general collection ac_simps.
   433 
   434 INCOMPATBILITY. 
   435 
   436 * Word library: bit representations prefer type bool over type bit.
   437 INCOMPATIBILITY.
   438 
   439 * Theorem disambiguation Inf_le_Sup (on finite sets) ~> Inf_fin_le_Sup_fin.
   440 INCOMPATIBILITY.
   441 
   442 * Code generations are provided for make, fields, extend and truncate
   443 operations on records.
   444 
   445 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
   446 INCOMPATIBILITY.
   447 
   448 * Fact generalization and consolidation:
   449     neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
   450 INCOMPATIBILITY.
   451 
   452 * Purely algebraic definition of even.  Fact generalization and consolidation:
   453     nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
   454     even_zero_(nat|int) ~> even_zero
   455 INCOMPATIBILITY.
   456 
   457 * Abolished neg_numeral.
   458   * Canonical representation for minus one is "- 1".
   459   * Canonical representation for other negative numbers is "- (numeral _)".
   460   * When devising rule sets for number calculation, consider the
   461     following canonical cases: 0, 1, numeral _, - 1, - numeral _.
   462   * HOLogic.dest_number also recognizes numerals in non-canonical forms
   463     like "numeral One", "- numeral One", "- 0" and even "- ... - _".
   464   * Syntax for negative numerals is mere input syntax.
   465 INCOMPATBILITY.
   466 
   467 * Elimination of fact duplicates:
   468     equals_zero_I ~> minus_unique
   469     diff_eq_0_iff_eq ~> right_minus_eq
   470     nat_infinite ~> infinite_UNIV_nat
   471     int_infinite ~> infinite_UNIV_int
   472 INCOMPATIBILITY.
   473 
   474 * Fact name consolidation:
   475     diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
   476     minus_le_self_iff ~> neg_less_eq_nonneg
   477     le_minus_self_iff ~> less_eq_neg_nonpos
   478     neg_less_nonneg ~> neg_less_pos
   479     less_minus_self_iff ~> less_neg_neg [simp]
   480 INCOMPATIBILITY.
   481 
   482 * More simplification rules on unary and binary minus:
   483 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
   484 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
   485 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
   486 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
   487 minus_add_cancel, uminus_add_conv_diff.  These correspondingly
   488 have been taken away from fact collections algebra_simps and
   489 field_simps.  INCOMPATIBILITY.
   490 
   491 To restore proofs, the following patterns are helpful:
   492 
   493 a) Arbitrary failing proof not involving "diff_def":
   494 Consider simplification with algebra_simps or field_simps.
   495 
   496 b) Lifting rules from addition to subtraction:
   497 Try with "using <rule for addition> of [... "- _" ...]" by simp".
   498 
   499 c) Simplification with "diff_def": just drop "diff_def".
   500 Consider simplification with algebra_simps or field_simps;
   501 or the brute way with
   502 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
   503 
   504 * SUP and INF generalized to conditionally_complete_lattice
   505 
   506 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
   507 Conditionally_Complete_Lattices.   INCOMPATIBILITY.
   508 
   509 * Introduce bdd_above and bdd_below in Conditionally_Complete_Lattices, use them
   510 instead of explicitly stating boundedness of sets.
   511 
   512 * ccpo.admissible quantifies only over non-empty chains to allow
   513 more syntax-directed proof rules; the case of the empty chain
   514 shows up as additional case in fixpoint induction proofs.
   515 INCOMPATIBILITY
   516 
   517 * Removed and renamed theorems in Series:
   518   summable_le         ~>  suminf_le
   519   suminf_le           ~>  suminf_le_const
   520   series_pos_le       ~>  setsum_le_suminf
   521   series_pos_less     ~>  setsum_less_suminf
   522   suminf_ge_zero      ~>  suminf_nonneg
   523   suminf_gt_zero      ~>  suminf_pos
   524   suminf_gt_zero_iff  ~>  suminf_pos_iff
   525   summable_sumr_LIMSEQ_suminf  ~>  summable_LIMSEQ
   526   suminf_0_le         ~>  suminf_nonneg [rotate]
   527   pos_summable        ~>  summableI_nonneg_bounded
   528   ratio_test          ~>  summable_ratio_test
   529 
   530   removed series_zero, replaced by sums_finite
   531 
   532   removed auxiliary lemmas:
   533     sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
   534     half, le_Suc_ex_iff, lemma_realpow_diff_sumr, real_setsum_nat_ivl_bounded,
   535     summable_le2, ratio_test_lemma2, sumr_minus_one_realpow_zerom,
   536     sumr_one_lb_realpow_zero, summable_convergent_sumr_iff, sumr_diff_mult_const
   537 INCOMPATIBILITY.
   538 
   539 * Replace (F)DERIV syntax by has_derivative:
   540   - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
   541 
   542   - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
   543 
   544   - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
   545 
   546   - removed constant isDiff
   547 
   548   - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as input
   549     syntax.
   550 
   551   - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed
   552 
   553   - Renamed FDERIV_... lemmas to has_derivative_...
   554 
   555   - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
   556 
   557   - removed DERIV_intros, has_derivative_eq_intros
   558 
   559   - introduced derivative_intros and deriative_eq_intros which includes now rules for
   560     DERIV, has_derivative and has_vector_derivative.
   561 
   562   - Other renamings:
   563     differentiable_def        ~>  real_differentiable_def
   564     differentiableE           ~>  real_differentiableE
   565     fderiv_def                ~>  has_derivative_at
   566     field_fderiv_def          ~>  field_has_derivative_at
   567     isDiff_der                ~>  differentiable_def
   568     deriv_fderiv              ~>  has_field_derivative_def
   569     deriv_def                 ~>  DERIV_def
   570 INCOMPATIBILITY.
   571 
   572 * Include more theorems in continuous_intros. Remove the continuous_on_intros,
   573   isCont_intros collections, these facts are now in continuous_intros.
   574 
   575 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
   576 
   577 * Nitpick:
   578   - Fixed soundness bug whereby mutually recursive datatypes could take
   579     infinite values.
   580   - Fixed soundness bug with low-level number functions such as "Abs_Integ" and
   581     "Rep_Integ".
   582   - Removed "std" option.
   583   - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
   584     "hide_types".
   585 
   586 * HOL-Multivariate_Analysis:
   587   - type class ordered_real_vector for ordered vector spaces
   588   - changed order of ordered_euclidean_space to be compatible with
   589     pointwise ordering on products. Therefore instance of
   590     conditionally_complete_lattice and ordered_real_vector.
   591     INCOMPATIBILITY: use box instead of greaterThanLessThan or
   592     explicit set-comprehensions with eucl_less for other (half-) open
   593     intervals.
   594 
   595   - renamed theorems:
   596     derivative_linear         ~>  has_derivative_bounded_linear
   597     derivative_is_linear      ~>  has_derivative_linear
   598     bounded_linear_imp_linear ~>  bounded_linear.linear
   599 
   600 
   601 *** Scala ***
   602 
   603 * The signature and semantics of Document.Snapshot.cumulate_markup /
   604 select_markup have been clarified.  Markup is now traversed in the
   605 order of reports given by the prover: later markup is usually more
   606 specific and may override results accumulated so far.  The elements
   607 guard is mandatory and checked precisely.  Subtle INCOMPATIBILITY.
   608 
   609 
   610 *** ML ***
   611 
   612 * Moved ML_Compiler.exn_trace and other operations on exceptions to
   613 structure Runtime.  Minor INCOMPATIBILITY.
   614 
   615 * Discontinued old Toplevel.debug in favour of system option
   616 "ML_exception_trace", which may be also declared within the context via
   617 "declare [[ML_exception_trace = true]]".  Minor INCOMPATIBILITY.
   618 
   619 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor
   620 INCOMPATIBILITY.
   621 
   622 * Configuration option "ML_print_depth" controls the pretty-printing
   623 depth of the ML compiler within the context.  The old print_depth in
   624 ML is still available as default_print_depth, but rarely used.  Minor
   625 INCOMPATIBILITY.
   626 
   627 * Proper context discipline for read_instantiate and instantiate_tac:
   628 variables that are meant to become schematic need to be given as
   629 fixed, and are generalized by the explicit context of local variables.
   630 This corresponds to Isar attributes "where" and "of" with 'for'
   631 declaration.  INCOMPATIBILITY, also due to potential change of indices
   632 of schematic variables.
   633 
   634 * Toplevel function "use" refers to raw ML bootstrap environment,
   635 without Isar context nor antiquotations.  Potential INCOMPATIBILITY.
   636 Note that 'ML_file' is the canonical command to load ML files into the
   637 formal context.
   638 
   639 * Proper context for basic Simplifier operations: rewrite_rule,
   640 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
   641 pass runtime Proof.context (and ensure that the simplified entity
   642 actually belongs to it).
   643 
   644 * Subtle change of semantics of Thm.eq_thm: theory stamps are not
   645 compared (according to Thm.thm_ord), but assumed to be covered by the
   646 current background theory.  Thus equivalent data produced in different
   647 branches of the theory graph usually coincides (e.g. relevant for
   648 theory merge).  Note that the softer Thm.eq_thm_prop is often more
   649 appropriate than Thm.eq_thm.
   650 
   651 * Simplified programming interface to define ML antiquotations, see
   652 structure ML_Antiquotation.  Minor INCOMPATIBILITY.
   653 
   654 * ML antiquotation @{here} refers to its source position, which is
   655 occasionally useful for experimentation and diagnostic purposes.
   656 
   657 * ML antiquotation @{path} produces a Path.T value, similarly to
   658 Path.explode, but with compile-time check against the file-system and
   659 some PIDE markup.  Note that unlike theory source, ML does not have a
   660 well-defined master directory, so an absolute symbolic path
   661 specification is usually required, e.g. "~~/src/HOL".
   662 
   663 * ML antiquotation @{print} inlines a function to print an arbitrary
   664 ML value, which is occasionally useful for diagnostic or demonstration
   665 purposes.
   666 
   667 
   668 *** System ***
   669 
   670 * Session ROOT specifications require explicit 'document_files' for
   671 robust dependencies on LaTeX sources.  Only these explicitly given
   672 files are copied to the document output directory, before document
   673 processing is started.
   674 
   675 * Simplified "isabelle display" tool.  Settings variables DVI_VIEWER
   676 and PDF_VIEWER now refer to the actual programs, not shell
   677 command-lines.  Discontinued option -c: invocation may be asynchronous
   678 via desktop environment, without any special precautions.  Potential
   679 INCOMPATIBILITY with ambitious private settings.
   680 
   681 * Improved 'display_drafts' concerning desktop integration and
   682 repeated invocation in PIDE front-end: re-use single file
   683 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
   684 
   685 * The raw Isabelle process executable has been renamed from
   686 "isabelle-process" to "isabelle_process", which conforms to common
   687 shell naming conventions, and allows to define a shell function within
   688 the Isabelle environment to avoid dynamic path lookup.  Rare
   689 incompatibility for old tools that do not use the $ISABELLE_PROCESS
   690 settings variable yet.
   691 
   692 * Retired the now unused Isabelle tool "wwwfind". Similar functionality
   693 may be integrated into PIDE/jEdit at a later point.
   694 
   695 New in Isabelle2013-2 (December 2013)
   696 -------------------------------------
   697 
   698 *** Prover IDE -- Isabelle/Scala/jEdit ***
   699 
   700 * More robust editing of running commands with internal forks,
   701 e.g. non-terminating 'by' steps.
   702 
   703 * More relaxed Sledgehammer panel: avoid repeated application of query
   704 after edits surrounding the command location.
   705 
   706 * More status information about commands that are interrupted
   707 accidentally (via physical event or Poly/ML runtime system signal,
   708 e.g. out-of-memory).
   709 
   710 
   711 *** System ***
   712 
   713 * More robust termination of external processes managed by
   714 Isabelle/ML: support cancellation of tasks within the range of
   715 milliseconds, as required for PIDE document editing with automatically
   716 tried tools (e.g. Sledgehammer).
   717 
   718 * Reactivated Isabelle/Scala kill command for external processes on
   719 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
   720 workaround for some Debian/Ubuntu Linux versions from 2013.
   721 
   722 
   723 
   724 New in Isabelle2013-1 (November 2013)
   725 -------------------------------------
   726 
   727 *** General ***
   728 
   729 * Discontinued obsolete 'uses' within theory header.  Note that
   730 commands like 'ML_file' work without separate declaration of file
   731 dependencies.  Minor INCOMPATIBILITY.
   732 
   733 * Discontinued redundant 'use' command, which was superseded by
   734 'ML_file' in Isabelle2013.  Minor INCOMPATIBILITY.
   735 
   736 * Simplified subscripts within identifiers, using plain \<^sub>
   737 instead of the second copy \<^isub> and \<^isup>.  Superscripts are
   738 only for literal tokens within notation; explicit mixfix annotations
   739 for consts or fixed variables may be used as fall-back for unusual
   740 names.  Obsolete \<twosuperior> has been expanded to \<^sup>2 in
   741 Isabelle/HOL.  INCOMPATIBILITY, use "isabelle update_sub_sup" to
   742 standardize symbols as a starting point for further manual cleanup.
   743 The ML reference variable "legacy_isub_isup" may be set as temporary
   744 workaround, to make the prover accept a subset of the old identifier
   745 syntax.
   746 
   747 * Document antiquotations: term style "isub" has been renamed to
   748 "sub".  Minor INCOMPATIBILITY.
   749 
   750 * Uniform management of "quick_and_dirty" as system option (see also
   751 "isabelle options"), configuration option within the context (see also
   752 Config.get in Isabelle/ML), and attribute in Isabelle/Isar.  Minor
   753 INCOMPATIBILITY, need to use more official Isabelle means to access
   754 quick_and_dirty, instead of historical poking into mutable reference.
   755 
   756 * Renamed command 'print_configs' to 'print_options'.  Minor
   757 INCOMPATIBILITY.
   758 
   759 * Proper diagnostic command 'print_state'.  Old 'pr' (with its
   760 implicit change of some global references) is retained for now as
   761 control command, e.g. for ProofGeneral 3.7.x.
   762 
   763 * Discontinued 'print_drafts' command with its old-fashioned PS output
   764 and Unix command-line print spooling.  Minor INCOMPATIBILITY: use
   765 'display_drafts' instead and print via the regular document viewer.
   766 
   767 * Updated and extended "isar-ref" and "implementation" manual,
   768 eliminated old "ref" manual.
   769 
   770 
   771 *** Prover IDE -- Isabelle/Scala/jEdit ***
   772 
   773 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
   774 Documentation panel.
   775 
   776 * Dockable window "Documentation" provides access to Isabelle
   777 documentation.
   778 
   779 * Dockable window "Find" provides query operations for formal entities
   780 (GUI front-end to 'find_theorems' command).
   781 
   782 * Dockable window "Sledgehammer" manages asynchronous / parallel
   783 sledgehammer runs over existing document sources, independently of
   784 normal editing and checking process.
   785 
   786 * Dockable window "Timing" provides an overview of relevant command
   787 timing information, depending on option jedit_timing_threshold.  The
   788 same timing information is shown in the extended tooltip of the
   789 command keyword, when hovering the mouse over it while the CONTROL or
   790 COMMAND modifier is pressed.
   791 
   792 * Improved dockable window "Theories": Continuous checking of proof
   793 document (visible and required parts) may be controlled explicitly,
   794 using check box or shortcut "C+e ENTER".  Individual theory nodes may
   795 be marked explicitly as required and checked in full, using check box
   796 or shortcut "C+e SPACE".
   797 
   798 * Improved completion mechanism, which is now managed by the
   799 Isabelle/jEdit plugin instead of SideKick.  Refined table of Isabelle
   800 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
   801 
   802 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
   803 isabelle.complete for explicit completion in Isabelle sources.
   804 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
   805 to resolve conflict.
   806 
   807 * Improved support of various "minor modes" for Isabelle NEWS,
   808 options, session ROOT etc., with completion and SideKick tree view.
   809 
   810 * Strictly monotonic document update, without premature cancellation of
   811 running transactions that are still needed: avoid reset/restart of
   812 such command executions while editing.
   813 
   814 * Support for asynchronous print functions, as overlay to existing
   815 document content.
   816 
   817 * Support for automatic tools in HOL, which try to prove or disprove
   818 toplevel theorem statements.
   819 
   820 * Action isabelle.reset-font-size resets main text area font size
   821 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
   822 also "Plugin Options / Isabelle / General").  It can be bound to some
   823 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
   824 
   825 * File specifications in jEdit (e.g. file browser) may refer to
   826 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms.  Discontinued
   827 obsolete $ISABELLE_HOME_WINDOWS variable.
   828 
   829 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
   830 / Global Options / Appearance".
   831 
   832 * Improved support of native Mac OS X functionality via "MacOSX"
   833 plugin, which is now enabled by default.
   834 
   835 
   836 *** Pure ***
   837 
   838 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
   839 In particular, 'interpretation' allows for non-persistent
   840 interpretation within "context ... begin ... end" blocks offering a
   841 light-weight alternative to 'sublocale'.  See "isar-ref" manual for
   842 details.
   843 
   844 * Improved locales diagnostic command 'print_dependencies'.
   845 
   846 * Discontinued obsolete 'axioms' command, which has been marked as
   847 legacy since Isabelle2009-2.  INCOMPATIBILITY, use 'axiomatization'
   848 instead, while observing its uniform scope for polymorphism.
   849 
   850 * Discontinued empty name bindings in 'axiomatization'.
   851 INCOMPATIBILITY.
   852 
   853 * System option "proofs" has been discontinued.  Instead the global
   854 state of Proofterm.proofs is persistently compiled into logic images
   855 as required, notably HOL-Proofs.  Users no longer need to change
   856 Proofterm.proofs dynamically.  Minor INCOMPATIBILITY.
   857 
   858 * Syntax translation functions (print_translation etc.) always depend
   859 on Proof.context.  Discontinued former "(advanced)" option -- this is
   860 now the default.  Minor INCOMPATIBILITY.
   861 
   862 * Former global reference trace_unify_fail is now available as
   863 configuration option "unify_trace_failure" (global context only).
   864 
   865 * SELECT_GOAL now retains the syntactic context of the overall goal
   866 state (schematic variables etc.).  Potential INCOMPATIBILITY in rare
   867 situations.
   868 
   869 
   870 *** HOL ***
   871 
   872 * Stronger precedence of syntax for big intersection and union on
   873 sets, in accordance with corresponding lattice operations.
   874 INCOMPATIBILITY.
   875 
   876 * Notation "{p:A. P}" now allows tuple patterns as well.
   877 
   878 * Nested case expressions are now translated in a separate check phase
   879 rather than during parsing. The data for case combinators is separated
   880 from the datatype package. The declaration attribute
   881 "case_translation" can be used to register new case combinators:
   882 
   883   declare [[case_translation case_combinator constructor1 ... constructorN]]
   884 
   885 * Code generator:
   886   - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
   887     'code_instance'.
   888   - 'code_identifier' declares name hints for arbitrary identifiers in
   889     generated code, subsuming 'code_modulename'.
   890 
   891 See the isar-ref manual for syntax diagrams, and the HOL theories for
   892 examples.
   893 
   894 * Attibute 'code': 'code' now declares concrete and abstract code
   895 equations uniformly.  Use explicit 'code equation' and 'code abstract'
   896 to distinguish both when desired.
   897 
   898 * Discontinued theories Code_Integer and Efficient_Nat by a more
   899 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
   900 Code_Target_Nat and Code_Target_Numeral.  See the tutorial on code
   901 generation for details.  INCOMPATIBILITY.
   902 
   903 * Numeric types are mapped by default to target language numerals:
   904 natural (replaces former code_numeral) and integer (replaces former
   905 code_int).  Conversions are available as integer_of_natural /
   906 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
   907 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
   908 ML).  INCOMPATIBILITY.
   909 
   910 * Function package: For mutually recursive functions f and g, separate
   911 cases rules f.cases and g.cases are generated instead of unusable
   912 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
   913 in the case that the unusable rule was used nevertheless.
   914 
   915 * Function package: For each function f, new rules f.elims are
   916 generated, which eliminate equalities of the form "f x = t".
   917 
   918 * New command 'fun_cases' derives ad-hoc elimination rules for
   919 function equations as simplified instances of f.elims, analogous to
   920 inductive_cases.  See ~~/src/HOL/ex/Fundefs.thy for some examples.
   921 
   922 * Lifting:
   923   - parametrized correspondence relations are now supported:
   924     + parametricity theorems for the raw term can be specified in
   925       the command lift_definition, which allow us to generate stronger
   926       transfer rules
   927     + setup_lifting generates stronger transfer rules if parametric
   928       correspondence relation can be generated
   929     + various new properties of the relator must be specified to support
   930       parametricity
   931     + parametricity theorem for the Quotient relation can be specified
   932   - setup_lifting generates domain rules for the Transfer package
   933   - stronger reflexivity prover of respectfulness theorems for type
   934     copies
   935   - ===> and --> are now local. The symbols can be introduced
   936     by interpreting the locale lifting_syntax (typically in an
   937     anonymous context)
   938   - Lifting/Transfer relevant parts of Library/Quotient_* are now in
   939     Main. Potential INCOMPATIBILITY
   940   - new commands for restoring and deleting Lifting/Transfer context:
   941     lifting_forget, lifting_update
   942   - the command print_quotmaps was renamed to print_quot_maps.
   943     INCOMPATIBILITY
   944 
   945 * Transfer:
   946   - better support for domains in Transfer: replace Domainp T
   947     by the actual invariant in a transferred goal
   948   - transfer rules can have as assumptions other transfer rules
   949   - Experimental support for transferring from the raw level to the
   950     abstract level: Transfer.transferred attribute
   951   - Attribute version of the transfer method: untransferred attribute
   952 
   953 * Reification and reflection:
   954   - Reification is now directly available in HOL-Main in structure
   955     "Reification".
   956   - Reflection now handles multiple lists with variables also.
   957   - The whole reflection stack has been decomposed into conversions.
   958 INCOMPATIBILITY.
   959 
   960 * Revised devices for recursive definitions over finite sets:
   961   - Only one fundamental fold combinator on finite set remains:
   962     Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
   963     This is now identity on infinite sets.
   964   - Locales ("mini packages") for fundamental definitions with
   965     Finite_Set.fold: folding, folding_idem.
   966   - Locales comm_monoid_set, semilattice_order_set and
   967     semilattice_neutr_order_set for big operators on sets.
   968     See theory Big_Operators for canonical examples.
   969     Note that foundational constants comm_monoid_set.F and
   970     semilattice_set.F correspond to former combinators fold_image
   971     and fold1 respectively.  These are now gone.  You may use
   972     those foundational constants as substitutes, but it is
   973     preferable to interpret the above locales accordingly.
   974   - Dropped class ab_semigroup_idem_mult (special case of lattice,
   975     no longer needed in connection with Finite_Set.fold etc.)
   976   - Fact renames:
   977       card.union_inter ~> card_Un_Int [symmetric]
   978       card.union_disjoint ~> card_Un_disjoint
   979 INCOMPATIBILITY.
   980 
   981 * Locale hierarchy for abstract orderings and (semi)lattices.
   982 
   983 * Complete_Partial_Order.admissible is defined outside the type class
   984 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
   985 class predicate assumption or sort constraint when possible.
   986 INCOMPATIBILITY.
   987 
   988 * Introduce type class "conditionally_complete_lattice": Like a
   989 complete lattice but does not assume the existence of the top and
   990 bottom elements.  Allows to generalize some lemmas about reals and
   991 extended reals.  Removed SupInf and replaced it by the instantiation
   992 of conditionally_complete_lattice for real. Renamed lemmas about
   993 conditionally-complete lattice from Sup_... to cSup_... and from
   994 Inf_...  to cInf_... to avoid hidding of similar complete lattice
   995 lemmas.
   996 
   997 * Introduce type class linear_continuum as combination of
   998 conditionally-complete lattices and inner dense linorders which have
   999 more than one element.  INCOMPATIBILITY.
  1000 
  1001 * Introduced type classes order_top and order_bot. The old classes top
  1002 and bot only contain the syntax without assumptions.  INCOMPATIBILITY:
  1003 Rename bot -> order_bot, top -> order_top
  1004 
  1005 * Introduce type classes "no_top" and "no_bot" for orderings without
  1006 top and bottom elements.
  1007 
  1008 * Split dense_linorder into inner_dense_order and no_top, no_bot.
  1009 
  1010 * Complex_Main: Unify and move various concepts from
  1011 HOL-Multivariate_Analysis to HOL-Complex_Main.
  1012 
  1013  - Introduce type class (lin)order_topology and
  1014    linear_continuum_topology.  Allows to generalize theorems about
  1015    limits and order.  Instances are reals and extended reals.
  1016 
  1017  - continuous and continuos_on from Multivariate_Analysis:
  1018    "continuous" is the continuity of a function at a filter.  "isCont"
  1019    is now an abbrevitation: "isCont x f == continuous (at _) f".
  1020 
  1021    Generalized continuity lemmas from isCont to continuous on an
  1022    arbitrary filter.
  1023 
  1024  - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
  1025    compactness of closed intervals on reals. Continuous functions
  1026    attain infimum and supremum on compact sets. The inverse of a
  1027    continuous function is continuous, when the function is continuous
  1028    on a compact set.
  1029 
  1030  - connected from Multivariate_Analysis. Use it to prove the
  1031    intermediate value theorem. Show connectedness of intervals on
  1032    linear_continuum_topology).
  1033 
  1034  - first_countable_topology from Multivariate_Analysis. Is used to
  1035    show equivalence of properties on the neighbourhood filter of x and
  1036    on all sequences converging to x.
  1037 
  1038  - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
  1039    theorems from Library/FDERIV.thy to Deriv.thy and base the
  1040    definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
  1041    which are restricted to sets, i.e. to represent derivatives from
  1042    left or right.
  1043 
  1044  - Removed the within-filter. It is replaced by the principal filter:
  1045 
  1046      F within X = inf F (principal X)
  1047 
  1048  - Introduce "at x within U" as a single constant, "at x" is now an
  1049    abbreviation for "at x within UNIV"
  1050 
  1051  - Introduce named theorem collections tendsto_intros,
  1052    continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
  1053    in tendsto_intros (or FDERIV_intros) are also available as
  1054    tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
  1055    is replaced by a congruence rule. This allows to apply them as
  1056    intro rules and then proving equivalence by the simplifier.
  1057 
  1058  - Restructured theories in HOL-Complex_Main:
  1059 
  1060    + Moved RealDef and RComplete into Real
  1061 
  1062    + Introduced Topological_Spaces and moved theorems about
  1063      topological spaces, filters, limits and continuity to it
  1064 
  1065    + Renamed RealVector to Real_Vector_Spaces
  1066 
  1067    + Split Lim, SEQ, Series into Topological_Spaces,
  1068      Real_Vector_Spaces, and Limits
  1069 
  1070    + Moved Ln and Log to Transcendental
  1071 
  1072    + Moved theorems about continuity from Deriv to Topological_Spaces
  1073 
  1074  - Remove various auxiliary lemmas.
  1075 
  1076 INCOMPATIBILITY.
  1077 
  1078 * Nitpick:
  1079   - Added option "spy".
  1080   - Reduce incidence of "too high arity" errors.
  1081 
  1082 * Sledgehammer:
  1083   - Renamed option:
  1084       isar_shrink ~> isar_compress
  1085     INCOMPATIBILITY.
  1086   - Added options "isar_try0", "spy".
  1087   - Better support for "isar_proofs".
  1088   - MaSh has been fined-tuned and now runs as a local server.
  1089 
  1090 * Improved support for ad hoc overloading of constants (see also
  1091 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
  1092 
  1093 * Library/Polynomial.thy:
  1094   - Use lifting for primitive definitions.
  1095   - Explicit conversions from and to lists of coefficients, used for
  1096     generated code.
  1097   - Replaced recursion operator poly_rec by fold_coeffs.
  1098   - Prefer pre-existing gcd operation for gcd.
  1099   - Fact renames:
  1100     poly_eq_iff ~> poly_eq_poly_eq_iff
  1101     poly_ext ~> poly_eqI
  1102     expand_poly_eq ~> poly_eq_iff
  1103 IMCOMPATIBILITY.
  1104 
  1105 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
  1106 case_of_simps to convert function definitions between a list of
  1107 equations with patterns on the lhs and a single equation with case
  1108 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
  1109 
  1110 * New Library/FSet.thy: type of finite sets defined as a subtype of
  1111 sets defined by Lifting/Transfer.
  1112 
  1113 * Discontinued theory src/HOL/Library/Eval_Witness.  INCOMPATIBILITY.
  1114 
  1115 * Consolidation of library theories on product orders:
  1116 
  1117     Product_Lattice ~> Product_Order -- pointwise order on products
  1118     Product_ord ~> Product_Lexorder -- lexicographic order on products
  1119 
  1120 INCOMPATIBILITY.
  1121 
  1122 * Imperative-HOL: The MREC combinator is considered legacy and no
  1123 longer included by default. INCOMPATIBILITY, use partial_function
  1124 instead, or import theory Legacy_Mrec as a fallback.
  1125 
  1126 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
  1127 ~~/src/HOL/Algebra/poly.  Existing theories should be based on
  1128 ~~/src/HOL/Library/Polynomial instead.  The latter provides
  1129 integration with HOL's type classes for rings.  INCOMPATIBILITY.
  1130 
  1131 * HOL-BNF:
  1132   - Various improvements to BNF-based (co)datatype package, including
  1133     new commands "primrec_new", "primcorec", and
  1134     "datatype_new_compat", as well as documentation. See
  1135     "datatypes.pdf" for details.
  1136   - New "coinduction" method to avoid some boilerplate (compared to
  1137     coinduct).
  1138   - Renamed keywords:
  1139     data ~> datatype_new
  1140     codata ~> codatatype
  1141     bnf_def ~> bnf
  1142   - Renamed many generated theorems, including
  1143     discs ~> disc
  1144     map_comp' ~> map_comp
  1145     map_id' ~> map_id
  1146     sels ~> sel
  1147     set_map' ~> set_map
  1148     sets ~> set
  1149 IMCOMPATIBILITY.
  1150 
  1151 
  1152 *** ML ***
  1153 
  1154 * Spec_Check is a Quickcheck tool for Isabelle/ML.  The ML function
  1155 "check_property" allows to check specifications of the form "ALL x y
  1156 z. prop x y z".  See also ~~/src/Tools/Spec_Check/ with its
  1157 Examples.thy in particular.
  1158 
  1159 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
  1160 tracing output in the command transaction context instead of physical
  1161 stdout.  See also Toplevel.debug, Toplevel.debugging and
  1162 ML_Compiler.exn_trace.
  1163 
  1164 * ML type "theory" is now immutable, without any special treatment of
  1165 drafts or linear updates (which could lead to "stale theory" errors in
  1166 the past).  Discontinued obsolete operations like Theory.copy,
  1167 Theory.checkpoint, and the auxiliary type theory_ref.  Minor
  1168 INCOMPATIBILITY.
  1169 
  1170 * More uniform naming of goal functions for skipped proofs:
  1171 
  1172     Skip_Proof.prove  ~>  Goal.prove_sorry
  1173     Skip_Proof.prove_global  ~>  Goal.prove_sorry_global
  1174 
  1175 Minor INCOMPATIBILITY.
  1176 
  1177 * Simplifier tactics and tools use proper Proof.context instead of
  1178 historic type simpset.  Old-style declarations like addsimps,
  1179 addsimprocs etc. operate directly on Proof.context.  Raw type simpset
  1180 retains its use as snapshot of the main Simplifier context, using
  1181 simpset_of and put_simpset on Proof.context.  INCOMPATIBILITY -- port
  1182 old tools by making them depend on (ctxt : Proof.context) instead of
  1183 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
  1184 
  1185 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
  1186 operate on Proof.context instead of claset, for uniformity with addIs,
  1187 addEs, addDs etc. Note that claset_of and put_claset allow to manage
  1188 clasets separately from the context.
  1189 
  1190 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
  1191 INCOMPATIBILITY, use @{context} instead.
  1192 
  1193 * Antiquotation @{theory_context A} is similar to @{theory A}, but
  1194 presents the result as initial Proof.context.
  1195 
  1196 
  1197 *** System ***
  1198 
  1199 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
  1200 "isabelle build" in Isabelle2013.  INCOMPATIBILITY.
  1201 
  1202 * Discontinued obsolete isabelle-process options -f and -u (former
  1203 administrative aliases of option -e).  Minor INCOMPATIBILITY.
  1204 
  1205 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
  1206 settings variable.
  1207 
  1208 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
  1209 document formats: dvi.gz, ps, ps.gz -- the default document format is
  1210 always pdf.
  1211 
  1212 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
  1213 specify global resources of the JVM process run by isabelle build.
  1214 
  1215 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
  1216 to run Isabelle/Scala source files as standalone programs.
  1217 
  1218 * Improved "isabelle keywords" tool (for old-style ProofGeneral
  1219 keyword tables): use Isabelle/Scala operations, which inspect outer
  1220 syntax without requiring to build sessions first.
  1221 
  1222 * Sessions may be organized via 'chapter' specifications in the ROOT
  1223 file, which determines a two-level hierarchy of browser info.  The old
  1224 tree-like organization via implicit sub-session relation (with its
  1225 tendency towards erratic fluctuation of URLs) has been discontinued.
  1226 The default chapter is called "Unsorted".  Potential INCOMPATIBILITY
  1227 for HTML presentation of theories.
  1228 
  1229 
  1230 
  1231 New in Isabelle2013 (February 2013)
  1232 -----------------------------------
  1233 
  1234 *** General ***
  1235 
  1236 * Theorem status about oracles and unfinished/failed future proofs is
  1237 no longer printed by default, since it is incompatible with
  1238 incremental / parallel checking of the persistent document model.  ML
  1239 function Thm.peek_status may be used to inspect a snapshot of the
  1240 ongoing evaluation process.  Note that in batch mode --- notably
  1241 isabelle build --- the system ensures that future proofs of all
  1242 accessible theorems in the theory context are finished (as before).
  1243 
  1244 * Configuration option show_markup controls direct inlining of markup
  1245 into the printed representation of formal entities --- notably type
  1246 and sort constraints.  This enables Prover IDE users to retrieve that
  1247 information via tooltips in the output window, for example.
  1248 
  1249 * Command 'ML_file' evaluates ML text from a file directly within the
  1250 theory, without any predeclaration via 'uses' in the theory header.
  1251 
  1252 * Old command 'use' command and corresponding keyword 'uses' in the
  1253 theory header are legacy features and will be discontinued soon.
  1254 Tools that load their additional source files may imitate the
  1255 'ML_file' implementation, such that the system can take care of
  1256 dependencies properly.
  1257 
  1258 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
  1259 is called fastforce / fast_force_tac already since Isabelle2011-1.
  1260 
  1261 * Updated and extended "isar-ref" and "implementation" manual, reduced
  1262 remaining material in old "ref" manual.
  1263 
  1264 * Improved support for auxiliary contexts that indicate block structure
  1265 for specifications.  Nesting of "context fixes ... context assumes ..."
  1266 and "class ... context ...".
  1267 
  1268 * Attribute "consumes" allows a negative value as well, which is
  1269 interpreted relatively to the total number of premises of the rule in
  1270 the target context.  This form of declaration is stable when exported
  1271 from a nested 'context' with additional assumptions.  It is the
  1272 preferred form for definitional packages, notably cases/rules produced
  1273 in HOL/inductive and HOL/function.
  1274 
  1275 * More informative error messages for Isar proof commands involving
  1276 lazy enumerations (method applications etc.).
  1277 
  1278 * Refined 'help' command to retrieve outer syntax commands according
  1279 to name patterns (with clickable results).
  1280 
  1281 
  1282 *** Prover IDE -- Isabelle/Scala/jEdit ***
  1283 
  1284 * Parallel terminal proofs ('by') are enabled by default, likewise
  1285 proofs that are built into packages like 'datatype', 'function'.  This
  1286 allows to "run ahead" checking the theory specifications on the
  1287 surface, while the prover is still crunching on internal
  1288 justifications.  Unfinished / cancelled proofs are restarted as
  1289 required to complete full proof checking eventually.
  1290 
  1291 * Improved output panel with tooltips, hyperlinks etc. based on the
  1292 same Rich_Text_Area as regular Isabelle/jEdit buffers.  Activation of
  1293 tooltips leads to some window that supports the same recursively,
  1294 which can lead to stacks of tooltips as the semantic document content
  1295 is explored.  ESCAPE closes the whole stack, individual windows may be
  1296 closed separately, or detached to become independent jEdit dockables.
  1297 
  1298 * Improved support for commands that produce graph output: the text
  1299 message contains a clickable area to open a new instance of the graph
  1300 browser on demand.
  1301 
  1302 * More robust incremental parsing of outer syntax (partial comments,
  1303 malformed symbols).  Changing the balance of open/close quotes and
  1304 comment delimiters works more conveniently with unfinished situations
  1305 that frequently occur in user interaction.
  1306 
  1307 * More efficient painting and improved reactivity when editing large
  1308 files.  More scalable management of formal document content.
  1309 
  1310 * Smarter handling of tracing messages: prover process pauses after
  1311 certain number of messages per command transaction, with some user
  1312 dialog to stop or continue.  This avoids swamping the front-end with
  1313 potentially infinite message streams.
  1314 
  1315 * More plugin options and preferences, based on Isabelle/Scala.  The
  1316 jEdit plugin option panel provides access to some Isabelle/Scala
  1317 options, including tuning parameters for editor reactivity and color
  1318 schemes.
  1319 
  1320 * Dockable window "Symbols" provides some editing support for Isabelle
  1321 symbols.
  1322 
  1323 * Dockable window "Monitor" shows ML runtime statistics.  Note that
  1324 continuous display of the chart slows down the system.
  1325 
  1326 * Improved editing support for control styles: subscript, superscript,
  1327 bold, reset of style -- operating on single symbols or text
  1328 selections.  Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
  1329 
  1330 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
  1331 adjust the main text area font size, and its derivatives for output,
  1332 tooltips etc.  Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
  1333 need to be adapted to local keyboard layouts.
  1334 
  1335 * More reactive completion popup by default: use \t (TAB) instead of
  1336 \n (NEWLINE) to minimize intrusion into regular flow of editing.  See
  1337 also "Plugin Options / SideKick / General / Code Completion Options".
  1338 
  1339 * Implicit check and build dialog of the specified logic session
  1340 image.  For example, HOL, HOLCF, HOL-Nominal can be produced on
  1341 demand, without bundling big platform-dependent heap images in the
  1342 Isabelle distribution.
  1343 
  1344 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
  1345 from Oracle provide better multi-platform experience.  This version is
  1346 now bundled exclusively with Isabelle.
  1347 
  1348 
  1349 *** Pure ***
  1350 
  1351 * Code generation for Haskell: restrict unqualified imports from
  1352 Haskell Prelude to a small set of fundamental operations.
  1353 
  1354 * Command 'export_code': relative file names are interpreted
  1355 relatively to master directory of current theory rather than the
  1356 rather arbitrary current working directory.  INCOMPATIBILITY.
  1357 
  1358 * Discontinued obsolete attribute "COMP".  Potential INCOMPATIBILITY,
  1359 use regular rule composition via "OF" / "THEN", or explicit proof
  1360 structure instead.  Note that Isabelle/ML provides a variety of
  1361 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
  1362 with some care where this is really required.
  1363 
  1364 * Command 'typ' supports an additional variant with explicit sort
  1365 constraint, to infer and check the most general type conforming to a
  1366 given sort.  Example (in HOL):
  1367 
  1368   typ "_ * _ * bool * unit" :: finite
  1369 
  1370 * Command 'locale_deps' visualizes all locales and their relations as
  1371 a Hasse diagram.
  1372 
  1373 
  1374 *** HOL ***
  1375 
  1376 * Sledgehammer:
  1377 
  1378   - Added MaSh relevance filter based on machine-learning; see the
  1379     Sledgehammer manual for details.
  1380   - Polished Isar proofs generated with "isar_proofs" option.
  1381   - Rationalized type encodings ("type_enc" option).
  1382   - Renamed "kill_provers" subcommand to "kill_all".
  1383   - Renamed options:
  1384       isar_proof ~> isar_proofs
  1385       isar_shrink_factor ~> isar_shrink
  1386       max_relevant ~> max_facts
  1387       relevance_thresholds ~> fact_thresholds
  1388 
  1389 * Quickcheck: added an optimisation for equality premises.  It is
  1390 switched on by default, and can be switched off by setting the
  1391 configuration quickcheck_optimise_equality to false.
  1392 
  1393 * Quotient: only one quotient can be defined by quotient_type
  1394 INCOMPATIBILITY.
  1395 
  1396 * Lifting:
  1397   - generation of an abstraction function equation in lift_definition
  1398   - quot_del attribute
  1399   - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
  1400 
  1401 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
  1402 expressions.
  1403 
  1404 * Preprocessing of the code generator rewrites set comprehensions into
  1405 pointfree expressions.
  1406 
  1407 * The SMT solver Z3 has now by default a restricted set of directly
  1408 supported features. For the full set of features (div/mod, nonlinear
  1409 arithmetic, datatypes/records) with potential proof reconstruction
  1410 failures, enable the configuration option "z3_with_extensions".  Minor
  1411 INCOMPATIBILITY.
  1412 
  1413 * Simplified 'typedef' specifications: historical options for implicit
  1414 set definition and alternative name have been discontinued.  The
  1415 former behavior of "typedef (open) t = A" is now the default, but
  1416 written just "typedef t = A".  INCOMPATIBILITY, need to adapt theories
  1417 accordingly.
  1418 
  1419 * Removed constant "chars"; prefer "Enum.enum" on type "char"
  1420 directly.  INCOMPATIBILITY.
  1421 
  1422 * Moved operation product, sublists and n_lists from theory Enum to
  1423 List.  INCOMPATIBILITY.
  1424 
  1425 * Theorem UN_o generalized to SUP_comp.  INCOMPATIBILITY.
  1426 
  1427 * Class "comm_monoid_diff" formalises properties of bounded
  1428 subtraction, with natural numbers and multisets as typical instances.
  1429 
  1430 * Added combinator "Option.these" with type "'a option set => 'a set".
  1431 
  1432 * Theory "Transitive_Closure": renamed lemmas
  1433 
  1434   reflcl_tranclp -> reflclp_tranclp
  1435   rtranclp_reflcl -> rtranclp_reflclp
  1436 
  1437 INCOMPATIBILITY.
  1438 
  1439 * Theory "Rings": renamed lemmas (in class semiring)
  1440 
  1441   left_distrib ~> distrib_right
  1442   right_distrib ~> distrib_left
  1443 
  1444 INCOMPATIBILITY.
  1445 
  1446 * Generalized the definition of limits:
  1447 
  1448   - Introduced the predicate filterlim (LIM x F. f x :> G) which
  1449     expresses that when the input values x converge to F then the
  1450     output f x converges to G.
  1451 
  1452   - Added filters for convergence to positive (at_top) and negative
  1453     infinity (at_bot).
  1454 
  1455   - Moved infinity in the norm (at_infinity) from
  1456     Multivariate_Analysis to Complex_Main.
  1457 
  1458   - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
  1459     at_top".
  1460 
  1461 INCOMPATIBILITY.
  1462 
  1463 * Theory "Library/Option_ord" provides instantiation of option type to
  1464 lattice type classes.
  1465 
  1466 * Theory "Library/Multiset": renamed
  1467 
  1468     constant fold_mset ~> Multiset.fold
  1469     fact fold_mset_commute ~> fold_mset_comm
  1470 
  1471 INCOMPATIBILITY.
  1472 
  1473 * Renamed theory Library/List_Prefix to Library/Sublist, with related
  1474 changes as follows.
  1475 
  1476   - Renamed constants (and related lemmas)
  1477 
  1478       prefix ~> prefixeq
  1479       strict_prefix ~> prefix
  1480 
  1481   - Replaced constant "postfix" by "suffixeq" with swapped argument
  1482     order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
  1483     old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
  1484     Renamed lemmas accordingly.
  1485 
  1486   - Added constant "list_hembeq" for homeomorphic embedding on
  1487     lists. Added abbreviation "sublisteq" for special case
  1488     "list_hembeq (op =)".
  1489 
  1490   - Theory Library/Sublist no longer provides "order" and "bot" type
  1491     class instances for the prefix order (merely corresponding locale
  1492     interpretations). The type class instances are now in theory
  1493     Library/Prefix_Order.
  1494 
  1495   - The sublist relation of theory Library/Sublist_Order is now based
  1496     on "Sublist.sublisteq".  Renamed lemmas accordingly:
  1497 
  1498       le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
  1499       le_list_append_mono ~> Sublist.list_hembeq_append_mono
  1500       le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
  1501       le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
  1502       le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
  1503       le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
  1504       le_list_drop_Cons ~> Sublist.sublisteq_Cons'
  1505       le_list_drop_many ~> Sublist.sublisteq_drop_many
  1506       le_list_filter_left ~> Sublist.sublisteq_filter_left
  1507       le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
  1508       le_list_rev_take_iff ~> Sublist.sublisteq_append
  1509       le_list_same_length ~> Sublist.sublisteq_same_length
  1510       le_list_take_many_iff ~> Sublist.sublisteq_append'
  1511       less_eq_list.drop ~> less_eq_list_drop
  1512       less_eq_list.induct ~> less_eq_list_induct
  1513       not_le_list_length ~> Sublist.not_sublisteq_length
  1514 
  1515 INCOMPATIBILITY.
  1516 
  1517 * New theory Library/Countable_Set.
  1518 
  1519 * Theory Library/Debug and Library/Parallel provide debugging and
  1520 parallel execution for code generated towards Isabelle/ML.
  1521 
  1522 * Theory Library/FuncSet: Extended support for Pi and extensional and
  1523 introduce the extensional dependent function space "PiE". Replaced
  1524 extensional_funcset by an abbreviation, and renamed lemmas from
  1525 extensional_funcset to PiE as follows:
  1526 
  1527   extensional_empty  ~>  PiE_empty
  1528   extensional_funcset_empty_domain  ~>  PiE_empty_domain
  1529   extensional_funcset_empty_range  ~>  PiE_empty_range
  1530   extensional_funcset_arb  ~>  PiE_arb
  1531   extensional_funcset_mem  ~>  PiE_mem
  1532   extensional_funcset_extend_domainI  ~>  PiE_fun_upd
  1533   extensional_funcset_restrict_domain  ~>  fun_upd_in_PiE
  1534   extensional_funcset_extend_domain_eq  ~>  PiE_insert_eq
  1535   card_extensional_funcset  ~>  card_PiE
  1536   finite_extensional_funcset  ~>  finite_PiE
  1537 
  1538 INCOMPATIBILITY.
  1539 
  1540 * Theory Library/FinFun: theory of almost everywhere constant
  1541 functions (supersedes the AFP entry "Code Generation for Functions as
  1542 Data").
  1543 
  1544 * Theory Library/Phantom: generic phantom type to make a type
  1545 parameter appear in a constant's type.  This alternative to adding
  1546 TYPE('a) as another parameter avoids unnecessary closures in generated
  1547 code.
  1548 
  1549 * Theory Library/RBT_Impl: efficient construction of red-black trees
  1550 from sorted associative lists. Merging two trees with rbt_union may
  1551 return a structurally different tree than before.  Potential
  1552 INCOMPATIBILITY.
  1553 
  1554 * Theory Library/IArray: immutable arrays with code generation.
  1555 
  1556 * Theory Library/Finite_Lattice: theory of finite lattices.
  1557 
  1558 * HOL/Multivariate_Analysis: replaced
  1559 
  1560   "basis :: 'a::euclidean_space => nat => real"
  1561   "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
  1562 
  1563 on euclidean spaces by using the inner product "_ \<bullet> _" with
  1564 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
  1565 "SUM i : Basis. f i * r i".
  1566 
  1567   With this change the following constants are also changed or removed:
  1568 
  1569     DIM('a) :: nat  ~>  card (Basis :: 'a set)   (is an abbreviation)
  1570     a $$ i  ~>  inner a i  (where i : Basis)
  1571     cart_base i  removed
  1572     \<pi>, \<pi>'  removed
  1573 
  1574   Theorems about these constants where removed.
  1575 
  1576   Renamed lemmas:
  1577 
  1578     component_le_norm  ~>  Basis_le_norm
  1579     euclidean_eq  ~>  euclidean_eq_iff
  1580     differential_zero_maxmin_component  ~>  differential_zero_maxmin_cart
  1581     euclidean_simps  ~>  inner_simps
  1582     independent_basis  ~>  independent_Basis
  1583     span_basis  ~>  span_Basis
  1584     in_span_basis  ~>  in_span_Basis
  1585     norm_bound_component_le  ~>  norm_boound_Basis_le
  1586     norm_bound_component_lt  ~>  norm_boound_Basis_lt
  1587     component_le_infnorm  ~>  Basis_le_infnorm
  1588 
  1589 INCOMPATIBILITY.
  1590 
  1591 * HOL/Probability:
  1592 
  1593   - Added simproc "measurable" to automatically prove measurability.
  1594 
  1595   - Added induction rules for sigma sets with disjoint union
  1596     (sigma_sets_induct_disjoint) and for Borel-measurable functions
  1597     (borel_measurable_induct).
  1598 
  1599   - Added the Daniell-Kolmogorov theorem (the existence the limit of a
  1600     projective family).
  1601 
  1602 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
  1603 AFP entry "Ordinals_and_Cardinals").
  1604 
  1605 * HOL/BNF: New (co)datatype package based on bounded natural functors
  1606 with support for mixed, nested recursion and interesting non-free
  1607 datatypes.
  1608 
  1609 * HOL/Finite_Set and Relation: added new set and relation operations
  1610 expressed by Finite_Set.fold.
  1611 
  1612 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
  1613 trees for the code generator.
  1614 
  1615 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
  1616 Lifting/Transfer.
  1617 possible INCOMPATIBILITY.
  1618 
  1619 * HOL/Set: renamed Set.project -> Set.filter
  1620 INCOMPATIBILITY.
  1621 
  1622 
  1623 *** Document preparation ***
  1624 
  1625 * Dropped legacy antiquotations "term_style" and "thm_style", since
  1626 styles may be given as arguments to "term" and "thm" already.
  1627 Discontinued legacy styles "prem1" .. "prem19".
  1628 
  1629 * Default LaTeX rendering for \<euro> is now based on eurosym package,
  1630 instead of slightly exotic babel/greek.
  1631 
  1632 * Document variant NAME may use different LaTeX entry point
  1633 document/root_NAME.tex if that file exists, instead of the common
  1634 document/root.tex.
  1635 
  1636 * Simplified custom document/build script, instead of old-style
  1637 document/IsaMakefile.  Minor INCOMPATIBILITY.
  1638 
  1639 
  1640 *** ML ***
  1641 
  1642 * The default limit for maximum number of worker threads is now 8,
  1643 instead of 4, in correspondence to capabilities of contemporary
  1644 hardware and Poly/ML runtime system.
  1645 
  1646 * Type Seq.results and related operations support embedded error
  1647 messages within lazy enumerations, and thus allow to provide
  1648 informative errors in the absence of any usable results.
  1649 
  1650 * Renamed Position.str_of to Position.here to emphasize that this is a
  1651 formal device to inline positions into message text, but not
  1652 necessarily printing visible text.
  1653 
  1654 
  1655 *** System ***
  1656 
  1657 * Advanced support for Isabelle sessions and build management, see
  1658 "system" manual for the chapter of that name, especially the "isabelle
  1659 build" tool and its examples.  The "isabelle mkroot" tool prepares
  1660 session root directories for use with "isabelle build", similar to
  1661 former "isabelle mkdir" for "isabelle usedir".  Note that this affects
  1662 document preparation as well.  INCOMPATIBILITY, isabelle usedir /
  1663 mkdir / make are rendered obsolete.
  1664 
  1665 * Discontinued obsolete Isabelle/build script, it is superseded by the
  1666 regular isabelle build tool.  For example:
  1667 
  1668   isabelle build -s -b HOL
  1669 
  1670 * Discontinued obsolete "isabelle makeall".
  1671 
  1672 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
  1673 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
  1674 provides some traditional targets that invoke "isabelle build".  Note
  1675 that this is inefficient!  Applications of Isabelle/HOL involving
  1676 "isabelle make" should be upgraded to use "isabelle build" directly.
  1677 
  1678 * The "isabelle options" tool prints Isabelle system options, as
  1679 required for "isabelle build", for example.
  1680 
  1681 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
  1682 Minor INCOMPATIBILITY in command-line options.
  1683 
  1684 * The "isabelle install" tool has now a simpler command-line.  Minor
  1685 INCOMPATIBILITY.
  1686 
  1687 * The "isabelle components" tool helps to resolve add-on components
  1688 that are not bundled, or referenced from a bare-bones repository
  1689 version of Isabelle.
  1690 
  1691 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
  1692 platform family: "linux", "macos", "windows".
  1693 
  1694 * The ML system is configured as regular component, and no longer
  1695 picked up from some surrounding directory.  Potential INCOMPATIBILITY
  1696 for home-made settings.
  1697 
  1698 * Improved ML runtime statistics (heap, threads, future tasks etc.).
  1699 
  1700 * Discontinued support for Poly/ML 5.2.1, which was the last version
  1701 without exception positions and advanced ML compiler/toplevel
  1702 configuration.
  1703 
  1704 * Discontinued special treatment of Proof General -- no longer guess
  1705 PROOFGENERAL_HOME based on accidental file-system layout.  Minor
  1706 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
  1707 settings manually, or use a Proof General version that has been
  1708 bundled as Isabelle component.
  1709 
  1710 
  1711 
  1712 New in Isabelle2012 (May 2012)
  1713 ------------------------------
  1714 
  1715 *** General ***
  1716 
  1717 * Prover IDE (PIDE) improvements:
  1718 
  1719   - more robust Sledgehammer integration (as before the sledgehammer
  1720     command-line needs to be typed into the source buffer)
  1721   - markup for bound variables
  1722   - markup for types of term variables (displayed as tooltips)
  1723   - support for user-defined Isar commands within the running session
  1724   - improved support for Unicode outside original 16bit range
  1725     e.g. glyph for \<A> (thanks to jEdit 4.5.1)
  1726 
  1727 * Forward declaration of outer syntax keywords within the theory
  1728 header -- minor INCOMPATIBILITY for user-defined commands.  Allow new
  1729 commands to be used in the same theory where defined.
  1730 
  1731 * Auxiliary contexts indicate block structure for specifications with
  1732 additional parameters and assumptions.  Such unnamed contexts may be
  1733 nested within other targets, like 'theory', 'locale', 'class',
  1734 'instantiation' etc.  Results from the local context are generalized
  1735 accordingly and applied to the enclosing target context.  Example:
  1736 
  1737   context
  1738     fixes x y z :: 'a
  1739     assumes xy: "x = y" and yz: "y = z"
  1740   begin
  1741 
  1742   lemma my_trans: "x = z" using xy yz by simp
  1743 
  1744   end
  1745 
  1746   thm my_trans
  1747 
  1748 The most basic application is to factor-out context elements of
  1749 several fixes/assumes/shows theorem statements, e.g. see
  1750 ~~/src/HOL/Isar_Examples/Group_Context.thy
  1751 
  1752 Any other local theory specification element works within the "context
  1753 ... begin ... end" block as well.
  1754 
  1755 * Bundled declarations associate attributed fact expressions with a
  1756 given name in the context.  These may be later included in other
  1757 contexts.  This allows to manage context extensions casually, without
  1758 the logical dependencies of locales and locale interpretation.  See
  1759 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
  1760 
  1761 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
  1762 declaration, and results are standardized before being stored.  Thus
  1763 old-style "standard" after instantiation or composition of facts
  1764 becomes obsolete.  Minor INCOMPATIBILITY, due to potential change of
  1765 indices of schematic variables.
  1766 
  1767 * Rule attributes in local theory declarations (e.g. locale or class)
  1768 are now statically evaluated: the resulting theorem is stored instead
  1769 of the original expression.  INCOMPATIBILITY in rare situations, where
  1770 the historic accident of dynamic re-evaluation in interpretations
  1771 etc. was exploited.
  1772 
  1773 * New tutorial "Programming and Proving in Isabelle/HOL"
  1774 ("prog-prove").  It completely supersedes "A Tutorial Introduction to
  1775 Structured Isar Proofs" ("isar-overview"), which has been removed.  It
  1776 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
  1777 Logic" as the recommended beginners tutorial, but does not cover all
  1778 of the material of that old tutorial.
  1779 
  1780 * Updated and extended reference manuals: "isar-ref",
  1781 "implementation", "system"; reduced remaining material in old "ref"
  1782 manual.
  1783 
  1784 
  1785 *** Pure ***
  1786 
  1787 * Command 'definition' no longer exports the foundational "raw_def"
  1788 into the user context.  Minor INCOMPATIBILITY, may use the regular
  1789 "def" result with attribute "abs_def" to imitate the old version.
  1790 
  1791 * Attribute "abs_def" turns an equation of the form "f x y == t" into
  1792 "f == %x y. t", which ensures that "simp" or "unfold" steps always
  1793 expand it.  This also works for object-logic equality.  (Formerly
  1794 undocumented feature.)
  1795 
  1796 * Sort constraints are now propagated in simultaneous statements, just
  1797 like type constraints.  INCOMPATIBILITY in rare situations, where
  1798 distinct sorts used to be assigned accidentally.  For example:
  1799 
  1800   lemma "P (x::'a::foo)" and "Q (y::'a::bar)"  -- "now illegal"
  1801 
  1802   lemma "P (x::'a)" and "Q (y::'a::bar)"
  1803     -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
  1804 
  1805 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
  1806 tolerant against multiple unifiers, as long as the final result is
  1807 unique.  (As before, rules are composed in canonical right-to-left
  1808 order to accommodate newly introduced premises.)
  1809 
  1810 * Renamed some inner syntax categories:
  1811 
  1812     num ~> num_token
  1813     xnum ~> xnum_token
  1814     xstr ~> str_token
  1815 
  1816 Minor INCOMPATIBILITY.  Note that in practice "num_const" or
  1817 "num_position" etc. are mainly used instead (which also include
  1818 position information via constraints).
  1819 
  1820 * Simplified configuration options for syntax ambiguity: see
  1821 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
  1822 manual.  Minor INCOMPATIBILITY.
  1823 
  1824 * Discontinued configuration option "syntax_positions": atomic terms
  1825 in parse trees are always annotated by position constraints.
  1826 
  1827 * Old code generator for SML and its commands 'code_module',
  1828 'code_library', 'consts_code', 'types_code' have been discontinued.
  1829 Use commands of the generic code generator instead.  INCOMPATIBILITY.
  1830 
  1831 * Redundant attribute "code_inline" has been discontinued. Use
  1832 "code_unfold" instead.  INCOMPATIBILITY.
  1833 
  1834 * Dropped attribute "code_unfold_post" in favor of the its dual
  1835 "code_abbrev", which yields a common pattern in definitions like
  1836 
  1837   definition [code_abbrev]: "f = t"
  1838 
  1839 INCOMPATIBILITY.
  1840 
  1841 * Obsolete 'types' command has been discontinued.  Use 'type_synonym'
  1842 instead.  INCOMPATIBILITY.
  1843 
  1844 * Discontinued old "prems" fact, which used to refer to the accidental
  1845 collection of foundational premises in the context (already marked as
  1846 legacy since Isabelle2011).
  1847 
  1848 
  1849 *** HOL ***
  1850 
  1851 * Type 'a set is now a proper type constructor (just as before
  1852 Isabelle2008).  Definitions mem_def and Collect_def have disappeared.
  1853 Non-trivial INCOMPATIBILITY.  For developments keeping predicates and
  1854 sets separate, it is often sufficient to rephrase some set S that has
  1855 been accidentally used as predicates by "%x. x : S", and some
  1856 predicate P that has been accidentally used as set by "{x. P x}".
  1857 Corresponding proofs in a first step should be pruned from any
  1858 tinkering with former theorems mem_def and Collect_def as far as
  1859 possible.
  1860 
  1861 For developments which deliberately mix predicates and sets, a
  1862 planning step is necessary to determine what should become a predicate
  1863 and what a set.  It can be helpful to carry out that step in
  1864 Isabelle2011-1 before jumping right into the current release.
  1865 
  1866 * Code generation by default implements sets as container type rather
  1867 than predicates.  INCOMPATIBILITY.
  1868 
  1869 * New type synonym 'a rel = ('a * 'a) set
  1870 
  1871 * The representation of numerals has changed.  Datatype "num"
  1872 represents strictly positive binary numerals, along with functions
  1873 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
  1874 positive and negated numeric literals, respectively.  See also
  1875 definitions in ~~/src/HOL/Num.thy.  Potential INCOMPATIBILITY, some
  1876 user theories may require adaptations as follows:
  1877 
  1878   - Theorems with number_ring or number_semiring constraints: These
  1879     classes are gone; use comm_ring_1 or comm_semiring_1 instead.
  1880 
  1881   - Theories defining numeric types: Remove number, number_semiring,
  1882     and number_ring instances. Defer all theorems about numerals until
  1883     after classes one and semigroup_add have been instantiated.
  1884 
  1885   - Numeral-only simp rules: Replace each rule having a "number_of v"
  1886     pattern with two copies, one for numeral and one for neg_numeral.
  1887 
  1888   - Theorems about subclasses of semiring_1 or ring_1: These classes
  1889     automatically support numerals now, so more simp rules and
  1890     simprocs may now apply within the proof.
  1891 
  1892   - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
  1893     Redefine using other integer operations.
  1894 
  1895 * Transfer: New package intended to generalize the existing
  1896 "descending" method and related theorem attributes from the Quotient
  1897 package.  (Not all functionality is implemented yet, but future
  1898 development will focus on Transfer as an eventual replacement for the
  1899 corresponding parts of the Quotient package.)
  1900 
  1901   - transfer_rule attribute: Maintains a collection of transfer rules,
  1902     which relate constants at two different types. Transfer rules may
  1903     relate different type instances of the same polymorphic constant,
  1904     or they may relate an operation on a raw type to a corresponding
  1905     operation on an abstract type (quotient or subtype). For example:
  1906 
  1907     ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
  1908     (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
  1909 
  1910   - transfer method: Replaces a subgoal on abstract types with an
  1911     equivalent subgoal on the corresponding raw types. Constants are
  1912     replaced with corresponding ones according to the transfer rules.
  1913     Goals are generalized over all free variables by default; this is
  1914     necessary for variables whose types change, but can be overridden
  1915     for specific variables with e.g. "transfer fixing: x y z".  The
  1916     variant transfer' method allows replacing a subgoal with one that
  1917     is logically stronger (rather than equivalent).
  1918 
  1919   - relator_eq attribute: Collects identity laws for relators of
  1920     various type constructors, e.g. "list_all2 (op =) = (op =)".  The
  1921     transfer method uses these lemmas to infer transfer rules for
  1922     non-polymorphic constants on the fly.
  1923 
  1924   - transfer_prover method: Assists with proving a transfer rule for a
  1925     new constant, provided the constant is defined in terms of other
  1926     constants that already have transfer rules. It should be applied
  1927     after unfolding the constant definitions.
  1928 
  1929   - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
  1930     from type nat to type int.
  1931 
  1932 * Lifting: New package intended to generalize the quotient_definition
  1933 facility of the Quotient package; designed to work with Transfer.
  1934 
  1935   - lift_definition command: Defines operations on an abstract type in
  1936     terms of a corresponding operation on a representation
  1937     type.  Example syntax:
  1938 
  1939     lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
  1940       is List.insert
  1941 
  1942     Users must discharge a respectfulness proof obligation when each
  1943     constant is defined. (For a type copy, i.e. a typedef with UNIV,
  1944     the proof is discharged automatically.) The obligation is
  1945     presented in a user-friendly, readable form; a respectfulness
  1946     theorem in the standard format and a transfer rule are generated
  1947     by the package.
  1948 
  1949   - Integration with code_abstype: For typedefs (e.g. subtypes
  1950     corresponding to a datatype invariant, such as dlist),
  1951     lift_definition generates a code certificate theorem and sets up
  1952     code generation for each constant.
  1953 
  1954   - setup_lifting command: Sets up the Lifting package to work with a
  1955     user-defined type. The user must provide either a quotient theorem
  1956     or a type_definition theorem.  The package configures transfer
  1957     rules for equality and quantifiers on the type, and sets up the
  1958     lift_definition command to work with the type.
  1959 
  1960   - Usage examples: See Quotient_Examples/Lift_DList.thy,
  1961     Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
  1962     Word/Word.thy and Library/Float.thy.
  1963 
  1964 * Quotient package:
  1965 
  1966   - The 'quotient_type' command now supports a 'morphisms' option with
  1967     rep and abs functions, similar to typedef.
  1968 
  1969   - 'quotient_type' sets up new types to work with the Lifting and
  1970     Transfer packages, as with 'setup_lifting'.
  1971 
  1972   - The 'quotient_definition' command now requires the user to prove a
  1973     respectfulness property at the point where the constant is
  1974     defined, similar to lift_definition; INCOMPATIBILITY.
  1975 
  1976   - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
  1977     accordingly, INCOMPATIBILITY.
  1978 
  1979 * New diagnostic command 'find_unused_assms' to find potentially
  1980 superfluous assumptions in theorems using Quickcheck.
  1981 
  1982 * Quickcheck:
  1983 
  1984   - Quickcheck returns variable assignments as counterexamples, which
  1985     allows to reveal the underspecification of functions under test.
  1986     For example, refuting "hd xs = x", it presents the variable
  1987     assignment xs = [] and x = a1 as a counterexample, assuming that
  1988     any property is false whenever "hd []" occurs in it.
  1989 
  1990     These counterexample are marked as potentially spurious, as
  1991     Quickcheck also returns "xs = []" as a counterexample to the
  1992     obvious theorem "hd xs = hd xs".
  1993 
  1994     After finding a potentially spurious counterexample, Quickcheck
  1995     continues searching for genuine ones.
  1996 
  1997     By default, Quickcheck shows potentially spurious and genuine
  1998     counterexamples. The option "genuine_only" sets quickcheck to only
  1999     show genuine counterexamples.
  2000 
  2001   - The command 'quickcheck_generator' creates random and exhaustive
  2002     value generators for a given type and operations.
  2003 
  2004     It generates values by using the operations as if they were
  2005     constructors of that type.
  2006 
  2007   - Support for multisets.
  2008 
  2009   - Added "use_subtype" options.
  2010 
  2011   - Added "quickcheck_locale" configuration to specify how to process
  2012     conjectures in a locale context.
  2013 
  2014 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
  2015 and affecting 'rat' and 'real'.
  2016 
  2017 * Sledgehammer:
  2018   - Integrated more tightly with SPASS, as described in the ITP 2012
  2019     paper "More SPASS with Isabelle".
  2020   - Made it try "smt" as a fallback if "metis" fails or times out.
  2021   - Added support for the following provers: Alt-Ergo (via Why3 and
  2022     TFF1), iProver, iProver-Eq.
  2023   - Sped up the minimizer.
  2024   - Added "lam_trans", "uncurry_aliases", and "minimize" options.
  2025   - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
  2026   - Renamed "sound" option to "strict".
  2027 
  2028 * Metis: Added possibility to specify lambda translations scheme as a
  2029 parenthesized argument (e.g., "by (metis (lifting) ...)").
  2030 
  2031 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
  2032 
  2033 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
  2034 
  2035 * New "case_product" attribute to generate a case rule doing multiple
  2036 case distinctions at the same time.  E.g.
  2037 
  2038   list.exhaust [case_product nat.exhaust]
  2039 
  2040 produces a rule which can be used to perform case distinction on both
  2041 a list and a nat.
  2042 
  2043 * New "eventually_elim" method as a generalized variant of the
  2044 eventually_elim* rules.  Supports structured proofs.
  2045 
  2046 * Typedef with implicit set definition is considered legacy.  Use
  2047 "typedef (open)" form instead, which will eventually become the
  2048 default.
  2049 
  2050 * Record: code generation can be switched off manually with
  2051 
  2052   declare [[record_coden = false]]  -- "default true"
  2053 
  2054 * Datatype: type parameters allow explicit sort constraints.
  2055 
  2056 * Concrete syntax for case expressions includes constraints for source
  2057 positions, and thus produces Prover IDE markup for its bindings.
  2058 INCOMPATIBILITY for old-style syntax translations that augment the
  2059 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
  2060 one_case.
  2061 
  2062 * Clarified attribute "mono_set": pure declaration without modifying
  2063 the result of the fact expression.
  2064 
  2065 * More default pred/set conversions on a couple of relation operations
  2066 and predicates.  Added powers of predicate relations.  Consolidation
  2067 of some relation theorems:
  2068 
  2069   converse_def ~> converse_unfold
  2070   rel_comp_def ~> relcomp_unfold
  2071   symp_def ~> (modified, use symp_def and sym_def instead)
  2072   transp_def ~> transp_trans
  2073   Domain_def ~> Domain_unfold
  2074   Range_def ~> Domain_converse [symmetric]
  2075 
  2076 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
  2077 
  2078 See theory "Relation" for examples for making use of pred/set
  2079 conversions by means of attributes "to_set" and "to_pred".
  2080 
  2081 INCOMPATIBILITY.
  2082 
  2083 * Renamed facts about the power operation on relations, i.e., relpow
  2084 to match the constant's name:
  2085 
  2086   rel_pow_1 ~> relpow_1
  2087   rel_pow_0_I ~> relpow_0_I
  2088   rel_pow_Suc_I ~> relpow_Suc_I
  2089   rel_pow_Suc_I2 ~> relpow_Suc_I2
  2090   rel_pow_0_E ~> relpow_0_E
  2091   rel_pow_Suc_E ~> relpow_Suc_E
  2092   rel_pow_E ~> relpow_E
  2093   rel_pow_Suc_D2 ~> relpow_Suc_D2
  2094   rel_pow_Suc_E2 ~> relpow_Suc_E2
  2095   rel_pow_Suc_D2' ~> relpow_Suc_D2'
  2096   rel_pow_E2 ~> relpow_E2
  2097   rel_pow_add ~> relpow_add
  2098   rel_pow_commute ~> relpow
  2099   rel_pow_empty ~> relpow_empty:
  2100   rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
  2101   rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
  2102   rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
  2103   rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
  2104   rel_pow_fun_conv ~> relpow_fun_conv
  2105   rel_pow_finite_bounded1 ~> relpow_finite_bounded1
  2106   rel_pow_finite_bounded ~> relpow_finite_bounded
  2107   rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
  2108   trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
  2109   single_valued_rel_pow ~> single_valued_relpow
  2110 
  2111 INCOMPATIBILITY.
  2112 
  2113 * Theory Relation: Consolidated constant name for relation composition
  2114 and corresponding theorem names:
  2115 
  2116   - Renamed constant rel_comp to relcomp.
  2117 
  2118   - Dropped abbreviation pred_comp. Use relcompp instead.
  2119 
  2120   - Renamed theorems:
  2121 
  2122     rel_compI ~> relcompI
  2123     rel_compEpair ~> relcompEpair
  2124     rel_compE ~> relcompE
  2125     pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
  2126     rel_comp_empty1 ~> relcomp_empty1
  2127     rel_comp_mono ~> relcomp_mono
  2128     rel_comp_subset_Sigma ~> relcomp_subset_Sigma
  2129     rel_comp_distrib ~> relcomp_distrib
  2130     rel_comp_distrib2 ~> relcomp_distrib2
  2131     rel_comp_UNION_distrib ~> relcomp_UNION_distrib
  2132     rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
  2133     single_valued_rel_comp ~> single_valued_relcomp
  2134     rel_comp_def ~> relcomp_unfold
  2135     converse_rel_comp ~> converse_relcomp
  2136     pred_compI ~> relcomppI
  2137     pred_compE ~> relcomppE
  2138     pred_comp_bot1 ~> relcompp_bot1
  2139     pred_comp_bot2 ~> relcompp_bot2
  2140     transp_pred_comp_less_eq ~> transp_relcompp_less_eq
  2141     pred_comp_mono ~> relcompp_mono
  2142     pred_comp_distrib ~> relcompp_distrib
  2143     pred_comp_distrib2 ~> relcompp_distrib2
  2144     converse_pred_comp ~> converse_relcompp
  2145 
  2146     finite_rel_comp ~> finite_relcomp
  2147 
  2148     set_rel_comp ~> set_relcomp
  2149 
  2150 INCOMPATIBILITY.
  2151 
  2152 * Theory Divides: Discontinued redundant theorems about div and mod.
  2153 INCOMPATIBILITY, use the corresponding generic theorems instead.
  2154 
  2155   DIVISION_BY_ZERO ~> div_by_0, mod_by_0
  2156   zdiv_self ~> div_self
  2157   zmod_self ~> mod_self
  2158   zdiv_zero ~> div_0
  2159   zmod_zero ~> mod_0
  2160   zdiv_zmod_equality ~> div_mod_equality2
  2161   zdiv_zmod_equality2 ~> div_mod_equality
  2162   zmod_zdiv_trivial ~> mod_div_trivial
  2163   zdiv_zminus_zminus ~> div_minus_minus
  2164   zmod_zminus_zminus ~> mod_minus_minus
  2165   zdiv_zminus2 ~> div_minus_right
  2166   zmod_zminus2 ~> mod_minus_right
  2167   zdiv_minus1_right ~> div_minus1_right
  2168   zmod_minus1_right ~> mod_minus1_right
  2169   zdvd_mult_div_cancel ~> dvd_mult_div_cancel
  2170   zmod_zmult1_eq ~> mod_mult_right_eq
  2171   zpower_zmod ~> power_mod
  2172   zdvd_zmod ~> dvd_mod
  2173   zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
  2174   mod_mult_distrib ~> mult_mod_left
  2175   mod_mult_distrib2 ~> mult_mod_right
  2176 
  2177 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
  2178 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
  2179 
  2180 * Finite_Set.fold now qualified.  INCOMPATIBILITY.
  2181 
  2182 * Consolidated theorem names concerning fold combinators:
  2183 
  2184   inf_INFI_fold_inf ~> inf_INF_fold_inf
  2185   sup_SUPR_fold_sup ~> sup_SUP_fold_sup
  2186   INFI_fold_inf ~> INF_fold_inf
  2187   SUPR_fold_sup ~> SUP_fold_sup
  2188   union_set ~> union_set_fold
  2189   minus_set ~> minus_set_fold
  2190   INFI_set_fold ~> INF_set_fold
  2191   SUPR_set_fold ~> SUP_set_fold
  2192   INF_code ~> INF_set_foldr
  2193   SUP_code ~> SUP_set_foldr
  2194   foldr.simps ~> foldr.simps (in point-free formulation)
  2195   foldr_fold_rev ~> foldr_conv_fold
  2196   foldl_fold ~> foldl_conv_fold
  2197   foldr_foldr ~> foldr_conv_foldl
  2198   foldl_foldr ~> foldl_conv_foldr
  2199   fold_set_remdups ~> fold_set_fold_remdups
  2200   fold_set ~> fold_set_fold
  2201   fold1_set ~> fold1_set_fold
  2202 
  2203 INCOMPATIBILITY.
  2204 
  2205 * Dropped rarely useful theorems concerning fold combinators:
  2206 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
  2207 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
  2208 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
  2209 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
  2210 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
  2211 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
  2212 INCOMPATIBILITY.  For the common phrases "%xs. List.foldr plus xs 0"
  2213 and "List.foldl plus 0", prefer "List.listsum".  Otherwise it can be
  2214 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
  2215 unfolding "foldr_conv_fold" and "foldl_conv_fold".
  2216 
  2217 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
  2218 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
  2219 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
  2220 INF_set_foldr, SUP_set_foldr.  INCOMPATIBILITY.  Prefer corresponding
  2221 lemmas over fold rather than foldr, or make use of lemmas
  2222 fold_conv_foldr and fold_rev.
  2223 
  2224 * Congruence rules Option.map_cong and Option.bind_cong for recursion
  2225 through option types.
  2226 
  2227 * "Transitive_Closure.ntrancl": bounded transitive closure on
  2228 relations.
  2229 
  2230 * Constant "Set.not_member" now qualified.  INCOMPATIBILITY.
  2231 
  2232 * Theory Int: Discontinued many legacy theorems specific to type int.
  2233 INCOMPATIBILITY, use the corresponding generic theorems instead.
  2234 
  2235   zminus_zminus ~> minus_minus
  2236   zminus_0 ~> minus_zero
  2237   zminus_zadd_distrib ~> minus_add_distrib
  2238   zadd_commute ~> add_commute
  2239   zadd_assoc ~> add_assoc
  2240   zadd_left_commute ~> add_left_commute
  2241   zadd_ac ~> add_ac
  2242   zmult_ac ~> mult_ac
  2243   zadd_0 ~> add_0_left
  2244   zadd_0_right ~> add_0_right
  2245   zadd_zminus_inverse2 ~> left_minus
  2246   zmult_zminus ~> mult_minus_left
  2247   zmult_commute ~> mult_commute
  2248   zmult_assoc ~> mult_assoc
  2249   zadd_zmult_distrib ~> left_distrib
  2250   zadd_zmult_distrib2 ~> right_distrib
  2251   zdiff_zmult_distrib ~> left_diff_distrib
  2252   zdiff_zmult_distrib2 ~> right_diff_distrib
  2253   zmult_1 ~> mult_1_left
  2254   zmult_1_right ~> mult_1_right
  2255   zle_refl ~> order_refl
  2256   zle_trans ~> order_trans
  2257   zle_antisym ~> order_antisym
  2258   zle_linear ~> linorder_linear
  2259   zless_linear ~> linorder_less_linear
  2260   zadd_left_mono ~> add_left_mono
  2261   zadd_strict_right_mono ~> add_strict_right_mono
  2262   zadd_zless_mono ~> add_less_le_mono
  2263   int_0_less_1 ~> zero_less_one
  2264   int_0_neq_1 ~> zero_neq_one
  2265   zless_le ~> less_le
  2266   zpower_zadd_distrib ~> power_add
  2267   zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
  2268   zero_le_zpower_abs ~> zero_le_power_abs
  2269 
  2270 * Theory Deriv: Renamed
  2271 
  2272   DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
  2273 
  2274 * Theory Library/Multiset: Improved code generation of multisets.
  2275 
  2276 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
  2277 are expressed via type classes again. The special syntax
  2278 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
  2279 setsum_set, which is now subsumed by Big_Operators.setsum.
  2280 INCOMPATIBILITY.
  2281 
  2282 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
  2283 use theory HOL/Library/Nat_Bijection instead.
  2284 
  2285 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
  2286 trees is now inside a type class context.  Names of affected
  2287 operations and lemmas have been prefixed by rbt_.  INCOMPATIBILITY for
  2288 theories working directly with raw red-black trees, adapt the names as
  2289 follows:
  2290 
  2291   Operations:
  2292   bulkload -> rbt_bulkload
  2293   del_from_left -> rbt_del_from_left
  2294   del_from_right -> rbt_del_from_right
  2295   del -> rbt_del
  2296   delete -> rbt_delete
  2297   ins -> rbt_ins
  2298   insert -> rbt_insert
  2299   insertw -> rbt_insert_with
  2300   insert_with_key -> rbt_insert_with_key
  2301   map_entry -> rbt_map_entry
  2302   lookup -> rbt_lookup
  2303   sorted -> rbt_sorted
  2304   tree_greater -> rbt_greater
  2305   tree_less -> rbt_less
  2306   tree_less_symbol -> rbt_less_symbol
  2307   union -> rbt_union
  2308   union_with -> rbt_union_with
  2309   union_with_key -> rbt_union_with_key
  2310 
  2311   Lemmas:
  2312   balance_left_sorted -> balance_left_rbt_sorted
  2313   balance_left_tree_greater -> balance_left_rbt_greater
  2314   balance_left_tree_less -> balance_left_rbt_less
  2315   balance_right_sorted -> balance_right_rbt_sorted
  2316   balance_right_tree_greater -> balance_right_rbt_greater
  2317   balance_right_tree_less -> balance_right_rbt_less
  2318   balance_sorted -> balance_rbt_sorted
  2319   balance_tree_greater -> balance_rbt_greater
  2320   balance_tree_less -> balance_rbt_less
  2321   bulkload_is_rbt -> rbt_bulkload_is_rbt
  2322   combine_sorted -> combine_rbt_sorted
  2323   combine_tree_greater -> combine_rbt_greater
  2324   combine_tree_less -> combine_rbt_less
  2325   delete_in_tree -> rbt_delete_in_tree
  2326   delete_is_rbt -> rbt_delete_is_rbt
  2327   del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
  2328   del_from_left_tree_less -> rbt_del_from_left_rbt_less
  2329   del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
  2330   del_from_right_tree_less -> rbt_del_from_right_rbt_less
  2331   del_in_tree -> rbt_del_in_tree
  2332   del_inv1_inv2 -> rbt_del_inv1_inv2
  2333   del_sorted -> rbt_del_rbt_sorted
  2334   del_tree_greater -> rbt_del_rbt_greater
  2335   del_tree_less -> rbt_del_rbt_less
  2336   dom_lookup_Branch -> dom_rbt_lookup_Branch
  2337   entries_lookup -> entries_rbt_lookup
  2338   finite_dom_lookup -> finite_dom_rbt_lookup
  2339   insert_sorted -> rbt_insert_rbt_sorted
  2340   insertw_is_rbt -> rbt_insertw_is_rbt
  2341   insertwk_is_rbt -> rbt_insertwk_is_rbt
  2342   insertwk_sorted -> rbt_insertwk_rbt_sorted
  2343   insertw_sorted -> rbt_insertw_rbt_sorted
  2344   ins_sorted -> ins_rbt_sorted
  2345   ins_tree_greater -> ins_rbt_greater
  2346   ins_tree_less -> ins_rbt_less
  2347   is_rbt_sorted -> is_rbt_rbt_sorted
  2348   lookup_balance -> rbt_lookup_balance
  2349   lookup_bulkload -> rbt_lookup_rbt_bulkload
  2350   lookup_delete -> rbt_lookup_rbt_delete
  2351   lookup_Empty -> rbt_lookup_Empty
  2352   lookup_from_in_tree -> rbt_lookup_from_in_tree
  2353   lookup_in_tree -> rbt_lookup_in_tree
  2354   lookup_ins -> rbt_lookup_ins
  2355   lookup_insert -> rbt_lookup_rbt_insert
  2356   lookup_insertw -> rbt_lookup_rbt_insertw
  2357   lookup_insertwk -> rbt_lookup_rbt_insertwk
  2358   lookup_keys -> rbt_lookup_keys
  2359   lookup_map -> rbt_lookup_map
  2360   lookup_map_entry -> rbt_lookup_rbt_map_entry
  2361   lookup_tree_greater -> rbt_lookup_rbt_greater
  2362   lookup_tree_less -> rbt_lookup_rbt_less
  2363   lookup_union -> rbt_lookup_rbt_union
  2364   map_entry_color_of -> rbt_map_entry_color_of
  2365   map_entry_inv1 -> rbt_map_entry_inv1
  2366   map_entry_inv2 -> rbt_map_entry_inv2
  2367   map_entry_is_rbt -> rbt_map_entry_is_rbt
  2368   map_entry_sorted -> rbt_map_entry_rbt_sorted
  2369   map_entry_tree_greater -> rbt_map_entry_rbt_greater
  2370   map_entry_tree_less -> rbt_map_entry_rbt_less
  2371   map_tree_greater -> map_rbt_greater
  2372   map_tree_less -> map_rbt_less
  2373   map_sorted -> map_rbt_sorted
  2374   paint_sorted -> paint_rbt_sorted
  2375   paint_lookup -> paint_rbt_lookup
  2376   paint_tree_greater -> paint_rbt_greater
  2377   paint_tree_less -> paint_rbt_less
  2378   sorted_entries -> rbt_sorted_entries
  2379   tree_greater_eq_trans -> rbt_greater_eq_trans
  2380   tree_greater_nit -> rbt_greater_nit
  2381   tree_greater_prop -> rbt_greater_prop
  2382   tree_greater_simps -> rbt_greater_simps
  2383   tree_greater_trans -> rbt_greater_trans
  2384   tree_less_eq_trans -> rbt_less_eq_trans
  2385   tree_less_nit -> rbt_less_nit
  2386   tree_less_prop -> rbt_less_prop
  2387   tree_less_simps -> rbt_less_simps
  2388   tree_less_trans -> rbt_less_trans
  2389   tree_ord_props -> rbt_ord_props
  2390   union_Branch -> rbt_union_Branch
  2391   union_is_rbt -> rbt_union_is_rbt
  2392   unionw_is_rbt -> rbt_unionw_is_rbt
  2393   unionwk_is_rbt -> rbt_unionwk_is_rbt
  2394   unionwk_sorted -> rbt_unionwk_rbt_sorted
  2395 
  2396 * Theory HOL/Library/Float: Floating point numbers are now defined as
  2397 a subset of the real numbers.  All operations are defined using the
  2398 lifing-framework and proofs use the transfer method.  INCOMPATIBILITY.
  2399 
  2400   Changed Operations:
  2401   float_abs -> abs
  2402   float_nprt -> nprt
  2403   float_pprt -> pprt
  2404   pow2 -> use powr
  2405   round_down -> float_round_down
  2406   round_up -> float_round_up
  2407   scale -> exponent
  2408 
  2409   Removed Operations:
  2410   ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
  2411 
  2412   Renamed Lemmas:
  2413   abs_float_def -> Float.compute_float_abs
  2414   bitlen_ge0 -> bitlen_nonneg
  2415   bitlen.simps -> Float.compute_bitlen
  2416   float_components -> Float_mantissa_exponent
  2417   float_divl.simps -> Float.compute_float_divl
  2418   float_divr.simps -> Float.compute_float_divr
  2419   float_eq_odd -> mult_powr_eq_mult_powr_iff
  2420   float_power -> real_of_float_power
  2421   lapprox_posrat_def -> Float.compute_lapprox_posrat
  2422   lapprox_rat.simps -> Float.compute_lapprox_rat
  2423   le_float_def' -> Float.compute_float_le
  2424   le_float_def -> less_eq_float.rep_eq
  2425   less_float_def' -> Float.compute_float_less
  2426   less_float_def -> less_float.rep_eq
  2427   normfloat_def -> Float.compute_normfloat
  2428   normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
  2429   normfloat -> normfloat_def
  2430   normfloat_unique -> use normfloat_def
  2431   number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
  2432   one_float_def -> Float.compute_float_one
  2433   plus_float_def -> Float.compute_float_plus
  2434   rapprox_posrat_def -> Float.compute_rapprox_posrat
  2435   rapprox_rat.simps -> Float.compute_rapprox_rat
  2436   real_of_float_0 -> zero_float.rep_eq
  2437   real_of_float_1 -> one_float.rep_eq
  2438   real_of_float_abs -> abs_float.rep_eq
  2439   real_of_float_add -> plus_float.rep_eq
  2440   real_of_float_minus -> uminus_float.rep_eq
  2441   real_of_float_mult -> times_float.rep_eq
  2442   real_of_float_simp -> Float.rep_eq
  2443   real_of_float_sub -> minus_float.rep_eq
  2444   round_down.simps -> Float.compute_float_round_down
  2445   round_up.simps -> Float.compute_float_round_up
  2446   times_float_def -> Float.compute_float_times
  2447   uminus_float_def -> Float.compute_float_uminus
  2448   zero_float_def -> Float.compute_float_zero
  2449 
  2450   Lemmas not necessary anymore, use the transfer method:
  2451   bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
  2452   float_divr, float_le_simp, float_less1_mantissa_bound,
  2453   float_less_simp, float_less_zero, float_le_zero,
  2454   float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
  2455   floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
  2456   lapprox_rat_bottom, normalized_float, rapprox_posrat,
  2457   rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
  2458   real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
  2459   round_up, zero_le_float, zero_less_float
  2460 
  2461 * New theory HOL/Library/DAList provides an abstract type for
  2462 association lists with distinct keys.
  2463 
  2464 * Session HOL/IMP: Added new theory of abstract interpretation of
  2465 annotated commands.
  2466 
  2467 * Session HOL-Import: Re-implementation from scratch is faster,
  2468 simpler, and more scalable.  Requires a proof bundle, which is
  2469 available as an external component.  Discontinued old (and mostly
  2470 dead) Importer for HOL4 and HOL Light.  INCOMPATIBILITY.
  2471 
  2472 * Session HOL-Word: Discontinued many redundant theorems specific to
  2473 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
  2474 instead.
  2475 
  2476   word_sub_alt ~> word_sub_wi
  2477   word_add_alt ~> word_add_def
  2478   word_mult_alt ~> word_mult_def
  2479   word_minus_alt ~> word_minus_def
  2480   word_0_alt ~> word_0_wi
  2481   word_1_alt ~> word_1_wi
  2482   word_add_0 ~> add_0_left
  2483   word_add_0_right ~> add_0_right
  2484   word_mult_1 ~> mult_1_left
  2485   word_mult_1_right ~> mult_1_right
  2486   word_add_commute ~> add_commute
  2487   word_add_assoc ~> add_assoc
  2488   word_add_left_commute ~> add_left_commute
  2489   word_mult_commute ~> mult_commute
  2490   word_mult_assoc ~> mult_assoc
  2491   word_mult_left_commute ~> mult_left_commute
  2492   word_left_distrib ~> left_distrib
  2493   word_right_distrib ~> right_distrib
  2494   word_left_minus ~> left_minus
  2495   word_diff_0_right ~> diff_0_right
  2496   word_diff_self ~> diff_self
  2497   word_sub_def ~> diff_minus
  2498   word_diff_minus ~> diff_minus
  2499   word_add_ac ~> add_ac
  2500   word_mult_ac ~> mult_ac
  2501   word_plus_ac0 ~> add_0_left add_0_right add_ac
  2502   word_times_ac1 ~> mult_1_left mult_1_right mult_ac
  2503   word_order_trans ~> order_trans
  2504   word_order_refl ~> order_refl
  2505   word_order_antisym ~> order_antisym
  2506   word_order_linear ~> linorder_linear
  2507   lenw1_zero_neq_one ~> zero_neq_one
  2508   word_number_of_eq ~> number_of_eq
  2509   word_of_int_add_hom ~> wi_hom_add
  2510   word_of_int_sub_hom ~> wi_hom_sub
  2511   word_of_int_mult_hom ~> wi_hom_mult
  2512   word_of_int_minus_hom ~> wi_hom_neg
  2513   word_of_int_succ_hom ~> wi_hom_succ
  2514   word_of_int_pred_hom ~> wi_hom_pred
  2515   word_of_int_0_hom ~> word_0_wi
  2516   word_of_int_1_hom ~> word_1_wi
  2517 
  2518 * Session HOL-Word: New proof method "word_bitwise" for splitting
  2519 machine word equalities and inequalities into logical circuits,
  2520 defined in HOL/Word/WordBitwise.thy.  Supports addition, subtraction,
  2521 multiplication, shifting by constants, bitwise operators and numeric
  2522 constants.  Requires fixed-length word types, not 'a word.  Solves
  2523 many standard word identities outright and converts more into first
  2524 order problems amenable to blast or similar.  See also examples in
  2525 HOL/Word/Examples/WordExamples.thy.
  2526 
  2527 * Session HOL-Probability: Introduced the type "'a measure" to
  2528 represent measures, this replaces the records 'a algebra and 'a
  2529 measure_space.  The locales based on subset_class now have two
  2530 locale-parameters the space \<Omega> and the set of measurable sets M.
  2531 The product of probability spaces uses now the same constant as the
  2532 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
  2533 measure".  Most constants are defined now outside of locales and gain
  2534 an additional parameter, like null_sets, almost_eventually or \<mu>'.
  2535 Measure space constructions for distributions and densities now got
  2536 their own constants distr and density.  Instead of using locales to
  2537 describe measure spaces with a finite space, the measure count_space
  2538 and point_measure is introduced.  INCOMPATIBILITY.
  2539 
  2540   Renamed constants:
  2541   measure -> emeasure
  2542   finite_measure.\<mu>' -> measure
  2543   product_algebra_generator -> prod_algebra
  2544   product_prob_space.emb -> prod_emb
  2545   product_prob_space.infprod_algebra -> PiM
  2546 
  2547   Removed locales:
  2548   completeable_measure_space
  2549   finite_measure_space
  2550   finite_prob_space
  2551   finite_product_finite_prob_space
  2552   finite_product_sigma_algebra
  2553   finite_sigma_algebra
  2554   measure_space
  2555   pair_finite_prob_space
  2556   pair_finite_sigma_algebra
  2557   pair_finite_space
  2558   pair_sigma_algebra
  2559   product_sigma_algebra
  2560 
  2561   Removed constants:
  2562   conditional_space
  2563   distribution -> use distr measure, or distributed predicate
  2564   image_space
  2565   joint_distribution -> use distr measure, or distributed predicate
  2566   pair_measure_generator
  2567   product_prob_space.infprod_algebra -> use PiM
  2568   subvimage
  2569 
  2570   Replacement theorems:
  2571   finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
  2572   finite_measure.empty_measure -> measure_empty
  2573   finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
  2574   finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
  2575   finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
  2576   finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
  2577   finite_measure.finite_measure -> finite_measure.emeasure_finite
  2578   finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
  2579   finite_measure.positive_measure' -> measure_nonneg
  2580   finite_measure.real_measure -> finite_measure.emeasure_real
  2581   finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
  2582   finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
  2583   finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
  2584   information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
  2585   information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
  2586   information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
  2587   information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
  2588   information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
  2589   information_space.entropy_commute -> information_space.entropy_commute_simple
  2590   information_space.entropy_eq -> information_space.entropy_simple_distributed
  2591   information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
  2592   information_space.entropy_positive -> information_space.entropy_nonneg_simple
  2593   information_space.entropy_uniform_max -> information_space.entropy_uniform
  2594   information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
  2595   information_space.KL_eq_0 -> information_space.KL_same_eq_0
  2596   information_space.KL_ge_0 -> information_space.KL_nonneg
  2597   information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
  2598   information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
  2599   Int_stable_cuboids -> Int_stable_atLeastAtMost
  2600   Int_stable_product_algebra_generator -> positive_integral
  2601   measure_preserving -> equality "distr M N f = N" "f : measurable M N"
  2602   measure_space.additive -> emeasure_additive
  2603   measure_space.AE_iff_null_set -> AE_iff_null
  2604   measure_space.almost_everywhere_def -> eventually_ae_filter
  2605   measure_space.almost_everywhere_vimage -> AE_distrD
  2606   measure_space.continuity_from_above -> INF_emeasure_decseq
  2607   measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
  2608   measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
  2609   measure_space.continuity_from_below -> SUP_emeasure_incseq
  2610   measure_space_density -> emeasure_density
  2611   measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
  2612   measure_space.integrable_vimage -> integrable_distr
  2613   measure_space.integral_translated_density -> integral_density
  2614   measure_space.integral_vimage -> integral_distr
  2615   measure_space.measure_additive -> plus_emeasure
  2616   measure_space.measure_compl -> emeasure_compl
  2617   measure_space.measure_countable_increasing -> emeasure_countable_increasing
  2618   measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
  2619   measure_space.measure_decseq -> decseq_emeasure
  2620   measure_space.measure_Diff -> emeasure_Diff
  2621   measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
  2622   measure_space.measure_eq_0 -> emeasure_eq_0
  2623   measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
  2624   measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
  2625   measure_space.measure_incseq -> incseq_emeasure
  2626   measure_space.measure_insert -> emeasure_insert
  2627   measure_space.measure_mono -> emeasure_mono
  2628   measure_space.measure_not_negative -> emeasure_not_MInf
  2629   measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
  2630   measure_space.measure_setsum -> setsum_emeasure
  2631   measure_space.measure_setsum_split -> setsum_emeasure_cover
  2632   measure_space.measure_space_vimage -> emeasure_distr
  2633   measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
  2634   measure_space.measure_subadditive -> subadditive
  2635   measure_space.measure_top -> emeasure_space
  2636   measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
  2637   measure_space.measure_Un_null_set -> emeasure_Un_null_set
  2638   measure_space.positive_integral_translated_density -> positive_integral_density
  2639   measure_space.positive_integral_vimage -> positive_integral_distr
  2640   measure_space.real_continuity_from_above -> Lim_measure_decseq
  2641   measure_space.real_continuity_from_below -> Lim_measure_incseq
  2642   measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
  2643   measure_space.real_measure_Diff -> measure_Diff
  2644   measure_space.real_measure_finite_Union -> measure_finite_Union
  2645   measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
  2646   measure_space.real_measure_subadditive -> measure_subadditive
  2647   measure_space.real_measure_Union -> measure_Union
  2648   measure_space.real_measure_UNION -> measure_UNION
  2649   measure_space.simple_function_vimage -> simple_function_comp
  2650   measure_space.simple_integral_vimage -> simple_integral_distr
  2651   measure_space.simple_integral_vimage -> simple_integral_distr
  2652   measure_unique_Int_stable -> measure_eqI_generator_eq
  2653   measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
  2654   pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
  2655   pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
  2656   pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
  2657   pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
  2658   pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
  2659   pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
  2660   pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
  2661   pair_sigma_algebra.sets_swap -> sets_pair_swap
  2662   pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
  2663   pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
  2664   pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
  2665   pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
  2666   pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
  2667   pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
  2668   prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
  2669   prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
  2670   prob_space.measure_space_1 -> prob_space.emeasure_space_1
  2671   prob_space.prob_space_vimage -> prob_space_distr
  2672   prob_space.random_variable_restrict -> measurable_restrict
  2673   prob_space_unique_Int_stable -> measure_eqI_prob_space
  2674   product_algebraE -> prod_algebraE_all
  2675   product_algebra_generator_der -> prod_algebra_eq_finite
  2676   product_algebra_generator_into_space -> prod_algebra_sets_into_space
  2677   product_algebraI -> sets_PiM_I_finite
  2678   product_measure_exists -> product_sigma_finite.sigma_finite
  2679   product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
  2680   product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
  2681   product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
  2682   product_prob_space.measurable_component -> measurable_component_singleton
  2683   product_prob_space.measurable_emb -> measurable_prod_emb
  2684   product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
  2685   product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
  2686   product_prob_space.measure_emb -> emeasure_prod_emb
  2687   product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
  2688   product_sigma_algebra.product_algebra_into_space -> space_closed
  2689   product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
  2690   product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
  2691   product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
  2692   sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
  2693   sets_product_algebra -> sets_PiM
  2694   sigma_algebra.measurable_sigma -> measurable_measure_of
  2695   sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
  2696   sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
  2697   sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
  2698   space_product_algebra -> space_PiM
  2699 
  2700 * Session HOL-TPTP: support to parse and import TPTP problems (all
  2701 languages) into Isabelle/HOL.
  2702 
  2703 
  2704 *** FOL ***
  2705 
  2706 * New "case_product" attribute (see HOL).
  2707 
  2708 
  2709 *** ZF ***
  2710 
  2711 * Greater support for structured proofs involving induction or case
  2712 analysis.
  2713 
  2714 * Much greater use of mathematical symbols.
  2715 
  2716 * Removal of many ML theorem bindings.  INCOMPATIBILITY.
  2717 
  2718 
  2719 *** ML ***
  2720 
  2721 * Antiquotation @{keyword "name"} produces a parser for outer syntax
  2722 from a minor keyword introduced via theory header declaration.
  2723 
  2724 * Antiquotation @{command_spec "name"} produces the
  2725 Outer_Syntax.command_spec from a major keyword introduced via theory
  2726 header declaration; it can be passed to Outer_Syntax.command etc.
  2727 
  2728 * Local_Theory.define no longer hard-wires default theorem name
  2729 "foo_def", but retains the binding as given.  If that is Binding.empty
  2730 / Attrib.empty_binding, the result is not registered as user-level
  2731 fact.  The Local_Theory.define_internal variant allows to specify a
  2732 non-empty name (used for the foundation in the background theory),
  2733 while omitting the fact binding in the user-context.  Potential
  2734 INCOMPATIBILITY for derived definitional packages: need to specify
  2735 naming policy for primitive definitions more explicitly.
  2736 
  2737 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
  2738 conformance with similar operations in structure Term and Logic.
  2739 
  2740 * Antiquotation @{attributes [...]} embeds attribute source
  2741 representation into the ML text, which is particularly useful with
  2742 declarations like Local_Theory.note.
  2743 
  2744 * Structure Proof_Context follows standard naming scheme.  Old
  2745 ProofContext has been discontinued.  INCOMPATIBILITY.
  2746 
  2747 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
  2748 change of semantics: update is applied to auxiliary local theory
  2749 context as well.
  2750 
  2751 * Modernized some old-style infix operations:
  2752 
  2753   addeqcongs    ~> Simplifier.add_eqcong
  2754   deleqcongs    ~> Simplifier.del_eqcong
  2755   addcongs      ~> Simplifier.add_cong
  2756   delcongs      ~> Simplifier.del_cong
  2757   setmksimps    ~> Simplifier.set_mksimps
  2758   setmkcong     ~> Simplifier.set_mkcong
  2759   setmksym      ~> Simplifier.set_mksym
  2760   setmkeqTrue   ~> Simplifier.set_mkeqTrue
  2761   settermless   ~> Simplifier.set_termless
  2762   setsubgoaler  ~> Simplifier.set_subgoaler
  2763   addsplits     ~> Splitter.add_split
  2764   delsplits     ~> Splitter.del_split
  2765 
  2766 
  2767 *** System ***
  2768 
  2769 * USER_HOME settings variable points to cross-platform user home
  2770 directory, which coincides with HOME on POSIX systems only.  Likewise,
  2771 the Isabelle path specification "~" now expands to $USER_HOME, instead
  2772 of former $HOME.  A different default for USER_HOME may be set
  2773 explicitly in shell environment, before Isabelle settings are
  2774 evaluated.  Minor INCOMPATIBILITY: need to adapt Isabelle path where
  2775 the generic user home was intended.
  2776 
  2777 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
  2778 notation, which is useful for the jEdit file browser, for example.
  2779 
  2780 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
  2781 (not just JRE).
  2782 
  2783 
  2784 
  2785 New in Isabelle2011-1 (October 2011)
  2786 ------------------------------------
  2787 
  2788 *** General ***
  2789 
  2790 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
  2791 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
  2792 
  2793   - Management of multiple theory files directly from the editor
  2794     buffer store -- bypassing the file-system (no requirement to save
  2795     files for checking).
  2796 
  2797   - Markup of formal entities within the text buffer, with semantic
  2798     highlighting, tooltips and hyperlinks to jump to defining source
  2799     positions.
  2800 
  2801   - Improved text rendering, with sub/superscripts in the source
  2802     buffer (including support for copy/paste wrt. output panel, HTML
  2803     theory output and other non-Isabelle text boxes).
  2804 
  2805   - Refined scheduling of proof checking and printing of results,
  2806     based on interactive editor view.  (Note: jEdit folding and
  2807     narrowing allows to restrict buffer perspectives explicitly.)
  2808 
  2809   - Reduced CPU performance requirements, usable on machines with few
  2810     cores.
  2811 
  2812   - Reduced memory requirements due to pruning of unused document
  2813     versions (garbage collection).
  2814 
  2815 See also ~~/src/Tools/jEdit/README.html for further information,
  2816 including some remaining limitations.
  2817 
  2818 * Theory loader: source files are exclusively located via the master
  2819 directory of each theory node (where the .thy file itself resides).
  2820 The global load path (such as src/HOL/Library) has been discontinued.
  2821 Note that the path element ~~ may be used to reference theories in the
  2822 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
  2823 INCOMPATIBILITY.
  2824 
  2825 * Theory loader: source files are identified by content via SHA1
  2826 digests.  Discontinued former path/modtime identification and optional
  2827 ISABELLE_FILE_IDENT plugin scripts.
  2828 
  2829 * Parallelization of nested Isar proofs is subject to
  2830 Goal.parallel_proofs_threshold (default 100).  See also isabelle
  2831 usedir option -Q.
  2832 
  2833 * Name space: former unsynchronized references are now proper
  2834 configuration options, with more conventional names:
  2835 
  2836   long_names   ~> names_long
  2837   short_names  ~> names_short
  2838   unique_names ~> names_unique
  2839 
  2840 Minor INCOMPATIBILITY, need to declare options in context like this:
  2841 
  2842   declare [[names_unique = false]]
  2843 
  2844 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`.  Note
  2845 that the result needs to be unique, which means fact specifications
  2846 may have to be refined after enriching a proof context.
  2847 
  2848 * Attribute "case_names" has been refined: the assumptions in each case
  2849 can be named now by following the case name with [name1 name2 ...].
  2850 
  2851 * Isabelle/Isar reference manual has been updated and extended:
  2852   - "Synopsis" provides a catalog of main Isar language concepts.
  2853   - Formal references in syntax diagrams, via @{rail} antiquotation.
  2854   - Updated material from classic "ref" manual, notably about
  2855     "Classical Reasoner".
  2856 
  2857 
  2858 *** HOL ***
  2859 
  2860 * Class bot and top require underlying partial order rather than
  2861 preorder: uniqueness of bot and top is guaranteed.  INCOMPATIBILITY.
  2862 
  2863 * Class complete_lattice: generalized a couple of lemmas from sets;
  2864 generalized theorems INF_cong and SUP_cong.  New type classes for
  2865 complete boolean algebras and complete linear orders.  Lemmas
  2866 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
  2867 class complete_linorder.
  2868 
  2869 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
  2870 Sup_fun_def, Inf_apply, Sup_apply.
  2871 
  2872 Removed redundant lemmas (the right hand side gives hints how to
  2873 replace them for (metis ...), or (simp only: ...) proofs):
  2874 
  2875   Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
  2876   Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
  2877   Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
  2878   Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
  2879   Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
  2880   Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
  2881   Inter_def ~> INF_def, image_def
  2882   Union_def ~> SUP_def, image_def
  2883   INT_eq ~> INF_def, and image_def
  2884   UN_eq ~> SUP_def, and image_def
  2885   INF_subset ~> INF_superset_mono [OF _ order_refl]
  2886 
  2887 More consistent and comprehensive names:
  2888 
  2889   INTER_eq_Inter_image ~> INF_def
  2890   UNION_eq_Union_image ~> SUP_def
  2891   INFI_def ~> INF_def
  2892   SUPR_def ~> SUP_def
  2893   INF_leI ~> INF_lower
  2894   INF_leI2 ~> INF_lower2
  2895   le_INFI ~> INF_greatest
  2896   le_SUPI ~> SUP_upper
  2897   le_SUPI2 ~> SUP_upper2
  2898   SUP_leI ~> SUP_least
  2899   INFI_bool_eq ~> INF_bool_eq
  2900   SUPR_bool_eq ~> SUP_bool_eq
  2901   INFI_apply ~> INF_apply
  2902   SUPR_apply ~> SUP_apply
  2903   INTER_def ~> INTER_eq
  2904   UNION_def ~> UNION_eq
  2905 
  2906 INCOMPATIBILITY.
  2907 
  2908 * Renamed theory Complete_Lattice to Complete_Lattices.
  2909 INCOMPATIBILITY.
  2910 
  2911 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
  2912 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
  2913 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
  2914 Sup_insert are now declared as [simp].  INCOMPATIBILITY.
  2915 
  2916 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
  2917 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
  2918 sup_inf_absob, sup_left_idem are now declared as [simp].  Minor
  2919 INCOMPATIBILITY.
  2920 
  2921 * Added syntactic classes "inf" and "sup" for the respective
  2922 constants.  INCOMPATIBILITY: Changes in the argument order of the
  2923 (mostly internal) locale predicates for some derived classes.
  2924 
  2925 * Theorem collections ball_simps and bex_simps do not contain theorems
  2926 referring to UNION any longer; these have been moved to collection
  2927 UN_ball_bex_simps.  INCOMPATIBILITY.
  2928 
  2929 * Theory Archimedean_Field: floor now is defined as parameter of a
  2930 separate type class floor_ceiling.
  2931 
  2932 * Theory Finite_Set: more coherent development of fold_set locales:
  2933 
  2934     locale fun_left_comm ~> locale comp_fun_commute
  2935     locale fun_left_comm_idem ~> locale comp_fun_idem
  2936 
  2937 Both use point-free characterization; interpretation proofs may need
  2938 adjustment.  INCOMPATIBILITY.
  2939 
  2940 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
  2941 accordance with standard mathematical terminology. INCOMPATIBILITY.
  2942 
  2943 * Theory Complex_Main: The locale interpretations for the
  2944 bounded_linear and bounded_bilinear locales have been removed, in
  2945 order to reduce the number of duplicate lemmas. Users must use the
  2946 original names for distributivity theorems, potential INCOMPATIBILITY.
  2947 
  2948   divide.add ~> add_divide_distrib
  2949   divide.diff ~> diff_divide_distrib
  2950   divide.setsum ~> setsum_divide_distrib
  2951   mult.add_right ~> right_distrib
  2952   mult.diff_right ~> right_diff_distrib
  2953   mult_right.setsum ~> setsum_right_distrib
  2954   mult_left.diff ~> left_diff_distrib
  2955 
  2956 * Theory Complex_Main: Several redundant theorems have been removed or
  2957 replaced by more general versions. INCOMPATIBILITY.
  2958 
  2959   real_diff_def ~> minus_real_def
  2960   real_divide_def ~> divide_real_def
  2961   real_less_def ~> less_le
  2962   real_abs_def ~> abs_real_def
  2963   real_sgn_def ~> sgn_real_def
  2964   real_mult_commute ~> mult_commute
  2965   real_mult_assoc ~> mult_assoc
  2966   real_mult_1 ~> mult_1_left
  2967   real_add_mult_distrib ~> left_distrib
  2968   real_zero_not_eq_one ~> zero_neq_one
  2969   real_mult_inverse_left ~> left_inverse
  2970   INVERSE_ZERO ~> inverse_zero
  2971   real_le_refl ~> order_refl
  2972   real_le_antisym ~> order_antisym
  2973   real_le_trans ~> order_trans
  2974   real_le_linear ~> linear
  2975   real_le_eq_diff ~> le_iff_diff_le_0
  2976   real_add_left_mono ~> add_left_mono
  2977   real_mult_order ~> mult_pos_pos
  2978   real_mult_less_mono2 ~> mult_strict_left_mono
  2979   real_of_int_real_of_nat ~> real_of_int_of_nat_eq
  2980   real_0_le_divide_iff ~> zero_le_divide_iff
  2981   realpow_two_disj ~> power2_eq_iff
  2982   real_squared_diff_one_factored ~> square_diff_one_factored
  2983   realpow_two_diff ~> square_diff_square_factored
  2984   reals_complete2 ~> complete_real
  2985   real_sum_squared_expand ~> power2_sum
  2986   exp_ln_eq ~> ln_unique
  2987   expi_add ~> exp_add
  2988   expi_zero ~> exp_zero
  2989   lemma_DERIV_subst ~> DERIV_cong
  2990   LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
  2991   LIMSEQ_const ~> tendsto_const
  2992   LIMSEQ_norm ~> tendsto_norm
  2993   LIMSEQ_add ~> tendsto_add
  2994   LIMSEQ_minus ~> tendsto_minus
  2995   LIMSEQ_minus_cancel ~> tendsto_minus_cancel
  2996   LIMSEQ_diff ~> tendsto_diff
  2997   bounded_linear.LIMSEQ ~> bounded_linear.tendsto
  2998   bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
  2999   LIMSEQ_mult ~> tendsto_mult
  3000   LIMSEQ_inverse ~> tendsto_inverse
  3001   LIMSEQ_divide ~> tendsto_divide
  3002   LIMSEQ_pow ~> tendsto_power
  3003   LIMSEQ_setsum ~> tendsto_setsum
  3004   LIMSEQ_setprod ~> tendsto_setprod
  3005   LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
  3006   LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
  3007   LIMSEQ_imp_rabs ~> tendsto_rabs
  3008   LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
  3009   LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
  3010   LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
  3011   LIMSEQ_Complex ~> tendsto_Complex
  3012   LIM_ident ~> tendsto_ident_at
  3013   LIM_const ~> tendsto_const
  3014   LIM_add ~> tendsto_add
  3015   LIM_add_zero ~> tendsto_add_zero
  3016   LIM_minus ~> tendsto_minus
  3017   LIM_diff ~> tendsto_diff
  3018   LIM_norm ~> tendsto_norm
  3019   LIM_norm_zero ~> tendsto_norm_zero
  3020   LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
  3021   LIM_norm_zero_iff ~> tendsto_norm_zero_iff
  3022   LIM_rabs ~> tendsto_rabs
  3023   LIM_rabs_zero ~> tendsto_rabs_zero
  3024   LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
  3025   LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
  3026   LIM_compose ~> tendsto_compose
  3027   LIM_mult ~> tendsto_mult
  3028   LIM_scaleR ~> tendsto_scaleR
  3029   LIM_of_real ~> tendsto_of_real
  3030   LIM_power ~> tendsto_power
  3031   LIM_inverse ~> tendsto_inverse
  3032   LIM_sgn ~> tendsto_sgn
  3033   isCont_LIM_compose ~> isCont_tendsto_compose
  3034   bounded_linear.LIM ~> bounded_linear.tendsto
  3035   bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
  3036   bounded_bilinear.LIM ~> bounded_bilinear.tendsto
  3037   bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
  3038   bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
  3039   bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
  3040   LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
  3041 
  3042 * Theory Complex_Main: The definition of infinite series was
  3043 generalized.  Now it is defined on the type class {topological_space,
  3044 comm_monoid_add}.  Hence it is useable also for extended real numbers.
  3045 
  3046 * Theory Complex_Main: The complex exponential function "expi" is now
  3047 a type-constrained abbreviation for "exp :: complex => complex"; thus
  3048 several polymorphic lemmas about "exp" are now applicable to "expi".
  3049 
  3050 * Code generation:
  3051 
  3052   - Theory Library/Code_Char_ord provides native ordering of
  3053     characters in the target language.
  3054 
  3055   - Commands code_module and code_library are legacy, use export_code
  3056     instead.
  3057 
  3058   - Method "evaluation" is legacy, use method "eval" instead.
  3059 
  3060   - Legacy evaluator "SML" is deactivated by default.  May be
  3061     reactivated by the following theory command:
  3062 
  3063       setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
  3064 
  3065 * Declare ext [intro] by default.  Rare INCOMPATIBILITY.
  3066 
  3067 * New proof method "induction" that gives induction hypotheses the
  3068 name "IH", thus distinguishing them from further hypotheses that come
  3069 from rule induction.  The latter are still called "hyps".  Method
  3070 "induction" is a thin wrapper around "induct" and follows the same
  3071 syntax.
  3072 
  3073 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
  3074 still available as a legacy feature for some time.
  3075 
  3076 * Nitpick:
  3077   - Added "need" and "total_consts" options.
  3078   - Reintroduced "show_skolems" option by popular demand.
  3079   - Renamed attribute: nitpick_def ~> nitpick_unfold.
  3080     INCOMPATIBILITY.
  3081 
  3082 * Sledgehammer:
  3083   - Use quasi-sound (and efficient) translations by default.
  3084   - Added support for the following provers: E-ToFoF, LEO-II,
  3085     Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
  3086   - Automatically preplay and minimize proofs before showing them if
  3087     this can be done within reasonable time.
  3088   - sledgehammer available_provers ~> sledgehammer supported_provers.
  3089     INCOMPATIBILITY.
  3090   - Added "preplay_timeout", "slicing", "type_enc", "sound",
  3091     "max_mono_iters", and "max_new_mono_instances" options.
  3092   - Removed "explicit_apply" and "full_types" options as well as "Full
  3093     Types" Proof General menu item. INCOMPATIBILITY.
  3094 
  3095 * Metis:
  3096   - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
  3097   - Obsoleted "metisFT" -- use "metis (full_types)" instead.
  3098     INCOMPATIBILITY.
  3099 
  3100 * Command 'try':
  3101   - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
  3102     "elim:" options. INCOMPATIBILITY.
  3103   - Introduced 'try' that not only runs 'try_methods' but also
  3104     'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
  3105 
  3106 * Quickcheck:
  3107   - Added "eval" option to evaluate terms for the found counterexample
  3108     (currently only supported by the default (exhaustive) tester).
  3109   - Added post-processing of terms to obtain readable counterexamples
  3110     (currently only supported by the default (exhaustive) tester).
  3111   - New counterexample generator quickcheck[narrowing] enables
  3112     narrowing-based testing.  Requires the Glasgow Haskell compiler
  3113     with its installation location defined in the Isabelle settings
  3114     environment as ISABELLE_GHC.
  3115   - Removed quickcheck tester "SML" based on the SML code generator
  3116     (formly in HOL/Library).
  3117 
  3118 * Function package: discontinued option "tailrec".  INCOMPATIBILITY,
  3119 use 'partial_function' instead.
  3120 
  3121 * Theory Library/Extended_Reals replaces now the positive extended
  3122 reals found in probability theory. This file is extended by
  3123 Multivariate_Analysis/Extended_Real_Limits.
  3124 
  3125 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
  3126 from where it must be imported explicitly if it is really required.
  3127 INCOMPATIBILITY.
  3128 
  3129 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
  3130 been moved here.  INCOMPATIBILITY.
  3131 
  3132 * Theory Library/Saturated provides type of numbers with saturated
  3133 arithmetic.
  3134 
  3135 * Theory Library/Product_Lattice defines a pointwise ordering for the
  3136 product type 'a * 'b, and provides instance proofs for various order
  3137 and lattice type classes.
  3138 
  3139 * Theory Library/Countable now provides the "countable_datatype" proof
  3140 method for proving "countable" class instances for datatypes.
  3141 
  3142 * Theory Library/Cset_Monad allows do notation for computable sets
  3143 (cset) via the generic monad ad-hoc overloading facility.
  3144 
  3145 * Library: Theories of common data structures are split into theories
  3146 for implementation, an invariant-ensuring type, and connection to an
  3147 abstract type. INCOMPATIBILITY.
  3148 
  3149   - RBT is split into RBT and RBT_Mapping.
  3150   - AssocList is split and renamed into AList and AList_Mapping.
  3151   - DList is split into DList_Impl, DList, and DList_Cset.
  3152   - Cset is split into Cset and List_Cset.
  3153 
  3154 * Theory Library/Nat_Infinity has been renamed to
  3155 Library/Extended_Nat, with name changes of the following types and
  3156 constants:
  3157 
  3158   type inat   ~> type enat
  3159   Fin         ~> enat
  3160   Infty       ~> infinity (overloaded)
  3161   iSuc        ~> eSuc
  3162   the_Fin     ~> the_enat
  3163 
  3164 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
  3165 been renamed accordingly. INCOMPATIBILITY.
  3166 
  3167 * Session Multivariate_Analysis: The euclidean_space type class now
  3168 fixes a constant "Basis :: 'a set" consisting of the standard
  3169 orthonormal basis for the type. Users now have the option of
  3170 quantifying over this set instead of using the "basis" function, e.g.
  3171 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
  3172 
  3173 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
  3174 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
  3175 "Cart_nth" and "Cart_lambda" have been respectively renamed to
  3176 "vec_nth" and "vec_lambda"; theorems mentioning those names have
  3177 changed to match. Definition theorems for overloaded constants now use
  3178 the standard "foo_vec_def" naming scheme. A few other theorems have
  3179 been renamed as follows (INCOMPATIBILITY):
  3180 
  3181   Cart_eq          ~> vec_eq_iff
  3182   dist_nth_le_cart ~> dist_vec_nth_le
  3183   tendsto_vector   ~> vec_tendstoI
  3184   Cauchy_vector    ~> vec_CauchyI
  3185 
  3186 * Session Multivariate_Analysis: Several duplicate theorems have been
  3187 removed, and other theorems have been renamed or replaced with more
  3188 general versions. INCOMPATIBILITY.
  3189 
  3190   finite_choice ~> finite_set_choice
  3191   eventually_conjI ~> eventually_conj
  3192   eventually_and ~> eventually_conj_iff
  3193   eventually_false ~> eventually_False
  3194   setsum_norm ~> norm_setsum
  3195   Lim_sequentially ~> LIMSEQ_def
  3196   Lim_ident_at ~> LIM_ident
  3197   Lim_const ~> tendsto_const
  3198   Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
  3199   Lim_neg ~> tendsto_minus
  3200   Lim_add ~> tendsto_add
  3201   Lim_sub ~> tendsto_diff
  3202   Lim_mul ~> tendsto_scaleR
  3203   Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
  3204   Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
  3205   Lim_linear ~> bounded_linear.tendsto
  3206   Lim_component ~> tendsto_euclidean_component
  3207   Lim_component_cart ~> tendsto_vec_nth
  3208   Lim_inner ~> tendsto_inner [OF tendsto_const]
  3209   dot_lsum ~> inner_setsum_left
  3210   dot_rsum ~> inner_setsum_right
  3211   continuous_cmul ~> continuous_scaleR [OF continuous_const]
  3212   continuous_neg ~> continuous_minus
  3213   continuous_sub ~> continuous_diff
  3214   continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
  3215   continuous_mul ~> continuous_scaleR
  3216   continuous_inv ~> continuous_inverse
  3217   continuous_at_within_inv ~> continuous_at_within_inverse
  3218   continuous_at_inv ~> continuous_at_inverse
  3219   continuous_at_norm ~> continuous_norm [OF continuous_at_id]
  3220   continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
  3221   continuous_at_component ~> continuous_component [OF continuous_at_id]
  3222   continuous_on_neg ~> continuous_on_minus
  3223   continuous_on_sub ~> continuous_on_diff
  3224   continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
  3225   continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
  3226   continuous_on_mul ~> continuous_on_scaleR
  3227   continuous_on_mul_real ~> continuous_on_mult
  3228   continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
  3229   continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
  3230   continuous_on_inverse ~> continuous_on_inv
  3231   uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
  3232   uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
  3233   subset_interior ~> interior_mono
  3234   subset_closure ~> closure_mono
  3235   closure_univ ~> closure_UNIV
  3236   real_arch_lt ~> reals_Archimedean2
  3237   real_arch ~> reals_Archimedean3
  3238   real_abs_norm ~> abs_norm_cancel
  3239   real_abs_sub_norm ~> norm_triangle_ineq3
  3240   norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
  3241 
  3242 * Session HOL-Probability:
  3243   - Caratheodory's extension lemma is now proved for ring_of_sets.
  3244   - Infinite products of probability measures are now available.
  3245   - Sigma closure is independent, if the generator is independent
  3246   - Use extended reals instead of positive extended
  3247     reals. INCOMPATIBILITY.
  3248 
  3249 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
  3250 
  3251   expand_fun_below ~> fun_below_iff
  3252   below_fun_ext ~> fun_belowI
  3253   expand_cfun_eq ~> cfun_eq_iff
  3254   ext_cfun ~> cfun_eqI
  3255   expand_cfun_below ~> cfun_below_iff
  3256   below_cfun_ext ~> cfun_belowI
  3257   monofun_fun_fun ~> fun_belowD
  3258   monofun_fun_arg ~> monofunE
  3259   monofun_lub_fun ~> adm_monofun [THEN admD]
  3260   cont_lub_fun ~> adm_cont [THEN admD]
  3261   cont2cont_Rep_CFun ~> cont2cont_APP
  3262   cont_Rep_CFun_app ~> cont_APP_app
  3263   cont_Rep_CFun_app_app ~> cont_APP_app_app
  3264   cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
  3265   cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
  3266   contlub_cfun ~> lub_APP [symmetric]
  3267   contlub_LAM ~> lub_LAM [symmetric]
  3268   thelubI ~> lub_eqI
  3269   UU_I ~> bottomI
  3270   lift_distinct1 ~> lift.distinct(1)
  3271   lift_distinct2 ~> lift.distinct(2)
  3272   Def_not_UU ~> lift.distinct(2)
  3273   Def_inject ~> lift.inject
  3274   below_UU_iff ~> below_bottom_iff
  3275   eq_UU_iff ~> eq_bottom_iff
  3276 
  3277 
  3278 *** Document preparation ***
  3279 
  3280 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
  3281 isar-ref manual, both for description and actual application of the
  3282 same.
  3283 
  3284 * Antiquotation @{value} evaluates the given term and presents its
  3285 result.
  3286 
  3287 * Antiquotations: term style "isub" provides ad-hoc conversion of
  3288 variables x1, y23 into subscripted form x\<^isub>1,
  3289 y\<^isub>2\<^isub>3.
  3290 
  3291 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
  3292 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
  3293 
  3294 * Localized \isabellestyle switch can be used within blocks or groups
  3295 like this:
  3296 
  3297   \isabellestyle{it}  %preferred default
  3298   {\isabellestylett @{text "typewriter stuff"}}
  3299 
  3300 * Discontinued special treatment of hard tabulators.  Implicit
  3301 tab-width is now defined as 1.  Potential INCOMPATIBILITY for visual
  3302 layouts.
  3303 
  3304 
  3305 *** ML ***
  3306 
  3307 * The inner syntax of sort/type/term/prop supports inlined YXML
  3308 representations within quoted string tokens.  By encoding logical
  3309 entities via Term_XML (in ML or Scala) concrete syntax can be
  3310 bypassed, which is particularly useful for producing bits of text
  3311 under external program control.
  3312 
  3313 * Antiquotations for ML and document preparation are managed as theory
  3314 data, which requires explicit setup.
  3315 
  3316 * Isabelle_Process.is_active allows tools to check if the official
  3317 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
  3318 (better known as Proof General).
  3319 
  3320 * Structure Proof_Context follows standard naming scheme.  Old
  3321 ProofContext is still available for some time as legacy alias.
  3322 
  3323 * Structure Timing provides various operations for timing; supersedes
  3324 former start_timing/end_timing etc.
  3325 
  3326 * Path.print is the official way to show file-system paths to users
  3327 (including quotes etc.).
  3328 
  3329 * Inner syntax: identifiers in parse trees of generic categories
  3330 "logic", "aprop", "idt" etc. carry position information (disguised as
  3331 type constraints).  Occasional INCOMPATIBILITY with non-compliant
  3332 translations that choke on unexpected type constraints.  Positions can
  3333 be stripped in ML translations via Syntax.strip_positions /
  3334 Syntax.strip_positions_ast, or via the syntax constant
  3335 "_strip_positions" within parse trees.  As last resort, positions can
  3336 be disabled via the configuration option Syntax.positions, which is
  3337 called "syntax_positions" in Isar attribute syntax.
  3338 
  3339 * Discontinued special status of various ML structures that contribute
  3340 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
  3341 pervasive content, no inclusion in structure Syntax.  INCOMPATIBILITY,
  3342 refer directly to Ast.Constant, Lexicon.is_identifier,
  3343 Syntax_Trans.mk_binder_tr etc.
  3344 
  3345 * Typed print translation: discontinued show_sorts argument, which is
  3346 already available via context of "advanced" translation.
  3347 
  3348 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
  3349 goal states; body tactic needs to address all subgoals uniformly.
  3350 
  3351 * Slightly more special eq_list/eq_set, with shortcut involving
  3352 pointer equality (assumes that eq relation is reflexive).
  3353 
  3354 * Classical tactics use proper Proof.context instead of historic types
  3355 claset/clasimpset.  Old-style declarations like addIs, addEs, addDs
  3356 operate directly on Proof.context.  Raw type claset retains its use as
  3357 snapshot of the classical context, which can be recovered via
  3358 (put_claset HOL_cs) etc.  Type clasimpset has been discontinued.
  3359 INCOMPATIBILITY, classical tactics and derived proof methods require
  3360 proper Proof.context.
  3361 
  3362 
  3363 *** System ***
  3364 
  3365 * Discontinued support for Poly/ML 5.2, which was the last version
  3366 without proper multithreading and TimeLimit implementation.
  3367 
  3368 * Discontinued old lib/scripts/polyml-platform, which has been
  3369 obsolete since Isabelle2009-2.
  3370 
  3371 * Various optional external tools are referenced more robustly and
  3372 uniformly by explicit Isabelle settings as follows:
  3373 
  3374   ISABELLE_CSDP   (formerly CSDP_EXE)
  3375   ISABELLE_GHC    (formerly EXEC_GHC or GHC_PATH)
  3376   ISABELLE_OCAML  (formerly EXEC_OCAML)
  3377   ISABELLE_SWIPL  (formerly EXEC_SWIPL)
  3378   ISABELLE_YAP    (formerly EXEC_YAP)
  3379 
  3380 Note that automated detection from the file-system or search path has
  3381 been discontinued.  INCOMPATIBILITY.
  3382 
  3383 * Scala layer provides JVM method invocation service for static
  3384 methods of type (String)String, see Invoke_Scala.method in ML.  For
  3385 example:
  3386 
  3387   Invoke_Scala.method "java.lang.System.getProperty" "java.home"
  3388 
  3389 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
  3390 this allows to pass structured values between ML and Scala.
  3391 
  3392 * The IsabelleText fonts includes some further glyphs to support the
  3393 Prover IDE.  Potential INCOMPATIBILITY: users who happen to have
  3394 installed a local copy (which is normally *not* required) need to
  3395 delete or update it from ~~/lib/fonts/.
  3396 
  3397 
  3398 
  3399 New in Isabelle2011 (January 2011)
  3400 ----------------------------------
  3401 
  3402 *** General ***
  3403 
  3404 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
  3405 src/Tools/jEdit).  This also serves as IDE for Isabelle/ML, with
  3406 useful tooltips and hyperlinks produced from its static analysis.  The
  3407 bundled component provides an executable Isabelle tool that can be run
  3408 like this:
  3409 
  3410   Isabelle2011/bin/isabelle jedit
  3411 
  3412 * Significantly improved Isabelle/Isar implementation manual.
  3413 
  3414 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
  3415 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
  3416 while the default heap location within that directory lacks that extra
  3417 suffix.  This isolates multiple Isabelle installations from each
  3418 other, avoiding problems with old settings in new versions.
  3419 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
  3420 
  3421 * Source files are always encoded as UTF-8, instead of old-fashioned
  3422 ISO-Latin-1.  INCOMPATIBILITY.  Isabelle LaTeX documents might require
  3423 the following package declarations:
  3424 
  3425   \usepackage[utf8]{inputenc}
  3426   \usepackage{textcomp}
  3427 
  3428 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
  3429 a Unicode character is treated as a single symbol, not a sequence of
  3430 non-ASCII bytes as before.  Since Isabelle/ML string literals may
  3431 contain symbols without further backslash escapes, Unicode can now be
  3432 used here as well.  Recall that Symbol.explode in ML provides a
  3433 consistent view on symbols, while raw explode (or String.explode)
  3434 merely give a byte-oriented representation.
  3435 
  3436 * Theory loader: source files are primarily located via the master
  3437 directory of each theory node (where the .thy file itself resides).
  3438 The global load path is still partially available as legacy feature.
  3439 Minor INCOMPATIBILITY due to subtle change in file lookup: use
  3440 explicit paths, relatively to the theory.
  3441 
  3442 * Special treatment of ML file names has been discontinued.
  3443 Historically, optional extensions .ML or .sml were added on demand --
  3444 at the cost of clarity of file dependencies.  Recall that Isabelle/ML
  3445 files exclusively use the .ML extension.  Minor INCOMPATIBILTY.
  3446 
  3447 * Various options that affect pretty printing etc. are now properly
  3448 handled within the context via configuration options, instead of
  3449 unsynchronized references or print modes.  There are both ML Config.T
  3450 entities and Isar declaration attributes to access these.
  3451 
  3452   ML (Config.T)                 Isar (attribute)
  3453 
  3454   eta_contract                  eta_contract
  3455   show_brackets                 show_brackets
  3456   show_sorts                    show_sorts
  3457   show_types                    show_types
  3458   show_question_marks           show_question_marks
  3459   show_consts                   show_consts
  3460   show_abbrevs                  show_abbrevs
  3461 
  3462   Syntax.ast_trace              syntax_ast_trace
  3463   Syntax.ast_stat               syntax_ast_stat
  3464   Syntax.ambiguity_level        syntax_ambiguity_level
  3465 
  3466   Goal_Display.goals_limit      goals_limit
  3467   Goal_Display.show_main_goal   show_main_goal
  3468 
  3469   Method.rule_trace             rule_trace
  3470 
  3471   Thy_Output.display            thy_output_display
  3472   Thy_Output.quotes             thy_output_quotes
  3473   Thy_Output.indent             thy_output_indent
  3474   Thy_Output.source             thy_output_source
  3475   Thy_Output.break              thy_output_break
  3476 
  3477 Note that corresponding "..._default" references in ML may only be
  3478 changed globally at the ROOT session setup, but *not* within a theory.
  3479 The option "show_abbrevs" supersedes the former print mode
  3480 "no_abbrevs" with inverted meaning.
  3481 
  3482 * More systematic naming of some configuration options.
  3483 INCOMPATIBILITY.
  3484 
  3485   trace_simp  ~>  simp_trace
  3486   debug_simp  ~>  simp_debug
  3487 
  3488 * Support for real valued configuration options, using simplistic
  3489 floating-point notation that coincides with the inner syntax for
  3490 float_token.
  3491 
  3492 * Support for real valued preferences (with approximative PGIP type):
  3493 front-ends need to accept "pgint" values in float notation.
  3494 INCOMPATIBILITY.
  3495 
  3496 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
  3497 DejaVu Sans.
  3498 
  3499 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
  3500 
  3501 
  3502 *** Pure ***
  3503 
  3504 * Command 'type_synonym' (with single argument) replaces somewhat
  3505 outdated 'types', which is still available as legacy feature for some
  3506 time.
  3507 
  3508 * Command 'nonterminal' (with 'and' separated list of arguments)
  3509 replaces somewhat outdated 'nonterminals'.  INCOMPATIBILITY.
  3510 
  3511 * Command 'notepad' replaces former 'example_proof' for
  3512 experimentation in Isar without any result.  INCOMPATIBILITY.
  3513 
  3514 * Locale interpretation commands 'interpret' and 'sublocale' accept
  3515 lists of equations to map definitions in a locale to appropriate
  3516 entities in the context of the interpretation.  The 'interpretation'
  3517 command already provided this functionality.
  3518 
  3519 * Diagnostic command 'print_dependencies' prints the locale instances
  3520 that would be activated if the specified expression was interpreted in
  3521 the current context.  Variant "print_dependencies!" assumes a context
  3522 without interpretations.
  3523 
  3524 * Diagnostic command 'print_interps' prints interpretations in proofs
  3525 in addition to interpretations in theories.
  3526 
  3527 * Discontinued obsolete 'global' and 'local' commands to manipulate
  3528 the theory name space.  Rare INCOMPATIBILITY.  The ML functions
  3529 Sign.root_path and Sign.local_path may be applied directly where this
  3530 feature is still required for historical reasons.
  3531 
  3532 * Discontinued obsolete 'constdefs' command.  INCOMPATIBILITY, use
  3533 'definition' instead.
  3534 
  3535 * The "prems" fact, which refers to the accidental collection of
  3536 foundational premises in the context, is now explicitly marked as
  3537 legacy feature and will be discontinued soon.  Consider using "assms"
  3538 of the head statement or reference facts by explicit names.
  3539 
  3540 * Document antiquotations @{class} and @{type} print classes and type
  3541 constructors.
  3542 
  3543 * Document antiquotation @{file} checks file/directory entries within
  3544 the local file system.
  3545 
  3546 
  3547 *** HOL ***
  3548 
  3549 * Coercive subtyping: functions can be declared as coercions and type
  3550 inference will add them as necessary upon input of a term.  Theory
  3551 Complex_Main declares real :: nat => real and real :: int => real as
  3552 coercions. A coercion function f is declared like this:
  3553 
  3554   declare [[coercion f]]
  3555 
  3556 To lift coercions through type constructors (e.g. from nat => real to
  3557 nat list => real list), map functions can be declared, e.g.
  3558 
  3559   declare [[coercion_map map]]
  3560 
  3561 Currently coercion inference is activated only in theories including
  3562 real numbers, i.e. descendants of Complex_Main.  This is controlled by
  3563 the configuration option "coercion_enabled", e.g. it can be enabled in
  3564 other theories like this:
  3565 
  3566   declare [[coercion_enabled]]
  3567 
  3568 * Command 'partial_function' provides basic support for recursive
  3569 function definitions over complete partial orders.  Concrete instances
  3570 are provided for i) the option type, ii) tail recursion on arbitrary
  3571 types, and iii) the heap monad of Imperative_HOL.  See
  3572 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
  3573 for examples.
  3574 
  3575 * Function package: f.psimps rules are no longer implicitly declared
  3576 as [simp].  INCOMPATIBILITY.
  3577 
  3578 * Datatype package: theorems generated for executable equality (class
  3579 "eq") carry proper names and are treated as default code equations.
  3580 
  3581 * Inductive package: now offers command 'inductive_simps' to
  3582 automatically derive instantiated and simplified equations for
  3583 inductive predicates, similar to 'inductive_cases'.
  3584 
  3585 * Command 'enriched_type' allows to register properties of the
  3586 functorial structure of types.
  3587 
  3588 * Improved infrastructure for term evaluation using code generator
  3589 techniques, in particular static evaluation conversions.
  3590 
  3591 * Code generator: Scala (2.8 or higher) has been added to the target
  3592 languages.
  3593 
  3594 * Code generator: globbing constant expressions "*" and "Theory.*"
  3595 have been replaced by the more idiomatic "_" and "Theory._".
  3596 INCOMPATIBILITY.
  3597 
  3598 * Code generator: export_code without explicit file declaration prints
  3599 to standard output.  INCOMPATIBILITY.
  3600 
  3601 * Code generator: do not print function definitions for case
  3602 combinators any longer.
  3603 
  3604 * Code generator: simplification with rules determined with
  3605 src/Tools/Code/code_simp.ML and method "code_simp".
  3606 
  3607 * Code generator for records: more idiomatic representation of record
  3608 types.  Warning: records are not covered by ancient SML code
  3609 generation any longer.  INCOMPATIBILITY.  In cases of need, a suitable
  3610 rep_datatype declaration helps to succeed then:
  3611 
  3612   record 'a foo = ...
  3613   ...
  3614   rep_datatype foo_ext ...
  3615 
  3616 * Records: logical foundation type for records does not carry a
  3617 '_type' suffix any longer (obsolete due to authentic syntax).
  3618 INCOMPATIBILITY.
  3619 
  3620 * Quickcheck now by default uses exhaustive testing instead of random
  3621 testing.  Random testing can be invoked by "quickcheck [random]",
  3622 exhaustive testing by "quickcheck [exhaustive]".
  3623 
  3624 * Quickcheck instantiates polymorphic types with small finite
  3625 datatypes by default. This enables a simple execution mechanism to
  3626 handle quantifiers and function equality over the finite datatypes.
  3627 
  3628 * Quickcheck random generator has been renamed from "code" to
  3629 "random".  INCOMPATIBILITY.
  3630 
  3631 * Quickcheck now has a configurable time limit which is set to 30
  3632 seconds by default. This can be changed by adding [timeout = n] to the
  3633 quickcheck command. The time limit for Auto Quickcheck is still set
  3634 independently.
  3635 
  3636 * Quickcheck in locales considers interpretations of that locale for
  3637 counter example search.
  3638 
  3639 * Sledgehammer:
  3640   - Added "smt" and "remote_smt" provers based on the "smt" proof
  3641     method. See the Sledgehammer manual for details ("isabelle doc
  3642     sledgehammer").
  3643   - Renamed commands:
  3644     sledgehammer atp_info ~> sledgehammer running_provers
  3645     sledgehammer atp_kill ~> sledgehammer kill_provers
  3646     sledgehammer available_atps ~> sledgehammer available_provers
  3647     INCOMPATIBILITY.
  3648   - Renamed options:
  3649     sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
  3650     sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
  3651     sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
  3652     (and "ms" and "min" are no longer supported)
  3653     INCOMPATIBILITY.
  3654 
  3655 * Nitpick:
  3656   - Renamed options:
  3657     nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
  3658     nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
  3659     INCOMPATIBILITY.
  3660   - Added support for partial quotient types.
  3661   - Added local versions of the "Nitpick.register_xxx" functions.
  3662   - Added "whack" option.
  3663   - Allow registration of quotient types as codatatypes.
  3664   - Improved "merge_type_vars" option to merge more types.
  3665   - Removed unsound "fast_descrs" option.
  3666   - Added custom symmetry breaking for datatypes, making it possible to reach
  3667     higher cardinalities.
  3668   - Prevent the expansion of too large definitions.
  3669 
  3670 * Proof methods "metis" and "meson" now have configuration options
  3671 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
  3672 to diagnose these tools. E.g.
  3673 
  3674     using [[metis_trace = true]]
  3675 
  3676 * Auto Solve: Renamed "Auto Solve Direct".  The tool is now available
  3677 manually as command 'solve_direct'.
  3678 
  3679 * The default SMT solver Z3 must be enabled explicitly (due to
  3680 licensing issues) by setting the environment variable
  3681 Z3_NON_COMMERCIAL in etc/settings of the component, for example.  For
  3682 commercial applications, the SMT solver CVC3 is provided as fall-back;
  3683 changing the SMT solver is done via the configuration option
  3684 "smt_solver".
  3685 
  3686 * Remote SMT solvers need to be referred to by the "remote_" prefix,
  3687 i.e. "remote_cvc3" and "remote_z3".
  3688 
  3689 * Added basic SMT support for datatypes, records, and typedefs using
  3690 the oracle mode (no proofs).  Direct support of pairs has been dropped
  3691 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
  3692 support for a similar behavior).  Minor INCOMPATIBILITY.
  3693 
  3694 * Changed SMT configuration options:
  3695   - Renamed:
  3696     z3_proofs ~> smt_oracle (with inverted meaning)
  3697     z3_trace_assms ~> smt_trace_used_facts
  3698     INCOMPATIBILITY.
  3699   - Added:
  3700     smt_verbose
  3701     smt_random_seed
  3702     smt_datatypes
  3703     smt_infer_triggers
  3704     smt_monomorph_limit
  3705     cvc3_options
  3706     remote_cvc3_options
  3707     remote_z3_options
  3708     yices_options
  3709 
  3710 * Boogie output files (.b2i files) need to be declared in the theory
  3711 header.
  3712 
  3713 * Simplification procedure "list_to_set_comprehension" rewrites list
  3714 comprehensions applied to List.set to set comprehensions.  Occasional
  3715 INCOMPATIBILITY, may be deactivated like this:
  3716 
  3717   declare [[simproc del: list_to_set_comprehension]]
  3718 
  3719 * Removed old version of primrec package.  INCOMPATIBILITY.
  3720 
  3721 * Removed simplifier congruence rule of "prod_case", as has for long
  3722 been the case with "split".  INCOMPATIBILITY.
  3723 
  3724 * String.literal is a type, but not a datatype.  INCOMPATIBILITY.
  3725 
  3726 * Removed [split_format ... and ... and ...] version of
  3727 [split_format].  Potential INCOMPATIBILITY.
  3728 
  3729 * Predicate "sorted" now defined inductively, with nice induction
  3730 rules.  INCOMPATIBILITY: former sorted.simps now named sorted_simps.
  3731 
  3732 * Constant "contents" renamed to "the_elem", to free the generic name
  3733 contents for other uses.  INCOMPATIBILITY.
  3734 
  3735 * Renamed class eq and constant eq (for code generation) to class
  3736 equal and constant equal, plus renaming of related facts and various
  3737 tuning.  INCOMPATIBILITY.
  3738 
  3739 * Dropped type classes mult_mono and mult_mono1.  INCOMPATIBILITY.
  3740 
  3741 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
  3742 INCOMPATIBILITY.
  3743 
  3744 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
  3745 avoid confusion with finite sets.  INCOMPATIBILITY.
  3746 
  3747 * Abandoned locales equiv, congruent and congruent2 for equivalence
  3748 relations.  INCOMPATIBILITY: use equivI rather than equiv_intro (same
  3749 for congruent(2)).
  3750 
  3751 * Some previously unqualified names have been qualified:
  3752 
  3753   types
  3754     bool ~> HOL.bool
  3755     nat ~> Nat.nat
  3756 
  3757   constants
  3758     Trueprop ~> HOL.Trueprop
  3759     True ~> HOL.True
  3760     False ~> HOL.False
  3761     op & ~> HOL.conj
  3762     op | ~> HOL.disj
  3763     op --> ~> HOL.implies
  3764     op = ~> HOL.eq
  3765     Not ~> HOL.Not
  3766     The ~> HOL.The
  3767     All ~> HOL.All
  3768     Ex ~> HOL.Ex
  3769     Ex1 ~> HOL.Ex1
  3770     Let ~> HOL.Let
  3771     If ~> HOL.If
  3772     Ball ~> Set.Ball
  3773     Bex ~> Set.Bex
  3774     Suc ~> Nat.Suc
  3775     Pair ~> Product_Type.Pair
  3776     fst ~> Product_Type.fst
  3777     snd ~> Product_Type.snd
  3778     curry ~> Product_Type.curry
  3779     op : ~> Set.member
  3780     Collect ~> Set.Collect
  3781 
  3782 INCOMPATIBILITY.
  3783 
  3784 * More canonical naming convention for some fundamental definitions:
  3785 
  3786     bot_bool_eq ~> bot_bool_def
  3787     top_bool_eq ~> top_bool_def
  3788     inf_bool_eq ~> inf_bool_def
  3789     sup_bool_eq ~> sup_bool_def
  3790     bot_fun_eq  ~> bot_fun_def
  3791     top_fun_eq  ~> top_fun_def
  3792     inf_fun_eq  ~> inf_fun_def
  3793     sup_fun_eq  ~> sup_fun_def
  3794 
  3795 INCOMPATIBILITY.
  3796 
  3797 * More stylized fact names:
  3798 
  3799   expand_fun_eq ~> fun_eq_iff
  3800   expand_set_eq ~> set_eq_iff
  3801   set_ext       ~> set_eqI
  3802   nat_number    ~> eval_nat_numeral
  3803 
  3804 INCOMPATIBILITY.
  3805 
  3806 * Refactoring of code-generation specific operations in theory List:
  3807 
  3808   constants
  3809     null ~> List.null
  3810 
  3811   facts
  3812     mem_iff ~> member_def
  3813     null_empty ~> null_def
  3814 
  3815 INCOMPATIBILITY.  Note that these were not supposed to be used
  3816 regularly unless for striking reasons; their main purpose was code
  3817 generation.
  3818 
  3819 Various operations from the Haskell prelude are used for generating
  3820 Haskell code.
  3821 
  3822 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV".  Term
  3823 "surj f" is now an abbreviation of "range f = UNIV".  The theorems
  3824 bij_def and surj_def are unchanged.  INCOMPATIBILITY.
  3825 
  3826 * Abolished some non-alphabetic type names: "prod" and "sum" replace
  3827 "*" and "+" respectively.  INCOMPATIBILITY.
  3828 
  3829 * Name "Plus" of disjoint sum operator "<+>" is now hidden.  Write
  3830 "Sum_Type.Plus" instead.
  3831 
  3832 * Constant "split" has been merged with constant "prod_case"; names of
  3833 ML functions, facts etc. involving split have been retained so far,
  3834 though.  INCOMPATIBILITY.
  3835 
  3836 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
  3837 instead.  INCOMPATIBILITY.
  3838 
  3839 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
  3840 INCOMPATIBILITY.
  3841 
  3842 * Former theory Library/Enum is now part of the HOL-Main image.
  3843 INCOMPATIBILITY: all constants of the Enum theory now have to be
  3844 referred to by its qualified name.
  3845 
  3846   enum    ~>  Enum.enum
  3847   nlists  ~>  Enum.nlists
  3848   product ~>  Enum.product
  3849 
  3850 * Theory Library/Monad_Syntax provides do-syntax for monad types.
  3851 Syntax in Library/State_Monad has been changed to avoid ambiguities.
  3852 INCOMPATIBILITY.
  3853 
  3854 * Theory Library/SetsAndFunctions has been split into
  3855 Library/Function_Algebras and Library/Set_Algebras; canonical names
  3856 for instance definitions for functions; various improvements.
  3857 INCOMPATIBILITY.
  3858 
  3859 * Theory Library/Multiset provides stable quicksort implementation of
  3860 sort_key.
  3861 
  3862 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
  3863 INCOMPATIBILITY.
  3864 
  3865 * Session Multivariate_Analysis: introduced a type class for euclidean
  3866 space.  Most theorems are now stated in terms of euclidean spaces
  3867 instead of finite cartesian products.
  3868 
  3869   types
  3870     real ^ 'n ~>  'a::real_vector
  3871               ~>  'a::euclidean_space
  3872               ~>  'a::ordered_euclidean_space
  3873         (depends on your needs)
  3874 
  3875   constants
  3876      _ $ _        ~> _ $$ _
  3877      \<chi> x. _  ~> \<chi>\<chi> x. _
  3878      CARD('n)     ~> DIM('a)
  3879 
  3880 Also note that the indices are now natural numbers and not from some
  3881 finite type. Finite cartesian products of euclidean spaces, products
  3882 of euclidean spaces the real and complex numbers are instantiated to
  3883 be euclidean_spaces.  INCOMPATIBILITY.
  3884 
  3885 * Session Probability: introduced pextreal as positive extended real
  3886 numbers.  Use pextreal as value for measures.  Introduce the
  3887 Radon-Nikodym derivative, product spaces and Fubini's theorem for
  3888 arbitrary sigma finite measures.  Introduces Lebesgue measure based on
  3889 the integral in Multivariate Analysis.  INCOMPATIBILITY.
  3890 
  3891 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
  3892 INCOMPATIBILITY.
  3893 
  3894 * Session SPARK (with image HOL-SPARK) provides commands to load and
  3895 prove verification conditions generated by the SPARK Ada program
  3896 verifier.  See also src/HOL/SPARK and src/HOL/SPARK/Examples.
  3897 
  3898 
  3899 *** HOL-Algebra ***
  3900 
  3901 * Theorems for additive ring operations (locale abelian_monoid and
  3902 descendants) are generated by interpretation from their multiplicative
  3903 counterparts.  Names (in particular theorem names) have the mandatory
  3904 qualifier 'add'.  Previous theorem names are redeclared for
  3905 compatibility.
  3906 
  3907 * Structure "int_ring" is now an abbreviation (previously a
  3908 definition).  This fits more natural with advanced interpretations.
  3909 
  3910 
  3911 *** HOLCF ***
  3912 
  3913 * The domain package now runs in definitional mode by default: The
  3914 former command 'new_domain' is now called 'domain'.  To use the domain
  3915 package in its original axiomatic mode, use 'domain (unsafe)'.
  3916 INCOMPATIBILITY.
  3917 
  3918 * The new class "domain" is now the default sort.  Class "predomain"
  3919 is an unpointed version of "domain". Theories can be updated by
  3920 replacing sort annotations as shown below.  INCOMPATIBILITY.
  3921 
  3922   'a::type ~> 'a::countable
  3923   'a::cpo  ~> 'a::predomain
  3924   'a::pcpo ~> 'a::domain
  3925 
  3926 * The old type class "rep" has been superseded by class "domain".
  3927 Accordingly, users of the definitional package must remove any
  3928 "default_sort rep" declarations.  INCOMPATIBILITY.
  3929 
  3930 * The domain package (definitional mode) now supports unpointed
  3931 predomain argument types, as long as they are marked 'lazy'. (Strict
  3932 arguments must be in class "domain".) For example, the following
  3933 domain definition now works:
  3934 
  3935   domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
  3936 
  3937 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
  3938 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
  3939 'a option, and 'a list.  Additionally, it configures fixrec and the
  3940 domain package to work with these types.  For example:
  3941 
  3942   fixrec isInl :: "('a + 'b) u -> tr"
  3943     where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
  3944 
  3945   domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
  3946 
  3947 * The "(permissive)" option of fixrec has been replaced with a
  3948 per-equation "(unchecked)" option. See
  3949 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
  3950 
  3951 * The "bifinite" class no longer fixes a constant "approx"; the class
  3952 now just asserts that such a function exists.  INCOMPATIBILITY.
  3953 
  3954 * Former type "alg_defl" has been renamed to "defl".  HOLCF no longer
  3955 defines an embedding of type 'a defl into udom by default; instances
  3956 of "bifinite" and "domain" classes are available in
  3957 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
  3958 
  3959 * The syntax "REP('a)" has been replaced with "DEFL('a)".
  3960 
  3961 * The predicate "directed" has been removed.  INCOMPATIBILITY.
  3962 
  3963 * The type class "finite_po" has been removed.  INCOMPATIBILITY.
  3964 
  3965 * The function "cprod_map" has been renamed to "prod_map".
  3966 INCOMPATIBILITY.
  3967 
  3968 * The monadic bind operator on each powerdomain has new binder syntax
  3969 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
  3970 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
  3971 
  3972 * The infix syntax for binary union on each powerdomain has changed
  3973 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
  3974 syntax.  INCOMPATIBILITY.
  3975 
  3976 * The constant "UU" has been renamed to "bottom".  The syntax "UU" is
  3977 still supported as an input translation.
  3978 
  3979 * Renamed some theorems (the original names are also still available).
  3980 
  3981   expand_fun_below   ~> fun_below_iff
  3982   below_fun_ext      ~> fun_belowI
  3983   expand_cfun_eq     ~> cfun_eq_iff
  3984   ext_cfun           ~> cfun_eqI
  3985   expand_cfun_below  ~> cfun_below_iff
  3986   below_cfun_ext     ~> cfun_belowI
  3987   cont2cont_Rep_CFun ~> cont2cont_APP
  3988 
  3989 * The Abs and Rep functions for various types have changed names.
  3990 Related theorem names have also changed to match. INCOMPATIBILITY.
  3991 
  3992   Rep_CFun  ~> Rep_cfun
  3993   Abs_CFun  ~> Abs_cfun
  3994   Rep_Sprod ~> Rep_sprod
  3995   Abs_Sprod ~> Abs_sprod
  3996   Rep_Ssum  ~> Rep_ssum
  3997   Abs_Ssum  ~> Abs_ssum
  3998 
  3999 * Lemmas with names of the form *_defined_iff or *_strict_iff have
  4000 been renamed to *_bottom_iff.  INCOMPATIBILITY.
  4001 
  4002 * Various changes to bisimulation/coinduction with domain package:
  4003 
  4004   - Definitions of "bisim" constants no longer mention definedness.
  4005   - With mutual recursion, "bisim" predicate is now curried.
  4006   - With mutual recursion, each type gets a separate coind theorem.
  4007   - Variable names in bisim_def and coinduct rules have changed.
  4008 
  4009 INCOMPATIBILITY.
  4010 
  4011 * Case combinators generated by the domain package for type "foo" are
  4012 now named "foo_case" instead of "foo_when".  INCOMPATIBILITY.
  4013 
  4014 * Several theorems have been renamed to more accurately reflect the
  4015 names of constants and types involved.  INCOMPATIBILITY.
  4016 
  4017   thelub_const    ~> lub_const
  4018   lub_const       ~> is_lub_const
  4019   thelubI         ~> lub_eqI
  4020   is_lub_lub      ~> is_lubD2
  4021   lubI            ~> is_lub_lub
  4022   unique_lub      ~> is_lub_unique
  4023   is_ub_lub       ~> is_lub_rangeD1
  4024   lub_bin_chain   ~> is_lub_bin_chain
  4025   lub_fun         ~> is_lub_fun
  4026   thelub_fun      ~> lub_fun
  4027   thelub_cfun     ~> lub_cfun
  4028   thelub_Pair     ~> lub_Pair
  4029   lub_cprod       ~> is_lub_prod
  4030   thelub_cprod    ~> lub_prod
  4031   minimal_cprod   ~> minimal_prod
  4032   inst_cprod_pcpo ~> inst_prod_pcpo
  4033   UU_I            ~> bottomI
  4034   compact_UU      ~> compact_bottom
  4035   deflation_UU    ~> deflation_bottom
  4036   finite_deflation_UU ~> finite_deflation_bottom
  4037 
  4038 * Many legacy theorem names have been discontinued.  INCOMPATIBILITY.
  4039 
  4040   sq_ord_less_eq_trans ~> below_eq_trans
  4041   sq_ord_eq_less_trans ~> eq_below_trans
  4042   refl_less            ~> below_refl
  4043   trans_less           ~> below_trans
  4044   antisym_less         ~> below_antisym
  4045   antisym_less_inverse ~> po_eq_conv [THEN iffD1]
  4046   box_less             ~> box_below
  4047   rev_trans_less       ~> rev_below_trans
  4048   not_less2not_eq      ~> not_below2not_eq
  4049   less_UU_iff          ~> below_UU_iff
  4050   flat_less_iff        ~> flat_below_iff
  4051   adm_less             ~> adm_below
  4052   adm_not_less         ~> adm_not_below
  4053   adm_compact_not_less ~> adm_compact_not_below
  4054   less_fun_def         ~> below_fun_def
  4055   expand_fun_less      ~> fun_below_iff
  4056   less_fun_ext         ~> fun_belowI
  4057   less_discr_def       ~> below_discr_def
  4058   discr_less_eq        ~> discr_below_eq
  4059   less_unit_def        ~> below_unit_def
  4060   less_cprod_def       ~> below_prod_def
  4061   prod_lessI           ~> prod_belowI
  4062   Pair_less_iff        ~> Pair_below_iff
  4063   fst_less_iff         ~> fst_below_iff
  4064   snd_less_iff         ~> snd_below_iff
  4065   expand_cfun_less     ~> cfun_below_iff
  4066   less_cfun_ext        ~> cfun_belowI
  4067   injection_less       ~> injection_below
  4068   less_up_def          ~> below_up_def
  4069   not_Iup_less         ~> not_Iup_below
  4070   Iup_less             ~> Iup_below
  4071   up_less              ~> up_below
  4072   Def_inject_less_eq   ~> Def_below_Def
  4073   Def_less_is_eq       ~> Def_below_iff
  4074   spair_less_iff       ~> spair_below_iff
  4075   less_sprod           ~> below_sprod
  4076   spair_less           ~> spair_below
  4077   sfst_less_iff        ~> sfst_below_iff
  4078   ssnd_less_iff        ~> ssnd_below_iff
  4079   fix_least_less       ~> fix_least_below
  4080   dist_less_one        ~> dist_below_one
  4081   less_ONE             ~> below_ONE
  4082   ONE_less_iff         ~> ONE_below_iff
  4083   less_sinlD           ~> below_sinlD
  4084   less_sinrD           ~> below_sinrD
  4085 
  4086 
  4087 *** FOL and ZF ***
  4088 
  4089 * All constant names are now qualified internally and use proper
  4090 identifiers, e.g. "IFOL.eq" instead of "op =".  INCOMPATIBILITY.
  4091 
  4092 
  4093 *** ML ***
  4094 
  4095 * Antiquotation @{assert} inlines a function bool -> unit that raises
  4096 Fail if the argument is false.  Due to inlining the source position of
  4097 failed assertions is included in the error output.
  4098 
  4099 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
  4100 text is in practice always evaluated with a stable theory checkpoint.
  4101 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
  4102 
  4103 * Antiquotation @{theory A} refers to theory A from the ancestry of
  4104 the current context, not any accidental theory loader state as before.
  4105 Potential INCOMPATIBILITY, subtle change in semantics.
  4106 
  4107 * Syntax.pretty_priority (default 0) configures the required priority
  4108 of pretty-printed output and thus affects insertion of parentheses.
  4109 
  4110 * Syntax.default_root (default "any") configures the inner syntax
  4111 category (nonterminal symbol) for parsing of terms.
  4112 
  4113 * Former exception Library.UnequalLengths now coincides with
  4114 ListPair.UnequalLengths.
  4115 
  4116 * Renamed structure MetaSimplifier to Raw_Simplifier.  Note that the
  4117 main functionality is provided by structure Simplifier.
  4118 
  4119 * Renamed raw "explode" function to "raw_explode" to emphasize its
  4120 meaning.  Note that internally to Isabelle, Symbol.explode is used in
  4121 almost all situations.
  4122 
  4123 * Discontinued obsolete function sys_error and exception SYS_ERROR.
  4124 See implementation manual for further details on exceptions in
  4125 Isabelle/ML.
  4126 
  4127 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
  4128 meaning.
  4129 
  4130 * Renamed structure PureThy to Pure_Thy and moved most of its
  4131 operations to structure Global_Theory, to emphasize that this is
  4132 rarely-used global-only stuff.
  4133 
  4134 * Discontinued Output.debug.  Minor INCOMPATIBILITY, use plain writeln
  4135 instead (or tracing for high-volume output).
  4136 
  4137 * Configuration option show_question_marks only affects regular pretty
  4138 printing of types and terms, not raw Term.string_of_vname.
  4139 
  4140 * ML_Context.thm and ML_Context.thms are no longer pervasive.  Rare
  4141 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
  4142 @{thms} for most purposes.
  4143 
  4144 * ML structure Unsynchronized is never opened, not even in Isar
  4145 interaction mode as before.  Old Unsynchronized.set etc. have been
  4146 discontinued -- use plain := instead.  This should be *rare* anyway,
  4147 since modern tools always work via official context data, notably
  4148 configuration options.
  4149 
  4150 * Parallel and asynchronous execution requires special care concerning
  4151 interrupts.  Structure Exn provides some convenience functions that
  4152 avoid working directly with raw Interrupt.  User code must not absorb
  4153 interrupts -- intermediate handling (for cleanup etc.) needs to be
  4154 followed by re-raising of the original exception.  Another common
  4155 source of mistakes are "handle _" patterns, which make the meaning of
  4156 the program subject to physical effects of the environment.
  4157 
  4158 
  4159 
  4160 New in Isabelle2009-2 (June 2010)
  4161 ---------------------------------
  4162 
  4163 *** General ***
  4164 
  4165 * Authentic syntax for *all* logical entities (type classes, type
  4166 constructors, term constants): provides simple and robust
  4167 correspondence between formal entities and concrete syntax.  Within
  4168 the parse tree / AST representations, "constants" are decorated by
  4169 their category (class, type, const) and spelled out explicitly with
  4170 their full internal name.
  4171 
  4172 Substantial INCOMPATIBILITY concerning low-level syntax declarations
  4173 and translations (translation rules and translation functions in ML).
  4174 Some hints on upgrading:
  4175 
  4176   - Many existing uses of 'syntax' and 'translations' can be replaced
  4177     by more modern 'type_notation', 'notation' and 'abbreviation',
  4178     which are independent of this issue.
  4179 
  4180   - 'translations' require markup within the AST; the term syntax
  4181     provides the following special forms:
  4182 
  4183       CONST c   -- produces syntax version of constant c from context
  4184       XCONST c  -- literally c, checked as constant from context
  4185       c         -- literally c, if declared by 'syntax'
  4186 
  4187     Plain identifiers are treated as AST variables -- occasionally the
  4188     system indicates accidental variables via the error "rhs contains
  4189     extra variables".
  4190 
  4191     Type classes and type constructors are marked according to their
  4192     concrete syntax.  Some old translations rules need to be written
  4193     for the "type" category, using type constructor application
  4194     instead of pseudo-term application of the default category
  4195     "logic".
  4196 
  4197   - 'parse_translation' etc. in ML may use the following
  4198     antiquotations:
  4199 
  4200       @{class_syntax c}   -- type class c within parse tree / AST
  4201       @{term_syntax c}    -- type constructor c within parse tree / AST
  4202       @{const_syntax c}   -- ML version of "CONST c" above
  4203       @{syntax_const c}   -- literally c (checked wrt. 'syntax' declarations)
  4204 
  4205   - Literal types within 'typed_print_translations', i.e. those *not*
  4206     represented as pseudo-terms are represented verbatim.  Use @{class
  4207     c} or @{type_name c} here instead of the above syntax
  4208     antiquotations.
  4209 
  4210 Note that old non-authentic syntax was based on unqualified base
  4211 names, so all of the above "constant" names would coincide.  Recall
  4212 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
  4213 diagnose syntax problems.
  4214 
  4215 * Type constructors admit general mixfix syntax, not just infix.
  4216 
  4217 * Concrete syntax may be attached to local entities without a proof
  4218 body, too.  This works via regular mixfix annotations for 'fix',
  4219 'def', 'obtain' etc. or via the explicit 'write' command, which is
  4220 similar to the 'notation' command in theory specifications.
  4221 
  4222 * Discontinued unnamed infix syntax (legacy feature for many years) --
  4223 need to specify constant name and syntax separately.  Internal ML
  4224 datatype constructors have been renamed from InfixName to Infix etc.
  4225 Minor INCOMPATIBILITY.
  4226 
  4227 * Schematic theorem statements need to be explicitly markup as such,
  4228 via commands 'schematic_lemma', 'schematic_theorem',
  4229 'schematic_corollary'.  Thus the relevance of the proof is made
  4230 syntactically clear, which impacts performance in a parallel or
  4231 asynchronous interactive environment.  Minor INCOMPATIBILITY.
  4232 
  4233 * Use of cumulative prems via "!" in some proof methods has been
  4234 discontinued (old legacy feature).
  4235 
  4236 * References 'trace_simp' and 'debug_simp' have been replaced by
  4237 configuration options stored in the context. Enabling tracing (the
  4238 case of debugging is similar) in proofs works via
  4239 
  4240   using [[trace_simp = true]]
  4241 
  4242 Tracing is then active for all invocations of the simplifier in
  4243 subsequent goal refinement steps. Tracing may also still be enabled or
  4244 disabled via the ProofGeneral settings menu.
  4245 
  4246 * Separate commands 'hide_class', 'hide_type', 'hide_const',
  4247 'hide_fact' replace the former 'hide' KIND command.  Minor
  4248 INCOMPATIBILITY.
  4249 
  4250 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
  4251 more efficient than combinations with -q1 or -q2.
  4252 
  4253 
  4254 *** Pure ***
  4255 
  4256 * Proofterms record type-class reasoning explicitly, using the
  4257 "unconstrain" operation internally.  This eliminates all sort
  4258 constraints from a theorem and proof, introducing explicit
  4259 OFCLASS-premises.  On the proof term level, this operation is
  4260 automatically applied at theorem boundaries, such that closed proofs
  4261 are always free of sort constraints.  INCOMPATIBILITY for tools that
  4262 inspect proof terms.
  4263 
  4264 * Local theory specifications may depend on extra type variables that
  4265 are not present in the result type -- arguments TYPE('a) :: 'a itself
  4266 are added internally.  For example:
  4267 
  4268   definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
  4269 
  4270 * Predicates of locales introduced by classes carry a mandatory
  4271 "class" prefix.  INCOMPATIBILITY.
  4272 
  4273 * Vacuous class specifications observe default sort.  INCOMPATIBILITY.
  4274 
  4275 * Old 'axclass' command has been discontinued.  INCOMPATIBILITY, use
  4276 'class' instead.
  4277 
  4278 * Command 'code_reflect' allows to incorporate generated ML code into
  4279 runtime environment; replaces immature code_datatype antiquotation.
  4280 INCOMPATIBILITY.
  4281 
  4282 * Code generator: simple concept for abstract datatypes obeying
  4283 invariants.
  4284 
  4285 * Code generator: details of internal data cache have no impact on the
  4286 user space functionality any longer.
  4287 
  4288 * Methods "unfold_locales" and "intro_locales" ignore non-locale
  4289 subgoals.  This is more appropriate for interpretations with 'where'.
  4290 INCOMPATIBILITY.
  4291 
  4292 * Command 'example_proof' opens an empty proof body.  This allows to
  4293 experiment with Isar, without producing any persistent result.
  4294 
  4295 * Commands 'type_notation' and 'no_type_notation' declare type syntax
  4296 within a local theory context, with explicit checking of the
  4297 constructors involved (in contrast to the raw 'syntax' versions).
  4298 
  4299 * Commands 'types' and 'typedecl' now work within a local theory
  4300 context -- without introducing dependencies on parameters or
  4301 assumptions, which is not possible in Isabelle/Pure.
  4302 
  4303 * Command 'defaultsort' has been renamed to 'default_sort', it works
  4304 within a local theory context.  Minor INCOMPATIBILITY.
  4305 
  4306 
  4307 *** HOL ***
  4308 
  4309 * Command 'typedef' now works within a local theory context -- without
  4310 introducing dependencies on parameters or assumptions, which is not
  4311 possible in Isabelle/Pure/HOL.  Note that the logical environment may
  4312 contain multiple interpretations of local typedefs (with different
  4313 non-emptiness proofs), even in a global theory context.
  4314 
  4315 * New package for quotient types.  Commands 'quotient_type' and
  4316 'quotient_definition' may be used for defining types and constants by
  4317 quotient constructions.  An example is the type of integers created by
  4318 quotienting pairs of natural numbers:
  4319 
  4320   fun
  4321     intrel :: "(nat * nat) => (nat * nat) => bool"
  4322   where
  4323     "intrel (x, y) (u, v) = (x + v = u + y)"
  4324 
  4325   quotient_type int = "nat * nat" / intrel
  4326     by (auto simp add: equivp_def expand_fun_eq)
  4327 
  4328   quotient_definition
  4329     "0::int" is "(0::nat, 0::nat)"
  4330 
  4331 The method "lifting" can be used to lift of theorems from the
  4332 underlying "raw" type to the quotient type.  The example
  4333 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
  4334 construction and provides a reasoning infrastructure for finite sets.
  4335 
  4336 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
  4337 clash with new theory Quotient in Main HOL.
  4338 
  4339 * Moved the SMT binding into the main HOL session, eliminating
  4340 separate HOL-SMT session.
  4341 
  4342 * List membership infix mem operation is only an input abbreviation.
  4343 INCOMPATIBILITY.
  4344 
  4345 * Theory Library/Word.thy has been removed.  Use library Word/Word.thy
  4346 for future developements; former Library/Word.thy is still present in
  4347 the AFP entry RSAPPS.
  4348 
  4349 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
  4350 longer shadowed.  INCOMPATIBILITY.
  4351 
  4352 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
  4353 INCOMPATIBILITY.
  4354 
  4355 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
  4356 INCOMPATIBILITY.
  4357 
  4358 * Dropped normalizing_semiring etc; use the facts in semiring classes
  4359 instead.  INCOMPATIBILITY.
  4360 
  4361 * Dropped several real-specific versions of lemmas about floor and
  4362 ceiling; use the generic lemmas from theory "Archimedean_Field"
  4363 instead.  INCOMPATIBILITY.
  4364 
  4365   floor_number_of_eq         ~> floor_number_of
  4366   le_floor_eq_number_of      ~> number_of_le_floor
  4367   le_floor_eq_zero           ~> zero_le_floor
  4368   le_floor_eq_one            ~> one_le_floor
  4369   floor_less_eq_number_of    ~> floor_less_number_of
  4370   floor_less_eq_zero         ~> floor_less_zero
  4371   floor_less_eq_one          ~> floor_less_one
  4372   less_floor_eq_number_of    ~> number_of_less_floor
  4373   less_floor_eq_zero         ~> zero_less_floor
  4374   less_floor_eq_one          ~> one_less_floor
  4375   floor_le_eq_number_of      ~> floor_le_number_of
  4376   floor_le_eq_zero           ~> floor_le_zero
  4377   floor_le_eq_one            ~> floor_le_one
  4378   floor_subtract_number_of   ~> floor_diff_number_of
  4379   floor_subtract_one         ~> floor_diff_one
  4380   ceiling_number_of_eq       ~> ceiling_number_of
  4381   ceiling_le_eq_number_of    ~> ceiling_le_number_of
  4382   ceiling_le_zero_eq         ~> ceiling_le_zero
  4383   ceiling_le_eq_one          ~> ceiling_le_one
  4384   less_ceiling_eq_number_of  ~> number_of_less_ceiling
  4385   less_ceiling_eq_zero       ~> zero_less_ceiling
  4386   less_ceiling_eq_one        ~> one_less_ceiling
  4387   ceiling_less_eq_number_of  ~> ceiling_less_number_of
  4388   ceiling_less_eq_zero       ~> ceiling_less_zero
  4389   ceiling_less_eq_one        ~> ceiling_less_one
  4390   le_ceiling_eq_number_of    ~> number_of_le_ceiling
  4391   le_ceiling_eq_zero         ~> zero_le_ceiling
  4392   le_ceiling_eq_one          ~> one_le_ceiling
  4393   ceiling_subtract_number_of ~> ceiling_diff_number_of
  4394   ceiling_subtract_one       ~> ceiling_diff_one
  4395 
  4396 * Theory "Finite_Set": various folding_XXX locales facilitate the
  4397 application of the various fold combinators on finite sets.
  4398 
  4399 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
  4400 provides abstract red-black tree type which is backed by "RBT_Impl" as
  4401 implementation.  INCOMPATIBILTY.
  4402 
  4403 * Theory Library/Coinductive_List has been removed -- superseded by
  4404 AFP/thys/Coinductive.
  4405 
  4406 * Theory PReal, including the type "preal" and related operations, has
  4407 been removed.  INCOMPATIBILITY.
  4408 
  4409 * Real: new development using Cauchy Sequences.
  4410 
  4411 * Split off theory "Big_Operators" containing setsum, setprod,
  4412 Inf_fin, Sup_fin, Min, Max from theory Finite_Set.  INCOMPATIBILITY.
  4413 
  4414 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
  4415 "Int" etc.  INCOMPATIBILITY.
  4416 
  4417 * Constant Rat.normalize needs to be qualified.  INCOMPATIBILITY.
  4418 
  4419 * New set of rules "ac_simps" provides combined assoc / commute
  4420 rewrites for all interpretations of the appropriate generic locales.
  4421 
  4422 * Renamed theory "OrderedGroup" to "Groups" and split theory
  4423 "Ring_and_Field" into theories "Rings" and "Fields"; for more
  4424 appropriate and more consistent names suitable for name prefixes
  4425 within the HOL theories.  INCOMPATIBILITY.
  4426 
  4427 * Some generic constants have been put to appropriate theories:
  4428   - less_eq, less: Orderings
  4429   - zero, one, plus, minus, uminus, times, abs, sgn: Groups
  4430   - inverse, divide: Rings
  4431 INCOMPATIBILITY.
  4432 
  4433 * More consistent naming of type classes involving orderings (and
  4434 lattices):
  4435 
  4436     lower_semilattice                   ~> semilattice_inf
  4437     upper_semilattice                   ~> semilattice_sup
  4438 
  4439     dense_linear_order                  ~> dense_linorder
  4440 
  4441     pordered_ab_group_add               ~> ordered_ab_group_add
  4442     pordered_ab_group_add_abs           ~> ordered_ab_group_add_abs
  4443     pordered_ab_semigroup_add           ~> ordered_ab_semigroup_add
  4444     pordered_ab_semigroup_add_imp_le    ~> ordered_ab_semigroup_add_imp_le
  4445     pordered_cancel_ab_semigroup_add    ~> ordered_cancel_ab_semigroup_add
  4446     pordered_cancel_comm_semiring       ~> ordered_cancel_comm_semiring
  4447     pordered_cancel_semiring            ~> ordered_cancel_semiring
  4448     pordered_comm_monoid_add            ~> ordered_comm_monoid_add
  4449     pordered_comm_ring                  ~> ordered_comm_ring
  4450     pordered_comm_semiring              ~> ordered_comm_semiring
  4451     pordered_ring                       ~> ordered_ring
  4452     pordered_ring_abs                   ~> ordered_ring_abs
  4453     pordered_semiring                   ~> ordered_semiring
  4454 
  4455     ordered_ab_group_add                ~> linordered_ab_group_add
  4456     ordered_ab_semigroup_add            ~> linordered_ab_semigroup_add
  4457     ordered_cancel_ab_semigroup_add     ~> linordered_cancel_ab_semigroup_add
  4458     ordered_comm_semiring_strict        ~> linordered_comm_semiring_strict
  4459     ordered_field                       ~> linordered_field
  4460     ordered_field_no_lb                 ~> linordered_field_no_lb
  4461     ordered_field_no_ub                 ~> linordered_field_no_ub
  4462     ordered_field_dense_linear_order    ~> dense_linordered_field
  4463     ordered_idom                        ~> linordered_idom
  4464     ordered_ring                        ~> linordered_ring
  4465     ordered_ring_le_cancel_factor       ~> linordered_ring_le_cancel_factor
  4466     ordered_ring_less_cancel_factor     ~> linordered_ring_less_cancel_factor
  4467     ordered_ring_strict                 ~> linordered_ring_strict
  4468     ordered_semidom                     ~> linordered_semidom
  4469     ordered_semiring                    ~> linordered_semiring
  4470     ordered_semiring_1                  ~> linordered_semiring_1
  4471     ordered_semiring_1_strict           ~> linordered_semiring_1_strict
  4472     ordered_semiring_strict             ~> linordered_semiring_strict
  4473 
  4474   The following slightly odd type classes have been moved to a
  4475   separate theory Library/Lattice_Algebras:
  4476 
  4477     lordered_ab_group_add               ~> lattice_ab_group_add
  4478     lordered_ab_group_add_abs           ~> lattice_ab_group_add_abs
  4479     lordered_ab_group_add_meet          ~> semilattice_inf_ab_group_add
  4480     lordered_ab_group_add_join          ~> semilattice_sup_ab_group_add
  4481     lordered_ring                       ~> lattice_ring
  4482 
  4483 INCOMPATIBILITY.
  4484 
  4485 * Refined field classes:
  4486   - classes division_ring_inverse_zero, field_inverse_zero,
  4487     linordered_field_inverse_zero include rule inverse 0 = 0 --
  4488     subsumes former division_by_zero class;
  4489   - numerous lemmas have been ported from field to division_ring.
  4490 INCOMPATIBILITY.
  4491 
  4492 * Refined algebra theorem collections:
  4493   - dropped theorem group group_simps, use algebra_simps instead;
  4494   - dropped theorem group ring_simps, use field_simps instead;
  4495   - proper theorem collection field_simps subsumes former theorem
  4496     groups field_eq_simps and field_simps;
  4497   - dropped lemma eq_minus_self_iff which is a duplicate for
  4498     equal_neg_zero.
  4499 INCOMPATIBILITY.
  4500 
  4501 * Theory Finite_Set and List: some lemmas have been generalized from
  4502 sets to lattices:
  4503 
  4504   fun_left_comm_idem_inter      ~> fun_left_comm_idem_inf
  4505   fun_left_comm_idem_union      ~> fun_left_comm_idem_sup
  4506   inter_Inter_fold_inter        ~> inf_Inf_fold_inf
  4507   union_Union_fold_union        ~> sup_Sup_fold_sup
  4508   Inter_fold_inter              ~> Inf_fold_inf
  4509   Union_fold_union              ~> Sup_fold_sup
  4510   inter_INTER_fold_inter        ~> inf_INFI_fold_inf
  4511   union_UNION_fold_union        ~> sup_SUPR_fold_sup
  4512   INTER_fold_inter              ~> INFI_fold_inf
  4513   UNION_fold_union              ~> SUPR_fold_sup
  4514 
  4515 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
  4516 replaced by the more convenient lemmas Inf_empty and Sup_empty.
  4517 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
  4518 by Inf_insert and Sup_insert.  Lemmas Inf_UNIV and Sup_UNIV replace
  4519 former Inf_Univ and Sup_Univ.  Lemmas inf_top_right and sup_bot_right
  4520 subsume inf_top and sup_bot respectively.  INCOMPATIBILITY.
  4521 
  4522 * Reorganized theory Multiset: swapped notation of pointwise and
  4523 multiset order:
  4524 
  4525   - pointwise ordering is instance of class order with standard syntax
  4526     <= and <;
  4527   - multiset ordering has syntax <=# and <#; partial order properties
  4528     are provided by means of interpretation with prefix
  4529     multiset_order;
  4530   - less duplication, less historical organization of sections,
  4531     conversion from associations lists to multisets, rudimentary code
  4532     generation;
  4533   - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
  4534     if needed.
  4535 
  4536 Renamed:
  4537 
  4538   multiset_eq_conv_count_eq  ~>  multiset_ext_iff
  4539   multi_count_ext  ~>  multiset_ext
  4540   diff_union_inverse2  ~>  diff_union_cancelR
  4541 
  4542 INCOMPATIBILITY.
  4543 
  4544 * Theory Permutation: replaced local "remove" by List.remove1.
  4545 
  4546 * Code generation: ML and OCaml code is decorated with signatures.
  4547 
  4548 * Theory List: added transpose.
  4549 
  4550 * Library/Nat_Bijection.thy is a collection of bijective functions
  4551 between nat and other types, which supersedes the older libraries
  4552 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy.  INCOMPATIBILITY.
  4553 
  4554   Constants:
  4555   Nat_Int_Bij.nat2_to_nat         ~> prod_encode
  4556   Nat_Int_Bij.nat_to_nat2         ~> prod_decode
  4557   Nat_Int_Bij.int_to_nat_bij      ~> int_encode
  4558   Nat_Int_Bij.nat_to_int_bij      ~> int_decode
  4559   Countable.pair_encode           ~> prod_encode
  4560   NatIso.prod2nat                 ~> prod_encode
  4561   NatIso.nat2prod                 ~> prod_decode
  4562   NatIso.sum2nat                  ~> sum_encode
  4563   NatIso.nat2sum                  ~> sum_decode
  4564   NatIso.list2nat                 ~> list_encode
  4565   NatIso.nat2list                 ~> list_decode
  4566   NatIso.set2nat                  ~> set_encode
  4567   NatIso.nat2set                  ~> set_decode
  4568 
  4569   Lemmas:
  4570   Nat_Int_Bij.bij_nat_to_int_bij  ~> bij_int_decode
  4571   Nat_Int_Bij.nat2_to_nat_inj     ~> inj_prod_encode
  4572   Nat_Int_Bij.nat2_to_nat_surj    ~> surj_prod_encode
  4573   Nat_Int_Bij.nat_to_nat2_inj     ~> inj_prod_decode
  4574   Nat_Int_Bij.nat_to_nat2_surj    ~> surj_prod_decode
  4575   Nat_Int_Bij.i2n_n2i_id          ~> int_encode_inverse
  4576   Nat_Int_Bij.n2i_i2n_id          ~> int_decode_inverse
  4577   Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
  4578   Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
  4579   Nat_Int_Bij.inj_nat_to_int_bij  ~> inj_int_encode
  4580   Nat_Int_Bij.inj_int_to_nat_bij  ~> inj_int_decode
  4581   Nat_Int_Bij.bij_nat_to_int_bij  ~> bij_int_encode
  4582   Nat_Int_Bij.bij_int_to_nat_bij  ~> bij_int_decode
  4583 
  4584 * Sledgehammer:
  4585   - Renamed ATP commands:
  4586     atp_info     ~> sledgehammer running_atps
  4587     atp_kill     ~> sledgehammer kill_atps
  4588     atp_messages ~> sledgehammer messages
  4589     atp_minimize ~> sledgehammer minimize
  4590     print_atps   ~> sledgehammer available_atps
  4591     INCOMPATIBILITY.
  4592   - Added user's manual ("isabelle doc sledgehammer").
  4593   - Added option syntax and "sledgehammer_params" to customize
  4594     Sledgehammer's behavior.  See the manual for details.
  4595   - Modified the Isar proof reconstruction code so that it produces
  4596     direct proofs rather than proofs by contradiction.  (This feature
  4597     is still experimental.)
  4598   - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
  4599     full-typed mode.
  4600   - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
  4601 
  4602 * Nitpick:
  4603   - Added and implemented "binary_ints" and "bits" options.
  4604   - Added "std" option and implemented support for nonstandard models.
  4605   - Added and implemented "finitize" option to improve the precision
  4606     of infinite datatypes based on a monotonicity analysis.
  4607   - Added support for quotient types.
  4608   - Added support for "specification" and "ax_specification"
  4609     constructs.
  4610   - Added support for local definitions (for "function" and
  4611     "termination" proofs).
  4612   - Added support for term postprocessors.
  4613   - Optimized "Multiset.multiset" and "FinFun.finfun".
  4614   - Improved efficiency of "destroy_constrs" optimization.
  4615   - Fixed soundness bugs related to "destroy_constrs" optimization and
  4616     record getters.
  4617   - Fixed soundness bug related to higher-order constructors.
  4618   - Fixed soundness bug when "full_descrs" is enabled.
  4619   - Improved precision of set constructs.
  4620   - Added "atoms" option.
  4621   - Added cache to speed up repeated Kodkod invocations on the same
  4622     problems.
  4623   - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
  4624     "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
  4625     "SAT4J_Light".  INCOMPATIBILITY.
  4626   - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
  4627     "sharing_depth", and "show_skolems" options.  INCOMPATIBILITY.
  4628   - Removed "nitpick_intro" attribute.  INCOMPATIBILITY.
  4629 
  4630 * Method "induct" now takes instantiations of the form t, where t is not
  4631   a variable, as a shorthand for "x == t", where x is a fresh variable.
  4632   If this is not intended, t has to be enclosed in parentheses.
  4633   By default, the equalities generated by definitional instantiations
  4634   are pre-simplified, which may cause parameters of inductive cases
  4635   to disappear, or may even delete some of the inductive cases.
  4636   Use "induct (no_simp)" instead of "induct" to restore the old
  4637   behaviour. The (no_simp) option is also understood by the "cases"
  4638   and "nominal_induct" methods, which now perform pre-simplification, too.
  4639   INCOMPATIBILITY.
  4640 
  4641 
  4642 *** HOLCF ***
  4643 
  4644 * Variable names in lemmas generated by the domain package have
  4645 changed; the naming scheme is now consistent with the HOL datatype
  4646 package.  Some proof scripts may be affected, INCOMPATIBILITY.
  4647 
  4648 * The domain package no longer defines the function "foo_copy" for
  4649 recursive domain "foo".  The reach lemma is now stated directly in
  4650 terms of "foo_take".  Lemmas and proofs that mention "foo_copy" must
  4651 be reformulated in terms of "foo_take", INCOMPATIBILITY.
  4652 
  4653 * Most definedness lemmas generated by the domain package (previously
  4654 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
  4655 like "foo$x = UU <-> x = UU", which works better as a simp rule.
  4656 Proofs that used definedness lemmas as intro rules may break,
  4657 potential INCOMPATIBILITY.
  4658 
  4659 * Induction and casedist rules generated by the domain package now
  4660 declare proper case_names (one called "bottom", and one named for each
  4661 constructor).  INCOMPATIBILITY.
  4662 
  4663 * For mutually-recursive domains, separate "reach" and "take_lemma"
  4664 rules are generated for each domain, INCOMPATIBILITY.
  4665 
  4666   foo_bar.reach       ~> foo.reach  bar.reach
  4667   foo_bar.take_lemmas ~> foo.take_lemma  bar.take_lemma
  4668 
  4669 * Some lemmas generated by the domain package have been renamed for
  4670 consistency with the datatype package, INCOMPATIBILITY.
  4671 
  4672   foo.ind        ~> foo.induct
  4673   foo.finite_ind ~> foo.finite_induct
  4674   foo.coind      ~> foo.coinduct
  4675   foo.casedist   ~> foo.exhaust
  4676   foo.exhaust    ~> foo.nchotomy
  4677 
  4678 * For consistency with other definition packages, the fixrec package
  4679 now generates qualified theorem names, INCOMPATIBILITY.
  4680 
  4681   foo_simps  ~> foo.simps
  4682   foo_unfold ~> foo.unfold
  4683   foo_induct ~> foo.induct
  4684 
  4685 * The "fixrec_simp" attribute has been removed.  The "fixrec_simp"
  4686 method and internal fixrec proofs now use the default simpset instead.
  4687 INCOMPATIBILITY.
  4688 
  4689 * The "contlub" predicate has been removed.  Proof scripts should use
  4690 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
  4691 
  4692 * The "admw" predicate has been removed, INCOMPATIBILITY.
  4693 
  4694 * The constants cpair, cfst, and csnd have been removed in favor of
  4695 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
  4696 
  4697 
  4698 *** ML ***
  4699 
  4700 * Antiquotations for basic formal entities:
  4701 
  4702     @{class NAME}         -- type class
  4703     @{class_syntax NAME}  -- syntax representation of the above
  4704 
  4705     @{type_name NAME}     -- logical type
  4706     @{type_abbrev NAME}   -- type abbreviation
  4707     @{nonterminal NAME}   -- type of concrete syntactic category
  4708     @{type_syntax NAME}   -- syntax representation of any of the above
  4709 
  4710     @{const_name NAME}    -- logical constant (INCOMPATIBILITY)
  4711     @{const_abbrev NAME}  -- abbreviated constant
  4712     @{const_syntax NAME}  -- syntax representation of any of the above
  4713 
  4714 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
  4715 syntax constant (cf. 'syntax' command).
  4716 
  4717 * Antiquotation @{make_string} inlines a function to print arbitrary
  4718 values similar to the ML toplevel.  The result is compiler dependent
  4719 and may fall back on "?" in certain situations.
  4720 
  4721 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
  4722 antiquotations @{Isar.state} and @{Isar.goal}.  This replaces impure
  4723 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
  4724 not work with the asynchronous Isar document model.
  4725 
  4726 * Configuration options now admit dynamic default values, depending on
  4727 the context or even global references.
  4728 
  4729 * SHA1.digest digests strings according to SHA-1 (see RFC 3174).  It
  4730 uses an efficient external library if available (for Poly/ML).
  4731 
  4732 * Renamed some important ML structures, while keeping the old names
  4733 for some time as aliases within the structure Legacy:
  4734 
  4735   OuterKeyword  ~>  Keyword
  4736   OuterLex      ~>  Token
  4737   OuterParse    ~>  Parse
  4738   OuterSyntax   ~>  Outer_Syntax
  4739   PrintMode     ~>  Print_Mode
  4740   SpecParse     ~>  Parse_Spec
  4741   ThyInfo       ~>  Thy_Info
  4742   ThyLoad       ~>  Thy_Load
  4743   ThyOutput     ~>  Thy_Output
  4744   TypeInfer     ~>  Type_Infer
  4745 
  4746 Note that "open Legacy" simplifies porting of sources, but forgetting
  4747 to remove it again will complicate porting again in the future.
  4748 
  4749 * Most operations that refer to a global context are named
  4750 accordingly, e.g. Simplifier.global_context or
  4751 ProofContext.init_global.  There are some situations where a global
  4752 context actually works, but under normal circumstances one needs to
  4753 pass the proper local context through the code!
  4754 
  4755 * Discontinued old TheoryDataFun with its copy/init operation -- data
  4756 needs to be pure.  Functor Theory_Data_PP retains the traditional
  4757 Pretty.pp argument to merge, which is absent in the standard
  4758 Theory_Data version.
  4759 
  4760 * Sorts.certify_sort and derived "cert" operations for types and terms
  4761 no longer minimize sorts.  Thus certification at the boundary of the
  4762 inference kernel becomes invariant under addition of class relations,
  4763 which is an important monotonicity principle.  Sorts are now minimized
  4764 in the syntax layer only, at the boundary between the end-user and the
  4765 system.  Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
  4766 explicitly in rare situations.
  4767 
  4768 * Renamed old-style Drule.standard to Drule.export_without_context, to
  4769 emphasize that this is in no way a standard operation.
  4770 INCOMPATIBILITY.
  4771 
  4772 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
  4773 usual for resolution.  Rare INCOMPATIBILITY.
  4774 
  4775 * Renamed varify/unvarify operations to varify_global/unvarify_global
  4776 to emphasize that these only work in a global situation (which is
  4777 quite rare).
  4778 
  4779 * Curried take and drop in library.ML; negative length is interpreted
  4780 as infinity (as in chop).  Subtle INCOMPATIBILITY.
  4781 
  4782 * Proof terms: type substitutions on proof constants now use canonical
  4783 order of type variables.  INCOMPATIBILITY for tools working with proof
  4784 terms.
  4785 
  4786 * Raw axioms/defs may no longer carry sort constraints, and raw defs
  4787 may no longer carry premises.  User-level specifications are
  4788 transformed accordingly by Thm.add_axiom/add_def.
  4789 
  4790 
  4791 *** System ***
  4792 
  4793 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
  4794 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions.  Note that
  4795 proof terms are enabled unconditionally in the new HOL-Proofs image.
  4796 
  4797 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
  4798 feature since Isabelle2009).  Use ISABELLE_PROCESS and ISABELLE_TOOL,
  4799 respectively.
  4800 
  4801 * Old lib/scripts/polyml-platform is superseded by the
  4802 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
  4803 variant, even on a 64 bit machine.  The following example setting
  4804 prefers 64 bit if available:
  4805 
  4806   ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
  4807 
  4808 * The preliminary Isabelle/jEdit application demonstrates the emerging
  4809 Isabelle/Scala layer for advanced prover interaction and integration.
  4810 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
  4811 component.
  4812 
  4813 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
  4814 and Bluesky TeX fonts.  It provides the usual Isabelle symbols,
  4815 similar to the default assignment of the document preparation system
  4816 (cf. isabellesym.sty).  The Isabelle/Scala class Isabelle_System
  4817 provides some operations for direct access to the font without asking
  4818 the user for manual installation.
  4819 
  4820 
  4821 
  4822 New in Isabelle2009-1 (December 2009)
  4823 -------------------------------------
  4824 
  4825 *** General ***
  4826 
  4827 * Discontinued old form of "escaped symbols" such as \\<forall>.  Only
  4828 one backslash should be used, even in ML sources.
  4829 
  4830 
  4831 *** Pure ***
  4832 
  4833 * Locale interpretation propagates mixins along the locale hierarchy.
  4834 The currently only available mixins are the equations used to map
  4835 local definitions to terms of the target domain of an interpretation.
  4836 
  4837 * Reactivated diagnostic command 'print_interps'.  Use "print_interps
  4838 loc" to print all interpretations of locale "loc" in the theory.
  4839 Interpretations in proofs are not shown.
  4840 
  4841 * Thoroughly revised locales tutorial.  New section on conditional
  4842 interpretation.
  4843 
  4844 * On instantiation of classes, remaining undefined class parameters
  4845 are formally declared.  INCOMPATIBILITY.
  4846 
  4847 
  4848 *** Document preparation ***
  4849 
  4850 * New generalized style concept for printing terms: @{foo (style) ...}
  4851 instead of @{foo_style style ...}  (old form is still retained for
  4852 backward compatibility).  Styles can be also applied for
  4853 antiquotations prop, term_type and typeof.
  4854 
  4855 
  4856 *** HOL ***
  4857 
  4858 * New proof method "smt" for a combination of first-order logic with
  4859 equality, linear and nonlinear (natural/integer/real) arithmetic, and
  4860 fixed-size bitvectors; there is also basic support for higher-order
  4861 features (esp. lambda abstractions).  It is an incomplete decision
  4862 procedure based on external SMT solvers using the oracle mechanism;
  4863 for the SMT solver Z3, this method is proof-producing.  Certificates
  4864 are provided to avoid calling the external solvers solely for
  4865 re-checking proofs.  Due to a remote SMT service there is no need for
  4866 installing SMT solvers locally.  See src/HOL/SMT.
  4867 
  4868 * New commands to load and prove verification conditions generated by
  4869 the Boogie program verifier or derived systems (e.g. the Verifying C
  4870 Compiler (VCC) or Spec#).  See src/HOL/Boogie.
  4871 
  4872 * New counterexample generator tool 'nitpick' based on the Kodkod
  4873 relational model finder.  See src/HOL/Tools/Nitpick and
  4874 src/HOL/Nitpick_Examples.
  4875 
  4876 * New commands 'code_pred' and 'values' to invoke the predicate
  4877 compiler and to enumerate values of inductive predicates.
  4878 
  4879 * A tabled implementation of the reflexive transitive closure.
  4880 
  4881 * New implementation of quickcheck uses generic code generator;
  4882 default generators are provided for all suitable HOL types, records
  4883 and datatypes.  Old quickcheck can be re-activated importing theory
  4884 Library/SML_Quickcheck.
  4885 
  4886 * New testing tool Mirabelle for automated proof tools.  Applies
  4887 several tools and tactics like sledgehammer, metis, or quickcheck, to
  4888 every proof step in a theory.  To be used in batch mode via the
  4889 "mirabelle" utility.
  4890 
  4891 * New proof method "sos" (sum of squares) for nonlinear real
  4892 arithmetic (originally due to John Harison). It requires theory
  4893 Library/Sum_Of_Squares.  It is not a complete decision procedure but
  4894 works well in practice on quantifier-free real arithmetic with +, -,
  4895 *, ^, =, <= and <, i.e. boolean combinations of equalities and
  4896 inequalities between polynomials.  It makes use of external
  4897 semidefinite programming solvers.  Method "sos" generates a
  4898 certificate that can be pasted into the proof thus avoiding the need
  4899 to call an external tool every time the proof is checked.  See
  4900 src/HOL/Library/Sum_Of_Squares.
  4901 
  4902 * New method "linarith" invokes existing linear arithmetic decision
  4903 procedure only.
  4904 
  4905 * New command 'atp_minimal' reduces result produced by Sledgehammer.
  4906 
  4907 * New Sledgehammer option "Full Types" in Proof General settings menu.
  4908 Causes full type information to be output to the ATPs.  This slows
  4909 ATPs down considerably but eliminates a source of unsound "proofs"
  4910 that fail later.
  4911 
  4912 * New method "metisFT": A version of metis that uses full type
  4913 information in order to avoid failures of proof reconstruction.
  4914 
  4915 * New evaluator "approximate" approximates an real valued term using
  4916 the same method as the approximation method.
  4917 
  4918 * Method "approximate" now supports arithmetic expressions as
  4919 boundaries of intervals and implements interval splitting and Taylor
  4920 series expansion.
  4921 
  4922 * ML antiquotation @{code_datatype} inserts definition of a datatype
  4923 generated by the code generator; e.g. see src/HOL/Predicate.thy.
  4924 
  4925 * New theory SupInf of the supremum and infimum operators for sets of
  4926 reals.
  4927 
  4928 * New theory Probability, which contains a development of measure
  4929 theory, eventually leading to Lebesgue integration and probability.
  4930 
  4931 * Extended Multivariate Analysis to include derivation and Brouwer's
  4932 fixpoint theorem.
  4933 
  4934 * Reorganization of number theory, INCOMPATIBILITY:
  4935   - new number theory development for nat and int, in theories Divides
  4936     and GCD as well as in new session Number_Theory
  4937   - some constants and facts now suffixed with _nat and _int
  4938     accordingly
  4939   - former session NumberTheory now named Old_Number_Theory, including
  4940     theories Legacy_GCD and Primes (prefer Number_Theory if possible)
  4941   - moved theory Pocklington from src/HOL/Library to
  4942     src/HOL/Old_Number_Theory
  4943 
  4944 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
  4945 lcm of finite and infinite sets. It is shown that they form a complete
  4946 lattice.
  4947 
  4948 * Class semiring_div requires superclass no_zero_divisors and proof of
  4949 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
  4950 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
  4951 generalized to class semiring_div, subsuming former theorems
  4952 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
  4953 zdiv_zmult_zmult2.  div_mult_mult1 is now [simp] by default.
  4954 INCOMPATIBILITY.
  4955 
  4956 * Refinements to lattice classes and sets:
  4957   - less default intro/elim rules in locale variant, more default
  4958     intro/elim rules in class variant: more uniformity
  4959   - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
  4960     le_inf_iff
  4961   - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
  4962     sup_aci)
  4963   - renamed ACI to inf_sup_aci
  4964   - new class "boolean_algebra"
  4965   - class "complete_lattice" moved to separate theory
  4966     "Complete_Lattice"; corresponding constants (and abbreviations)
  4967     renamed and with authentic syntax:
  4968     Set.Inf ~>    Complete_Lattice.Inf
  4969     Set.Sup ~>    Complete_Lattice.Sup
  4970     Set.INFI ~>   Complete_Lattice.INFI
  4971     Set.SUPR ~>   Complete_Lattice.SUPR
  4972     Set.Inter ~>  Complete_Lattice.Inter
  4973     Set.Union ~>  Complete_Lattice.Union
  4974     Set.INTER ~>  Complete_Lattice.INTER
  4975     Set.UNION ~>  Complete_Lattice.UNION
  4976   - authentic syntax for
  4977     Set.Pow
  4978     Set.image
  4979   - mere abbreviations:
  4980     Set.empty               (for bot)
  4981     Set.UNIV                (for top)
  4982     Set.inter               (for inf, formerly Set.Int)
  4983     Set.union               (for sup, formerly Set.Un)
  4984     Complete_Lattice.Inter  (for Inf)
  4985     Complete_Lattice.Union  (for Sup)
  4986     Complete_Lattice.INTER  (for INFI)
  4987     Complete_Lattice.UNION  (for SUPR)
  4988   - object-logic definitions as far as appropriate
  4989 
  4990 INCOMPATIBILITY.  Care is required when theorems Int_subset_iff or
  4991 Un_subset_iff are explicitly deleted as default simp rules; then also
  4992 their lattice counterparts le_inf_iff and le_sup_iff have to be
  4993 deleted to achieve the desired effect.
  4994 
  4995 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
  4996 rules by default any longer; the same applies to min_max.inf_absorb1
  4997 etc.  INCOMPATIBILITY.
  4998 
  4999 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
  5000 pred_set_conv by default.  INCOMPATIBILITY.
  5001 
  5002 * Power operations on relations and functions are now one dedicated
  5003 constant "compow" with infix syntax "^^".  Power operation on
  5004 multiplicative monoids retains syntax "^" and is now defined generic
  5005 in class power.  INCOMPATIBILITY.
  5006 
  5007 * Relation composition "R O S" now has a more standard argument order:
  5008 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}".  INCOMPATIBILITY,
  5009 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
  5010 break, since the O_assoc rule was not rewritten like this.  Fix using
  5011 O_assoc[symmetric].  The same applies to the curried version "R OO S".
  5012 
  5013 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
  5014 abbreviation for "inv_into UNIV".  Lemmas are renamed accordingly.
  5015 INCOMPATIBILITY.
  5016 
  5017 * Most rules produced by inductive and datatype package have mandatory
  5018 prefixes.  INCOMPATIBILITY.
  5019 
  5020 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
  5021 the attribute of the same name.  Each of the theorems in the list
  5022 DERIV_intros assumes composition with an additional function and
  5023 matches a variable to the derivative, which has to be solved by the
  5024 Simplifier.  Hence (auto intro!: DERIV_intros) computes the derivative
  5025 of most elementary terms.  Former Maclauren.DERIV_tac and
  5026 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
  5027 INCOMPATIBILITY.
  5028 
  5029 * Code generator attributes follow the usual underscore convention:
  5030     code_unfold     replaces    code unfold
  5031     code_post       replaces    code post
  5032     etc.
  5033   INCOMPATIBILITY.
  5034 
  5035 * Renamed methods:
  5036     sizechange -> size_change
  5037     induct_scheme -> induction_schema
  5038   INCOMPATIBILITY.
  5039 
  5040 * Discontinued abbreviation "arbitrary" of constant "undefined".
  5041 INCOMPATIBILITY, use "undefined" directly.
  5042 
  5043 * Renamed theorems:
  5044     Suc_eq_add_numeral_1 -> Suc_eq_plus1
  5045     Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
  5046     Suc_plus1 -> Suc_eq_plus1
  5047     *anti_sym -> *antisym*
  5048     vector_less_eq_def -> vector_le_def
  5049   INCOMPATIBILITY.
  5050 
  5051 * Added theorem List.map_map as [simp].  Removed List.map_compose.
  5052 INCOMPATIBILITY.
  5053 
  5054 * Removed predicate "M hassize n" (<--> card M = n & finite M).
  5055 INCOMPATIBILITY.
  5056 
  5057 
  5058 *** HOLCF ***
  5059 
  5060 * Theory Representable defines a class "rep" of domains that are
  5061 representable (via an ep-pair) in the universal domain type "udom".
  5062 Instances are provided for all type constructors defined in HOLCF.
  5063 
  5064 * The 'new_domain' command is a purely definitional version of the
  5065 domain package, for representable domains.  Syntax is identical to the
  5066 old domain package.  The 'new_domain' package also supports indirect
  5067 recursion using previously-defined type constructors.  See
  5068 src/HOLCF/ex/New_Domain.thy for examples.
  5069 
  5070 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
  5071 on the left-hand side of an equation, and then performs
  5072 simplification.  Rewriting is done using rules declared with the
  5073 "fixrec_simp" attribute.  The "fixrec_simp" method is intended as a
  5074 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
  5075 
  5076 * The pattern-match compiler in 'fixrec' can now handle constructors
  5077 with HOL function types.  Pattern-match combinators for the Pair
  5078 constructor are pre-configured.
  5079 
  5080 * The 'fixrec' package now produces better fixed-point induction rules
  5081 for mutually-recursive definitions:  Induction rules have conclusions
  5082 of the form "P foo bar" instead of "P <foo, bar>".
  5083 
  5084 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
  5085 been renamed to "below".  The name "below" now replaces "less" in many
  5086 theorem names.  (Legacy theorem names using "less" are still supported
  5087 as well.)
  5088 
  5089 * The 'fixrec' package now supports "bottom patterns".  Bottom
  5090 patterns can be used to generate strictness rules, or to make
  5091 functions more strict (much like the bang-patterns supported by the
  5092 Glasgow Haskell Compiler).  See src/HOLCF/ex/Fixrec_ex.thy for
  5093 examples.
  5094 
  5095 
  5096 *** ML ***
  5097 
  5098 * Support for Poly/ML 5.3.0, with improved reporting of compiler
  5099 errors and run-time exceptions, including detailed source positions.
  5100 
  5101 * Structure Name_Space (formerly NameSpace) now manages uniquely
  5102 identified entries, with some additional information such as source
  5103 position, logical grouping etc.
  5104 
  5105 * Theory and context data is now introduced by the simplified and
  5106 modernized functors Theory_Data, Proof_Data, Generic_Data.  Data needs
  5107 to be pure, but the old TheoryDataFun for mutable data (with explicit
  5108 copy operation) is still available for some time.
  5109 
  5110 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
  5111 provides a high-level programming interface to synchronized state
  5112 variables with atomic update.  This works via pure function
  5113 application within a critical section -- its runtime should be as
  5114 short as possible; beware of deadlocks if critical code is nested,
  5115 either directly or indirectly via other synchronized variables!
  5116 
  5117 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
  5118 wraps raw ML references, explicitly indicating their non-thread-safe
  5119 behaviour.  The Isar toplevel keeps this structure open, to
  5120 accommodate Proof General as well as quick and dirty interactive
  5121 experiments with references.
  5122 
  5123 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
  5124 parallel tactical reasoning.
  5125 
  5126 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
  5127 are similar to SUBPROOF, but are slightly more flexible: only the
  5128 specified parts of the subgoal are imported into the context, and the
  5129 body tactic may introduce new subgoals and schematic variables.
  5130 
  5131 * Old tactical METAHYPS, which does not observe the proof context, has
  5132 been renamed to Old_Goals.METAHYPS and awaits deletion.  Use SUBPROOF
  5133 or Subgoal.FOCUS etc.
  5134 
  5135 * Renamed functor TableFun to Table, and GraphFun to Graph.  (Since
  5136 functors have their own ML name space there is no point to mark them
  5137 separately.)  Minor INCOMPATIBILITY.
  5138 
  5139 * Renamed NamedThmsFun to Named_Thms.  INCOMPATIBILITY.
  5140 
  5141 * Renamed several structures FooBar to Foo_Bar.  Occasional,
  5142 INCOMPATIBILITY.
  5143 
  5144 * Operations of structure Skip_Proof no longer require quick_and_dirty
  5145 mode, which avoids critical setmp.
  5146 
  5147 * Eliminated old Attrib.add_attributes, Method.add_methods and related
  5148 combinators for "args".  INCOMPATIBILITY, need to use simplified
  5149 Attrib/Method.setup introduced in Isabelle2009.
  5150 
  5151 * Proper context for simpset_of, claset_of, clasimpset_of.  May fall
  5152 back on global_simpset_of, global_claset_of, global_clasimpset_of as
  5153 last resort.  INCOMPATIBILITY.
  5154 
  5155 * Display.pretty_thm now requires a proper context (cf. former
  5156 ProofContext.pretty_thm).  May fall back on Display.pretty_thm_global
  5157 or even Display.pretty_thm_without_context as last resort.
  5158 INCOMPATIBILITY.
  5159 
  5160 * Discontinued Display.pretty_ctyp/cterm etc.  INCOMPATIBILITY, use
  5161 Syntax.pretty_typ/term directly, preferably with proper context
  5162 instead of global theory.
  5163 
  5164 
  5165 *** System ***
  5166 
  5167 * Further fine tuning of parallel proof checking, scales up to 8 cores
  5168 (max. speedup factor 5.0).  See also Goal.parallel_proofs in ML and
  5169 usedir option -q.
  5170 
  5171 * Support for additional "Isabelle components" via etc/components, see
  5172 also the system manual.
  5173 
  5174 * The isabelle makeall tool now operates on all components with
  5175 IsaMakefile, not just hardwired "logics".
  5176 
  5177 * Removed "compress" option from isabelle-process and isabelle usedir;
  5178 this is always enabled.
  5179 
  5180 * Discontinued support for Poly/ML 4.x versions.
  5181 
  5182 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
  5183 on a given logic image.  This requires the lighttpd webserver and is
  5184 currently supported on Linux only.
  5185 
  5186 
  5187 
  5188 New in Isabelle2009 (April 2009)
  5189 --------------------------------
  5190 
  5191 *** General ***
  5192 
  5193 * Simplified main Isabelle executables, with less surprises on
  5194 case-insensitive file-systems (such as Mac OS).
  5195 
  5196   - The main Isabelle tool wrapper is now called "isabelle" instead of
  5197     "isatool."
  5198 
  5199   - The former "isabelle" alias for "isabelle-process" has been
  5200     removed (should rarely occur to regular users).
  5201 
  5202   - The former "isabelle-interface" and its alias "Isabelle" have been
  5203     removed (interfaces are now regular Isabelle tools).
  5204 
  5205 Within scripts and make files, the Isabelle environment variables
  5206 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
  5207 respectively.  (The latter are still available as legacy feature.)
  5208 
  5209 The old isabelle-interface wrapper could react in confusing ways if
  5210 the interface was uninstalled or changed otherwise.  Individual
  5211 interface tool configuration is now more explicit, see also the
  5212 Isabelle system manual.  In particular, Proof General is now available
  5213 via "isabelle emacs".
  5214 
  5215 INCOMPATIBILITY, need to adapt derivative scripts.  Users may need to
  5216 purge installed copies of Isabelle executables and re-run "isabelle
  5217 install -p ...", or use symlinks.
  5218 
  5219 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
  5220 old ~/isabelle, which was slightly non-standard and apt to cause
  5221 surprises on case-insensitive file-systems (such as Mac OS).
  5222 
  5223 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
  5224 ~/isabelle/heaps, ~/isabelle/browser_info to the new place.  Special
  5225 care is required when using older releases of Isabelle.  Note that
  5226 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
  5227 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
  5228 
  5229 * Proofs of fully specified statements are run in parallel on
  5230 multi-core systems.  A speedup factor of 2.5 to 3.2 can be expected on
  5231 a regular 4-core machine, if the initial heap space is made reasonably
  5232 large (cf. Poly/ML option -H).  (Requires Poly/ML 5.2.1 or later.)
  5233 
  5234 * The main reference manuals ("isar-ref", "implementation", and
  5235 "system") have been updated and extended.  Formally checked references
  5236 as hyperlinks are now available uniformly.
  5237 
  5238 
  5239 *** Pure ***
  5240 
  5241 * Complete re-implementation of locales.  INCOMPATIBILITY in several
  5242 respects.  The most important changes are listed below.  See the
  5243 Tutorial on Locales ("locales" manual) for details.
  5244 
  5245 - In locale expressions, instantiation replaces renaming.  Parameters
  5246 must be declared in a for clause.  To aid compatibility with previous
  5247 parameter inheritance, in locale declarations, parameters that are not
  5248 'touched' (instantiation position "_" or omitted) are implicitly added
  5249 with their syntax at the beginning of the for clause.
  5250 
  5251 - Syntax from abbreviations and definitions in locales is available in
  5252 locale expressions and context elements.  The latter is particularly
  5253 useful in locale declarations.
  5254 
  5255 - More flexible mechanisms to qualify names generated by locale
  5256 expressions.  Qualifiers (prefixes) may be specified in locale
  5257 expressions, and can be marked as mandatory (syntax: "name!:") or
  5258 optional (syntax "name?:").  The default depends for plain "name:"
  5259 depends on the situation where a locale expression is used: in
  5260 commands 'locale' and 'sublocale' prefixes are optional, in
  5261 'interpretation' and 'interpret' prefixes are mandatory.  The old
  5262 implicit qualifiers derived from the parameter names of a locale are
  5263 no longer generated.
  5264 
  5265 - Command "sublocale l < e" replaces "interpretation l < e".  The
  5266 instantiation clause in "interpretation" and "interpret" (square
  5267 brackets) is no longer available.  Use locale expressions.
  5268 
  5269 - When converting proof scripts, mandatory qualifiers in
  5270 'interpretation' and 'interpret' should be retained by default, even
  5271 if this is an INCOMPATIBILITY compared to former behavior.  In the
  5272 worst case, use the "name?:" form for non-mandatory ones.  Qualifiers
  5273 in locale expressions range over a single locale instance only.
  5274 
  5275 - Dropped locale element "includes".  This is a major INCOMPATIBILITY.
  5276 In existing theorem specifications replace the includes element by the
  5277 respective context elements of the included locale, omitting those
  5278 that are already present in the theorem specification.  Multiple
  5279 assume elements of a locale should be replaced by a single one
  5280 involving the locale predicate.  In the proof body, declarations (most
  5281 notably theorems) may be regained by interpreting the respective
  5282 locales in the proof context as required (command "interpret").
  5283 
  5284 If using "includes" in replacement of a target solely because the
  5285 parameter types in the theorem are not as general as in the target,
  5286 consider declaring a new locale with additional type constraints on
  5287 the parameters (context element "constrains").
  5288 
  5289 - Discontinued "locale (open)".  INCOMPATIBILITY.
  5290 
  5291 - Locale interpretation commands no longer attempt to simplify goal.
  5292 INCOMPATIBILITY: in rare situations the generated goal differs.  Use
  5293 methods intro_locales and unfold_locales to clarify.
  5294 
  5295 - Locale interpretation commands no longer accept interpretation
  5296 attributes.  INCOMPATIBILITY.
  5297 
  5298 * Class declaration: so-called "base sort" must not be given in import
  5299 list any longer, but is inferred from the specification.  Particularly
  5300 in HOL, write
  5301 
  5302     class foo = ...
  5303 
  5304 instead of
  5305 
  5306     class foo = type + ...
  5307 
  5308 * Class target: global versions of theorems stemming do not carry a
  5309 parameter prefix any longer.  INCOMPATIBILITY.
  5310 
  5311 * Class 'instance' command no longer accepts attached definitions.
  5312 INCOMPATIBILITY, use proper 'instantiation' target instead.
  5313 
  5314 * Recovered hiding of consts, which was accidentally broken in
  5315 Isabelle2007.  Potential INCOMPATIBILITY, ``hide const c'' really
  5316 makes c inaccessible; consider using ``hide (open) const c'' instead.
  5317 
  5318 * Slightly more coherent Pure syntax, with updated documentation in
  5319 isar-ref manual.  Removed locales meta_term_syntax and
  5320 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
  5321 INCOMPATIBILITY in rare situations.  Note that &&& should not be used
  5322 directly in regular applications.
  5323 
  5324 * There is a new syntactic category "float_const" for signed decimal
  5325 fractions (e.g. 123.45 or -123.45).
  5326 
  5327 * Removed exotic 'token_translation' command.  INCOMPATIBILITY, use ML
  5328 interface with 'setup' command instead.
  5329 
  5330 * Command 'local_setup' is similar to 'setup', but operates on a local
  5331 theory context.
  5332 
  5333 * The 'axiomatization' command now only works within a global theory
  5334 context.  INCOMPATIBILITY.
  5335 
  5336 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
  5337 hypotheses.  Sorts required in the course of reasoning need to be
  5338 covered by the constraints in the initial statement, completed by the
  5339 type instance information of the background theory.  Non-trivial sort
  5340 hypotheses, which rarely occur in practice, may be specified via
  5341 vacuous propositions of the form SORT_CONSTRAINT('a::c).  For example:
  5342 
  5343   lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
  5344 
  5345 The result contains an implicit sort hypotheses as before --
  5346 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
  5347 normalization.
  5348 
  5349 * Generalized Isar history, with support for linear undo, direct state
  5350 addressing etc.
  5351 
  5352 * Changed defaults for unify configuration options:
  5353 
  5354   unify_trace_bound = 50 (formerly 25)
  5355   unify_search_bound = 60 (formerly 30)
  5356 
  5357 * Different bookkeeping for code equations (INCOMPATIBILITY):
  5358 
  5359   a) On theory merge, the last set of code equations for a particular
  5360      constant is taken (in accordance with the policy applied by other
  5361      parts of the code generator framework).
  5362 
  5363   b) Code equations stemming from explicit declarations (e.g. code
  5364      attribute) gain priority over default code equations stemming
  5365      from definition, primrec, fun etc.
  5366 
  5367 * Keyword 'code_exception' now named 'code_abort'.  INCOMPATIBILITY.
  5368 
  5369 * Unified theorem tables for both code generators.  Thus [code
  5370 func] has disappeared and only [code] remains.  INCOMPATIBILITY.
  5371 
  5372 * Command 'find_consts' searches for constants based on type and name
  5373 patterns, e.g.
  5374 
  5375     find_consts "_ => bool"
  5376 
  5377 By default, matching is against subtypes, but it may be restricted to
  5378 the whole type.  Searching by name is possible.  Multiple queries are
  5379 conjunctive and queries may be negated by prefixing them with a
  5380 hyphen:
  5381 
  5382     find_consts strict: "_ => bool" name: "Int" -"int => int"
  5383 
  5384 * New 'find_theorems' criterion "solves" matches theorems that
  5385 directly solve the current goal (modulo higher-order unification).
  5386 
  5387 * Auto solve feature for main theorem statements: whenever a new goal
  5388 is stated, "find_theorems solves" is called; any theorems that could
  5389 solve the lemma directly are listed as part of the goal state.
  5390 Cf. associated options in Proof General Isabelle settings menu,
  5391 enabled by default, with reasonable timeout for pathological cases of
  5392 higher-order unification.
  5393 
  5394 
  5395 *** Document preparation ***
  5396 
  5397 * Antiquotation @{lemma} now imitates a regular terminal proof,
  5398 demanding keyword 'by' and supporting the full method expression
  5399 syntax just like the Isar command 'by'.
  5400 
  5401 
  5402 *** HOL ***
  5403 
  5404 * Integrated main parts of former image HOL-Complex with HOL.  Entry
  5405 points Main and Complex_Main remain as before.
  5406 
  5407 * Logic image HOL-Plain provides a minimal HOL with the most important
  5408 tools available (inductive, datatype, primrec, ...).  This facilitates
  5409 experimentation and tool development.  Note that user applications
  5410 (and library theories) should never refer to anything below theory
  5411 Main, as before.
  5412 
  5413 * Logic image HOL-Main stops at theory Main, and thus facilitates
  5414 experimentation due to shorter build times.
  5415 
  5416 * Logic image HOL-NSA contains theories of nonstandard analysis which
  5417 were previously part of former HOL-Complex.  Entry point Hyperreal
  5418 remains valid, but theories formerly using Complex_Main should now use
  5419 new entry point Hypercomplex.
  5420 
  5421 * Generic ATP manager for Sledgehammer, based on ML threads instead of
  5422 Posix processes.  Avoids potentially expensive forking of the ML
  5423 process.  New thread-based implementation also works on non-Unix
  5424 platforms (Cygwin).  Provers are no longer hardwired, but defined
  5425 within the theory via plain ML wrapper functions.  Basic Sledgehammer
  5426 commands are covered in the isar-ref manual.
  5427 
  5428 * Wrapper scripts for remote SystemOnTPTP service allows to use
  5429 sledgehammer without local ATP installation (Vampire etc.). Other
  5430 provers may be included via suitable ML wrappers, see also
  5431 src/HOL/ATP_Linkup.thy.
  5432 
  5433 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
  5434 menu.
  5435 
  5436 * The metis method no longer fails because the theorem is too trivial
  5437 (contains the empty clause).
  5438 
  5439 * The metis method now fails in the usual manner, rather than raising
  5440 an exception, if it determines that it cannot prove the theorem.
  5441 
  5442 * Method "coherent" implements a prover for coherent logic (see also
  5443 src/Tools/coherent.ML).
  5444 
  5445 * Constants "undefined" and "default" replace "arbitrary".  Usually
  5446 "undefined" is the right choice to replace "arbitrary", though
  5447 logically there is no difference.  INCOMPATIBILITY.
  5448 
  5449 * Command "value" now integrates different evaluation mechanisms.  The
  5450 result of the first successful evaluation mechanism is printed.  In
  5451 square brackets a particular named evaluation mechanisms may be
  5452 specified (currently, [SML], [code] or [nbe]).  See further
  5453 src/HOL/ex/Eval_Examples.thy.
  5454 
  5455 * Normalization by evaluation now allows non-leftlinear equations.
  5456 Declare with attribute [code nbe].
  5457 
  5458 * Methods "case_tac" and "induct_tac" now refer to the very same rules
  5459 as the structured Isar versions "cases" and "induct", cf. the
  5460 corresponding "cases" and "induct" attributes.  Mutual induction rules
  5461 are now presented as a list of individual projections
  5462 (e.g. foo_bar.inducts for types foo and bar); the old format with
  5463 explicit HOL conjunction is no longer supported.  INCOMPATIBILITY, in
  5464 rare situations a different rule is selected --- notably nested tuple
  5465 elimination instead of former prod.exhaust: use explicit (case_tac t
  5466 rule: prod.exhaust) here.
  5467 
  5468 * Attributes "cases", "induct", "coinduct" support "del" option.
  5469 
  5470 * Removed fact "case_split_thm", which duplicates "case_split".
  5471 
  5472 * The option datatype has been moved to a new theory Option.  Renamed
  5473 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
  5474 
  5475 * New predicate "strict_mono" classifies strict functions on partial
  5476 orders.  With strict functions on linear orders, reasoning about
  5477 (in)equalities is facilitated by theorems "strict_mono_eq",
  5478 "strict_mono_less_eq" and "strict_mono_less".
  5479 
  5480 * Some set operations are now proper qualified constants with
  5481 authentic syntax.  INCOMPATIBILITY:
  5482 
  5483     op Int ~>   Set.Int
  5484     op Un ~>    Set.Un
  5485     INTER ~>    Set.INTER
  5486     UNION ~>    Set.UNION
  5487     Inter ~>    Set.Inter
  5488     Union ~>    Set.Union
  5489     {} ~>       Set.empty
  5490     UNIV ~>     Set.UNIV
  5491 
  5492 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
  5493 theory Set.
  5494 
  5495 * Auxiliary class "itself" has disappeared -- classes without any
  5496 parameter are treated as expected by the 'class' command.
  5497 
  5498 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
  5499 
  5500 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
  5501 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
  5502 
  5503 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
  5504 method "approximation".  It proves formulas on real values by using
  5505 interval arithmetic.  In the formulas are also the transcendental
  5506 functions sin, cos, tan, atan, ln, exp and the constant pi are
  5507 allowed. For examples see
  5508 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
  5509 
  5510 * Theory "Reflection" now resides in HOL/Library.
  5511 
  5512 * Entry point to Word library now simply named "Word".
  5513 INCOMPATIBILITY.
  5514 
  5515 * Made source layout more coherent with logical distribution
  5516 structure:
  5517 
  5518     src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
  5519     src/HOL/Library/Code_Message.thy ~> src/HOL/
  5520     src/HOL/Library/GCD.thy ~> src/HOL/
  5521     src/HOL/Library/Order_Relation.thy ~> src/HOL/
  5522     src/HOL/Library/Parity.thy ~> src/HOL/
  5523     src/HOL/Library/Univ_Poly.thy ~> src/HOL/
  5524     src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
  5525     src/HOL/Real/Lubs.thy ~> src/HOL/
  5526     src/HOL/Real/PReal.thy ~> src/HOL/
  5527     src/HOL/Real/Rational.thy ~> src/HOL/
  5528     src/HOL/Real/RComplete.thy ~> src/HOL/
  5529     src/HOL/Real/RealDef.thy ~> src/HOL/
  5530     src/HOL/Real/RealPow.thy ~> src/HOL/
  5531     src/HOL/Real/Real.thy ~> src/HOL/
  5532     src/HOL/Complex/Complex_Main.thy ~> src/HOL/
  5533     src/HOL/Complex/Complex.thy ~> src/HOL/
  5534     src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
  5535     src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
  5536     src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
  5537     src/HOL/Hyperreal/Fact.thy ~> src/HOL/
  5538     src/HOL/Hyperreal/Integration.thy ~> src/HOL/
  5539     src/HOL/Hyperreal/Lim.thy ~> src/HOL/
  5540     src/HOL/Hyperreal/Ln.thy ~> src/HOL/
  5541     src/HOL/Hyperreal/Log.thy ~> src/HOL/
  5542     src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
  5543     src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
  5544     src/HOL/Hyperreal/Series.thy ~> src/HOL/
  5545     src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
  5546     src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
  5547     src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
  5548     src/HOL/Real/Float ~> src/HOL/Library/
  5549     src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
  5550     src/HOL/Real/RealVector.thy ~> src/HOL/
  5551 
  5552     src/HOL/arith_data.ML ~> src/HOL/Tools
  5553     src/HOL/hologic.ML ~> src/HOL/Tools
  5554     src/HOL/simpdata.ML ~> src/HOL/Tools
  5555     src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
  5556     src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
  5557     src/HOL/nat_simprocs.ML ~> src/HOL/Tools
  5558     src/HOL/Real/float_arith.ML ~> src/HOL/Tools
  5559     src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
  5560     src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
  5561     src/HOL/Real/real_arith.ML ~> src/HOL/Tools
  5562 
  5563     src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
  5564     src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
  5565     src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
  5566     src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
  5567     src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
  5568     src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
  5569 
  5570 * If methods "eval" and "evaluation" encounter a structured proof
  5571 state with !!/==>, only the conclusion is evaluated to True (if
  5572 possible), avoiding strange error messages.
  5573 
  5574 * Method "sizechange" automates termination proofs using (a
  5575 modification of) the size-change principle.  Requires SAT solver.  See
  5576 src/HOL/ex/Termination.thy for examples.
  5577 
  5578 * Simplifier: simproc for let expressions now unfolds if bound
  5579 variable occurs at most once in let expression body.  INCOMPATIBILITY.
  5580 
  5581 * Method "arith": Linear arithmetic now ignores all inequalities when
  5582 fast_arith_neq_limit is exceeded, instead of giving up entirely.
  5583 
  5584 * New attribute "arith" for facts that should always be used
  5585 automatically by arithmetic. It is intended to be used locally in
  5586 proofs, e.g.
  5587 
  5588   assumes [arith]: "x > 0"
  5589 
  5590 Global usage is discouraged because of possible performance impact.
  5591 
  5592 * New classes "top" and "bot" with corresponding operations "top" and
  5593 "bot" in theory Orderings; instantiation of class "complete_lattice"
  5594 requires instantiation of classes "top" and "bot".  INCOMPATIBILITY.
  5595 
  5596 * Changed definition lemma "less_fun_def" in order to provide an
  5597 instance for preorders on functions; use lemma "less_le" instead.
  5598 INCOMPATIBILITY.
  5599 
  5600 * Theory Orderings: class "wellorder" moved here, with explicit
  5601 induction rule "less_induct" as assumption.  For instantiation of
  5602 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
  5603 INCOMPATIBILITY.
  5604 
  5605 * Theory Orderings: added class "preorder" as superclass of "order".
  5606 INCOMPATIBILITY: Instantiation proofs for order, linorder
  5607 etc. slightly changed.  Some theorems named order_class.* now named
  5608 preorder_class.*.
  5609 
  5610 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
  5611 "diag" to "Id_on".
  5612 
  5613 * Theory Finite_Set: added a new fold combinator of type
  5614 
  5615   ('a => 'b => 'b) => 'b => 'a set => 'b
  5616 
  5617 Occasionally this is more convenient than the old fold combinator
  5618 which is now defined in terms of the new one and renamed to
  5619 fold_image.
  5620 
  5621 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
  5622 and "ring_simps" have been replaced by "algebra_simps" (which can be
  5623 extended with further lemmas!).  At the moment both still exist but
  5624 the former will disappear at some point.
  5625 
  5626 * Theory Power: Lemma power_Suc is now declared as a simp rule in
  5627 class recpower.  Type-specific simp rules for various recpower types
  5628 have been removed.  INCOMPATIBILITY, rename old lemmas as follows:
  5629 
  5630 rat_power_0    -> power_0
  5631 rat_power_Suc  -> power_Suc
  5632 realpow_0      -> power_0
  5633 realpow_Suc    -> power_Suc
  5634 complexpow_0   -> power_0
  5635 complexpow_Suc -> power_Suc
  5636 power_poly_0   -> power_0
  5637 power_poly_Suc -> power_Suc
  5638 
  5639 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
  5640 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
  5641 dvd has been generalized to class comm_semiring_1.  Likewise a bunch
  5642 of lemmas from Divides has been generalized from nat to class
  5643 semiring_div.  INCOMPATIBILITY.  This involves the following theorem
  5644 renames resulting from duplicate elimination:
  5645 
  5646     dvd_def_mod ~>          dvd_eq_mod_eq_0
  5647     zero_dvd_iff ~>         dvd_0_left_iff
  5648     dvd_0 ~>                dvd_0_right
  5649     DIVISION_BY_ZERO_DIV ~> div_by_0
  5650     DIVISION_BY_ZERO_MOD ~> mod_by_0
  5651     mult_div ~>             div_mult_self2_is_id
  5652     mult_mod ~>             mod_mult_self2_is_0
  5653 
  5654 * Theory IntDiv: removed many lemmas that are instances of class-based
  5655 generalizations (from Divides and Ring_and_Field).  INCOMPATIBILITY,
  5656 rename old lemmas as follows:
  5657 
  5658 dvd_diff               -> nat_dvd_diff
  5659 dvd_zminus_iff         -> dvd_minus_iff
  5660 mod_add1_eq            -> mod_add_eq
  5661 mod_mult1_eq           -> mod_mult_right_eq
  5662 mod_mult1_eq'          -> mod_mult_left_eq
  5663 mod_mult_distrib_mod   -> mod_mult_eq
  5664 nat_mod_add_left_eq    -> mod_add_left_eq
  5665 nat_mod_add_right_eq   -> mod_add_right_eq
  5666 nat_mod_div_trivial    -> mod_div_trivial
  5667 nat_mod_mod_trivial    -> mod_mod_trivial
  5668 zdiv_zadd_self1        -> div_add_self1
  5669 zdiv_zadd_self2        -> div_add_self2
  5670 zdiv_zmult_self1       -> div_mult_self2_is_id
  5671 zdiv_zmult_self2       -> div_mult_self1_is_id
  5672 zdvd_triv_left         -> dvd_triv_left
  5673 zdvd_triv_right        -> dvd_triv_right
  5674 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
  5675 zmod_eq0_zdvd_iff      -> dvd_eq_mod_eq_0[symmetric]
  5676 zmod_zadd_left_eq      -> mod_add_left_eq
  5677 zmod_zadd_right_eq     -> mod_add_right_eq
  5678 zmod_zadd_self1        -> mod_add_self1
  5679 zmod_zadd_self2        -> mod_add_self2
  5680 zmod_zadd1_eq          -> mod_add_eq
  5681 zmod_zdiff1_eq         -> mod_diff_eq
  5682 zmod_zdvd_zmod         -> mod_mod_cancel
  5683 zmod_zmod_cancel       -> mod_mod_cancel
  5684 zmod_zmult_self1       -> mod_mult_self2_is_0
  5685 zmod_zmult_self2       -> mod_mult_self1_is_0
  5686 zmod_1                 -> mod_by_1
  5687 zdiv_1                 -> div_by_1
  5688 zdvd_abs1              -> abs_dvd_iff
  5689 zdvd_abs2              -> dvd_abs_iff
  5690 zdvd_refl              -> dvd_refl
  5691 zdvd_trans             -> dvd_trans
  5692 zdvd_zadd              -> dvd_add
  5693 zdvd_zdiff             -> dvd_diff
  5694 zdvd_zminus_iff        -> dvd_minus_iff
  5695 zdvd_zminus2_iff       -> minus_dvd_iff
  5696 zdvd_zmultD            -> dvd_mult_right
  5697 zdvd_zmultD2           -> dvd_mult_left
  5698 zdvd_zmult_mono        -> mult_dvd_mono
  5699 zdvd_0_right           -> dvd_0_right
  5700 zdvd_0_left            -> dvd_0_left_iff
  5701 zdvd_1_left            -> one_dvd
  5702 zminus_dvd_iff         -> minus_dvd_iff
  5703 
  5704 * Theory Rational: 'Fract k 0' now equals '0'.  INCOMPATIBILITY.
  5705 
  5706 * The real numbers offer decimal input syntax: 12.34 is translated
  5707 into 1234/10^2. This translation is not reversed upon output.
  5708 
  5709 * Theory Library/Polynomial defines an abstract type 'a poly of
  5710 univariate polynomials with coefficients of type 'a.  In addition to
  5711 the standard ring operations, it also supports div and mod.  Code
  5712 generation is also supported, using list-style constructors.
  5713 
  5714 * Theory Library/Inner_Product defines a class of real_inner for real
  5715 inner product spaces, with an overloaded operation inner :: 'a => 'a
  5716 => real.  Class real_inner is a subclass of real_normed_vector from
  5717 theory RealVector.
  5718 
  5719 * Theory Library/Product_Vector provides instances for the product
  5720 type 'a * 'b of several classes from RealVector and Inner_Product.
  5721 Definitions of addition, subtraction, scalar multiplication, norms,
  5722 and inner products are included.
  5723 
  5724 * Theory Library/Bit defines the field "bit" of integers modulo 2.  In
  5725 addition to the field operations, numerals and case syntax are also
  5726 supported.
  5727 
  5728 * Theory Library/Diagonalize provides constructive version of Cantor's
  5729 first diagonalization argument.
  5730 
  5731 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
  5732 zlcm (for int); carried together from various gcd/lcm developements in
  5733 the HOL Distribution.  Constants zgcd and zlcm replace former igcd and
  5734 ilcm; corresponding theorems renamed accordingly.  INCOMPATIBILITY,
  5735 may recover tupled syntax as follows:
  5736 
  5737     hide (open) const gcd
  5738     abbreviation gcd where
  5739       "gcd == (%(a, b). GCD.gcd a b)"
  5740     notation (output)
  5741       GCD.gcd ("gcd '(_, _')")
  5742 
  5743 The same works for lcm, zgcd, zlcm.
  5744 
  5745 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
  5746 instantiations for algebraic structures.  Removed some duplicate
  5747 theorems.  Changes in simp rules.  INCOMPATIBILITY.
  5748 
  5749 * ML antiquotation @{code} takes a constant as argument and generates
  5750 corresponding code in background and inserts name of the corresponding
  5751 resulting ML value/function/datatype constructor binding in place.
  5752 All occurrences of @{code} with a single ML block are generated
  5753 simultaneously.  Provides a generic and safe interface for
  5754 instrumentalizing code generation.  See
  5755 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
  5756 In future you ought to refrain from ad-hoc compiling generated SML
  5757 code on the ML toplevel.  Note that (for technical reasons) @{code}
  5758 cannot refer to constants for which user-defined serializations are
  5759 set.  Refer to the corresponding ML counterpart directly in that
  5760 cases.
  5761 
  5762 * Command 'rep_datatype': instead of theorem names the command now
  5763 takes a list of terms denoting the constructors of the type to be
  5764 represented as datatype.  The characteristic theorems have to be
  5765 proven.  INCOMPATIBILITY.  Also observe that the following theorems
  5766 have disappeared in favour of existing ones:
  5767 
  5768     unit_induct                 ~> unit.induct
  5769     prod_induct                 ~> prod.induct
  5770     sum_induct                  ~> sum.induct
  5771     Suc_Suc_eq                  ~> nat.inject
  5772     Suc_not_Zero Zero_not_Suc   ~> nat.distinct
  5773 
  5774 
  5775 *** HOL-Algebra ***
  5776 
  5777 * New locales for orders and lattices where the equivalence relation
  5778 is not restricted to equality.  INCOMPATIBILITY: all order and lattice
  5779 locales use a record structure with field eq for the equivalence.
  5780 
  5781 * New theory of factorial domains.
  5782 
  5783 * Units_l_inv and Units_r_inv are now simp rules by default.
  5784 INCOMPATIBILITY.  Simplifier proof that require deletion of l_inv
  5785 and/or r_inv will now also require deletion of these lemmas.
  5786 
  5787 * Renamed the following theorems, INCOMPATIBILITY:
  5788 
  5789 UpperD ~> Upper_memD
  5790 LowerD ~> Lower_memD
  5791 least_carrier ~> least_closed
  5792 greatest_carrier ~> greatest_closed
  5793 greatest_Lower_above ~> greatest_Lower_below
  5794 one_zero ~> carrier_one_zero
  5795 one_not_zero ~> carrier_one_not_zero  (collision with assumption)
  5796 
  5797 
  5798 *** HOL-Nominal ***
  5799 
  5800 * Nominal datatypes can now contain type-variables.
  5801 
  5802 * Commands 'nominal_inductive' and 'equivariance' work with local
  5803 theory targets.
  5804 
  5805 * Nominal primrec can now works with local theory targets and its
  5806 specification syntax now conforms to the general format as seen in
  5807 'inductive' etc.
  5808 
  5809 * Method "perm_simp" honours the standard simplifier attributes
  5810 (no_asm), (no_asm_use) etc.
  5811 
  5812 * The new predicate #* is defined like freshness, except that on the
  5813 left hand side can be a set or list of atoms.
  5814 
  5815 * Experimental command 'nominal_inductive2' derives strong induction
  5816 principles for inductive definitions.  In contrast to
  5817 'nominal_inductive', which can only deal with a fixed number of
  5818 binders, it can deal with arbitrary expressions standing for sets of
  5819 atoms to be avoided.  The only inductive definition we have at the
  5820 moment that needs this generalisation is the typing rule for Lets in
  5821 the algorithm W:
  5822 
  5823  Gamma |- t1 : T1   (x,close Gamma T1)::Gamma |- t2 : T2   x#Gamma
  5824  -----------------------------------------------------------------
  5825          Gamma |- Let x be t1 in t2 : T2
  5826 
  5827 In this rule one wants to avoid all the binders that are introduced by
  5828 "close Gamma T1".  We are looking for other examples where this
  5829 feature might be useful.  Please let us know.
  5830 
  5831 
  5832 *** HOLCF ***
  5833 
  5834 * Reimplemented the simplification procedure for proving continuity
  5835 subgoals.  The new simproc is extensible; users can declare additional
  5836 continuity introduction rules with the attribute [cont2cont].
  5837 
  5838 * The continuity simproc now uses a different introduction rule for
  5839 solving continuity subgoals on terms with lambda abstractions.  In
  5840 some rare cases the new simproc may fail to solve subgoals that the
  5841 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
  5842 Potential INCOMPATIBILITY.
  5843 
  5844 * Command 'fixrec': specification syntax now conforms to the general
  5845 format as seen in 'inductive' etc.  See src/HOLCF/ex/Fixrec_ex.thy for
  5846 examples.  INCOMPATIBILITY.
  5847 
  5848 
  5849 *** ZF ***
  5850 
  5851 * Proof of Zorn's Lemma for partial orders.
  5852 
  5853 
  5854 *** ML ***
  5855 
  5856 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
  5857 Poly/ML 5.2.1 or later.  Important note: the TimeLimit facility
  5858 depends on multithreading, so timouts will not work before Poly/ML
  5859 5.2.1!
  5860 
  5861 * High-level support for concurrent ML programming, see
  5862 src/Pure/Cuncurrent.  The data-oriented model of "future values" is
  5863 particularly convenient to organize independent functional
  5864 computations.  The concept of "synchronized variables" provides a
  5865 higher-order interface for components with shared state, avoiding the
  5866 delicate details of mutexes and condition variables.  (Requires
  5867 Poly/ML 5.2.1 or later.)
  5868 
  5869 * ML bindings produced via Isar commands are stored within the Isar
  5870 context (theory or proof).  Consequently, commands like 'use' and 'ML'
  5871 become thread-safe and work with undo as expected (concerning
  5872 top-level bindings, not side-effects on global references).
  5873 INCOMPATIBILITY, need to provide proper Isar context when invoking the
  5874 compiler at runtime; really global bindings need to be given outside a
  5875 theory.  (Requires Poly/ML 5.2 or later.)
  5876 
  5877 * Command 'ML_prf' is analogous to 'ML' but works within a proof
  5878 context.  Top-level ML bindings are stored within the proof context in
  5879 a purely sequential fashion, disregarding the nested proof structure.
  5880 ML bindings introduced by 'ML_prf' are discarded at the end of the
  5881 proof.  (Requires Poly/ML 5.2 or later.)
  5882 
  5883 * Simplified ML attribute and method setup, cf. functions Attrib.setup
  5884 and Method.setup, as well as Isar commands 'attribute_setup' and
  5885 'method_setup'.  INCOMPATIBILITY for 'method_setup', need to simplify
  5886 existing code accordingly, or use plain 'setup' together with old
  5887 Method.add_method.
  5888 
  5889 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
  5890 to 'a -> thm, while results are always tagged with an authentic oracle
  5891 name.  The Isar command 'oracle' is now polymorphic, no argument type
  5892 is specified.  INCOMPATIBILITY, need to simplify existing oracle code
  5893 accordingly.  Note that extra performance may be gained by producing
  5894 the cterm carefully, avoiding slow Thm.cterm_of.
  5895 
  5896 * Simplified interface for defining document antiquotations via
  5897 ThyOutput.antiquotation, ThyOutput.output, and optionally
  5898 ThyOutput.maybe_pretty_source.  INCOMPATIBILITY, need to simplify user
  5899 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
  5900 examples.
  5901 
  5902 * More systematic treatment of long names, abstract name bindings, and
  5903 name space operations.  Basic operations on qualified names have been
  5904 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
  5905 Long_Name.append.  Old type bstring has been mostly replaced by
  5906 abstract type binding (see structure Binding), which supports precise
  5907 qualification by packages and local theory targets, as well as proper
  5908 tracking of source positions.  INCOMPATIBILITY, need to wrap old
  5909 bstring values into Binding.name, or better pass through abstract
  5910 bindings everywhere.  See further src/Pure/General/long_name.ML,
  5911 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
  5912 
  5913 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
  5914 LocalTheory.note etc.) now refer to the *full* internal name, not the
  5915 bstring as before.  INCOMPATIBILITY, not detected by ML type-checking!
  5916 
  5917 * Disposed old type and term read functions (Sign.read_def_typ,
  5918 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
  5919 Thm.read_def_cterms, Thm.read_cterm etc.).  INCOMPATIBILITY, should
  5920 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
  5921 Syntax.read_term_global etc.; see also OldGoals.read_term as last
  5922 resort for legacy applications.
  5923 
  5924 * Disposed old declarations, tactics, tactic combinators that refer to
  5925 the simpset or claset of an implicit theory (such as Addsimps,
  5926 Simp_tac, SIMPSET).  INCOMPATIBILITY, should use @{simpset} etc. in
  5927 embedded ML text, or local_simpset_of with a proper context passed as
  5928 explicit runtime argument.
  5929 
  5930 * Rules and tactics that read instantiations (read_instantiate,
  5931 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
  5932 context, which is required for parsing and type-checking.  Moreover,
  5933 the variables are specified as plain indexnames, not string encodings
  5934 thereof.  INCOMPATIBILITY.
  5935 
  5936 * Generic Toplevel.add_hook interface allows to analyze the result of
  5937 transactions.  E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
  5938 for theorem dependency output of transactions resulting in a new
  5939 theory state.
  5940 
  5941 * ML antiquotations: block-structured compilation context indicated by
  5942 \<lbrace> ... \<rbrace>; additional antiquotation forms:
  5943 
  5944   @{binding name}                         - basic name binding
  5945   @{let ?pat = term}                      - term abbreviation (HO matching)
  5946   @{note name = fact}                     - fact abbreviation
  5947   @{thm fact}                             - singleton fact (with attributes)
  5948   @{thms fact}                            - general fact (with attributes)
  5949   @{lemma prop by method}                 - singleton goal
  5950   @{lemma prop by meth1 meth2}            - singleton goal
  5951   @{lemma prop1 ... propN by method}      - general goal
  5952   @{lemma prop1 ... propN by meth1 meth2} - general goal
  5953   @{lemma (open) ...}                     - open derivation
  5954 
  5955 
  5956 *** System ***
  5957 
  5958 * The Isabelle "emacs" tool provides a specific interface to invoke
  5959 Proof General / Emacs, with more explicit failure if that is not
  5960 installed (the old isabelle-interface script silently falls back on
  5961 isabelle-process).  The PROOFGENERAL_HOME setting determines the
  5962 installation location of the Proof General distribution.
  5963 
  5964 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
  5965 the Isabelle process into a JVM/Scala application.  See
  5966 Isabelle/lib/jedit/plugin for a minimal example.  (The obsolete Java
  5967 process wrapper has been discontinued.)
  5968 
  5969 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
  5970 
  5971 * Various status messages (with exact source position information) are
  5972 emitted, if proper markup print mode is enabled.  This allows
  5973 user-interface components to provide detailed feedback on internal
  5974 prover operations.
  5975 
  5976 
  5977 
  5978 New in Isabelle2008 (June 2008)
  5979 -------------------------------
  5980 
  5981 *** General ***
  5982 
  5983 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
  5984 and updated, with formally checked references as hyperlinks.
  5985 
  5986 * Theory loader: use_thy (and similar operations) no longer set the
  5987 implicit ML context, which was occasionally hard to predict and in
  5988 conflict with concurrency.  INCOMPATIBILITY, use ML within Isar which
  5989 provides a proper context already.
  5990 
  5991 * Theory loader: old-style ML proof scripts being *attached* to a thy
  5992 file are no longer supported.  INCOMPATIBILITY, regular 'uses' and
  5993 'use' within a theory file will do the job.
  5994 
  5995 * Name space merge now observes canonical order, i.e. the second space
  5996 is inserted into the first one, while existing entries in the first
  5997 space take precedence.  INCOMPATIBILITY in rare situations, may try to
  5998 swap theory imports.
  5999 
  6000 * Syntax: symbol \<chi> is now considered a letter.  Potential
  6001 INCOMPATIBILITY in identifier syntax etc.
  6002 
  6003 * Outer syntax: string tokens no longer admit escaped white space,
  6004 which was an accidental (undocumented) feature.  INCOMPATIBILITY, use
  6005 white space without escapes.
  6006 
  6007 * Outer syntax: string tokens may contain arbitrary character codes
  6008 specified via 3 decimal digits (as in SML).  E.g. "foo\095bar" for
  6009 "foo_bar".
  6010 
  6011 
  6012 *** Pure ***
  6013 
  6014 * Context-dependent token translations.  Default setup reverts locally
  6015 fixed variables, and adds hilite markup for undeclared frees.
  6016 
  6017 * Unused theorems can be found using the new command 'unused_thms'.
  6018 There are three ways of invoking it:
  6019 
  6020 (1) unused_thms
  6021      Only finds unused theorems in the current theory.
  6022 
  6023 (2) unused_thms thy_1 ... thy_n -
  6024      Finds unused theorems in the current theory and all of its ancestors,
  6025      excluding the theories thy_1 ... thy_n and all of their ancestors.
  6026 
  6027 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
  6028      Finds unused theorems in the theories thy'_1 ... thy'_m and all of
  6029      their ancestors, excluding the theories thy_1 ... thy_n and all of
  6030      their ancestors.
  6031 
  6032 In order to increase the readability of the list produced by
  6033 unused_thms, theorems that have been created by a particular instance
  6034 of a theory command such as 'inductive' or 'function' are considered
  6035 to belong to the same "group", meaning that if at least one theorem in
  6036 this group is used, the other theorems in the same group are no longer
  6037 reported as unused.  Moreover, if all theorems in the group are
  6038 unused, only one theorem in the group is displayed.
  6039 
  6040 Note that proof objects have to be switched on in order for
  6041 unused_thms to work properly (i.e. !proofs must be >= 1, which is
  6042 usually the case when using Proof General with the default settings).
  6043 
  6044 * Authentic naming of facts disallows ad-hoc overwriting of previous
  6045 theorems within the same name space.  INCOMPATIBILITY, need to remove
  6046 duplicate fact bindings, or even accidental fact duplications.  Note
  6047 that tools may maintain dynamically scoped facts systematically, using
  6048 PureThy.add_thms_dynamic.
  6049 
  6050 * Command 'hide' now allows to hide from "fact" name space as well.
  6051 
  6052 * Eliminated destructive theorem database, simpset, claset, and
  6053 clasimpset.  Potential INCOMPATIBILITY, really need to observe linear
  6054 update of theories within ML code.
  6055 
  6056 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
  6057 INCOMPATIBILITY, object-logics depending on former Pure require
  6058 additional setup PureThy.old_appl_syntax_setup; object-logics
  6059 depending on former CPure need to refer to Pure.
  6060 
  6061 * Commands 'use' and 'ML' are now purely functional, operating on
  6062 theory/local_theory.  Removed former 'ML_setup' (on theory), use 'ML'
  6063 instead.  Added 'ML_val' as mere diagnostic replacement for 'ML'.
  6064 INCOMPATIBILITY.
  6065 
  6066 * Command 'setup': discontinued implicit version with ML reference.
  6067 
  6068 * Instantiation target allows for simultaneous specification of class
  6069 instance operations together with an instantiation proof.
  6070 Type-checking phase allows to refer to class operations uniformly.
  6071 See src/HOL/Complex/Complex.thy for an Isar example and
  6072 src/HOL/Library/Eval.thy for an ML example.
  6073 
  6074 * Indexing of literal facts: be more serious about including only
  6075 facts from the visible specification/proof context, but not the
  6076 background context (locale etc.).  Affects `prop` notation and method
  6077 "fact".  INCOMPATIBILITY: need to name facts explicitly in rare
  6078 situations.
  6079 
  6080 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
  6081 "(open)" option, which used to expose internal bound variables to the
  6082 proof text.
  6083 
  6084 * Isar statements: removed obsolete case "rule_context".
  6085 INCOMPATIBILITY, better use explicit fixes/assumes.
  6086 
  6087 * Locale proofs: default proof step now includes 'unfold_locales';
  6088 hence 'proof' without argument may be used to unfold locale
  6089 predicates.
  6090 
  6091 
  6092 *** Document preparation ***
  6093 
  6094 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
  6095 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
  6096 obsolete thumbpdf setup (contemporary PDF viewers do this on the
  6097 spot); renamed link color from "darkblue" to "linkcolor" (default
  6098 value unchanged, can be redefined via \definecolor); no longer sets
  6099 "a4paper" option (unnecessary or even intrusive).
  6100 
  6101 * Antiquotation @{lemma A method} proves proposition A by the given
  6102 method (either a method name or a method name plus (optional) method
  6103 arguments in parentheses) and prints A just like @{prop A}.
  6104 
  6105 
  6106 *** HOL ***
  6107 
  6108 * New primrec package.  Specification syntax conforms in style to
  6109 definition/function/....  No separate induction rule is provided.  The
  6110 "primrec" command distinguishes old-style and new-style specifications
  6111 by syntax.  The former primrec package is now named OldPrimrecPackage.
  6112 When adjusting theories, beware: constants stemming from new-style
  6113 primrec specifications have authentic syntax.
  6114 
  6115 * Metis prover is now an order of magnitude faster, and also works
  6116 with multithreading.
  6117 
  6118 * Metis: the maximum number of clauses that can be produced from a
  6119 theorem is now given by the attribute max_clauses.  Theorems that
  6120 exceed this number are ignored, with a warning printed.
  6121 
  6122 * Sledgehammer no longer produces structured proofs by default. To
  6123 enable, declare [[sledgehammer_full = true]].  Attributes
  6124 reconstruction_modulus, reconstruction_sorts renamed
  6125 sledgehammer_modulus, sledgehammer_sorts.  INCOMPATIBILITY.
  6126 
  6127 * Method "induct_scheme" derives user-specified induction rules
  6128 from well-founded induction and completeness of patterns. This factors
  6129 out some operations that are done internally by the function package
  6130 and makes them available separately.  See
  6131 src/HOL/ex/Induction_Scheme.thy for examples.
  6132 
  6133 * More flexible generation of measure functions for termination
  6134 proofs: Measure functions can be declared by proving a rule of the
  6135 form "is_measure f" and giving it the [measure_function] attribute.
  6136 The "is_measure" predicate is logically meaningless (always true), and
  6137 just guides the heuristic.  To find suitable measure functions, the
  6138 termination prover sets up the goal "is_measure ?f" of the appropriate
  6139 type and generates all solutions by prolog-style backwards proof using
  6140 the declared rules.
  6141 
  6142 This setup also deals with rules like 
  6143 
  6144   "is_measure f ==> is_measure (list_size f)"
  6145 
  6146 which accommodates nested datatypes that recurse through lists.
  6147 Similar rules are predeclared for products and option types.
  6148 
  6149 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
  6150 
  6151   INCOMPATIBILITIES:
  6152 
  6153   - Definitions of overloaded constants on sets have to be replaced by
  6154     definitions on => and bool.
  6155 
  6156   - Some definitions of overloaded operators on sets can now be proved
  6157     using the definitions of the operators on => and bool.  Therefore,
  6158     the following theorems have been renamed:
  6159 
  6160       subset_def   -> subset_eq
  6161       psubset_def  -> psubset_eq
  6162       set_diff_def -> set_diff_eq
  6163       Compl_def    -> Compl_eq
  6164       Sup_set_def  -> Sup_set_eq
  6165       Inf_set_def  -> Inf_set_eq
  6166       sup_set_def  -> sup_set_eq
  6167       inf_set_def  -> inf_set_eq
  6168 
  6169   - Due to the incompleteness of the HO unification algorithm, some
  6170     rules such as subst may require manual instantiation, if some of
  6171     the unknowns in the rule is a set.
  6172 
  6173   - Higher order unification and forward proofs:
  6174     The proof pattern
  6175 
  6176       have "P (S::'a set)" <...>
  6177       then have "EX S. P S" ..
  6178 
  6179     no longer works (due to the incompleteness of the HO unification
  6180     algorithm) and must be replaced by the pattern
  6181 
  6182       have "EX S. P S"
  6183       proof
  6184         show "P S" <...>
  6185       qed
  6186 
  6187   - Calculational reasoning with subst (or similar rules):
  6188     The proof pattern
  6189 
  6190       have "P (S::'a set)" <...>
  6191       also have "S = T" <...>
  6192       finally have "P T" .
  6193 
  6194     no longer works (for similar reasons as the previous example) and
  6195     must be replaced by something like
  6196 
  6197       have "P (S::'a set)" <...>
  6198       moreover have "S = T" <...>
  6199       ultimately have "P T" by simp
  6200 
  6201   - Tactics or packages written in ML code:
  6202     Code performing pattern matching on types via
  6203 
  6204       Type ("set", [T]) => ...
  6205 
  6206     must be rewritten. Moreover, functions like strip_type or
  6207     binder_types no longer return the right value when applied to a
  6208     type of the form
  6209 
  6210       T1 => ... => Tn => U => bool
  6211 
  6212     rather than
  6213 
  6214       T1 => ... => Tn => U set
  6215 
  6216 * Merged theories Wellfounded_Recursion, Accessible_Part and
  6217 Wellfounded_Relations to theory Wellfounded.
  6218 
  6219 * Explicit class "eq" for executable equality.  INCOMPATIBILITY.
  6220 
  6221 * Class finite no longer treats UNIV as class parameter.  Use class
  6222 enum from theory Library/Enum instead to achieve a similar effect.
  6223 INCOMPATIBILITY.
  6224 
  6225 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
  6226 and "Cons".  INCOMPATIBILITY.
  6227 
  6228 * HOL (and FOL): renamed variables in rules imp_elim and swap.
  6229 Potential INCOMPATIBILITY.
  6230 
  6231 * Theory Product_Type: duplicated lemmas split_Pair_apply and
  6232 injective_fst_snd removed, use split_eta and prod_eqI instead.
  6233 Renamed upd_fst to apfst and upd_snd to apsnd.  INCOMPATIBILITY.
  6234 
  6235 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
  6236 the same name in theory Orderings:
  6237 
  6238   less_trans
  6239   less_linear
  6240   le_imp_less_or_eq
  6241   le_less_trans
  6242   less_le_trans
  6243   less_not_sym
  6244   less_asym
  6245 
  6246 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
  6247 less_irrefl_nat.  Potential INCOMPATIBILITY due to more general types
  6248 and different variable names.
  6249 
  6250 * Library/Option_ord.thy: Canonical order on option type.
  6251 
  6252 * Library/RBT.thy: Red-black trees, an efficient implementation of
  6253 finite maps.
  6254 
  6255 * Library/Countable.thy: Type class for countable types.
  6256 
  6257 * Theory Int: The representation of numerals has changed.  The infix
  6258 operator BIT and the bit datatype with constructors B0 and B1 have
  6259 disappeared.  INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
  6260 place of "x BIT bit.B0" and "y BIT bit.B1", respectively.  Theorems
  6261 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
  6262 accordingly.
  6263 
  6264 * Theory Nat: definition of <= and < on natural numbers no longer
  6265 depend on well-founded relations.  INCOMPATIBILITY.  Definitions
  6266 le_def and less_def have disappeared.  Consider lemmas not_less