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