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