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