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