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