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