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