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