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