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