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