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