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