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