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