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