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