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