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