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