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