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