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